B. Little Pony and Sort by Shift time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output One day, Twilight Sparkle is interested in how to sort a sequence of integers a1,?a2,?...,?an in non-decreasing order. Being a young unicorn, the only operation she can perform...
C. Little Pony and Expected Maximum time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Twilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became ...
A. Counterexample time limit per test 1 second memory limit per test 256 megabytes Your friend has recently learned about coprime numbers. A pair of numbers {a,?b} is called coprime if the maximum number that divides both a and b is equal to one. Your friend often come...
B. Friends and Presents time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You have two friends. You want to present each of them several positive integers. You want to present cnt1 numbers to the first friend andcnt2 numbers to the second friend. Moreover, yo...
题目链接：Diverse Permutation Diverse Permutation time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Permutation p is an ordered set of integers p1,???p2,???...,???pn, consisting of n distinct positive integers not larger than n. Well denote as...
题目链接：Counterexample Counterexample time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Your friend has recently learned about coprime numbers. A pair of numbers {a,?b} is called coprime if the maximum number that divides both a and b is equ...
题目链接：Friends and Presents Friends and Presents time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You have two friends. You want to present each of them several positive integers. You want to present cnt1 numbers to the first friend andcnt...
http://codeforces.com/contest/465/problem/C 给定n和m，以及一个字符串s，s不存在长度大于2的回文子串，现在要求输出一个字典比s大的字符串，且串中字母在一定范围内，并且说同样不存在长度大于2的回文子串。 直接去递归构造即可，从最后一位开始，每次只要判断是否子串中含有回文串，其实仔细想想只要考虑是否存在一个字符和前两个字符中的一个相同即可。不卡时限，裸的判断都能过 #include #include #include #inclu...
E. Little Pony and Summer Sun Celebration time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Twilight Sparkle learnt that the evil Nightmare Moon would return during the upcoming Summer Sun Celebration after one thousand years of imprisonment on the moon. She ...
A. Counterexample time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Your friend has recently learned about coprime numbers. A pair of numbers {a,?b} is called coprime if the maximum number that divides both a and b is equal to one. Your friend often comes ...
http://codeforces.com/contest/463/problem/E 给出一个总节点数量为n的树，每个节点有权值，进行q次操作，每次操作有两种选项： 1. 询问节点v到root之间的路径上的各个节点，求满足条件 gcd(val[i], val[v]) > 1 的 距离v最近的节点的下标。 2. 将节点v的值求改为w。 暴力居然过了！ #include #include #include #include #include #include #include #include #include #include #include #include using n...
D. Little Pony and Harmony Chest time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Princess Twilight went to Celestia and Lunas old castle to research the chest from the Elements of Harmony. A sequence of positive integers bi is harmony if and only if ...
http://codeforces.com/contest/465/problem/D 给定8个点坐标，对于每个点来说，可以随意交换x，y，z坐标的数值。问说8个点是否可以组成立方体。 暴力枚举即可，注意检查立方体姿势不对会T 如果8个点形成一个立方体是这样的：找到所有点对之间的最小距离，应等于边的长度L。每个顶点应该正好有三个点距离它为L，而且构成的三个边应两两垂直。如果这些条件都满足在每一点上，那么一定只能是立方体。检查复杂度约O(8^2)。 ...
题目链接：Bear and Raspberry Bear and Raspberry time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The bear decided to store some raspberry for the winter. He cunningly found out the price for a barrel of honey in kilos of raspberry for each of...
D. Interesting Array time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Well call an array of n non-negative integers a[1],?a[2],?...,?a[n] interesting, if it meets m constraints. The i-th of the m constraints consists of three integers li, ri, qi (1?≤?li?≤?...