摘要:
问题 D: Olympic Bus 时间限制: 1 Sec 内存限制: 128 MB 题目描述 There are N cities in JOI Kingdom, numbered from 1 to N. There are M bus lines connecting cities, numb 阅读全文
摘要:
#include using namespace std; typedef long long ll; ll f[30][30][30]; ll n; int main() { while (~scanf("%lld",&n)) { f[0][1][1]=1; for (int i=1... 阅读全文
摘要:
#pragma GCC optimize(3,"Ofast","inline") #include <bits/stdc++.h> using namespace std; typedef long long ll; const ll maxn=1000005; int prime[maxn/10],phi[maxn]; bool vis[maxn]; int tot; inline int gc 阅读全文
摘要:
The Preliminary Contest for ICPC Asia Shanghai 2019 Light bulbs 题意:有n盏灯,初始都是灭的状态,p次操作,每次操作翻转a到b盏灯的状态,问最终操作完成后几盏灯是亮着的。 思路:内存限制8192K,显然不能用线段树,只能用数组操作,但是 阅读全文