01 2014 档案

摘要:While preparing this problem set the jury has run into the following problem: it was necessary to send by e-mail the texts of the problems. As it is well known, e-mail is not reliable, messages are sent not enciphered, there is a danger that someone can intercept them. The members of the program com 阅读全文
posted @ 2014-01-16 10:56 acutus 阅读(392) 评论(0) 推荐(0) 编辑
摘要:You programmers are lucky! You don't have to deal with these terrible people – designers… This story happened with me not so long ago. We had an order from a company building a new hotel. One day they brought a sketch to our workshop. They said that THIS was invented by a very cool designer. The 阅读全文
posted @ 2014-01-16 01:14 acutus 阅读(250) 评论(0) 推荐(0) 编辑
摘要:LetAn= sin(1–sin(2+sin(3–sin(4+…sin(n))…)LetSn= (…(A1+n)A2+n–1)A3+…+2)An+1For givenNprintSNInputOne integerN. 1 ≤N≤ 200OutputLine containingSNSampleinputoutput3((sin(1)+3)sin(1–sin(2))+2)sin(1–sin(2+sin(3)))+1Problem Author:Vladimir GladkovProblem Source:Ural Collegiate Programming Contest, April 20 阅读全文
posted @ 2014-01-15 16:04 acutus 阅读(251) 评论(0) 推荐(0) 编辑
摘要:Consider the sequence of numbersai,i= 0, 1, 2, …, which satisfies the following requirements:a0= 0a1= 1a2i=aia2i+1=ai+ai+1for everyi= 1, 2, 3, … .Write a program which for a given value ofnfinds the largest number among the numbersa0,a1, …,an.InputYou are given several test cases (not more than 10). 阅读全文
posted @ 2014-01-15 14:34 acutus 阅读(305) 评论(0) 推荐(0) 编辑
摘要:Your task is to find the sum of all integer numbers lying between 1 andNinclusive.InputThe input consists of a single integerNthat is not greater than 10000 by it's absolute value.OutputWrite a single integer number that is the sum of all integer numbers lying between 1 andNinclusive.Sampleinput 阅读全文
posted @ 2014-01-14 23:29 acutus 阅读(246) 评论(0) 推荐(0) 编辑
摘要:Ural doctors worry about the health of their youth very much. Special investigations showed that a lot of clever students instead of playing football, skating or bicycling had participated in something like Programming Olympiads. Moreover, they call it sports programming! To sit near the monitor and 阅读全文
posted @ 2014-01-14 22:55 acutus 阅读(214) 评论(0) 推荐(0) 编辑
摘要:The statement of this problem is very simple: you are to determine how many squares of the chessboard can be attacked by a knight standing alone on the board. Recall that a knight moves two squares forward (horizontally or vertically in any direction) and then one square sideways (perpedicularly to 阅读全文
posted @ 2014-01-14 12:38 acutus 阅读(432) 评论(0) 推荐(0) 编辑
摘要:The problem is so easy, that the authors were lazy to write a statement for it!InputThe input stream contains aset ofinteger numbersAi(0≤Ai≤ 1018). The numbers are separated byany number ofspaces and line breaks. Asize ofthe input stream does not exceed 256KB.OutputFor each numberAifrom the last one 阅读全文
posted @ 2014-01-13 00:41 acutus 阅读(348) 评论(0) 推荐(0) 编辑
摘要:You are given the following information, but you may prefer to do some research for yourself.1 Jan 1900 was a Monday.Thirty days has September,April, June and November.All the rest have thirty-one,Saving February alone,Which has twenty-eight, rain or shine.And on leap years, twenty-nine.A leap year 阅读全文
posted @ 2014-01-10 17:13 acutus 阅读(298) 评论(0) 推荐(0) 编辑
摘要:An irrational decimal fraction is created by concatenating the positive integers:0.123456789101112131415161718192021...It can be seen that the 12thdigit of the fractional part is 1.Ifdnrepresents thenthdigit of the fractional part, find the value of the following expression.d1d10d100d1000d10000d1000 阅读全文
posted @ 2014-01-07 23:30 acutus 阅读(299) 评论(0) 推荐(0) 编辑
摘要:A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.For example,4432131011 85891454220416375889Therefore any chain that arrives at 1 or 89 will become stuck in an endless loop. What is most amazing is that EVERY sta 阅读全文
posted @ 2014-01-07 18:05 acutus 阅读(331) 评论(0) 推荐(0) 编辑
摘要:Ifpis the perimeter of a right angle triangle with integral length sides, {a,b,c}, there are exactly three solutions forp= 120.{20,48,52}, {24,45,51}, {30,40,50}For which value ofp1000, is the number of solutions maximised?题目大意:如果p是一个直角三角形的周长,三角形的三边长{a,b,c}都是整数。对于p= 120一共有三组解:{20,48,52}, {24,45,51}, 阅读全文
posted @ 2014-01-07 02:39 acutus 阅读(458) 评论(0) 推荐(1) 编辑

TOP