Cod sursa(job #1684406)
| Utilizator | Data | 11 aprilie 2016 00:41:15 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
#define MAXN 805
int N;
int a[MAXN];
int main()
{
int i,j,k,tr=0;
f>>N;
for(i=1; i<=N; i++)
{
f>>a[i];
}
for(i=1; i<=N; i++)
{
for(j=i+1; j<=N; j++)
{
for(k=j+1; k<=N; k++)
{
if(a[j]+a[k]>=a[i] && a[i]+a[k]>=a[j] && a[i]+a[j]>=a[k])
tr++;
}
}
}
g<<tr;
}
