Joeferyの博客

A. Bus to Udaylandtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon are tr

time limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputOnce Max found an electronic calculator(计算器) from his grandfa

time limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputYou are given an alphabet consisting of n letters, your task

time limit per test 0.5 secondsmemory limit per test 64 megabytesinput standard inputoutput standard outputThe HR manager was disappointed again. The last applicant f

time limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputBlake is a CEO of a large company called "Blake Technologies"

time limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputCalvin the robot lies in an infinite rectangular grid. Calvi

DescriptionCarl is a beginner magician. He has a blue, b violet and c orange magic spheres. In one move he can transform two spheres of the same color into one sphere of any other color. To make

DescriptionLittle Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.There a

题目链接/* 题意:给你n个题目的情况,分别是题目的难度[1,10],是否泄题0/1,是否答对i/c 如果存在"答对难度大且泄题"(1,c) 却 "没答对难度小且没泄题"的题目(0,i), 则算一次考试作弊嫌疑,问最终有多少次考试作弊的嫌疑 类型:水题 分析:先按照难度从小到大排个序,然后记录(0,i)的和,当遇到(1,c

Descriptionstandard input/outputStatementsWould you want to fight against bears riding horses? Me neither.Limak is a grizzly bear. He is a general of the dreadful army of Bearland. The mos

Descriptionstandard input/outputStatementsPPAP, which stands for Pen Pineapple Apple Pen, is an unusual song and dance that went viral in the Internet recently. It's about merging a pen with

DescriptionVasiliy lives at point (a, b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearb

DescriptionVasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink "Beecola", which can be bought in n different s

DescriptionA magic island Geraldion, where Gerald lives, has its own currency system. It uses banknotes of several values. But the problem is, the system is not perfect and sometimes it happens th

B. Decodingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp is mad about coding, that is why he wri

C. Tramtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe tram in Berland goes along a straight line from

A. Joystickstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFriends are going to play console. They have tw

C. Reporttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEach month Blake gets the report containing main

A. Brain's Photostime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSmall, but very brave, mouse Brain was no

题目链接排列组合 计算 C(N,5)+C(N,6)+C(N,7)#include#include#include#include#includeusing namespace std;typedef long long LL;LL C(LL n,LL r){ LL i,j,s=1; if(n-r<r)r=n-r; for(i=0,j=1;i<r

题目链接/* 题意：给你n个数字和一个差值k,当两个数的差值小于k时,这两个数是同一个集合里的, 求不同集合的个数 类型：水题 分析：N只有100,排个序直接暴力搞*/#include#include#include#includeusing namespace std;const int maxn = 105;int a[m

DescriptionGerald bought two very rare paintings at the Sotheby's auction and he now wants to hang them on the wall. For that he bought a special board to attach it to the wall and place the paint

题目连接/********************************************************题意:给你一个n表示显示屏中的节段数,如果存在则输出时间,否则输出Impossible。类型：暴力、水题分析：开个数组存一下每种数字的节段数,然后对每一位暴力枚举即可。*******************************************

A. Sorting Railway Carstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn infinitely long railway has a tr

题目链接暴力枚举即可#include#include#include#include#includeusing namespace std;int main(){ int t; scanf("%d",&t); while(t--){ int a,b,c,d,Cas=0; while(~scanf("%d%

题目链接#include#include#include#include#include#includeusing namespace std;int main(){ long long n; cin>>n; cout<<1+3*n*(n+1)<<endl;}

题目链接

题意：12张卡片排成一排，图案分别是“X”或“O”，将这12张牌组成a*b的矩阵，其中前b张作为第一行，再后边的b张作为第二行，依次继续，直到完成矩阵。题目链接把X看成1，O看成0，暴力尝试所以可能的情况即可，注意输出顺序#include#include#includeusing namespace std;int a[20],b[20],sum

题目链接题意：n个披萨，卡路里从小到大，然后进行否决投票，先Alice否决卡路里最高的，再Bob否决卡路里最低的，然后自己否决掉一个，使自己能得到自己喜欢的口味，一直循环下去，直到只剩一个披萨，如果剩下的是自己想要的，那么输出YES，否则输出NO一道水题硬生生WA了两次。果然还是太年轻。。#include#include#include#includeu

Problem DescriptionGiven a sequence 1,2,3,......N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M.InputInput contains multiple test cases. each

题目连接/********************************************************题意: 给你一个大矩形和一个小矩形,小矩形在大矩形内,再给你另一个矩形的宽和高,问你能否把这个矩形再放进大矩形内.类型：水题分析：分别讨论两种情况即可*****************************************************

A. Grandma Laura and Applestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGrandma Laura came to the market

B. Alice, Bob, Two Teamstime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlice and Bob are playing a game

A. Compotetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNikolay has a lemons, b apples and c pears. He