Cherry_jim的博客

#include<stdio.h>#include<stdlib.h>int main(){ int i = 0; int count = 0; for (i = 0; i < 100; i++) { if (i % 10 == 9) { count++; ...

#include<stdio.h>int main(){ int i = 0; int flag = 1; double sum = 0.0; for (i = 1; i <= 100; i++) { sum = sum + flag * 1.0 / i; flag = -flag; ...

#include<stdio.h>int main(){ int arr1[] = { 1, 2, 3, 4, 5, 6, 7 }; int arr2[]= { 5, 6, 1, 11, 76, 8, 0 }; int num = sizeof(arr1) / sizeof(arr1[0]); int i; for (i = 0;...

#include<stdio.h>int main(){ int a = 24; int b = 18; int tmp; while(tmp = a % b) { a = b; b = tmp; } pr...

#include<stdio.h>void Swap(int * px, int * py){ int tmp = 0; tmp = *px; *px = *py; *py = tmp;}int main(){ int a = 1; int b = 2; int c = 3; if(a < b) ...

法一：#include<stdio.h>int main(){ int a = 21; int b = 13; int tmp = a; a = b; b = tmp; return 0;}法二：#include<stdio.h>void Swap(int * px, int * py){...

#include<stdio.h>#include<stdlib.h>#include<time.h>void menu(){ printf("---------------------------------------------------------------\n"); printf("-----------...

（1）二分查找算法： 首先，假设表中元素是按升序排列，将表中间位置记录的关键字与查找关键字比较，如果两者相等，则查找成功；否则利用中间位置记录将表分成前、后两个子表，如果中间位置记录的关键字大于查找关键字，则进一步查找前一子表，否则进一步查找后一子表。重复以上过程，直到找到满足条件的记录，使查找成功，或直到子表不存在为止，此时查找不成功。（2）实现二分查找，须满足： 必须采...

非递归方式：#include<stdio.h>int factorial(int n){ int i; int count = 1; for(i = 1; i <= n; i++) { count = count * i; } return c...

递归方式：#include<stdio.h>int factorial(int n){ if(n == 1) return 1; else return n * factorial(n-1);}int main(){ int n = 10; ...

#include <stdio.h>int main(){ char arr1[10]={0}; int i; for(i = 0; i < 3; i++) { printf("please enter your password:\n"); sc...

#include <stdio.h>#include<string.h>int main(){ char arr1[]={"Cherry is a beauty"}; char arr2[]={"******************"}; int left = 0; int right = strlen...

电脑在1分钟后开始关机。若输入“Cherry is the most beautiful”，则取消关机。#include<stdio.h>int main(){ char input[50] = {0}; system("shutdown -s -t 60"); while(1) { ...

首先判断是否满足构成一元二次方程组的条件，其次判断是实根还是虚根，最后求出根的大小。#include<stdio.h>#include<math.h>int main(){ float a, b, c; float i, j; float root1, root2; float t; ...

//建立两个数组，让第一个数组的内容以此与第二个数组的内容比较。#include<stdio.h>int main(){ int arr1[]={1,2,3,4,5,6,7,8}; int arr2[]={9,10,11,26}; int count = 0; int i; for(i=0; i &...

#include<stdio.h>int main(){ int i; for(i = 1; i <= 100 ;i++) { if (i % 2 != 0) printf("%d ", i); } printf...

#include<stdio.h>int main(){ int x,y; scanf("%d",&x); if(x > 0) y = 1; else if(x == 0) y = 0; else ...

#include<stdio.h>int main(){ int i = 0; int j = 0; for(i = 100; i <= 200; i++) { for(j = 2; j < i; j++) { if(i % j == 0) brea...

#include<stdio.h>int main(){ int i = 0; int j = 0; for(i = 1; i < 10; i++) { for(j = 1; j <= i; j++) printf("%d * %d = %d \t", j, i, i*j); pr...

#include<stdio.h>int main(){ int year = 0; for(year = 1000; year <= 2000; year++) { if( ((year % 4 == 0) && (year % 100 != 0)) || (year % 400 == 0) ) ...