119 greedy gift.cpp

来自「UVA solutions to few selected problems」· C++ 代码 · 共 56 行

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int n;
    string s1[15],s2[15],s3[15];
    bool chk=false;
    while(cin>>n)
    {
                 if(chk) cout<<endl;
                 int i,j,m,k;
                 for(j=0;j<n;j++)
                 cin>>s1[j];
                 
                 int money,num,sum[15];
                 for(j=0;j<n;j++)
                 sum[j]=0;
                 for(k=0;k<n;k++)
                 {
                         cin>>s2[k];
                         cin>>money>>num;
                         if(num==0)
                         continue;
                         for(m=0;m<num;m++)
                         cin>>s3[m];
                         for(j=0;j<n;j++)
                         {
                             if(s2[k]==s1[j])
                             {
                              sum[j]=sum[j]-money;
                              sum[j]=sum[j]+(money%num);
                              }
                         }     
                         for(m=0;m<num;m++)
                         {
                                 for(j=0;j<n;j++)
                                 { 
                                         if(s3[m]==s1[j])
                                         {                       
                                                         sum[j]=sum[j]+(int)(money/num);
                                                         continue;
                                         }
                                 }
                         }      
                 }
                 for(j=0;j<n;j++)
                 cout<<s1[j]<<" "<<sum[j]<<endl;
                 chk=true;               
    }
    system("pause");
}