Submission #2496767
Source Code Expand
Copy
def main(): X = int(input()) if X == 1000: return 1000 beki = [1,] for i in range(2,35): for j in range(2,11): if i**j<= 1000: beki.append(i**j) beki.sort() print(beki) for i in range(len(beki)): if beki[i]>X: return beki[i-1] if __name__ == '__main__': print(main())
Submission Info
Submission Time | |
---|---|
Task | B - Exponential |
User | takatin37 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 384 Byte |
Status | WA |
Exec Time | 17 ms |
Memory | 3060 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | WA | 17 ms | 3060 KB |
0_001.txt | WA | 17 ms | 3060 KB |
0_002.txt | WA | 17 ms | 3060 KB |
1_003.txt | WA | 17 ms | 2940 KB |
1_004.txt | WA | 17 ms | 3060 KB |
1_005.txt | WA | 17 ms | 3060 KB |
1_006.txt | AC | 17 ms | 2940 KB |
1_007.txt | WA | 17 ms | 2940 KB |
1_008.txt | WA | 17 ms | 2940 KB |