fork download
  1. import math
  2. def find(u, par):
  3.  
  4. if par[u] != u:
  5. par[u] = find(par[u], par)
  6. return par[u]
  7.  
  8. def union(u, v, par, size):
  9. u_root = find(u, par)
  10. v_root = find(v, par)
  11.  
  12. if u_root == v_root:
  13. return
  14.  
  15.  
  16. if size[u_root] < size[v_root]:
  17. par[u_root] = v_root
  18. size[v_root] += size[u_root]
  19. else:
  20. par[v_root] = u_root
  21. size[u_root] += size[v_root]
  22.  
  23. def ip():
  24. return map(int,input().split())
  25.  
  26. def f(k):
  27. # print()
  28. curr=0
  29. rem=-1
  30. for i in range(n):
  31. # print(i,curr,rem)
  32.  
  33. if curr==0 and b[i]>=k-1:
  34. curr=1
  35. continue
  36. if curr<=a[i] and b[i]>=k-(curr+1):
  37. curr+=1
  38. # print(i,curr,rem)
  39. if curr>=k:
  40. return True
  41. return False
  42.  
  43.  
  44.  
  45.  
  46.  
  47. T=1
  48. # T=int(input())
  49. for __ in range(T):
  50. n,k=ip()
  51. res=[]
  52. if k>=n:
  53. res=[chr(i+ord('a')) for i in range(n)]
  54. print("".join(res))
  55. continue
  56.  
  57.  
  58. for i in range(k):
  59. a=chr(i+ord('a'))
  60. # if i==k:
  61. # res.append(a)
  62. # continue
  63. for j in range(i,k):
  64. b=chr(j+ord('a'))
  65. if len(res)==n:
  66. break
  67. elif n-len(res)==1:
  68. res.append(b)
  69. else:
  70. res.append(a)
  71. res.append(b)
  72. while len(res)<n:
  73. res.append("a")
  74. # print(len(res))
  75. print("".join(res))
  76.  
Success #stdin #stdout 0.1s 14140KB
stdin
5 2
stdout
aaabb