uva1583

题目自己去官网查 uva.onlinejudge.org.

本题的技巧：变被动为主动，用打表的方法（即预先把答案存起来），让效率提高。

/*ID: Ben bissPROG: #####LANG: C++*/#include <iostream>using namespace std;#include<cstring>#include <fstream>#include<cmath>#include<string>#include<cstdlib>#include<algorithm>#include<stack>#include<vector>#include<map>#include<queue>#define FOR(i,n) for(i=0;i<n;i++)//#define cin fin//#define cout foutint arr[1000000+50];int main(){    //ofstream fout ("#####.out");    //ifstream fin ("#####.in");    int T,sum,n,i,x;    for(i=1;i<=1000000;i++)    {        sum=i,x=i;        while(x>0){sum+=x%10;x/=10;}        if(arr[sum]==0||i<arr[sum])arr[sum]=i;    }    cin>>T;    while(T--)    {        cin>>n;        cout<<arr[n]<<endl;    }return 0;}