Cod sursa(job #1656115)
| Utilizator | Data | 18 martie 2016 19:13:26 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int a[800],n,i,aux;
int rs;
bool comp(int a,int b){
return a<b;
}
int main(){
cin>>n;
for(i=0;i<n;i++)cin>>a[i];
sort(a,a+n,comp);
for(i=0;i<n;){
for(int j=i+1;j<n;)
{
aux=j+1;
while(a[aux]<=(a[i]+a[j])&&aux<n){
aux++;
}
rs+=aux-j-1;
j++;
}
i++;
}
cout<<rs;
return 0;
}
