poj
defense881
Noting is impossiable!Believe in yourself!
展开
-
poj 3696 The Luckiest number (数论-快速幂+欧拉定理)
The Luckiest numberTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4894 Accepted: 1318DescriptionChinese people think of '8' as the lucky digit. Bob als原创 2016-04-01 19:26:42 · 769 阅读 · 0 评论 -
poj 3368(RMQ)Frequent values
Frequent values点击打开题目链接Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13414 Accepted: 4936DescriptionYou are given a sequence of n integers a1 , a2原创 2014-09-26 09:42:54 · 718 阅读 · 0 评论 -
poj 1861 Network(最小生成树)
NetworkTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13680 Accepted: 5310 Special JudgeDescriptionAndrew is working as system administrator and原创 2014-09-01 21:11:35 · 515 阅读 · 0 评论 -
poj 3122&&hdu1969 Pie(二分)
#include #include #include #include #define N 10010#define pi acos(-1)using namespace std;int a[N];double v[N];int main(){ int t,n,f,i; while(~scanf("%d",&t)) {原创 2014-09-22 19:18:26 · 629 阅读 · 0 评论 -
poj 2240 Arbitrage(最短路径)
Arbitrage点击打开题目链接Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15931 Accepted: 6706DescriptionArbitrage is the use of discrepancies in currency exch原创 2014-09-11 15:02:53 · 791 阅读 · 0 评论 -
poj 2709 Painter(贪心)
PainterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3186 Accepted: 1983DescriptionThe local toy store sells small fingerpainting kits with between thre原创 2014-09-22 21:03:09 · 667 阅读 · 0 评论 -
poj 1258 Agri-Net(最小生成树 prime算法)
Agri-Nethttp://poj.org/problem?id=1258Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 40013 Accepted: 16283DescriptionFarmer John has been elected may原创 2014-08-11 16:10:35 · 734 阅读 · 0 评论 -
poj 2421 Constructing Roads(最小生成树 kruskal算法)
Constructing RoadsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19457 Accepted: 8103DescriptionThere are N villages, which are numbered from 1 to N,原创 2014-08-11 14:23:41 · 761 阅读 · 0 评论 -
poj 1308 &&HDU 1325 Is It A Tree?(并查集、树的定义)
Is It A Tree?Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21912 Accepted: 7483DescriptionA tree is a well-known data structure that is either empty原创 2014-08-12 11:17:34 · 765 阅读 · 0 评论 -
poj 2942&&uva 3523 Knights of the Round Table(图的连通性)
Knights of the Round TableTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 9663 Accepted: 3129DescriptionBeing a knight is a very attractive career: search原创 2014-08-10 18:42:47 · 870 阅读 · 0 评论 -
poj 1789Truck History(最小生成树 prime)
Truck History点击打开题目链接Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18736 Accepted: 7234DescriptionAdvanced Cargo Movement, Ltd. uses trucks of diffe原创 2014-09-03 13:30:57 · 531 阅读 · 0 评论 -
poj 1325 Machine Schedule(二分图的最小点覆盖)
Machine ScheduleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12035 Accepted: 5129DescriptionAs we all know, machine scheduling is a very clas原创 2014-11-09 00:35:03 · 788 阅读 · 0 评论 -
poj 2689
Language:Prime Distance点击打开题目链接Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14583 Accepted: 3880DescriptionThe branch of mathematics called numbe原创 2015-09-29 17:37:50 · 578 阅读 · 0 评论 -
poj 1328 Radar Installation(贪心)
Radar Installation点击打开题目链接Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 55857 Accepted: 12596DescriptionAssume the coasting is an infinite strai原创 2015-01-22 22:21:36 · 460 阅读 · 0 评论 -
poj 1026 Cipher(置换群循环节)
Cipher点击打开题目链接Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19570 Accepted: 5260DescriptionBob and Alice started to use a brand-new encoding scheme.原创 2014-12-01 12:14:31 · 828 阅读 · 0 评论 -
poj 1845 Sumdiv(所有约数的和)
SumdivTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 14756 Accepted: 3631DescriptionConsider two natural numbers A and B. Let S be the sum of all natural原创 2014-11-20 17:05:59 · 1085 阅读 · 0 评论 -
poj 1422&&HDU 1151 Air Raid(最小路径覆盖)
Air Raid点击打开题目链接Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6781 Accepted: 4045DescriptionConsider a town where all the streets are one-way an原创 2014-11-01 15:44:21 · 646 阅读 · 0 评论 -
poj 1469 COURSES(判断是否是存在不匹配的点(对于右边的点集来说))
COURSESTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17858 Accepted: 7038DescriptionConsider a group of N students and P courses. Each student v原创 2014-11-01 13:15:35 · 644 阅读 · 0 评论 -
poj 3254 Corn Fields(状态DP初探)
Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8138 Accepted: 4339DescriptionFarmer John has purchased a lush new rectangular pasture co原创 2014-10-14 19:50:56 · 646 阅读 · 0 评论 -
poj 3373(记忆化搜索)
Changing Digits点击打开题目链接Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 2976 Accepted: 962DescriptionGiven two positive integers n and k, you are asked to generate a new integ原创 2014-10-02 17:52:50 · 703 阅读 · 0 评论 -
poj 1459 Power Network(最大流)
Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 23459 Accepted: 12284DescriptionA power network consists of nodes (power stations, consum原创 2014-11-09 00:11:29 · 741 阅读 · 0 评论 -
poj 2255 Tree Recovery(二叉树的遍历)
Tree Recovery点击打开题目链接Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11333 Accepted: 7107DescriptionLittle Valentine liked playing with binary trees v原创 2014-08-01 11:04:43 · 641 阅读 · 0 评论 -
poj 1270&& uva 124 Following Orders(拓扑排序、DFS)
Following Orders点击打开题目链接Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3756 Accepted: 1483DescriptionOrder is an important concept in mathematics and原创 2014-08-06 20:01:39 · 1116 阅读 · 0 评论 -
poj 1363 Rails(栈)
RailsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24568 Accepted: 9628DescriptionThere is a famous railway station in PopPush City. Country there is in原创 2014-07-24 19:03:28 · 621 阅读 · 0 评论 -
Ultra-QuickSort(归并排序记录逆序数)
Ultra-QuickSort点击打开题目链接Time Limit: 7000MS Memory Limit: 65536KTotal Submissions: 39951 Accepted: 14413DescriptionIn this problem, you have to analyze a particul原创 2014-07-21 20:13:32 · 699 阅读 · 0 评论 -
poj 2503 Babelfish(广义索引类线性表:快排+二分)
BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 31543 Accepted: 13583DescriptionYou have just moved from Waterloo to a big city. The people h原创 2014-07-20 15:58:22 · 707 阅读 · 0 评论 -
poj 3080 Blue Jeans(最长公共子串)
Blue JeansTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11758 Accepted: 5077DescriptionThe Genographic Project is a research partnership between IBM原创 2014-07-18 10:21:27 · 662 阅读 · 0 评论 -
poj 3461 Oulipo(KMP 字符串匹配算法)
Oulipo点击打开题目链接Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22354 Accepted: 8922DescriptionThe French author Georges Perec (1936–1982) once wrote原创 2014-07-18 18:21:01 · 699 阅读 · 0 评论 -
poj 1060 Modular multiplication of polynomials
Modular multiplication of polynomialsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4032 Accepted: 1842DescriptionConsider polynomials whose coeffici原创 2014-07-17 17:53:22 · 964 阅读 · 0 评论 -
poj 1504 Adding Reversed Numbers(简单字符串的处理)
Adding Reversed NumbersTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionThe Antique Comedians of Malidinesia prefer comedies to tragedies.原创 2014-07-16 17:03:44 · 768 阅读 · 0 评论 -
poj 1281 MANAGER(简单模拟题)
MANAGERTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2504 Accepted: 899DescriptionOne of the programming paradigm in parallel processing is the prod原创 2014-07-16 20:24:42 · 1432 阅读 · 0 评论 -
poj 2080 Calendar
A - CalendarTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionA calendar is a system for measuring time, from hours and minutes, to原创 2014-07-16 16:00:36 · 614 阅读 · 0 评论 -
poj 1330 Nearest Common Ancestors(简单的树初探)
Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17568 Accepted: 9304DescriptionA rooted tree is a well-known data structure in原创 2014-07-24 19:10:43 · 677 阅读 · 0 评论 -
poj 2499 Binary Tree(水题)
Binary TreeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6023 Accepted: 2794DescriptionBackgroundBinary trees are a common data structure in computer原创 2014-07-31 20:26:40 · 788 阅读 · 0 评论 -
poj 1094Sorting It All Out(拓扑排序)
Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27599 Accepted: 9557DescriptionAn ascending sorted sequence of distinct values is on原创 2014-08-07 14:08:36 · 715 阅读 · 0 评论 -
poj 2309 BST(水)
BST点击打开题目链接Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8546 Accepted: 5185DescriptionConsider an infinite full binary search tree (see the figure原创 2014-08-01 14:55:52 · 569 阅读 · 0 评论 -
poj 3349 Snowflake Snow Snowflakes(hash表)
SnowflakeSnowSnowflakesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 30772 Accepted: 8120DescriptionYou may have heard that no two snowflakes are原创 2014-07-30 16:27:27 · 844 阅读 · 0 评论 -
poj 1470 Closest Common Ancestors(简单的LCA算法)
Closest Common AncestorsTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 15120 Accepted: 4817DescriptionWrite a program that takes as input a rooted tr原创 2014-07-30 20:37:12 · 1414 阅读 · 0 评论 -
poj 1611The Suspects(简单的并查集求集合元素)
The Suspects点击打开题目链接Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 22109 Accepted: 10746DescriptionSevere acute respiratory syndrome (SARS), an atypi原创 2014-07-30 17:05:56 · 587 阅读 · 0 评论 -
poj 3253 Fence Repair(哈夫曼树)
Fence Repair点击打开题目链接Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 26151 Accepted: 8450DescriptionFarmer John wants to repair a small length of the原创 2014-08-05 09:38:07 · 560 阅读 · 0 评论