inv0ker的博客

题目链接：https://codeforces.com/contest/27/problem/C #include <iostream> using namespace std; static const int MAXN=1e5+10; int n; int a[MAXN]; int main() { scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); if(n>=

题目链接：https://codeforces.com/contest/26/problem/C #include <iostream> #include <cctype> using namespace std; static const int MAXN=100+10; char g[MAXN][MAXN]; int n,m,a,b,c; int main() { scanf("%d%d%d%d%d",&n,&m,&a,&b,&c)

题目链接：https://codeforces.com/contest/23/problem/C 奇妙的构造，不过2500似乎是有点高了 #include <iostream> #include <algorithm> using namespace std; static const int MAXN=1e5+10; inline int read(){ int s=0,w=1; char ch=getchar(); while(ch<'0'||ch>'9'){if(c

题目链接：https://codeforces.com/contest/23/problem/B 这个题的构造可真是太妙了 orz #include <iostream> using namespace std; int main() { int T,n; scanf("%d",&T); while(T--) { scanf("%d",&n); printf("%d\n",n>2?n-2:0); }

题目链接：https://codeforces.com/contest/22/problem/C #include <iostream> using namespace std; int n,m,v; int main() { scanf("%d%d%d",&n,&m,&v); if(m<n-1 || m>n-1+1ll*(n-2)*(n-3)/2) puts("-1"); else { for(int i=1;

题目链接：https://codeforces.com/contest/12/problem/E 先构造1~n-1的每行每列不存在重复数字的矩阵 以n=6为例 1 2 3 4 5 2 3 4 5 1 3 4 5 1 2 4 5 1 2 3 5 1 2 3 4 对角线的数字1，3，5，2，4…显然满足 (i+2)%n 不会重复 故把对角线中的数字移到最后一列，并把对角线置0 0 2 3 4 5 1 2 0 4 5 1 3 3 4 0 1 2 5 4 5 1 0 3 2 5 1 2 3 0 4 再把最后一行抄上