#include<stdio.h> long long func(int n); int main() { int n; long long f; while (scanf_s("%d", &n) != EOF) { f = func(n); printf("n=%d,f=%lld\n", n, f); } return 0; } long long func(int n) { if (n == 1) return 1; else { return func(n - 1) * 2 + 1; } }
#include<stdio.h> int func(int n, int m); int main() { int m, n; while (scanf_s("%d%d", &n, &m) != EOF) printf("n=%d,m=%d,ans=%d\n", n, m, func(n, m)); return 0; } int func(int a ,int b) { if (b == 0) return 1; else if (a == b) return 1; else if (a < b) return 0; else return func(a - 1, b) + func(a - 1, b - 1); }
#include<stdio.h> int mul(int, int); int main() { int m, n; while (scanf_s("%d%d", &n, &m) != EOF) printf("%d*%d=%d\n", n, m, mul(n, m)); return 0; } int mul(int a, int b) { if (b == 0) return 0; else if (b == 1) return a; else return a + mul(a, b - 1); }
#include<stdio.h> long long fac(int n); int main() { int i, n; printf("Enter n:"); scanf_s("%d", &n); for (i = 1; i <= n; ++i) printf("%d!=%lld\n", i, fac(i)); return 0; } long long fac(int n) { static long long p = 1; p = p * n; printf("p=%lld\n", p); return p; }
#include<stdio.h> #include<stdlib.h> void hanoi(unsigned int n, char from, char temp, char to); void moveplate(unsigned int n, char from, char to); int pow(int a , int b); int main() { unsigned int n; while (scanf_s("%u", &n) != EOF) { hanoi(n, 'A', 'B', 'C'); printf("\n一共移动了%d次\n\n", pow(2, n) - 1); } return 0; } void hanoi(unsigned int n, char from, char temp, char to) { if (n == 1) moveplate(n, from, to); else { hanoi(n - 1, from, to, temp); moveplate(n, from, to); hanoi(n - 1, temp,from, to); } } void moveplate(unsigned int n, char from, char to) { printf("%u: %c --> %c\n", n, from, to); } int pow(int a, int b) { if (b == 0) return 1; else return a * pow(a, b - 1); }
#include<stdio.h> #include<math.h> int is_prime(int); int main() { int i, a, b; for (i = 4; i <= 20; i += 2) { for (a = 2; a < i; a++) { if (is_prime(a) == 1 && is_prime(i - a) == 1) { printf("%d = %d + %d\n", i, a, i - a); break; } } } return 0; } int is_prime(int n) { int i, b = sqrt(1.0 * n); for (i = 2; i <= b; i++) if (n % i == 0) break; if (i <= b || n == 1 || n == 0) return 0; else return 1; }
#include <stdio.h> long fun(long s); int main() { long s, t; printf("Enter a number: "); while (scanf_s("%ld", &s) != EOF) { t = fun(s); printf("new number is: %ld\n\n", t); printf("Enter a number: "); } return 0; } long fun(long s) { int a = 0, i = 1; for (; s != 0; s = s / 10) if (s % 2 == 1) { a = a + (s - (s / 10) * 10) * i; i = i * 10; } return a; }
原文地址:http://www.cnblogs.com/6654wcx/p/16860960.html
1. 本站所有资源来源于用户上传和网络,如有侵权请邮件联系站长!
2. 分享目的仅供大家学习和交流,请务用于商业用途!
3. 如果你也有好源码或者教程,可以到用户中心发布,分享有积分奖励和额外收入!
4. 本站提供的源码、模板、插件等等其他资源,都不包含技术服务请大家谅解!
5. 如有链接无法下载、失效或广告,请联系管理员处理!
6. 本站资源售价只是赞助,收取费用仅维持本站的日常运营所需!
7. 如遇到加密压缩包,默认解压密码为"gltf",如遇到无法解压的请联系管理员!
8. 因为资源和程序源码均为可复制品,所以不支持任何理由的退款兑现,请斟酌后支付下载
声明:如果标题没有注明"已测试"或者"测试可用"等字样的资源源码均未经过站长测试.特别注意没有标注的源码不保证任何可用性