本文共 1201 字，大约阅读时间需要 4 分钟。
Chilly Willy loves playing with numbers. He only knows prime numbers that are digits yet. These numbers are2, 3, 5 and 7. But Willy grew rather bored of such numbers, so he came up with a few games that were connected with them.
Chilly Willy wants to find the minimum number of length n, such that it is simultaneously divisible by all numbers Willy already knows (2,3, 5 and 7). Help him with that.
A number's length is the number of digits in its decimal representation without leading zeros.
A single input line contains a single integer n (1 ≤ n ≤ 105).
Print a single integer — the answer to the problem without leading zeroes, or "-1" (without the quotes), if the number that meet the problem condition does not exist.
1
-1
5
10080
#include#include using namespace std;int main(){ int n; scanf("%d",&n); if(n<3) printf("-1\n");//此时没有答案 else if(n==3) printf("210\n");//容易算出210 else//后面的数根据规律来算 { printf("1"); int m=50; for(int i=0;i
转载地址：http://dpzgf.baihongyu.com/