China remainder theorem 1 (codevs 3040)

Title Description Description

Excerpt from an Introduction to algorithms ...

The number of the remainder is 2,3,2 when the first k is 3,5,7 removed;

Enter a description Input Description

A number k.

Output description Output Description

Find the number of K qualifying.

Sample input Sample Input

1

Sample output Sample Output

23

Data range and Tips Data Size & Hint

k>=1;

The answer is no more than the range that long long can store.

A typical number theory problem.

// Chinese remainder theorem water problem #include <cstdio>#include<iostream>usingnamespace  STD; int Main () {    longlong ans=, K;    Cin>>K;    Ans+ = (k1)*;    cout<<ans;     return 0 ;}

View Code

China remainder theorem 1 (codevs 3040)