http://codeforces.com/contest/358//---------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/738//---------------------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/344//---------------------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/742//-------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/327//---------------------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/357//---------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/189//---------------------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/699http://codeforces.com/contest/696//--------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/750//---------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/359//---------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/353//-----------------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/355//---------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/352//---------------------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/332//-------------------------------------------------------------------------------------------------------------------------------------------------------------

C 317A Perfect Pair题意：m-perfect的定义是：对于一个pair(x,y)，如果其中一个数≥m，那么它就是m-perfect的。有一种变换，可以把(x,y)变换成(x+y,y)或者(x,x+y)。给出x,y,m，问最小需要几次变换，得到一个m-perfect的pair。题解：两个数都是负数：肯定会越变换越小，所以直接判断。(x,y)已经是

http://codeforces.com/contest/733AB水题就不说了//-------------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/479ABC水题就不说了//--------------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/315AB水题就不说了//-------------------------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/349//---------------------------------------------------------------------------------------------------------------------------------------------

http://codeforces.com/contest/339//-------------------------------------------------------------------------------------------------------------------------------------------------------------

547D - Mike and Fish#include#include#includeusing namespace std;const int N=400005;const int ADD=200000;int sz;int last[N],deg[N],col[N];struct E { int u,v,pre;}e[N<<1];void inite()