摘要：
Farmer John is assigning some of his N (1 include include using namespace std; const int maxn=3e4; struct shift { int beg,end; bool operator a.end:beg 阅读全文
posted @ 2017-11-19 10:09
Zireael
阅读(145)
评论(0)
推荐(0)
摘要：
Consider a un rooted tree T which is not the biological significance of tree or plant, but a tree as an undirected graph in graph theory with n nodes, 阅读全文
posted @ 2017-11-18 20:24
Zireael
阅读(236)
评论(0)
推荐(0)
摘要：
Windy has a country, and he wants to build an army to protect his country. He has picked up N girls and M boys and wants to collect them to be his sol 阅读全文
posted @ 2017-11-16 19:12
Zireael
阅读(273)
评论(0)
推荐(0)
摘要：
Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly 阅读全文
posted @ 2017-11-15 19:00
Zireael
阅读(270)
评论(0)
推荐(0)
摘要：
Our chemical biologists have invented a new very useful form of life called stripies (in fact, they were first called in Russian polosatiki, but the s 阅读全文
posted @ 2017-11-13 20:54
Zireael
阅读(258)
评论(0)
推荐(0)
摘要：
一个规则的实心十二面体，它的 20个顶点标出世界著名的20个城市，你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input 前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m=1.m=0退出. Output 输出从第m个城市出发经过每个城市1次又回到m 阅读全文
posted @ 2017-11-13 20:27
Zireael
阅读(130)
评论(0)
推荐(0)
摘要：
Farmer John went to cut some wood and left N (2 ≤ N ≤ 100,000) cows eating the grass, as usual. When he returned, he found to his horror that the clus 阅读全文
posted @ 2017-11-12 20:51
Zireael
阅读(175)
评论(0)
推荐(0)
摘要：
King Mercer is the king of ACM kingdom. There are one capital and some cities in his kingdom. Amazingly, there are no roads in the kingdom now. Recent 阅读全文
posted @ 2017-11-12 17:34
Zireael
阅读(217)
评论(0)
推荐(0)
摘要：
Data mining huge data sets can be a painful and long lasting process if we are not aware of tiny patterns existing within those data sets. One reputab 阅读全文
posted @ 2017-11-12 13:39
Zireael
阅读(158)
评论(0)
推荐(0)
摘要：
Problem Description A permutation p1,p2,...,pn of 1,2,...,n is called a lucky permutation if and only if pi≡0(mod|pi−pi−2|) for i=3...n. Now you need 阅读全文
posted @ 2017-11-12 09:32
Zireael
阅读(759)
评论(0)
推荐(0)
浙公网安备 33010602011771号