（水题）987654321 problem -- SGU 107

链接：

http://vj.acmclub.cn/contest/view.action?cid=168#problem/G

时限:250MS     内存:4096KB     64位IO格式:%I64d & %I64u

提交 状态 练习 SGU 107

问题描述

 

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<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<queue>

using namespace std;

const long long MOD = 1000000000;

 int main()
 {
     int n;
     while(scanf("%d", &n)!=EOF)
     {

         /*

         int ans=0;
         for(long long i=1; i<=n; i++)
         {
             if((i*i)%MOD==987654321)
                ans ++ ;
         }
         */

         if(n<=8)
            printf("0
");
         else if(n==9)
            printf("8
");
        else
        {
            printf("72");

            for(int i=11; i<=n; i++)
                printf("0");
            printf("
");
        }

     }
    return 0;
 }