Submission #1568766

---

Source Code Expand

#include <functional>
#include <algorithm>
#include <iostream>
#include <memory.h>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <assert.h>
#include <bitset>
#include <string>
#include <cstdio>
#include <math.h>
#include <complex>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
using namespace std;

#define int64 long long
#define mp make_pair
#define ull unsigned long long


#ifdef _DEBUG
	const int N = 101;
#else
	const int N = 500;
#endif
const int M = 70; 

const int MOD = 1e9+7;

int n, m;
int cnt[N][N];

vector <pair<int, int> > g[N];

void dfs(int root, int v, int prev)
{
	cnt[root][v]++;
	if (cnt[root][v] > 1) return;
	for (int i = 0; i < g[v].size(); i++)
	{
		if (g[v][i].second < prev)
		{
			dfs(root, g[v][i].first, g[v][i].second);
		}
	}
}

int main()
{
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; i++)
	{
		int a, b;
		scanf("%d%d", &a, &b);
		g[a].push_back(mp(b, i));
		g[b].push_back(mp(a, i));
	}
	for (int i = 1; i <= n; i++)
	{
		dfs(i, i, m + 1);
	}
	int ans = 0;
	for (int i = 1; i <= n; i++)
	{
		for (int j = i + 1; j <= n; j++)
		{
			bool flag = true;
			for (int k = 1; k <= n; k++)
			{
				if (cnt[i][k] + cnt[j][k] > 1)
				{
					flag = false;
					break;
				}
			}
			if (flag) ans++;
		}
	}
	cout << ans;
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:62:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
                       ^
./Main.cpp:66:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
                        ^

Judge Result