Cod sursa(job #957824)
| Utilizator | Data | 6 iunie 2013 09:27:09 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int a[801];
int main(){
int i,j,k,n,nr=0;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
sort(a+1,a+n+1);
for(i=1;i<n-1;i++)
for(j=i+1;j<n;j++){
for(k=n;k>=j+1;k--)
if(a[i]+a[j]>=a[k]&&a[i]+a[k]>=a[j]&&a[k]+a[j]>=a[i])
break;
if(k>j)
nr+=k-j;
}
g<<nr;
return 0;
}
