QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #372314 | #235. Maximum Multiple | Ecec243 | 100 ✓ | 57ms | 3744kb | C++23 | 670b | 2024-03-31 11:05:12 | 2024-03-31 11:05:13 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
int read(){
int red=0, f_f=1; char c=getchar();
while (c<'0'||c>'9'){if (c=='-')f_f=-1;c=getchar();}
while (c>='0'&&c<='9'){red=(red<<1)+(red<<3)+(c^48);c=getchar();}
return f_f*red;
}
const int N = 1e6+5;
int n;
void solve() {
n = read();
if(n%3 == 0) {
printf("%lld\n", (n/3)*(n/3)*(n/3));
return;
}
if(n%4 == 0) {
printf("%lld\n", (n/4)*(n/4)*(n/2));
return;
}
printf("-1\n");
}
signed main() {
int T = read();
while (T--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 57ms
memory: 3744kb
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 8 -1 16 27 -1 -1 64 -1 -1 125 128 -1 216 -1 250 343 -1 -1 512 -1 -1 729 686 -1 1000 -1 1024 1331 -1 -1 1728 -1 -1 2197 2000 -1 2744 -1 2662 3375 -1 -1 4096 -1 -1 4913 4394 -1 5832 -1 5488 6859 -1 -1 8000 -1 -1 9261 8192 -1 10648 -1 9826 12167 -1 -1 13824 -1 -1 15625 13718 -1 17576 -1 16...
result:
ok 1000000 lines