Cod sursa(job #1671098)
Utilizator | Data | 1 aprilie 2016 12:19:48 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
#include<algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int main()
{
int v[2001],n,i,nrtri=0;
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
}
sort(v+1,v+n+1);
for(i=1;i<=n;i++)
{
if(v[i]+v[i+1]>v[i+2])
nrtri++;
if(v[i]+v[i+1]==v[i+2])
nrtri++;
if(i==n-1)
break;
}
out<<nrtri;
return 0;
}