Poj2099 整除的尾数

 1 #include <iostream>
 2 #include <algorithm>
 3 #include <string>
 4 #include <cstring>
 5 #include <cstdio>
 6 #include <queue>
 7 using namespace std;
 8 int a,b;
 9 int main()
10 {
11     while(cin>>a>>b&&(a&&b)){
12         queue<int> q;
13         for(int i=0;i<100;i++){
14             if((a*100+i)%b==0){
15                 //cout<<(a*100+i)%100<<endl;
16                 q.push((a*100+i)%100);
17             } 
18         }
19         if(q.front()<10) cout<<"0"<<q.front();
20         else cout<<q.front();
21         q.pop();
22         while(q.size()){
23             if(q.front()==0) cout<<" 0"<<q.front();
24             else cout<<" "<<q.front();
25             q.pop();
26         }
27         cout<<endl;
28     }
29     return 0;
30 }