QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #686564 | #9531. Weird Ceiling | xianyu | WA | 288ms | 3628kb | C++14 | 640b | 2024-10-29 14:19:24 | 2024-10-29 14:19:25 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int N=1e6+10,mod=998244353;
typedef pair<int,int>PII;
typedef pair<double,double>PDD;
int n,m,k;
PDD a[N];
void solve() {
cin>>n;
int ans=1;
int pos=n;
for(int i=min(100000LL,n)-1;i>=2;i--) {
if(n%i==0) {
ans+=(pos-i)*n/i,pos=i;
//cout<<ans<<" "<<pos<<endl;
}
}
ans+=(pos-1)*n;
cout<<ans<<endl;
}
signed main() {
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int T=1;
cin>>T;
while(T--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3560kb
input:
3 5 451 114514
output:
21 10251 7075858
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
1000 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101...
output:
1 3 7 9 21 16 43 25 37 36 111 41 157 64 71 65 273 73 343 86 113 144 507 101 201 196 163 134 813 137 931 161 221 324 295 169 1333 400 287 205 1641 218 1807 254 277 576 2163 241 589 301 443 326 2757 298 507 317 533 900 3423 315 3661 1024 439 385 625 386 4423 494 737 437 4971 394 5257 1444 551 590 969 ...
result:
ok 1000 lines
Test #3:
score: -100
Wrong Answer
time: 288ms
memory: 3628kb
input:
1000 999999001 999999002 999999003 999999004 999999005 999999006 999999007 999999008 999999009 999999010 999999011 999999012 999999013 999999014 999999015 999999016 999999017 999999018 999999019 999999020 999999021 999999022 999999023 999999024 999999025 999999026 999999027 999999028 999999029 99999...
output:
999998001000999001 109558390660618 4694851985894571 123120627371734 639044964149629 10380209133324 15551564928599 13668744781454 14596690927129 662270444351612 23764415798911 159385092527374 10660047853441 10458969843475 14199216871343 11086870253383 999998033000967273 1048224915086568 1018273001073...
result:
wrong answer 2nd lines differ - expected: '4675492974858', found: '109558390660618'