提出 #10111609

---

ソースコード 拡げる

#include <iostream>
#include <cmath>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <cstring>
#include <fstream>
#include <cstdlib>
#include <cassert>
#include <utility>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;

#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair < int, int >
#define pll pair < long long, long long>
#define ull unsigned long long
#define vi vector < int >
#define vll vector < long long >
#define sz(a) (int)a.size()
#define forit(it, s) for(__typeof(s.begin()) it = s.begin(); it != s.end(); it++)
#define all(a) a.begin(), a.end()
#define sqr(x) ((x) * (x))
#define fname "searching"

const int inf = (int)1e9;
const ll INF = (ll)1e18;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int mod = (int)1e9 + 7;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    // freopen("a_in", "r", stdin);
    // freopen("a_out", "w", stdout);
    string s, t, u;
    int a, b;
    cin >> s >> t >> a >> b >> u;
    a -= u == s;
    b -= u == t;
    cout << a << " " << b << "\n";
    return 0;
}

提出情報

ジャッジ結果