Cod sursa(job #938906)
| Utilizator | Data | 14 aprilie 2013 13:20:42 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <cstdio>
#include <algorithm>
#define NMAX 5002
using namespace std;
int n,nr;
int V[NMAX];
inline void citesc(){
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
scanf("%d",&n);
for(register int i=1;i<=n;++i)
scanf("%d",&V[i]);
}
inline void solve(){
sort(V+1,V+n+1);
for(register int i=1;i<=n-2;++i)
if(V[i]+V[i+1] >=V[i+2])
++nr;
printf("%d",nr);
}
int main(){
citesc();
solve();
return 0;
}
