QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #136860 | #235. Maximum Multiple | qwerty# | 0 | 109ms | 3704kb | C++20 | 387b | 2023-08-09 13:02:12 | 2023-08-09 13:02:16 |
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 / 36);
else if (n % 3 == 0) printf("%lld\n", n * n * n / 27);
else if (n % 4 == 0) printf("%lld\n", n * n * n / 32);
else printf("-1\n");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 109ms
memory: 3704kb
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 2 -1 6 -1 16 27 -1 -1 48 -1 -1 125 128 -1 162 -1 250 343 -1 -1 384 -1 -1 729 686 -1 750 -1 1024 1331 -1 -1 1296 -1 -1 2197 2000 -1 2058 -1 2662 3375 -1 -1 3072 -1 -1 4913 4394 -1 4374 -1 5488 6859 -1 -1 6000 -1 -1 9261 8192 -1 7986 -1 9826 12167 -1 -1 10368 -1 -1 15625 13718 -1 13182 -1 1600...
result:
wrong answer 6th lines differ - expected: '8', found: '6'