模拟
关注
分享
扫一扫
_lyl
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
高精度大数A+B
以前也有写过大数的A+B原创 2014-06-17 22:22:34 · 999 阅读 · 0 评论 -
HDU 1873-看病要排队(优先队列+模拟乱搞)
看病要排队Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5042 Accepted Submission(s): 2073Problem Description看病要排队这个是地球人都知道的常识。原创 2014-11-15 23:31:14 · 970 阅读 · 0 评论 -
Codeforces 137A-Postcards and photos（模拟+贪心）
A. Postcards and photostime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus has postcards and photos原创 2014-10-03 19:26:52 · 1054 阅读 · 0 评论 -
Codeforces 10A-Power Consumption Calculation(模拟)
A. Power Consumption Calculationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTom is interested in power原创 2014-09-29 13:11:47 · 1752 阅读 · 0 评论 -
HDU-1071 The area（积分）
The areaTime Limit: 1000ms Memory limit: 32768K 有疑问？点这里^_^题目描述Ignatius bought a land last week, but he didn't know the area of the land because the land is enclosed by a parabola and原创 2014-07-28 18:43:08 · 851 阅读 · 0 评论 -
HDU 4608 I-number（模拟）
I-numberTime Limit: 5000ms Memory limit: 65536K 有疑问？点这里^_^题目描述The I-number of x is defined to be an integer y, which satisfied the the conditions below:1. y>x;2. the sum of each原创 2014-07-20 16:21:24 · 939 阅读 · 0 评论 -
UVA 489-- Hangman Judge（暴力串处理）
Hangman Judge In ``Hangman Judge,'' you are to write a program that judges a series of Hangman games. For each game, the answer to the puzzle is given as well as the guesses. Rules are t原创 2014-08-09 18:52:16 · 905 阅读 · 0 评论 -
UVA 10010-- Where's Waldorf?（暴力串处理）
Where's Waldorf? Given a m by n grid of letters, ( ), and a list of words, find the location in the grid at which the word can be found. A word matches a straight, uninterrupted line o原创 2014-08-09 18:29:11 · 1155 阅读 · 0 评论 -
HDU 1035--Robot Motion（模拟）
Robot MotionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6422 Accepted Submission(s): 3015Problem DescriptionA robot h原创 2014-08-11 19:12:20 · 838 阅读 · 0 评论 -
POJ 1068--Parencodings--括号逆匹配（模拟）
ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19655 Accepted: 11870DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses.原创 2014-08-11 18:50:57 · 835 阅读 · 0 评论 -
UVA 465-- Overflow (atof 函数)
Overflow Write a program that reads an expression consisting of two non-negative integer and an operator. Determine if either integer or the result of the expression is too large to be rep原创 2014-08-09 19:21:49 · 976 阅读 · 0 评论 -
大数A-B
前几天敲了一个A+B,最近又敲了一个A-B，感觉加法原创 2014-06-18 23:13:08 · 778 阅读 · 0 评论 -
HDU 4288-Coder（模拟）
CoderTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3327 Accepted Submission(s): 1316Problem Description In mathematics a原创 2014-10-18 21:27:08 · 828 阅读 · 0 评论