Baymax

大家是否还记得我在前面发表过的一篇文章，就是一道题，觉得很简单，但是自己运行的都对，提交就不对，我终于知道是怎么回事了，让我来告诉你们真相吧。原来是题目有点问题，数据有点问题，说白了，就是输入N之后，不是接着跟N组数据，而是大于或者小于或者等于，是不是。。。。。。再看一下我提交后的正确的代码吧#include#include int main(){ int n, i; char a

Description To celebrate the opening of the Winter Computer School the organizers decided to buy in n liters of cola. However, an unexpected difficulty occurred in the shop: it turned out that cola is

Description Indian summer is such a beautiful time of the year! A girl named Alyona is walking in the forest and picking a bouquet from fallen leaves. Alyona is very choosy — she doesn’t take a leaf i

Description One day Vasya got hold of information on the Martian dollar course in bourles for the next n days. The buying prices and the selling prices for one dollar on day i are the same and are equ

Description It’s a very unfortunate day for Volodya today. He got bad mark in algebra and was therefore forced to do some work in the kitchen, namely to cook borscht (traditional Russian soup). This s

Description There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that1 ≤ i, j ≤ NS[i] = S[j], that is the i-th symbol of strin

Description The blinds are known to consist of opaque horizontal stripes that can be rotated thus regulating the amount of light flowing in the room. There are n blind stripes with the width of 1 in t

Description input input.txt output output.txt Once upon a time, when the world was more beautiful, the sun shone brighter, the grass was greener and the sausages tasted better Arlandia was the mos

Description input input.txt output output.txt Recently Vasya got interested in finding extra-terrestrial intelligence. He made a simple extra-terrestrial signals’ receiver and was keeping a record

Description Petya works as a PR manager for a successful Berland company BerSoft. He needs to prepare a presentation on the company income growth since 2001 (the year of its founding) till now. Petya

Description input input.txt output output.txt Today the «Z» city residents enjoy a shell game competition. The residents are gathered on the main square to watch the breath-taking performance. The

Description给你N个数，分别为a1，a2…aN，你现在可以交换两个数（只有一次机会），问你是否可以使这个序列成为递增序列。 即x1 <= X2 <= X3 <= X4.你只有一次交换机会，也可以选择不交换。Input输入包含多组测试用例，对于每组测试用例。 输入N(1 <= N <= 100000) 接下来输入N个数ai(0 <= ai <= 100000)。Output最多交换两个

Geometry Made SimpleDescriptionMathematics can be so easy when you have a computer. Consider the following example. You probably know that in a right-angled triangle, the length of the three sides a, b

Problem Description CA loves to play with sticks. One day he receives four pieces of sticks, he wants to know these sticks can spell a quadrilateral.Input First line contains T denoting the number o