CodeForces
bfcx
这个作者很懒,什么都没留下…
展开
-
【CodeForces - 246D】Colorful Graph
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...原创 2018-11-08 16:22:28 · 259 阅读 · 0 评论 -
【Codeforces-505B】Mr. Kitayuta's Colorful Graph(二维并查集)
Mr. Kitayuta's Colorful Graphtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr. Kitayuta has just bought an undirected graph con...原创 2019-05-22 17:23:14 · 283 阅读 · 0 评论 -
【CodeForces - 340C】Tourist Problem (组合数学)
Iahub is a big fan of tourists. He wants to become a tourist himself, so he planned a trip. There are n destinations on a straight road that Iahub wants to visit. Iahub starts the excursion from kilom...原创 2018-12-03 14:55:26 · 426 阅读 · 1 评论 -
【CodeForces - 305C】Ivan and Powers of Two(思维)
C. Ivan and Powers of Twotime limit per test0.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIvan has got an array of n non-negative integers a1, ...原创 2018-11-27 20:23:39 · 281 阅读 · 0 评论 -
【Codeforces-140C】New Year Snowmen(贪心+优先队列、二分)
As meticulous Gerald sets the table and caring Alexander sends the postcards, Sergey makes snowmen. Each showman should consist of three snowballs: a big one, a medium one and a small one. Sergey's tw...原创 2018-11-27 14:46:12 · 431 阅读 · 0 评论 -
【CodeForces - 514B】Han Solo and Lazer Gun
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.Han Solo has ...原创 2018-11-24 20:55:21 · 226 阅读 · 0 评论 -
【CodeForces - 122B】Lucky Substring(思维)
Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5...原创 2018-11-24 15:41:42 · 265 阅读 · 0 评论 -
【CodeForces - 76D】Plus and xor(位运算-异或)
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 ...原创 2018-11-24 13:23:55 · 424 阅读 · 0 评论 -
【CodeForces - 288B】Polo the Penguin and Houses (组合数学+Purfer序列)
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 ...原创 2018-11-24 10:11:30 · 398 阅读 · 0 评论 -
【CodeForces - 288C】Polo the Penguin and XOR operation (思维、异或运算)
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...原创 2018-11-24 08:59:17 · 302 阅读 · 0 评论 -
【CodeForces - 1114C】Trailing Loves (or L'oeufs?) (数论)
The number "zero" is called "love" (or "l'oeuf" to be precise, literally means "egg" in French), for example when denoting the zero score in a game of tennis.Aki is fond of numbers, especially those...原创 2019-06-04 19:38:36 · 280 阅读 · 0 评论