波风水门的博客

第一次尝试#include<stdio.h>//在32位系统下：//要拿出奇数位则需要&01010101010101010101010101010101 也就是十六进制的0x55555555//要拿出偶数位则需要&10101010101010101010101010101010 也就是十六进制的0xaaaaaaaa//最终将得到的结果相加也就是 |（或） 起来#define change(num) (((num) & 0x55555555) <&lt

第一次尝试#include<stdio.h>#include<stdlib.h>//方法1void FindSingleDog(int* arr,int size) { for (int i = 0; i < size; i++) { int flag = 0; for (int j = i + 1; j < size; j++) { if (arr[i] == arr[j]) {

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<string.h>//自己写的类似于strtok函数，遇到空格符，就将空格赋成'\0'，然后返回'\0'下一个的地址值//如果遇到'\0'则直接返回一个NULLchar* mystrtok(char* str) { while (1) { if (*str == ' ') {

例题解析#include <stdio.h>#include <stdlib.h>#include <string.h>//结构体例题// sizeof(Test) => 20struct Test{ int Num; char* pcName; short sDate; char cha[2]; short sBa[4];}*p = (struct Test*)0x100000;int main() {

第一次尝试#include<stdio.h>#include<stdlib.h>#include<string.h>#define MAX 10#define MAX_C 4//void cmp_int(const void* _a,const void* _b) {// int* a = (int*)_a;// int* b = (int*)_b;// return *a - *b;//默认升序，若想降序，则返回*b-*a//}

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<string.h>int change(char* str,char* str1,char* str2,int* arr,char ch,int size) {int k = 0;while (arr[k] != -1) {int i = 0;//将原字符串中和ch相等的前面的字符旋转到最后f

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void LeftString(char* str,int size,int num) { int i = 0; for (i = 0; i < num; i++) { str[size+i] = str[i]; str[size + 1 + i] = '\0'; }

第一次尝试#include<stdio.h>#include<stdlib.h>//A选手说：B第二，我第三； 我第三//B选手说：我第二，E第四； E第四//C选手说：我第一，D第二； D第二//D选手说：C最后，我第三； C最后//E选手说：我第四，A第一； 我第四//比赛结束后，每位选手都说对了一半，请编程确定比赛的名次。void GuessPlaces

第一次尝试#include<stdio.h>#include<stdlib.h>//A说：不是我//B说：是C//C说：是D//D说：C在胡说void isMurderer() { //每个人都默认为好人 int arr[4] = { 0 }; int i = 0; for (i = 0; i < 4; i++) { //假设第i+1个为凶手 arr[i] = 1; if ((ar

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#define N 10//正常排列的杨辉三角int arr[N][2 * N - 1] = { 0 };void YangHuiTriangle(int n) { int flag = 1; int mid = n; arr[0][n] = 1; for (int i = 1; i < n

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>//本题有很多变形，例如三个瓶子换一瓶汽水，四个瓶子换一瓶汽水等等#define Exchange 2int DrinkingProblem(int bottle) { int ret = bottle; while (bottle >= Exchange) { ret += bottle /

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#define MAX 5void init(int* p,int num) { for (int i = 0; i < MAX; i++,p++) { int ret = 1; for (int j = 0; j < i; j++) { ret = ret

第一次尝试#include<stdio.h>#include<stdlib.h>void reverse(char* str,int size) { int i = 0; char ch = 0; while ((str+i)<(str+size-i)) { ch = *(str+i); *(str+i) = *(str+size-i); *(str + size - i) = ch;

第一次尝试#include<stdio.h>#include<stdlib.h>void print(int* p) { for (int i = 0; i < 10; i++,p++) { printf("%d ", *p); } printf("\n");}int main() { int arr[10] = { 1,2,3,4,5,6,7,8,9,10 }; print(arr); return

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void NoTempChange(int* a, int* b) { *a = *a ^ *b; *b = *a ^ *b; *a = *a ^ *b;}void NoTempChange1(int* a, int* b) { *a = *a + *b; *b = *a - *b;

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int HowManyOne(int num) { int ret = 0; for (int i = 31; i >= 0; i--) { if (((num >> i) & 1) == 1) { ret++; } }

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>//void PrintOE(int num,int arro[16],int arre[16]) {// int num1 = 1;// int num2 = 2;// for (int i = 0; i < 16; i++,num1=num1<<2) {// if ((nu

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int DifferentDigits(int m, int n) { int ret = 0; int flag = 0; int num = 1; //int flagm = 0; //int flagn = 0; flag = m ^ n; for (int i = 0;

第一次尝试#include<stdio.h>#include<stdlib.h>#define MAX_SIZE 4void exchangeArray(int arr1[], int arr2[]) { for (int i = 0; i < MAX_SIZE; i++) { int t = 0; t = arr1[i]; arr1[i] = arr2[i]; arr2[i] = t;

第一次尝试#include<stdio.h>#include<stdlib.h>#define MAX_SIZE 10void init(int arr[]) { for (int i = 0; i < MAX_SIZE; i++) { arr[i] = 0; }}void print(int arr[]) { for (int i = 0; i < MAX_SIZE; i++) { printf("

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#define MAX_SIZE 10void BubbleSort(int arr[]) { for (int i = 0; i < MAX_SIZE;i++) { for (int j = 0; j < MAX_SIZE - i - 1; j++) { if (arr[

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>//f(1) = 1;//f(2) = f(1) + 1 = f(1) + f(1) = 2 * f(1) = 2;//f(3) = f(2) + f(1) + 1 = f(2) + f(1) + f(1) = f(2) + 2 * f(1) // = f(2) + f(2) = 2 * f(2) = 2 * 2;//

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int fib1(int n) { if (n == 1) { return 1; } else if (n == 2) { return 1; } else { return fib1(n - 1) + fib1(n - 2); }}

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int NumPower(int n,int k) { if (k==1) { return n; } else { return n * NumPower(n,--k); } return 0;}int main() { printf("输入一个数

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int DigitSum(int n) { if (n < 10) { return n; } else { int num = n % 10; n = n / 10; return num+DigitSum(n); }}int

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int reverse_string(char* arr) { if (arr[0] == '\0') { return 0; } else { reverse_string(arr + 1); printf("%c", arr[0]); retu

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>//在被交换的元素前面序列中，如果出现了这个元素，那么就不必交换了int judge(int arr[],int i,int k) { for (; k < i; k++) { if (arr[k] == arr[i]) { return 0; } }

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int FibNum(int num) { if (num <= 1) { return num; } else { return FibNum(num - 1) + FibNum(num - 2); }}int main() { int num =

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void Hanoi(int n,char a,char b,char c) { if (n == 1) { printf("%c-->%c\n",a,c); } else { Hanoi(n - 1,a,c,b); printf("%c-->%c\n

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>//递归方法求int setFactor1(int num) { if (num == 1) { return 1; } else { return num * setFactor1(num - 1); }}//非递归方法求int setfactor2(int n

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void NumBit(int num) { if (num <= 9) { printf("%d ", num); } else { int remainder = 0; remainder = num % 10; num = num /

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void setMulTab(int n) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= i; j++) { printf("%d * %d = %d ", i, j, i * j); }

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void ChangeNum(int* x,int* y) { int temp = 0; temp = *x; *x = *y; *y = temp;}int main() { int* a = 0; int* b = 0; printf("输入两个数啊a,b:\n");

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int isLeapYear(int year) { if ((year % 100 == 0 && year % 400 == 0) || (year % 4 == 0 && year % 100 != 0)) { printf("是闰年！\n"); } els

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int isPrimeNum(int num) { if (num == 0 || num == 1) { return 0; } for (int i = 2; i < num; i++) { if (num % i == 0) { return

第一次尝试#include<stdio.h>int main() { int arr[10] = { 0,1,2,3,4,5,6,7,8,9 }; for (int i = 1; i < 10; i++) { for (int j = 1; j <= i; j++) { printf("%d * %d = %d\t", arr[i], arr[j], arr[i] * arr[j]); if (j

第一次尝试#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>int main() { int arr[10] = { 0 }; printf("请输入十个数\n"); for (int i = 0; i < 10; i++) { scanf("%d", &arr[i]); } /*for (int i = 0; i < 10; i++) { pri

第一次尝试#include<stdio.h> int main() { int arr[] = { 1,2,3,4,5,6,7 };//查找6 int left = 0; int right = sizeof(arr) / sizeof(arr[0]) - 1; //printf("%d\n", right); int toFind = 6; while(left<=right) { int mid = (left

第一次尝试#include<stdio.h> int main() { int flat = 1; double result = 0; for (int i = 1; i <= 100; i++) { result = result + flat * (1.0 / i); //设置一个标志位，每进行一次循环，就改变一次符号 flat = -flat; } printf("求和结果为：%f\

第一次尝试#include<stdio.h>int main() { int num = 0; for (int i = 1; i <= 100; i++) { if (i < 10&&i%9==0) { num++; } else if (i>=10&&i%10==9) { num++; } el