标签:pac time mit strong memory bit ref turn problem
传送门:
http://acm.hdu.edu.cn/showproblem.php?pid=2099
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 48006 Accepted Submission(s): 20411
#include<bits/stdc++.h> using namespace std; typedef long long ll; int main() { int a,b; int c[100]; while(~scanf("%d %d",&a,&b)) { if(a==0&&b==0) break; a=a*100; int k=0; for(int i=0;i<=99;i++) { if((a+i)%b==0) c[k++]=i; } printf("%02d",c[0]); for(int i=1;i<k;i++) printf(" %02d",c[i]);//前导0格式 printf("\n"); } return 0; }
标签:pac time mit strong memory bit ref turn problem
原文地址:https://www.cnblogs.com/yinbiao/p/9311877.html