『算法-ACM 竞赛-CodeForces』260CCodeForces - 260CCodeForces - 260CLittle Vasya had n boxes with balls in the room. The boxes stood in a row and were numbered with numbers from 1 to n from left to right. Onc

『算法-ACM 竞赛-CodeForces』260BCodeForces - 260BA recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is a string that only consists of digits and characters “-“.

『算法-ACM 竞赛-CodeForces』239B.EasyTapeProgrammingCodeforce 239 B. Easy Tape ProgrammingThere is a programming language in which every program is a non-empty sequence of “<” and “>” signs and digits

『算法-ACM 竞赛-CodeForces』227E 矩阵快速幂求斐波那契+N 个连续数求最大公约数+斐波那契数列的性质E. Anniversarytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are less than 60 y

『算法-ACM 竞赛-CodeForces』227D Naughty Stone Piles （贪心+递归+递推）DescriptionThere are n piles of stones of sizes a1, a2, …, an lying on the table in front of you. During one move you can take one pile and add

『算法-ACM 竞赛-CodeForces』140C （贪心+优先队列）补题C. New Year Snowmentime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs meticulous Gerald sets the table and c

『算法-ACM 竞赛-CodeForces』1323 div2 题解 ABCA. Even Subset Sum Problem签到题 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657#include <bits/stdc++.h&

『算法-ACM 竞赛-CodeForces』1311E. Construct the Binary Tree （构造，就是个模拟)ACM 思维题训练集合You are given two integers n and d. You need to construct a rooted binary tree consisting of n vertices with a root at the v

『算法-ACM 竞赛-CodeForces』1311B. WeirdSort （冒泡排序)You are given an array a of length n. You are also given a set of distinct positions p1,p2,…,pm, where 1≤pi<n. The position pi means that you can swap e

『算法-ACM 竞赛-CodeForces』1311A Add Odd or Subtract EvenAdd Odd or Subtract Eventime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two posi