Submission #1605347


Source Code Expand

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
 
sys.setrecursionlimit(10**7)
inf = 10**20
gosa = 1.0 / 10**10
mod = 10**9 + 7
 
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
 
 
def main():
    c = collections.Counter(S())
    for k in string.ascii_lowercase:
        if c[k] == 0:
            return k
    return 'None'
 
print(main())

Submission Info

Submission Time
Task B - Not Found
User iehn
Language Python (3.4.3)
Score 200
Code Size 724 Byte
Status AC
Exec Time 48 ms
Memory 5588 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 15
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, 1.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
1.txt AC 41 ms 5460 KB
2.txt AC 41 ms 5328 KB
3.txt AC 41 ms 5456 KB
4.txt AC 48 ms 5588 KB
5.txt AC 46 ms 5588 KB
6.txt AC 46 ms 5584 KB
7.txt AC 45 ms 5584 KB
8.txt AC 46 ms 5588 KB
9.txt AC 46 ms 5588 KB
sample1.txt AC 41 ms 5332 KB
sample2.txt AC 40 ms 5336 KB
sample3.txt AC 41 ms 5332 KB