Brillianman

分类

/ 注册

全部文章（共43篇）

题解 | #分组统计#

#include<stdio.h> #define MaxSize 1900 void clear(int* A) { int i; for (i = 0; i < MaxSize; i++)A[i] = 0; } void recover(int* A) { ...

2023-02-06

0 315

题解 | #函数求值#

我来写一个超时版本：#include<stdio.h>#include<string.h>int main(){ char A[110],B[110]; while(gets(A)){ int i,j,n=strlen(A),cnt=0; for(i=0;i<n;i++...

2023-02-01

0 331

题解 | #进制转换#

#include<stdio.h> #include<string.h> #define MaxSize 100 int f(int* A, int n) { int i, ans; for (i = 0; i < n - 1; i++) { ...

2023-01-31

0 301

题解 | #N的阶乘#

#include<stdio.h> #define MaxSize 3000 void check(int* A, int n) { int i, j; for (i = 0; i < 8; i++) { for (j = n - 1; j >...

2023-01-30

0 285

题解 | #成绩排序#

#include <stdio.h> int partition(double* A, double* B, int low, int high) { double pivot = A[low]; int pivotpos = B[low]; while (low...

2023-01-26

0 279

题解 | #今年的第几天？#

#include <stdio.h> int main() { int A[]={0,31,28,31,30,31,30,31,31,30,31,30,31}; int i,y,m,d,cnt; while(scanf("%d %d %d",&y,&m,&d)!=...

2023-01-24

0 246

题解 | #质因数的个数#

#include<stdio.h> #include<math.h> #define true 1 #define false 0 int isPrime(int n) { int i; for (i = 2; i < n; i++) { ...

2023-01-24

0 265

题解 | #质因数的个数#

#include<stdio.h> #include<math.h> #define true 1 #define false 0 int isPrime(int n) { int i; for (i = 2; i < n; i++) { ...

2023-01-24

0 272

题解 | #单词替换#

#include<stdio.h> #include<string.h> #include<stdlib.h> void swap(char* a, char* b) { int i, j, n = strlen(a), m = strlen(b); ...

2023-01-23

0 383

题解 | #Prime Number#

#include <stdio.h> #include<math.h> #define true 1 #define false 0 int isPrime(int n) { int i; for(i=2;i<(int)sqrt(n)+1;i++) ...

2023-01-21

0 251