扩大
缩小

2012年8月2日

TOJ3070. Encryption

摘要： 3070. EncryptionTime Limit: 1.0 Seconds Memory Limit: 65536KTotal Runs: 1960 Accepted Runs: 903You must have heard of an ancient encryption called Caesar cipher or 'shift cipher'. That is, given the plaintext and a number D, you should replace every character c in the plaintext with another 阅读全文

posted @ 2012-08-02 16:14 LinuxPanda 阅读(229) 评论(0) 推荐(0) 编辑

TOJ1601. Box of Bricks

摘要： 1601. Box of BricksTime Limit: 1.0 Seconds Memory Limit: 65536KTotal Runs: 5002 Accepted Runs: 1949Little Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. "Look, I've built a wall!", he tells his older sister Alice. &q 阅读全文

posted @ 2012-08-02 16:12 LinuxPanda 阅读(173) 评论(0) 推荐(0) 编辑

TOJ1547. To and Fro

摘要： 1547. To and FroTime Limit: 1.0 Seconds Memory Limit: 65536KTotal Runs: 878 Accepted Runs: 688Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and write the message (letters only) down the columns, padding with extra random letters so as to. 阅读全文

posted @ 2012-08-02 16:04 LinuxPanda 阅读(206) 评论(2) 推荐(0) 编辑

TOJ1153. Word Reversal

摘要： 1153. Word ReversalTime Limit: 1.0 Seconds Memory Limit: 65536KTotal Runs: 5327 Accepted Runs: 2132 Multiple test filesFor each list of words, output a line with each word reversed without changing the order of the words.InputYou will be given a number of test cases. The first line contains a posi.. 阅读全文

posted @ 2012-08-02 14:58 LinuxPanda 阅读(423) 评论(0) 推荐(0) 编辑

NYOJ62笨小熊

摘要： 笨小熊时间限制：2000ms | 内存限制：65535KB难度：2描述笨小熊的词汇量很小，所以每次做英语选择题的时候都很头疼。但是他找到了一种方法，经试验证明，用这种方法去选择选项的时候选对的几率非常大！这种方法的具体描述如下：假设maxn是单词中出现次数最多的字母的出现次数，minn是单词中出现次数最少的字母的出现次数，如果maxn-minn是一个质数，那么笨小熊就认为这是个Lucky Word，这样的单词很可能就是正确的答案。输入第一行数据N(0<N<100)表示测试数据组数。每组测试数据输入只有一行，是一个单词，其中只可能出现小写字母，并且长度小于100。输出每组测试数据输出 阅读全文

posted @ 2012-08-02 14:44 LinuxPanda 阅读(421) 评论(0) 推荐(0) 编辑

NYOJ94cigarettes

摘要： cigarettes时间限制：3000ms | 内存限制：65535KB难度：2描述Tom has many cigarettes. We hypothesized that he has n cigarettes and smokes themone by one keeping all the butts. Out of k > 1 butts he can roll a new cigarette.Now，do you know how many cigarettes can Tom has?输入First input is a single line,it's n and 阅读全文

posted @ 2012-08-02 14:42 LinuxPanda 阅读(129) 评论(0) 推荐(0) 编辑

NYOJ122Triangular Sums

摘要： Triangular Sums时间限制：3000ms | 内存限制：65535KB难度：2描述ThenthTriangularnumber,T(n) = 1 + … +n, is the sum of the firstnintegers. It is the number of points in a triangular array withnpoints on side. For exampleT(4):XX XX X XX X X XWrite a program to compute the weighted sum of triangular numbers:W(n) =SUM[k 阅读全文

posted @ 2012-08-02 14:41 LinuxPanda 阅读(220) 评论(0) 推荐(0) 编辑

NYOJ484The Famous Clock

摘要： The Famous Clock时间限制：1000ms | 内存限制：65535KB难度：1描述Mr. B, Mr. G and Mr. M are now in Warsaw, Poland, for the 2012’s ACM-ICPC World Finals Contest. They’ve decided to take a 5 hours training every day before the contest. Also, they plan to start training at 10:00 each day since the World Final Contest w 阅读全文

posted @ 2012-08-02 14:40 LinuxPanda 阅读(153) 评论(0) 推荐(0) 编辑

NYOJ283对称排序

摘要： 对称排序时间限制：1000ms | 内存限制：65535KB难度：1描述In your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have just finished writing a program whose output is a list of names in nondescending order by length (so that each name is at least as long as the one preceding it). However, 阅读全文

posted @ 2012-08-02 14:39 LinuxPanda 阅读(209) 评论(0) 推荐(0) 编辑

NYOJ217a letter and a number

摘要： a letter and a number时间限制：3000ms | 内存限制：65535KB难度：1描述we define f(A) = 1, f(a) = -1, f(B) = 2, f(b) = -2, ... f(Z) = 26, f(z) = -26;Give you a letter x and a number y , you should output the result of y+f(x).输入On the first line, contains a number T(0<T<=10000).then T lines follow, each line is 阅读全文

posted @ 2012-08-02 14:37 LinuxPanda 阅读(184) 评论(0) 推荐(0) 编辑

NYOJ216A problem is easy

摘要： A problem is easy时间限制：1000ms | 内存限制：65535KB难度：3描述When Teddy was a child , he was always thinking about some simple math problems ,such as “What it’s 1 cup of water plus 1 pile of dough ..” , “100 yuan buy 100 pig” .etc..One day Teddy met a old man in his dream , in that dream the man whose name was“ 阅读全文

posted @ 2012-08-02 14:36 LinuxPanda 阅读(172) 评论(0) 推荐(0) 编辑

NYOJ204Coin Test

摘要： Coin Test时间限制：3000ms | 内存限制：65535KB难度：1描述As is known to all,if you throw a coin up and let it droped on the desk there are usually three results. Yes,just believe what I say ~it can be the right side or the other side or standing on the desk, If you don't believe this,just try In the past there 阅读全文

posted @ 2012-08-02 14:34 LinuxPanda 阅读(190) 评论(0) 推荐(0) 编辑

NYOJ103A+B Problem II

摘要： A+B Problem II时间限制：3000ms | 内存限制：65535KB难度：3描述I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.A,B must be positive.输入The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow 阅读全文

posted @ 2012-08-02 14:33 LinuxPanda 阅读(210) 评论(0) 推荐(0) 编辑

导航