PATA1121题解

水题。。

//
// main.cpp
// PATA1121
//
// Created by Phoenix on 2018/2/24.
// Copyright © 2018年 Phoenix. All rights reserved.
//#include
#include
#include
using namespace std;
const int maxn &＃61; 100010;
int couple[maxn], exist[maxn] &＃61; {0};
bool flag[maxn] &＃61; {false};int main(int argc, const char * argv[]) {fill(couple, couple &＃43; maxn, -1);int n, m;scanf("%d", &n);for(int i &＃61; 0; i }