/139C.py

https://bitbucket.org/alculquicondor/codeforces · Python · 42 lines · 39 code · 3 blank · 0 comment · 22 complexity · fafde55aa4e013529f3b892a0cf975e3 MD5 · raw file

  1. k=0
  2. def isvowel(s):
  3. return s=='a' or s=='e' or s=='i' or s=='o' or s=='u'
  4. def qsch(A):
  5. for j in range(len(A)):
  6. x=A[j]
  7. i=len(x)-1
  8. c=0
  9. while i>=0:
  10. if isvowel(x[i]):
  11. c+=1
  12. if(c==k):
  13. break
  14. i-=1
  15. if(c<k):
  16. return 'NO'
  17. A[j]=x[i:]
  18. if(A[0]==A[1]==A[2]==A[3]):
  19. return 'aaaa'
  20. if(A[0]==A[1] and A[2]==A[3]):
  21. return 'aabb'
  22. if(A[0]==A[2] and A[1]==A[3]):
  23. return 'abab'
  24. if(A[0]==A[3] and A[1]==A[2]):
  25. return 'abba'
  26. return 'NO'
  27. n,k=[int(x) for x in raw_input().split()]
  28. ans='aaaa'
  29. for i in range(n):
  30. A=[]
  31. for j in range(4):
  32. A.append(raw_input())
  33. tt=qsch(A)
  34. if ans=='aaaa':
  35. ans=tt
  36. elif ans!=tt and tt!='aaaa':
  37. ans='NO'
  38. break
  39. print ans