Submission #1591746

---

Source Code Expand

#include <stdio.h>

int N,M;
bool d[12][12];
int x,y;
int ans=0;
int tmp;
bool ok;
int main(){
  scanf("%d %d",&N, &M);

  for(int i=0;i<M;i++){
    scanf("%d %d",&x,&y);
    d[x-1][y-1]=d[y-1][x-1]=true;
  }
  for(int S=0;S < 1<<N;S++){
    ok=true;
    tmp=0;
    for(int i=0;i<N;i++){
      if(S>>i&1){
        tmp++;
      }else{
        continue;
      }
      for(int j=i+1;j<N;j++){
        if(S>>j&1 && !d[i][j]){
          ok=false;
        }
      }
    }
    if(ok&&ans<tmp)
      ans=tmp;
  }
  printf("%d\n",ans );
}


/*#include <stdio.h>
#include <vector>
#include <queue>
#include <set>

using namespace std;

typedef pair<int,int> s;

vector<s> rel;
queue<int> qu;
set<int> st;

int  N,M;
int x,y;
int sum=0;
bool used[12];
int tmp=0;
int last=0;
void dfs(int c){
  if(c==N){
    sum = max(sum, st.size());
    return;
  }
  for(auto r : rel){
    if(r.first == c){
      qu.push(r.second);
    }
  }
}

int main(){
  scanf("%d %d", &N, &M);
  for(int i=0;i<M;i++){
    scanf("%d %d", &x, &y);
    rel.push_back(s(x-1,y-1));
  }
  for(int i=0;i<N;i++)used[i]=false;
  for(int i=0;i<N;i++){
    tmp=0;
    qu.push(i);
    while(!qu.empty()){
      int first = qu.front();
      qu.pop();
      if(!used[first]){
        tmp++;
        used[first]=true;
        for(auto r : rel){
          if(r.first == first){
            qu.push(r.second);
          }
        }
      }
    }
    if(sum<tmp)sum=tmp;
  }
  printf("%d\n", sum);
}
*/

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&N, &M);
                        ^
./Main.cpp:13:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&x,&y);
                         ^

Judge Result