Cod sursa(job #1239502)
Utilizator | Data | 9 octombrie 2014 09:18:44 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int main()
{
int v[805],n,i,j,cnt,S;
in>>n;
for(i=1;i<=n;i++)in>>v[i];
sort(&v[1],&v[n+1]);
cnt=0;
for(i=1;i<n-1;i++)
{
S=v[i]+v[i+1];
for(j=i+2; j<=n && S>=v[j] ;j++)cnt++;
}
out<<cnt;
return 0;
}