Cod sursa(job #2326581)
Utilizator | Data | 23 ianuarie 2019 18:05:25 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int n,cnt;
int v[815];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
for(int i=1;i<n-1;i++)
for(int j=i+1;i<n;j++)
for(int k=j+1;k<=n;k++)
if(v[i]+v[j]>=v[k] && v[i]+v[k]>=v[j] && v[k]+v[j]>=v[i]) cnt++;
return 0;
}