![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
codeforce
qq_30478929
这个作者很懒,什么都没留下…
展开
-
New Year Snowmen CodeForces - 140C
“`includeincludeincludeincludeincludeincludeusing namespace std; map转载 2017-03-09 09:50:36 · 191 阅读 · 0 评论 -
Snow Footprints
There is a straight snowy road, divided into n blocks. The blocks are numbered from 1 to n from left to right. If one moves from the i-th block to the (i + 1)-th block, he will leave a right footprint原创 2017-03-06 08:41:07 · 251 阅读 · 0 评论 -
Sail CodeForces - 298B
The polar bears are going fishing. They plan to sail from (sx, sy) to (ex, ey). However, the boat can only sail by wind. At each second, the wind blows in one of these directions: east, south, west or原创 2017-03-06 08:42:12 · 261 阅读 · 0 评论 -
Arithmetic Progression CodeForces - 382C
Everybody knows what an arithmetic progression is. Let us remind you just in case that an arithmetic progression is such sequence of numbers a1, a2, …, an of length n, that the following condition fulf原创 2017-03-06 08:43:18 · 302 阅读 · 0 评论 -
B. Sherlock and his girlfriend
#include<cstdio> #include<cstring>#include<iostream>#include<string>using namespace std;int arr[100100];int main(){ for(int i=2;i<100100;i++) if(!arr[i]) for(int j=2;i*j<100100;j++)原创 2017-03-07 16:02:59 · 238 阅读 · 0 评论 -
Andryusha and Colored Balloons
dfs记录一下父节点就好了#include<iostream> #include<cstdio>#include<cstring>#include<vector>using namespace std;int arr[200004];vector<int>u[200004];int m=0;void dfs(int node ,int father){ int now=1;原创 2017-03-07 22:33:13 · 208 阅读 · 0 评论