Cod sursa(job #2818599)
| Utilizator | Data | 16 decembrie 2021 16:13:33 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,k=0,v[10005];
int main()
{
fin>>n;
for(int i=1;i<=n;i++){
fin>>v[i];
}
for( int x=1;x<=n-2;x++){
for(int m=x+1;m<=n-1;m++){
for(int p=m+1 ;p<=n;p++){
int a,b,c;
a=v[x];
b=v[m];
c=v[p];
if(a+b>=c && a+c>=b && b+c>=a){
k++;
}
}
}
}
fout<<k;
return 0;
}
