poj
abns
这个作者很懒,什么都没留下…
展开
-
poj1006
转载请注明出处:優YoU http://user.qzone.qq.com/289065406/blog/1309411846中国剩余定理韩信点兵 3路躲2 5纵多3 7纵多2射人数为n n%3=2; n%5=3; n%7=2;中国剩余定理 5*7*x1%3=1; 3*7*x2%5=1; 3*5*x3%7=1; ...转载 2018-04-18 00:08:20 · 182 阅读 · 0 评论 -
poj 3061 Subsequence
A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length o...原创 2018-08-15 16:49:18 · 101 阅读 · 0 评论 -
POJ 3258 River Hopscotch
Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a ro...原创 2018-08-15 17:41:27 · 89 阅读 · 0 评论 -
POj 3070 Fibonacci (模板)
https://vjudge.net/contest/244788#problem/DIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, ...原创 2018-08-08 15:31:29 · 99 阅读 · 0 评论 -
poj 2406 Power Strings
Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-...原创 2018-08-13 15:13:34 · 121 阅读 · 0 评论 -
POJ 2387 Til the Cows Come Home(dijkstra)
Bessie 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 wants to get b...原创 2018-08-19 10:37:26 · 108 阅读 · 0 评论 -
POJ 1287 Networking (Kruskal)
Bessie 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 wants to get b...原创 2018-08-19 10:40:46 · 188 阅读 · 0 评论 -
POJ 3281 Dining
对顶楼表示膜拜老实说,要到几岁才开始不相信圣诞老人的存在……这类无聊的话题对我而言,根本不痛不痒的。不过,讲到我从几岁起开始不相信圣诞老人就是那个穿着红衣服的老公公时,我能确定地说,我根本打从一开始就不相信。 我知道幼稚园圣诞节庆祝会时出现的圣诞老人是假的,回溯记忆,还能记起周围的幼稚园小朋友都一脸不信任地望着假扮圣诞老人的园长老师。 即使没有撞见老妈正在亲吻圣诞老公公,机灵的...原创 2018-08-17 17:58:49 · 130 阅读 · 0 评论 -
Til the Cows Come Home(dijkstra()堆优化)
#include<iostream>#include<queue>#include<vector>#define maxn 1005#define inf 0x3f3f3f3fusing namespace std;struct edge { int to;//下一个点 int w;//权值};vector<edge>G[max...原创 2018-12-17 17:48:37 · 319 阅读 · 3 评论 -
Invitation Cards poj 1511
Invitation CardsTime Limit: 8000MS Memory Limit: 262144K Total Submissions: 34113 Accepted: 11314 DescriptionIn the age of television, not many people attend theater performanc...转载 2018-12-17 18:54:37 · 119 阅读 · 0 评论 -
poj1556(计算几何+最短路)
#include<iostream>#include<cstdio>#include<math.h>#include<algorithm>#define inf 0x3f3f3fconst int maxn = 1e3+10;const double eps = 1e-8;using namespace std;struct Poi...原创 2019-05-14 21:52:41 · 192 阅读 · 0 评论 -
poj2653(计算几何)
http://poj.org/problem?id=2653#include<iostream>#include<cstdio>#define eps 1e-8const int maxn = 1e5+10;using namespace std;struct Point{ double x; double y;}pt1[maxn],pt2[maxn...原创 2019-05-14 23:19:46 · 222 阅读 · 0 评论 -
poj1066(计算几何线段相交)
#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>#include <cstdlib>#include <iomanip>using namespace std;con...原创 2019-05-14 23:50:03 · 173 阅读 · 0 评论 -
多边形面积(1654)
#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;struct Point{ int x,y; Point(){} Point(int x,int y):x(x),y(y){}};typ...原创 2019-05-16 16:45:08 · 181 阅读 · 0 评论 -
多边形面积 以及统计在边上的点和多边形内部的点(1265)Pick 定理
area=I+E/2-1(I为内部格数,E为边上的点数) 边上格点数 = gcd(abs(x),abs(y))-1;#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<cmath>#define N 1003usin...原创 2019-05-16 17:09:06 · 922 阅读 · 0 评论 -
poj 3304(计算几何叉积)
http://poj.org/problem?id=3304判断所有线段段点是否能出现一个直线经过所有线段#include<iostream> #include<math.h>#include<cstdio>const double eps = 1e-8;const int maxn = 1005;using namespace std;...原创 2019-05-13 14:32:09 · 204 阅读 · 2 评论 -
51nod1268和为k的组合
http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1268&judgeId=5977911268 和为K的组合 基准时间限制:1 秒 空间限制:131072 KB 分值: 20 难度:3级算法题 收藏 关注给出N个正整数组成的数组A,求能否从中选出若干个,使他们的和为K。如果可以,输出:"Yes"...原创 2018-08-08 09:33:01 · 133 阅读 · 0 评论 -
poj 1064
http://poj.org/problem?id=1064Cable masterTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 64847 Accepted: 13351 DescriptionInhabitants of the Wonderland have decid...原创 2018-08-15 13:57:47 · 130 阅读 · 0 评论 -
poj最短生成路3984
定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0,};它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到右下角的最短路线。Input一个5 ×...原创 2018-07-18 10:49:04 · 93 阅读 · 0 评论 -
poj3067 japan
http://poj.org/problem?id=3067JapanTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 31876 Accepted: 8564 DescriptionJapan plans to welcome the ACM ICPC World Finals...原创 2018-07-25 12:53:13 · 229 阅读 · 0 评论 -
poj2299 Ultra-QuickSort(树状数组)
http://poj.org/problem?id=2299Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 69262 Accepted: 25954 DescriptionIn this problem, you have to analyze a particular sort...原创 2018-07-25 12:57:47 · 234 阅读 · 0 评论 -
poj2352 stars
Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and ...原创 2018-07-25 14:09:46 · 91 阅读 · 0 评论 -
I Hate It HDU1754
很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。 这让很多学生很反感。 不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。Input本题目包含多组测试,请处理到文件结束。 在每个测试的第一行,有两个正整数 N 和 M ( 0<N<=200000,0<M<5...原创 2018-07-25 16:50:56 · 84 阅读 · 0 评论 -
poj2421Constructing Roads(prime)
http://poj.org/problem?id=2421Constructing RoadsTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 27291 Accepted: 12001 DescriptionThere are N villages, which are nu...原创 2018-07-26 13:01:37 · 96 阅读 · 0 评论 -
poj1258Agri-Net
http://poj.org/problem?id=1258Agri-NetTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 67374 Accepted: 27893 DescriptionFarmer John has been elected mayor of his to...原创 2018-07-26 13:14:48 · 80 阅读 · 0 评论 -
poj3259 Wormholes
农夫约翰在探索他的许多农场,发现了一些惊人的虫洞。虫洞是很奇特的,因为它是一个单向通道,可让你进入虫洞的前达到目的地!他的N(1≤N≤500)个农场被编号为1..N,之间有M(1≤M≤2500)条路径,W(1≤W≤200)个虫洞。FJ作为一个狂热的时间旅行的爱好者,他要做到以下几点:开始在一个区域,通过一些路径和虫洞旅行,他要回到最开时出发的那个区域出发前的时间。也许他就能遇到自己了:)。为了帮助...原创 2018-08-03 17:55:39 · 112 阅读 · 0 评论 -
poj 1251Jungle Roads
The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly,...原创 2018-08-16 17:59:50 · 118 阅读 · 0 评论 -
poj1979Red and Black
There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can'...原创 2018-08-01 11:34:26 · 92 阅读 · 0 评论 -
poj27854 Values whose Sum is 0
http://poj.org/problem?id=27854 Values whose Sum is 0Time Limit: 15000MS Memory Limit: 228000K Total Submissions: 28927 Accepted: 8753 Case Time Limit: 5000MS DescriptionTh...原创 2018-08-06 09:24:36 · 145 阅读 · 0 评论 -
poj 1287 Networking(Kruskal)
You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of p...原创 2018-08-06 16:47:19 · 115 阅读 · 0 评论 -
POJ 2377 Bad Cowtractors(prime模板)最长距离
Bessie has been hired to build a cheap internet network among Farmer John's N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has already done some surveying, and found M (1 <...原创 2018-08-06 16:53:49 · 111 阅读 · 0 评论 -
poj 3468 Simple Problem with Integers
给出了一个序列,你需要处理如下两种询问。"C a b c"表示给[a, b]区间中的值全部增加c (-10000 ≤ c ≤ 10000)。"Q a b" 询问[a, b]区间中所有值的和。Input第一行包含两个整数N, Q。1 ≤ N,Q ≤ 100000.第二行包含n个整数,表示初始的序列A (-1000000000 ≤ Ai ≤ 1000000000)。接下来Q行询...原创 2018-08-02 11:26:40 · 148 阅读 · 0 评论 -
poj2480(费马小定理)
Longge is good at mathematics and he likes to think about hard mathematical problems which will be solved by some graceful algorithms. Now a problem comes: Given an integer N(1 < N < 2^31),you a...原创 2018-08-07 14:16:36 · 214 阅读 · 0 评论 -
poj1269
nt judgecross(){ if(min(p[0].x,p[1].x)>max(p[2].x,p[3].x)||min(p[0].y,p[1].y)>max(p[2].y,p[3].y)||max(p[0].x,p[1].x)<min(p[2].x,p[3].x)||max(p[0].y,p[1].y)<min(p[2].y,p[3].y)){ return ...原创 2019-05-13 16:37:37 · 234 阅读 · 0 评论