UCF Local Programming Contest 2012（Practice）补题

Clean Up the Powers that Be

主要是输出格式上的问题

#include <iostream>
#include <cstring>
using namespace std;
int main(){
    long long t,s[10005];
    cin>>t;
    int p=0;
    while(t--){
        p++;
        memset(s,0,sizeof(s));
        int n;
        cin>>n;
        for(int i=0;i<n;i++){
            int a,b;
            cin>>a>>b;
            s[a]+=b;
        }
        cout<<"Prime Factorization #"<<p<<":"<<endl;
        for(int i=1;i<10005;i++){
            //cout<<s[i]<<" ";
            if(s[i]!=0){
                //cout<<s[i]<<" ";
                int k=i;
                while(k!=0){
                    k/=10;
                    cout<<" ";
                }
                cout<<s[i];
            }
        }
        cout<<endl;
        for(int i=1;i<10005;i++){
            if(s[i]!=0){
                cout<<i;
                int k=s[i];
                while(k!=0){
                    k/=10;
                    cout<<" ";
                }
            }
        }
        cout<<endl<<endl;
    }
}