Gaibb123的博客

代码实现：#include<stdio.h>int main(){ char ch; double N; int line; scanf("%lf %c", &N, &ch); if (((int)((N / 2) * 10) % 10) < 5)line = (int)N / 2; else line = (int)N / 2 + 1; fo...

注意一个测试点很莫名其妙，如果不加上最后那个printf("\n");就会显示格式不对。代码实现：#include<stdio.h>#include<stdlib.h>typedef struct{ int num, flag1, flag2;}number;//比左边最大的大，比右边最小的小int main(){ int N, min, max, ...

代码实现：#include<stdio.h>int main(){ int N, j = 0, y = 0; scanf("%d", &N); for (int i = 0; i < N; i++) { int j1, j2, y1, y2; scanf("%d %d %d %d", &j1, &j2, &y1, &amp...

代码实现：#include<stdio.h>int main(){ int score_sum[1001], N, max_index = 0; scanf("%d", &N); for (int i = 0; i < 1001; i++)score_sum[i] = 0; for (int i = 0; i < N; i++) { int ...

代码实现：#include<stdio.h>#include<string.h>int main(){ char a[101], b[101], z[101]; int flag = 1; scanf("%s %s", a, b); if (strlen(b) < strlen(a)) { for (int j = 0; j < str...

代码实现：#include<stdio.h>#include<stdlib.h>//4+0 3+3 2+4 1+3int main(){ int N; double *a, sum = 0; scanf("%d", &N); a = (double*)malloc(sizeof(double)*N); for (int i = 0; i

假设两个人是狼，然后遍历对话，如果一个人说谎有两种情况：1.说狼是好人。2.说好人是狼。如果恰好有两个人说谎，并且恰好一个是狼一个是好人，就输出然后结束。代码实现：#include<stdio.h>#include<stdlib.h>#include<math.h>int main(){ int N, *array, *assump; sca...

利用数组来记录次数，再用次数动态分配数组是很关键的一点，如果直接用typedef struct{ int array[10000], cnt;}struction2;就会内存不足。就这么简单的一个方法我想了3个小时，可以说是很自闭了…#include<stdio.h>#include<stdlib.h>typedef struct{ int t1, ...

代码实现：

代码实现：#include<stdio.h>#include<math.h>int main(){ double a1, b1, a2, b2, a, b, r1, p1, r2, p2; scanf("%lf %lf %lf %lf", &r1, &p1, &r2, &p2); a1 = r1 * cos(p1); b1 ...

代码实现：#include<stdio.h>int InputSymbol(char str[10][5]){ char ch; int flag = 0, cnt = 0, cnt1 = 0; while ((ch = getchar()) != '\n') if (ch == '[')flag = 1, cnt1 = 0; else if (ch == ']...

代码实现：

代码实现：#include<stdio.h>int main(){ char str[10001]; int cnt_P = 0, cnt_A = 0, cnt_T = 0, cnt_e = 0, cnt_s = 0, cnt_t = 0; gets(str); for (int i = 0; i < strlen(str); i++) if (str[i]...

代码实现：#include<stdio.h>int main(){ int g1, g2, g, s1, s2, s, k1, k2, k; scanf("%d.%d.%d %d.%d.%d", &g1, &s1, &k1, &g2, &s2, &k2); s1 += g1 * 17, g1 = 0, k1 += s1 *...

代码实现：#include<stdio.h>int main(){ int N, score[101], K; scanf("%d", &N); for (int i = 0; i < 101; i++)score[i] = 0; for (int i = 0; i < N; i++) { int score1; scanf("%d", ...

代码实现：#include<stdio.h>#include<stdlib.h>#include<string.h>typedef struct{ char school[10]; int B, A, T, student, sum, rank;}score;int cmp_school(const void *a, const void *...

代码实现：#include<stdio.h>int main(void){ int A, B, Tresult, Rresult; scanf("%d %d", &A, &B); Tresult = A * B; if (Tresult >= 10) { Rresult = Tresult % 10; Tresult /= 10; ...

代码实现：#include<stdio.h>#include<stdlib.h>int main(){ int N, *array = (int*)malloc(sizeof(int) * 10334), cnt = 0; scanf("%d", &N); for (int i = 0; i < 10334; i++) array[i] ...

代码实现：#include<stdio.h>#include<math.h>void cmp(int m, double n){ if (m > n) printf("Gai"); else if (m == n) printf("Ping"); else printf("Cong");}int main(){ int M, X, Y...

代码实现：#include<stdio.h>#include<string.h>int main(){ char sell[1001], want[1001]; int cnt = 0; gets(sell); gets(want); for(int i=0;i<strlen(want);i++) for (int j = 0; j < ...

代码实现：#include<stdio.h>#include<string.h>#define X 100001int main(){ char str[X]; int cnt_P = 0, cnt_PA = 0, cnt_PAT = 0; gets(str); for (int i = 0; i < strlen(str); i++) if...

代码实现：#include<stdio.h>typedef struct{ char test_number[15]; int test, exam;}TestStudent;int main(){ int N, M; TestStudent *a; scanf("%d", &N); a = (TestStudent*)malloc(sizeof(...

代码实现：#include<stdio.h>#include<string.h>int main(){ int letter[26], max_index; char str[1001]; gets(str); for (int i = 0; i < 26; i++)letter[i] = 0; for (int i = 0; i < st...

代码实现：#include<stdio.h>int main(){ int N, D; double e, mayemp = 0, emp = 0; scanf("%d %lf %d", &N, &e, &D); for (int i = 0; i < N; i++) { int K, cnt_less = 0, cnt_more ...

代码实现：#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>int main(){ int N, cnt = 0; double *number, sum = 0; scanf("%d",

代码实现：#include<stdio.h>int Judge(int n, int m){ for (int i = 2; i <= (n > m ? m : n); i++) if (n%i == 0 && m%i == 0)return 0; return 1;}int main(){ double n1, m1, n2, m...

代码实现：#include<stdio.h>#include<stdlib.h>#include<math.h>int main(){ int N, max_index; double *m; scanf("%d", &N); m = (double*)malloc(sizeof(double)*N); for (int i = ...

代码实现：#include<stdio.h>#include<stdlib.h>//10000 9999int sum_digit(int n){ int sum = 0; do { sum += n % 10; n /= 10; } while (n != 0); return sum;}int main(){ int N, *...

我没有直接用qsort()函数，昨天学到了一个自定义快排，今天试用了一下。代码实现：#include<stdio.h>#include<stdlib.h>void quick_sort(int *a, int l, int r){ if (l < r) { int i = sort_array(a, l, r); quick_sort(a, l...

代码实现：#include<stdio.h>#include<stdlib.h>int main(){ int m, n, a, b, rp_color, **pic; scanf("%d %d %d %d %d", &m, &n, &a, &b, &rp_color); pic = (int**)malloc(si...

代码实现：#include<stdio.h>#include<string.h>int main(){ char password[50]; int N, cnt = 0; scanf("%s %d", password, &N); getchar(); while (1) { char input[50]; gets(input);...

代码实现：#include<stdio.h>#include<stdlib.h>#include<math.h>int Judge(int **a, int x, int y, int m, int n, int tol){ if (x - 1 >= 0 && y - 1 >= 0 && fabs(a[x...

代码实现：#include<stdio.h>#include<stdlib.h>#include<string.h>int main(){ int m, n, s, cnt = 0, count = 0; char **luckymen; scanf("%d %d %d", &m, &n, &s); getchar()...

qsort()函数实现：#include<stdio.h>#include<stdlib.h>int cmp(const void *a, const void *b){ return *(double*)a > *(double*)b ? 1 : -1;}int main(){ int N; double *num; scanf("%d"...

while 循环当条件为真时，重复执行一个缩进的语句块while condition: indented block of statements在开始循环之前先判断一次条件，如果条件为假，则直接跳过循环执行后面的语句，如果条件为真，循环体将被执行，每次循环体被执行完之后，会重新检验条件是否为真。也就是，循环体将执行到条件为False的时候才终止。for 循环for var in se...

代码实现：#include<stdio.h>#include<stdlib.h>int main(){ int N, M, *score, *answer; scanf("%d %d", &N, &M); score = (int*)malloc(sizeof(int)*M); answer = (int*)malloc(sizeof(i...

数学问题，十分让人头大。代码实现：#include<stdio.h>#include<stdlib.h>int cmp(const void *a, const void *b){ return *(int*)a > *(int*)b ? 1 : -1;}int main(){ int N, *num; scanf("%d", &amp

#include<stdio.h>#include<math.h>int main(){ int M; scanf("%d", &M); for (int i = 0; i < M; i++) { int K, N, cnt = 0, num, flag = 0; scanf("%d", &K); num = K * K;...

#include<stdio.h>#include<stdlib.h>int main(){ int M, N; scanf("%d %d", &N, &M); int **array = (int**)malloc(sizeof(int*)*M); for (int i = 0; i < M; i++) array[i] = ...

#include<stdio.h>#include<stdlib.h>#include<string.h>#define X 1000001int main(){ char *str1 = (char*)malloc(sizeof(char)*X), *str2 = (char*)malloc(sizeof(char)*X); int word[...