Classroom Watch (Codeforces Round #441 (Div.2) )
2017-11-09 09:42
106 查看
#include <cstdio> #include <algorithm> using namespace std; int n; int ans[300]; int main() { while(~scanf("%d",&n)) { int now = max(n-90,0); int a,b,k=0; for(int i=now;i<=n;i++) { a=b=i; while(b) { a+=b%10; b/=10; } if(a==n) ans[k++]=i; } printf("%d\n",k); for(int i=0;i<k;i++) printf("%d\n",ans[i]); } return 0; }
相关文章推荐
- Codeforces Round #441 (Div.2) - C - Classroom Watch
- Codeforces Round #441 (Div.2) - C - Classroom Watch
- #301 (div.2) D. Bad Luck Island
- codeforces Round#158 Div.2 C
- #101 (div.2) A. Amusing Joke
- BestCoder Round #50 (div.2) 1001
- HDU 5391 Zball in Tina Town(数论——威尔逊定理)——BestCoder Round #51(div.2)
- #317 (div.2) C. Lengthening Sticks
- HDU 5054 Alice and Bob——BestCoder Round #11(div.2)
- BestCoder Round #54 (div.2) HDU 5427 A problem of sorting(1001)
- Codeforces #319(Div.2) C. Vasya and Petya's Game(数学题)
- BestCoder Round #56 (div.2)(Clarke and problem)
- HDU 5480 Conturbatio(傻傻的我用了线段树)——BestCoder Round #57(div.1 div.2)
- CF_#324(Div.2)
- BestCoder Round #59 (div.2) B. Reorder the Books 想法题
- 【LCA】CodeForce #326 Div.2 E:Duff in the Army
- BestCoder Round #61 (div.2)
- BC 62 (div.2) B
- BestCoder Round #63 (div.2)1003 matrix
- ACM学习历程—HDU5585 Numbers(数论 || 大数)(BestCoder Round #64 (div.2) 1001)