2014年12月_Rocky0429

原创 UVA 10115-Automatic Editing(运用字符串函数对字符串进行替换)

Automatic EditingTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionProblem E: Automatic EditingSource file:autoedit.{c,

2014-12-29 13:16:37 1416

原创 UVA 409-Excuses, Excuses!(模拟)

Excuses, Excuses!Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Excuses, Excuses! Judge Ito is having a pr

2014-12-28 12:51:15 1504

原创 UVA 644- Immediate Decodability (寻找是否有相同前缀)

Immediate Decodability An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this

2014-12-27 14:14:20 1161

原创 UVA 10815-Andy's First Dictionary（字符串模拟+排序+重复删除||STL-set）

Andy's First DictionaryTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionProblem B: Andy's First DictionaryTime li

2014-12-27 11:47:33 1677

原创 UVA 10878-Decode the tape（模拟）

Decode the tapeTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription "Machines take me by surprise with great frequency."Al

2014-12-26 00:45:11 1440

原创 UVA 10494-If We Were a Child Again（大数除法及取余）

If We Were a Child AgainTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionProblem CIf We Were a Child AgainInput: standard inputOutp

2014-12-10 23:33:23 1479

原创 UVA 465- Overflow（借助atof函数将字符串改为double型）

OverflowTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Overflow Write a program that reads an expression c

2014-12-09 23:52:00 1318

原创 UVA 10361-Automatic Poetry(模拟)

Automatic PoetryTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionProblem IAutomatic PoetryInput: standard inputOutput: standard out

2014-12-09 23:46:16 1191

原创 UVA 10106-Product(大数乘法)

ProductTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Product The ProblemThe problem is to multiply two

2014-12-08 00:05:31 1236

原创 UVA 424-Integer Inquiry(大数加法)

Integer InquiryTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription Integer Inquiry One of the first users of BI

2014-12-07 22:53:34 1412

原创 UVA 401-Palindromes(模拟)

PalindromesTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionA regular palindrome is a string of numbers or letters that is the same for

2014-12-07 22:43:23 1248

原创 SDUT ACM 2013级选拔赛（部分题目）

真是没sei了，各种不在状态，又困又累，脑袋就和要炸了一样，也不知道怎么了。四个小时真是一点没浪费，真的算是重新审视了一下自己。这一阵一直乱七八糟的搞来搞去，也没点目的性，算是一直在看算法，算法也没说有多少精进，数学类型靠思维的真的感觉有点无力，反应真的很慢，感觉做题还是太少了，涉猎的面太窄，既然知道了，接下来就去做吧，时间略紧。下面进入正题：迷之博弈题目描述FF喜欢博

2014-12-06 21:56:34 1371

原创人活着系列之开会（最短路_floyd）

人活着系列之开会Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^题目描述人活着如果是为了事业，从打工的到老板的，个个都在拼搏，奋斗了多年终于有了非凡成就，有了一笔丰富的钱财。反过来说，人若赚取了全世界又有什么益处呢？生不带来，死了你还能带去吗？金钱能买保险，但不能买生命，金钱能买药品，但不能买健康，人生在世，

2014-12-05 00:06:19 1271

原创 SDUT ACM月赛（被各种取值范围坑的无力吐槽）

神奇的树题目链接->>>>>>>>猛戳这看到10^5次方当时就吓哭了，起初想到是不是x，m的奇偶数的关系，好吧我承认我想多了，wa。后来直接一咬牙暴力，水过~#include#include#includeint main(){ int x,m; int flag; int cnt; while(~scanf("%d %d",&x

2014-12-02 16:20:13 1447

Rocky0429