# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
976438 | 2024-05-06T14:54:03 Z | vjudge1 | Trol (COCI19_trol) | C++17 | 1000 ms | 412 KB |
#include<bits/stdc++.h> #define ll long long #define nitro ios_base::sync_with_stdio;cin.tie(0);cout.tie(0); using namespace std; ll l[101],r[101]; int q; ll findone(int target){ ll temp; bool brenti=false; ll pangkat; ll ans=0; while(!brenti){ ans+=target%10; target/=10; if(target==0){ brenti=true; } } if(ans>=10){ return findone(ans); } return ans; } ll findall(ll l,ll r){ ll ans=0; for(int i=l;i<=r;i++){ ans+=findone(i); } return ans; } int main(){ cin>>q; for(int i=1;i<=q;i++){ cin>>l[i]>>r[i]; cout<<findall(l[i],r[i])<<endl; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 2 ms | 348 KB | Output is correct |
3 | Incorrect | 2 ms | 348 KB | Output isn't correct |
4 | Execution timed out | 1075 ms | 412 KB | Time limit exceeded |
5 | Execution timed out | 1047 ms | 344 KB | Time limit exceeded |