Submission #4037995

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <cassert>
#include <memory>
#include <stack>
#include <set>
#include <map>
#include <cctype>
#include <climits>
#include <list>
#include <queue>

#define INF 1000000000
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;cin>>N;
  vector<pair<int,int>> arr;
  for(int i=1; i<=9; i++) {
    for(int j=1; j<=9; j++) {
      int a = i * j;
      if(2025 - a == N) {
        arr.push_back(make_pair(i,j));
      }
    }
  }

  for(auto a: arr) {
    cout << a.first << " * " << a.second << endl;
  }
}

Submission Info

Judge Result