QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#685663 | #9531. Weird Ceiling | ryx | WA | 2ms | 3684kb | C++23 | 852b | 2024-10-28 20:40:57 | 2024-10-28 20:40:58 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define buff ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef pair<int,int> PII;
//const int N=
int a;
vector<int> v;
signed main(){
int t;
cin>>t;
while(t--){
v.clear();
int ans = 0;
cin>>a;
for(int i=1;i*i<=a;i++){
if(a%i==0){
if(i*i==a) v.push_back(i);
else{
v.push_back(i);
v.push_back(a/i);
}
}
}
sort(v.begin(),v.end());
ans+=(v[1]-v[0])*a,ans+=1;
if(v.size()>2){
for(int i=1;i<(int)v.size()-1;i++){
ans+=a/v[i]*(v[i+1]-v[i]);
}
}
cout<<ans<<endl;
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3552kb
input:
3 5 451 114514
output:
21 10251 7075858
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3684kb
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:
0 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:
wrong answer 1st lines differ - expected: '1', found: '0'