![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
2019 ICPC 南京网络赛
bootdubbo
这个作者很懒,什么都没留下…
展开
-
The beautiful values of the palace
Here is a square matrix of n * nn∗n, each lattice has its value (nn must be odd), and the center value is n * nn∗n. Its spiral decline along the center of the square matrix (the way of spiral decline ...原创 2019-09-01 17:35:39 · 773 阅读 · 0 评论 -
super_log 【欧拉降幂】
#include <bits/stdc++.h>using namespace std;#define maxn 1000010#define Maxn maxn+10#define maxk 50typedef long long ll;ll prime[Maxn],phi[Maxn],pn=0;bool jud[Maxn];void init(){ phi[1]=...原创 2019-09-01 17:37:27 · 771 阅读 · 5 评论 -
Greedy Sequence【线段树】
题意:给出n个整数,构造s1,s2,s3...sns1,s2,s3...sns1,s2,s3...sn,sisisi满足五个条件1、s1[i]=is1[i]=is1[i]=i2、对于1<j<=n对于1<j<=n对于1<j<=n,si[j]<si[j−1]si[j]<si[j-1]si[j]<s...原创 2019-09-01 17:55:19 · 211 阅读 · 0 评论 -
Holy Grail【spfa签到题】
题意:略思路:略#include<bits/stdc++.h>using namespace std;#define maxn 1010#define INF 0x3f3f3f3f3f3ftypedef long long ll;struct Edge{ ll to,nxt,w;}edge[maxn<<2];ll tot=0,cnt=0,head[max...原创 2019-09-01 17:59:54 · 227 阅读 · 1 评论