Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define ll long long
- #define se second
- #define fi first
- #define pb push_back
- #define pii pair<int,int>
- using namespace std;
- vector< vector<int> > g;
- bool is(int ind, int v){
- for(auto t:g[ind]) if(t==v) return true;
- return false;
- }
- bool no_same(int a, int b){
- int kol = 0;
- for(auto t:g[a]){
- if(!is(b,t)) kol++;
- }
- return kol;
- }
- main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
- int n,m;
- cin>>n>>m;
- vector< pair<int,int> > r;
- for(int i = 0; i < m; i++){
- int a,b;
- cin>>a>>b;
- a--;b--;
- r.pb({a,b});
- r.pb({b,a});
- }
- if(n<=6){
- cout<<m;
- return 0;
- }
- vector<int> i(7);
- int mx = 0;
- set< pair<int,int> > s;
- i[0] = 0;
- for(i[1] = 0; i[1] < 6; i[1]++){
- for(i[2] = 0; i[2] < 6; i[2]++){
- for(i[3] = 0; i[3] < 6; i[3]++){
- for(i[4] = 0; i[4] < 6; i[4]++){
- for(i[5] = 0; i[5] < 6; i[5]++){
- for(i[6] = 0; i[6] < 6; i[6]++){
- s.clear();
- for(auto t:r){
- s.insert({i[t.fi],i[t.se]});
- }
- mx = max(mx,(int)s.size());
- }
- }
- }
- }
- }
- }
- cout<<mx/2;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement