qq_43307196的博客

#include<stdio.h>#include<vector>#include<algorithm>using namespace std;int n, m, w, path[110];struct node{ int data; vector<int> child;}Node[110];bool cmp(int...

#include<stdio.h>struct factor{ int x, cnt;}fac[10];bool isprime(int n){ if(n <= 1) return false; for(long long i = 2; i * i <= n; i++){ if(n % i == 0)return false;...

#include<stdio.h>#include<vector>#include<cmath>using namespace std;struct node{ int data,layer; vector<int> child;}Node[100010];void dfs(int root, int depth){ ...

#include<stdio.h>#include<vector>#include<cmath>using namespace std;int maxdepth = 0, num = 0;//num =0而不是1vector<int> child[100010];void dfs(int root, int depth){ if...

#include<stdio.h>#include<iostream>#include<string>#include<algorithm>#include<queue>using namespace std;int n;struct node{ int lchild, rchild;}Node[20];voi...

#include<cstdio>#include<cstring>#include<iostream>using namespace std;int main(){ string str; getline(cin,str); int n = str.size(); int dp[n+1][n+1],ans = 1; ...

#include<stdio.h>int lst[210]={0}, a[10010], dp[10010];int main() { int n, m, l; scanf("%d %d", &n, &m); for(int i = 1; i <= n; i++) lst[i] = n+1; for(int i = 1; i ...

#include<stdio.h>#include<algorithm>using namespace std;int main(){ int n; scanf("%d", &n); int a[n],dp[n]; bool flag = false; for(int i = 0; i < n; i++){ ...

#include<stdio.h>#include<stack>#include<cstring>#include<algorithm>using namespace std;int n;int in[50], pre[50];struct node { int data; node* lchild; node...

#include<stdio.h>#include<iostream>#include<algorithm>#include<vector>#include<string>#include<unordered_map>using namespace std;struct node{ string str...

#include<stdio.h>#include<string>#include<iostream>using namespace std;bool isprime(int n){ if(n==0||n==1) return false; for(long long i=2;i*i<=n;i++){ if(n%i...

#include<stdio.h>#include<iostream>#include<map>using namespace std;int main(){ string s1,s2,s; getline(cin,s1); getline(cin,s2); s=s1+s2; map<char,int>...

#include<stdio.h>int main(){ int n,m; scanf("%d%d",&n,&m); int a[n]={0},b,Max=-1; while(m--){ for(int i=0;i<n;i++){ scanf("%d",&b); ...

#include<stdio.h>int main(){ int n; scanf("%d",&n); while(n--){ int a; scanf("%d",&a); int k=0; for(int i=9;i>=1;i--){ int b=...

#include<stdio.h>#include<map>#include<vector>using namespace std;int main(){ int n,m; scanf("%d%d",&n,&m); map<int,vector<int> >mp; for(int ...

#include<stdio.h>#include<vector>#include<math.h>using namespace std;int main(){ int n; scanf("%d",&n); vector<int> key(n); for(int i=0;i<n;i++) ...

#include<stdio.h>#include<math.h>int m;void printf(double t){ if(t==m) printf(" Ping"); else if(t<m) printf(" Gai"); else if(t>m) printf(" Cong");}int main(){ i...

#include<stdio.h>int main(){ int hashtable[30010]={0}; int n; scanf("%d",&n); for(int i=1;i<=n;i++){ int a; a=int(i/2.0)+int(i/3.0)+int(i/5.0); h...

#include<stdio.h>int main(){ int a,b; scanf("%d%d",&a,&b); int c=a*b; bool flag=false; while(c!=0){ if(flag==false&&c%10==0){ c/=10; ...

在这里插入代码片#include<stdio.h>#include<vector>#include<map>#include<iostream>#include<algorithm>using namespace std;struct node{ string name; double grade; ...