Cod sursa(job #3360719)
| Utilizator | Data | 16 iulie 2026 10:12:57 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int v[801];
int main()
{
int n,sol=0;
fin>>n;
for(int i=1;i<=n;i++){
fin>>v[i];
}
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
if(v[i]>v[j]){
swap(v[i],v[j]);
}
}
}
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
for(int y=j+1;y<=n;y++){
if(v[i]+v[j]>=maxim){
sol++;
}
}
}
}
fout<<sol;
return 0;
}
