摘要： American HeritageFarmer John takes the heritage of his cows very seriously. He is not, however, a truly fine bookkeeper. He keeps his cow genealogies as binary trees and, instead of writing them in graphic form, he records them in the more linear `tree in-order' and `tree pre-order' notation 阅读全文

摘要： Electric FenceDon PieleIn this problem, `lattice points' in the plane are points with integer coordinates.In order to contain his cows, Farmer John constructs a triangular electric fence by stringing a "hot" wire from the origin (0,0) to a lattice point [n,m] (0<=;n<32000, 0<m 阅读全文

摘要： Raucous RockersYou just inherited the rights to N (1 <= N <= 20) previously unreleased songs recorded by the popular group Raucous Rockers. You plan to release a set of M (1 <= M <= 20) compact disks with a selection of these songs. Each disk can hold a maximum of T (1 <= T <= 20) 阅读全文

摘要： CamelotIOI 98Centuries ago, King Arthur and the Knights of the Round Table used to meet every year on New Year's Day to celebrate their fellowship. In remembrance of these events, we consider a board game for one player, on which one chesspiece king and several knight pieces are placed on square 阅读全文

摘要： 104. Little shop of flowerstime limit per test: 0.5 sec.memory limit per test: 4096 KBPROBLEMYou want to arrange the window of your flower shop in a most pleasant way. You haveFbunches of flowers, each being of a different kind, and at least as many vases ordered in a row. The vases are glued onto t 阅读全文

摘要： Problem APlay with Floor and CeilInput:standard inputOutput:standard outputTime Limit:1 secondTheoremFor any two integersxandkthere exists two more integerspandqsuch that: It’s a fairly easy task to prove this theorem, so we’d not ask you to do that. We’d ask for ... 阅读全文

摘要： 106. The equationtime limit per test: 0.5 sec.memory limit per test: 4096 KBThere is an equation ax + by + c = 0. Given a,b,c,x1,x2,y1,y2 you must determine, how many integer roots of this equation are satisfy to the following conditions : x1<=x<=x2, y1<=y<=y2. Integer root of this equat 阅读全文

摘要： 123. The sumtime limit per test: 0.5 sec.memory limit per test: 4096 KBThe Fibonacci sequence of numbers is known: F1= 1; F2= 1; Fn+1= Fn+ Fn-1, for n>1.You have to findS- the sum of the firstKFibonacci numbers.InputFirst line contains natural numberK(0<K<41).OutputFirst line should contain 阅读全文

摘要： Problem AFill the SquareInput:Standard InputOutput:Standard OutputIn this problem, you have to draw a square using uppercase English Alphabets.To be more precise, you will be given a square grid with some empty blocks and others already filled for you with some letters to make your task easier. You 阅读全文

摘要： Shopping OffersIOI'95In a certain shop, each kind of product has an integer price. For example, the price of a flower is 2 zorkmids (z) and the price of a vase is 5z. In order to attract more customers, the shop introduces some special offers.A special offer consists of one or more product items 阅读全文

摘要： 105. Div 3time limit per test: 0.5 sec.memory limit per test: 4096 KBThere is sequence 1, 12, 123, 1234, ..., 12345678910, ... . Given first N elements of that sequence. You must determine amount of numbers in it that are divisible by 3.InputInput contains N (1<=N<=231- 1).OutputWrite answer t 阅读全文

摘要： idtitlehow2submitsourcepage1盒子里的气球82图书馆ural118893钓鱼uva757pas134照亮的山景135镜子盒156折纸痕uva177pas197三色多边形ural1181208聪明的学生209丢失的数2310月亮之眼2811Yanghee的数表2912原子链3113铁轨uva514c3614小球钟——时间与运动uva239*3815笑脸acmpj.zstu.edu.cn/JudgeOnline/ 25274016猜猜我想说什么4417勇士Ilya的故事ural10885018蚂蚁和瓢虫http://www.acm.cs.ecnu.edu.cn/ 1340 阅读全文

摘要： 101 Domino 欧拉路102 Coprime 枚举/数学方法103 Traffic Lights 最短路104 Little Shop of Flowers 动态规划105 Div 3 找规律106 The Equation 扩展欧几里德107 987654321 Problem 找规律108 Self-numbers II 枚举+筛法递推109 Magic of David Copperfield II 构造110 Dungeon 计算几何+模拟111 Very Simple Problem 模拟笔算开方112 a^b-b^a 高精度113 Nearly Prime Numbers 判 阅读全文

摘要： 4thIIUCInter-UniversityProgramming Contest, 2005AChildren’s GameInput: standard inputOutput: standard outputProblemsetter:Md.KamruzzamanThere are lots of number games for children. These games are pretty easy to play but not so easy to make. We will discuss about an interesting game here. Each playe 阅读全文

摘要： Problem EWatering GrassInput:standard inputOutput:standard outputTime Limit:3 secondsnsprinklers are installed in a horizontal strip of grasslmeters long andwmeters wide. Each sprinkler is installed at the horizontal center line of the strip. For each sprinkler we are given its position as the dista 阅读全文