QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#754643 | #9531. Weird Ceiling | baoyangawa# | WA | 55ms | 3892kb | C++14 | 1.1kb | 2024-11-16 15:28:07 | 2024-11-16 15:28:11 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct fio {
char gc() {return getchar();}
template <typename T> void read(T& x) {
char c = gc(), l = 0; x = 0;
while (!isdigit(c)) l = c, c = gc();
while ( isdigit(c)) x = (x << 1) + (x << 3) + c - 48, c = gc();
if (l == '-') x = -x;
}
template <typename T, typename ...A> void read(T& x, A&... a) {
read(x), read(a...);
}
} IO;
int n; int t;
vector<int> a;
int main() {
IO.read(t);
while (t--) {
IO.read(n); a.clear();
if (n == 1) {
printf("1\n"); continue;
}
for (int i = 1; 1ll * i * i <= n; i++) {
if (n % i == 0) {
a.push_back(i);
if (n / i != i) a.push_back(n/i);
}
} sort(a.begin(), a.end()); ll sum = 1ll * (a[1] - 1) * n + 1;
for (int i = 2; i < a.size(); i++) {
int nw = a[i];
sum += (n / a[i-1]) * (nw - a[i-1]);
} printf("%lld\n", sum);
}
return 0;
}
/*
3
5
451
114514
*/
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3892kb
input:
3 5 451 114514
output:
21 10251 7075858
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 1ms
memory: 3852kb
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: 55ms
memory: 3768kb
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 2568556810 9049563687 13034762736 5325589725 15270447038 33029462923 19336490315 17111625553 15919878246 15758381795 11219033544 16417307517 7234411976 18929954323 20443802677 999998033000967273 18136121654 979248493027 28001063474 20166113141 3873602690 32886150395 24697974107 13...
result:
wrong answer 2nd lines differ - expected: '4675492974858', found: '2568556810'