Problem A. The Euler function

时间限制 1000 ms   内存限制 32 MB

The Euler function phi is an important kind of function in number theory, (n) represents the amount of the numbers which are smaller than n and coprime to n, and this function has a lot of beautiful characteristics. Here comes a very easy question: suppose you are given a, b, try to calculate (a)+ (a+1)+....+ (b)
 

输入数据

There are several test cases. Each line has two integers a, b (2<a<b<3000000).
 

输出数据

Output the result of (a)+ (a+1)+....+ (b)
 

样例输入

复制
3 100

样例输出

复制
3042

提交

请先 登录

© 2025 FAQs Contact About