Cod sursa(job #3331085)
| Utilizator | Data | 24 decembrie 2025 13:22:41 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
int x[30005];
int main (){
ifstream fin("nrtri.in");
ofstream fout ("nrtri.out");
int n,i,j,k,s;
fin >> n;
for(i=0;i<n;i++)
fin >> x[i];
sort(x,x+n);
s=0;
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
for(k=j+1;k<n&&x[k]<x[i]+x[j];k++)
if(x[i]+x[j]>x[k]&&x[k]+min(x[i],x[j])>max(x[i],x[j]))
s++;
fout << s;
return 0;
}
