1 #define _CRT_SECURE_NO_WARNINGS 1
2 #include <stdlib.h>
3 #include <stdio.h>
4 #include <string.h>
5 int main()
6 {
7 int t = 0;
8 while (printf("*"))
9 {
10 t++;
11 if (t < 3) break;
12 }
13 system("pause");
14 return 0;
15 }
16
17 int main()
18 {
19 char a[20] = "cehiknqtw";
20 char s[] = "fbla";
21 int i, k, j;
22 for (k = 0; s[k] != '\0'; k++)
23 {
24 j = 0;
25 while (s[k] >= a[j] && a[j] != '\0') j++;
26 for (i = j; i <=strlen(a)+k; i++)
27 {
28 a[i] = a[i + 1];
29 }
30 s[j] = s[k];
31 }
32 puts(a);
33 system("pause");
34 return 0;
35 }
36
37 int main()
38 {
39 char s[80], c1, c2 = ' ';
40 int i = 0, num = 0;
41 gets(s);
42 while (s[i] != '\0')
43 {
44 c1 = s[i];
45 if (c1 != ' '&&c2 == ' ') num++;
46 i++;
47 c2 = c1;
48 }
49 printf("There are %d words.\n", num);
50 system("pause");
51 return 0;
52 }
53
54 int main()
55 {
56 char a[] = "acegikm";
57 char b[] = "bdfhjlnpq";
58 char c[80], *p;
59 int i = 0, j = 0, k = 0;
60 while (a[i] != '\0'&&b[j] != '\0')
61 {
62 if (a[i] < b[j])
63 {
64 c[k] = b[j];
65 i++;
66 }
67 else{
68 c[k] = a[i];
69 j++;
70 }
71 k++;
72 c[k] = '\0';
73 if (a[i] == '\0') p = b + j;
74 else p = a + i;
75 strcat(c, p);
76 puts(c);
77 system("pause");
78 return 0;
79 }
80 }
81
82 int main()
83 {
84 char s[80];
85 int i, j;
86 gets(s);
87 for (i = j = 0; s[i] != '\0'; i++)
88 {
89 if (s[i] != 'c') s[j++] = s[i];
90 s[j] = '\0';
91 }
92 puts(s);
93 system("pause");
94 return 0;
95 }
96
97 int main()
98 {
99 int a = 100, x = 10, y = 20, ok1 = 5, ok2 = 0;
100 if (x < y)
101 {
102 if (y != 10)
103 {
104 if (!ok1)
105 {
106 a = 1;
107 }
108 else {
109 if (ok2)
110 {
111 a = 10;
112 }
113 a = -1;
114 }
115 }
116 }
117 printf("%d\n", a);
118 system("pause");
119 return 0;
120 }
121
122 int main()
123 {
124 char *s1, *s2;
125 printf("\n*s1=%15s*", "chinabeijing");
126 printf("\n*s2=%-5s*", "chi");
127 system("pause");
128 return 0;
129 }
130
131 int main()
132 {
133 int a = -2;
134 printf("%81x", a);
135 system("pause");
136 return 0;
137 }
138
139 int main()
140 {
141 long y = 23456;
142 printf("y = %31x\n", y);
143 printf("y = %81x\n", y);
144 printf("y = %#81x\n", y);
145 system("pause");
146 return 0;
147 }
148
149 int main()
150 {
151 int x, y, z;
152 scanf("%d%d%d", &x, &y, &z);
153 printf("x+y+z=%d\n", x + y + z);
154 system("pause");
155 return 0;
156 }
157
158 //从键盘输入一个字符串a,并在字符串中的最大的元素后边另外输入字符串b
159 int main()
160 {
161 char a[80], b[] = "ab", max;
162 int i = 1, j;
163 printf("input a string:>");
164 gets(a);
165 puts(a);
166 max = a[0];
167 while (a[i])
168 {
169 if (a[i] > max)
170 {
171 max = a[i];
172 j = i;
173 }
174 i++;
175 }
176 for (i = strlen(a) + strlen(b) - 1; i > j; i--)
177 {
178 a[i] = a[i - strlen(b)];
179 }
180 j = 0;
181 i++;
182 while (b[j])
183 {
184 a[i] = b[j];
185 i++;
186 j++;
187 }
188 puts(a);
189 system("pause");
190 return 0;
191 }
192
193 //从键盘输入两个字符串a和b,不用库函数,把b的前五个字符连接到字符串a中,若b的长度小于5,
194 //则把b中所有元素连接到a中
195 int main()
196 {
197 char a[80], b[80];
198 int i = 0, j;
199 printf("input two strings:>");
200 gets(a);
201 gets(b);
202 while (a[i]) i++;
203 for (j = 0; j < 5 && b[j]; j++)
204 {
205 a[i++] = b[j];
206 }
207 a[i] = '\0';
208 puts(a);
209 system("pause");
210 return 0;
211 }
212
213 //从键盘输入一个整数,用折半法查找该数在10个有序整型数组a中的位置,若不在a中则打印相关信息
214 int main()
215 {
216 int a[10] = { 1, 3, 5, 7, 9, 11, 13, 15, 17, 19 }, top, bot, mid, m;
217 printf("enter a integer:>");
218 scanf("%d", &m);
219 top = 0, bot = 9;
220 while (top <= bot)
221 {
222 mid = (top + bot) / 2;
223 if (a[mid] == m) break;
224 else if (a[mid] > m) top = mid + 1;
225 else bot = mid - 1;
226 }
227 if (top <= bot) printf("found!position is %d.\n", mid);
228 else printf("not found %d.\n", m);
229 system("pause");
230 return 0;
231 }
232
233 //数组a包括10个整数,把a中所有的后项÷前项的商取整=b,按照每行3个元素输出数组b
234 #define N 10
235 int main()
236 {
237 int a[N], b[N], i;
238 printf("enter %d integer data:> ",N);
239 //从键盘上输入10个整数
240 for (i = 0; i < N; i++)
241 {
242 scanf("%d", &a[i]);
243 }
244 //把a中所有的后项÷前项的商取整=b
245 for (i = 1; i < N; i++)
246 {
247 b[i] = a[i] / a[i - 1];
248 }
249 //按照每行3个元素输出数组b
250 for (i = 1; i < N; i++)
251 {
252 printf("%3d", b[i]);
253 if (i % 3 == 0) printf("\n");
254 }
255 system("pause");
256 return 0;
257 }
258
259
260 //循环一个5×5的二维数组,赋值1-25的自然数,输出数组的左下半三角
261 int main()
262 {
263 int a[5][5], i, j, n = 1;
264 //循环一个5×5的二维数组
265 for (i = 0; i < 5; i++)
266 {
267 for (j = 0; j < 5; j++)
268 {
269 //赋值1-25的自然数
270 a[i][j] = n++;
271 }
272 }
273 printf("the result is:>\n");
274 //输出数组的左下半三角的值
275 for (i = 0; i < 5; i++)
276 {
277 for (j = 0; j < 5; j++)
278 {
279 printf("%4d", a[i][j]);
280 }
281 printf("\n");
282 }
283 system("pause");
284 return 0;
285 }
286
287 //通过赋初值按照行的顺序为一个2×3的二维数组赋值2 4 6……等偶数,按列的顺序输出该数组
288 int main()
289 {
290 int i, j, a[2][3] = { { 2, 4, 6 }, { 8, 10, 12 } };
291 printf("\n the result is:>\n");
292 //行
293 for (i = 0; i < 3; i++)
294 {
295 //列
296 for (j = 0; j < 2; j++)
297 {
298 //以列的顺序输出
299 printf("%4d", a[j][i]);
300 }
301 //换行
302 printf("\n");
303 }
304 system("pause");
305 return 0;
306 }
307
308 int main()
309 {
310 char a[20] = "ab", b[20] = "cdef";
311 int k = 0;
312 strcat(a, b);//字符串追加
313 while (a[k] != '\0')
314 {
315 b[k] = a[k];
316 k++;
317 }
318 puts(b);
319 system("pause");
320 return 0;
321 }
322
323 typedef struct stu{
324 char name[10];
325 char gender;
326 int score;
327 }STU;
328 void f(STU a, STU *b)
329 {
330 *b = a;
331 printf("%s,%c,%d", b->name, b->gender, b->score);
332 }
333 int main()
334 {
335 STU a = { "Zhao", 'm', 290 }, b = { "Qian", 'f', 350 };
336 f(a, &b);
337 printf("%s,%c,%d\n", b.name, b.gender, b.score);
338 system("pause");
339 return 0;
340 }
341
342 struct person{
343 char name[20];
344 int age;
345 };
346 int main()
347 {
348 struct person room[2] = { { "Wang", 19 }, { "Li", 20 } };
349 printf("%s:%d\n", (room + 1)->name, room->age);
350 system("pause");
351 return 0;
352 }
353
354 struct S{
355 int x, y;
356 };
357 int main()
358 {
359 struct S data[3] = { 4, 3, 2, 0, 8, 1 };
360 int i;
361 for (i = 0; i < 3; i++)
362 {
363 printf("%d%d;", data[i].x, data[i].y >> 1);
364 }
365 printf("\n");
366 system("pause");
367 return 0;
368 }
369
370 typedef struct stu{
371 char name[10];
372 char gender;
373 int score;
374 }STU;
375 void f(STU a, STU *b)
376 {
377 a = *b;
378 printf("%s,%c,%d", a.name, a.gender, a.score);
379 }
380 int main()
381 {
382 STU a = { "Zhao", 'm', 290 }, b = { "Qian", 'f', 350 };
383 f(a, &b);
384 printf("%s,%c,%d\n", a.name, a.gender, a.score);
385 system("pause");
386 return 0;
387 }
388
389 int main()
390 {
391 int i = 4;
392 for (printf("%d", i); i < 2; i++) printf("%d", i);
393 printf("\n");
394 system("pause");
395 return 0;
396 }
397
398 int main()
399 {
400 int k;
401 for (k = 2; k == 0;) printf("%d", k--);
402 system("pause");
403 return 0;
404 }
405
406 int k = 5;
407 void f(int *s)
408 {
409 s = &k;
410 *s = 7;
411 }
412 int main()
413 {
414 int m = 3;
415 f(&m);
416 printf("%d,%d\n", m, k);
417 system("pause");
418 return 0;
419 }
420
421
422 void fun(int a[], int n)
423 {
424 int i;
425 for (i = 0; i < n; i++)
426 {
427 if (i % 3 == 0)
428 a[i] -= n;
429 else
430 a[i] += n;
431 }
432 }
433 int main()
434 {
435 int c[5] = { 6, 7, 8, 9, 10 }, i;
436 fun(c, 5);
437 for (i = 0; i < 5; i++) printf("%d,", c[i]);
438 printf("\n");
439 system("pause");
440 return 0;
441 }
442
443 int main()
444 {
445 int x[] = { 8, 2, 6, 12, 5, 15 },f1,f2;
446 int *p = x;
447 f1 = f2 = x[0];
448 for (; p <= x + 5; p++)
449 {
450 if (f1 < *p) f1 = *p;
451 if (f2>*p) f2 = *p;
452 }
453 printf("%d,%d\n", f1, f2);
454 system("pause");
455 return 0;
456 }
457
458 int main()
459 {
460 int x[3][4] = { 1, 3, 5, 7, 9, 11, 2, 4, 6, 8, 10, 12 };
461 int(*p)[4] = x, k = 1, m, n = 0;
462 for (m = 0; m < 2; m++)
463 {
464 n += *(*(p + m) + k);
465 }
466 printf("%d\n", n);
467 system("pause");
468 return 0;
469 }