A
#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=5e4+10;
const int maxm=5e5+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
if(y==0) return x;
return gcd(y,x%y);
}
int main(){
ios::sync_with_stdio(false);/*
freopen("d://in.txt","r",stdin);
freopen("d://out.txt","w",stdout);*/
int t;cin>>t;
while(t--){
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<b<<" "<<c<<" "<<c<<"\n";
}
return 0;
}
B
#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=5e4+10;
const int maxm=5e5+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
if(y==0) return x;
return gcd(y,x%y);
}
int main(){
ios::sync_with_stdio(false);/*
freopen("d://in.txt","r",stdin);
freopen("d://out.txt","w",stdout);*/
int t;cin>>t;
while(t--){
int x,n,m;
cin>>x>>n>>m;
while(x>20){
if(n){
x=x/2+10;
n--;
}else{
break;
}
}
///cout<<x<<endl;
if(x<=m*10) cout<<"YES\n";
else cout<<"NO\n";
}
return 0;
}
C
#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=2e5+10;
const int maxm=5e5+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
if(y==0) return x;
return gcd(y,x%y);
}
int n,k,dep[maxn],sz[maxn];
vector<int> g[maxn];
pii p[maxn];
void dfs1(int u,int f){
dep[u]=dep[f]+1,sz[u]=1;
for(auto v:g[u]) if(v!=f){
dfs1(v,u);
sz[u]+=sz[v];
}
}
ll ans=0;
int main(){
ios::sync_with_stdio(false);/*
freopen("d://in.txt","r",stdin);
freopen("d://out.txt","w",stdout);*/
cin>>n>>k;k=n-k;
rep(i,1,n){
int x,y;
cin>>x>>y;
g[x].push_back(y);
g[y].push_back(x);
}
dfs1(1,0);
rep(i,1,n+1) p[i]=mk(sz[i]-dep[i],i);
sort(p+1,p+1+n);
for(int i=n-k+1;i<=n;i++){
ans+=p[i].fi;
}
cout<<ans<<"\n";
return 0;
}
D
#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e5+10;
const int maxm=5e5+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
if(y==0) return x;
return gcd(y,x%y);
}
int n[3],a[3][maxn];
ll ans=0;
ll f(int x,int y,int z){
return 1LL*(x-y)*(x-y)+1LL*(y-z)*(y-z)+1LL*(z-x)*(z-x);
}
void solve(int x,int y,int z){
int i=0,j=0,k=0;
for(i=0;i<n[x];i++){
while(j<n[y]&&a[y][j]<a[x][i]) j++;
if(j==n[y]) return ;
while(k<n[z]&&a[z][k]<a[y][j]) k++;
if(k==n[z]) return ;/*
if(x==0&&y==1){
cout<<i<<" "<<j<<" "<<k<<endl;
}*/
int tmp=(a[z][k]+a[x][i])/2;
int idx=lower_bound(a[y],a[y]+n[y],tmp)-a[y];
int idx2=idx+1,idx3=idx-1;
if(idx>=0&&idx<n[y]) ans=min(ans,f(a[x][i],a[y][idx],a[z][k]));
if(idx2>=0&&idx2<n[y]) ans=min(ans,f(a[x][i],a[y][idx2],a[z][k]));
if(idx3>=0&&idx3<n[y]) ans=min(ans,f(a[x][i],a[y][idx3],a[z][k]));
}
}
int main(){
ios::sync_with_stdio(false);/*
freopen("d://in.txt","r",stdin);
freopen("d://out.txt","w",stdout);*/
int t;cin>>t;
while(t--){
rep(i,0,3) cin>>n[i];
rep(i,0,3) rep(j,0,n[i]) cin>>a[i][j];
rep(i,0,3){
sort(a[i],a[i]+n[i]);
n[i]=unique(a[i],a[i]+n[i])-a[i];
}
ans=INT64_MAX;
solve(0,1,2),solve(0,2,1);
solve(1,0,2),solve(1,2,0);
solve(2,0,1),solve(2,1,0);
cout<<ans<<"\n";
}
return 0;
}