Обсуждение @ 1268. Маленький Чу @ Timus Online Judge

liuchang A easy problem [16] // Задача 1268. Маленький Чу 10 июн 2004 21:30

You may run it on your own computer.
Then you'll get the all answers.
Then......Got AC!!!

I ran the program for 2.5 hours in all!!!

Pasha Re: A easy problem [15] // Задача 1268. Маленький Чу 12 июл 2004 15:20

Yes, it was interesting to find all simple numbers in range 3 .. 65521 (There is only 6541 simple number in this range!) and calculate answer for each of them using SMART brute-force. It had taken only 17 minutes! And AC program weights about 91501 bytes!

Dmitry 'Diman_YES' Kovalioff A mathematical solution based on modular arithmetics gets AC within 0.25 s. (-) [2] // Задача 1268. Маленький Чу 12 июл 2004 21:30

Saturn Re: A mathematical solution based on modular arithmetics gets AC within 0.25 s. (-) [1] // Задача 1268. Маленький Чу 13 июл 2004 15:04

How to solve this problem by maths?

Dmitry 'Diman_YES' Kovalioff It is difficult to explain... (+) // Задача 1268. Маленький Чу 13 июл 2004 19:36

Read "Introduction to Algorithms", chapter 33 - modular arithmetics, group generators, Lagrange theorem, etc.

Future Re: A easy problem // Задача 1268. Маленький Чу 5 окт 2004 13:32

17 minutes? What kind of so called "smart brute-force"?
You can send to fujieyun@163.com to tell me your way.
Thanks.

Kit (Vologda SPU) Whole 17 minutes? My program takes about 30 seconds :-) (-) [5] // Задача 1268. Маленький Чу 9 сен 2005 00:19

Edited by author 09.09.2005 00:20

Someone Re: Whole 17 minutes? My program takes about 30 seconds :-) (-) [4] // Задача 1268. Маленький Чу 19 мар 2006 03:51

How did you reach this time?

Someone Re: Whole 17 minutes? My program takes about 30 seconds :-) (-) [3] // Задача 1268. Маленький Чу 19 мар 2006 15:54

Ok. I submited it. My worked 27 sec.

ACM.Tolstobrov_Anatoliy[Ivanovo SPU] you only now got AC. [2] // Задача 1268. Маленький Чу 19 мар 2006 17:17

Vladimir Yakovlev(USU)
91501 bytes > 64000 bytes

Where rejudge?

P.S. I too got AC with cheating [ 38kb ].

Someone Re: you only now got AC. [1] // Задача 1268. Маленький Чу 19 мар 2006 23:25

I think 38Kb it's enough, because to solve this problem with cheating you need only one array [1..6541] of word constans.

ACM.Tolstobrov_Anatoliy[Ivanovo SPU] Re: you only now got AC. // Задача 1268. Маленький Чу 20 мар 2006 00:36

YES YES YES.
i do it.

xurshid_n Re: A easy problem // Задача 1268. Маленький Чу 3 июл 2006 17:12

Please, send me your solution my E-mail: xujand000@rambler.ru

xurshid_n Re: A easy problem [3] // Задача 1268. Маленький Чу 3 июл 2006 17:15

for n are:
3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 and 53
K :
2, 3, 5, 8, 11, 14, 15, 21, 27, 24, 35, 35, 34, 45 and 51
is right?

AlexF Re: A easy problem [2] // Задача 1268. Маленький Чу 31 авг 2006 14:49

xurshid_n писал(a) 3 июля 2006 17:15

for n are:
3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 and 53
K :
2, 3, 5, 8, 11, 14, 15, 21, 27, 24, 35, 35, 34, 45 and 51
is right?

Yes, it's right!

esger Re: A easy problem [1] // Задача 1268. Маленький Чу 8 дек 2012 13:48

Why the answer for 41 is 35?
if k=35, then doomsday will be 22th attempt. but if k = 39, the repetition will be after 42 sleep.

Eugene Re: A easy problem // Задача 1268. Маленький Чу 12 июн 2014 17:06

Nope. 39^21 == 39^1 mod 41
http://www.wolframalpha.com/input/?i=39%5E21+mod+41

Обсуждение задачи 1268. Маленький Чу