fork download 
  1. def rek(s, idx):
  2.     if idx == len(s) - 1:
  3.         return 1
  4.     else:
  5.         sum = 0
  6.         for i in range(idx + 1, min(idx + 7, len(s))):
  7.             if (s[i] == '0'):
  8.                 continue
  9.  
  10.             sum += rek(s, i)
  11.         return sum
  12.  
  13.  
  14.  
  15. def alg(n, k, s):
  16.     return rek (s, 0) % k # liczba sposobów (modulo k), na jaką można dojść z pola 1 do pola n pozostając żywym
  17.  
  18. in0, in1 = map(int, input().split())
  19. in2 = input()
  20.  
  21. # out = 4
  22.  
  23. # sposoby: (1,2,3), (1, 5), (3, 3), (6)
  24.  
  25. print (alg(in0, in1, in2))
Success #stdin #stdout 0.04s 9416KB
comments (?)
stdin 
7 23
1101001
stdout 
4
https://ideone.com/k1g2H3
language:
Python 3 (python  3.12)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!