UVa1583 - Digit Generator

简介: UVa1583 - Digit Generator
#include <iostream>#include <fstream>usingnamespacestd;
voidsolve(intn);
intmain()
{
#ifndef ONLINE_JUDGEifstreamfin("d:\\OJ\\uva_in.txt");
streambuf*old=cin.rdbuf(fin.rdbuf());
#endif // ONLINE_JUDGEintn;
cin>>n;
while (n--) {
intnum;
cin>>num;
solve(num);
    }
#ifndef ONLINE_JUDGEcin.rdbuf(old);
#endif // ONLINE_JUDGEreturn0;
}
voidsolve(intn)
{
intdigits=0;
intnum=n;
while (num) {
digits++;
num/=10;
    }
boolfound=false;
for (inti=n-digits*9; i<n; i++) {
intsum=i;
num=i;
while (num) {
sum+=num%10;
num/=10;
        }
if (sum==n) {
found=true;
cout<<i<<endl;
break;
        }
    }
if (!found) cout<<0<<endl;
}
目录
相关文章
|
6月前
|
机器学习/深度学习
hdu 1061 Rightmost Digit
hdu 1061 Rightmost Digit
17 0
HDU-1048,The Hardest Problem Ever(字符串处理)
HDU-1048,The Hardest Problem Ever(字符串处理)
HDOJ/HDU 1075 What Are You Talking About(字符串查找翻译~Map)
HDOJ/HDU 1075 What Are You Talking About(字符串查找翻译~Map)
114 0
HDOJ(HDU) 1898 Sempr == The Best Problem Solver?(水题、、、)
HDOJ(HDU) 1898 Sempr == The Best Problem Solver?(水题、、、)
100 0
HDOJ(HDU) 1562 Guess the number(水题,枚举就行)
HDOJ(HDU) 1562 Guess the number(水题,枚举就行)
97 0
|
机器学习/深度学习 网络架构
题解 UVA10212 【The Last Non-zero Digit.】
题目链接 这题在学长讲完之后和看完题解之后才明白函数怎么构造。这题构造一个$f(n)$$f(n)$ $=$ $n$除以 $2^{a}$ $*$ $5^{b}$ ,$a$ , $b$ 分别是 $n$ 质因数分解后$2,5$的个数。
1205 0
|
人工智能
HDOJ(HDU) 1562 Guess the number(水题,枚举就行)
Problem Description Happy new year to everybody! Now, I want you to guess a minimum number x betwwn 1000 and 9999 to let (1) x % a = 0;...
1044 0