Cod sursa(job #1705170)
Utilizator | Data | 20 mai 2016 00:17:08 | |
---|---|---|---|
Problema | Diametrul unui arbore | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
using namespace std;
int n,a,b,c,d,ss,ds,sj,dj, nr=0, suma;
int main()
{
cin>>n>>a>>b>>c>>d;
if(a<=n && b<=n && c<=n && d<=n && a>0 && b>0 && c>0 && d>0)
for(ss=1;ss<=n;ss++)
{
suma=a+b+ss;
ds=suma-a-c;
sj=suma-b-d;
dj=suma-d-c;
if(ds>0 && sj>0 && dj>0 && ds<=n && sj<=n && dj<=n){
nr++;
}
}
else
nr=0;
cout<<nr*n;
return 0;
}