Joeferyの博客

D. Arthur and Wallstime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputFinally it is a day when Arthur has eno

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 outputFamil Door wants to celebrate his birthday with his friends

time limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputDoor's family is going celebrate Famil Doors's birthday party

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 outputYou are given an alphabet consisting of n letters, your task

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

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

B. Beautiful Paintingstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n pictures delivered for th

C. Watchmentime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWatchmen are in a danger and Doctor Manhattan t

D. Image Previewtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya's telephone contains n photos. Photo

B. Print Checktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputKris works in a large company "Blake Technolo

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

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

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

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

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

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

DescriptionIgor is in the museum and he wants to see as many pictures as possible.Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty

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

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

DescriptionLittle Chris is very keen on his toy blocks. His teacher, however, wants Chris to solve more problems, so he decided to play a trick on Chris.There are exactly s blocks in Chris's set

DescriptionLittle Chris is a huge fan of linear algebra. This time he has been given a homework about the unusual square of a square matrix.The dot product of two integer number vectors x and y 

DescriptionLittle Chris knows there's no fun in playing dominoes, he thinks it's too random and doesn't require skill. Instead, he decided to play with the dominoes and make a "domino show".Chri

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

DescriptionThe Cybernetics Failures (CF) organisation made a prototype of a bomb technician robot. To find the possible problems it was decided to carry out a series of tests. At the beginning of

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

C. The Smallest String Concatenationtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou're given a list of

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

1984. Dummy GuyTime limit: 0.5 secondMemory limit: 64 MBEvery year students of our university participate in Regional Contest in Saint Petersburg. Train journeys from Yekaterinburg to Sa

题目链接题意：定义只由7和8组成的数字为幸运数字，现给出一整数n，问位数不超过n位的数字中有多少个幸运数字找了好久，才发现规律 T_T 没救了。。ans=2+2^2+2^3+…+2^n=2*(2^n-1) #include#include#include#include#include#include#include#inc

题目链接推公式就好了，注意爆int#include#include#include#include#includeusing namespace std;int main(){ long long x0,y0,x,y; cin>>x0>>y0>>x>>y; cout<<((x-x0)/2+1)*((y-y0)/2+1)+(x-x0)*(

A. Tricky Sumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn this problem you are to calculate the sum o

C. Pythagorean Triplestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputKatya studies in a fifth grade. Recen

题目链接排列组合 计算 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

题目链接#include#include#include#include#includeusing namespace std;typedef long long LL;LL C(LL n,LL r){ LL i,j,s=1; if(r>n)return 0; if(n-r<r)r=n-r; for(i=0,j=1;i<r;i++){

题目链接一座城市有n条南北走向的街道和n条东西走向的街道，现要将5条不用的长凳放置在街道相交处，且同一条街道上的长凳数不超过一条，问有多少种放置方案 #include#include#include#include#includeusing namespace std;typedef long long LL;LL C(LL n,LL r){ LL i

题目链接4种不同的汽车，有2n-2个停车位，要求恰有n辆相同的车排在一起，问有多少种停车方案 分类讨论：1）n辆车在停车场两端，方案数为2*4*3*4^(n-3)，2）n辆车不在两端，方案为4*(n-3)3*3*4^(n-4)，所以总的停车方案有 24*4^(n-3)+36(n-3)*4^(n-4) #include

A. Ice Skatingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBajtek is learning to skate on ice. He's a b