//
// Created by Sween'e'y on 2022/9/1.
//
//P1068 [NOIP2009 普及组] 分数线划定
#include <iostream>
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <deque>
#include <array>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <climits>
#include <string>
#include <cstring>
#include <cctype>
#include <cassert>
#include <cstdbool>
using namespace std;
const double PI = acos(-1);
//const int INF = (1 << 31) - 1;
const int INF = 0x3fffffff; //更常用
struct cmp {
bool operator()(int a, int b) {
return a > b;
}
};
template<class T>
int length(T &array) {
return sizeof(array) / sizeof(array[0]);
}
bool is_prime[100007];
void ai() {
for (int i = 2; i <= 100000;
P1068 [NOIP2009 普及组] 分数线划定
最新推荐文章于 2024-05-14 10:05:20 发布