Cod sursa(job #970746)
| Utilizator | Data | 7 iulie 2013 18:34:57 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream>
#include<algorithm> l
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,l[801],nr;
void ReadInput()
{
f>>n;
for(int i=1;i<=n;i++) f>>l[i];
sort(l+1,l+n+1);
}
void Solve()
{
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(l[k]<=l[i]+l[j]) nr++;
else break;
g<<nr<<'\n';
}
int main()
{
ReadInput();
Solve();
f.close();g.close();
return 0;
}
