Cod sursa(job #1868159)
| Utilizator | Data | 4 februarie 2017 17:10:19 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("nrtri.in");
ofstream fout ("nrtri.out");
int a[803],n,i,j,k,cont;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>a[i];
sort(a+1, a+n+1);
for(i=n; i>=3; i--)
for(j=i-1; j>=2; j--)
for(k=j-1; k>=1; k--)
if(a[i]<=a[j]+a[k])
cont++;
else break;
fout<<cont;
fin.close();
fout.close();
return 0;
}
