#include<iostream>#include<string>#include<algorithm>using namespace std;

int dp[600001];

int main(){int i,j;    freopen("D:\\in.txt","w",stdout);    memset(dp,0,sizeof(dp));for(i=1;i<=500000;i++)    {for(j=1;j<=500000;j++)        {if(i*j<=600000)                dp[i*j]++;        }    }int max=0;for(i=2;i<=600000;i++)    {if(dp[i]>max)        {            max=dp[i];            cout<<i<<",";        }    }    cout<<endl<<endl;    max=0;for(i=2;i<=600000;i++)    {if(dp[i]>max)        {            max=dp[i];            cout<<dp[i]<<",";        }    }return 0;}

#include<iostream>#include<string>#include<algorithm>using namespace std;

int max_turn[40]={1,2,4,6,12,24,36,48,60,120,180,240,360,720,840,1260,1680,2520,5040,7560,10080,15120,20160,25200,27720,45360,50400,55440,83160,110880,166320,221760,277200,332640,498960,554400};int max_candy[40]={1,2,3,4,6,8,9,10,12,16,18,20,24,30,32,36,40,48,60,64,72,80,84,90,96,100,108,120,128,144,160,168,180,192,200,216};

struct child{char name[10];int pos;};

child num[500001];int n,k,pos;

struct node{int l;int r;int left;};

node tree[2500000];

void build(int i,int l,int r){    tree[i].l=l;    tree[i].r=r;    tree[i].left=r-l+1;if(l==r)return;int mid=(l+r)/2;    build(2*i,l,mid);    build(2*i+1,mid+1,r);}

void updata(int i,int w){if(tree[i].l==tree[i].r)    {        tree[i].left--;        pos=tree[i].l; //记录目前的实际位置        return;    }if(tree[2*i].left>=w)        updata(2*i,w);else if(tree[2*i+1].left>=w-tree[2*i].left)        updata(2*i+1,w-tree[2*i].left);    tree[i].left=tree[2*i].left+tree[2*i+1].left;}

int main(){int i,turn,&mod=tree[1].left,candy;    freopen("D:\\in.txt","r",stdin);while(scanf("%d%d",&n,&k)==2)    {        build(1,1,n);for(i=1;i<=n;i++)        {            scanf("%s %d",num[i].name,&num[i].pos);            }        i=0;while(max_turn[i]<=n) //寻找最大的n'            i++;        i--;        candy=max_candy[i];  //记录最多的糖果        turn=max_turn[i]; //第max_turn[i]出来的人将得到最多的糖果        pos=0;        num[0].pos=0;for(i=0;i<turn;i++)        {if(num[pos].pos>0) //求解相对剩余位置            {                k=((k+num[pos].pos-1)%mod+mod)%mod;if(k==0)                    k=mod;            }else            {                k=((k+num[pos].pos)%mod+mod)%mod;if(k==0)                    k=mod;            }            updata(1,k);        }        printf("%s %d\n",num[pos].name,candy);    }return 0;}