MrFox

//在满足要求的情况下找已经选出的答案。//#include#include#includeusing namespace std;const int maxn = 1e5 + 5;int vis[maxn];int main(){ int n, d; while(scanf("%d%d", &n, &d) == 2 && (n||d)) {

#include#include#include#include#includeusing namespace std;char s[] = {'0', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S','T', 'U', 'V', 'W','X',

//核心是学长的一个牛逼的hash标记。看到了学长们去年的态度， 自愧不如。#include#include#include#include#includeusing namespace std;const int maxn = 4000 + 5;struct Hash_map{ static const int mask = 0x7fffff; int p[8

#include#include#include#include#include#include#include#includeusing namespace std;deque res;int Is_order(){ for(int i = 0; i < (int)res.size() - 1;++i) if(res[i] > res[i+1]

//重做这个题完全是为了使用res.erase（）；以前比赛的时候基本不敢用， 事实证明是可以A题的；不能res.erase(res.end());不知为何。。。#include#include#include#include#include#includeusing namespace std;vector res;int main(){ int n;

注意精度问题；set里面的count是不能避免精度问题的；

#include#include#include#include#includeusing namespace std;const int maxn = 5000 + 5;struct node{ int x1, x2, y1, y2; int id;}k[maxn];int x[maxn];int y[maxn];bool cmp1(node p, nod