Cod sursa(job #2628918)
Utilizator | Data | 18 iunie 2020 11:34:31 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 45 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n, v[801], nr;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
sort(v+1, v+n+1);
for(int i=0; i<n-1; i++)
for(int j=i+1; j<n; j++)
for(int k=j+1; k<=n; k++)
{
int a=v[i];
int b=v[j];
int c=v[k];
if(a+b>=c && a+c>=b && b+c>=a) nr++;
}
fout<<nr;
return 0;
}