bai071006201的专栏

#include#include#includeusing namespace std;#define null NULL;typedef struct node{ struct node * parent;//保存父节点 string content;//保存本节点的操作序列 int c[10];//保存本节点的状态}node;typedef struct sequenc

参考网址：http://blog.sina.com.cn/s/blog_62213fa10100g4kx.htmlint main(){ ifstream fin ("concom.in"); ofstream fout ("concom.out"); int flag=1,i,j,k; int company[102][102]={0},total[102][102]={

题目网址：http://wenku.baidu.com/view/816dfaf29e31433239689324.html参考网址：http://blog.sina.com.cn/s/blog_61576de10100sizc.html#includeusing namespace std;ifstream fin ("money.in");ofstream fout ("money.

参考网址：http://www.cnblogs.com/void/articles/2336263.html题目网址：http://wenku.baidu.com/view/816dfaf29e31433239689324.html#include#include using namespace std;int n;ifstream fin ("zerosum.in");ofstre

#include #includeusing namespace std;char *itoa(int num, char *str, int radix){ //0的情况 if (num==0) { str[0]='0'; str[1]='\0';

#includeusing namespace std;int main(){ int sum,n,i,j; ifstream fin ("subset.in"); ofstream fout ("subset.out"); int a[40][391]={0}; // a[i][j]=a[i-1][j] if j<i // a[i][j]=a[i-1

//题目见：http://wenku.baidu.com/view/816dfaf29e31433239689324.html//每个树的状态都由其左右子树状态决定,根据乘法原理,其状态数等于左右子树状态数乘积#includeusing namespace std;int main(){ ifstream fin ("nocows.in"); ofstream fout

题目见：http://wenku.baidu.com/view/816dfaf29e31433239689324.html #include #include using namespace std; int main() { ifstream fin ("prefix.in"); ofstream fout ("prefix.out

//用dijstra算法找到Z到其余各个顶点的最小距离，然后判断最小距离中离大写字母的顶点中最小的返回#include#include#includeusing namespace std;int maxdist=100000000;int dest[60];int dist[100][100];//a[][]保存各个牧场的距离,不相连就是maxdistint s[60]={0};

#include#includeusing namespace std;ifstream fin ("agrinet.in");ofstream fout ("agrinet.out");int main(){ int i,j,n; int p[101][101]; int sign[101]; int sum=0; int t=1; for(i=1;i<=100;i++)

#include#includeusing namespace std;ifstream fin ("ratios.in");ofstream fout ("ratios.out");int main(){ int rx=0,ry=0,rz=0; int x=0,y=0,z=0; int N=0; int k[4]={0}; int a[4]={0},b[4]={0},c[4

#include#includeusing namespace std;int main(){ ifstream fin ("spin.in"); ofstream fout ("spin.out"); int i,j,k; int time=0; int speed[6]={0}; int gapcount[15]={0}; int gap[6][15][3]={0};

#include#includeusing namespace std;ifstream fin ("fact4.in");ofstream fout ("fact4.out");int main(){ int n,i; int time5=0;//记录5的个数 int time0=0;//记录0的个数 int result=1;//保存结果 int arr[4222]={0

#include#include#includeusing namespace std;int main(){ ifstream fin ("stamps.in"); ofstream fout ("stamps.out"); int k,n; int i; int f[200001]={0}; int value[100]={0}; f[0]=0; fin>>k>>n;

#include#include#include#includeusing namespace std;#define M 12#define N 4096int main(){ int res[M+1][N+1]; ifstream fin ("contact.in"); ofstream fout ("contact.out"); char input[200001];

//#include//#include//using namespace std;//int color[810][810]={1};//int values[1005]={0};//int main()//{// ifstream fin ("rect1.in");// ofstream fout ("rect1.out");// int shapes[1005];//保存每

题目网址：http://wenku.baidu.com/view/816dfaf29e31433239689324.html#include#includeusing namespace std;int main(){ ifstream fin ("ttwo.in"); ofstream fout ("ttwo.out"); char pos[11][11]={'d'}; int

#include#includeusing namespace std;ifstream fin ("humble.in");ofstream fout ("humble.out");int main(){ int k,n,i,j; int s[102],hm[100002],index[102]; for(i=1;i<=101;i++) index[i]=1; fin>>

#include#includeusing namespace std;ifstream fin ("inflate.in");ofstream fout ("inflate.out");int x[202];int max(int a,int b){ if(a>b) return a; else return b;}int main()

#includeusing namespace std;int n;//保存维生素的种类数，n<30int v[30];//每天需要的每种维生素数int m;//保存饲料种类数，m<20int s[20][30];//每种饲料含有的维生素含量int mins=10000;//保存最少的饲料种类数int now_num[30]={0};//保存当前各种维生素的含量，共n个

#include#includeusing namespace std;int main(){ ifstream fin ("sort3.in"); ofstream fout ("sort3.out"); int i,j; int n ,count=0; int a[1001],number[3]={0}; fin>>n; for(i=1;i<=n;i++) { fi

#include#include#include#includeusing namespace std;int main(){ char a[]={'0','1','2','3','4','5','6','7','8','9'}; ifstream fin ("dualpal.in"); ofstream fout ("dualpal.out"); int n,s,i,j;

#includeusing namespace std;int main(){ int n,m,i,j,k,q; ifstream fin ("milk.in"); ofstream fout ("milk.out"); fin>>n>>m;//n:所需牛奶，m:农民个数 int p[5001],a[5001];//p保存单价，a保存每个农民能买的总量 for(i=1;i<=m;

#includeusing namespace std;int main(){ int i,j,k,m,s,c,start=1,minlength=0; int number[201],sort[200]; ifstream fin ("barn1.in"); ofstream fout ("barn1.out"); fin>>m>>s>>c; for(i=1;i<=c;i++)

//好像有点错误。。#includeusing namespace std;int main(){ int l1,l2,l3,l4,m1,m2,m3,m4,n=0,wl[5][3],len,wid,maxlen,maxwid,temp,length[5],width[5],mixa=100000,i,j,temp1; ifstream fin ("packrec.in"); ofst

/*PROG:palsquareLANG:C++*/#include#include#include#includeusing namespace std;int main(){ ifstream fin ("palsquare.in"); ofstream fout ("palsquare.out"); int i,j,k,m; int ary;//进制 fin>>

#include#include#include#define null NULLusing namespace std;typedef struct stack{ struct stack *prior; struct stack *next; char c;}stack;int main(){ ifstream fin ("beads.in"); ofstre

/*ID:wsbqw1PROG:namenumLANG:C++*/#include#include#includeusing namespace std;int main(){ int i,j=0; string s; ifstream fin ("dict.txt"); ofstream fout ("namenum.out"); ifstream fin1 ("n

#includeusing namespace std;int main(){ ifstream fin("crypt1.in"); ofstream fout ("crypt1.out"); bool b[11]={false}; int i,n1,n2,n3,n4,n5,n,p1,p2,q1,q2,q3,sum=0,a[10];//a的下标为n1,n2,n

/*ID:wsbqw1PROG:gift1LANG:C++*/#include#include#include#includeusing namespace std;int main(){ ifstream fin ("gift1.in"); ofstream fout ("gift1.out"); string s[15]; int m[15]={0}; int

#include#includeusing namespace std;int main(){ int i,j,k=0,a[10],b[10]; ifstream fin ("clocks.in"); ofstream fout ("clocks.out"); int move[10][10]={ {0,0,0,0,0,0,0,0,0,0}, {0,3,3,0,3,3,0,

#includeusing namespace std;int main(){ int a,b,c[10000],d[10000],i,j=0,l=0,k=0,m,n,sum,p,q; char f=false; ifstream fin ("ariprog.in"); ofstream fout ("ariprog.out"); fin>>n>>m; for(a=0;a<=m*

#include#include#include#includeusing namespace std;int myitoa(int data, string* p, int num) { if (p == NULL) { return -1; } if (data < 0) { *p

#include "stdafx.h" #include #include using namespace std; const int MAX=13; int N; //维数 int count; //计数，保证前三个输出，后面的不输出。 int col[MAX]; ofstream fout; bool check(i

#includeusing namespace std;int main(){ int i,j,N,farms[5000][2],start,end,longest_man,longest_no_man; ifstream fin ("milk2.in"); ofstream fout ("milk2.out"); fin>>N; for(i=0;i<N;i++) { fin

#includeusing namespace std;int month[12]={31,28,31,30,31,30,31,31,30,31,30,31};bool isleep(int year){ if((year%100!=0 && year%4==0)||(year%400==0)) return true; else return false;

#include#includeusing namespace std;bool isprime(int i){ int j; for(j=2;j<=sqrt(i);j++) { if(i%j==0) return false; } return true;}bool ispal(int i){ int j=i,k=0,l,a[1

#include#include#include#define null NULLusing namespace std;typedef struct list{ char value; struct list * prior; struct list * next;}list;int main(){ ifstream fin ("beads.in"); ofs

//从左往右数第一个数肯定为2，3，5,7中的某一位，用递归的方法，从左往右开始#include#includeusing namespace std;ifstream fin ("sprime.in");ofstream fout ("sprime.out");int isp(int x){ int i; for(i=2;i<=sqrt(x);i++) { if(x%i=

#include#includeusing namespace std;bool flag[21][21]={false},f[21]={false};int a,b,c;void check(int x,int y,int z);int main(){ ifstream fin ("milk3.in"); ofstream fout ("milk3.out"); fin>>a