제출 #377216

#제출 시각아이디문제언어결과실행 시간메모리
377216OptxPrimeTrol (COCI19_trol)C++11
30 / 50
1 ms492 KiB
#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; zadnji--; if( zadnji == 0 ) zadnji = 9; } suma += zadnji; } cout<<suma<<endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...