m0_62781686的博客

#include<stdio.h>int main(){ int i = 0, j = 1; int n; int k; scanf("%d", &n); int sum=0; if(n==1){ k=1; printf("%d",k); } else{ k=2; while (1) { sum = i + j; i = j; j = sum; if (sum >= n) {.

先打印上面n+1/2行再打剩余的include<stdio.h>int main(){ int i, j, k，n； scanf("%d", &n); for (i = 0; i < (n + 1) / 2; i++) { for (j = 0; j <2 * (n / 2) - 2 * i; j++) { printf(" "); }for (k = 0; k <= 2 * i; k

一次循环搞定，输入矩阵同时判断是否满足条件，满足即累加，最后求和。变量定义矩阵是非法的但PTA中是对的#include<stdio.h>int main(){ int m=0，sum=0，i，j； scanf("%d", &m); int a[m][m]; for (i = 0; i < m; i++) { for (j = 0; j < m; j++) { scanf("%d", &a[

如果每次都累加二倍高度就很简单啦，但初始高度只有一个，可以考虑将sum赋值为初始高度相反数再累加二倍高度#include<stdio.h>int main(){ float h; int n; double sum; scanf("%f%d", &h, &n); if (n == 0) { printf("0.0 0.0"); return 0; } else { sum