Educational Codeforces Round 21 A

A. Lucky Year
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Apart from having lots of holidays throughout the year, residents of Berland also have whole lucky years. Year is considered lucky if it has no more than 1 non-zero digit in its number. So years 100, 40000, 5 are lucky and 12, 3001 and 12345 are not.

You are given current year in Berland. Your task is to find how long will residents of Berland wait till the next lucky year.

Input
The first line contains integer number n (1 ≤ n ≤ 109) — current year in Berland.

Output
Output amount of years from the current year to the next lucky one.

Examples
input
4
output
1
input
201
output
99
input
4000
output
1000
Note
In the first example next lucky year is 5. In the second one — 300. In the third — 5000.

暴力来了一发，果然T了。
正确姿势是先求出这个数的下一个符合条件的数，然后用此数减去原数即可。
符合条件的数就是高位不为0，其他为0.其实就是把给的数高位+1，其他为全变成0即可，只是个位数的时候直接输出1即可。

#include<stdio.h>
#include<string.h>
#include<string>
#include<iostream>
#include<algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define LL long long
using namespace std;
const int maxn=1e5;
int main()
{
    int n;string s;
    while(cin>>s)
    {

        //cin>>s;
        LL ans=1;
        LL ans2=0;
        for(int i=0;i<s.size();i++)
        {
            ans2=ans2*10+s[i]-'0';
        }
        //printf("%lld\n",ans2);
        int k=s.size();

        if(k==1)
        {
            printf("1\n");
        }
        else
        {
            int a=s[0]-'0';
            for(int i=1;i<k;i++)
                ans*=10;
            ans*=(a+1);
            printf("%lld\n",ans-ans2);
        }

    }
    return 0;
}