![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
模拟
L-75
这个作者很懒,什么都没留下…
展开
-
poj 1068 (Parencodings)
ParencodingsTime Limit: 1000MS Memory Limit: 10000KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionLet S = s1 s2...s2n be a well-formed string of parenthe原创 2016-10-15 10:34:30 · 454 阅读 · 0 评论 -
poj 2632 Crashing Robots (模拟题)
Crashing RobotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10286 Accepted: 4362DescriptionIn a modernized warehouse, robots are used to fetch the原创 2016-10-16 11:16:43 · 357 阅读 · 0 评论 -
poj 1573 Robot Motion (模拟题)
Robot MotionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13100 Accepted: 6349DescriptionA robot has been programmed to follow the instructions原创 2016-10-16 13:00:52 · 418 阅读 · 0 评论 -
poj 1013 Counterfeit Dollar(模拟题)
Counterfeit DollarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 45332 Accepted: 14324DescriptionSally Jones has a dozen Voyageur silver dollars. How原创 2016-11-12 17:06:26 · 624 阅读 · 0 评论 -
poj 1316 Self Numbers(水)
Self NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23405 Accepted: 13142DescriptionIn 1949 the Indian mathematician D.R. Kaprekar discovered原创 2016-11-12 17:15:44 · 491 阅读 · 0 评论 -
poj 1008 Maya Calendar
Maya CalendarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 76933 Accepted: 23686DescriptionDuring his last sabbatical, professor M. A. Ya made a sur原创 2017-02-01 00:20:48 · 463 阅读 · 0 评论 -
蓝桥杯第五届C/C++A组第四题 史丰收速算
标题:史丰收速算史丰收速算法的革命性贡献是:从高位算起,预测进位。不需要九九表,彻底颠覆了传统手算!速算的核心基础是:1位数乘以多位数的乘法。其中,乘以7是最复杂的,就以它为例。因为,1/7 是个循环小数:0.142857...,如果多位数超过 142857...,就要进1同理,2/7, 3/7, ... 6/7 也都是类似的循环小数,多位数超过 n/7,就要进n下面的程序模拟了史丰收速算法中乘以7原创 2017-04-07 20:43:18 · 323 阅读 · 0 评论