algorithm_模拟
文章平均质量分 78
theArcticOcean
Website: https://www.weiy.city
Wechat Subscription Account: 胡桃小院
展开
-
poj 1068 Parencodings(模拟)
题目:http://poj.org/problem?id=1068ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23127 Accepted: 13551DescriptionLet S = s1 s2...s2n原创 2015-08-27 19:03:15 · 657 阅读 · 0 评论 -
模拟问题之密码学
许多信息加密过程有着复杂的数学原理,但是一些简单的密码问题通过模拟即可解决。POJ 3749 破译密码http://poj.org/problem?id=3749模运算模拟即可#include #include #include using namespace std;char str[205],s[20];int main(){原创 2016-02-13 18:02:05 · 1008 阅读 · 0 评论 -
codeforces 404 B. Marathon、C. Restore Graph、D. Minesweeper 1D
http://codeforces.com/problemset/problem/404/bB. Marathon思路简单,但对于精度处理注意几点:1.控制输出0 -- 0.02.巧妙应用浮点数取模函数:s1=fmod(s1,4*a);每次加上就取模减小,不能让数字增大,累计误差。#include #include #include using name原创 2015-11-25 11:59:03 · 704 阅读 · 0 评论 -
hdu 1237 简单计算器(数组模拟栈,队列)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1237简单计算器Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15248 Accepted Submission(s): 5原创 2015-09-06 10:01:52 · 735 阅读 · 0 评论 -
poj 1028 Web Navigation(模拟)
题目:http://poj.org/problem?id=1028Web NavigationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31299 Accepted: 14032DescriptionStandard web browse原创 2015-09-07 20:24:37 · 659 阅读 · 0 评论 -
hdu 1022 Train Problem I (栈的应用)
题意:火车进站问题,判断出栈的顺序。仅仅是栈的简单应用,熟练掌握即可。#include #include#include#includeusing namespace std;stack sta;bool judge=true;int n,cnt,in[10],out[10],p,order[20];void sempty(){ while(!sta.e原创 2015-05-31 23:45:40 · 535 阅读 · 0 评论 -
hdu 5444 Elven Postman(模拟)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=5444Elven PostmanTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 104 Accepted Submis原创 2015-09-13 19:39:39 · 976 阅读 · 0 评论 -
poj 1676 What time is it?(经典模拟)
题目:http://poj.org/problem?id=1676What time is it?Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1483 Accepted: 578DescriptionAn accutron shows ti原创 2015-09-09 21:42:14 · 1649 阅读 · 0 评论 -
hdu 1013 Digital Roots(模拟 || 数论)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1013Digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 59645 Accepted Submissi原创 2015-09-03 17:17:44 · 624 阅读 · 0 评论 -
hdu 4038 Stone(贪心模拟)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=4038StoneTime Limit: 3000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 2535 Accepted Submission(s): 63原创 2015-09-02 22:56:11 · 593 阅读 · 0 评论 -
poj 3278 Catch That Cow(经典bfs)
题目:http://poj.org/problem?id=3278Language:DefaultCatch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 62063 Accepted: 19415Descri原创 2015-08-30 20:13:44 · 631 阅读 · 0 评论 -
poj 1102 LC-Display(模拟)
题目:http://poj.org/problem?id=1102LC-DisplayTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15752 Accepted: 6291DescriptionA friend of you has ju原创 2015-08-29 21:10:55 · 842 阅读 · 0 评论 -
codeforce 492D. Vanya and Computer Game(数学模拟)
题目:http://codeforces.com/problemset/problem/492/D大意是这样的:两个同时玩游戏,每个人的能力不一样,一秒钟造成的攻击数不同,游戏中有n个怪物,怪物有各自的”血量“(能承受的最大攻击数),问对于每个怪物最后是被谁送上致命一击的?原创 2015-06-28 22:19:51 · 706 阅读 · 0 评论 -
hdu 5018 Revenge of Fibonacci(模拟)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=5018Revenge of FibonacciTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 940 Accepted S原创 2015-08-16 21:06:18 · 446 阅读 · 0 评论 -
poj 1699 Best Sequence(dfs+A(n,n))
题目:http://poj.org/problem?id=1699Best SequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5467 Accepted: 2146DescriptionThe twenty-first cen原创 2015-08-12 20:31:07 · 696 阅读 · 0 评论 -
algorithm 题集四 (16.06.10)
继2016.05.24续:codeforces 651B. Beautiful Paintings-简单http://codeforces.com/problemset/problem/651/B 大意:给出一个序列,求解其任意排列中满足ai + 1 > ai 的元素个数最大和。 分析:理想情况下,无重复元素的0从小到大的排列,满足条件的元素个数最多,是n-1. 非理想情况下还有重复元素,原创 2016-06-10 10:35:47 · 2712 阅读 · 0 评论