【求条】方程做法 WA
查看原帖
【求条】方程做法 WA
1328469
glass_goldfish楼主2025/7/23 11:12
#include<bits/stdc++.h>//T2 done
#define int long long
#define INF 1145141919810
using namespace std;
int t,n,d,e;
int cnt,a[1201],use[1201];
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>t;
	while(t--){
		cin>>n>>d>>e;
		int m=n-e*d+2;
		int q=sqrt((m*m*1.0)/4.0-n*1.0)+m/2.0;
		int p=n/q;
		if(p*q==n&&p+q==m)cout<<min(p,q)<<" "<<max(p,q)<<"\n";
		else{
			p=m/2.0-sqrt((m*m*1.0)/4.0-n*1.0);
			q=n/q;
			if(p*q==n&&p+q==m)cout<<min(p,q)<<" "<<max(p,q)<<"\n";
			else cout<<"NO\n";
		}
	}
    return 0;
}

70 pts,求条,让我 AC 者必关

2025/7/23 11:12
加载中...