台部落fanbaobao829

#include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxn=20; int dp[1<<maxn],vis[maxn],mask,c

2020-07-07 12:34:25

//模擬退火 #include <iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> using namespace std;

2020-06-09 20:09:52

#include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxn=1e6+5; int f[maxn],prime[maxn],cnt,a

2020-06-09 20:09:42

#include<bits/stdc++.h> using namespace std; const int maxn=1e6+5; int a[maxn]; set<int> s; map<int,int> mp; int main(

2020-02-25 13:45:09

#include<bits/stdc++.h> using namespace std; int main() { int t,n; scanf("%d",&t); while(t--&&scanf("%d",&

2018-08-21 23:39:39