Codeforces Round #628 (Div. 2) A~~D

#include<bits/stdc++.h>
 
using namespace std;
typedef long long ll; 
 
int main(){
	int t;
	cin>>t;
	while(t--){
	ll x;
	cin>>x;
	cout<<"1"<<" "<<x-1<<endl; 
} }

#include <bits/stdc++.h>

using namespace std;
typedef long long ll; 
set<ll> st; 

int main(){
	int t;
	cin >>t;
	while(t--){
		st.clear();
       ll n;
		cin >>n;
		 ll res;
		for(ll i=0;i<n;i++){
			cin>>res;
			st.insert(res);
		} 
		cout <<st.size()<<endl;
	}
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5+10;

int du[maxn];
struct node 
{
	int u,v,id,mid,ans;
}e[maxn];
 
bool cmp(node a,node b)
{
	return a.mid<b.mid;
}
 
bool cm(node a,node b)
{
	return a.id<b.id;
}
int main()
{
	ios::sync_with_stdio(0);
	int n;
	cin>>n;
	for(int i=1;i<n;i++)
	{
		int u,v;
		cin>>u>>v; 
		du[u]++,du[v]++;
		e[i].u = u; e[i].v = v; e[i].id = i;
	}
	for(int i=1;i<n;i++)	
		e[i].mid=min(du[e[i].u],du[e[i].v]);
	sort(e+1,e+n,cmp);
	for(int i=1;i<n;i++) 
		e[i].ans=i;
	sort(e+1,e+n,cm);
	for(int i=1;i<n;i++) {
		cout<<e[i].ans-1<<endl; 
	}
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define pb push_back
int main()
{
	ios::sync_with_stdio(0);
	ll u,v;
	cin>>u>>v;
	if(u>v||(v-u)&1) 
	{
		cout<<"-1"<<endl;
		return 0;
	}
	ll a=u,b=(v-u)/2,c=(u+v)/2,mid=b^c;
	if(u==v&&u==0){
		cout<<"0"<<endl;
		return 0;
	}
	if(u==v){
		cout<<1<<endl<<u<<endl;;
		return 0;
	}
	if(mid==u&&b+c==v){
		cout<<"2"<<endl<<b<<" "<<c<<endl;
	}else{
		cout<<"3"<<endl<<u<<" "<<b<<" "<<b<<endl;
	}
	return 0;
}