Submission #7051129

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <math.h>
#include <map>
#include<cmath>
#include<queue>

typedef long long ll;
using namespace std;
#define mod 10007
#define rep(i,n) for(ll i=0;i<n;i++)

int main(){
    ll n; cin >> n;
    ll sum=0;
    for(ll i=1;i<=9;i++){
        for(ll j=1;j<=9;j++){
            sum+=i*j;
        }
    }
    ll dif=sum-n;
    for(int i=1;i<=9;i++){
        for(int j=1;j<=9;j++){
            ll mul=i*j;
            if(mul==dif){
                cout << i << " x " << j << endl;
            }
        }
    }
    return 0;
}

Submission Info

Judge Result