2014年12月_叶孤心丶

12月 11月 10月 09月 08月 07月 06月 05月

原创 UVA Train Swapping（冒泡排序的次数）

Train Swapping Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Train Swapping At an old railway statio

2014-12-05 01:45:14 732

原创 UVA Tree's a Crowd（三维空间的点求最短距离）

Tree's a Crowd Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Tree's a Crowd Dr William Larch, noted

2014-12-05 01:41:04 821

原创 UVA Where is the Marble?（排序查找是否存在要求的数字）

Where is the Marble? Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Where is the Marble? Raju and Me

2014-12-05 01:35:13 633

原创 UVA List of Conquests（字符串按字典排序）

Problem B List of Conquests Input: standard input Output: standard output Time Limit: 2 seconds In Act I, Leporello is telling Donna Elvira about his master's long list of conquests: ``This is t

2014-12-05 01:30:41 904

原创 UVA Master-Mind Hints（）

Master-Mind Hints Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description MasterMind is a game for two players. One of them, Designer, selects

2014-12-05 01:22:39 1262

转载 UVA If We Were a Child Again（大数相除模板）

Problem C If We Were a Child Again Input: standard input Output: standard output Time Limit: 7 seconds “Oooooooooooooooh! If I could do the easy mathem

2014-12-04 08:47:57 717

原创 UVA Decode the tape（模拟）

Decode the tape Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description "Machines take me by surprise with great frequency." Al

2014-12-04 00:55:11 601

原创 UVA （POJ 1598）Excuses, Excuses!

Excuses, Excuses! Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Excuses, Excuses! Judge Ito is havin

2014-12-04 00:43:56 1111

原创 UVA Artificial Intelligence?(模拟)

Artificial Intelligence? Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Artificial Intelligence? Phy

2014-12-04 00:37:05 1077

原创 UVA Overflow（判断是否大于int的最大值）

Overflow Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Overflow Write a program that reads an expression c

2014-12-03 00:06:03 1235

原创 UVA Where's Waldorf?（模拟）

Where's Waldorf? Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Where's Waldorf? Given a m by n grid of lett

2014-12-03 00:02:43 649

原创 UVA Automatic Poetry（模拟）

Problem I Automatic Poetry Input: standard input Output: standard output Time Limit: 2 seconds Memory Limit: 32 MB “Oh God”, Lara Croft exclaims, “it’s one of these dumb riddles again!”

2014-12-02 01:49:21 610

原创 UVA Andy's First Dictionary（模拟+字符串排序）

Andy's First Dictionary Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Problem B: Andy's First Dictionary Tim

2014-12-02 01:44:47 581

原创 UVA Product（大数乘法）

Product Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Product The Problem The problem is to multiply tw

2014-12-01 22:39:44 609

原创 UVA Integer Inquiry（大数加法）

Integer Inquiry Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Integer Inquiry One of the first users of BI

2014-12-01 22:36:55 805

原创 UVA Immediate Decodability（简单字典树）

Immediate Decodability Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Immediate Decodability An encoding o

2014-12-01 22:35:09 612

原创 UVA Palindromes（模拟）

Palindromes Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description A regular palindrome is a string of numbers or letters that is the same for

2014-12-01 22:31:00 629