Codeforces Round #525 (Div. 2) Ehab and another construction problem CodeForces - 1088A

按照题意来说，答案应该不唯一，所以直接暴力写就行了，不用想太多

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string.h>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<vector>
using namespace std;
typedef long long int ll;
const int maxn =1e6+5;
const int maxm=10000;
const int mod =1e9+7;
const int INF=0x3f3f3f3f;
const double eps=1e-8;
int flag;
int main()
{
	int x;scanf("%d",&x);

	for(int a=1;a<=x;a++)
		for(int b=1;b<=x;b++)
			if(a%b==0&&a*b>x&&a/b<x)
			{
				flag=1;
				printf("%d %d\n",a,b);
				return 0;
			}
	if(!flag)printf("-1\n");
    return 0;
}