Submission #111727

---

Source Code Expand

#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;

#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr)/sizeof(value), (value))
template <typename T>
void FILL_(void * ptr, size_t size, T value){
  std::fill((T*)ptr, (T*)ptr+size, value);
}
//4方向ベクトル→↑←↓
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};

int m,n;//国会議員の数、関係の数
int re[100][100];
int main()
{
  cin>>m>>n;
  int x,y;
  for(int i = 0; i<100;i++){
    for(int j = 0;j < 100;j++){
      re[i][j] = 0;
    }
  }
  for(int i = 0;i <n;i++){
    cin >>x>>y;
    re[x][y] = 1;
    re[y][x] = 1;
  }
  int ans1 = 1;
  int ans;
  for(int i = 1; i <= m-1;i++){
    for(int j = i+1;j <=m;j++){
      if(re[i][j] ==1){
	ans= 2;
	for(int k = 1;k <=m;k++){
	  if(re[i][k] ==1&&re[j][k] ==1&&(i!=k&&j!=k)){
	    ans++;
	  }
	}
	ans1 = max(ans1,ans);
      }
    }
  }
  cout <<ans1<<endl;
  return 0;
}

Submission Info

Judge Result