|Submit||All submissions||Best solutions||Back to list|
TOTIENT - Totient function
|Wersja polska||English version|
In number theory φ(n) is defined to be the number of positive integers less than or equal to n that are coprime to n.
The first line of the standard input contains one integer t (t<101) which is the number of test cases.
In each of the next t lines there is one integer n (n<2*10^9).
For each test, print φ(n).
|Added by:||Piotr Kąkol|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: NODEJS OBJC SCM qobi VB.NET|
2014-03-10 10:47:49 Piotr KÄ…kol
Thanks for the info. Fixed. Seems spoj.pl is down.
2014-03-05 14:21:22 Hallvard Norheim Bø
@Piotr: I found the reason for failure.
Math.factor() only does trial divison by the first 1024 primes!
Also note that all links on the SHORTEN pages which starts with
spoj.pl has stopped working. On the Links page, the RSS feed, etc.
2014-03-01 02:11:11 Piotr KÄ…kol
You have WA for 490645137.
2014-02-27 18:31:53 Hallvard Norheim Bø
@Piotr: for what input is my latest Pike submission (#11149257) wrong?
2014-02-14 01:55:38 Piotr KÄ…kol
I made a rejudge after adding a test with some small numbers. Feel ashamed for not checking boundary cases, sorry.
2010-08-10 13:46:00 Piotr KÄ…kol
Number of test cases was reduced to 100.
2010-04-01 16:36:51 numerix
2010-03-29 14:46:50 Piotr KÄ…kol
I changed time limit from 10 to 15 sec. ;-)
// And from 15 to 20. :-)
Last edit: 2010-05-18 07:31:52