C例子.docx

1、C例子1.将字符串倒置：abcdef 输出结果 fedcba 代码行数15 1 #include 2 int main (void) 3 4 char a10 = abcdef, b10; 5 int i; 6 for (i = 5; i = 0; i-) 7 8 b5 - i = ai; 9 10 b6 = 0; 11 printf (%sn, b); 12 return 0; 13 2.写一函数计算 1-3+5-7+-101代码行数12 1 #include 2 int main (void) 3 4 int i, result = 0; 5 for (i = 1; 2 * i - 1 1

2、02; i+) 6 if (i % 2 != 0) 7 result = result + (2 * i - 1); 8 else 9 result = result - (2 * i - 1); 10 printf (result= %dn, result); 11 return 0; 12 3.将一个整数(0x99999)的每位数取出，并反置ex:24163 输入36142 1 #include 2 int main (void) 3 4 int n, s; 5 printf (Enter your number(x0):n); 6 scanf (%d, &n); 7 8 while (n

3、 != 0) 9 10 s = n % 10; 11 printf (%d, s); 12 n = n / 10; 13 14 printf (n); 15 return 0; 16 4.输入两个整数，算出它们的最大公约数和最小公倍数 1 #include 2 void gcd (int u, int v) 3 4 int temp; 5 printf (The gcd of %d and %d is , u, v); 6 7 while (v != 0) 8 9 temp = u % v; 10 u = v; 11 v = temp; 12 13 printf (%dn, u); 14 15

4、 16 int lcm (int u, int v) 17 18 printf (The lcm of %d and %d is , u, v); 19 int s, h, temp; 20 h = u * v; 21 while (v != 0) 22 23 temp = u % v; 24 u = v; 25 v = temp; 26 27 28 if (u 0 | v 0) 29 return 0; 30 else 31 s = h / u; 32 printf (%dn, s); 33 34 35 int main () 36 37 int a, b; 38 printf (Pleas

5、e input two number:n); 39 scanf (%d %d, &a, &b); 40 gcd (a, b); 41 lcm (a, b); 42 return 0; 43 5.写一函数算出1N之间的所有质数 1 #include 2 int main () 3 4 int p, d, a; 5 _Bool i; 6 printf (Please input a number:n); 7 scanf (%d, &a); 8 9 for (p = 2; p = a; p+) 10 11 i = 1; 12 for (d = 2; d p; d+) 13 if (p % d = 0

6、) 14 i = 0; 15 if (i != 0) 16 printf (%d , p); 17 18 printf (n); 19 return 0; 20 6.跑马灯 1 #include 2 int 3 main (int argc, char *argv) 4 5 char *a; 6 a = argv1; 7 int i, n, m, x; /i为数组元素号，n为行数,m为空格 8 for (x = 0; 1 10; x+) 9 10 for (n = 1; n 45; n+) /长度75根据命令行的长度修改 11 12 for (m = 1; m 45 - n; m+) 13 1

7、4 printf ( ); 15 16 printf (%sn, a); 17 for (i = 0; i 100000000; i+); 18 system (clear); 19 20 21 return 0; 22 7.单链表 1 #include 2 #include 3 void add (); 4 void del (); 5 struct aa 6 7 int score; 8 char name20; 9 struct aa *next; 10 *head; 11 typedef struct aa s_date; 12 s_date *q, *p; 13 int i, n;

8、14 int main () 15 16 char dd; 17 printf (输入链元素的个数:n); 18 scanf (%d, &n); 19 head = (s_date *) malloc (sizeof (s_date); 20 p = head; 21 for (i = 0; i name); 26 printf (请输入成绩：n); 27 scanf (%d, &p-score); 28 p-next = q; 29 p = q; 30 31 p = head; 32 do 33 34 printf (查看链表-ln); 35 printf (删除链表-dn); 36 pri

9、ntf (增加链表-an); 37 printf (退出-q); 38 printf (n); 39 dd = getchar (); 40 scanf (%c, &dd); 41 switch (dd) 42 43 case l: 44 p = head; 45 printf (名字 成绩n); 46 printf (-n); 47 while (p-next != NULL) 48 49 printf (%st%dn, p-name, p-score); 50 p = p-next; 51 52 break; 53 case d: 54 del (); 55 break; 56 case

10、a: 57 add (); 58 break; 59 case q: 60 break; 61 default: 62 printf (你的选择有误：n); 63 break; 64 65 66 while (dd != q); 67 return 0; 68 69 70 void del () 71 72 printf (请输入要删除的行数：n); 73 scanf (%d, &n); 74 p = head; 75 if (n = 1) 76 head = head-next; 77 else 78 79 for (i = 1; i next; 81 p-next = p-next-nex

11、t; 82 83 p = head; 84 85 86 void add () 87 88 q = (s_date *) malloc (sizeof (s_date); 89 printf (请输入名字：n); 90 scanf (%s, q-name); 91 printf (请输入成绩：n); 92 scanf (%d, &q-score); 93 p = head; 94 q-next = p; 95 head = q; 96 p = head; 97 8.杨辉三角 1 #include 2 int main (void) 3 4 int a5050, kong, hang, i, j

12、; 5 printf (请输入三角形行数：); 6 scanf (%d, &hang); 7 for (i = 0; i hang; i+) 8 9 ai0 = 1; 10 aii = 1; 11 12 for (i = 2; i hang; i+) 13 14 for (j = 1; j i; j+) 15 aij = ai - 1j - 1 + ai - 1j; 16 17 for (i = 0; i hang; i+) 18 19 for (kong = i; kong hang; kong+) 20 printf (%-3c, ); 21 for (j = 0; j = i; j+)

13、22 printf (%-6d, aij); 23 printf (n); 24 25 return 0; 26 9.加密 1 #include 2 int encode (int); /* 加密函数 */ 3 int decode (int); /* 解密函数 */ 4 5 int main (void) 6 7 int pwd; 8 9 printf (请输入密码：); 10 scanf (%d, &pwd); 11 pwd = encode (pwd); 12 printf (加密后：%dn, pwd); 13 pwd = decode (pwd); 14 printf (解密后：%dn

14、, pwd); 15 16 return 0; 17 18 19 /* 引 数：未加密的密码 */ 20 /* 返回值：加密后的密码 */ 21 int encode (int pwd) 22 23 int i; 24 union 25 26 int num; 27 char csizeof (int); 28 u1; 29 30 u1.num = pwd; 31 32 for (i = 0; i sizeof (int); i+) 33 34 u1.ci += 32; 35 printf (%dn, u1.num); 36 printf (%dn, u1.ci); 37 38 39 retu

15、rn u1.num; 40 41 42 /* 引 数：加密过的密码 */ 43 /* 返回值：还原后的密码 */ 44 int decode (int pwd) 45 46 int i; 47 union 48 49 int num; 50 char csizeof (int); 51 u1; 52 53 u1.num = pwd; 54 55 for (i = 0; i sizeof (int); i+) 56 u1.ci -= 32; 57 58 return u1.num; 59 10./*输出如下： 1 1 2 1 2 3*/ 1 #include 2 3 int main () 4

16、5 int i, j; 6 for (i = 1; i 10; i+) 7 8 for (j = 1; j = i; j+) 9 printf (%d , j); 10 11 printf (n); 12 13 11.菱形 1 #include 2 3 int main (void) 4 5 int kong, xing, hang, i; 6 printf (Please type a number:n); 7 scanf (%d, &hang); 8 9 for (i = 1; i = hang; i+) 10 11 for (kong = 0; kong hang - i; kong+)

17、 12 printf ( ); 13 14 for (xing = 0; xing 2 * i - 1; xing+) 15 printf (*); 16 17 printf (n); 18 19 20 for (i = 1; i = hang; i+) 21 22 for (kong = 0; kong i; kong+) 23 printf ( ); 24 25 for (xing = 0; xing 2 * (hang - i) - 1; xing+) 26 printf (*); 27 28 printf (n); 29 30 12.九九乘法表 1 #include 2 int 3 m

18、ain () 4 5 int i, j; 6 for (i = 1; i 10; i+) 7 8 for (j = 1; j = i; j+) 9 printf (%dx%d=%d , i, j, i * j); 10 11 printf (n); 12 13 13/示例：malloc()与free()/动态分配内存地址 1 #include 2 #include 3 4 int main (void) 5 6 struct student 7 8 char name20; 9 int score; 10 struct student *next; 11 ; 12 typedef struct

19、 student s_data; 13 s_data *new_student; 14 15 new_student = (s_data *) malloc (sizeof (s_data); 16 17 if (new_student = NULL) 18 puts (内存分配失败！); 19 else 20 21 printf (姓名：); 22 scanf (%s, new_student-name); 23 printf (成绩：); 24 scanf (%d, &new_student-score); 25 new_student-next = NULL; 26 27 28 prin

20、tf (姓名：%st成绩：%dn, new_student-name, 29 new_student-score); 30 free (new_student); 31 32 return 0; 33 14.冒泡排序 1 #include 2 void swap (int *i, int *j) 3 4 int temp; 5 temp = *i; 6 *i = *j; 7 *j = temp; 8 9 10 void Paixu (int *arr, int length) 11 12 int i, j; 13 for (i = 0; i length; i+) 14 15 for (j =

21、 0; j arrj + 1) 18 swap (&arrj, &arrj + 1); 19 20 21 22 23 int main (void) 24 25 int num = 23, 24, 56, 16, 4, 12, 46, 5, 45, 51 ; 26 int i; 27 28 puts (排序：); 29 for (i = 0; i 10; i+) 30 printf (%d , numi); 31 32 Paixu (num, 10); 33 34 puts (n排序后：); 35 for (i = 0; i 10; i+) 36 printf (%d , numi); 37

22、printf (n); 38 39 return 0; 40 15.判断是否为润年 1 #include 2 3 int main () 4 5 int year, rem4, rem100, rem400; 6 printf (请输入一个年份如2004：n); 7 scanf (%d, &year); 8 9 rem4 = year % 4; 10 rem100 = year % 100; 11 rem400 = year % 400; 12 13 if (rem4 = 0 & rem100 != 0) | rem400 = 0) 14 printf (这是一个润年。n); 15 else

23、16 printf (这不是润年n); 17 return 0; 18 16.示例：枚举类型 1 #include 2 3 int main (void) 4 5 enum colors 6 RED = 1, ORANGE, YELLOW, GREEN, BLUE, INDIGO, PURPLE ; 7 8 char *color_name = 9 未定义!, 红, 橙, 黄, 绿, 蓝, 靛, 紫 ; 10 int i; 11 12 for (i = 0; i = PURPLE; i+) 13 printf (%dt%sn, i, color_namei); 14 15 return 0;

24、16 17.递归求阶乘 1 #include 2 3 int jiecheng (int n) 4 5 if (n 1) 6 return n * jiecheng (n - 1); 7 else 8 return 1; 9 10 11 int main () 12 13 int n, s; 14 printf (请输入数值求阶乘：n); 15 scanf (%d, &n); 16 s = jiecheng (n); 17 printf (%d!=%dn, n, s); 18 return 0; 19 18.简单的makefile 1 out:main.o otherobj.o 2 gcc -

25、o out main.o otherobj.o 3 mani.o:main.c main.h 4 gcc -o main.o -c main.c 5 otherobj.o:otherobj.c otherobj.h 6 gcc -o otherobj.o -c otherobj.c 7 clean: 8 rm *.o out19.单链表的建立与查询 1 #include 2 #include 3 main() 4 5 int i,m; 6 struct student 7 8 char name20; 9 int score; 10 struct student *next; 11 *head,*p,*q; 12 head=(struct student *)malloc(sizeof(struct student); 13 p=head; 14 printf(input hangshu:); 15 scanf(%d,&m); 16 for(i=0;iname); 21 printf(score:); 22 scanf(%d,&p-score);