# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
377216 | OptxPrime | Trol (COCI19_trol) | C++11 | 1 ms | 492 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
using namespace std;
int f( int x )
{
if( x%9 != 0 ) return x%9;
else return 9;
}
int main()
{
int q,l,r, suma;
cin>>q;
for(int i=0;i<q;i++){
cin>>l>>r;
suma = 0;
//cout << nadjiSumu(l,r)<<endl;
int brojBlokova = (r-l+1)/9;
suma = brojBlokova*45;
int visak = (r-l+1)%9;
if( visak!=0 ){
int zadnji = f(r);
int prvi = f(l);
while( zadnji != prvi ){
suma += zadnji;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |