#include <iostream> #include <cstdio> using namespace std; int fa[1005]; int find(int x){ if(x == fa[x]){ return...

#include <bits/stdc++.h> #define rep(i, s, e) for (int i = s; i < e; i++) using namespace std; string s; // 输入的字符串 vector<bool&...

#include<iostream> #include<cstring> #include<queue> using namespace std; const int maxn = 100 + 2; char mpt[maxn][maxn]...

#include <iostream> #include <cstdio> #include <cstring> #include <queue> using namespace std; #define inf 0x3f3f3...

#include<iostream> #include<cstdlib> #include<cstdio> #include<vector> using namespace std; vector<int> path...

public class Code02_TrieTree { private Node root; public Code02_TrieTree() { this.root = new Node(); } ...

#include <bits/stdc++.h> using namespace std; int main() { int L, M; while(cin>>L>>M) { int l, r, ...

#include<iostream> using namespace std; typedef struct node { char data; struct node* lchild, * rchild; }node, * Tree; void...

#include<bits/stdc++.h> using namespace std; string str; int len, num[30]; int bfs() { priority_queue<int, vector<int>, ...

待做

待做

// 快速幂经典题 #include <bits/stdc++.h> using namespace std; //定义模 #define MOD 233333; //快速幂算法： //其实就是二分思想，把幂减半后，减少计算时间 //n为偶数，a^n=a^...

#include <iostream> #include <cmath> #include <vector> using namespace std; //getPrime就是统计质因子个数的。 void getPrime(vector&l...

#include <bits/stdc++.h> using namespace std; int main(){ int n,x,k,count; while(cin>>n){ count = 0; ma...

#include <bits/stdc++.h> using namespace std; struct T { string name; string time; string run; }t[10000]; bool compare(T t1, T t...

#include <iostream> #include <string> using namespace std; int main() { string s; getline(cin, s); string target[8]...

#include<bits/stdc++.h> using namespace std; char s[100]; int main() {     while (gets(s)) {        ...

#include<iostream> #include<string> #define N 4000 using namespace std; int conversion(int d[],int data[],int n,int x,int y)...

#include <iostream> using namespace std; void ShowCm(int m) { if (m > 0) { ShowCm(m - 1); for (int i = 0, temp = 1; i < m + 1; i...