Cod sursa(job #1767707)
Utilizator | Data | 29 septembrie 2016 16:53:58 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
#define NMAX 801
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int n,a[NMAX],contor;
int main()
{
in >> n;
for(int i=0;i<n;i++)
{
in >> a[i];
}
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
for(int k=j+1;k<n;k++)
{
if(a[i]+a[j]>=a[k] && a[i]+a[k]>=a[j] && a[j]+a[k]>=a[i])
{
contor++;
// cout << i << " " << j << " " << k <<endl;
}
}
}
}
out << contor;
return 0;
}