NOIpDay1T2 国王游戏 高精度+贪心

很强的高精   唐神的板子好用又好看   %Candy？

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

const int B = 10000;

struct Big{
    int n,a[1010];
    int& operator [](int x){return a[x];}
    Big():n(1){memset(a,0,sizeof(a));}
    void ini(int x){a[1] = x;n = 1;}
};

Big operator *(Big a,int b){
    int g = 0;
    for(int i = 1;i <= a.n;i++)
        g += a[i]*b,a[i] = g%B,g /= B;
    while(g)a[++a.n] = g%B,g /= B;
    return a;
}

Big operator *(Big a,Big b){
    Big c;
    for(int i = 1;i <= a.n;i++){
        int g = 0;
        for(int j = 1;j <= b.n;j++)
            g += c[i+j-1]+a[i]*b[j],c[i+j-1] = g%B,g /= B;
        c[i+b.n] = g;
    }
    c.n = a.n+b.n;
    while(c.n > 1&&c[c.n] == 0)c.n--;
    return c;
}

Big operator +(Big a,Big b){
    int g = 0,n = max(a.n,b.n);
    for(int i = 1;i <= n;i++){
        g += i<=a.n? a[i]:0;
        g += i<=b.n? b[i]:0;
        a[i] = g%B,g /= B;
    }
    a.n = n;
    if(g)a[++a.n] = g;
    return a;
}

Big operator -(Big a,Big b){
    for(int i = 1;i <= b.n;i--){
        if(a[i] < b[i])a[i+1]--,a[i] += B;
        a[i] -= b[i];
    }
    int p = b.n+1;
    while(a[p] < 0)a[p] += B,a[++p]--;
    while(a.n > 1&&a[a.n] == 0)a.n--;
    return a;
}

void print(Big a){
    printf("%d",a[a.n]);
    for(int i = a.n-1;i >= 1;i--)printf("%04d",a[i]);
}

bool operator <(Big a,Big b){
    if(a.n^b.n)return a.n < b.n;
    for(int i = a.n;i >= 1;i--)if(a[i]^b[i])return a[i] < b[i];
    return false;
}

Big operator /(Big a,int b){
    Big c; int r = 0;
    for(int i = a.n;i > 0;i--)
        a[i] += r*B,r = a[i]%b,a[i] /= b;
    while(a[a.n] == 0&&a.n > 1)a.n--;
    return a;
}

struct node{
    int l,r;
    bool operator <(const node& x)const{
        return l*r < x.l*x.r;
    }
}prs[10010];

Big sum,ans,cur;
int n,m;

int main(){
    cin >> n;
    for(int i = 0;i <= n;i++)cin >> prs[i].l >> prs[i].r;
    sort(prs+1,prs+n+1);
    sum.ini(prs[0].l);
    for(int i = 1;i <= n;i++){
        ans = max(ans,sum/prs[i].r);
        sum = sum*prs[i].l;
    }
    print(ans);
return 0;
}