60分求助!4个TLE
查看原帖
60分求助!4个TLE
714913
NINT楼主2022/10/29 16:41
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
struct mm
{
	ull n,s;
};
int main()
{
	ull k,e,d;
	bool isis;
	cin>>k;
	mm arr[k];
	for(ull i=0;i<k;i++)
	{
		cin>>arr[i].n>>e>>d;
		arr[i].s=arr[i].n-e*d+2;
		isis=0;
		for(ull p=1;p*p<=arr[i].n&&2*p<=arr[i].s;p++)
		{
			if(arr[i].n%p==0&&arr[i].n%(arr[i].s-p)==0&&p*(arr[i].s-p)==arr[i].n)
			{
				cout<<p<<' '<<arr[i].s-p<<endl;
				isis=1;
			}
			if(isis) break;
		}
		if(!isis) cout<<"NO\n";
	}

}
2022/10/29 16:41
加载中...