*special problem implementation number theory *1200

Please click on ads to support us..

Python Code:

a, b, m, r = map(int, input().split())

l = []
s = set()

while True:
	n = ((a * r) + b) % m	
	l.append(n)
	
	if len(s & {n}) == 1:
		break
	else:	
		s.add(n)
				
	r = n
	
for i in range(len(l)):
	if l[i] == l[-1]:
		print(len(l) - i - 1)
		break


Comments

Submit
0 Comments
More Questions

1637B - MEX and Array
224A - Parallelepiped
964A - Splits
1615A - Closing The Gap
4C - Registration System
1321A - Contest for Robots
1451A - Subtract or Divide
1B - Spreadsheet
1177A - Digits Sequence (Easy Edition)
1579A - Casimir's String Solitaire
287B - Pipeline
510A - Fox And Snake
1520B - Ordinary Numbers
1624A - Plus One on the Subset
350A - TL
1487A - Arena
1520D - Same Differences
376A - Lever
1305A - Kuroni and the Gifts
1609A - Divide and Multiply
149B - Martian Clock
205A - Little Elephant and Rozdil
1609B - William the Vigilant
978B - File Name
1426B - Symmetric Matrix
732B - Cormen --- The Best Friend Of a Man
1369A - FashionabLee
1474B - Different Divisors
1632B - Roof Construction
388A - Fox and Box Accumulation