QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #759164 | #9531. Weird Ceiling | Neptune_EX | WA | 3ms | 3712kb | C++14 | 621b | 2024-11-17 22:21:19 | 2024-11-17 22:21:19 |
Judging History
answer
#define ll long long
#include<bits/stdc++.h>
using namespace std;
int T;
ll x[1050];
vector<ll> vc;
void Find_num(ll k){
ll bound=sqrt(k);
for(int i=1;i<=k;i++){
if(k%i==0 && i*i!=k){
vc.push_back(k/i);
vc.push_back(i);
}
}
sort(vc.begin(),vc.end());
return;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>T;
for(int i=0;i<T;i++) cin>>x[i];
for(int i=0;i<T;i++){
vc.clear();
ll ans=0;
Find_num(x[i]);
for(int j=1;j<vc.size();j++){
ans+=(vc[j]-vc[j-1])*x[i]/vc[j-1];
}
cout<<ans+1<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3712kb
input:
3 5 451 114514
output:
21 10251 7075858
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 3ms
memory: 3476kb
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 13 21 16 43 25 73 36 111 41 157 64 71 81 273 73 343 86 113 144 507 101 601 196 163 134 813 137 931 161 221 324 295 178 1333 400 287 205 1641 218 1807 254 277 576 2163 241 2353 301 443 326 2757 298 507 317 533 900 3423 315 3661 1024 439 449 625 386 4423 494 737 437 4971 394 5257 1444 551 590 96...
result:
wrong answer 4th lines differ - expected: '9', found: '13'