now_ing的博客

题目：http://codeforces.com/contest/383/problem/B参考：http://www.xuebuyuan.com/2068138.html384D - ВулканыOur first observation is that if there is a path from (1, 1) to (N, N), then the length of path is 2

参考：https://www.cnblogs.com/wujiechao/p/8026872.html D题不知道为什么是对于每一个因素。。。待补。。 #include #define mem(a, i) memset(a, i, sizeof(a)) using namespace std; typedef long long LL; const LL MOD = 1e9 + 7; int

E. A Simple Task 题目连接：http://www.codeforces.com/contest/558/problem/E DescriptionThis task is very simple. Given a string S of length n and q queries each query is on the format i j k which means sor

官方题解：http://codeforces.com/blog/entry/14028 E题：http://codeforces.com/contest/472/problem/E F题：http://codeforces.com/contest/472/problem/FThere is an easy way to obtain a new task from an old one call

Isap 的邻接表模板（冬季赛C题） struct node { int to,cap,rev; };const int MAXN=0x3f3f3f3f; vector<node>edge[1100000]; queue<int>que; int level[1100000],iter[1100000];int tot; void add_edge(int u,int v,int f) {