Cod sursa(job #2326297)
| Utilizator | Data | 23 ianuarie 2019 13:46:09 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | simulare_preoli | Marime | 0.75 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n, a[1000];
int cont;
int main()
{
f>>n;
for(int i = 1; i <= n; i++)
{
f>>a[i];
}
for(int i = 1; i <= n; i++)
for(int j = i + 1; j <= n; j++)
for(int k = j + 1; k <= n; k++)
if(i != j && i != k && j != k)
{
int maxx = max(a[i], max(a[j], a[k])), minn = min(a[i], min(a[j], a[k]));
int mid = a[i] + a[j] + a[k] - minn - maxx;
if(mid + minn >= maxx )
{
cont++;
}
}
g<<cont;
return 0;
}
