Cod sursa(job #2418723)
| Utilizator | Data | 5 mai 2019 22:07:39 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include<iostream>
#include<algorithm>
#include<fstream>
using namespace std;
ifstream fin ("nrtri.in");
ofstream fout ("nrtri.out");
int n,a[801],aux[3],k=0;
void verifica (int c[4])
{
sort(c,c+3);
if(c[0]+c[1]>=c[2])
k++;
}
void bkt(int l, int poz)
{
if(l==4)
{
verifica(aux);
}
else
{
for(int i=poz;i<=n;i++,poz++)
{
aux[l-1]=a[i];
bkt(l+1,poz+1);
}
}
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
bkt(1,1);
cout<<k;
}
