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

1422 問題 B: m and n

時(shí)間限制: 1s 內(nèi)存限制: 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
提示
零基礎(chǔ)同學(xué)可以先學(xué)習(xí)視頻課程,包含C/C++、Python、百練、藍(lán)橋杯輔導(dǎo)、算法數(shù)據(jù)結(jié)構(gòu)等課程,提供視頻講解以及配套習(xí)題,還有老師答疑,點(diǎn)擊這里了解課程詳情

比賽公告

七月暑假月賽...

剛把得~