2015年03月_shuangyueliao

09月 08月 07月 06月 05月 04月 03月 02月 01月

转载 Holding Bin-Laden Captive!

http://acm.hdu.edu.cn/showproblem.php?pid=1085#include using namespace std; int c1[10000], c2[10000];int num[4];int main(){ int nNum; while(scanf("%d %d %d",&num[1],&nu

2015-03-31 12:50:17 515

原创 Square Coins

http://acm.hdu.edu.cn/showproblem.php?pid=1398#include#includeusing namespace std;int main(){ int i,j,k,c1[310],c2[310],n; while(cin>>n,n) { for(i=0;i { c1[i]=1; c2[i

2015-03-30 13:29:26 312

原创 Ignatius and the Princess III

http://acm.hdu.edu.cn/showproblem.php?pid=1028#includeusing namespace std;int main(){ int i,j,k,c1[130],c2[130],n; while(cin>>n) { for(i=0;i { c1[i]=1; c2[i]=0; }

2015-03-30 13:08:13 315

转载石头合并

http://blog.csdn.net/abcjennifer/article/details/5805330

2015-03-29 20:36:36 428

转载母函数

http://blog.csdn.net/xuzengqiang/article/details/7464337http://www.baidu.com/s?word=%E6%AF%8D%E5%87%BD%E6%95%B0&tn=98853695_hao_pg&ie=utf-8

2015-03-28 18:09:02 373

原创 LITTLE SHOP OF FLOWERS

http://poj.org/problem?id=1157#include#include#define max(x,y) x>y?x:yusing namespace std;int main(){ int n,m,dp[110][110],a[110][110],i,j,k,t; while(cin>>n>>m) { for(i=0;i f

2015-03-28 13:17:28 433

原创呵呵滑雪

http://poj.org/problem?id=1088#include#includeusing namespace std;int h[10010][150]={0},h1[10010][150],c[10010]={0};int main(){ int n,m,t,a[110][110],dp[110][110],i,j,l,max,row,col,m

2015-03-25 15:54:17 320

原创 To the Max

http://poj.org/problem?id=1050#include#includeusing namespace std;int n;int DP(int x[]){ int max,dp[110],i; dp[0]=x[0]; for(i=1;i { if(dp[i-1]>0) dp[i]=dp[i-1]+x[i];

2015-03-24 13:32:01 334

原创 Communication System

http://poj.org/problem?id=1018#include#includeusing namespace std;int main(){ int i,j,k,t,n,m[110],high,low,b[110][110],p[110][110],price,total; double ans; cin>>t; while(t--)

2015-03-23 13:42:04 339

原创最长公共子序列

http://acm.nyist.net/JudgeOnline/problem.php?pid=36#include#include#include#define max(x,y) (x>y?x:y)int dp[1010][1010];using namespace std;int main(){ int n,i,j,a1,b1; char a[1010

2015-03-22 22:17:48 296

原创 VF

http://acm.nyist.net/JudgeOnline/status.php?pid=269#include#includeusing namespace std;int main(){ int i,j,k,s,dp[10][82],sum; memset(dp,0,sizeof(dp)); for(i=1;i dp[1][i]=1; f

2015-03-21 17:57:19 898 1

转载匈牙利算法Courses

http://acm.hdu.edu.cn/showproblem.php?pid=1083#include#includeint map[301][301],vis[301],flag[301],n,p;bool find(int m){ int j; for(j=1;j { if(!vis[j]&&map[m][j])

2015-03-18 16:22:18 358

原创 Moving Tables

http://acm.hdu.edu.cn/showproblem.php?pid=1050#include#includeusing namespace std;int main(){ int t,n,i,j,a,b,c[200],temp,max; cin>>t; while(t--) { memset(c,0,sizeof(c)); c

2015-03-18 15:00:34 411

原创最大的数

http://acm.nyist.net/JudgeOnline/problem.php?pid=1170#includeusing namespace std;int a[10010];void add(int l,int r){ if(a[l]==2) { a[l]++; return ; }

2015-03-16 22:55:05 320

原创找点

http://acm.nyist.net/JudgeOnline/problem.php?pid=891#includeusing namespace std;int main(){ double a[110],b[110],t; int sum,s,i,j; while(cin>>s) { for(i=0;i cin>>a[i]>>b[i];

2015-03-16 13:18:35 292

原创 p次方求和

http://acm.nyist.net/JudgeOnline/status.php?pid=420#includeint s[1001][1001];int main(){ int t,n,p,sum,i,j; for(i=1;i s[i][0]=1; for(i=1;i { s[i][1]=i; for(j=2;j s[i][

2015-03-11 21:47:06 621

原创寻找最大数（三）

http://acm.nyist.net/JudgeOnline/problem.php?pid=1057#include#includeint main(){ int t,k,i,j,l,len; char a[25],tmp; while(scanf("%s%d",a,&k)!=EOF) { len=strlen(a); for(i=0;i

2015-03-11 11:36:54 349

原创非洲小孩题意有点难懂

http://acm.nyist.net/JudgeOnline/problem.php?pid=1036#include#include#include#includeusing namespace std;struct time{ int b,e;}t[105];int cmp(struct time x,struct time y){

2015-03-10 22:12:14 409

原创 The partial sum problem

http://acm.nyist.net/JudgeOnline/problem.php?pid=927#include#includeint vis[30],a[30],n,k,sum,ok;void dfs(int pos,int sum){ int i; if(sum>k) return; if(sum==k) { ok=1; p

2015-03-08 19:30:09 392

原创部分和问题

http://acm.nyist.net/JudgeOnline/problem.php?pid=1058#include#includeint vis[30],a[30],n,k,sum,ok;void dfs(int pos,int sum){ int i; if(sum>k) return; if(sum==k) { ok=1;

2015-03-08 17:07:09 358

原创素数环精品

http://acm.nyist.net/JudgeOnline/problem.php?pid=488#include#includeint prime[45],vis[25],h[1000],t,sign;void judge(int x){ int i; if(x==t && prime[h[0]+h[t-1]]!=0) { sign=1;

2015-03-05 22:08:04 335