ruojingzhang的博客

#include<iostream>#include<cmath>#include<cstdio>using namespace std;int main(){ int t; double a,b,l,sl; double s; cin>>t; while(t--){ cin>>l>>a>>b; b=b<a?b:a;

Description Kefa decided to celebrate his first big salary by going to the restaurant. He lives by an unusual park. The park is a rooted tree consisting of n vertices with the root at vertex 1.

错误百出调试多次的代码#include<queue> #include<map> #include<string> #include<iostream> #define INF 1e17#define maxn 100010using namespace std;//堆优化+vector<Edge> //类struct qnode{//堆结点 int v;//顶点编

题目 给定两个整数集合，它们的相似度定义为：Nc/Nt*100%。其中Nc是两个集合都有的不相等整数的个数，Nt是两个集合一共有的不相等整数的个数。你的任务就是计算任意一对给定集合的相似度。输入格式：输入第一行给出一个正整数N（<=50），是集合的个数。随后N行，每行对应一个集合。每个集合首先给出一个正整数M（<=104），是集合中元素的个数；然后跟M个[0, 109]区间内的整数。之后一行给

#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<cmath>using namespace std;bool dis[200010];int main(){ long long t,n,m; int x[700],y[700]; cin>>t; while

#include<iostream>#include<cstdio>#include<vector>#include<queue>#include<cstring>using namespace std;const int N=100010;vector<int> Tree[N];int d;int ans;int vis[N];void bfs(int u){ ans

HDU1556 Color the ballHDU1349 Minimum Inversion NumberHDU4417 Super Mario