阿彬想成为大牛

int avrrage(int x,int y) { int sum = x + y; return sum >> 1; //return x&y+(x^y)>>1;}

size_t Strlen(const char* str) { //检验合法性 assert(str != NULL); size_t count = 0; while (str[count] != '\0') { count++; } return count;}char* str(char* dest, const* src) { assert(dest != NULL...

int GetoneCount(int number) { int count = 0; for (int i = 0; i <= 32; ++i) { if (number&(1 << i)) count++; } return count;}

void Getbit(int num) { for (int i = 31; i >0;i-=2) { printf("%d ", (num>>i) & 1); } printf("\n"); for (int i = 30; i >=0; i-=2) { printf("%d ", (num >> i) & 1);

void printfbit(int num) { if (num > 9) { printfbit( num / 10); } printf("%d ", num % 10);}

int countDif(int x, int y) { int count=0; int i = 32; while (i >= 0) { if (((x >> i)&1) != ((y >> i)&1)) count++; --i; } return count;}

**5位运动员参加了10米台跳水比赛，有人让他们预测比赛结果A选手说：B第二，我第三；b2&&a!=3 ||b!=2&&a3B选手说：我第二，E第四； (b2&&e!=4)|| (b!=2&&e4)C选手说：我第一，D第二； (c1&&d!=2)||(c!=1&&d2)D选手说：C最后，我第三；...

#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<string.h>#include<assert.h>//实现的功能//增//删//改//查//动态分配空间 //开辟一个数据大小为5的//抽象数据类型typedef str...

int Differ(int val[],int len) { int ret = 0; for (int i = 0; i < len; ++i) { ret = ret ^ val[i]; } return ret;}

void paunduan(char* dest,char* src) { int len = strlen(src); for (int i = 0; i < len; ++i) { eft_rotate(src, i); if (strcmp(dest, src) == 0) { prinft("找到了\n"); break; } if (i == len...

void left_rotate(char* str , int k) { char temp = *str; char* cur = str; while (k--) { while (*(cur + 1)) { *cur = *(cur + 1); cur++; } *cur = temp; }}void nizhuanstring(char* left, ...

nt total = 0; int money = 20; int empty = 20; while (empty > 1) { total = money + empty/2; empty = empty / 2+empty%2; }

void reseve(char* str) { /*char* start = str; char* end = str + strlen(str)-1; if (*str) { char temp; temp = *start; *start = *end; *end = '\0'; reseve(start + 1); *end=temp; }*/ char...

**写一个递归函数DigitSum(n)，输入一个非负整数，返回组成它的数字之和，例如，调用DigitSum(1729)，则应该返回1+7+2+9，它的和是19 **代码:int DigitSum(int number) { int sum = 0; if (number < 0) { printf("输入有误\n"); } int i = number / 10; if...

归递int Factorial(int n) { if (n == 0) { printf("错误\n"); } if (n == 1) { return 1; } return Factorial(n - 1)*n;}非递归int factorial(int n) { int ret = 1; while (n > 1) { ret *= n; --...

void GetBit(int i) { int m; m = i / 10; if (m > 0) { GetBit(m); } printf("%d\n",i%10);}

void SortByS(int arr[],int size) { for (int left = 0; left < size; ++left) { if (arr[left] % 2 == 0) { for (int right = size-1; right >= 0; --right) { if (arr[right] % 2 != 0&&...

int Find_Num(int arr[3][3],int to_find,int row ,int col) { if (to_find<arr[0][0] || to_find>arr[ROW - 1][COL - 1]){ printf("没有要找的数\n"); return -1; } int r = 0, c = COL-1; while (r <=...

void reverse_string(char * string) { assert(string != NULL); char* start = string; char* end = string+strlen(string) - 1; while (start<end) { char temp; temp = *start; *start = *end; *e...

int pos = -1; int arr[] = { 1,1,2,2,3,3,5,7 }; int ret = 0; int x1=0; int x2=0; for (int i = 0; i < sizeof(arr); ++i) { ret = ret ^ arr[i]; } for (int i = 0; i < 32; ++i) { if ((ret &...

#include <stdio.h>#include <stdlib.h>#include <unistd.h>#include <string.h>#include <ctype.h>#include <sys/wait.h>#include <fcntl.h>char cmd[1024] = {...