2015年04月_shuangyueliao

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

原创相亲

http://www.cnblogs.com/orchidzjl/p/4263436.html#include#includeint a[100010],b[100010];int main(){ int t,n,sum,i,j,k1,k2,sign,count,t1,t2; scanf("%d",&t); while(t--) { scanf("

2015-04-24 22:41:45 346

转载整数因子分解问题

http://blog.sina.com.cn/s/blog_9b95c19e0101aqw9.html

2015-04-24 20:10:35 488

转载 POJ1019-Number Sequence

http://blog.csdn.net/lyy289065406/article/details/6648504

2015-04-24 13:09:57 293

原创 1142 巡逻的士兵

http://www.cnblogs.com/liaoguifa/archive/2012/11/27/2791255.html#includeint solve(int a){ int count1,count2; if(a return 0; if(a==3) return 1; if(a%2==0) return solve(a/2)*2

2015-04-23 22:35:47 576

原创整数划分（四）

http://acm.nyist.net/JudgeOnline/problem.php?pid=746#include#includeusing namespace std;long long a[30][30];char n[30];int max(int x,int y){ return x>y?x:y;}void area(int x,int

2015-04-21 22:12:50 339

原创 The Balance

http://acm.hdu.edu.cn/showproblem.php?pid=1709//1709#include#includeusing namespace std;int main(){ int t,a1[10010],a2[10010],num[10010]; while(cin>>t) { int sum=0; for(int

2015-04-20 22:59:03 431

原创蚂蚁的难题(二)

http://acm.nyist.net/JudgeOnline/problem.php?pid=745#include#includeusing namespace std;long long a[50010];long long dp[50010],dp1[50010];int main(){ int n,i; long long sum,ans,a

2015-04-19 22:16:24 425

原创 Rikka with wood sticks

http://acm.hdu.edu.cn/showproblem.php?pid=5203#includeusing namespace std;int main(){ int n,m; while(cin>>n>>m) { int a,sta,end,i,j; cin>>a; sta=end

2015-04-18 16:07:06 390

原创 “炫舞家“ST

http://acm.nyist.net/JudgeOnline/problem.php?pid=740//操作比较繁琐的dp，思路理清就好理解了#include #include int dp[10001][5][5], step[10001];int cost[5][5] = {{1, 2, 2, 2, 2}, {2, 1, 3, 4, 3}, {2, 3,

2015-04-15 20:10:50 375

原创 Crisis of HDU

http://acm.hdu.edu.cn/showproblem.php?pid=2110#include#includeusing namespace std;int main(){ int n,c1[10010],c2[10010],i,j,sum,a[110],b[110]; while(scanf("%d",&n),n) { sum=0;

2015-04-14 13:11:11 391

转载擅长排列的小明 II

http://blog.csdn.net/dgq8211/article/details/7369079

2015-04-11 16:44:53 304

原创 A Knight's Journey

http://poj.org/problem?id=2488#include#includeint p,q,vis[30][30];int x1[900],y1[900],ok;void dfs(int x,int y,int num){ int hy[]={-1,1,-2,2,-2,2,-1,1},hx[]={-2,-2,-1,-1,1,1,2,2},i,nx

2015-04-08 18:40:47 268

原创 Sum It Up

http://acm.hdu.edu.cn/showproblem.php?pid=1258#includeusing namespace std;int sum,a[1010],b[1010],f,n,k;void dfs(int x,int num,int cur){ if(x==sum) { f=1; cout for(int i=1;i

2015-04-06 20:01:23 338

原创 Zipper记忆化搜索

#include#includeusing namespace std;char a[210],b[210],c[410];int vis[210][210],k;void dfs(int x,int y,int z){ if(k==1) return; if(z==strlen(c)) { k=1; return; } if(v

2015-04-06 16:49:51 455

转载各种背包基础

http://blog.csdn.net/insistgogo/article/details/11081025

2015-04-06 12:36:41 423

原创钉子和小球

http://poj.org/problem?id=1189#includeusing namespace std;char a[60][60];long long result[60][60];long long gcd(long long x,long long y){ if(y==0) return x; else return gcd(y,x

2015-04-05 17:11:26 394

原创 Sticks

http://acm.hdu.edu.cn/showproblem.php?pid=1455#include#includeusing namespace std;int a[100],vis[100],n,sum,k,res;bool cmp(int x,int y){ return x>y;}bool dfs(int num,int cur,int

2015-04-05 15:10:01 451

原创 Square

http://poj.org/problem?id=2362#include#includeusing namespace std;int a[30],vis[30],t,sum;bool comp(int x,int y){ return x>y;}bool dfs(int num,int cur,int sum1){ if(sum1==sum

2015-04-04 17:01:16 338