高精的悲伤

P1080 [NOIP2012 提高组] 国王游戏

重载运算符多方便
by Koakuma @ 2019-06-12 10:00:31


Python笑笑不说话
by 行者_Walker @ 2019-06-12 10:03:50


python太可恶了
by Joeywu_1101 @ 2019-06-29 13:57:06


@[初嫁QAQ](/space/show?uid=102028) 同问: ``` #include<bits/stdc++.h> using namespace std; struct rr{ int a,b,c; }r[10010]; int s[40010]={1},l=1,ss[40010],maxn[40010]; bool cc(int a[],int b[]){ for(register int i=40010;i>=0;i--)if(a[i]!=b[i])return a[i]>b[i]; return 0; } bool cmp(rr a,rr b){ return a.c<b.c; } int len(int x[]){ register int i=40009; for(;i>=0;i--)if(x[i])break; return i+1; } void cheng(int x){ for(register int i=0;i<l;i++)s[i]*=x; for(register int i=0;i<l;i++)s[i+1]+=s[i]/10,s[i]%=10; l=len(s); } void chu(int x){ for(register int i=0;i<l;i++)ss[i]=s[i]; for(register int i=l-1;i>0;i--)ss[i-1]+=ss[i]%x*10,ss[i]/=x; ss[0]/=x; if(cc(ss,maxn))for(register int i=0;i<40010;i++)maxn[i]=ss[i]; } int main(){ int n; scanf("%d",&n); n++; for(register int i=0;i<n;i++)scanf("%d%d",&r[i].a,&r[i].b),r[i].c=r[i].a*r[i].b; sort(r+1,r+n,cmp); for(register int i=0;i<n;i++){ if(i)chu(r[i].b); cheng(r[i].a); } register int i=40009; for(;i>=0;i--)if(maxn[i])break; if(i<0)cout<<0; for(;i>=0;i--)cout<<maxn[i]; return 0; }
by __OccDreamer__ @ 2019-08-13 22:36:59


|