I just do maxsimum 30 iteration on my super all doing bruteforce and this give me right ans and i got ac

phi(n) is not equal to number of coprime less than n, IT IS THE NUMBER OF COPRIMES LESS THAN OR EQUAL TO N. the formula of phi(n) work for all except a special number.

Is it true that k=f(n), where f(n) is Euler function?

Edited by author 13.02.2009 22:03

144
->185
29756
->29929
800000000
->1001578525
41088
->51365
123456
->123457
1369
->0
369
->0
1024
->1285
58
->59
21414
->0
2000000000
->2500015625
961
->0
1870
->1871
23432
->35151

P.S. use long long (else WA7)

If K=8,
i.e 1,2,3,4,5,6,7,8 students.
Now, each student has to sit for at least 1 lab of each professor.

For N=11,
Students 1 will sit in all labs, hence qualified for exam.
Students 2 will sit in labs: 2,4,6,8,10,12,14,16,18,20,22. hence qualified for exam. (At least 1 lab of all Prof covered)
Students 3 will sit in labs: 3,6,9,12,15,18,21,24,27,30,33 labs. hence qualified for exam. (At least 1 lab of all Prof covered)
.
.
.
Similarly Student 8 will sit in 8,16,.....,88 labs, hence qualified for exam.  (At least 1 lab of all Prof covered)



Please help, where I'm wrong.

What in 7 th test?!

What in 7 th test???
I've tested my inverse eiler function. It works!

How to pass this test? I got WA for several times.

On test k=1764 my prog returns incorrect answer, but I have AC on this problem. Please, add this test.

Edited by author 14.02.2009 19:58

if n=15 => k=11 and for k=8 right answer is 0!

 I use system("pause") to see the result. I see my program pass with a lot of numbers.
But i got WA for test #5 !
any ideas ?

I'm the only author submit this problem :">

Edited by author 10.01.2009 14:53

Edited by author 10.01.2009 14:53