Submission #2116442

---

Source Code Expand

#include<vector>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<functional>
#include<queue>
#include<stack>
#include<string.h>
#include<list>
#define MOD 1000000007LL
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
int main() {
    int N;
    cin>>N;
    for(int h=1;h<=3500;h++){
        for(int n=1;n<=3500;n++){
            ll a=N*h*n;
            ll b=4*h*n-N*(n+h);
            if(b==0){
                continue;
            }
            if(a%b==0){
                int w=a/b;
                if(w>0){
                    cout<<h<<" "<<n<<" "<<w<<endl;
                    return 0;
                }
            }
        }
    }
}

Submission Info

Judge Result