顶点度问题539deg.cpp

来自「设计一个算法」· C++ 代码 · 共 33 行

#include<iostream>                         
#include<fstream>
#include <time.h>
using namespace std;
clock_t start,finish;
ifstream in("input.txt");
ofstream out("output.txt");
void main()
{
	start=clock();
	if(in.fail()){
		cout<<"input is not exit"<<endl;
		exit(1);
	}
	int n,e,u,v,i;
	in>>n>>e;
	int *Vertices=new int[n];
	for(i=1;i<=n;i++)
		Vertices[i]=0;
	for(i=1;i<=e;i++){
		in>>u>>v;
		Vertices[u]++;
		Vertices[v]++;
	}
	for(i=1;i<=n;i++)
		out<<Vertices[i]<<' ';
	finish=clock();
	cout<<finish-start<<endl;
}