ABC243 E-Edge Deletion (Floyd)

E - Edge Deletionhttps://atcoder.jp/contests/abc243/tasks/abc243_e

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int n, m;
ll d[350][350];

int main() {
	memset(d, 0x3f, sizeof(d));
	int x, y;
	ll c;
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) {
		d[i][i] = 0;
	}
	for (int i = 1; i <= m; i++) {
		scanf("%d %d %lld", &x, &y, &c);
		d[x][y] = min(d[x][y], c);
		d[y][x] = min(d[y][x], c);
	}
	for (int k = 1; k <= n; k++) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
			}
		}
	}
	int cnt = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (i == j) {
				continue;
			}
			int flag = 1;
			for (int k = 1; k <= n; k++) {
				if (k != i && k != j && d[i][j] == d[i][k] + d[k][j]) {
					flag = 0;
				}
			}
			cnt += flag;
		}
	}
	printf("%d", m - cnt / 2);
	return 0;
}