Cod sursa(job #951709)
Utilizator | Data | 21 mai 2013 15:07:42 | |
---|---|---|---|
Problema | Algoritmul Bellman-Ford | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
#include<cstdio>
using namespace std;
FILE *f,*g;
int n,m,i,x,y;
bool ok[100100];
unsigned long long xx,sol,s;
int main()
{
f=fopen("dmin2.in","r");
g=fopen("dmin2.out","w");
fscanf(f,"%d%d",&n,&m);
fprintf(g,"%Ld",1LL*n*(n-1)/2-m-n+1);
return 0;
}