摘要:
Fractions Again?!x 要用 long long。#includeusing namespace std;const int maxk = 10000;int k;long long x[2*maxk];int y[2*maxk];int judge(i... 阅读全文
摘要:
Maximum Product#includeusing namespace std;const int maxn = 20;int n;int seq[maxn];int main(){ // freopen("data.in","r",stdin); ... 阅读全文
摘要:
Division#includeusing namespace std;const int maxn = 64 + 5;int n,a[30240][6];int num,kase = 0,cnt = 0;int Pow(int a,int b){ int n ... 阅读全文