输入
5
5
4
12
11
10
输出
Yes
Yes
No
No
Yes
输入
5
5
4
12
11
10
输出
Yes
Yes
No
No
Yes
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll T,x,f[60];
ll read(){
ll i=0,f=1;char ch=getchar();
for(;ch>'9'||ch<'0';ch=getchar()) if(ch=='-') f=-1;
for(;ch<='9'&&ch>='0';ch=getchar()) i=(i<<3)+(i<<1)+ch-'0';
return i*f;
}
int main(){
// freopen("fib.in","r",stdin);
// freopen("fib.out","w",stdout);
f[0]=0;f[1]=1;
for(int i=2;i<=45;++i){
f[i]=f[i-1]+f[i-2];
// cout<<f[i]<<endl; //
}
T=read();
while(T--){
int fl=0;
x=read();
for(int i=0;i<=45;++i)
for(int j=0;j<=45;++j)
if(x==f[i]*f[j]) fl=1;
if(fl) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
输入
4
1 2
2 3
2 4
2
1 2
1 3
输出
0
2
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int a,b,x,y,tot,n,m;
int first[100005],d[100005],num[100005];
int f[100005][20];
bool vis[100005];
struct node{
int next,to;
}e[200005];
int read(){
int i=0,f=1;char ch=getchar();
for(;ch>'9'||ch<'0';ch=getchar()) if(ch=='-') f=-1;
for(;ch<='9'&&ch>='0';ch=getchar()) i=(i<<3)+(i<<1)+ch-'0';
return i*f;
}
void inser(int x,int y){
tot++;
e[tot].next=first[x];
first[x]=tot;
e[tot].to=y;
}
void dfs(int x){
vis[x]=true;
for(int u=first[x];u;u=e[u].next){
int to=e[u].to;
if(!vis[to]){
d[to]=d[x]+1;
f[to][0]=x;
dfs(to);
num[x]+=num[to];
}
}
num[x]+=1;
}
int lca(int x,int y){
if(d[x]<d[y]) swap(x,y);
int ft=d[x]-d[y];
for(int i=18;i>=0;--i) if(ft>=(1<<i)) ft-=(1<<i),x=f[x][i];
if(x==y) return x;
for(int i=18;i>=0;--i) if(f[x][i]!=f[y][i]) x=f[x][i],y=f[y][i];
return f[x][0];
}
int l2(int x,int d){
for(int i=18;i>=0;--i) if(d>=(1<<i)) d-=(1<<i),x=f[x][i];
return x;
}
int main(){
// freopen("equal.in","r",stdin);
// freopen("equal.out","w",stdout);
n=read();
for(int i=1;i<n;++i){
x=read();y=read();
inser(x,y);
inser(y,x);
}
d[1]=1;dfs(1);
for(int i=1;i<=18;++i)
for(int j=1;j<=n;++j)
if(f[j][i-1]) f[j][i]=f[f[j][i-1]][i-1];
m=read();
for(int i=1;i<=m;++i){
a=read();b=read();
if(a==b){
cout<<n<<endl;
continue;
}
int z=lca(a,b);
if(d[a]-d[z]==d[b]-d[z]){
x=l2(a,d[a]-d[z]-1);
y=l2(b,d[b]-d[z]-1);
cout<<n-num[x]-num[y]<<endl;
continue;
}
y=d[a]+d[b]-2*d[z];
if(y%2==1){
cout<<"0"<<endl;
continue;
}
y/=2;
if(d[a]>d[b]) x=l2(a,y-1);
else x=l2(b,y-1);
y=f[x][0];
cout<<num[y]-num[x]<<endl;
}
return 0;
}
再也不用 cout<<endl 了 烦
输入
2
4 4
1 2 3
4 3
1 1 1
输出
2
2
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int T,s,k,x,y,tot,n,m,ans;
int first[100005],fa[100005],num[100005];
bool vis[100005];
struct node{
int next,to;
}e[200005];
int read(){
int i=0,f=1;char ch=getchar();
for(;ch>'9'||ch<'0';ch=getchar()) if(ch=='-') f=-1;
for(;ch<='9'&&ch>='0';ch=getchar()) i=(i<<3)+(i<<1)+ch-'0';
return i*f;
}
void inser(int x,int y){
tot++;
e[tot].next=first[x];
first[x]=tot;
e[tot].to=y;
}
int find(int x){
if(fa[x]!=x) fa[x]=find(fa[x]);
return fa[x];
}
void dfs(int x){
vis[x]=true;
int px=find(x);
for(int u=first[x];u;u=e[u].next){
int to=e[u].to;
int py=find(to);
if(!vis[to]){
dfs(to);
if(num[py]==1&&num[px]==1&&s<k){
fa[px]=py;
num[py]++;num[px]++;
ans++;s+=2;
}
}
}
}
int main(){
// freopen("tree.in","r",stdin);
// freopen("tree.out","w",stdout);
T=read();
while(T--){
memset(first,0,sizeof(first));
memset(fa,0,sizeof(fa));
memset(num,0,sizeof(num));
memset(vis,false,sizeof(vis));
tot=0;ans=0;s=0;
n=read();k=read();
for(int i=1;i<=n;++i) fa[i]=i,num[i]=1;
for(int i=1;i<n;++i){
x=read();
inser(x,i+1);
inser(i+1,x);
}
dfs(1);
for(int i=1;i<=n;++i){
if(num[i]==1&&s<k) ans++,s++;
}
cout<<ans<<endl;
}
return 0;
}