Cod sursa(job #1059400)
| Utilizator | Data | 16 decembrie 2013 17:29:40 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[10005];
int nrtri(int v[],int n)
{
int s=0;
for(int i=1;i<=n-2;++i)
{
for(int j=++i;j<=n-1;++j)
{
for(int k=++j;k<=n;++k)
{
if(v[i]+v[j]>=v[k]) ++s;
else break;
}
}
}
}
int main()
{
int n;
f >>n;
for(int i=1;i<=n;++i) f>>v[i];
sort(v+1,v+n+1);
g<<nrtri(v,n);
return 0;
}
