摘要：
Some scientists took pictures of thousands of birds in a forest. Assume that all the birds appear in the same picture belong to the same tree. You are 阅读全文
摘要：
When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. A socia 阅读全文
摘要：
System.out.println(String.format("%.5f",new Main().minRadius(n,m))); 阅读全文
摘要：
A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone involved in moving a product from supplier to customer 阅读全文
摘要：
A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child. Input Specification: Each inp 阅读全文
摘要：
#include using namespace std; int main() { int T = 0, K = 0, n1 = 0, n2 = 0, b = 0, t = 0; scanf("%d %d", &T, &K); for (int i = 0; i T) { printf("Not enough tokens. Total =... 阅读全文
摘要：
#include #define ll long long using namespace std; int main() { int m,n,o1,o2,k,count=0,count2=0,num=0; string str; cin>>m>>n; int a[10000]={0}; int h[100]={0}; for(int i=0;i... 阅读全文
摘要：
#include using namespace std; int main() { string a,b,c; cin>>c>>a>>b; reverse(a.begin(),a.end()); reverse(b.begin(),b.end()); reverse(c.begin(),c.end()); string s; int ... 阅读全文
摘要：
#include using namespace std; struct node{ int data,next; }; vector v[3]; int main() { int start,n,k,a; scanf("%d%d%d",&start,&n,&k); node list[100000]; for(int i=0;i=0&&data<=k)... 阅读全文
摘要：
#include using namespace std; int a[5]; int main() { int i,n,j; a['A']=1;a['B']=2;a['C']=3;a['D']=4;a['E']=5; scanf("%d",&n); getchar(); for(i=0;i<n;i++) { for(j=0;j<4... 阅读全文