![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
poj
Melicent1
这个作者很懒,什么都没留下…
展开
-
lower_bound()&&upper_bound()
lower_bound的: 出处:http://www.cnblogs.com/o8le/archive/2012/03/21/2410716.htmllower_bound的headfile是algorithm.lower_bound的工作原理就是二分查找了。lower_bound的作用:lower_bound的返回值减去数组的地址就是要查找的元素在数组中的位置。即:Pos原创 2013-05-30 11:05:43 · 671 阅读 · 0 评论 -
poj2249(排列组合__套模板)
http://poj.org/problem?id=2249BinomialShowdownTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 15978Accepted: 4900DescriptionIn how many ways canyou choose k elements out原创 2013-05-30 11:06:30 · 933 阅读 · 0 评论 -
poj3370(鸽巢原理-与2356一样)
http://poj.org/problem?id=3370HalloweentreatsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 4911Accepted: 1851Special JudgeDescriptionEvery year there is the same prob原创 2013-05-30 11:06:38 · 678 阅读 · 0 评论 -
zoj1316(数学)
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1316MatrixMultiplicationTime Limit: 2 SecondsMemory Limit: 32768 KBLet us consider undirected graph G = which has N vertices and Medg原创 2013-05-30 11:06:45 · 594 阅读 · 0 评论 -
poj2853(数学)
http://poj.org/problem?id=2853Sequence SumPossibilitiesTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5307Accepted: 3499DescriptionMost positive integers may be written原创 2013-05-30 11:06:56 · 575 阅读 · 0 评论 -
poj1469(最大匹配)
http://poj.org/problem?id=1469COURSESTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 14049Accepted: 5563DescriptionConsider a group of N students and Pcourses. Each studen原创 2013-05-30 11:07:07 · 589 阅读 · 0 评论 -
poj3041(最小顶点覆盖)
http://poj.org/problem?id=3041AsteroidsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10532Accepted: 5687DescriptionBessie wants tonavigate her spaceship through a danger原创 2013-05-30 11:07:10 · 564 阅读 · 0 评论 -
poj1149(网络流最大流dinic)
http://poj.org/problem?id=1149PIGSTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 12802Accepted: 5664DescriptionMirko works on a pigfarm that consists of M locked pig-hous原创 2013-05-30 11:07:30 · 561 阅读 · 0 评论 -
求一个数因子的个数cf_146_div2_B_…
for(i=1;i { for(j=i;j { d[j]++; } }cf146_B.Easy Number ChallengeB. Easy Number Challengetimelimit per test2 secondsmemorylimit per test256 meg原创 2013-05-30 11:07:33 · 551 阅读 · 0 评论 -
cfdiv2_140
http://codeforces.com/contest/227/problem/AA. Where do I Turn?time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTrouble came from t原创 2013-05-30 11:06:07 · 571 阅读 · 0 评论 -
poj1850(组合数学)
http://poj.org/problem?id=1850CodeTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 6200Accepted: 2914DescriptionTransmitting andmemorizing information is a task that requir原创 2013-05-30 11:06:14 · 551 阅读 · 0 评论 -
poj2409(polya计数 套模版)
http://poj.org/problem?id=2409Let it BeadTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3549Accepted: 2281Description"Let it Bead"company is located upstairs at 700 Cann原创 2013-05-30 11:06:23 · 716 阅读 · 0 评论 -
poj1833(排列组合)
http://poj.org/problem?id=1833排列Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 13068Accepted: 5420Description题目描述:大家知道,给出正整数n,则1到n这n个数可以构成n!种排列,把这些排列按照从小到大的顺序(字典顺序)列出,如n=原创 2013-05-30 11:06:32 · 656 阅读 · 0 评论 -
poj2748(找规律)
http://poj.org/problem?id=2748Logs StackingTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 3649Accepted: 1213DescriptionDaxinganlingproduces a lot of timber. Before loadin原创 2013-05-30 11:06:34 · 751 阅读 · 0 评论 -
poj2356(鸽巢原理)
http://poj.org/problem?id=2356Find amultipleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4136Accepted: 1814Special JudgeDescriptionThe input contains Nnatural (i.e.原创 2013-05-30 11:06:36 · 667 阅读 · 0 评论 -
poj1730(数学)
http://poj.org/problem?id=1730Perfect Pth PowersTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 14897Accepted: 3356DescriptionWe say that x is a perfectsquare if, for some原创 2013-05-30 11:06:52 · 687 阅读 · 0 评论 -
poj2407(欧拉函数-套模板)
http://poj.org/problem?id=2407RelativesTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 9323Accepted: 4398DescriptionGiven n, a positiveinteger, how many positive integers原创 2013-05-30 11:06:54 · 607 阅读 · 0 评论 -
cf141div2
http://codeforces.com/contest/228/problem/AA. Is your horseshoe on the other hoof?time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output原创 2013-05-30 11:06:18 · 558 阅读 · 0 评论 -
poj1401(计算n!中0的个数)
http://poj.org/problem?id=1401FactorialTime Limit: 1500MSMemory Limit: 65536KTotal Submissions: 12332Accepted: 7682DescriptionThe most important part of a GSMnetwork is so called B原创 2013-05-30 11:06:12 · 501 阅读 · 0 评论 -
upper_bound()与lower_bound…
原文地址:upper_bound()与lower_bound()使用方法作者:shenyaoxing#include#include //必须包含的头文件using namespace std;int main(){ int point[10] = {1,3,7,7,9}; int tmp = upper_bound(point, point + 5, 7) -point;//按从小转载 2013-05-30 11:05:40 · 464 阅读 · 0 评论 -
poj1286(polya计数 套模版)
http://poj.org/problem?id=1286Necklace ofBeadsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5318Accepted: 2203DescriptionBeads of red, blueor green colors are connecte原创 2013-05-30 11:06:25 · 873 阅读 · 0 评论 -
poj2601(变形的等差数列求单项)
http://poj.org/problem?id=2601SimplecalculationsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6084Accepted: 3085DescriptionThere is a sequenceof n+2 elements a0, a1, ..原创 2013-05-30 11:06:59 · 1043 阅读 · 0 评论 -
poj3090(eular)
http://poj.org/problem?id=3090Visible Lattice PointsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4455Accepted: 2535DescriptionA lattice point (x,y) in the first quadra原创 2013-05-30 11:07:03 · 620 阅读 · 0 评论 -
poj1325(最小顶点覆盖)
http://poj.org/problem?id=1325Machine ScheduleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9666Accepted: 4108DescriptionAs we all know, machinescheduling is a very clas原创 2013-05-30 11:07:12 · 605 阅读 · 0 评论 -
cf148div2
A. Two Bags of Potatoestimelimit per test1 secondmemorylimit per test256 megabytesinputstandard inputoutputstandard outputValera had two bags of potatoes, the first of these bagsc原创 2013-05-30 11:07:37 · 725 阅读 · 0 评论 -
1poj2240(bellman_ford||floyd)
http://poj.org/problem?id=2240ArbitrageTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 11173Accepted: 4704DescriptionArbitrage is the use ofdiscrepancies in currency excha原创 2013-05-30 11:05:02 · 455 阅读 · 0 评论 -
poj2240(bellman_ford||floyd)
http://poj.org/problem?id=2240ArbitrageTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 11173Accepted: 4704DescriptionArbitrage is the use ofdiscrepancies in currency excha原创 2013-05-30 11:05:07 · 506 阅读 · 0 评论 -
poj2640(多边形)
http://poj.org/problem?id=2640PlaygroundTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2877Accepted: 1098DescriptionGeorge has K <= 20steel wires shaped in the form of ha原创 2013-05-30 11:05:56 · 636 阅读 · 0 评论 -
poj3270(置换群)
http://poj.org/problem?id=3270Cow SortingTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 4811Accepted: 1759DescriptionFarmer John's N (1 ≤ N ≤ 10,000) cows are lined upto原创 2013-05-30 11:06:41 · 569 阅读 · 0 评论 -
poj1019(数学)
http://poj.org/problem?id=1019NumberSequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 28452Accepted: 7873DescriptionA single positiveinteger i is given. Write a pro原创 2013-05-30 11:06:43 · 539 阅读 · 0 评论 -
poj2696(mod 数学上的定义)
http://poj.org/problem?id=2696A Mysterious FunctionTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3742Accepted: 2572DescriptionFor any integers p and q with q >0, define原创 2013-05-30 11:06:48 · 671 阅读 · 0 评论 -
poj3372(完全剩余系(不会证))
http://poj.org/problem?id=3372CandyDistributionTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5083Accepted: 2775DescriptionN children standing in circle who are numbere原创 2013-05-30 11:06:50 · 910 阅读 · 0 评论 -
poj1142(质因数分解)
http://poj.org/problem?id=1142Smith NumbersTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 10279Accepted: 3610DescriptionWhile skimming hisphone directory in 1982, Albert原创 2013-05-30 11:07:01 · 1852 阅读 · 0 评论 -
poj2560(最小生成树-prim())
http://poj.org/problem?id=2560FrecklesTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5456Accepted: 2827DescriptionIn an episode of theDick Van Dyke show, little Richie co原创 2013-05-30 11:07:24 · 553 阅读 · 0 评论 -
poj3259(Bellman_ford)
http://poj.org/problem?id=3259 WormholesTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 20180Accepted: 7159DescriptionWhile exploring his many farms, Farmer John has disc原创 2013-05-30 11:04:47 · 508 阅读 · 0 评论 -
1poj2524(套模板并查集)
http://poj.org/problem?id=2524Ubiquitous ReligionsTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 17626Accepted: 8578DescriptionThere are so many differentreligions in the原创 2013-05-30 11:04:49 · 539 阅读 · 0 评论 -
poj1273(网络流最大流dinic)
http://poj.org/problem?id=1273DrainageDitchesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 43049Accepted: 16168DescriptionEvery time it rainson Farmer John's fields, a原创 2013-05-30 11:07:28 · 720 阅读 · 0 评论