Cod sursa(job #2509578)
| Utilizator | Data | 14 decembrie 2019 13:24:00 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | roadtooni | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,nr;
int a[801];
void Citire()
{
f>>n;
for(int i=1;i<=n;++i)
f>>a[i];
f.close();
}
void Solve()
{
sort(a+1,a+1+n);
for(int i=1;i<=n-2;++i)
for(int j=i+1;j<=n-1;++j)
for(int k=j+1;k<=n;++k)
if(a[i] + a[j] >= a[k]) ++nr;
}
void Afisare()
{
g<<nr;
g.close();
}
int main()
{
Citire();
Solve();
Afisare();
return 0;
}
