QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#114969#5850. Candy Storezhouhuanyi0 16ms3588kbC++11560b2023-06-24 11:30:532023-06-24 11:30:55

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-06-24 11:30:55]
  • 评测
  • 测评结果:0
  • 用时:16ms
  • 内存:3588kb
  • [2023-06-24 11:30:53]
  • 提交

answer

#include<iostream>
#include<cstdio>
using namespace std;
long long read()
{
    char c=0;
    long long sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int T,k;
long long C;
int main()
{
    int l,d,cnt;
    long long ps,res;
    T=read();
    for (int i=1;i<=T;++i)
    {
	k=read(),C=read(),res=cnt=0;
	while (1)
	{
	    ps=res/k+1;
	    if (ps>C) break;
	    d=(ps*k-res+ps-1)/ps,res+=d*ps,cnt+=d;
	}
	printf("Case %d: %d\n",i,cnt);
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3528kb

input:

100
2 3
3 3
13 1
20 2
6 3
5 3
3 1
7 2
15 1
4 3
1 1
14 3
1 3
17 1
10 2
12 2
9 1
14 1
5 2
6 3
13 2
18 2
17 3
2 3
18 3
16 1
19 2
17 1
11 3
20 3
3 1
8 3
7 3
18 1
11 2
20 3
7 2
4 3
1 2
7 2
10 1
17 3
5 2
14 1
2 1
3 1
4 1
17 2
8 2
5 1
18 1
8 1
15 3
10 2
6 2
20 1
15 3
1 3
3 2
17 1
14 1
3 2
9 3
16 3
15 2
12 ...

output:

Case 1: 4
Case 2: 6
Case 3: 13
Case 4: 30
Case 5: 11
Case 6: 10
Case 7: 3
Case 8: 11
Case 9: 15
Case 10: 8
Case 11: 1
Case 12: 26
Case 13: 2
Case 14: 17
Case 15: 15
Case 16: 18
Case 17: 9
Case 18: 14
Case 19: 8
Case 20: 11
Case 21: 20
Case 22: 27
Case 23: 32
Case 24: 4
Case 25: 33
Case 26: 16
Case 2...

result:

wrong answer 1st lines differ - expected: 'Case #1: 4', found: 'Case 1: 4'

Subtask #2:

score: 0
Wrong Answer

Test #2:

score: 0
Wrong Answer
time: 16ms
memory: 3588kb

input:

100
984 4
830 901580635835
937 117926240831
1000 62009
1000 11
656 187600851857
577 732239839666
149 276944
401 126493510574
1000 696570219424
765 796394824105
422 120213965166
686 140
1000 431774067439
106 351578631166
374 279760528652
1 1000000000000
1000 134489424902
25 909266561260
402 333089014...

output:

Case 1: 2050
Case 2: 23340
Case 3: 24441
Case 4: 11617
Case 5: 3021
Case 6: 17420
Case 7: 16110
Case 8: 1960
Case 9: 10495
Case 10: 27860
Case 11: 21419
Case 12: 11023
Case 13: 3790
Case 14: 27381
Case 15: 2892
Case 16: 10087
Case 17: 40
Case 18: 26215
Case 19: 717
Case 20: 10911
Case 21: 28117
Case...

result:

wrong answer 1st lines differ - expected: 'Case #1: 2050', found: 'Case 1: 2050'