xlinsist

摘要： 博客搬迁 阅读全文

摘要： The 2021 ICPC Asia Regionals Online Contest (II)，PTA #include <bits/stdc++.h> //#define endl '\n' #define lose {printf("NO\n");return;} #define win {p 阅读全文

摘要： 字符串最小表示法 int getPos(string s,int op)//zero represent the least representation, while one represent the largest { int i=0,j=1; int len=s.size(); while 阅读全文

摘要： 字符操作 import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; public class hello3 { public static void main(String[] args) { 阅读全文

摘要： #include <bits/stdc++.h> //#define endl '\n' #define lose {printf("NO\n");return;} #define win {printf("YES\n");return;} #define all(A) (A).begin(),(A 阅读全文

摘要： //template const double eps=1e-7; const double pi=3.14159265; struct Point { double x, y; Point( double x = 0, double y = 0 ):x(x), y(y) { } }; typede 阅读全文

摘要： maybe or maybe not, that is a question 阅读全文

摘要： //https://nanti.jisuanke.com/t/A2022 #include <bits/stdc++.h> //#define endl '\n' #define lose {printf("NO\n");return;} #define win {printf("YES\n");r 阅读全文

摘要： just a template 阅读全文

摘要： struct myComp { bool operator() (const int &a, const int &b) { if (ac[a]<ac[b]) return a; else if (ac[a]==ac[b]&&pen[a]>=pen[b]) return a; return fals 阅读全文