Free loop！ 爱上编程！

/*ID: cm750621LANG: C++PROG: ride*/#include#includeint main(){ freopen("ride.in","r",stdin); freopen("ride.out","w",stdout); int suma=1,sumb=1,alen,blen,i,j,k,m,n; char a[10],b[10]; scanf(

/* ID: cm750621 PROG: barn1 LANG: C++*/#include #include using namespace std;const int size=200+10;bool a[size];int cou[size]; int main(){ freopen("barn1.in","r",stdin); fre

/*ID: cm750621PROG: comboLANG: C++*/#include #include int i,j,k,m,n,a,t,john[3],master[3],cd[3];int absx(int x){ return x<0?-x:x;}int main(){ freopen("combo.in","r",stdin); freopen("combo

/*ID: cm750621PROG: sort3LANG: C++*/ #include #include int a[10],v[10000],ans=0;void swap(int &a,int &b){ int t=a; a=b; b=t;}int main(){ freopen("sort3.in","r",stdin); freopen("sort3.o

/*ID: cm750621PROG: holsteinLANG: C++*/#include #include int book[27],mark[17],stad[27],a[17][27],n,v,min=10000,min_mark[17],ans=0;void put_in(int x){ for(int i=1;i<=v;i++) book[i]

/*ID: cm750621PROG: hammingLANG: C++*/#include #include int N,B,D,can[300],i,j,k,m,n,begin=0,end=1,length;int in(int a,int b){ int i,s=0; for(i=0;i<B;i++) if(((a>>i)&1)!=((b>>i)&1)) s+

/*ID: cm750621PROG: prefixLANG: C++*/#include #include #include #include #include using namespace std; int main() { int best = -1, n = -1, v[200001] = { 0 }, sz[202]; char pre[202][11]

/*ID: cm750621PROG: prefaceLANG: C++*/#include #include #include const int N = 5010;int ans[N][9],e[]={0,1,2,3,11,10,11,12,13,101};char roma[8] = {"IVXLCDM"}; int main(){ freopen("preface

/*ID: cm750621PROG: castleLANG: C++*/#include#includeint castle[54][54][4],vis[54][54],wall[3];int s,size[2501];int big=1,max,k=1,large;void DFS(int x,int y){ if(!castle[x][y][1]) return

/*ID: cm750621PROG: beadsLANG: C++*/#includechar p[1200];int main(){ freopen("beads.in","r",stdin); freopen("beads.out","w",stdout); int i,j,k,m,n,s=2; scanf("%d\n",&n); for(i=400;i<400

/*ID: cm750621PROB: sprimeLANG: C++*/#include#include#includeint i,j,k,m,n,e;int check(int a){ if(a==1) return 1; if(a==2) return 0; e=(int)sqrt(a); for(i=2;i

/* ID: cm750621 PROG: gift1 LANG: C++*/#include #include #include #include #include using namespace std; int main(){ freopen("gift1.in","r",stdin); freopen("gift1.out","w",stdout); i

/*ID: cm750621PROG: wormholeLANG: C++*/#include#include#include#include#include#includeusing namespace std; struct Node{ int x,y,vis,l; bool operator <(const Node &rhs)const{ return x

#include #include #include #include using namespace std;typedef struct{ double x,y; }P;typedef struct{ int s,t; double k,l;}E;int n,top;double sum;P p[10010];E e[20020];bool comp(

转自http://blog.youkuaiyun.com/cnyali/article/details/50630521#includestruct node{ int x1,y1,x2,y2,c;};struct node s[1010];int px[2010],py[2010],ux[10010],uy[10010],p[10000];short a[2010][2010],c[2510];

/*ID: cm750621PROG: fridayLANG: C++*/#includeint a[7]={0};int main(){ freopen("friday.in","r",stdin); freopen("friday.out","w",stdout); int i,j,k,m,n,l=13; scanf("%d",&n); if(n!=0)

/*ID: cm750621LANG: C++PROG: milk2*/#include #include int main(){ int n,i,a,b,j,m1=1000000,m2=0,max[2]={0,0}; char hash[1000000]; freopen("milk2.in","r",stdin); freopen("milk2.out

/*ID: cm750621PROG: transformLANG: C++*/#include#includechar a[10][10]={'\0'};char aa1[20][20]={'\0'};char aa2[20][20]={'\0'};char k[10][10]={'\0'};int main(){ freopen("transform.in","

/*ID: cm750621PROG: namenumLANG: C++*/#include int num[26]={2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,0,7,7,8,8,8,9,9,9,0};int name[13];char les[13]; int main(){ freopen("namenum.in","r",stdin); fre

/*ID: cm750621LANG: C++TASK: palsquare*/#include #include int b,num[10],sta[20];int main(){ freopen("palsquare.in","r",stdin); freopen("palsquare.out","w",stdout); int i,j,k,m,n,l; scanf

/*ID : cm750621PROG : dualpalLANG : C++*/#include const int MAX=10010;int a[MAX];int work(int n,int s){ int count=0; while(s!=0){ a[count++]=s%n; s/=n; } count--; int i,j; for(i=0,j=

/*ID : cm750621LANG : C++TASK : milk*/#include#includestruct milk{ int pr; int num; };struct milk a[5010];int main(){ freopen("milk.in","r",stdin); freopen("milk.out","

/*ID:cm750621PROG:crypt1LANG:C++*/#include int i,j,n,b[11],k,ans;int hash(int v){ while(v){ if(!b[v%10]) return 0; v/=10; } return 1;}int main(){ freopen("c

/*ID: cm750621PROG: runroundLANG: C++*/#includebool vis[20],tmp[10];char s[20];int a[459] = {0,1,2,3,4,5,6,7,8,9,13,15,17,19,31,35,37,39,51,53,57,59,71,73,75,79,91,93,95,97,147,174,258,285,417

/*ID: cm750621PROB: frac1LANG: C++*/#include #include int i,j,k,m,n;void sch(int a1,int a2,int b1,int b2){ if(a1+b1>n || a2+b2>n) return; else{ int m1=a1+b1,m2=a2+b2;

/*ID: cm750621PROB: sprimeLANG: C++*/#include#include#includeint i,j,k,m,n,e;int check(int a){ if(a==1) return 1; if(a==2) return 0; e=(int)sqrt(a); for(i=2;i<

暴力的打表，请读者不要吐槽！！！          o(∩_∩)o~~~~~~/*ID: cm750621LANG: C++TASK: pprime*/#include #include const int N = 781;int p[1000] = {0,2,3,5,7,11,101,131,151,181,191,313,353,373,383,727,757,787,

/*ID:cm750621LANG:CTASK:numtri*/#includelong max(long a,long b){ if(a>b) return a; else return b;}long a[1000][1000];int main(){ freopen("numtri.in","r",stdin); freope

/*ID: cm750621PROG: milk3LANG: C++*/#include#includeint a,b,c,ans[500],n;short may[30][30][30];int dfs(int a1,int b1,int c1){ if(may[a1][b1][c1]) return 0; if(a1+b1+c1!=c){ printf("Erro

/*ID: cm750621PROG: ariprogLANG: C++*/#include#includeconst int N=200010;int vis[N],s[N];int main(){ freopen("ariprog.in","r",stdin); freopen("ariprog.out","w",stdout); int i,j,k,

/*ID:cm750621LANG: C++TASK: skidesign*/#include #include int n,a[1010],money[100];int main(){ freopen("skidesign.in","r",stdin); freopen("skidesign.out","w",stdout); int i,j,k,m,sum,ans=100

首先写了个暴力，结果没过。/*ID: cm750621PROG: subsetLANG: C++*/#include #include #include #include #include using namespace std;const int size=10010;int i,j,k,m,n,ans;void bfs(int sum,int num){