栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 软件开发 > 后端开发 > C/C++/C#

C ——程序设计题

C/C++/C# 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

C ——程序设计题

#include
#include
int main()
{
 double a,b,c,t,x,y;
 scanf("%lf %lf %lf",&a,&b,&c);
 t=b*b-4*a*c;
 if(a!=0 && t>0){
  x=1.0*(-b+sqrt(t))/(2*a);
  y=1.0*(-b-sqrt(t))/(2*a);
  printf("%.2fn",x);
  printf("%.2fn",y);
 }else if(a!=0 && t==0){
  x=(-b)/(2*a);
  printf("%.2f",x);
 }else if(a!=0 && t<0){
  x=1.0*(-b)/(2*a);
  y=1.0*sqrt(-t)/(2*a);
     if( x!= 0){
  printf("%.2f+%.2fin",x,y);
  printf("%.2f-%.2fin",x,y);
       }else{
        printf("0.00+%.2fin",y);
      printf("0.00-%.2fin",y);
    }
 }else if(a==0 && b==0 && c==0){
  printf("Zero Equation");
 }else if(a==0 && b==0 && c!=0){
  printf("Not An Equation");
 }else{
  x=-1.0*(c/b);
  printf("%.2f",x);
 }
 return 0;
 } 
 
#include
#include
int main()
{
	int i,n,total=0,score,max,min;
	double average;
	char *p;
	
	printf("Enter n:");
	scanf("%d",&n);
	
	if((p=(int *)calloc(n,sizeof(int)))==NULL){
		printf("Not able to allocate memorry.n");
		exit(1);
	}
	printf("Enter %d score ",n);                
	
	for(i=0;imax){
			max=*(p+i);
		}
		else if(*(p+i) 
#include 
#define MAXN 10

struct student{
    int num;
    char name[20];
    int score;
    char grade;
};

int set_grade( struct student *p, int n );

int main()
{   struct student stu[MAXN], *ptr;
    int n, i, count;

    ptr = stu;
    scanf("%dn", &n);
    for(i = 0; i < n; i++){
       scanf("%d%s%d", &stu[i].num, stu[i].name, &stu[i].score);
    } 
   count = set_grade(ptr, n);
   printf("The count for failed (<60): %dn", count);
   printf("The grades:n"); 
   for(i = 0; i < n; i++)
       printf("%d %s %cn", stu[i].num, stu[i].name, stu[i].grade);
    return 0;
}
int set_grade( struct student *p, int n )
{
    int i, count=0;
    struct student;
    for(i=0; i= 85){
            p[i].grade = 'A';
        }else if(p[i].score >= 70){
            p[i].grade = 'B';
        }else if(p[i].score >= 60){
            p[i].grade = 'C';
        }else {
            p[i].grade = 'D';
            count++;
        }
    }
    return count;
}
#include
int main()
{
	int i,year,month,day,lastday,sum=0,Final;
	int a[11]={31,28,31,30,31,30,31,31,30,31,30,31};

	scanf("%d %d %d",&year,&month,&day);
	if(year%4==0&&year%100!=0||year%400==0){
		lastday=366;
		a[1]=29;
	}else{
		lastday=365;
	}
	for(i=0;i 

转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/347150.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号