摘要:
算法一:暴力求解(效率不够) #include <stdio.h> int main() { int a = 0; int b = 0; scanf("%d %d", &a, &b); int min = a < b ? a : b; while (1) { if ((a % min == 0) & 阅读全文
摘要:
斐波那契数列:1 1 2 3 5 8 13 21 ... 规律: 从第三个数开始,第n个数为前两数之和 #include <stdio.h> int main() { int n = 0; scanf("%d", &n); int a = 1; int b = 1; int c = 1; while 阅读全文