QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#136575#235. Maximum Multiplewhsyhyyh#100 ✓45ms3768kbC++14796b2023-08-09 09:05:352023-08-09 09:05:39

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-08-09 09:05:39]
  • 评测
  • 测评结果:100
  • 用时:45ms
  • 内存:3768kb
  • [2023-08-09 09:05:35]
  • 提交

answer

#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define N 200010
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define drep(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int rd() {
	int res=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48),ch=getchar();
	return res*f;
}
int T,n;
int main() {
	T=rd();
	while(T--) {
		n=rd();
		if(n%3==0) {
			printf("%lld\n",1ll*n*n*n/27);
		}
		else if(n%4==0) {
			printf("%lld\n",1ll*n*n*n/32);
		}
		else puts("-1");
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 45ms
memory: 3768kb

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