![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
枚举
Detective-Conan
且随疾风前行 身后亦须留心
展开
-
poj 3080 Blue Jeans
Blue JeansTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16354 Accepted: 7260DescriptionThe Genographic Project is a research partnership between IBM a原创 2016-08-02 16:52:17 · 270 阅读 · 0 评论 -
poj 1936 All in All
All in AllTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 31802 Accepted: 13204DescriptionYou have devised a new encryption technique which encodes a me原创 2016-08-02 17:23:50 · 278 阅读 · 0 评论 -
poj 1035 Spell checker
Spell checkerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 24383 Accepted: 8892DescriptionYou, as a member of a development team for a new spell check原创 2016-08-02 13:24:52 · 521 阅读 · 0 评论 -
poj 3096 Surprising Strings
Surprising StringsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6723 Accepted: 4386DescriptionThe D-pairs of a string of letters are the ordered pairs原创 2016-08-22 15:03:34 · 237 阅读 · 0 评论 -
poj 1054 The Troublesome Frog
The Troublesome FrogTime Limit: 5000MS Memory Limit: 100000KTotal Submissions: 12062 Accepted: 3632Case Time Limit: 500MSDescriptionIn Korea, the naughtines原创 2017-01-16 16:53:52 · 278 阅读 · 0 评论 -
2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 E.Half-consecutive Numbers
题意:已知数列t_i=i*(i+1)/2,给出一个n。求一个i,i要大于等于n且保证t_i的值为平方数。思路:打表,我们首先知道有些连续的数答案是一样的,比如:n=1,ans=1n=2,ans=8n=3,ans=8......那么我们可以直接去找出这些ans,打表后可知这些数一共有22个。打表技巧:t_i为平方数的条件:当i或(i+1)中,那个奇数它本身就是原创 2017-09-09 18:43:59 · 722 阅读 · 1 评论