2016年885考研真题编程题

#include
#include
FILE *in=fopen("Coefficent.txt","r+");
FILE *out=fopen("result.txt","w+");
void deal(int a,int b,int c);
void deal(int a,int b,int c,double x);
void deal(int a,int b,int c,double x1,double x2);
int main(){int a,b,c,a1,b1,c1;double x1,x2,disc;while((fscanf(in,"%d%d%d",&a1,&b1,&c1))!=EOF){a=a1;b=b1;c=c1;if((a!=0)&&(b!=0)){//ax*x+b*x+c或者a*x*x+b*x形式 disc=b*b-4*a*c;if(disc>0){x1=(-b-sqrt(disc))/(2*a);x2=(-b+sqrt(disc))/(2*a);deal(a,b,c,x1,x2);}else if(disc==0){x1=-b/(2*a);deal(a,b,c,x1); }else{deal(a,b,c);} }else if((a==0)&&(b!=0)){deal(a,b,c,-c/b);}else if((a!=0)&&(b==0)){if(a>0){deal(a,b,c,sqrt(a/c),-sqrt(a/c));}else{deal(a,b,c);}}else if((a==0)&&(b==0)){if(c==0){deal(a,b,c); }else{deal(a,b,c);}}}fclose(in);fclose(out);return 0;
}
void deal(int a,int b,int c){if(a==0&&b==0&&c==0){printf("a=%d\tb=%d\tc=%d时方程无穷解\n",a,b,c); }elseprintf("a=%d\tb=%d\tc=%d时方程无实数解\n",a,b,c);
}
void deal(int a,int b,int c,double x){printf("a=%d\tb=%d\tc=%d时方程具有单解x=%lf\n",a,b,c,x);fprintf(out,"%d\t%d\t%d\t%lf\n",a,b,c,x);
}
void deal(int a,int b,int c,double x1,double x2){printf("a=%d\tb=%d\tc=%d时方程具有双解x1=%lf\tx2=%lf\n",a,b,c,x1,x2);fprintf(out,"%d\t%d\t%d\t%lf\t%lf\n",a,b,c,x1,x2);
}

#include
#include
#define N 30
struct student{int no;//学号char name[20];//姓名double score[5];//分数double sum;//总分int rank;//排名
}stu[N],temp,kem;
int main(){int i,j,k;double sum;for(i=0;i}

2001 liu 85 85 85 76 100
2002 bao 90 90 90 90 90
2003 wang 100 100 100 100 70
2004 chen 70 100 80 90 60
2005 hu 100 50 100 90 100
2006 xu 70 90 90 90 90
2007 hua 10 10 10 10 10
2008 ma 20 20 20 20 20
2009 luo 30 30 30 30 30
2010 l1 40 40 40 40 40
2011 l2 50 50 50 50 50
2012 l3 60 60 60 60 60
2013 l4 70 70 70 70 70
2014 l5 80 80 80 80 80
2015 l6 90 90 90 90 90
2016 l7 40 40 40 40 40
2017 l8 50 50 50 50 50
2019 l9 60 60 60 60 60
2020 l10 70 70 70 70 70
2021 l11 80 80 80 80 80
2022 l12 90 90 90 90 90
2023 l13 40 40 40 40 40
2024 l14 50 50 50 50 50
2025 l15 60 60 60 60 60
2026 l41 70 70 70 70 70
2027 l51 80 80 80 80 80
2028 l61 90 90 90 90 90
2029 l52 80 80 80 80 80
2030 l62 90 90 90 90 90
2031 l62 90 90 90 90 90

#include
#include
int fun(int n,int k){if(n==k||k==0) return 1;else return fun(n-1,k-1)+fun(n-1,k);
}
int main(){int n,k;scanf("%d%d",&n,&k);int s=fun(n,k);printf("n=%d,k=%d时s=%d\n",n,k,s);return 0;
}