爱喝零度可乐

分类

/ 注册

全部文章（共85篇）

题解 | #位操作练习#

#include<cstdio> using namespace std; void binary(int n, char arr[]) { int res; int i = 0 ; while (n != 0) { res = n / 2; ...

2023-03-18

0 274

题解 | #放苹果#

#include<cstdio> int fun(int m, int n) { if (n == 1 ) { return 1; } if ( m == 0 ) { return 1; } if (n > m...

2023-03-18

0 233

题解 | #Freckles#

#include<cstdio> #include<vector> #include<algorithm> #include<math.h> #include<iostream> #define N 101 using namespace ...

2023-03-18

1 274

题解 | #小白鼠排队#

#include<cstdio> #include<algorithm> using namespace std; struct mice { int weight; char colour[100]; }; bool comp (mice lhs, m...

2023-03-18

0 246

题解 | #n的阶乘#

#include<cstdio> long long fun(int n){ if(n == 1){ return 1; }else { return n * fun(n-1); } } int main(){ int n; ...

2023-03-18

0 247

题解 | #Coincidence#

#include<string> #include<cstdio> #include<cstring> using namespace std; int main(){ char arr1[100]; char arr2[100]; int...

2023-03-16

0 296

题解 | #合唱队形#

#include<cstdio> #include<iostream> #define N 100 using namespace std; int main() { int dp[N]; int before[N]; int A[N]{0} ; ...

2023-03-16

0 278

题解 | #拦截导弹#

#include<cstdio> #include<iostream> #define N 25 using namespace std; int main() { int n; int ans = 0; int dp[N]; int heig...

2023-03-16

0 334

题解 | #最大子矩阵#

#include<cstdio> #include<iostream> #include<climits> #define N 100 using namespace std; int com[N][N]; int total[N][N]; int dp[N];...

2023-03-16

0 277

题解 | #吃糖果#

//KY48 #include<cstdio> #define N 21 int dp[N]; int main(){ int n; scanf("%d",&n); dp[1] = 1; dp[2] = 2; for(int i = 3; i &l...

2023-03-16

0 190