QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#136857 | #235. Maximum Multiple | qwerty# | 0 | 117ms | 3880kb | C++20 | 387b | 2023-08-09 12:59:36 | 2023-08-09 12:59:37 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
long long T, n;
int main() {
cin >> T;
while (T--) {
scanf("%lld", &n);
if (n % 6 == 0) printf("%lld\n", n * n * n / 18);
else if (n % 3 == 0) printf("%lld\n", n * n * n / 27);
else if (n % 4 == 0) printf("%lld\n", n * n * n / 36);
else printf("-1\n");
}
return 0;
}
详细
Test #1:
score: 0
Wrong Answer
time: 117ms
memory: 3880kb
input:
1000000 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 ...
output:
-1 -1 1 1 -1 12 -1 14 27 -1 -1 96 -1 -1 125 113 -1 324 -1 222 343 -1 -1 768 -1 -1 729 609 -1 1500 -1 910 1331 -1 -1 2592 -1 -1 2197 1777 -1 4116 -1 2366 3375 -1 -1 6144 -1 -1 4913 3905 -1 8748 -1 4878 6859 -1 -1 12000 -1 -1 9261 7281 -1 15972 -1 8734 12167 -1 -1 20736 -1 -1 15625 12193 -1 26364 -1 1...
result:
wrong answer 4th lines differ - expected: '2', found: '1'