爱喝零度可乐

分类

/ 注册

全部文章（共85篇）

题解 | #查找#

#include<cstdio> #include<algorithm> using namespace std; int arr[100];//使用全局数组 bool binarySearch(int n, int x) { int left = 0; ...

2023-03-03

0 256

题解 | #找x#

#include<cstdio> int main() { int n ; int arr[201]; scanf("%d", &n); for (int i = 0 ; i < n ; ++ i) { scanf("%d", &a...

2023-03-03

0 222

题解 | #小白鼠排队#

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

2023-03-03

0 231

题解 | #特殊排序#

#include<cstdio> #include<algorithm> using namespace std; bool comp1(int lhs, int rhs) { if (lhs > rhs) { return true; ...

2023-03-03

0 288

题解 | #成绩排序#

#include<cstdio> #include<algorithm> using namespace std ; struct Student { char name[50]; int grade; int seq;//记录录入顺序 }; bo...

2023-03-03

0 310

题解 | #成绩排序#

#include<cstdio> #include<algorithm> using namespace std; struct Student{ int num; int grade; }; bool comp(Student lhs,Student ...

2023-03-03

0 250

题解 | #整数奇偶排序#

#include<cstdio> #include<algorithm> using namespace std; bool comp(int lhs, int rhs) { if (lhs % 2 == 1 && rhs % 2 == 0) { ...

2023-03-03

0 244

题解 | #Grading#

#include<cstdio> int Abs(int x) { if (x >= 0) { return x; } else { return -x; } } int MAX(int a, int b, int c) { ...

2023-03-02

0 226

题解 | #xxx定律#

#include<cstdio> int main() { int n; int count = 0; while (scanf("%d\n", &n) != EOF) { while (true) { if (n == 1...

2023-03-02

0 203

题解 | #日期类#

#include<cstdio> int main() { int Mday[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int n; scanf("%d", &n); for (i...

2023-03-02

0 208