U96340 AC机

    • 1.2K提交
    • 371通过
    • 222排名
  • 用户类型 普通用户
  • 注册时间 2018-04-10 20:42

Ta的洛谷博客

通过题目

[P1000] [P1001] [P1002] [P1003] [P1004] [P2280] [P1008] [P1009] [P1010] [P1012] [P1020] [P1025] [P1028] [P1838] [P1029] [P1030] [P2672] [P1031] [P1035] [P1040] [P1044] [P1046] [P1047] [P1048] [P1049] [P1055] [P1057] [P1059] [P2189] [P1060] [P3307] [P1068] [P2914] [P1075] [P2107] [P1076] [P1289] [P1077] [P1079] [P1085] [P1087] [P1089] [P1090] [P1091] [P1159] [P1093] [P1094] [P1658] [P1095] [P2582] [P1096] [P1109] [P1097] [P2833] [P1100] [P1101] [P1102] [P1104] [P1109] [P1111] [P1115] [P1116] [P1119] [P3303] [P1125] [P1553] [P1135] [P3301] [P1137] [P1960] [P1138] [P1592] [P1143] [P3309] [P1145] [P1147] [P1149] [P1150] [P2616] [P1151] [P1152] [P1157] [P1161] [P1162] [P1164] [P3388] [P1177] [P1179] [P1190] [P2424] [P1192] [P1199] [P2080] [P1200] [P1216] [P1217] [P1219] [P1226] [P1230] [P1233] [P1431] [P1259] [P1296] [P2333] [P1303] [P1304] [P1305] [P1689] [P1307] [P1012] [P1308] [P1309] [P1317] [P1328] [P1334] [P1339] [P1348] [P1486] [P1372] [P1375] [P1420] [P1421] [P1422] [P1423] [P1425] [P1426] [P2467] [P1427] [P1428] [P1439] [P1451] [P2292] [P1460] [P2412] [P1464] [P1469] [P1478] [P1480] [P1507] [P1525] [P1534] [P1536] [P1540] [P1546] [P1547] [P1551] [P1554] [P1567] [P1571] [P1579] [P1589] [P1590] [P1595] [P1598] [P1601] [P1614] [P1615] [P3115] [P1616] [P2720] [P1626] [P1628] [P3464] [P1634] [P1678] [P3127] [P1679] [P1691] [P1706] [P1716] [P1720] [P1734] [P1739] [P1746] [P1747] [P1755] [P1757] [P1760] [P1765] [P1774] [P2285] [P1781] [P1795] [P1807] [P3093] [P1808] [P1832] [P1665] [P1838] [P1851] [P1862] [P2523] [P1865] [P2193] [P1866] [P1876] [P1057] [P1887] [P1796] [P1888] [P1889] [P2266] [P1892] [P1896] [P1897] [P1908] [P1909] [P2041] [P1910] [P1914] [P1886] [P1919] [P1932] [P1965] [P1969] [P2929] [P1980] [P1981] [P1996] [P2005] [P1801] [P2014] [P2015] [P2024] [P2058] [P1670] [P2066] [P1240] [P2078] [P2323] [P2084] [P3326] [P2118] [P2060] [P2128] [P2141] [P2129] [P2142] [P2181] [P2196] [P2239] [P2256] [P2054] [P2330] [P2368] [P2369] [P3205] [P2384] [P3243] [P2550] [P2563] [P2602] [P2615] [P2626] [P2639] [P2657] [P2669] [P2670] [P2676] [P2690] [P2695] [P2722] [P2782] [P2788] [P2799] [P2818] [P1577] [P2822] [P2871] [P2410] [P2911] [P2918] [P2925] [P2955] [P2956] [P2957] [P3150] [P3366] [P3367] [P2997] [P3368] [P3370] [P3371] [P3374] [P2696] [P3378] [P2805] [P3383] [P3385] [P2861] [P3741] [P3742] [P3879] [P2763] [P3912] [P2300] [P3951] [P3954] [P3955] [P3956] [P1703] [P4018] [P4057] [P3365] [P4136] [P3525] [P4305] [P4325] [P4326] [P4379] [P4413] [P3212] [P4414] [P4445] [P1446] [P4549] [P1815] [P4702] [P4779] [P4860] [P4884] [P1954] [P4933] [P4942] [P4994] [P4995] [P5015] [P3198] [P5016] [P5017] [P5018] [P5019] [CF1A] [CF4A] [CF12A] [CF27A] [P1630] [CF36A] [P1245] [CF41A] [P3336] [CF43A] [CF47A] [CF53A] [P2084] [CF59B] [P2316] [CF61A] [CF68A] [CF71A] [CF92A] [CF110A] [P3138] [CF114A] [P1903] [CF118A] [CF119A] [CF124A] [CF149A] [CF231A] [CF236A] [CF271A] [P2898] [CF281A] [CF386A] [CF405A] [P2625] [CF409A] [P1783] [CF409F] [CF443A] [CF492A] [P3473] [CF509A] [CF527D] [CF546A] [CF656F] [P1843] [CF672A] [CF677A] [CF678A] [CF681A] [P3362] [CF703A] [CF732A] [CF734A] [CF802G] [CF805A] [CF898A] [CF899A] [CF914A] [CF915A] [CF918A] [CF932A] [CF935A] [CF937A] [CF939A] [CF948A] [P1598] [CF961A] [CF977A] [CF994A] [CF1003A] [P2371] [CF1005A] [CF1009A] [CF1080A] [CF1080B] [P3311] [SP1] [P2619] [SP2] [SP5] [SP11] [SP302] [SP27561] [P1001] [AT25] [AT162] [P1718] [AT184] [AT211] [AT240] [AT254] [AT261] [AT265] [P2967] [AT314] [AT700] [AT731] [P2677] [AT807] [AT934] [P3351] [AT1010] [P1161] [AT1061] [AT1088] [AT1213] [AT1301] [P1105] [AT1357] [AT1476] [AT1550] [AT1717] [AT1872] [P1300] [AT1894] [AT2084] [P1630] [AT2150] [AT2238] [AT2392] [P1317] [AT2412] [AT2465] [P3124] [AT2523] [AT2690] [P2073] [AT2827] [AT3599] [AT3731] [AT3848] [UVA113] [P3236] [UVA374] [P1877] [UVA1225] [P2037] [UVA10055] [UVA10340] [P2466] [UVA10346] [UVA11292] [UVA11388] [UVA11462]
统计数据非实时更新。

难易度统计

尚无评定 1
入门难度 166
普及- 118
普及/提高- 57
普及+/提高 10
提高+/省选- 14
省选/NOI- 4
NOI/NOI+/CTSC 1

统计数据非实时更新。

签名

NOIp2018PJ游记

最优解祭


这是我们大家的rp

#include<bits/stdc++.h>
using namespace std;
struct BigNum {
    static const int BASE=100000000;
    static const int WIDTH=8;
    vector<long long>s;
    BigNum(long long num=0){*this=num;}
    BigNum operator = (long long num){
        s.clear();
 do{   s.push_back(num%BASE);
            num/=BASE;
        } while(num>0);
        return *this;
    }
    BigNum operator = (const string& str){
        s.clear();
        int x,len=(str.length()-1)/WIDTH+1;
        for(int i=0;i<len;i++){
            int end=str.length()-i*WIDTH;
            int start=max(0,end-WIDTH);
            sscanf(str.substr(start,end-start).c_str(),"%d",&x);
            s.push_back(x);
        }
        return *this;
    }
    BigNum operator + (const BigNum& b)const{
        BigNum c;
        c.s.clear();
        for(int i=0,g=0;;i++){
            if(g==0&&i>=s.size()&&i>=b.s.size())break;
            int x=g;
            if(i<s.size())x+=s[i];
            if(i<b.s.size())x+=b.s[i];
            c.s.push_back(x%BASE);
            g=x/BASE;
        }
        return c;
    }
    bool operator < (const BigNum& b)const{
        if(s.size()!=b.s.size())return s.size()<b.s.size();
        for(int i=s.size()-1;i>=0;i--)
        if(s[i]!=b.s[i])return s[i]<b.s[i];
        return false;
    }
    bool operator > (const BigNum& b)const{return b<*this;}
    bool operator <= (const BigNum& b)const{return !(b<*this);}
    bool operator >= (const BigNum& b)const{return !(*this<b);}
    bool operator != (const BigNum& b)const{return b<*this||*this<b;}
    bool operator == (const BigNum& b)const{return !(b<*this)&&!(*this<b);}
    void S(int a){
        vector<long long>c;
        for(int i=0;i<s.size();++i){
            if(c.size()<=i)c.push_back(s[i]*a);else
            c[i]+=s[i]*a;
            if(c[i]/BASE)
            if(c.size()<=i+1)c.push_back(c[i]/BASE);else
            c[i+1]=c[i]/BASE;
            c[i]%=BASE;
        }
        s=c;
    }
    void C(int a){
        vector<long long>c(s);
        if(s.back()/a)c[s.size()-1]=s.back()/a,s[s.size()-1]%=a;else
        c.pop_back();
        for(int i=s.size()-2;i>=0;--i){
            long long num=s[i+1]*BASE+s[i];
            c[i]=num/a;
            num%=a;
            s[i]=num;
        }
        s=c;
    }
};
ostream& operator << (ostream &out,const BigNum& x){
    out<<x.s.back();
    for(int i=x.s.size()-2;i>=0;i--){
        char buf[20];
        sprintf(buf,"%08d",x.s[i]);
        for(int j=0;j<strlen(buf);j++)out<<buf[j];
    }
    return out;
}
istream& operator >> (istream &in,BigNum& x){    string s;
if(!(in>>s))return in;
    x=s;
    return in;
}
BigNum rp,score;
int main ()
{
    while(1) {rp=rp+1;score=score+1;cout<<rp<<' '<<score<<'\n';}
    return 0;
}

by Song_of_long_voyage

点击查看更多...