# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20399 | KEIST (#35) | 채점 시스템 (OJUZ11_judge) | C++98 | 1000 ms | 1116 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<stdio.h>
int findjari(int x, int jari)
{
if (x==0) return jari;
return findjari(x/10, jari+1);
}
int main()
{
int query;
scanf("%d", &query);
while(query--)
{
int correct, score;
scanf("%d %d", &score, &correct);
int jari=findjari(score, 0);
if (jari==0) jari++;
int defaultJari=1;
for (int i=1; i<=jari; i++) {
defaultJari*=10;
}
int cnt=0;
while(1)
{
if ((score+defaultJari)>correct) {
printf("%d\n", cnt);
break;
}
cnt++;
defaultJari*=10;
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |