Submission #2550850

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, b) for(int i=(a);i<(b);++i)
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int INF = (1 << 30) - 1;
const ll INF64 = ((ll)1 << 62) - 1;
const ll MOD = 1e9 + 7;
const double PI = 3.1415926535897932384626433832795;

int main()
{
	int n;
	cin >> n;
	n = 2025 - n;
	for (int i = 1; i <= 9 ; ++i)
	{
		for (int j = 1; j <= 9 ; ++j)
		{
			if (i * j == n)
			{
				cout << i << 'x' << j << endl;
			}
		}
	}
	return 0;
}

Submission Info

Judge Result