Submission #499359
Source Code Expand
import math while True: n = int(input()) if n==0: break pf=[] m=n for i in range(2,int(math.sqrt(m))+1): while n%i ==0: n=n//i pf.append(i) if n!=1: pf.append(int(n)) print(max(pf))
Submission Info
Submission Time | |
---|---|
Task | B - Working for the World |
User | koshin |
Language | Python (3.2.3) |
Score | 100 |
Code Size | 282 Byte |
Status | AC |
Exec Time | 181 ms |
Memory | 8636 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00-sample, 10-minimum, 11-maximum, 12-little, 13-large, 14-middle, 15-zero, 50-random00, 50-random01, 50-random02, 50-random03, 50-random04, 50-random05, 50-random06, 50-random07, 50-random08, 50-random09, 50-random10, 50-random11, 50-random12, 50-random13, 50-random14, 50-random15, 50-random16, 50-random17, 50-random18, 50-random19 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00-sample | AC | 160 ms | 8532 KB |
10-minimum | AC | 126 ms | 8608 KB |
11-maximum | AC | 131 ms | 8604 KB |
12-little | AC | 129 ms | 8604 KB |
13-large | AC | 181 ms | 8596 KB |
14-middle | AC | 140 ms | 8608 KB |
15-zero | AC | 131 ms | 8600 KB |
50-random00 | AC | 163 ms | 8608 KB |
50-random01 | AC | 163 ms | 8612 KB |
50-random02 | AC | 167 ms | 8612 KB |
50-random03 | AC | 166 ms | 8604 KB |
50-random04 | AC | 163 ms | 8608 KB |
50-random05 | AC | 171 ms | 8636 KB |
50-random06 | AC | 176 ms | 8608 KB |
50-random07 | AC | 161 ms | 8604 KB |
50-random08 | AC | 160 ms | 8604 KB |
50-random09 | AC | 163 ms | 8612 KB |
50-random10 | AC | 159 ms | 8608 KB |
50-random11 | AC | 161 ms | 8528 KB |
50-random12 | AC | 165 ms | 8604 KB |
50-random13 | AC | 166 ms | 8608 KB |
50-random14 | AC | 165 ms | 8604 KB |
50-random15 | AC | 163 ms | 8600 KB |
50-random16 | AC | 172 ms | 8604 KB |
50-random17 | AC | 162 ms | 8612 KB |
50-random18 | AC | 168 ms | 8532 KB |
50-random19 | AC | 172 ms | 8604 KB |