Source Code
//Includes
#include <bits/stdc++.h>
#include <cstdio> //For input/ouput file
#include <numeric> //For GCD and LCM
#include <iomanip> //For Decimal Points
#include <chrono>

//Marcos
#define fast_io() std::ios::sync_with_stdio(false); std::cin.tie(NULL);
#define TestCases(type) type t; std::cin >> t; while(t--)
#define ArrOne(name, type, size) type* name = new type[size]
#define ArrTwo(name, type, rows, cols) type** name = new type*[rows]; for(int i = 0; i < rows; i++){ name[i] = new type[cols]; }
#define sp(a, b, type) { type temp = a; a = b; b = temp; }
#define PI 3.14159265358979
#define MOD 1000000007
#define ll long long
#define lli long long int
#define ull unsigned long long
#define ld long double
#define li long int
ll getSum(int n) {
    ll s = 0;
    while(n > 0) {
        s += (n % 10);
        n /= 10;
    }
    return s;
}
void solve() {
    ll n; std::cin >> n;
    ll a, sum = 0;
    for(int i = 0; i < n; i++) {
        std::cin >> a;
        sum += a;
    }
    while(sum > 10)
        sum = getSum(sum);
    std::cout << sum << "\n";
}

void testCases() {
    TestCases(int)
        solve();
}

//main function
int main()
{
    //#
    fast_io();
    //#

    //#
    #ifndef ONLINE_JUDGE
        std::freopen("input.txt", "r", stdin);
        std::freopen("output.txt", "w", stdout);
    #endif
    //#

    //testCases();
    solve();

    return 0;
}
Copy
The Tale of a Generous Prince talalomar001
GNU G++17
3 ms
868 KB
Wrong Answer