07 2016 档案

摘要:#include #include #define ll long long #define mod 20100713 const int maxn=1000005; ll a[maxn]; ll poww(ll x,int n) { ll ret=1; while(n) { if(n&1) ret=ret*x%mod; ... 阅读全文
posted @ 2016-07-29 13:43 四叶草的诉说 阅读(120) 评论(0) 推荐(0)
摘要:All the people in the byteland want to stand in a line in such a way that no person stands closer to the front of the line than his father. You are gi 阅读全文
posted @ 2016-07-22 14:34 四叶草的诉说 阅读(203) 评论(0) 推荐(0)