Cod sursa(job #2312832)
Utilizator | Data | 5 ianuarie 2019 16:28:21 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[805],i,n,j,k,cont;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n-2;i++)
{
for(j=i+1;j<=n-1;j++)
for(k=j+1;k<=n;k++)
if((v[i]+v[j])>=v[k])
cont++;
}
g<<cont;
return 0;
}