山东省第四届ACM省赛题——Contest Print Server（模拟）

题目描述

    In ACM/ICPC on-site contests ,3 students share 1 computer,so you can print your source code any time. Here you need to write a contest print server to handle all the requests.

输入

In each case,the first line contains 5 integers n,s,x,y,mod (1<=n<=100, 1<=s,x,y,mod<=10007), and n lines of requests follow. The request is like "Team_Name request p pages" (p is integer, 0<p<=10007, the length of "Team_Name" is no longer than 20), means the team "Team_Name" need p pages to print, but for some un-know reason the printer will break down when the printed pages counter reached s(s is generated by the function s=(s*x+y)%mod ) and then the counter will become 0. In the same time the last request will be reprint from the very begin if it isn't complete yet(The data guaranteed that every request will be completed in some time).
    You can get more from the sample.

输出

    Every time a request is completed or the printer is break down,you should output one line like "p pages for Team_Name",p is the number of pages you give the team "Team_Name".

    Please note that you should print an empty line after each case.

示例输入

23 7 5 6 177Team1 request 1 pagesTeam2 request 5 pagesTeam3 request 1 pages3 4 5 6 177Team1 request 1 pagesTeam2 request 5 pagesTeam3 request 1 pages

示例输出

1 pages for Team15 pages for Team21 pages for Team31 pages for Team13 pages for Team25 pages for Team21 pages for Team3

水题，直接模拟

#include<iomanip>
#include<iostream>
#include<cstdio>
#include<cmath>
#define MAXN 10007
using namespace std;
int main()
{
    string name[MAXN],use;
    int n,s,x,y,mod,i,p[MAXN],t,counter;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d%d%d",&n,&s,&x,&y,&mod);
        for(i=0;i<n;++i)
        {
            cin>>name[i];
            cin>>use;
            cin>>p[i];
            cin>>use;
        }
        counter=0;
        for(i=0;i<n;)
        {
            counter+=p[i];
            if(counter<=s)
            {

                cout<<p[i]<<" pages for "<<name[i]<<endl;
                ++i;
            }
            else
            {
                counter-=p[i];
                cout<<s-counter<<" pages for "<<name[i]<<endl;
                counter=0;
                s=(s*x+y)%mod;
            }
        }
        cout<<endl;
    }
    return 0;
}