skyline的分享专栏

Problem DescriptionThere is a hill with n holes around. The holes are signed from 0 to n-1. A rabbit must hide in one of the holes. A wolf searches the rabbit in anticlockwise order. The first ...

#include<bits/stdc++.h>using namespace std;struct pp{ string name; int face;//朝向}a[100005];int main(){ int n,m; cin>>n>>m; int f,c; for(int i=0;i<n;++i){ scanf("%d",&...

题目链接#include<bits/stdc++.h>using namespace std;//maxv=15485863,n=1000000//maxv=1299709, n=100000//maxv=1000003, n=78499const int maxv=1000003;const int n=78500;bool check[maxv];int pr...

看了这几个博客看懂的，然后自己写了一版，以后有时间再为此作讲解。https://www.cnblogs.com/grubbyskyer/p/3852421.htmlhttps://www.cnblogs.com/zhoushuyu/p/8275530.htmlhttps://www.acwing.com/blog/content/28/以下模板，要在理解的基础上默写。#inc...

 https://www.luogu.org/problemnew/solution/P1226 这篇写得很好#include<bits/stdc++.h>using namespace std;typedef long long ll;const int MOD = 1e9 + 7;ll poww(ll a, ll b){ ll ans = 1, base =...