zhoulingjie311的专栏

<br />pku上的题目分类<br />动态规划：<br />1037 A decorative fence、1050 To the Max、1088 滑雪、1125 Stockbroker Grapevine、1141 Brackets Sequence、1159 Palindrome、1160 Post Office、1163 The Triangle<br /><br />、1458 Common Subsequence、1579 Function Run Fun、1887 Testing the

#include "stdio.h"#include "math.h"int f(int m, int n){ if(m<0) return 0; if(m==0||n==1) return 1; return f(m-n,n)+f(m,n-1);}int main(){ int a,b,t; scanf("%d",&t); while(t--)

#include "iostream"#include "cmath"#include "queue"using namespace std;int mark[9999];int pri[9999];int lev[9999];int IsPrime(int n){ int i=2; while(i<=sqrt((float)n)) { i

#include "iostream"#include "math.h"#include "queue"using namespace std;long mark[210000];struct node{ long num; long lev;};queue seq;node BFS(node s, node e){ node front,

#include "stdio.h"#include "math.h"int mark[6][6],savex[26],savey[26],minx[26],miny[26],cur,n,lenmin;int dir[8]={1,0,0,1,-1,0,0,-1};void DFS(int x,int y,int cur){ int i; if(x==4&&y==4)

OJ上的一些水题(可用来练手和增加自信) (poj3299,poj2159,poj2739,poj1083,poj2262,poj1503,poj3006,poj2255,poj3094) 初期: 一.基本算法:       (1)枚举. (poj1753,poj2965)      (2)贪心(poj1328,poj2109,poj2586)      (3)递归和分治法.       (4)递

#include "stdio.h"#include "math.h"#include "string.h"int main(){ int i,j,m,k,len1,len2,len3,c; int a[102][50],max; char t1[10],t2[10],t3[10]; while(scanf("%s %s %s",t1,t2,t3)!=EOF)

#include "stdio.h"#include "string.h"int main(){ int i,j,n,a1,b1,c1,d1,e1,f1,check; char s[25],end[3]; char a[5],b[5],c[5],d[3],e[3],f[3]; scanf("%d",&n); while(n--)

#include "stdio.h"#include "math.h"int main(){ int i,j,n,m,mmax,nmax,mmin,nmin; char a[1000][1000]; while(scanf("%d %d",&n,&m)!=EOF) { a[0][0]=A; nmax=n-1

#include "stdio.h"#include "string.h"int main(){ int i,j,a,b,k,n,m,len,start,the,end,stu[65],num; char s[65][16],ws[100],c; scanf("%d",&n); for (i=0;i<n;i++) { scanf("%s",s[i]); }

#include "stdio.h"#include "string.h"int main(){ char s[10000],str[10000]; int i,j,k,len; while (gets(s)) { len=strlen(s); i=0;k=0; while(i<len) { if(s[i]==y&&s[i+1]==

#include "stdio.h"#include "string.h"int main(){ char s[10000],oper,a[10000],b[10000],c[10000],d[10000]; int i,j,k,len,ka,kb,kc,kd,numa,numb,numc,numd,up,down,up1,down1,com; while (gets(s)

#include "stdio.h"#include "string.h"int main(){ int i,j,k,n,m,len; char s[1000],a[1000],start[100],end[100]; while (gets(start)&&strcmp(start,"ENDOFINPUT")!=0) { gets(s); len=strl

#include "iostream"#include "math.h"#include "queue"using namespace std;long mark[210000];long lev[210000];long BFS(long s, long e){ long front; memset(mark,0,sizeof(mark));