uva 1583 B

B - Digit Generator

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit Status

Description

 

For a positive integer N<tex2html_verbatim_mark> , the digit-sum of N<tex2html_verbatim_mark> is defined as the sum of N<tex2html_verbatim_mark> itself and its digits. When M<tex2html_verbatim_mark> is the digitsum of N<tex2html_verbatim_mark> , we call N<tex2html_verbatim_mark> agenerator of M<tex2html_verbatim_mark> .

For example, the digit-sum of 245 is 256 (= 245 + 2 + 4 + 5). Therefore, 245 is a generator of 256.

Not surprisingly, some numbers do not have any generators and some numbers have more than one generator. For example, the generators of 216 are 198 and 207.

You are to write a program to find the smallest generator of the given integer.

Input 

Your program is to read from standard input. The input consists of T<tex2html_verbatim_mark> test cases. The number of test cases T<tex2html_verbatim_mark> is given in the first line of the input. Each test case takes one line containing an integer N<tex2html_verbatim_mark> , 1N100, 000<tex2html_verbatim_mark> .

Output 

Your program is to write to standard output. Print exactly one line for each test case. The line is to contain a generator of N<tex2html_verbatim_mark> for each test case. If N<tex2html_verbatim_mark> has multiple generators, print the smallest. If N<tex2html_verbatim_mark> does not have any generators, print 0.

The following shows sample input and output for three test cases.

Sample Input 

3 
216 
121 
2005

Sample Output 

198 
0 
1979

一开始从1开始枚举，tle了
稍微想一下就会发现．．最多6位数．．所以目标数字与n最多差6*9==54
所以直接从n-54枚举到n即可．

/*************************************************************************
    > File Name: code/uva/1583.cpp
    > Author: 111qqz
    > Email: rkz2013@126.com 
    > Created Time: 2015年09月15日 星期二 16时47分20秒
 ************************************************************************/

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<stack>
#include<cctype>
#define y1 hust111qqz
#define yn hez111qqz
#define j1 cute111qqz
#define ms(a,x) memset(a,x,sizeof(a))
#define lr dying111qqz
using namespace std;
#define For(i, n) for (int i=0;i<int(n);++i)  
typedef long long LL;
typedef double DB;
const int inf = 0x3f3f3f3f;
int n ;
bool judge(int x,int y)
{
    int r;
    int sum = 0;
    int tmp = y-x;
    while (x)
    {
           
    r = x % 10;
    x = x/10;
    sum = sum + r;
    }
    
    if (sum==tmp) return true;
    return false;
}
int main()
{
  #ifndef  ONLINE_JUDGE 
    freopen("in.txt","r",stdin);  
  #endif
    int T;
    cin>>T;
    while (T--)
    {
    scanf("%d",&n);

    int ans = 0 ;
    int st = n-54;
    for ( int i = st ; i <= n ;i++)
    {
        if (judge(i,n))
        {
        ans =  i;
        break;
        }
    }
    printf("%d
",ans);
    }
  
  
 #ifndef ONLINE_JUDGE  
  fclose(stdin);
  #endif
    return 0;
}