随笔分类 -  模拟

POJ 2092 Grandpa is Famous【水---找出现第二多的数】
摘要：链接：http://poj.org/problem?id=2092http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27454#problem/DGrandpa is FamousTime Limit:2000MSMemory Limit:30000KTotal Submissions:7210Accepted:3650DescriptionThe whole family was excited by the news. Everyone knew grandpa had been an extremely good bridge p 阅读全文
posted @ 2013-07-29 14:10 free斩 阅读(270) 评论(0) 推荐(0)
POJ 2993 Emag eht htiw Em Pleh【模拟画棋盘】
摘要：链接：http://poj.org/problem?id=2993http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27454#problem/CEmag eht htiw Em PlehTime Limit:1000MSMemory Limit:65536KTotal Submissions:2280Accepted:1531DescriptionThis problem is a reverse case of theproblem 2996. You are given the output of the problem H an 阅读全文
posted @ 2013-07-29 12:05 free斩 阅读(297) 评论(0) 推荐(0)
POJ 1068 Parencodings【水模拟--数括号】
摘要：链接：http://poj.org/problem?id=1068http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27454#problem/BParencodingsTime Limit:1000MSMemory Limit:10000KTotal Submissions:17044Accepted:10199DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways:q B 阅读全文
posted @ 2013-07-29 09:07 free斩 阅读(284) 评论(0) 推荐(0)
hdu 4068 I-number【大数】
摘要：题目：http://acm.hdu.edu.cn/showproblem.php?pid=4608http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27048#problem/G2013暑期多校联合训练——80+高校，300+队伍，10000元奖金，敬请期待~I-numberTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1006Accepted Submission(s): 398P 阅读全文
posted @ 2013-07-24 16:52 free斩 阅读(152) 评论(0) 推荐(0)
hdu 4414 Finding crosses【简单模拟】
摘要：题目：http://acm.hdu.edu.cn/showproblem.php?pid=4414CSUST:点击打开链接Finding crossesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 729Accepted Submission(s): 411Problem DescriptionThe Nazca Lines are a series of ancient geoglyphs located in the Nazca Dese 阅读全文
posted @ 2013-07-17 21:16 free斩 阅读(204) 评论(0) 推荐(0)
POJ 3278 Catch That Cow （bfs+队列）
摘要：原题链接：http://poj.org/problem?id=3278算法：bfs+队列+STL（C++）PS：bfs入门题目，好高兴啊，终于会用bfs了。Catch That CowTime Limit:2000MSMemory Limit:65536KTotal Submissions:32679Accepted:10060DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 阅读全文
posted @ 2012-11-10 00:52 free斩 阅读(217) 评论(0) 推荐(0)
POJ 3278 Catch That Cow 【bfs+队列】
摘要：原题链接：http://poj.org/problem?id=3278算法：bfs+队列+STL（C++）PS：bfs入门题目，好高兴啊，终于会用bfs了。Catch That CowTime Limit:2000MSMemory Limit:65536KTotal Submissions:32679Accepted:10060DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 阅读全文
posted @ 2012-11-10 00:52 free斩 阅读(213) 评论(0) 推荐(0)
POJ 3125 Printer Queue（打印队列）
摘要：题目链接： http://poj.org/problem?id=31252012年8月7日，暑假组队后个人训练赛第一场Printer QueueTime Limit:1000MSMemory Limit:65536KTotal Submissions:3082Accepted:1655DescriptionThe only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs in th 阅读全文
posted @ 2012-08-14 16:47 free斩 阅读(549) 评论(0) 推荐(0)
POJ 3125 Printer Queue【打印队列】
摘要：经典的模拟队列题目题目链接： http://poj.org/problem?id=31252012年8月7日，暑假组队后个人训练赛第一场Printer QueueTime Limit:1000MSMemory Limit:65536KTotal Submissions:3082Accepted:1655DescriptionThe only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred j 阅读全文
posted @ 2012-08-14 16:47 free斩 阅读(208) 评论(0) 推荐(0)
POJ 3125 Printer Queue【简单模拟a打印队列】
摘要：经典的模拟队列题目题目链接： http://poj.org/problem?id=31252012年8月7日，暑假组队后个人训练赛第一场Printer QueueTime Limit:1000MSMemory Limit:65536KTotal Submissions:3082Accepted:1655DescriptionThe only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred j 阅读全文
posted @ 2012-08-14 16:47 free斩 阅读(234) 评论(0) 推荐(0)
POJ 1573 && hdu 1035 Robot Motion（简单模拟）
摘要：题目链接：http://poj.org/problem?id=1573 http://acm.hdu.edu.cn/showproblem.php?pid=1035Robot MotionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3893Accepted Submission(s): 1817Problem DescriptionA robot has been programmed to follow the instr... 阅读全文
posted @ 2012-08-14 16:10 free斩 阅读(191) 评论(0) 推荐(0)
POJ 1573 && hdu 1035 Robot Motion【简单模拟】
摘要：题目链接：http://poj.org/problem?id=1573 http://acm.hdu.edu.cn/showproblem.php?pid=1035Robot MotionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3893Accepted Submission(s): 1817Problem DescriptionA robot has been programmed to follow the instr... 阅读全文
posted @ 2012-08-14 16:10 free斩 阅读(133) 评论(0) 推荐(0)
大数相乘
摘要：根据大数相加，写出的简单的大数相乘的模板，有待改进中~~~~~~#include<stdio.h>#include<string.h>const int N = 100;int main(){ int i,j,k; int d1,d2; int a[N]={0},b[N]={0},sum[2*N]={0}; char c[N];// memset(c,'0',sizeof(c));// memset(a,0,sizeof(a));// memset(b,0,sizeof(b));// memset(sum,0,sizeof(sum));// ... 阅读全文
posted @ 2012-08-14 16:04 free斩 阅读(186) 评论(0) 推荐(0)
大数相加
摘要：原作者已经找不到了，但是我是从CSUST的博客栏中看到的，一个很好的模板。我看到的文章来源（不是原出处）：http://blog.csdn.net/csust_acm/article/details/7268029//大数相加#include <stdio.h>#include<string.h>int main(){ int i,d,j,d1; char a[100];int b[101]={0};int c[100]={0}; // memset(b,0,sizeof(b)); // memset(c,0,sizeof(c)); scanf("%s&quo 阅读全文
posted @ 2012-08-14 16:03 free斩 阅读(189) 评论(0) 推荐(0)
POJ 1573 && hdu 1035（简单模拟）
摘要：POJ 1573 && hdu 1035(简单模拟)感谢kb神题目链接：http://poj.org/problem?id=1573 http://acm.hdu.edu.cn/showproblem.php?pid=1035Robot MotionTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 7893Accepted: 3813DescriptionA robot has been programmed to follow the instructions in its path. Instructions 阅读全文
posted @ 2012-08-13 15:16 free斩 阅读(181) 评论(0) 推荐(0)