-
Notifications
You must be signed in to change notification settings - Fork 184
/
Copy pathtutorial.cc
47 lines (45 loc) · 971 Bytes
/
tutorial.cc
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
// https://open.kattis.com/problems/tutorial
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long m, n, t;
cin >> m >> n >> t;
long long p = 1;
bool tle = false;
switch (t) {
case 1:
for (int i = 1; i <= n; i++) {
p *= i;
if (p > m) {
tle = true;
break;
}
}
cout << (tle ? "TLE\n" : "AC\n");
break;
case 2:
if (n > log2(m)) cout << "TLE\n";
else cout << "AC\n";
break;
case 3:
if (n > m || n * n > m || n * n * n > m || n * n * n * n > m) cout << "TLE\n";
else cout << "AC\n";
break;
case 4:
if (n > m || n * n > m || n * n * n > m) cout << "TLE\n";
else cout << "AC\n";
break;
case 5:
if (n * n > m) cout << "TLE\n";
else cout << "AC\n";
break;
case 6:
if (double(n) * log2(double(n)) > m) cout << "TLE\n";
else cout << "AC\n";
break;
case 7:
if (n > m) cout << "TLE\n";
else cout << "AC\n";
}
}