QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#114953#5850. Candy StoreZesty_Fox27 ✓14ms3712kbC++20937b2023-06-24 11:07:482023-06-24 11:07:50

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:07:50]
  • 评测
  • 测评结果:27
  • 用时:14ms
  • 内存:3712kb
  • [2023-06-24 11:07:48]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

using u32=unsigned int;
using i64=long long;
using u64=unsigned long long;
using db=double;
using vi=vector<int>;
using pii=pair<int,int>;

template<typename T>
T read(){
    T x=0,f=0;char ch=getchar();
    while(!isdigit(ch)) f|=(ch=='-'),ch=getchar();
    while(isdigit(ch)) x=x*10+(ch-'0'),ch=getchar();
    return f?-x:x;
}

#define rdi read<int>
#define rdi64 read<i64>
#define fi first
#define se second
#define pb push_back

int k;
i64 C;
void solve(int id){
    k=rdi(),C=rdi64();
    i64 sum=0,i=1;
    int res=0;
    while(true){
        i=sum/k+1;
        if(i>C) break;
        i64 c=k-sum/i;
        sum+=c*i,res+=c;
    }
    printf("Case #%d: %d\n",id,res);
}

int main(){
#ifdef LOCAL
    freopen("1.in","r",stdin);
    freopen("1.out","w",stdout);
#endif
    int T=rdi();
    for(int i=1;i<=T;i++) solve(i);
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 7
Accepted

Test #1:

score: 7
Accepted
time: 1ms
memory: 3524kb

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 #...

result:

ok 100 lines

Subtask #2:

score: 20
Accepted

Test #2:

score: 20
Accepted
time: 14ms
memory: 3712kb

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...

result:

ok 100 lines

Extra Test:

score: 0
Extra Test Passed