Codeforces1220B 矩阵简单运算 D二分图性质 不存在奇数环

Mij=a[i]*a[j]
Mii=0 告诉M矩阵求原先的A数组
n 3-1000

推Mii 但是ai不能直接开根 有误差

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
const int maxn=2e5+5;
const int INF=0x3f3f3f3f;
ll n,sum,tmp,pos,T,cnt,x;
ll a[1005][1005];
ll gcd(ll a,ll b){
	return b==0?a:gcd(b,a%b);
}
int main(){
	cin>>n;
	rep(i,1,n){
		rep(j,1,n){
			cin>>a[i][j];
		}
	}
	rep(i,1,n){
		a[i][i]=a[i][(i+1)%n+1]*a[i%n+1][i]/a[i%n+1][(i+1)%n+1];

	}
	rep(i,1,n){
		x=sqrt(a[i][i]);
		if((x+1)*(x+1)<=a[i][i])
			x++;
		else if(x*x>a[i][i])
			x--;
		cout<<x<<" ";
	}
	cout<<endl;
	return 0;
}

ll n,sum,tmp,pos,T,cnt,x;
ll a[1005][1005],ans[1005];
ll gcd(ll a,ll b){
	return b==0?a:gcd(b,a%b);
}
int main(){
	cin>>n;
	rep(i,1,n){
		rep(j,1,n){
			cin>>a[i][j];
		}
	}
	ans[1]=sqrt(a[1][2]*a[1][3]/a[2][3]);
	rep(j,2,n){
		ans[j]=a[1][j]/ans[1];
	}
	rep(i,1,n){
		cout<<ans[i];
		if(i!=n)
			cout<<" ";
		else
			cout<<endl;
	}
	return 0;
}

C
找当前位置之前最小的字典序严格<当前位置字符
k代表位置 可以取0-n
取0 Ann无法移动 输
Ann能够移动到之前最小的字典序 Mike无法移动 实际一轮结束

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
const int maxn=2e5+5;
const int INF=0x3f3f3f3f;
ll n,sum,tmp,pos,T,cnt,x;
ll a[1005][1005],ans[1005];
string s;
ll gcd(ll a,ll b){
	return b==0?a:gcd(b,a%b);
}
int last=(int)'z';
int main(){
	cin>>s;
	n=s.size();
	for(int i=0;i<n;i++){
		if(last<s[i]-'a')
		{
			cout<<"Ann"<<endl;
		}
		else
			cout<<"Mike"<<endl;
		last=min(last,s[i]-'a');	//当前最小的字典序 
	}
	
	return 0;
}

D

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
const int maxn=2e5+5;
const int INF=0x3f3f3f3f;
ll n,sum,tmp,pos,T,x;
ll a[maxn],cnt[maxn],maxx,num[maxn];
string s;
int main(){
	cin>>n;
	rep(i,1,n){
		cin>>a[i];
	}
	rep(i,1,n){
		tmp=a[i];
		while(tmp && tmp%2==0){
			tmp/=2;
			cnt[i]++;
		}
		num[cnt[i]]++;
	}
	maxx=0;	//次数最大的保留 /2同次数的 0 出现2个 1 出现1个 
	for(int i=1;i<=63;i++){	//ll 2^63-1
		if(num[i]>num[maxx])
			maxx=i;	//0ci的2个 
	}
	cout<<n-num[maxx]<<endl;	//删1个 
	for(int i=1;i<=n;i++){
		if(cnt[i]!=maxx	) //0次的保留 1次的输出 
			cout<<a[i]<<" ";
	}
	return 0;
}