/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 548.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 2ms 320.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
const int MOD = 998244353;
const int N = 1e6 + 9;
//    const uint M=(1<<31)

// int pref_xor[N];

// int a[N];
// int cnt[30][2];
//    vector<int>v(n);
//    bitset<M>a;

// vector<int> v(n + 1);

void pari_na_kisu()

{
    int n, m;
    cin >> n >> m;
    cout << n - m << '\n';
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    // cout << "Case " << (++cs) << ": ";
    pari_na_kisu();
}

Information

Submit By
Type
Submission
Problem
P1226 Event Registration
Contest
LUCC Presents Intra LU Junior Programming Contest - Replay
Language
C++17 (G++ 13.2.0)
Submit At
2025-09-02 16:05:13
Judged At
2025-09-02 16:05:13
Judged By
Score
100
Total Time
2ms
Peak Memory
548.0 KiB