『算法-ACM 竞赛-CodeForces』 140A New Year Table （几何题）当时没想出来—补题A. New Year Tabletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGerald is setting the Ne

『算法-ACM 竞赛-CodeForces』 1291 Round #616 (Div. 2) BB. Array Sharpeningtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou’re given an array a1,…,an o

『算法-ACM 竞赛-CodeForces』 1102B Array K-Coloring B. Array K-Coloring time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output describe You are given an

『算法-ACM 竞赛-CodeForces』 1176A Divide it! （模拟+分类处理）You are given an integer nn. You can perform any of the following operations with this number an arbitrary (possibly, zero) number of times: Replace nn

『算法-ACM 竞赛-CodeForces』 1102A（思维题）https://vjudge.net/problem/2135388/originDescribe You are given an integer sequence 1,2,…,n. You have to divide it into two sets A and B in such a way that each elemen

『算法-ACM 竞赛-CodeForces』 1058D D. Vasya and TriangleD. Vasya and Triangletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has got three integers

『算法-ACM 竞赛-CodeForces』 1058A. In Search of an Easy Proble这题，全零是 esay 有 1 是 hard，真难呀。 12345678910111213141516#include<bits/stdc++.h>using namespace std;int main(){ int n,i,x,flag=0; ci

『算法-ACM 竞赛-CodeForces』 1047CEnlarge GCD（这题很难，快来看题解，超级详细，骗浏览量）C. Enlarge GCDtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr. F has n positive int

『算法-ACM 竞赛-CodeForces』 1047B Cover PointsB. Cover Pointstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n points on the plane, (x1,y1),(x

『算法-ACM 竞赛-CodeForces』 1047AA. Little C Loves 3 Itime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle C loves number «3» very much. He loves all