Submission #1192465

---

Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
typedef pair<ll,ll>pll;
vb used(10,true);
map<pii,int>mp;
int hoge;
void solve(int a,int b){
    if(a*b==hoge){pii t=pii(a,b);mp[t]++; return; }
    for(int i=b+1;i<=9;i++)
        solve(a,i);
    return;
    
}
int main(){
    int n; cin>>n;
    int let=0;
    rep(i,10)rep(j,10)let+=i*j;
    hoge=let-n;
    for(int i=1;i<10;i++)solve(i,1);
    for(auto itr=mp.begin(); itr!=mp.end();itr++){
        cout<<itr->first.first<<"x"<<itr->first.second<<endl;
    }
    return 0;
}

Submission Info

Judge Result