Devpp

摘要： 1. const int maxn = 1e6+10; bool is_not_pri[maxn]; int dp[maxn], tol; void presolve(){ is_not_pri[1] = true; for(int i=2; i<maxn; i++){ if(is_not_pri[ 阅读全文

摘要： 1. #define int long long const int maxn = 4e4+10; int n, ml, mr, inf = 1e10, tol, dis[1010]; struct Edge{ int u, v, w; }; Edge edge[maxn]; void solve( 阅读全文

摘要： codeforces 1. void solve(){ int l, r, u, d; cin >> l >> r >> u >> d; if(l == r && u == d && l == u){ cout << "YES" << endl; }else{ cout << "NO" << end 阅读全文

摘要： #define int long long void solve(){ int n; cin >> n; int ans = 0; for(int i=1; i<=n; i++){ int l = i; int r = n/(n/i); int len = r-l+1; ans += len*(n/ 阅读全文

摘要： 1. Good Key, Bad Key #define int long long const int maxn = 1e5+10; int n, k, a[maxn]; void solve(){ cin >> n >> k; vector<int> dp(n+1, 0); int mx = 0 阅读全文

摘要： 1. King Bombee #define int long long const int maxn = 2e3+10; int n, m, k, s, t, x, p = 998244353; vector<vector<int>> tree; int dp[maxn][maxn][2]; vo 阅读全文

摘要： 1.Long Inversions void solve(){ int n; cin >> n; string s; cin >> s; s = ' '+s; int ans = 1; for(int k=n; k>=2; k--){ vector<int> dif(n+k+1, 0); for(i 阅读全文

摘要： 1. Light Switches const int maxn = 2e5+10; int a[maxn], n, k; void solve(){ cin >> n >> k; int t = 2*k, mx = 0; set<int> q; for(int i=0;i <n; i++){ ci 阅读全文

摘要： 爽玩 1. Find the Permutation void solve(){ int n; cin >> n; string s[n]; for(int i=0; i<n; i++) cin >> s[i]; int ans[n]; for(int i=0; i<n; i++){ ans[i] 阅读全文

摘要： codeforces 1. The Play Never Ends void solve(){ int n; cin >> n; if(n%3 == 1){ cout << "YES" << endl; }else{ cout << "NO" << endl; } } 2. Perfecto voi 阅读全文