oj.uz

Submission #206325

# Submission time Handle Problem Language Result Execution time Memory
206325 2020-03-03T01:20:54 Z wiwiho Trol (COCI19_trol) C++14
30 / 50
 1000 ms 376 KB 
//#define NDEBUG

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define pob pop_back()
#define pof pop_front()
#define F first
#define S second
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tiii tuple<int, int, int>
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) ((a) / (b) + !!((a) % (b)))

//#define TEST

typedef long long ll;
typedef unsigned long long ull;

using namespace std;
using namespace __gnu_pbds;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll calc(ll t){
    ll a = 0;
    while(t > 0){
        a += t % 10;
        t /= 10;
    }
    if(a >= 10) a = calc(a);
    return a;
}

int main(){
    StarBurstStream

    int q;
    cin >> q;
    while(q--){
        ll l, r;
        cin >> l >> r;

        ll ans = 0;
        for(ll i = l; i <= r; i++){
            ans += calc(i);
        }
        cout << ans << "\n";
    }

    return 0;
}

Subtask #1
30.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 7 ms 376 KB Output is correct
4 Execution timed out 1095 ms 376 KB Time limit exceeded
5 Execution timed out 1087 ms 376 KB Time limit exceeded