Submission #3978196

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<stack>
#include<queue>
#include<bitset>

#define ipair pair<int,int>
#define rep(i,n) for(i=0;i<n;i++)

using namespace std;

typedef long long int lli;
typedef vector<int> vi;

int main() {
	vector<string>s;
	int i, j, k, n, m;

	cin >> n;
	m = 2025 - n;
	
	rep(i, 10) {
		rep(j, 10) {
			if (i*j > m)
				break;
			else if (i*j == m) 
				s.push_back(to_string(i) + " x " + to_string(j));
		}
	}

	k = s.size();
	rep(i, k) {
		cout << s[i] << endl;
	}

	return 0;
}

Submission Info

Judge Result