Alex_McAvoy的博客

【概述】模拟，是根据实际问题建立模型，模拟实际按程序走一遍，最终求出答案。思维，则是与逻辑思维有关，其需要针对题意、数据范围等抽丝剥茧抽离出有用的信息，从而得出一个结果。对于一般的模拟，直接根据题意编写即可，但是有些模拟会混有别的部分，思维难度较大，且要注意的细节部分很多，大多数模拟题难度不高，只要选择合适的数据结构，注意细节处理，即可顺利写出程序。而对于思维题，容易陷入思维误区，...

Problem Description A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the ...

【题目描述】小明在一次聚会中，不慎遗失了自己的钱包，在接下来的日子，面对小明的将是一系列的补卡手续和堆积的账单… 在小明的百般恳求下，老板最终同意延缓账单的支付时间。可老板又提出，必须从目前还没有支付的所有账单中选出面额最大和最小的两张，并把他们付清。还没有支付的账单会被保留到下一天。 请你帮他计算出支付的顺序。【输入】第1行：一个正整数N(N≤15,000)，表示小明补办银联卡总共...

Problem DescriptionThere is a robot on a coordinate plane. Initially, the robot is located at the point (0,0). Its path is described as a string s of length n consisting of characters 'L', 'R', 'U'...

Problem DescriptionMishka wants to buy some food in the nearby shop. Initially, he has s burles on his card.Mishka can perform the following operation any number of times (possibly, zero): choose...

Problem DescriptionYou are given an array a consisting of n integers.In one move, you can choose two indices 1≤i,j≤n such that i≠j and set ai:=aj. You can perform such moves any number of times (...

Problem DescriptionPolycarp has three sisters: Alice, Barbara, and Cerene. They're collecting coins. Currently, Alice has a coins, Barbara has b coins and Cerene has c coins. Recently Polycarp has ...

Problem DescriptionOur dear Cafe's owner, JOE Miller, will soon take part in a new game TV-show "1 vs. n"!The game goes in rounds, where in each round the host asks JOE and his opponents a common...

Problem DescriptionA.R.C. Markland-N is a tall building with n floors numbered from 1 to n. Between each two adjacent floors in the building, there is a staircase connecting them.It's lunchtime fo...

Problem DescriptionConsidering the overall difficulty of other problems, we invite Quailty to propose an easy problem for this contest.Quailty accidentally won both gold medal and silver medal in...

Problem DescriptionAcesrc is a famous mathematician at Nanjing University second to none. Playing with interesting numbers is his favorite. Today, he finds a manuscript when cleaning his room, whic...

Problem DescriptionOne fine October day a mathematics teacher Vasily Petrov went to a class and saw there n pupils who sat at the desks, two people at each desk. Vasily quickly realized that number...

Problem DescriptionYou are given two integers bb and ww. You have a chessboard of size 109×109109×109 with the top left cell at (1;1)(1;1), the cell (1;1) is painted white.Your task is to find a ...

Problem DescriptionThis problem is the most boring one you've ever seen.Given a sequence of integers a1, a2, ..., an and a non-negative integer h, our goal is to partition the sequence into two s...

Problem DescriptionOverall there are m actors in Berland. Each actor has a personal identifier — an integer from 1 to m (distinct actors have distinct identifiers). Vasya likes to watch Berland mov...

Problem DescriptionAlice and Bob have received three big piles of candies as a gift. Now they want to divide these candies as fair as possible. To do this, Alice takes one pile of candies, then Bob...

Problem DescriptionThere is a bar of chocolate with a height of H blocks and a width of W blocks. Snuke is dividing this bar into exactly three pieces. He can only cut the bar along borders of bloc...

Problem DescriptionYou are taking a computer-based examination. The examination consists of N questions, and the score allocated to the i-th question is si. Your answer to each question will be jud...

Problem DescriptionAtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0,0) at time 0, then for each i between 1 and N (inclusive), he will visi...

Problem DescriptionSnuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is ai.He can perform the following operation any number of times:Operation: Choose integers x...

Problem DescriptionThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.Takahashi w...

Problem DescriptionSnuke loves puzzles.Today, he is working on a puzzle usingS- andc-shaped pieces. In this puzzle, you can combine twoc-shaped pieces into oneS-shaped piece, as shown in the ...

Problem DescriptionSnuke, who loves animals, built a zoo.There are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle. The animal numbered i(2≤i≤N−1) is a...

Problem DescriptionYou are given an integer sequence of length N. The i-th term in the sequence is ai. In one operation, you can select a term and either increment or decrement it by one.At least...

Problem DescriptionIn a public bath, there is a shower which emits water for T seconds when the switch is pushed.If the switch is pushed when the shower is already emitting water, from that momen...

Problem DescriptionWrite a program to read four lines of upper case (i.e., all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram t...

Problem DescriptionWe have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence become...

Problem DescriptionWe have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence become...

Problem DescriptionWe have a grid with H rows and W columns of squares. Snuke is painting these squares in colors 1, 2, …, N. Here, the following conditions should be satisfied:For each i (1≤i≤N)...

Problem DescriptionIn the autumn of this year, two Russian teams came into the group stage of the most prestigious football club competition in the world — the UEFA Champions League. Now, these tea...

Problem DescriptionHarry Potter has a difficult homework. Given a rectangular table, consisting of n × m cells. Each cell of the table contains the integer. Harry knows how to use two spells: the f...

Problem DescriptionFinal Exam is coming! Cuber QQ has now one night to prepare for tomorrow's exam.The exam will be a exam of problems sharing altogether m points. Cuber QQ doesn't know about the...

Problem DescriptionThere are n stones numbered from 1 to n.The weight of the i-th stone is i kilograms. We divide the stones into k groups.Each group consists of exactly stones.We define the wei...

Problem DescriptionYou are given a 4 × 4 grid, which consists of 15 number cells and an empty cell.All numbers are unique and ranged from 1 to 15.In this board, the cells which are adjacent with ...

Problem DescriptionThe Little Elephant has two permutations a and b of length n, consisting of numbers from 1 to n, inclusive. Let's denote the i-th (1 ≤ i ≤ n) element of the permutation a as ai, ...

Problem DescriptionThere are n houses in a row. They are numbered from 1to nn in order from left to right. Initially you are in the house 1.You have to perform kk moves to other house. In one mo...

Problem DescriptionThere are n distinct points on a coordinate line, the coordinate of i-th point equals to xi. Choose a subset of the given set of points such that the distance between each pair o...

Problem DescriptionY_UME has just found a numberxin his right pocket. The number is a non-negative integer ranging from0to2n−1inclusively. You want to know the exact value of this number. Y_U...

Problem DescriptionTom and Jerry are going on a vacation. They are now driving on a one-way road and several cars are in front of them. To be more specific, there arencars in front of them. Thei...

Problem DescriptionThe hot summer came so quickly that Xiaoming and Xiaohong decided to buy a big and sweet watermelon. But they are two very strange people. They are even-numbered enthusiasts. The...