ETFS  Euler Totient Function Sieve
In number theory, the totient phi(n) of a positive integer n is defined to be the number of positive integers less than or equal to n that are coprime to n.
Input
The lonely line in input contains two integers a, b.
Output
Print phi(n) for n from a to b (inclusive).
Example
Input: 1 5 Output: 1 1 2 2 4
Constraints
0 < a < b < 10^14 b  a < 10^5
Python can get AC under half the time limit (for any test case). My total PY3.4 time is 3.23s for 5 input files.
Have fun ;)
hide comments
ashik_01:
20190808 19:52:13
Just a superb problem. Learned something new. Thanks to the author. 

abhinav_jain02:
20181219 13:33:51
I am getting wrong answer on test case 4. I have checked my code multiple times. Can somebody give me a hint.


eagleshadow:
20181003 16:23:00
Very nice Problem


jmr99:
20180816 16:55:46
nice problem! Last edit: 20180816 21:43:53 

yashraj9892:
20180418 19:38:50
can any one tell me Why am i getting sigbus error


jayanth_123:
20171230 11:38:36
Last edit: 20171230 12:13:25 

sanki_hu:
20170517 17:39:19
Thanks Francky , Finally AC . Awesome Problem dude. Rank28


sanki_hu:
20170517 15:01:45
@Francky Please check my solution id 19424022 .I have done several optimizations and my algo is also correct but i am getting TLE again and again.


ashishgup:
20170321 00:58:49
Getting internal error. Please fix it.


awesomeabhinav:
20161229 13:23:16
My solution id is 18481441, Got AC but need much more faster algorithm. PLS suggest another efficient way to do this problem

Added by:  Francky 
Date:  20141229 
Time limit:  2s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  ETF 