Submission #3423563
Source Code Expand
s = input() if s[0] == 'A' and s[2:-1].count('C') == 1: i = s.index('C') # Cの0オリジンで探してその場所を代入 #print(i) ss = s[1:i] + s[i+1:] #全体の2文字目(1オリジン)からi番目までと、iのあとの末尾までの文字判定 if ss.islower(): print("AC") else: print("WA") else: print("WA")
Submission Info
Submission Time | |
---|---|
Task | B - AcCepted |
User | rosupo |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 377 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 3060 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03, a04, a05 |
All | a01, a02, a03, a04, a05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 17 ms | 2940 KB |
a02 | AC | 17 ms | 2940 KB |
a03 | AC | 17 ms | 3060 KB |
a04 | AC | 17 ms | 2940 KB |
a05 | AC | 17 ms | 2940 KB |
b06 | AC | 17 ms | 2940 KB |
b07 | AC | 17 ms | 2940 KB |
b08 | AC | 17 ms | 2940 KB |
b09 | AC | 17 ms | 2940 KB |
b10 | AC | 17 ms | 2940 KB |
b11 | AC | 17 ms | 2940 KB |
b12 | AC | 17 ms | 3060 KB |
b13 | AC | 17 ms | 2940 KB |
b14 | AC | 17 ms | 2940 KB |
b15 | AC | 17 ms | 2940 KB |
b16 | AC | 17 ms | 2940 KB |