Cod sursa(job #1552860)
| Utilizator | Data | 18 decembrie 2015 20:23:31 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream>
using namespace std;
int nr,n,v[801],i,j,k;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int main(){
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<n;i++)
for(j=1;j<n;j++)
if(v[j]>v[j+1]){v[0]=v[j];v[j]=v[j+1];v[j+1]=v[0];}
for(i=1;i<n-1;i++)
for(j=1+i;j<n;j++)
for(k=1+j;k<=n;k++)
if(v[k]>v[i]+v[j])break;
else
{if((v[i]+v[j]>=v[k])&&(v[i]+v[k]>=v[j])&&(v[j]+v[k]>=v[i]))
nr++;
}
g<<nr;
return 0;}
