제출 #345230

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345230		pragmatist	결혼 문제 (IZhO14_marriage)	C++14	2 / 100	22 ms	512 KiB

marriage

// turmak-_-
#include<bits/stdc++.h>

#define all(v) v.begin(),v.end()
#define sz(a) a.size()
#define nl "\n"
#define IOI return 0;
#define pb push_back
#define ppb pop_back()
#define ll long long
#define ull unsigned long long
#define ld long double
#define IOS ios_base :: sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
#define pii pair<int,int>
#define X first
#define Y second


using namespace std;
const int N = (int)1e5 + 7 ;
const ll MOD = (ll)998244353;
const ll INF = (ll)1e18 + 7;
const int inf = (int)1e9 + 7;

pii dx[] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

void solve() {
    int n,m,k;
    cin>>n>>m>>k;
    for(int i=1; i<=k; ++i) {
        int x,y;
        cin>>x>>y;
    }
    int h = n*(n+1)/2;
    cout<<rand() % h + 1;
}
int main() {
    IOS
    srand(time(0));
    //freopen("cinema.in", "r", stdin);
    //freopen("cinema.out", "w", stdout);
    int tt=1;
    //cin>>tt;
    while(tt--) {
        solve();
    }
    IOI
}

• Subtask 1: 2 / 100