PTA L1-095 分寝室

#include <iostream>
#include <algorithm>

using namespace std;
int vis,flag,minn=0x3f3f3f3f;
int n1,n2,n;
int num1,num2;
int main(){
    cin>>n1>>n2>>n;
    for(int i=1;i<n;i++){
        if(n1>i&&n2>(n-i)&&n1%i==0&&n2%(n-i)==0){
        	flag=1;
        	num1=n1/i;num2=n2/(n-i);
           	int ab=abs(num1-num2);
        	if(ab<minn) vis=i,minn=num1-num2;
		}
    }
    if(!flag) cout<<"No Solution"<<endl;
    else cout<<vis<<" "<<n-vis<<endl;
}