10010 第25页

hdu 1011 树形DP

;#include<string.h>#include<vector>using namespace std;struct node{ int v,next;}edge[10010

·2015-11-01 10:37

POJ3270置换群

include<cstdlib> #include<stdio.h> #include<algorithm> using namespace std; int a[10010

·2015-10-31 19:14

POJ 3348 Cows

#include<stdio.h>#include<string.h>#include<stdlib.h>#define MAXD 10010struct point

·2015-10-31 19:20

spoj 2211. Mars Map

cstdio> #include <cstring> #include <algorithm> using namespace std; #define MAX 10010

·2015-10-31 19:24

scau实验题 8596 Longest Ordered Subsequence

WA的而题意本身应该是严格递增的 o(N*N) #include <stdio.h> #include <string.h> #define N 10010

·2015-10-31 19:46

uva 548 Tree

nbsp; #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 10010

·2015-10-31 19:33

uva 11111 Generalized Matrioshkas

1Y的代码，很好，其实就是模拟一下，注意一下细节 #include <stdio.h> #include <string.h> #define MAX 10010

·2015-10-31 19:29

UVA 10494 (13.08.02)

#include<string.h> int main() { long long mod; long long k, tmp; int len; int ans[10010

·2015-10-31 18:35

【SPOJ】220 Relevant Phrases of Annihilation

#include<cstring> 3 #include<algorithm> 4 using namespace std; 5 #define MAXN 10010

·2015-10-31 15:33

POJ 3630 Phone List

#include<stdio.h>#include<string.h>#include<stdlib.h>#define MAXN 10010#define MAXD

·2015-10-31 14:23

POJ 3461 Oulipo

://www.matrix67.com/blog/archives/115 #include<stdio.h>#include<string.h>#define MAXW 10010

·2015-10-31 14:22

HDU 1536 SG函数应用

include<iostream> using namespace std; #include<string.h> int a[110],k; //k为全局变量 int sg[10010

·2015-10-31 12:20

BZOJ1665 : [Usaco2006 Open]The Climbing Wall 攀岩

#include<cstdio> #include<algorithm> const int N=10010,H=1000,R=1000000; int

·2015-10-31 11:52

BZOJ3562 : [SHOI2014]神奇化合物

#include<cstdio> #define N 5010 #define M 200010 #define Q 10010 inline void read(

·2015-10-31 11:51

BZOJ2707 : [SDOI2012]走迷宫

否则对于每块进行高斯消元求出期望如果S点所在块为死路块，则答案为INF #include<cstdio> #include<cmath> const int N=10010

·2015-10-31 11:51

BZOJ3417 : Poi2013 Tales of seafaring

偶数步的最短路对于一次询问，如果d不小于相应奇偶性的最短路，则可行特判：对于孤立点，无论怎么走都不可行 #include<cstdio> const int N=10010

·2015-10-31 11:49

hdu 2874 Connections between cities

lt;iostream> #include <cstdio> #include <cstring> using namespace std; #define N 10010

·2015-10-31 11:18

Timus 1090 树状数组

include<cstdio> #include<cstring> using namespace std; #define MAX 1234567890 int res[10010

·2015-10-31 10:37

NYOJ 286 动物统计

1 #include<stdio.h> 2 #include<string.h> 3 #include<stdlib.h> 4 char a[10010]

·2015-10-31 10:04

NYOJ 14 会场安排问题

include<string.h>#include<algorithm>using namespace std;struct sc{ 　　int bi; 　　int ei;}e[10010

·2015-10-31 10:56

HDU 1248 寒冰王座

include<cstring> #include<cmath> #include<algorithm> using namespace std; int dp[10010

·2015-10-31 09:29

URAL 1019 Line Painting

#include<stdio.h> #include<string.h> #include<stdlib.h> #define MAXD 10010 int

·2015-10-31 09:16

URAL 1022 Genealogical Tree

#include<stdio.h> #include<string.h> #define MAXD 110 #define MAXM 10010 int N, cnt,

·2015-10-31 09:16

UVA 11137 Ingenuous Cubrency

#include<stdio.h>#include<string.h>#define MAXD 10010int N;long long int f[MAXD];void solve

·2015-10-31 09:11

UVA 10651 Pebble Solitaire

#include<stdio.h>#include<string.h>#define MAXD 10010char b[20];int d[MAXD], q[MAXD], hash

·2015-10-31 09:10

UVA 825 Walking on the Safe Side

#include<stdio.h>#include<string.h>#include<ctype.h>#define MAXD 1010char b[10010];

·2015-10-31 09:09

hdu 1711 hdu 1686 hdu 2203 KMP基本应用

View Code #include<cstdio>#include<cstring>int n,m;int a[1000010],b[10010];int p[11111

·2015-10-31 08:11

hdu 3033 分组背包每组至少选一个

[x]（鞋子的价格）可能为0，如果换一下顺序可能会导致某双鞋被选了两次 #include<stdio.h> #include<string.h> int dp[11][10010

·2015-10-31 08:08

hdu 1250

View Code 1 #include<iostream> 2 using namespace std; 3 int num[10010][3

·2015-10-31 08:48

hdu 3732(01背包转多重背包）

View Code 1 #include<iostream> 2 using namespace std; 3 int dp[10010]; 4 i

·2015-10-31 08:47

hdu 1551 二分

View Code 1 #include<stdio.h> 2 #include<math.h> 3 const double eps = 1e-9; 4 double p[10010

·2015-10-30 16:07

poj 1330 最近公共祖先

以前的写法太挫了，现在改了一下，精简了 View Code #include<stdio.h> #include<string.h> const int MAX = 10010

·2015-10-30 16:58

URAL 1049 Brave Balloonists

#include<stdio.h> #include<string.h> #define MAXD 10010 int isprime[MAXD], prime[MAXD]

·2015-10-30 13:03

UVA 624 CD

#include<stdio.h>#include<string.h>#define MAXN 30#define MAXD 10010int M, N, a[MAXN], p[

·2015-10-30 13:58

poj 1733 并查集

include<stdio.h>#include<string.h>#include<map>using namespace std;const int maxn = 10010

·2015-10-30 10:52

zju zoj 2588 求割边模板边双连通

include<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int N = 10010

·2015-10-30 10:51

带限制求最小价值的完全背包 HDU1114

include <cstring> 3 4 using namespace std; 5 6 int v[510]; 7 int w[510]; 8 int dp[10010

·2015-10-30 10:31

Maximal Square

findthelargestsquarecontainingall1'sandreturnitsarea.Forexample,giventhefollowingmatrix:10100 10111 11111 10010

hcx2013·2015-10-28 22:00

iOS 电话／短信／邮件／UIApplication

1⃣️ • 最简单最直接的⽅方式:直接跳到拨号界⾯面 NSURL *url = [NSURL URLWithString:@"tel://10010&

·2015-10-28 09:16

iOS学习笔记（十四）——打电话、发短信

1、打电话 [[UIApplication sharedApplication] openURL:[NSURL URLWithString:@"tel://10010"

·2015-10-28 07:25

hdu 4474 Yet Another Multiple Problem

string.h> #include<queue> using namespace std; queue<int>que; int used[10]; int flag[10010

·2015-10-27 15:57

hdu 2955 Robberies 01背包

的钱且不被抓住的最大概率 1-dp[i]就是被抓住的最小概率 easy~ #include<stdio.h> #include<string.h> double a[110],dp[10010

·2015-10-27 14:04

hdu 1203 01背包

，然后直接1-p即可 WA了两次原因：初始化的时候dp[0]没有赋值 #include<stdio.h> #include<string.h> double dp[10010

·2015-10-27 14:04

hdu 3062 2-sat 水题

string.h> #include<vector> #include<algorithm> using namespace std; const int MAX = 10010

·2015-10-27 14:00

联通积分兑换的Q币怎么兑换到QQ上

可登录联通积分商城http://jf.10010.com 查询和兑换Q币， 1，通过联通积分商城自主兑换，提交订单扣除积分成功后，10010端口将自动为您下发验证码短信。

·2015-10-27 13:12

iOS常用小功能集锦

一、打电话方法一：NSURL*url=[NSURLURLWithString:@"tel://10010"]; [[UIApplicationsharedApplication]openURL:url]

sinat_27706697·2015-10-25 08:00

SPOJ 913 Query on a tree II

#include<stdio.h> #include<string.h> #define MAXD 10010 #define MAXM 20010 int N, q[MAXD

·2015-10-24 09:11

URAL 1664 Pipeline Transportation

#include<stdio.h>#include<string.h>#define INF 0x7FFFFFFF#define MAXD 10010#define MAXM 10000010int

·2015-10-24 09:58

CF 118C Fancy Number

#include<stdio.h>#include<string.h>#include<stdlib.h>int number, a[10010], b[11]

·2015-10-24 09:54

HDU 1533 Going Home

#include<stdio.h>#include<string.h>#include<stdlib.h>#define MAXD 110#define MAX 10010