ZSS1753936255的博客

#include #include #include struct student{ char name[10]; int H;}Stu[10001];int cmp(const void *a,const void *b){ struct student *m=(struct student*)a; struct student *n=(struct stude

#include #include int find(int val,int B[],int num){ int i; for(i=0;i<num;i++) { if(val==B[i]) return 1; } return 0;}int cmp(const void *a,const void *b){ return *(int *)a-

#include #include #include int cmp(const void * a,const void * b){ return *(int *)a - *(int *)b ;}int main(){ int i,num,val,s,sum=0,count=0,A[10000],Hash[10000]={0}; scanf("%d",&num);

#include #include int main(){ int num,i,a,b,val; double sum=0,max=0; scanf("%d",&num); for(i=0;i<num;i++) { sum=0; scanf("%d%d",&a,&b); val=a*a+b*b; sum=(double)sqrt(val*1.0

#include int gcd(int a,int b){return b==0?a:gcd(b,a%b);}int main(){ int N,M,N1,M1,K,val,val1,count=0,i,A[1000]; double s,s1,max,min; scanf("%d/%d %d/%d %d",&N,&M,&N1,&M1,&K); val=gcd(N,M)

#include int main(){ int N,M,A[101],B[101],i,j,val,score=0; scanf("%d%d",&N,&M); for(i=0;i<M;i++) scanf("%d",&A[i]); for(i=0;i<M;i++) scanf("%d",&B[i]); for(i=0;i<N;i++) { score=

include struct mooncake{double store;double sell;double price;}cake[1010];int main(){ int n,i,j; double ans=0,D,temp,temp1,temp2; scanf("%d%lf",&n,&D); for(i=0;i<n;i++) scanf("%lf"

#include int main(){ int i,j,A[10],min=10; for(i=0;i10;i++) { scanf("%d",&A[i]); } for(i=1;i10;i++) { if(A[i]!=0&&i<min) { min=i; printf("%d",i); A[i]--;

#include int main(){ int num=0,i,Hash[256]={0},low;//num记录打出的字符个数 char str[100010],string[100010]; gets(str); gets(string); for(i=0;str[i]!='\0';i++)// 坏掉的那些键 { if(str[i]'Z'

#include int main(){ char str[10001],key[7]={'P','A','T','e','s','t'}; int i,A[7]={0}; gets(str); for(i=0;str[i]!='\0';i++) { if(str[i]==key[0]) A[0]++; else if(str[i]==key[1

#include int main(){ int num,i,team,number,score,j,sum=0,Hash[1001]={0},max=0; scanf("%d",&num); for(i=0;i<num;i++) { scanf("%d-%d %d",&team,&number,&score); Hash[team]+=

#include #include typedef struct{int a[100100];int top;}*Stack,SeqStack;int arr[10010];Stack init(){Stack ps=(Stack)malloc(sizeof(SeqStack));if(ps==NULL)return NULL;else{

#include #include typedef struct BiTNode{struct BiTNode*lchild,*rchild;int data;}*BiTree;#define maxn 100int n,post[maxn],in[maxn],pre[maxn];BiTree Create(int postL,int postR,int i

#include #include #define maxn 1010typedef struct TiNode{struct TiNode *lchild,*rchild;int data;}*BiTree;int origin[maxn],pre[maxn],prem[maxn],post[maxn],postm[maxn];int pre_n=0,

#include #include #include #define maxn 1010typedef struct BST{struct BST *lchild, *rchild;int data;}*Bst;int n,pre[maxn],in[maxn],post[maxn];Bst create(int preL,int preR,int inL,i

#include #define maxn 11struct node{int lchild,rchild;int data;}Node[maxn];int Hash[11]={0},n,m;int change(char c){if(c=='-')return -1;//没有孩子节点else{Hash[c-'0']=1;//同时标记出现了子

#include #include int main(){int i,j,n,sum=0,flag=0,lenB=0,lenC=0,K1=0,K2=0;char str[13][5]={"tret","jan","feb","mar","apr","may","jun","jly","aug","sep","oct","nov","dec"};char String[12]

#include #include #define maxn 31typedef struct Node{int data;int depth;struct Node*rchild,*lchild;}*node;struct array{int len;int d[10];}arr[maxn];int n,m,post[maxn],in[ma