107. 987654321 problem time limit per test: 0.25 sec. For given number N you must output amount of N-digit numbers, such, that last digits of their square is equal to 987654321. Input Input contains integer number N (1<=N<=106) Output Write answer to the output. Sample Input 8 Sample Output 0 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
// //freopen("out.txt" , "w" , stdout);
// for(long long i = (long long)(sqrt(987654321.0)) ; i <= 999999999 ; i++)
// {
// if(i * i % 1000000000 == (long long)987654321)
// {
// cout << i << endl;
// }
cout << (i * i) % 10000000000 << '+' << endl;
// }
int n;
while(~scanf("%d" , &n))
{
if(n < 9)printf("0\n");
else if(n == 9)printf("8\n");
else
{
printf("72");
for(int i = 10 ; i < n ;i++)
{
printf("0");
}
puts("");
}
}
return 0;
}