
POJ
ZJU_warren
水,是人体重要组成部分。
展开
-
POJ 1988 Cube Stacking 带权并查集
Cube StackingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 23568 Accepted: 8258Case Time Limit: 1000MSDescriptionFarmer John and Betsy are playing a game with N (1 <= N <=原创 2016-07-25 22:53:57 · 462 阅读 · 0 评论 -
PKU 1182 食物链 种群并查集
食物链Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 8 Accepted Submission(s) : 2Problem Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃原创 2016-07-25 22:56:15 · 448 阅读 · 0 评论 -
POJ 1703 Find them, Catch them 种群并查集
Find them, Catch themTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem DescriptionThe police office in Tadu C原创 2016-07-25 22:56:45 · 417 阅读 · 0 评论 -
POJ2492 A Bug's Life 种群并查集
A Bug's LifeTime Limit : 15000/5000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem DescriptionBackground Professor Hopper is res原创 2016-07-25 22:57:22 · 463 阅读 · 0 评论 -
3984 迷宫问题 BFS入门题+记录路径
迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14106 Accepted: 8415Description定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1,原创 2016-06-23 19:38:27 · 408 阅读 · 0 评论 -
1061 青蛙的约会 扩展欧几里得式 入门题
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 103422 Accepted: 20106Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要的事情,原创 2016-06-23 19:38:56 · 392 阅读 · 0 评论 -
3278 Catch That Cow BFS入门题
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 70410 Accepted: 22143DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catc原创 2016-06-23 19:39:41 · 512 阅读 · 0 评论 -
1775 Sum of Factorials 全排列解法+规律解法
Sum of FactorialsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13391 Accepted: 4430DescriptionJohn von Neumann, b. Dec. 28, 1903, d. Feb. 8, 1957, was a Hungarian-American m原创 2016-06-23 19:40:21 · 456 阅读 · 0 评论 -
POJ 2104 划分树
K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 49923 Accepted: 16939Case Time Limit: 2000MSDescriptionYou are working for Macrohard company in data structures depa原创 2016-09-11 16:31:23 · 392 阅读 · 0 评论