A15029070725的博客

#include<stdio.h>#include<stdlib.h>int BottleNum(int n){ int num = 0; while (n >= 2){ num = num + n / 2; n = n / 2 + n % 2; } return num;}int main(){ int n = 0; int num...

#include<stdio.h>#include<stdlib.h>#include<assert.h>void MyStrcat(char *str1, const char *str2){ assert(str!=NULL); assert(str2!=NULL); while (*str1 != '\0'){ str1++...

#include<stdio.h>#include<stdlib.h>#include<string.h>void DifferentTwo(int *arr, int n){ int i = 0; int index = 0; int flag = 0; for (i = 0; i < n; i++){ flag = 0; fo...

#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int YangShi(int *arr[][3],int n){ int row = 0; int col = 0; for (row = 0; row < 3; row++){ for (col = 0; col...

#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<string.h>int YangShi(int *arr[][3],int n){ int row = 0; int col = 0; for (row = 0; row < 3; ro...

对于这个问题,我能想到的方法有三种:①先找出这两个数中最小的那个,可以用i表示,然后用这两个数依次对i取余. 同时i不断减1,直到这两个数对i取余都为0;这时的i就为最大公因数程序如下:#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int main(){ int a ...

#include<stdio.h>#include<stdlib.h>#include<assert.h>void MyStrcpy(char *str1, const char *str2){ assert(str1 != NULL); assert(str2 != NULL); while (*str2 != '\0'){ *str1 =...