[Codeforces Round #158 (Div. 2)]A. Adding Digits
2013-01-17 01:46
134 查看
地址:http://codeforces.com/contest/260/problem/A
首先是没注意到多答案,其次我先用了一个位一个位枚举的办法,结果可想而知
后来明白只需加一位,后面添0即可
首先是没注意到多答案,其次我先用了一个位一个位枚举的办法,结果可想而知
后来明白只需加一位,后面添0即可
#include <stdio.h> int a,b,n; int main() { int i,flag=0; scanf("%d %d %d",&a,&b,&n); for(i=0;i<10;i++) { if((a*10+i)%b==0) {a=a*10+i;flag=1;break;} } if(!flag) printf("-1\n"); else { printf("%d",a); for(i=0;i<n-1;i++) { printf("0"); } printf("\n"); } return 0; }
相关文章推荐
- Codeforces Round #158 (Div. 2) A - Adding Digits
- Codeforces Round #158 (Div. 2)
- Codeforces Round #158 (Div. 2)
- Codeforces Round #158 (Div. 2) C. Balls and Boxes 模拟
- Codeforces Round #158 (Div. 2) (完全)
- Codeforces Round #158 (Div. 2)
- Codeforces Round #158 (Div. 2)C. Balls and Boxes(模拟)
- Codeforces Round #158 (Div. 2)D. Black and White Tree(搜索 + 思维)
- Codeforces Round #148 (Div. 2)
- Codeforces Round #277.5 (Div. 2)E题
- Codeforces Round 40 (Rated for Div. 2) C - Matrix Walk
- Codeforces Round #FF (Div. 1)-A,B,C
- Codeforces Round #321 (Div. 2) ABC
- Codeforces Round #379 (Div. 2) A B C D
- Codeforces Round #321 (Div. 2) 580C - Kefa and Park
- Codeforces Round #472(Div 2)
- Codeforces Round #418 (Div. 2) 814 C. An impassioned circulation of affection
- Codeforces Round #297 (Div. 2) 525C Ilya and Sticks(脑洞)
- Codeforces Round #265 (Div. 1)
- Codeforces Round #226 (Div. 2) ABC