【无标题】cf

B. StORage room

// Problem: B. StORage room
// Contest: Codeforces - Codeforces Round 912 (Div. 2)
// URL: https://codeforces.com/contest/1903/problem/B
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)
 
#include<bits/stdc++.h>
using namespace std;
 
typedef long long ll;
const int N = 2e3+5;
 
ll n,a[N][N];
ll f[N];
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
 
	int T;
	cin>>T;
	while(T--){
		cin>>n;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				cin>>a[i][j];
			}
		}
		for(int i=1;i<=n;i++){
			f[i]=pow(2,30)-1;
		}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				if(i!=j){
					f[i]=(f[i]&a[i][j]);
				}
			}
		}
		bool flag=1;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				if(i==j) continue;
				if((f[i]|f[j])!=a[i][j]){
					flag=false;
					break;
				}
			}
		}
		if(flag==false){
			cout<<"NO"<<"\n";
		} 
		else{
			cout<<"YES"<<"\n";
			for(int i=1;i<=n;i++){
				cout<<f[i]<<" ";
			}
			cout<<"\n";
		}
	}
	
	return 0;	
 
}
 
//1 11 10 101

C. Add, Divide and Floor

#include <bits/stdc++.h>
using namespace std;
void solve()
{
	int n; cin >> n;
	vector<int> a(n + 10);
	for (int i = 1; i <= n; i++) cin >> a[i];
	int mx = 0, mn = 2e9;
	for (int i = 1; i <= n; i++)
	{
		mx = max(mx, a[i]);
		mn = min(mn, a[i]);
	}
	vector<int> ans;
	while (mx != mn)
	{
		if (mx % 2 == 0)
		{
			ans.push_back(1);
			mx /= 2, mn = (mn + 1) / 2;
		}
		else
		{
			ans.push_back(0);
			mx /= 2, mn /= 2;
		}
	}
	cout << ans.size() << endl;
	if (ans.size() <= n && ans.size() != 0)
		for (auto e : ans)
			cout << e << ' ';
	cout << endl;
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t; cin >> t;
	while (t--) solve();
}