![](https://img-blog.csdnimg.cn/20190918140129601.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
POJ
文章平均质量分 81
__KevinYzy__
github:https://github.com/KEVINYZY ----
leetcode:https://leetcode.com/seanadfgfeer/ ----
lintcode:https://www.lintcode.com/user/fire-blade ----
nowcoder:https://www.nowcoder.com/profile/1073818
展开
-
POJ 1032 Parliament
#include<iostream> #include<cstdio> using namespace std; typedef long long ll; int a[100], b[100]; int main() { int rs = 0, len = 0; for (int i = 2; rs <= 1010; i++) { a[len++] =...原创 2016-08-29 23:33:51 · 422 阅读 · 0 评论 -
POJ 1061 青蛙的约会
青蛙的约会 Time Limit:1000MS Memory Limit:10000K Total Submissions:112383 Accepted:22837 Description 两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前...原创 2017-03-16 23:51:59 · 306 阅读 · 0 评论 -
POJ 1067 取石子游戏
取石子游戏 Time Limit:1000MS Memory Limit:10000K Total Submissions:41118 Accepted:13885 Description 有两堆石子,数量任意,可以不同。游戏开始由两个人轮流取石子。游戏规定,每次有两种不同的取法,一是可以在任意的一堆中取走任意多的石子;二是可以在两堆中同时取走相...原创 2017-03-16 23:35:22 · 197 阅读 · 0 评论 -
POJ 1003 Hangover
Hangover Time Limit:1000MS Memory Limit:10000K Total Submissions:124089 Accepted:60545 Description How far can you make a stack of cards overhang a table? If you have one car...原创 2017-03-16 23:19:36 · 184 阅读 · 0 评论 -
POJ 1004 Financial Management
Financial Management Time Limit:1000MS Memory Limit:10000K Total Submissions:182547 Accepted:68942 Description Larry graduated this year and finally has a job. He's making a ...原创 2017-03-16 23:18:06 · 165 阅读 · 0 评论 -
POJ 1005 I Think I Need a Houseboat
I Think I Need a Houseboat Time Limit:1000MS Memory Limit:10000K Total Submissions:103102 Accepted:44852 Description Fred Mapper is considering pur...原创 2017-03-16 23:14:18 · 188 阅读 · 0 评论 -
POJ 1006 Biorhythms
Biorhythms Time Limit:1000MS Memory Limit:10000K Total Submissions:134855 Accepted:43085 Description Some people believe that there are three cycles in a person's life that s...原创 2017-03-16 23:09:37 · 210 阅读 · 0 评论 -
POJ 1007 DNA Sorting
DNA Sorting Time Limit:1000MS Memory Limit:10000K Total Submissions:100175 Accepted:40217 Description One measure of ``unsortedness'' in a sequence is the number of pairs of ...原创 2017-03-16 23:03:56 · 294 阅读 · 0 评论 -
POJ1008 Maya Calendar
Maya Calendar Time Limit:1000MS Memory Limit:10000K Total Submissions:77515 Accepted:23854 Description During his last sabbatical, professor M. A. Ya made a surprising discov...原创 2017-03-16 22:59:03 · 258 阅读 · 0 评论 -
POJ 1009 Edge Detection
Edge Detection Time Limit:1000MS Memory Limit:10000K Total Submissions:21636 Accepted:5080 Description IONU Satellite Imaging, Inc. records and stores very large images ...原创 2017-03-16 22:47:22 · 388 阅读 · 0 评论 -
POJ 1013 Counterfeit Dollar
Counterfeit Dollar Time Limit:1000MS Memory Limit:10000K Total Submissions:46293 Accepted:14644 Description Sally Jones has a dozen Voyageur silver dollars. However, only ele...原创 2017-03-16 22:45:26 · 196 阅读 · 0 评论 -
POJ1012 Joseph
Joseph Time Limit:1000MS Memory Limit:10000K Total Submissions:53977 Accepted:20601 Description The Joseph's problem is notoriously known. For those who are not familiar with...原创 2017-03-16 22:21:46 · 219 阅读 · 0 评论 -
POJ 1014 Dividing
Dividing Time Limit:1000MS Memory Limit:10000K Total Submissions:70443 Accepted:18386 Description Marsha and Bill own a collection of marbles. They want to split the collecti...原创 2017-03-16 21:50:20 · 296 阅读 · 0 评论 -
POJ 1028 Web Navigation
Web Navigation Time Limit:1000MS Memory Limit:10000K Total Submissions:34064 Accepted:15215 Description Standard web browsers contain features to move backward and forward am...原创 2017-03-16 21:46:43 · 283 阅读 · 0 评论 -
POJ 1028 Web Navigation
#include<iostream> #include<string> #include<stack> using namespace std; string s1, s2; stack<string> forw; stack<string> backw; int main() { backw.push(string("http...原创 2016-08-19 18:32:52 · 207 阅读 · 0 评论 -
POJ 1062 昂贵的聘礼
昂贵的聘礼 Time Limit:1000MS Memory Limit:10000K Total Submissions:48088 Accepted:14330 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金...原创 2017-03-16 23:53:07 · 209 阅读 · 0 评论