Cod sursa(job #1501632)
Utilizator | Data | 13 octombrie 2015 18:10:44 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int v[810];
int main()
{
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
int k=0,n;
scanf("%d",&n);
for(int a=0;a<n;a++) scanf("%d",&v[a]);
sort(v,v+n);
for(int a=0;a<n-2;a++)
for(int b=a+1;b<n-1;b++)
for(int c=c+1;c<n;c++)
if(v[a]+v[b]>=v[c]) k++;
else break;
printf("%d",k);
return 0;
}