Cod sursa(job #2609681)
Utilizator | Data | 3 mai 2020 00:04:35 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
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 main()
{ int n, v[30000], rez=0;
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
sort(v, v+n);
for(int i=1; i<=n-2;i++)
for(int p=i+1;p<=n;p++)
for(int j=i+2;j<=n;j++)
if((v[i]+v[p])<v[j])
rez++;
g << rez;
return 0;
}