忆灬凝的博客

链接：牛客竞赛_ACM/NOI/CSP/CCPC/ICPC算法编程高难度练习赛_牛客竞赛OJ

链接：牛客竞赛_ACM/NOI/CSP/CCPC/ICPC算法编程高难度练习赛_牛客竞赛OJA题签到题：#include <bits/stdc++.h>using namespace std;#define x first#define y secondtypedef long long ll;const int N = 1e5 + 5;int y[N];double cut[N];double elen[N];double distance(int a, int b

Time limit: 0.5 seconds Memory limit: 256 megabytes Zayin and Taotao are poor in mathematics. In order to improve their math skill, they count numberstogether today. They write a number every second in the ascending order, such as 0, 1, 2, 3, etc. How.

链接：https://codeforces.com/gym/103428#include <bits/stdc++.h>#define x first#define y secondusing namespace std;typedef long long ll;int main(){ // system("chcp 65001"); cout.tie(0); cin.tie(0); // freopen("C:/Users/zhaochen/D