xkayla

传送门没想到这种题目还没有思路，颓废了近一年了#include <bits/stdc++.h>using namespace std;const int maxn = 2e5 + 10;int n,se,my;long long a[maxn],sse,smy,ans;int main(){ //ios::sync_with_stdio(0); cin >> n; se = 1,my = n; for(int i = 1; i <= n; i++)

7 87 67 46 54 15 25 32 13 17 17 87 67 46 54 15 25 36 13 17 1#include <bits/stdc++.h>using namespace std;const int maxn = 510;int n,m,s,t;vector<int> ve[maxn];int dp[maxn];int dfs(int x){ if(dp[x]) return dp[x...

传送门#include <bits/stdc++.h>using namespace std;const int maxn = 510;int n,m,k,v[maxn],fa[maxn];struct node{ int x,y;}e[10 * maxn];void init(){ for(int i = 0; i < maxn; i++) fa[i] = i;}int find(int x){ return x == fa[x] ? x : fa[x]

传送门#include <bits/stdc++.h>using namespace std;const int maxn = 1e4 + 10;int n,k,q,fa[maxn],kk[maxn];int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]);}void merge(int x,int y) { fa[find(x)] = find(y);}int main() { ios::syn

传送门#include <bits/stdc++.h>using namespace std;const int maxn = 1e3 + 10;int n,m,h[maxn];int find(int x){ for(int i = 1; i <= n; i++){ if(h[i] == x){ return i; } } return 0;}int main() { ios::sync_with_stdio(0); cin >> n

传送门#include <bits/stdc++.h>using namespace std;const int maxn = 40;struct node{ int left,right;}tree[maxn];int n,pre[maxn],mid[maxn];int build(int la,int ra,int lb,int rb){ if(la > ra) return 0; int p = pre[lb]; int t = la; while(mi

传送门#include <bits/stdc++.h>using namespace std;typedef struct node* BinTree;struct node { int data; BinTree left,right;};const int maxn = 1e3 + 10;int n,a[maxn],s,b[maxn],t,c[maxn];BinTree CreateTree(BinTree BST,int x) { if(!BST) { BS

传送门#include <bits/stdc++.h>using namespace std;const int maxn = 510;int n,m,s,d;int num[maxn],cnt[maxn],snum[maxn];int vis[maxn],a[maxn][maxn],pre[maxn];int ans[maxn],tp;void Dijkstra(){ vis[s] = 1,pre[s] = -1; for(int i = 0; i < n - 1

传送门#include <bits/stdc++.h>using namespace std;const int maxn = 1e5 + 10;int l,n;struct node{ int val,nxt;}e[maxn];int vis[maxn],b[maxn],cnt;int main(){ cin >> l >> n; for(int i = 0; i < n; i++){ int id;cin >> id

传送门#include <bits/stdc++.h>using namespace std;const int maxn = 1e4 + 10;int n,root[maxn],vis[maxn];int res;struct Node{ int id,fa,fm,k,ch[6]; int num,area;}e[1005];struct node{ int id,sum; double num,area; bool flag;}ans[maxn];int

传送门#include <bits/stdc++.h>using namespace std;int n;set<int> s;struct node { string name; int cnt,avg; bool operator <(const node &a){ if(cnt != a.cnt) return cnt > a.cnt; return avg < a.avg; }} e[110];int mai

#include <bits/stdc++.h>using namespace std;int l,n;long long s;int arr[12],c;signed main(){ ios::sync_with_stdio(0); cin >> l >> n; scanf("%d %d",&l,&n); s = pow(26,l) - n; do{ arr[c++] = s % 26; s /= 26; }whil.

#include <bits/stdc++.h>using namespace std;string str;int tel[13],ar[13],ind[13];int vis[11],c;bool cmp(int a,int b){ return a > b;}int main(){ ios::sync_with_stdio(0); cin >> str; for(int i = 0; i < 11; i++){ tel[i] = str..

set的用法还是不熟#include <bits/stdc++.h>using namespace std;int n,a,b;set<int> s;signed main() { ios::sync_with_stdio(0); cin >> n; while(n--) { int a; cin >> a; if(s.upper_bound(a) != s.end()) s.erase(s.upper_bound(a..

#include <bits/stdc++.h>using namespace std;const int maxn = 1e5+5;vector<int> vec[maxn];bool vis[maxn];char sex[maxn];bool flag;void dfs(int x,int num){ if(num>=4) return; for(int i=0;i<vec[x].size();i++){ if(!vis.

//连续因子最长&最小/*注:630 = 3 * 5 * 6 * 7,选的5,6,7也就是说选的连续因子的乘积还是这个数的约数*/ #include <bits/stdc++.h>using namespace std;long long n;int main(){ ios::sync_with_stdio(0); cin >> n; int len = 1; long long i,yz = n,j,sum; for( i = 2; i <=.

#include <iostream>using namespace std;/*求和公式s = n * a1 + n * (n-1)/2 * d*/ int main(){ int n;char ch; cin >> n >> ch; int c = 0; while(2 * c * c + 4 * c + 1 <= n) c++; // cout << c << endl; int kg = 0; .