cstdlib 第29页

poj2231

< iostream > #include < cstdio > #include < cstdlib

·2015-11-06 08:49

poj2209

< iostream > #include < cstdio > #include < cstdlib

·2015-11-06 08:48

hdu 2896 字典树解法

include <iostream> 2 #include <cstring> 3 #include <cstdio> 4 #include <cstdlib

·2015-11-06 07:57

最短路--Dijkstra算法 --HDU1790

//Dijkstra #include<iostream> #include<cstdio> #include<cstdlib> #include

·2015-11-06 07:08

hdu 1022 Train Problem I

pid=1022 View Code 1 #include <cstdio> 2 #include <iostream> 3 #include <cstdlib

·2015-11-05 09:06

hdu 1172 猜数字解题报告<暴力枚举>

include <cstdio> 2 #include <iostream> 3 #include <cmath> 4 #include <cstdlib

·2015-11-05 09:41

poj1664 放苹果 <整数拆分>

id=1664 View Code 1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring

·2015-11-05 09:40

poj 1014 Dividing <多重背包>

View Code 1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring> 4

·2015-11-05 09:39

poj 1023 The Fun Number System

id=1023 View Code 1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring

·2015-11-05 09:38

poj 1283 Moving Computer

1664那样做，就会超时，因为有很多重复的计算； View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:33

poj 1671 Rhyme Schemes

1][k-1] + k*[n-1][k]; View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:30

poj 1942 Paths on a Grid

简单的组合题： View Code #include<iostream> #include<cstdio> #include<cstdlib> #include

·2015-11-05 08:30

poj 3844 Divisible Subsequences

的集合那么可以从中任意选2个与1个，这个题会超出int型： View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:29

poj 2603 Brave balloonists

这个题就是欧拉定理的简单运用： View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:27

poj 3088 Push Botton Lock

个数分成m堆（1~n），堆里面无序，堆有序； View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:26

poj 1850 Code 1496 Word Index

这个题是组合题： View Code #include<iostream> #include<cstdio> #include<cstdlib> #

·2015-11-05 08:21

HDU 1892 See you~

一道二维的树状数组题：这里要注意初始化， View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:19

HDU 3584 Cube

三维的树状数组：对单点更新，跟二维的一样： View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:18

poj 2019 Cornfields

二位线段树: View Code #include<iostream> #include<cstdio> #include<cstdlib> #include

·2015-11-05 08:17

poj 1195 Mobile phones

可以用二维线段树与二维树状数组做: 二位数状数组： View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:17

HDU 1823 Luck and Love

一道二维线段树题，求区间最大值： View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:16

poj 2155 Matrix

这个题可以用二位数状数组也可以用二维线段树做：法一： View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:15

poj 1468 Rectangles

水题，直接暴力： View Code #include<iostream> #include<cstdio> #include<cstdlib> #

·2015-11-05 08:14

poj 1151 Atlantis

用离散化处理就可以了： View Code #include<iostream> #include<cstdio> #include<cstdlib>

·2015-11-05 08:13

HDU 2461 Rectangles poj 3695 Rectangles

纯容斥定理： View Code #include<iostream> #include<cstdio> #include<cstdlib> #include

·2015-11-05 08:12

poj 1389 Area of Simple Polygons

离散化处理： View Code #include<iostream> #include<cstdio> #include<cstdlib> #include

·2015-11-05 08:12

HDU 4135 Co-prime

简单的容斥定理的运用： View Code #include<iostream> #include<cstdio> #include<cstdlib>

·2015-11-05 08:11

HDU 1695 GCD

我们在扩大k倍，就可以解决，上面存在的问题； View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:10

HDU 1796 How many integers can you find

容斥定理： View Code #include<iostream> #include<cstdio> #include<cstdlib> #include

·2015-11-05 08:10

poj 3370 Halloween treats

2012/07/27/2611306.html View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:08

Strange display

c , ci) 寻找最下的区域；因此:r = c - x - y; View Code View Code #include<cstdio> #include<cstdlib

·2015-11-05 08:04

poj 2244 Eeny Meeny Moo

直接打表： View Code #include<iostream> #include<cstdio> #include<cstdlib> #include

·2015-11-05 08:03

poj 1012 Joseph

直接打表： View Code #include<iostream> #include<cstdio> #include<cstdlib> #include

·2015-11-05 08:02

poj 2142 The Balance

扩展欧几里得的运用： View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:01

HDU 2665 Kth number

这里要用到划分树求第K大数： View Code #include<iostream> #include<cstdio> #include<cstdlib&

·2015-11-05 08:59

HDU 4251 The Famous ICPC Team Again

这个也是一道对划分树的简单的运用： View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:58

poj 2104 K-th Number

，求里面的第K大的数；这里用到划分树： View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:57

HDU 2841 Visible Trees

这个题首先用到欧拉的质因子分解，再利用容斥定理； View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:56

poj 2115 C Looooops

即线性方程为 a*x + b*y = c; View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:54

poj 2429 GCD & LCM Inverse

Miller_rabin与pallord的一个运用； View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:52

poj 2191 Mersenne Composite Numbers

；再利用pallord进行质因子分解； View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:51

poj 1811 Prime Test

Miller_rabin与pallord算法： View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:51

poj 2992 Divisors

+1）*(p2+1)*……*(pn+1); View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:50

poj 2773 Happy 2006

（24） 25 我们可以看到一个循环节； View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:49

poj 3641 Pseudoprime numbers

只是用到了一个同余定理，还有一个素数二重筛选； View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:47

poj 2909 Goldbach's Conjecture

素数水题： View Code #include<iostream> #include<cstdio> #include<cstdlib> #include

·2015-11-05 08:46

poj 3126 Prime Path

一道素数与BFS结合的题； View Code View Code #include<iostream> #include<cstdio> #include<cstdlib

·2015-11-05 08:45

poj 3518 Prime Gap