Submission #4038737

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int,int> P;
 
const int INF = 1e9;
const int mod = 1e9+7;
const double EPS = 1e-10;
const double PI = acos(-1.0);

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