Cod sursa(job #1684398)
| Utilizator | Data | 11 aprilie 2016 00:25:10 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.69 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,ec=0,is=0,dr=0,tr=0;
f>>N;
for(i=1; i<=N; i++)
{
f>>a[i];
}
for(i=1; i<=N; i++)
{
for(j=1; j<=N; j++)
{
for(k=1; k<=N; k++)
{
if(j==i==k || i==j || i==k || j==k)
continue;
if(i>j && i>k)
{
if(a[j]+a[k]>=a[i] && a[i]+a[k]<=a[j] && a[i]-a[j]<=a[k])
tr++;
}
}
}
}
g<<tr;
}
