Smile

传送门：http://acm.hdu.edu.cn/showproblem.php?pid=2689代码如下：#include #include #include #define maxn 10000using namespace std;int n,tree[maxn];int lowbit(int i){ return i&(-i);}int update(int

A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 44467 Accepted: 15107DescriptionBackground The knight is getting bored of seeing the

Multiply gameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2540    Accepted Submission(s): 894Problem DescriptionTired of play

青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 113074 Accepted: 23054Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰

C LooooopsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25936 Accepted: 7346DescriptionA Compiler Mystery: We are given a C-language style for loop of

The BalanceTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6473 Accepted: 2849DescriptionMs. Iyo Kiffa-Australis has a balance and only two kinds of wei

PartyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1300 Accepted: 498DescriptionThe CEO of ACM (Association of Cryptographic Mavericks) organization h

DescriptionThe Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible rational numbers a/b with 0 < a < b <= n and gcd(a,b) = 1 arranged in increasing order. The first few are F2

Primitive Roots DescriptionWe say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (xi mod p) | 1 <= i <= p-1 } is equal to { 1, …, p-1 }. For example, the

传送门：http://poj.org/problem?id=3233代码如下：#include #include #include using namespace std;int k,n,m;struct matrix{ int m[31][31]; void init() { memset(m,0,sizeof(m));