�� : ��

��

��
�� F(n), �� n??— �� , �� :
F �� n �� = n, �� n �� 9,
F �� n �� = F �� n mod 9 �� F �� n div 9 �� , �� n �� = 9.
�� n �� [4?·?6²⁰; 5?·?6²⁰], �� F �� n �� = 121.

�� P - �� . �� P^k �� m?
�� , � �� .

�� Z = {0:1, ..., p-1:1}
Z - �� k =1
�� "��" �� , �� Z₂ = Z "��" Z �� k = 2 � �.�.

def mult(x,y):
    xy = dict()
    for i in x:
        for j in y:
            r = x[i] * y[j]
            if i+j in xy : xy[i + j] += r
            else : xy[i+j] = r
    return xy
P = int(input())
Z = { i : 1 for i in range (P)}
Dall = {1 : Z}
for i in range (2,9) :
  Dall[i] = mult(Dall[i-1],Z)
  print(i, len(Dall[i]))

� �� xP^k? �� {1:1, ..., x-1} �� P^k

def mult(x,y):
    xy = dict()
    for i in x:
        for j in y:
            r = x[i] * y[j]
            if i+j in xy : xy[i + j] += r
            else : xy[i+j] = r
    return xy
  
def start(k,P):
  Z = { i : 1 for i in range (P)}
  Dall = {0: {0 :1}, 1 : Z}
  for i in range (2,9) :
    Dall[i] = mult(Dall[i-1],Z)
  return Dall
P =int(input())
sN = input()[::-1]
k = len(sN)
DDD = start(k,P)
ans = { i : 1 for i in range (int(s)+1)}
ki = 0 
for s in sN[1:] :
  ki+=1
  if int(s) == 0 : continue                            
  a = { i : 1 for i in range (int(s))}
  b = mult(a,DDD[ki])
  for i in b :
    if i in ans : ans[i] += b[i]
    else : ans[i] = b[i]  
print(sorted(ans,items()) )

��

����� ���� ���� ����� � �������

��