POJ
文章平均质量分 76
皮科克
这个作者很懒,什么都没留下…
展开
-
POJ 1502 MPI Maelstrom【最短路】
题目来戳呀DescriptionBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee’原创 2017-03-17 21:39:12 · 230 阅读 · 0 评论 -
POJ 1182 食物链【并查集】
题目来戳呀Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种。 有人用两种说法对这N个动物所构成的食物链关系进行描述: 第一种说法是”1 X Y”,表示X和Y是同类。 第二种说法是”2 X Y”,表示X吃Y。 此人对N个动物原创 2017-03-10 20:36:57 · 220 阅读 · 0 评论 -
POJ 1703 Find them, Catch them【并查集】
题目来戳呀DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to i原创 2017-03-10 21:09:37 · 216 阅读 · 0 评论 -
POJ 1284 Primitive Roots【欧拉函数】
题目来戳呀DescriptionWe say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (xi mod p) | 1 <= i <= p-1 } is equal to { 1, ..., p-1 }. For example, the...原创 2017-03-22 21:29:22 · 291 阅读 · 0 评论 -
POJ 1811 Prime Test【素数判定与大数分解】
题目来戳呀DescriptionGiven a big integer number, you are required to find out whether it’s a prime number.InputThe first line contains the number of test cases T (1 <= T <= 20 ), then the following T lines原创 2017-03-29 16:45:14 · 527 阅读 · 0 评论 -
POJ 1276 Cash Machine 【多重背包】
题目来戳呀DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominat原创 2017-03-12 13:36:08 · 212 阅读 · 0 评论 -
POJ 2387 Til the Cows Come Home【最短路】
题目来戳呀DescriptionBessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she原创 2017-03-16 16:43:22 · 242 阅读 · 0 评论 -
POJ 2976 Dropping tests【分数规划】【二分搜索】
题目来戳呀#include#include#include#includeusing namespace std;double a[1100],b[1100],f[1100];;const double acc=1e-7;int main(){ int n,k; double mid,ans; while(~scanf("%d%d",&n,&k))原创 2017-08-16 17:30:22 · 209 阅读 · 0 评论