冻笔新诗懒写

该文被密码保护。 阅读全文

摘要： Guanguan's Happy water 4000ms 262144K Rather than drinking happy water, Guanguan loves storing happy water. So he bought a refrigerator and stored a_i 阅读全文

摘要： Dawn-K's water 1000ms 262144K Dawn-K recently discovered a very magical phenomenon in the supermarket of Northeastern University: The large package is 阅读全文

摘要： K- Center 2000ms 262144K You are given a point set with nn points on the 2D-plane, your task is to find the smallest number of points you need to add 阅读全文

摘要： E-XKC's basketball team XKC , the captain of the basketball team , is directing a train of nn team members. He makes all members stand in a row , and 阅读全文

摘要： The Queen’s Super-circular Patio 题目描述 The queen wishes to build a patio paved with of a circular center stone surrounded by circular rings of circular 阅读全文

摘要： Complier 题目描述 HIT_TOM gets high score in the course《Compiling Principle》. So He wants to examine your knowledge of compilation principles.He will give 阅读全文

摘要： 1 const ll mod=1e9+7; 2 ll qpow(ll a,ll b) 3 { 4 ll c=1; 5 while(b) 6 { 7 if(b&1)c=ll(c*a)%mod; 8 a=ll(a*a)%mod; 9 b>>=1; 10 } 11 return c; 12 } 13 ll C(ll y,ll x) 14 { 15 if(y<0||x<0||y<x)return 0; 1 阅读全文

摘要： It’s a Mod, Mod, Mod, Mod World 题目描述 You are given multiple problems with three integers p, q, and n. Find . That is, the first n multiples of p, modu 阅读全文

摘要： Isomorphic Inversion 题目描述 Let s be a given string of up to 106 digits. Find the maximal k for which it is possible to partition s into k consecutive c 阅读全文