problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03289 | s751726230 | Accepted | s = list(input())
flg = 'WA'
if s[0] == 'A':
if 'C'in s[2:len(s)-1]:
s.remove('A')
s.remove('C')
s = ''.join(s)
if s.islower() == True:
flg = 'AC'
print(flg)
|
p03289 | s767367852 | Accepted | s = input()
flg = 1
if (s[0] != 'A'):
flg = 0
cnt = 0
for i in s[2:-1]:
if (i == 'C'): cnt+= 1
if (cnt != 1):
flg = 0
cap = 0
for i in s:
if ('A' <= i <= 'Z'): cap += 1
if (cap != 2):
flg = 0
if (flg): print("AC")
else: print("WA") |
p03289 | s586684933 | Accepted | import re
print('AC') if re.match(r'A[a-z]+C[a-z]+$',input()) else print('WA')
|
p03289 | s642579226 | Accepted | a = ord('a')
z = ord('z')
S = input()
ans = 'WA'
if S[0] == 'A':
if S[2:-1].count('C') == 1:
for i, c in enumerate(S):
if i == 0 or c == 'C':
continue
else:
if a <= ord(c) <= z:
continue
else:
break
else:
ans = 'AC'
print(ans)
|
p03289 | s517722673 | Accepted | ans = True
key = 0
s = input()
for i in range(len(s)):
if i == 0 and s[0] != "A":
ans = False
if (i == 1 or i == len(s)-1) and s[i].isupper():
ans = False
if 2 <= i <= len(s)-2:
if s[i] == "C":
key += 1
elif s[i].isupper():
ans = False
if key == 1 and ans:
print("AC")
else:
print("WA") |
p03289 | s732720488 | Accepted | S = list(input())
ans = 'AC'
if S[0] == 'A':
del S[0]
for i in range(1, len(S)-1):
if S[i] == 'C':
del S[i]
ans = 'AC'
break
else:
ans = 'WA'
for j in range(len(S)):
if S[j].isupper():
ans = 'WA'
else:
ans = 'WA'
print(ans)
|
p03289 | s625233676 | Accepted | s = list(input())
ans = 'AC'
if s[0] != 'A':
ans = 'WA'
c_idx = None
for i, v in enumerate(list(s)):
if i >= 2 and i <= len(s)-2:
if v == 'C':
if c_idx is None:
c_idx = i
else:
ans = 'WA'
if c_idx is None:
ans = 'WA'
else:
s[0] = 'a'
s[c_idx] = 'c'
if [ i.lower() for i in s ] != s:
ans = 'WA'
print(ans) |
p03289 | s484910856 | Accepted | S = list(input())
a_flag = 0
c_flag = 0
c_count = 0
flag2 = 0
if S[0] == 'A':
a_flag += 1
for i in range(2, len(S)-1):
if S[i] == 'C' and i == 2:
c_flag += 1
c_count += 1
elif S[i] == 'C':
c_flag += 1
c_count += 1
elif S[i].isupper():
flag2 += 1
if S[len(S) - 1].isupper() or S[1].isupper():
flag2 += 1
if a_flag == 1 and c_flag == 1 and flag2 == 0 and c_count == 1:
print('AC')
else:
print('WA') |
p03289 | s983655676 | Accepted | import sys
sys.setrecursionlimit(100000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
def main():
S = input()
flag = True
if S[0] != 'A' or S[2:-1].count('C') != 1:
flag = False
for i in range(len(S)):
if S[i] not in 'ACabcdefghijklmnopqrstuvwxyz':
flag = False
break
print('AC' if flag else 'WA')
if __name__ == '__main__':
main()
|
p03289 | s686475980 | Accepted | s = input()
flag = True
if s[0] != 'A' or s.count('C') != 1 or s[2:-1].count('C') != 1:
flag = False
else:
for i in range(1, len(s)):
if s[i] != 'C' and s[i].isupper():
flag = False
print('AC') if flag else print('WA')
|
p03289 | s291225393 | Accepted | s = str(input())
count = 0
ansFlg = 0
if s[0] == "A":
s = "a" + s[1:]
ansFlg += 1
for i in range(2, len(s)-1):
if s[i] == "C":
s = s[:i] + "c" + s[i + 1:]
count += 1
if count == 1:
ansFlg += 1
if s.islower():
ansFlg += 1
if ansFlg == 3:
print("AC")
else:
print("WA")
|
p03289 | s364750953 | Accepted | # abc104_b.py
S = input()
upper_cnt=0
for i,c in enumerate(S):
if (i==0 and c!="A") or S[2:-1].count("C")!=1 or (i==1 and not c.islower()):
print('WA')
exit()
if i>=1 and c.isupper():
upper_cnt+=1
if upper_cnt >1:
print('WA')
exit()
print('AC')
|
p03289 | s113740708 | Accepted | S=input()
if S[0]!='A':
print('WA')
exit()
if 'C' not in S[2:-1]:
print('WA')
exit()
s=list(S)
s.remove('A')
s.remove('C')
for x in s:
if x not in 'abcdefghijklmnopqrstuvwxyz':
print('WA')
exit()
print('AC') |
p03289 | s759699659 | Accepted | S = input()
if S[0] == 'A' and S.count('C', 2, -1) == 1 and S.replace('A', '').replace('C', '').islower():
print('AC')
else:
print('WA') |
p03289 | s716659279 | Accepted | import re
s = input()
print("AC" if re.match(r'^A[a-z][a-z]*C[a-z]*[a-z]$',s) else "WA") |
p03289 | s812904560 | Accepted | s = input()
count1 = 0
count2 = 0
count3 = 0
count4 = 0
if s[0] == 'A'and s[1].islower() == True and s[len(s)-1].islower() == True:
count1 += 1
for i in range(2, len(s) - 1):
if (s[i] == 'C'):
count2 += 1
if count1 != 1 or count2 != 1:
print('WA')
else:
print('AC')
|
p03289 | s225971431 | Accepted | s=input()
x=0
ans="WA"
if s[0]=="A":
if s[2:-1].count("C")==1:
x=s[2:-1].find("C")+2
t=s[1:x]+s[x+1:]
if t.islower():
ans="AC"
print(ans) |
p03289 | s910327337 | Accepted | s = list(input())
c = 0
f = len(s)
if s.count('C') == 1:
d = s.index('C')
else:
d = 0
for i in range(0,len(s)):
if s[i].isupper() == True:
c += 1
if s[0] == 'A':
if d < f-1 and d > 1:
if c == 2:
print('AC')
else:
print('WA')
else:
print('WA')
else:
print('WA') |
p03289 | s491667216 | Accepted | s = input()
if s[0] != "A":
print("WA")
exit()
if s[2:-1].count("C") != 1:
print("WA")
exit()
t = s.index("C")
if s[1:t].islower() == False or s[t+1:].islower() == False:
print("WA")
exit()
print("AC") |
p03289 | s510224515 | Accepted | s_list = list(input())
n = len(s_list)
c_count = 0
if s_list[0] == "A":
for s in s_list[2:-1]:
if s == "C":
c_count += 1
if c_count == 1:
if all([(s_list[i] == "C" and 2 <= i <= n - 2) or s_list[i].islower() for i in range(1, n)]):
print("AC")
exit()
print("WA") |
p03289 | s655918177 | Accepted | s=input()
if s.count("A")==1 and s.count("C")==1:
if "C" in s[2:-1] and s[0]=="A":
s=s.replace("A","a")
s=s.replace("C","b")
t=s.lower()
if s==t:
print("AC")
else:
print("WA")
else:
print("WA")
else:
print("WA") |
p03289 | s371408937 | Accepted | s = list(input())
bl = False
s1 = s[1]
s2 = s[2:len(s)-1]
s3 = s[-1]
if s[0] == 'A' and s[2:len(s)-1].count('C') == 1:
s2.remove('C')
s2 = ''.join(s2)
ss = s1+s2+s3
if ss.islower():
bl = True
print('AC' if bl else 'WA')
|
p03289 | s412516218 | Accepted | S = input()
if S[0] != "A":
print("WA")
exit()
if S[1].isupper():
print("WA")
exit()
if S[-1].isupper():
print("WA")
exit()
ok = False
for i in range(2, len(S) - 1):
if S[i].isupper():
if ok:
print("WA")
exit()
else:
ok = True
if ok is False:
print("WA")
else:
print("AC")
|
p03289 | s136494542 | Accepted | s = input()
if s[0] != 'A':
print('WA')
exit()
if s[2:-1].count('C') != 1:
print('WA')
exit()
s = s.replace('C',"")
if s[1:].islower():
print('AC')
else:
print('WA') |
p03289 | s569141679 | Accepted | s = input()
if s[0] != 'A':
print("WA")
exit()
else:
s = s[1:]
if 'C' not in s[1:-1]:
print("WA")
exit()
else:
i = s.index('C')
s = s[:i] + s[i+1:]
print("AC" if s.islower() else "WA") |
p03289 | s919881693 | Accepted | ans = "WA"
s = list(input())
if s[0] == "A":
c_index = [i for i, x in enumerate(s[2:-1]) if x == 'C']
if len(c_index) == 1:
s.pop(c_index[0] + 2)
s.pop(0)
s = "".join(s)
if s.islower():
ans = "AC"
print(ans)
|
p03289 | s988747344 | Accepted | s=input()
flag=True
if s[0]!='A':
flag=False
if s[1].isupper():
flag=False
cnt=0
for i in range(2,len(s)-1):
if s[i]=='C':
cnt+=1
elif s[i].isupper():
flag=False
if s[len(s)-1].isupper():
flag=False
if cnt!=1:
flag=False
if flag:
print("AC")
else:
print("WA") |
p03289 | s498457504 | Accepted | import re
ans=re.match("^A[a-z]+C[a-z]+$",input())
print("AC" if ans else "WA") |
p03289 | s487963305 | Accepted | S = list(input())
N = len(S)
ans = 'AC'
if S[0] != 'A' or 'C' not in S[2:-1]:
ans = 'WA'
tmp = 0
for i in range(1,N):
if S[i].isupper():
tmp += 1
if tmp > 1:
ans = 'WA'
print(ans)
|
p03289 | s684235057 | Accepted | def main():
S = input()
if S[0] != 'A':
print('WA')
exit()
S = 'a'+S[1:]
if S.count('C', 2, len(S)-1) != 1:
print('WA')
exit()
tmp = S[2:len(S)-1].find('C') + 2
S = S[:tmp] + 'c' + S[tmp+1:]
if S != S.lower():
print('WA')
exit()
print('AC')
if __name__ == "__main__":
main()
|
p03289 | s246422285 | Accepted | # import sys
s = input()
ans = "AC"
cnt = 0
if s[0] != "A":
ans = "WA"
for i in range(1, len(s)):
t = s[i]
if t == "C":
if 2 <= i < len(s) - 1:
cnt += 1
else:
if t.isupper():
ans = "WA"
if cnt != 1:
ans = "WA"
print(ans)
|
p03289 | s846034760 | Accepted | S = list(input())
cnt1 = 0
cnt2 = 0
if S[0] == 'A':
for i in range(2, len(S)-1):
if S[i] == 'C':
cnt1 += 1
if cnt1 == 1:
for j in range(len(S)):
if S[j].isupper():
cnt2 += 1
if cnt2 == 2:
print('AC')
else:
print('WA')
else:
print('WA')
else:
print('WA') |
p03289 | s342097924 | Accepted | text = list(input())
check = 0
flag = False
def upper_count(string,c = 0): # 文字列中の大文字の個数をカウント
for i in range(len(string)):
if string[i].isupper() == True:
c += 1
return c
if text[0] == "A":
if "C" in text[2:len(text)-1]:
flag = True
#print(flag,upper_count(text))
if flag == True and upper_count(text) == 2:
print("AC")
else:
print("WA")
|
p03289 | s299829074 | Accepted | s = input()
if (s[0] == "A")&(s[2:-1].count("C")==1)&(s.replace("A","").replace("C","") == s.replace("A","").replace("C","").lower()):
print("AC")
else:
print("WA") |
p03289 | s639534384 | Accepted | S = input()
ans = "WA"
if S[0] == "A":
if S[2:-1].count("C") == 1 and S.count("C") == 1:
n = len(S)
for i in range(len(S)):
if S[i] == "A" or S[i] == "C":
pass
elif S[i].isupper() == True:
n -= 1
break
if n == len(S):
ans = "AC"
print(ans) |
p03289 | s721324380 | Accepted | s = input()
if s[0]=='A' and s.count('C',2,-1)==1:
#print(s[1:2]+s[2:-2].replace('C','')+s[-2:])
if (s[1:2]+s[2:-1].replace('C','')+s[-1:]).islower():
print('AC')
else:
print('WA')
else:
print('WA') |
p03289 | s660316180 | Accepted | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
s = input().strip()
if s[0] != 'A':
print('WA')
sys.exit(0)
if s.count('C') != 1:
print('WA')
sys.exit(0)
if not (2 <= s.find('C') <= len(s) - 2):
print('WA')
sys.exit(0)
if not s.replace('A', '').replace('C', '').islower():
print('WA')
sys.exit(0)
print('AC')
|
p03289 | s476531854 | Accepted | s = input()
j1 = s[0] == 'A'
j2 = s[2:-1].count('C') == 1
j3 = True
s3 = set(s) - set('AC')
for i in s3:
if i != i.lower():
j3 = False
break
print('AC') if j1 and j2 and j3 else print('WA') |
p03289 | s055732155 | Accepted | s=str(input())
f=s[0]=="A" and s[2:-1].count("C")==1
g=(s[1]+s[2:-1].replace("A","a").replace("C","c")+s[-1]).islower()
h=f and g
print("AC" if h is True else "WA") |
p03289 | s813884320 | Accepted | s=input()
ans="WA"
s_1 = s[1:].replace("C","")
if s[0]=="A" and s[2:-1].count("C")==1 and s_1.islower():
ans="AC"
print(ans) |
p03289 | s838018541 | Accepted | s = input()
if s[0] != 'A':
print('WA')
exit()
import collections
cnt = collections.Counter(s[2:-1])
if cnt['C'] != 1:
print('WA')
exit()
s2 = s[1:].replace('C', '')
if not s2.islower():
print('WA')
exit()
print('AC')
|
p03289 | s341402358 | Accepted | s=input()
if s[0]=='A' and s[2:-1].count('C')==1:
for i in s[1:]:
if i !='C' and i!=i.lower():
print('WA')
exit()
print('AC')
else:
print('WA') |
p03289 | s985762856 | Accepted | s = input()
if s[0] == 'A' and s[2:-1].count('C') == 1:
for i in range(len(s)):
if not (i == 0 or i == s[2:-1].index('C')+2):
if not s[i].islower():
print('WA')
exit()
print('AC')
exit()
print('WA') |
p03289 | s572393989 | Accepted | s = input()
flg = 0
if s[0] != "A":
flg = 1
if s[2:-1].count("C") != 1:
flg = 1
else:
l = s.index("C")
s = s[1:l] + s[l+1:]
if s.islower():
pass
else:
flg = 1
if flg == 1:
print("WA")
else:
print("AC") |
p03289 | s384299788 | Accepted | s = input()
ans = 'WA'
if s[0]=='A' and s.count('C')==1 and s.index('C') in range(2,len(s)-1) and s[1:].replace('C','c') == s[1:].lower():
ans = 'AC'
print(ans) |
p03289 | s037418587 | Accepted | import sys
s = input()
if s[0] != "A":
print("WA")
sys.exit(0)
if s[1] < "a" or s[1] > "z":
print("WA")
sys.exit(0)
sub = s[2:-1]
has = False
for c in sub:
if not has and c == "C":
has = True
elif "a" <= c <= "z":
continue
else:
has = False
break
if not has:
print("WA")
sys.exit(0)
if "a" <= s[-1] <= "z":
print("AC")
else:
print("WA")
|
p03289 | s521374344 | Accepted | S = input()
flag = 0
if S[0] == 'A' and S[2:-1].count('C')==1 :
if S.replace('A',"").replace('C',"").islower():
flag =1
print('AC')
if flag == 0:
print('WA') |
p03289 | s820365293 | Accepted | import re
S = str(input())
if (S[0]=='A')\
and (S[2:-1].count('C') == 1)\
and (len(re.findall('[A-Z]', S)) == 2):
print('AC')
else:
print('WA') |
p03289 | s756987605 | Accepted | s=input()
flag=0
if s[0]=="A":
if s[2:-1].count("C")==1:
if s[1:].replace("C","c").islower():
print("AC")
flag=1
if flag==0:
print("WA")
|
p03289 | s995142766 | Accepted | s = input()
#print(s[3:-2])
if(s[0] =="A"):
if(s[2:-1].count("C") == 1):
a = s.index("C")
s = list(s)
del s[0]
del s[a-1]
s = ''.join(s)
if(s.islower()):
print("AC")
else:
print("WA")
else:
print("WA")
else:
print("WA")
#print(tmp) |
p03289 | s721980955 | Accepted | s = input()
ok = True
if s[0] != 'A': ok = False
if s[1].isupper(): ok = False
if s[-1].isupper(): ok = False
c = 0
for si in s[2:-1]:
if si == 'C': c += 1
print('AC' if ok and c==1 else 'WA')
|
p03289 | s688620214 | Accepted | def l():
print("WA")
exit()
s = input()
if s[0] != "A": l()
c = 0
for i in s[2:-1]:
if i == "C":
c += 1
if c != 1: l()
print("AC") if s[1].islower() and s[-1].islower() else l()
|
p03289 | s484888342 | Accepted | s = str(input())
C_count = 0
a = 0
b = 0
c = 0
k = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
if s[0] == "A":
a += 1
for i in s[2:-1]:
if i == "C":
C_count += 1
if C_count == 1:
b += 1
l = s[1:]
l = l.replace("C","")
if l.islower() == True:
c += 1
if a == 1 and b == 1 and c == 1:
print("AC")
else:
print("WA")
|
p03289 | s182843191 | Accepted | S = input()
if S[0]=="A" and S[2:-1].count("C")==1 and S[1:].replace("C","c").islower():
print("AC")
else:
print("WA") |
p03289 | s254249228 | Accepted | # -*- coding: utf-8 -*-
import sys
S_list=list(input().strip())
sub_S = S_list[2:-1]
if S_list[0] != "A" or sub_S.count("C") != 1:
print("WA")
sys.exit()
check_S = S_list[:]
del check_S[ 2 + sub_S.index("C") ]
del check_S[0]
for word in check_S:
if "a" <= word <= "z":
continue
else:
print("WA")
sys.exit()
print("AC")
|
p03289 | s264671823 | Accepted | #!/usr/bin/env python
# coding: utf-8
# In[20]:
S = input()
# In[21]:
mylist = [x for x in S]
if mylist[0] != "A":
print("WA")
elif mylist[2:-1].count("C") != 1:
print("WA")
else:
C_idx = mylist[2:-1].index("C") + 2
mylist.pop(C_idx)
if str("".join(mylist[1:])).islower():
print("AC")
else:
print("WA")
# In[ ]:
|
p03289 | s095544645 | Accepted | from collections import Counter
S = input()
def lower_s(string):
big_c = 0
for c in string[1:]:
if c == "C":
if big_c == 1:
return False
else:
big_c = 1
continue
if c == c.upper():
return False
return True
if (S[0] == "A") and (Counter(S[2:-1])["C"] == 1) and lower_s(S):
print("AC")
else:
print("WA")
|
p03289 | s323069160 | Accepted | #!/usr/bin/env python3
def solve(s):
return s[0] == "A" and s.count("C",2,-1) == 1 and s[1:].replace("C", "").islower()
def main():
S = input()
print("AC" if solve(S) else "WA")
return
if __name__ == '__main__':
main()
|
p03289 | s336167658 | Accepted | s = list(input())
if s[0] == 'A' and s[2:-1].count('C') == 1 and s.count('C') == 1:
s.remove('A')
s.remove('C')
if str(s).islower() == True:
print('AC')
else:
print('WA')
else:
print('WA') |
p03289 | s772859383 | Accepted | S = input()
ans = 'WA'
if S[0] == 'A':
if S[2 : -1].count('C') == 1:
if S[0].replace('A', 'a') + S[1] + S[2 : -1].replace('C', 'c') + S[-1] == S.lower():
ans = 'AC'
print(ans) |
p03289 | s222659587 | Accepted | """
1. The initial character of S is an uppercase A.
2. There is exactly one occurrence of C between the third character from the beginning and the second to last character (inclusive).
3. All letters except the A and C mentioned above are lowercase.
"""
import collections
def f(r): return r[0] == 'A' and collections.Counter(r[2:-1])['C'] == 1 and all([l in set(['A', 'C']) or l.lower() ==l for l in r ])
print 'AC' if f(raw_input()) else 'WA' |
p03289 | s743154242 | Accepted | S = input()
if not S[0] == 'A':
print('WA')
exit()
if not S[2:-1].count('C') == 1:
print('WA')
exit()
if not (S[1] + S[2:-1].replace('C', '') + S[-1]).islower():
print('WA')
exit()
print('AC')
|
p03289 | s254113759 | Accepted | # 25minutes.
# 簡単なのだが問題をちゃんと読めていないため'WA'を2回繰り返した！
l = list(input())
m = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')
x = 0
for j in l:
if j in m:
x += 1
a = 0
for i in range(2,len(l)-1):
if l[i] == 'C':
a += 1
if a == 1 and l[0] == 'A' and x == 2:
print('AC')
else:
print('WA')
|
p03289 | s109280472 | Accepted | s = input()
flag = False
if s[0]=="A":
if s[2:-1].count("C")==1:
if (s[1:s.index("C")].islower() and s[s.index("C")+1:].islower()):
flag = True
print("AC" if flag else "WA") |
p03289 | s915570413 | Accepted | s = input()
if s[0] != "A":
ans = "WA"
elif ord(s[1]) < 91:
ans = "WA"
elif ord(s[-1]) < 91:
ans = "WA"
else:
ans = "AC"
c = 0
for i in range(2, len(s) - 1):
if s[i] == "C":
c += 1
elif ord(s[i]) < 91:
ans = "WA"
break
if c != 1:
ans = "WA"
print(ans)
|
p03289 | s365893461 | Accepted | import re
s=input()
S=list(s)
if S[0]=="A" and S[2:-1].count('C')==1 and len(S)-len(re.findall('[a-z]',s))==2:
print('AC')
else:
print('WA')
|
p03289 | s629854167 | Accepted | S = list(input().strip())
f = True
if S[0] == "A":
S[0] = "a"
else:
S[0] = "X"
if S[2:-1].count("C") == 1:
S[S.index("C")] = "c"
else:
S[0] = "X"
if "".join(S) == "".join(S).lower():
print("AC")
else:
print("WA")
|
p03289 | s189994313 | Accepted | s=input();print('WAAC'['A'==s[0] and 'C'in s[2:-1] and s.count('C')==1 and s.count('A')==1 and s.replace('A','').replace('C','').islower()::2]) |
p03289 | s596851968 | Accepted | S = input()
flg1 = flg2 = flg3 = True
if not S[0] == 'A':
flg1 = False
if not S.count('C', 2, -1) == 1:
flg2 = False
j = len(S) + 1
for i in range(len(S)):
if S[i] == 'C':
j = i
for i in range(len(S)):
if i == 0 or i == j:
continue
else:
if S[i].islower() == False:
flg3 = False
flg = flg1 * flg2 * flg3
print('AC' if flg else 'WA')
|
p03289 | s437748016 | Accepted | s = input()
ok = True
ss = ''
# print(s[2:-1])
if s[0] == 'A':
if 'C' in s[2:-1]:
for i in range(len(s)):
if s[i].isupper():
ss += s[i]
if ss == 'AC':
pass
else:
ok = False
else:
ok = False
else:
ok = False
if ok:
print('AC')
else:
print('WA') |
p03289 | s742883456 | Accepted | S = input()
flag = 1
if S[0] != 'A':
flag = 0
if not 'C' in S[2:-1]:
flag = 0
cnt = 0
for i in S:
if i in [chr(i) for i in range(65, 65+26)]:
cnt += 1
if cnt != 2:
flag = 0
if flag:
print('AC')
else:
print('WA') |
p03289 | s048340708 | Accepted | #B - AcCepted
S = list(input())
judge = 0
if S[0].isupper() == True:
judge += 1
if 'C' in S[2:-1] and S.count('C') == 1:
judge += 1
if 'C' in S:
S.remove('C')
if 'A' in S:
S.remove('A')
if all(S[i].islower() for i in range(len(S))) == True:
judge += 1
if judge == 3:
print('AC')
else:
print('WA') |
p03289 | s655779718 | Accepted | S = input()
length = len(S)
match = True
if S[0] != "A":
match = False
elif S[2:length-1].count("C") != 1:
match = False
for i in S:
if i not in ["A", "C"] and i.isupper():
match = False
print("AC" if match else "WA") |
p03289 | s347565851 | Accepted | import re
S = input()
frag_1 = 0
frag_2 = 0
frag_3 = 0
if S.find("A") == 0:
frag_1 = 1
if 1 < S.find("C") and S.find("C") < len(S)-1:
frag_2 = 1
if len(re.findall('[A-Z]', S)) == 2:
frag_3 = 1
if frag_1 == 1 and frag_2 == 1 and frag_3 == 1:
print("AC")
else:
print("WA")
|
p03289 | s048762515 | Accepted | """
author : halo2halo
date : 23, Jan, 2020
"""
import sys
# import itertools
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
S = list(readline().decode('utf8').rstrip())
bl = S[0] == 'A'
bl &= ('C' in S[2:-1])
if bl:
S.remove('A')
S.remove('C')
bl &= all('a' <= x <= 'z' for x in S)
print('AC' if bl else 'WA')
|
p03289 | s925453234 | Accepted | S = list(input())
ans = 'AC'
if S[0] != 'A':
ans = 'WA'
if S[2:len(S) - 1].count('C') != 1:
ans = 'WA'
tmp = 0
for s in S:
if ord('a') <= ord(s) <= ord('z'):
tmp += 1
if tmp != (len(S) - 2):
ans = 'WA'
print(ans) |
p03289 | s903415111 | Accepted | import sys
s= input()
n =len(s)
Al = [chr(_) for _ in range(97,124)]
if s[0] == "A" and s[2:n-1:1].count("C")==1:
for i in range(1,n):
if not(s[i] in Al or s[i]=="C"):
print('WA')
sys.exit()
print('AC')
sys.exit()
else:
print('WA')
|
p03289 | s572807545 | Accepted | #104B
s = input()
c_list = []
c_count = 0
answer = "WA"
for i in range(2,len(s)-1):
if s[i] == "C":
c_list.append(i)
if s[i].islower() == False:
c_count += 1
if s[0]=="A" and s[1].islower()==True and s[-1].islower()==True and len(c_list)==1 and c_count==1:
answer="AC"
print(answer) |
p03289 | s380085399 | Accepted | S = input()
C_cnt = 0
if S[0] == 'A' and S[1].islower() and S[-1].islower():
temp = S[2:len(S)]
if temp.count('C') == 1:
for t in temp:
if t != "C" and t.isupper() == True:
print("WA")
exit()
else:
print("AC")
exit()
print("WA")
|
p03289 | s009570086 | Accepted | import string
s=string.ascii_lowercase
s+="C"
S=input()
buttanA=False
buttanB=False
buttanC=True
for i in range(len(S)):
if S[0]=="A":
buttanA=True
if S[i]=="C" and 2<=i<len(S)-1:
if buttanB==False:
buttanB=True
else:
print("WA")
exit()
if S[i] not in s and 1<=i<len(S):
buttanC=False
if buttanA==buttanB==buttanC==True:
print("AC")
else:
print("WA")
|
p03289 | s231397075 | Accepted | def solve():
S = input()
cnt = 0
if S[0] != 'A':
print('WA')
exit()
for i in range(1, len(S)):
if S[i].isupper():
if i == 1 or i == len(S) - 1 or S[i] != 'C':
print('WA')
exit()
cnt += 1
if cnt != 1:
print('WA')
exit()
print('AC')
if __name__ == "__main__":
solve() |
p03289 | s862466164 | Accepted | S=input()
if S[0]!='A':
print('WA')
exit()
count=0
for i in range(2,len(S)-1):
if S[i]=='C':
count+=1
if count!=1:
print('WA')
exit()
for i in range(2,len(S)-1):
if S[i]=='C':
break
S=S[1]+S[2:i]+S[i+1:len(S)]
if S.islower():
print('AC')
else:
print('WA') |
p03289 | s981538641 | Accepted | s=list(input())
print('AC' if (s[0]=='A') and ('C' in s[2:-1]) and all(i.islower() for i in s if not i in ['A','C']) and (s.count('A')==s.count('C')==1) else 'WA') |
p03289 | s931748015 | Accepted | import sys
s=input()
cnt=0
if s[0]!='A':
print('WA')
elif s[1].isupper():
print('WA')
elif s[-1].isupper():
print('WA')
else:
for i in range(2,len(s)-1):
if s[i]=='C':
cnt+=1
else:
if s[i].isupper():
print('WA')
sys.exit()
if cnt==1:
print('AC')
else:
print('WA') |
p03289 | s424435184 | Accepted | s = input()
cond = True
if s[0] != "A":
cond = False
if s[2:-1].count("C") != 1:
cond = False
s = s.replace("C", "")
if not s[1:].islower():
cond = False
print("AC" if cond else "WA")
|
p03289 | s967124473 | Accepted | s = input()
if s.count('C')==1:
a=s.index('C')
else:
a=0
print('AC' if s[0]=='A' and s.count('C')==1 and s[1:a]+s[a+1:]==(s[1:a]+s[a+1:]).lower() and 1<a<len(s)-1 else 'WA') |
p03289 | s019207060 | Accepted | s = input()
alphabet = 'abcdefghijklmnopqrstuvwxy'
ans = 'AC'
C_count = s.count('C')
if C_count == 1 and s[0] == 'A' and s[1] != 'C' and s[-1] != 'C':
s = s.replace('C', 'c')
for i in range(1, len(s)):
if s[i] in alphabet:
pass
else:
ans = 'WA'
break
else:
ans = 'WA'
print(ans)
|
p03289 | s933984863 | Accepted | S = list(input())
if S[0]!="A":
print("WA")
exit()
if S[2:len(S)-1].count("C")!=1:
print("WA")
exit()
count = 0
for i in range(0,len(S),1):
if ord(S[i])<95:
count+=1
if count !=2:
print("WA")
exit()
print("AC") |
p03289 | s696288722 | Accepted | import re
S = input()
result = re.match('^A[a-z]{1}[a-z]{0,6}C[a-z]{1,7}$', S)
if result:
print('AC')
else:
print('WA') |
p03289 | s824011811 | Accepted | s = input()
if s[0]=="A" and s[2:-1].count("C")==1 and s.replace("A","").replace("C","").islower():
print("AC")
else:
print("WA") |
p03289 | s407408113 | Accepted | s = str(input())
if s[0] == 'A' and s[2:-1].count('C') == 1 and (s[1:s.find('C')] + s[s.find('C')+1:]).islower():
print('AC')
else:
print('WA') |
p03289 | s897349510 | Accepted | s=input()
print("AC" if "C" in s[2:-1] and "A" in s and s[1:].replace("C","",1).islower() else "WA") |
p03289 | s953659275 | Accepted | S=input()
if S[0]!="A":
print("WA")
exit()
else:
if S[2:-1].count("C")!=1:
print("WA")
exit()
else:
x=S.index("C")
for i in range(len(S)):
if i==0 or i==x:
pass
else:
if 65<=ord(S[i])<=90:
print("WA")
exit()
print("AC") |
p03289 | s908116052 | Accepted | import sys
S = input()
if not (S[0] == "A" and "C" in S[2:len(S)-1]):
print("WA")
sys.exit()
S = sorted(S)
if not S[1] == "C":
print("WA")
sys.exit()
if not "a" <= S[2] <= "z":
print("WA")
sys.exit()
print("AC") |
p03289 | s501304134 | Accepted | S = input()
F = True
if S[0] != "A":
F =False
if not("C" in S[2:-1]):
F = False
if S[1:].count("C")==1:
for i in range(1,len(S)):
if S[i] != "C" and S[i].isupper():
F = False
elif S[1:].count("C")>1:
F = False
print("AC" if F else "WA")
|
p03289 | s523076766 | Accepted | s = str(input())
if s[0] == 'A' and s[2:-1].count('C') == 1 and (s[1:s.find('C')] + s[s.find('C')+1:]).islower():
print('AC')
else:
print('WA')
|
p03289 | s946470448 | Accepted | s=input()
print("AC" if "C"in s[2:-1]and "A"in s and s[1:].replace("C","",1).islower()else "WA") |
p03289 | s432108884 | Accepted | s = input()
if s[0] == "A":
x = s.find("C")
if 2<=x and x != len(s)-1:
s = [i for i in s]
s[0]="a"
s[x]="c"
s = "".join(s)
if s.islower():
print("AC")
exit()
print("WA") |
p03289 | s870955999 | Accepted | from collections import Counter
s = input()
fist = s.replace('A', '').replace('C', '')
if not fist.islower():
print('WA')
else:
seco = s[2:-1]
cnt = Counter(seco)
if not cnt['C'] == 1:
print('WA')
else:
if s[0] == 'A':
print('AC')
else:
print('WA') |
p03289 | s538058264 | Accepted | s = input()
ok = True
ok &= s[0] == 'A'
ok &= s[2:-1].count('C') == 1
ok &= s[1:].replace('C', '').islower()
print('AC' if ok else 'WA')
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.