Melicent1-CSDN博客

原创 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 587

原创 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 619

原创 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 698

原创 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 922

原创 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 686

原创 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 601

原创 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 545

原创 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 573

原创 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 680

原创 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 680

原创 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 762

原创 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 663

原创 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 948

原创数据结构_栈实现数值转换

//明白了一些道理。。#include#include#include#include#define STACK_INIT_SIZE 100#define STACKCREMENT 10#define N 8typedef struct{ int*base;//栈底 int*top;//栈顶 intstacksize;//栈容量}SqStack;

2013-05-30 11:06:28 5003

原创 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 880

原创 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 723

原创组合数学知识点

求能除尽1400的正整数数目（1除外），其中包含多少个奇数？1400=2^3*5^2*7，故除尽1400的正整数分解为素数的乘积的形式应该为2^l*5^m*7^n，其中0≤l≤3,0≤m≤2,0≤n≤1，但应排除l=m=n=0的情况。故满足条件的数目为(3+1)×(2+1)×(1+1)-1=23其中包含的奇数为(1)×(2+1)×(1+1)-1=5...

2013-05-30 11:06:21 1375

原创 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 564

原创 poj1496(组合数学)-与1850几乎一样

http://poj.org/problem?id=1496Word IndexTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 3969Accepted: 2247DescriptionEncoding schemes areoften used in situations requiring

2013-05-30 11:06:16 488

原创 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 562

原创 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 509

原创知识点（求n!的末尾有几个零）

简单总结如下：n!这个数很特别，它等于1*2*3*4...*(n-1)*n，现在就是分析这个结果末尾有几个零，啰嗦的不说了，任意一个数不是偶数，就是奇数，即任意一个数要么被2整除，要么不能被2整除，因此1*2*3*4...*(n-1)*n从1到n中，每两个数必有一个是2的倍数，因此决定末尾0的个数的只有是1到n中5的倍数的个数了.#includeint main(){int five,

2013-05-30 11:06:10 703

原创 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 582

原创 hdu1969(二分法)

http://acm.hdu.edu.cn/showproblem.php?pid=1969PieTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K(Java/Others)Total Submission(s): 1607 Accepted Submission(s):559Problem Desc

2013-05-30 11:06:05 608

原创知识点

插入排序：一般来说，插入排序都采用in-place在数组上实现。具体算法描述如下：　　⒈ 从第一个元素开始，该元素可以认为已经被排序　　⒉ 取出下一个元素，在已经排序的元素序列中从后向前扫描　　⒊ 如果该元素（已排序）大于新元素，将该元素移到下一位置　　⒋ 重复步骤3，直到找到已排序的元素小于或者等于新元素的位置　　⒌ 将新元素插入到下一位置中　　⒍ 重复步骤2　　如

2013-05-30 11:06:03 504

原创 spoj Permutacja 4310（线段树）

http://www.spoj.pl/problems/AE5B2/SPOJ Problem Set (classical)4310. PermutacjaProblem code: AE5B2 You are given a sequence of positive integers a1,a2, . . . , an. We would like to order

2013-05-30 11:06:01 583

原创 spoj2713(线段树)

http://www.spoj.pl/problems/GSS4/SPOJ Problem Set (classical)2713. Can you answer these queries IVProblem code: GSS4 You are given a sequence A of N(N <= 100,000)positive integers. Ther

2013-05-30 11:05:58 510

原创 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 645

原创 hdu4046(线段树)

http://acm.hdu.edu.cn/showproblem.php?pid=4046PandaTime Limit: 10000/4000 MS (Java/Others) Memory Limit: 32768/32768 K(Java/Others)Total Submission(s): 1516 Accepted Submission(s):511Problem D

2013-05-30 11:05:54 1205

原创 poj3368(线段树)

http://poj.org/problem?id=3368Frequent valuesTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 10192Accepted: 3733DescriptionYou are given a sequence of n integersa1 , a2 ,

2013-05-30 11:05:51 2993

原创 poj 3368 Frequent values(非常变…

http://poj.org/problem?id=3368Frequent valuesTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 10191Accepted: 3732DescriptionYou are given a sequence of n integersa1 , a2 ,

2013-05-30 11:05:49 578

原创 poj3528(染色区间段数+离散化)

http://poj.org/problem?id=2528Mayor's postersTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 29016Accepted: 8405DescriptionThe citizens of Bytetown, AB,could not stand tha

2013-05-30 11:05:47 533

原创去重排序（unique函数的使用）

出处：http://www.cnblogs.com/QQbai/archive/2011/07/25/2114780.html作者：bcyunique函数unique()函数是一个去重函数，STL中unique的函数unique的功能是去除相邻的重复元素(只保留一个),还有一个容易忽视的特性是它并不真正把重复的元素删除。他是c++中的函数，所以头文件要加#include，具体用法如下

2013-05-30 11:05:45 12743

原创 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 675

转载 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 470

转载兴趣学习: 摆脱“三天打渔两…

原文地址：摆脱“三天打渔两天晒网”的坏习惯 from 海词网">兴趣学习: 摆脱“三天打渔两天晒网”的坏习惯 from 海词网作者：Benson导读：如果在某件事上你能每天都坚持，而不是两天打渔三天晒网，那么你将创造出有意义的人生。你能成功减肥塑身，你也能学会一门外语，你还能写完一部小说……而这一切只需要你——坚持下去！摆脱鈥溔齑蛴媪教焐雇澋幕迪肮 from 海词网" TITLE="[转载]兴

2013-05-30 11:05:38 488

原创 poj Allantis (面积计算)1155线段…

http://poj.org/problem?id=1151AtlantisTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 12467Accepted: 4809DescriptionThere are several ancient Greektexts that contain descr

2013-05-30 11:05:36 670

转载线段树的两种建树模型

原文地址：线段树的两种建树模型作者：飘羽逸狂线段树的两种建树模式:第一种:端点形式比如对区间[0,8]可以建立如下的线段树:[0,8][0,4][4,8][0,2][2,4][4,6][6,8][0,1][1,2][2,3][3,4][4,5][5,6][6,7][7,8]第二种:区间格形式比如对区间[0,8]可以建立如下的线段树:[1,8][1,4][5,8][1,2][3

2013-05-30 11:05:33 601

原创（转载）什么是离散化？

转载出处：http://www.matrix67.com/blog/archives/108作者：Matrix67什么是离散化？Program Impossible | 2006-09-26 21:09| 31 Comments | 本文内容遵从CC版权协议转载请注明出自matrix67.com如果说今年这时候OIBH问得最多的问题是二分图，那么去年这时候问得最多的算是离散化

2013-05-30 11:05:31 508

原创 poj2155 Matrix(二维线段树)

http://poj.org/problem?id=2155MatrixTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 12894Accepted: 4834DescriptionGiven an N*N matrixA, whose elements are either 0 or 1. A

2013-05-30 11:05:28 459

空空如也

空空如也