Submission #61376114

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <ctime>
#include <map>
#include <set>

#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define vi vector<int>
#define MP make_pair
#define ld long double
#define ll long long
#define pb push_back
#define ss second
#define ff first

using namespace std;

const ll lINF = 1000000000000000007;
const int iINF = 1000000007;
const int INF = 1e5+1;

/*
*/

void solve() {
    int x; cin >> x;
    vector<vector<int>> v(9, vector<int>(9));
    for (int i = 1; i <= 9; i++) {
        for(int j = 1; j <= 9; j++) {
            v[i-1][j-1] = i*j;
        }
    }
    ll sum = 0;
    for (int i = 1; i <= 9; i++) {
        for (int j = 1; j <= 9; j++) {
            if(v[i-1][j-1] != x) {
                sum += v[i-1][j-1];
            }
        }
    }
    cout << sum;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int tt = 1;
    // cin >> tt;
    while(tt --){
        solve();
        cout << '\n';
    }
    return 0;
}

Submission Info

Judge Result