![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
POJ
文章平均质量分 83
Stone_____
这个作者很懒,什么都没留下…
展开
-
POJ-2503-Babelfish
BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 40265 Accepted: 17159DescriptionYou have just moved from Waterloo to a big city. The people her原创 2016-08-08 09:51:24 · 151 阅读 · 0 评论 -
POJ-3087-Shuffle'm Up
Shuffle'm UpTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9277 Accepted: 4256DescriptionA common pastime for poker players at a poker table is to shuf原创 2016-08-22 11:27:55 · 167 阅读 · 0 评论 -
POJ-2676-Sudoku
SudokuTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 17913 Accepted: 8674 Special JudgeDescriptionSudoku is a very simple task. A square table with原创 2016-08-22 11:32:33 · 147 阅读 · 0 评论 -
POJ-3009-Curling 2.0
Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17782 Accepted: 7315DescriptionOn Planet MM-21, after their Olympic games this year, curling(原创 2016-08-10 21:11:35 · 159 阅读 · 0 评论 -
POJ-2418-Hardwood Species
Hardwood SpeciesTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 23210 Accepted: 9032DescriptionHardwoods are the botanical group of trees that have bro原创 2016-08-10 21:15:38 · 179 阅读 · 0 评论 -
POJ-1442-Black Box
Black BoxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10302 Accepted: 4237DescriptionOur Black Box represents a primitive database. It can save an in原创 2016-08-10 21:22:24 · 250 阅读 · 0 评论 -
POJ-3274-Gold Balanced Lineup
Gold Balanced LineupTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14378 Accepted: 4165DescriptionFarmer John's N cows (1 ≤ N ≤ 100,000) share many sim原创 2016-08-10 21:35:37 · 432 阅读 · 0 评论 -
POJ-2513-Colored Sticks
Colored SticksTime Limit: 5000MS Memory Limit: 128000KTotal Submissions: 35039 Accepted: 9155DescriptionYou are given a bunch of wooden sticks. Each endpoint of e原创 2016-08-10 21:40:34 · 223 阅读 · 0 评论 -
POJ-2251-Dungeon Master
Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26176 Accepted: 10198DescriptionYou are trapped in a 3D dungeon and need to find the quick原创 2016-08-11 21:41:58 · 172 阅读 · 0 评论 -
POJ-3126-Prime Path
Prime PathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16991 Accepted: 9561DescriptionThe ministers of the cabinet were quite upset by the message fr原创 2016-08-22 11:24:39 · 334 阅读 · 0 评论 -
POJ-3252-Round Numbers
Round NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11850 Accepted: 4461DescriptionThe cows, as you know, have no fingers or thumbs and thus ar原创 2016-08-22 11:21:02 · 136 阅读 · 0 评论 -
POJ-3020-Antenna Placement
Language:DefaultAntenna PlacementTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8535 Accepted: 4231DescriptionThe Global Aerial Research Centre h原创 2016-08-08 09:56:21 · 328 阅读 · 0 评论 -
POJ-3041-Asteroids
AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20102 Accepted: 10901DescriptionBessie wants to navigate her spaceship through a dangerous aste原创 2016-08-08 10:02:18 · 200 阅读 · 0 评论 -
POJ-2442-Sequence
SequenceTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 8855 Accepted: 2937DescriptionGiven m sequences(序列), each contains n non-negative(非负的) integer(整原创 2016-08-08 21:37:33 · 225 阅读 · 0 评论 -
POJ-3253-Fence Repair
Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 39511 Accepted: 12864DescriptionFarmer John wants to repair a small length of the fence arou原创 2016-08-08 21:39:49 · 163 阅读 · 0 评论 -
POJ-2635-The Embarrassed Cryptographer
给出两个数, 第一个数是两个大素数的乘积, 第二个数是一个INT型的数, 问较小的那个素数(同余定理每三位取余(每四位取余WA, = =|| , 好魔性), 逐位取会TLE#include #include#includeusing namespace std;const int MAXN = 1000010;int prime[MAXN/3], cnt = 0;bool is原创 2016-08-22 11:00:01 · 192 阅读 · 0 评论 -
POJ-1019-Number Sequence
Number SequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37890 Accepted: 10952DescriptionA single positive integer i is given. Write a program to原创 2016-08-22 11:04:24 · 187 阅读 · 0 评论 -
POJ-3468-A Simple Problem with Integers
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 93547 Accepted: 29145Case Time Limit: 2000MSDescriptionYou have N i原创 2016-08-22 11:08:20 · 144 阅读 · 0 评论 -
POJ-3264-Balanced Lineup
Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 45845 Accepted: 21529Case Time Limit: 2000MSDescriptionFor the daily milking, Farme原创 2016-08-22 11:11:53 · 143 阅读 · 0 评论 -
POJ-1321-棋盘问题
棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 35179 Accepted: 17342Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求原创 2016-08-11 21:45:19 · 129 阅读 · 0 评论 -
POJ-3414-Pots
PotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14033 Accepted: 5908 Special JudgeDescriptionYou are given two pots, having the volume of A and原创 2016-08-11 21:51:37 · 166 阅读 · 0 评论 -
POJ-3292-Semi-prime H-numbers
Semi-prime H-numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8736 Accepted: 3825DescriptionThis problem is based on an exercise of David Hilbert,原创 2016-08-25 09:07:08 · 188 阅读 · 0 评论 -
Balanced Lineup
第一个手敲的线段树代码,以前一直用板子QAQDescriptionFor the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Fri原创 2016-11-26 20:35:07 · 173 阅读 · 0 评论 -
POJ-1724-ROADS
从 1 到 n 花费不超过 k 的最短路#include#include#include#include#include#include#include#include#includeusing namespace std;const int MAX = 100+10;const double eps = 1e-10;const double PI = acos(-1.原创 2017-02-06 20:37:28 · 182 阅读 · 0 评论 -
POJ-1054-The Troublesome Frog
暴力水 -_-||#include#include#include#include#include#include#include#include#includeusing namespace std;const int MAX = 5000+10;const double eps = 1e-10;const double PI = acos(-1.0);bool m原创 2017-02-07 21:17:35 · 236 阅读 · 0 评论 -
POJ-2528-Mayor's posters
线段树+离散化数组开大些#include#include#include#include#include#include#include#include#include#includeusing namespace std;const int MAX = 11111;int col[MAX*20], m[MAX*12], vis[MAX*12];int n, t,原创 2017-02-09 08:52:31 · 146 阅读 · 0 评论 -
POJ-2828-Buy Tickets
#include#include#include#include#include#include#include#include#include#includetypedef long long LL;#define rtl rt<<1#define rtr rt<<1|1using namespace std;const int MAXN = 200000+10;c原创 2017-02-10 14:15:57 · 219 阅读 · 0 评论 -
POJ-2777-Count Color
线段树,初始颜色为1,有两种操作:1.“C A B C”使板材从A到B着色C.2.“P A B”输出在A到B(包括)之间绘制的不同颜色的数量。用二进制存储,lazy数组#include #include #include #include #include #include #include #include #include #include #defin原创 2017-02-13 19:58:41 · 203 阅读 · 0 评论 -
POJ-3411-Paid Roads
dfs,用邻接表,有重边#include #include #include #include #include #include #include #include #include using namespace std;const double PI = acos(-1.0);const double eps = 1e-8;const int MAX = 1e1+原创 2017-01-26 22:40:55 · 222 阅读 · 0 评论 -
POJ-3186-Treats for the Cows
Treats for the CowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5496 Accepted: 2863DescriptionFJ has purchased N (1 The treats are interesting原创 2017-01-23 15:26:59 · 266 阅读 · 0 评论 -
POJ-3071-Football
FootballTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4963 Accepted: 2522DescriptionConsider a single-elimination football tournament involving 2n t原创 2016-09-26 19:51:48 · 238 阅读 · 0 评论 -
TO THE MAX
DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectan原创 2016-09-21 19:05:22 · 247 阅读 · 0 评论 -
POJ-1039-Pipe
PipeTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10234 Accepted: 3161DescriptionThe GX Light Pipeline(管道) Company started to prepare bent pipes for t原创 2016-08-25 09:17:33 · 326 阅读 · 0 评论 -
POJ-1080-Human Gene Functions
Human Gene FunctionsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18886 Accepted: 10518DescriptionIt is well known that a human gene can be considered原创 2016-08-25 09:33:39 · 173 阅读 · 0 评论 -
POJ-1113-Wall
WallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 34862 Accepted: 11885DescriptionOnce upon a time there was a greedy King who ordered his chief Archi原创 2016-08-25 09:42:17 · 241 阅读 · 0 评论 -
POJ-2187-Beauty Contest
Beauty ContestTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 34373 Accepted: 10640DescriptionBessie, Farmer John's prize cow, has just won first place原创 2016-08-25 09:45:22 · 224 阅读 · 0 评论 -
POJ-1129-Channel Allocation
Channel AllocationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14553 Accepted: 7405DescriptionWhen a radio station is broadcasting over a very large原创 2016-08-25 09:55:51 · 216 阅读 · 0 评论 -
POJ-1159-Palindrome
PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 60866 Accepted: 21226DescriptionA palindrome is a symmetrical string, that is, a string read i原创 2016-08-25 09:59:44 · 298 阅读 · 0 评论 -
POJ-3273-Monthly Expense
Monthly ExpenseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22175 Accepted: 8681DescriptionFarmer John is an astounding(令人震惊的) accounting wizard(男巫)原创 2016-08-25 10:03:26 · 233 阅读 · 0 评论 -
POJ-3258-River Hopscotch
River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11382 Accepted: 4882DescriptionEvery year the cows hold an event featuring a peculiar ver原创 2016-08-25 10:08:52 · 347 阅读 · 0 评论