#include<stdio.h> #include<stdlib.h> #include<time.h> #include<windows.h> #define N 80 void print_text(int line, int co1, char text[]); void print_spaces(int n); void print_blank_lines(int n); int main(){ int line, co1, i; char text[N] = "hi,April~"; srand(time(0)); for(i=1;i<=10;i++){ line=rand()%25; co1=rand()%80; print_text(line, co1,text); Sleep(1000); } return 0; } void print_spaces(int n){ int i; for(i=1;i<=n;i++) printf("\n"); } void print_blank_lines(int n){ int i; for(i=1;i<=n;i++) printf("\n"); } void print_text(int line, int co1, char text[]){ print_blank_lines(line-1); print_spaces(co1-1); printf("%s",text); }
隔一段距离打印一段特定文字
#include<stdio.h> long long fac(int n); int main(){ int i, n; printf("Enter n: "); scanf("%d", &n); for(i=1;i<=n;++i) printf("%d! = %11d\n",i,fac(i)); return 0; } long long fac(int n){ static long long p=1; p=p*n; printf("p=%11d\n",p); return p; }
#include<stdio.h> int func(int, int); int main(){ int k=4, m=1, p1, p2; p1=func(k, m); p2=func(k, m); printf("%d,%d\n",p1,p2); return 0; } int func(int a, int b){ static int m=0,i=2; i+=m+1; m=i+a+b; return m; }
一致的
static变量可以固定一个数值的变化后的量。
#include<stdio.h> long long func(int n); int main(){ int n; long long f; while(scanf("%d", &n)!=EOF){ f = func(n); printf("n=%d,f=%11d\n", n, f); } return 0; } long long func(int n){ int i; long long f = 1; for(i=1;i<=n;i++) f=2*f; return f-1; }
#include<stdio.h> int func(int n, int m); int main(){ int n,m; while(scanf("%d%d", &n, &m)!=EOF) printf("n=%d, m=%d, ans=%d\n",n, m, func(n,m)); return 0; } int func(int n,int m){ int ans; if (n < m) return 0; else if (n == m || m == 0) return 1; else { return func(n - 1, m - 1) + func(n - 1, m); } }
#include <stdio.h> double mypow(int x, int y); int main() { int x, y; double ans; while (scanf("%d%d", &x, &y) != EOF) { ans = mypow(x, y); printf("%d的%d次方: %g\n\n", x, y, ans); } return 0; } double mypow(int x, int y) { double ans=1; if (y >= 0) { for (int i =1; i <= y; i++) { ans = ans * x; } } else { for (int i = 1; i <= (-y); i++) { ans = ans / x; } } return ans; }
#include <stdio.h> #include <math.h> int mypow(int x,int y); int main() { int x, y; double ans; while(scanf("%d%d", &x, &y) != EOF) { ans = mypow(x, y); printf("%d的%d次方: %g\n\n", x,y,ans); } return 0; } int mypow(int x, int y){ int i; double s=1; if(y>0){ for(i=1;i<=y;i++) s=s*x; } else for(i=1;i<=(-y);i++) s=s/x; return(s); }
#include<stdio.h> void hanoi(int n,char from,char temp,char to); void moveplate(int n, char from, char to); int i=0; int main(){ int n, i=0; while(scanf("%u",&n)!=EOF) hanoi(n,'A','B','C'); printf("一共移动了%d次\n",i); return 0; } void hanoi(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(int n,char from, char to){ printf("%u:%c-->%c\n",n, from,to); }
#include <stdio.h> #include <math.h> int is_prime(int n); int main(){ int even; even = 1; for (even = 1; even < 21; even++) { for (int i = 1; i <= even / 2; i += 2) if (is_prime(i) && is_prime(even - i)) printf("%d=%d+%d\n", even, i, even - i); } return 0; } int is_prime(int n) { if (n == 1) return 0; int temp = (int)sqrt(n); for (int i = 2; i <= temp; i++) if (n % i == 0) return 0; return 1; }
#include<stdio.h> #include<math.h> long func(long s); int main(){ long s,t; printf("Enter a number: "); while(scanf("%ld", &s)!=EOF){ t=func(s); printf("new nuber is: %d\n\n", t); printf("Enter a number: "); } return 0; } long func(long s){ int d; long sl = 1; long t = 0; while (s > 0) { d = s % 10; if (d % 2 != 0) { t = d * sl + t; sl *= 10; } s /= 10; } return t; }
标签:return,int,long,char,实验,func,include From: https://www.cnblogs.com/chennana/p/17280920.html