实验1

实验1

#include int main() { printf(" O \n"); printf("\n"); printf("I I\n"); return 0; } #include int main() { printf(" O \n"); printf("\n"); printf("I I\n"); printf(" O \n"); printf("\n"); printf("I I\n"); return 0; }

运行过程

 

实验2

#include int main() { double a, b, c; scanf("%lf%lf%lf", &a, &b, &c); if((a+b>c)&&(b+c>a)&&(a+c>b)) printf("能构成三角形\n"); else printf("不能构成三角形\n"); return 0; }

 运行过程

 

 

实验3

#include int main() { char ans1, ans2; printf("每次课前认真预习、课后及时复习了没? (输入y或Y表示有,输入n或N表示没有) :"); ans1 = getchar(); getchar(); printf("\n动手敲代码实践了没? (输入y或Y表示敲了,输入n或N表示木有敲) : "); ans2 = getchar(); if ((ans1=='y'||ans1=='Y') && (ans2 == 'y' ||ans2== 'Y')) printf("\n罗马不是一天建成的, 继续保持哦:)\n"); else printf("\n罗马不是一天毁灭的, 我们来建设吧\n"); return 0; }

运行过程

实验4

 

#include int main() { double x, y; char c1, c2, c3; int a1, a2, a3; scanf("%d\n%d\n%d\n", &a1, &a2, &a3); printf("a1 = %d, a2 = %d, a3 = %d\n", a1,a2,a3); scanf("%c%c%c", &c1, &c2, &c3); printf("c1 = %c, c2 = %c, c3 = %c\n", c1, c2, c3); scanf("%lf\n%lf", &x, &y); printf("x = %lf, y = %lf\n",x, y); return 0; }

运行过程

实验5

 

#include int main() { int year; int theyear = 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10; year = theyear / 31536000; if (theyear % 31536000 >= 15768000) year++; printf("10亿秒约等于%d年\n", year); return 0; }

运行过程

实验6

 

#define _CRT_SECURE_NO_WARNINGS #include #include int main() { double x, ans; while (scanf("%lf", &x) != EOF) { ans = pow(x, 365); printf("%.2f的365次方: %.2f\n", x, ans); printf("\n"); } return 0; }

运行过程

实验7

 

#include using namespace std; int main() { double c, f; while (scanf("%lf", &c) != EOF) { f = c * 9 / 5; f = f + 32; printf("摄氏度c=%.2f时,华氏度f=%.2f",c,f); printf("\n"); } return 0; }

运行过程

实验8

 

#include #include int main() { int a, b, c; double s,area; while (scanf("%d %d %d", &a, &b, &c) != EOF) { s = ((double)(a + b + c)) / 2; area = sqrt(s * (s - a) * (s - b) * (s - c)); printf("a = %d,b = %d,c = %d,area = %.3lf\n\n", a, b, c, area); printf("\n"); } return 0; }

运行过程

 

posted @ 2024-09-25 22:37  hexu7  阅读(5)  评论(0编辑  收藏  举报