messyidea的专栏

#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define L(rt) (rt<<1)#define R(rt) (rt<<1|1)#define mset(l

D. Fedor and Essaytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter you had helped Fedor to find frien

一道题目，为了写的快一点，因为排序给写yangwei

比如判断x ^bool pow(ll x,ll n,ll m){ ll res = 1; while(n > 0){ if(n & 1) res = res * x; x = x*x; n>>=1; if(res >= m) return true; } if(res >= m) return tr

Revenge of kNNTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 296    Accepted Submission(s): 66Problem DescriptionIn pattern rec

C. Number of Waystime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've got array a[1], a[2], ..., a[n], c