__似水流年__的博客

You've got an undirected graph, consisting of n vertices and m edges. We will consider the graph's vertices numbered with integers from 1 to n. Each vertex of the graph has a color. The color of the i...

Mr. Kitayuta's Colorful Graphtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr. Kitayuta has just bought an undirected graph con...

N个整数组成的序列a[1],a[2],a[3],…,a[n]，从中选出一个子序列（a[i],a[i+1],…a[j]），使这个子序列的和>0，并且这个和是所有和>0的子序列中最小的。例如：4，-1，5，-2，-1，2，6，-2。-1，5，-2，-1，序列和为1，是最小的。收起输入第1行：整数序列的长度N（2 <= N <= 50000)第2 - N+1...

Chiaki has an array ofnnpositive integers. You are told some facts about the array: for every two elementsaiaiandajajin the subarrayal..ral..r(l≤i<j≤rl≤i<j≤r),ai≠ajai≠ajholds.Chiaki ...

Chiaki has3n3npointsp1,p2,…,p3np1,p2,…,p3n. It is guaranteed that no three points are collinear.Chiaki would like to constructnndisjoint triangles where each vertex comes from the3n3npoints....

链接：https://ac.nowcoder.com/acm/contest/301/A来源：牛客网 题目描述小乐乐得知一周有7天之后就对7产生了兴趣。小乐乐得到了两堆数字数字时连续的。第一堆包含[1,n]n个数字，第二堆包含[1,m]m个数字。小乐乐想要从两堆中各挑选出一个整数x,y，使得x,y的和为7的倍数。请问小乐乐有多少种组合的方式。输入描述:输入整数n...

http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1009&amp;cid=832Problem DescriptionIn the world line 1.048596%“雪啊。”“雪是红色的。”像坏掉的复读机一样，梓川咲太只能把闪烁的思绪断断续续的说出来。“这，是梦吧。”从口中滑出的却是这样的话。回过神的...

Bitwise exclusive OR (or bitwise addition modulo two) is a binary operation which is equivalent to applying logical exclusive OR to every pair of bits located on the same positions in binary notation ...

You are given a square matrix consisting of n rows and n columns. We assume that the rows are numbered from 1 to n from top to bottom and the columns are numbered from 1to n from left to right. Some c...

Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi ...

Little penguin Polo likes permutations. But most of all he likes permutations of integers from 0 to n, inclusive.For permutation p = p0, p1, ..., pn, Polo has defined its beauty — number .Expressi...