流水依依

希望朋友们有个好的身体,开开心心工作与学习。

博客园 首页 新随笔 联系 订阅 管理
上一页 1 2 3 4 5 6 7 ··· 14 下一页

2014年1月17日 #

摘要: C. Sereja and Prefixestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSereja loves number sequences very much. That's why he decided to make himself a new one following a certain algorithm.Sereja takes a blank piece of paper. Then he starts wr 阅读全文
posted @ 2014-01-17 17:09 流水依依 阅读(203) 评论(0) 推荐(0)

摘要: A. Sereja and Dimatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSereja and Dima play a game. The rules of the game are very simple. The players havencards in a row. Each card contains a number, all numbers on the cards are distinct. The players 阅读全文
posted @ 2014-01-17 13:11 流水依依 阅读(280) 评论(0) 推荐(0)

2014年1月14日 #

摘要: 题目1047:素数判定时间限制:1 秒内存限制:32 兆特殊判题:否提交:4137解决:1906题目描述:给定一个数n,要求判断其是否为素数(0,1,负数都是非素数)。输入:测试数据有多组,每组输入一个数n。输出:对于每组输入,若是素数则输出yes,否则输入no。样例输入:13样例输出:yes来源:2009年哈尔滨工业大学计算机研究生机试真题import java.util.*;import java.math.*;class App{ int X ; App(){} ; App(int x ){ X = x ; } int ... 阅读全文
posted @ 2014-01-14 16:42 流水依依 阅读(247) 评论(0) 推荐(0)

2013年12月16日 #

摘要: C. Watching Fireworks is Funtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA festival will be held in a town's main street. There arensections in the main street. The sections are numbered1throughnfrom left to right. The distance between eac 阅读全文
posted @ 2013-12-16 15:18 流水依依 阅读(363) 评论(0) 推荐(1)

2013年12月14日 #

摘要: B. Making Sequences is Funtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe'll defineS(n)for positive integernas follows: the number of then's digits in the decimal base. For example,S(893) = 3,S(114514) = 6.You want to make a consecutiv 阅读全文
posted @ 2013-12-14 10:13 流水依依 阅读(253) 评论(0) 推荐(0)

2013年12月13日 #

摘要: 1352: New Sorting AlgorithmTime Limit:1 SecMemory Limit:128 MBDescription We are trying to use a new sorting algorithm to sort a sequence with distinct integers. This algorithm will be end if the sequence is already in increasing order from left to right. Or for each step, supposexis the leftmost in 阅读全文
posted @ 2013-12-13 18:48 流水依依 阅读(280) 评论(0) 推荐(0)

2013年12月12日 #

摘要: 1350: To Add Which?Time Limit:1 SecMemory Limit:128 MBDescription There is an integer sequence withNintegers. You can use 1 unit of cost to increase any integer in the sequence by 1. Could you tell us the least units of cost to achieve that, the absolute value of difference between any two adjacent 阅读全文
posted @ 2013-12-12 22:03 流水依依 阅读(296) 评论(0) 推荐(0)

摘要: D. Vesselstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is a system ofnvessels arranged one above the other as shown in the figure below. Assume that the vessels are numbered from 1 ton, in the order from the highest to the lowest, the vo 阅读全文
posted @ 2013-12-12 17:34 流水依依 阅读(332) 评论(0) 推荐(0)

2013年12月8日 #

摘要: C. Hamburgerstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburgers 阅读全文
posted @ 2013-12-08 21:20 流水依依 阅读(318) 评论(0) 推荐(0)

摘要: B. Fox Dividing Cheesetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo little greedy bears have found two pieces of cheese in the forest of weightaandbgrams, correspondingly. The bears are so greedy that they are ready to fight for the larger p 阅读全文
posted @ 2013-12-08 20:34 流水依依 阅读(326) 评论(0) 推荐(0)

上一页 1 2 3 4 5 6 7 ··· 14 下一页