987654321 problem

987654321 problem

Time Limit:500MS     Memory Limit:4096KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

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<=10⁶)

Output

Write answer to the output.

Sample Input

8

Sample Output

0

个人理解,平方的后九位数只受本身的后9位数影响.当N<=8时,数不存在;当N=9时,有8种方法.当N=10时,第十位上的数有9种可能,所以共8*9=72种.N>10时,只要在72后面加N-10个"0"就可以了.具体代码如下:

#include <iostream>
using namespace std;

int main()
{
    int n,i;
    cin >> n;
    if(n < 9)
    {
         cout << "0" << endl;
    }
    else if(n == 9)
    {
         cout << "8" << endl;
    }
    else 
    {
         cout << "72" ;
         for (int i = 11; i <= n; i++)
         {
             cout << "0";
         }
         cout << endl;
    }
    return 0;
}