Nowara_Shinnosuke的博客

Bert is a programmer with a real fear of floating point arithmetic. Bert has quite successfully used rational numbers to write his programs but he does not like it when the denominator grows large. Yo

nn pagodas were standing erect in Hong Jue Si between the Niushou Mountain and the Yuntai Mountain, labelled from 11 to nn. However, only two of them (labelled aa and bb, where 1≤a≠b≤n1≤a≠b≤n)

给出正整数 n 和 m，统计满足以下条件的正整数对 (a,b) 的数量： 1. 1≤a≤n,1≤b≤m; 2. a×b 是 2016 的倍数。 Input 输入包含不超过 30 组数据。 每组数据包含两个整数 n,m (1≤n,m≤10 9). Output对于每组数据，输出一个整数表示满足条件的数量。

One day I was shopping in the supermarket. There was a cashier counting coins seriously when a little kid running and singing "门前大桥下游过一群鸭，快来快来 数一数，二四六七八". And then the cashier put the counted coins ba

Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can divided exactly by any integers in the set. For example, N=12, and M-integer s

Given a number N, you are asked to count the number of integers between A and B inclusive which are relatively prime to N.  Two integers are said to be co-prime or relatively prime if they have no co

Description After all the fundraising, campaigning and debating, the election day has finally arrived. Only two candidates remain on the ballot and you work as an aide to one of them. Reports from t

参考：http://blog.youkuaiyun.com/u013632138/article/details/52250567           http://blog.youkuaiyun.com/xlzhang223/article/details/76218088 #include #include #include #include using namespace std; typedef long l