摘要：
#include<stdio.h>#define INF 100000000int main(){ FILE *fin,*fout; fin=fopen("data.in","rb"); fout=fopen("data.out","wb"); int x,n=0,mn=INF,mx=-INF,s=0; while(fscanf(fin,"%d",&x)==1) { s+=x; if(x>mx) mx=x; if(x<mn) mn=x; n++; } ... 阅读全文
摘要：
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;struct node{ int value; int no;}arr[1000];bool cmp(node x,node y){ return x.value<y.value;}int main(){ int n; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&arr[i].value) 阅读全文
摘要：
FILE *fp=fopen("data1.txt","r"); if(!fp) { printf("can't open file\n"); return -1; } while(!feof(fp)) { fscanf(fp,"%d %d %d",&x,&y,&z); } FILE *fp1=fopen("data2.txt","w+"); fprintf(fp1,"%d %d\n",x,y); #include<s 阅读全文
摘要：
View Code1#include<iostream>2#include<cstdio>3#include<cstring>4#include<cmath>5#include<algorithm>6usingnamespacestd;78constintmaxn=110;9inta[maxn][maxn];10intn,a1[maxn],a2[maxn];11inlineintfab(intx)12{13returnx>0?x:-x;14}15inlinevoidswap(int&x,int&y)16{17in 阅读全文
摘要：
View Code1/*2ID:wconvey3PROG:barn14LANG:C++56*/7#include<iostream>8#include<cstdio>9#include<algorithm>10usingnamespacestd;11structmode12{13inta;14boolflag;15}arr[210];16structnode17{18inta;19intno;20}b[210];21intcmp1(modex,modey)22{23returnx.a<y.a;24}25intcmp(nodex,nodey)26{27r 阅读全文
摘要：
View Code1#include<iostream>2#include<cstdio>3usingnamespacestd;4intarr[1100],vis[1100];5intn,num;6voidbfs(intx)7{8if(x>n)9{10num++;11/*for(inti=1;i<=n;i++)//输出每一个错排12printf("%d",arr[i]);13printf("\n");*/14return;15}16for(inti=1;i<=n;i++)17{18if(vis[i]==0& 阅读全文
摘要：
http://202.197.224.59/OnlineJudge2/index.php/Problem/read/id/1144View Code1#include<iostream>2#include<cstdio>3#include<string.h>4usingnamespacestd;5chars[10000];6intmain()7{8intt;9scanf("%d",&t);10getchar();//!!!!!!11for(intk=1;k<=t;k++)12{13gets(s);14intlen=strle 阅读全文
摘要：
View Code1#include<iostream>2#include<cstdio>3usingnamespacestd;4intmain()5{6intn;7__int64arr[40];8while(scanf("%d",&n)!=EOF)9{10arr[n]=1;11for(inti=n-1;i>=1;i--)12arr[i]=2*arr[i+1]+2;13printf("%I64d\n",arr[1]);14}15system("pause");16return0;17 阅读全文
摘要：
View Code1#include<iostream>2#include<cstdio>3#include<algorithm>4usingnamespacestd;5intarr[3100];6intcmp(intx,inty)7{8returnx<y;9}10intmain()11{12intn;13while(scanf("%d",&n)!=EOF)14{15for(inti=1;i<=n;i++)16scanf("%d",&arr[i]);17sort(arr+1,arr+1+n, 阅读全文
摘要：
View Code1#include<iostream>2#include<cstdio>3#include<algorithm>4usingnamespacestd;5intcmp(intx,inty)6{7returnx<y;8}9intmain()10{11intC,arr[110];12scanf("%d",&C);13while(C--)14{15intn,v,w;16scanf("%d%d%d",&n,&v,&w);17for(inti=1;i<=n;i++)18 阅读全文