![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
模拟
文章平均质量分 85
CODE_BALL
SDUT 计院学生一球
展开
-
POJ模拟——Parencodings
ParencodingsCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionLet S = s1 s2...s2n be a原创 2014-03-27 20:26:50 · 509 阅读 · 0 评论 -
棋盘模拟——Emag eht htiw Em Pleh
Emag eht htiw Em PlehCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionThis problem is原创 2014-03-29 23:06:27 · 523 阅读 · 0 评论 -
模拟——Help Me with the Game
Help Me with the GameCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice POJ 2996 Descript原创 2014-04-01 19:08:35 · 524 阅读 · 0 评论 -
Emag eht htiw Em Pleh
Emag eht htiw Em PlehCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice POJ 2993 Descript原创 2014-04-01 19:12:15 · 667 阅读 · 0 评论 -
模拟,括号匹配——Parentheses Balance
Parentheses BalanceTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription You are given a string consisting of parentheses () and [].原创 2014-04-01 20:47:26 · 553 阅读 · 0 评论 -
POJ(模拟)——Robot Motion
Robot MotionCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionA robot has been p原创 2014-03-25 17:55:45 · 552 阅读 · 0 评论 -
模拟——Parencodings
ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19185 Accepted: 11570DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses.原创 2014-06-15 20:59:36 · 532 阅读 · 0 评论 -
模拟——Crashing Robots
Crashing RobotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7471 Accepted: 3266DescriptionIn a modernized warehouse, robots are used to fetch the goo原创 2014-06-16 11:23:05 · 455 阅读 · 0 评论 -
The Great Pan——模拟
zhe'shi'yi#include #include #include #includeusing namespace std;char a[2123456];int main(){ long long i,j,k,n,u,m,t; int f1,f2; while(scanf(" %I64d ",&n)!=EOF) { m原创 2014-07-31 00:01:14 · 634 阅读 · 0 评论