两个吃奶一个添下面视频_人妻第一页香蕉网_欧美xxxx少妇_妺妺窝人体色www婷婷

1422 問題 E: m and n

時間限制: 1s 內存限制: 128MB 提交: 62 解決: 8
題目描述

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
提示
零基礎同學可以先學習視頻課程,包含C/C++、Python、百練、藍橋杯輔導、算法數據結構等課程,提供視頻講解以及配套習題,還有老師答疑,點擊這里了解課程詳情

比賽公告

七月月賽  大家加油!

本次月賽獎品高級鼠標一個!