问题 B: m and n

时间限制: 1Sec 内存限制: 128MB 提交: 0 解决: 0

题目描述

S(m,n) = { k1, k2, k3, ..., kx }, Each ki can meet n % ki + m % ki >= ki. Now output the sum of phi(ki) , (1<= i <=x) which stands for the number of ki's relatively prime which are smaller than ki .

输入

Input contains multiple test cases, no more than 100. Each has a line contains two integer m , n (1<=m,n<108).

输出

For each test cases, output the sum of phi(ki) (1<=i<=x).

样例输入
2 3
样例输出
6
提示

m=2, n=3. So  S{2,3} = {4,5}, phi(4)+phi(5)=6

比赛公告

七月暑假月赛...

刚把得~