QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#136667#235. Maximum MultiplePanC_ake#100 ✓79ms26920kbC++20680b2023-08-09 09:52:372023-08-09 09:52:40

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:52:40]
  • 评测
  • 测评结果:100
  • 用时:79ms
  • 内存:26920kb
  • [2023-08-09 09:52:37]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define debug(x) cout << #x << " = " << x << '\n'

const int N = 1e6 + 10;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;

int MAX;
vector<int> f[N];

void solve() {
    int n;
    cin >> n;

    if (n % 3 == 0) {
        int x = n / 3;
        cout << x * x * x << '\n';
    } else if (n % 4 == 0) {
        int x = n / 2, y = n / 4;
        cout << x * y * y << '\n';
    } else {
        cout << "-1\n";
    }
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 79ms
memory: 26920kb

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