17-4-19 代码

来源：互联网发布：java poi maven 编辑：程序博客网时间：2024/05/22 06:38

A：

#include<stdio.h>#include<string.h>int main(){    int  a,v1,v2;    while(~scanf("%d%d%d",&a,&v1,&v2))    {        if(a==0)            printf("0\n");        else        if((a&&v1==v2)||(v1<v2))        {            printf("Infinity\n");        }        else        {            printf("%.10f\n",v1*a*1.0/(v1*v1-v2*v2));        }    }}

B题：

#include <iostream>#include <algorithm>#include <stdio.h>#include <string.h>#define LL __int64#define maxs 200100#define MME(i,j) memset(i,j,sizeof(i))using namespace std;LL a[maxs];typedef struct node{    struct node *nexts[2];    __int64 vis;}Trienode,*Trie;Trie Build_trie(){    Trie p=new Trienode;    MME(p->nexts,0);    p->vis=0;    return p;}void Insert(LL num,Trie root){    Trie p=root;    LL i,id;    for( i=31;i>=0;i-- )    {        id=num&(1<<i);        if(id) id=1;        if(p->nexts[id]==NULL)            p->nexts[id]=Build_trie();        p=p->nexts[id];    }    p->vis=num;}__int64 Find(__int64 num,Trie root){    Trie p=root;    __int64 i,id,bit_max=1<<33,sum=0;    for( i=31;i>=0;i-- )    {        if( num&(1<<i))            id=1;        else id=0;        if(p->nexts[!id]==NULL)        {            p=p->nexts[id];        }        else        {            p=p->nexts[!id];        }    }    return p->vis;}void delete_node(__int64 num,Trie root){    Trie p=root;    int id;    for(int i=33;i>=0;i--)    {        id=num&(1<<i);        if(id) id=1;        if(p->nexts[id])            p=p->nexts[id];        else break;        p->vis--;    }    p->vis--;}int main(){    int t,n,m;    scanf("%d",&t);    __int64 num;    Trie root;    int times=1;    for(int tt=1;tt<=t;tt++)    {        root=Build_trie();        scanf("%d %d",&n,&m);        for(int i=0;i<n;i++)        {            scanf("%I64d",&num);            Insert(num,root);            a[i]=num;        }        printf("Case #%d:\n",times++);        __int64 ans=0;        for(int i=0;i<m;i++)        {            scanf("%I64d",&num);            ans=Find(num,root);            printf("%I64d\n",ans);        }    }    return 0;}

0 0