_nplus

A. Levertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a description of a lever as

Valera and Tubestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputValera has got a rectangle table consisting

解题报告没什么好说的，大于m的往后面放，，，re了一次，，，#include #include #include #include using namespace std;struct node{ int x,cd;}num[1000000];int main(){ int n,m,c; cin>>n>>m; int i; for

解题报告算是规律题吧，，，x y z -x -y -z注意的是如果数是小于0,要先对负数求模再加模再求模给我的戳代码跪了，，，#include #include #include using namespace std;long long x,y,z;long long n;int main(){ cin>>x>>y; cin>>n; z=y

解题报告n和m跟木棍相交，问一人取一交点（必须是交点，且取完后去掉交点的两根木棍），最后谁赢思路：取最大正方形，以对角线上的交点个数判断输赢。#include #include using namespace std;int main(){ int m,n; while(cin>>n>>m) { if(n>m) {

解题报告对于给定的数组，取对数组中的一段进行翻转，问翻转后是否是递增有序的。思路：只要找到最初递减的区域，记录区域内最大和最小的值，和区间位置。然后把最大值与区间的下一个元素对比，最小值与区间上一个元素对比。这样还不够，可能会出现两个或两个以上的递减区间，这种情况直接pass，因为只能翻转一次。#include #include #include #define in

DZY Loves Physicstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDZY loves Physics, and he enjoys calculati

DZY Loves Chessboardtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDZY loves chessboard, and he enjoys pla

解题报告题意：n场比赛其中k场是没看过的，对于这k场比赛，a,b,c三队赢的场次的关系是a队与b队的绝对值差d1,b队和c队绝对值差d2,求是否能使三支球队的赢的场次相同。思路：|B-A|=d1|C-B|=d2A+B+C=k这样就有4种情况，分别是：B>A&&CB>A&&C>BBBB分别算出在k场比赛中a,b,c三支队伍赢的场次，另外n-k场比赛分别

DZY Loves Chemistrytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDZY loves chemistry, and he enjoys mixin

A. DZY Loves Hashtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDZY has a hash table with p buckets, numbe

B. DZY Loves Stringstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDZY loves collecting special strings wh

Forgotten Episodetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus adores TV series. Right now he

解题报告给篱笆上色，要求步骤最少，篱笆怎么上色应该懂吧，，，刷子可以在横着和竖着刷，不能跳着刷，，，如果是竖着刷，应当是篱笆的条数，横着刷的话，就是刷完最短木板的长度，再接着考虑没有刷的木板，，，递归调用，，，#include #include #include #include #define inf 999999999999999using namespace std

A. Playing with Dicetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo players are playing a game. First e

A. New Year Candlestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasily the Programmer loves romance, so

Prizes, Prizes, more Prizestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya, like many others, likes

DescriptionOne day Vasya heard a story: "In the city of High Bertown a bus number 62 left from the bus station. It had n grown-ups and m kids..."The latter events happen to be of no importance t

A. Bit++time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe classic programming language of Bitland is Bit+

A.Line to CashierMLE合适么，数组给开大了。很水。#include #include #include #include #include #define inf 99999999using namespace std;struct node{ int k; int num[110]; int sum;} po[110];int

Suffix Structurestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBizon the Champion isn't just a bison. He

Valera and Antique Itemstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputValera is a collector. Once he want

Rewardstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBizon the Champion is called the Champion for a reas

Valera and Fruitstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputValera loves his garden, where n fruit tre

Andrey and Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndrey needs one more problem to conduct

DZY Loves Sequencestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDZY has a sequence a, consisting of n in