Cod sursa(job #2937057)
| Utilizator | Data | 9 noiembrie 2022 19:52:30 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
//Numarare triunghiuri
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("nrtri.in");
ofstream fout ("nrtri.out");
int main()
{
int nr,n[803],r=0;
fin>>nr;
for(int i=1;i<=nr;i++)
{
fin>>n[i];
}
sort(n+1,n+nr+1);
for(int i=1;i<=nr;i++)
{
for(int j=i+1;j<=nr;j++)
{
for(int k=j+1;k<=nr;k++)
{
if(n[i]+n[j]>=n[k])
{
r++;
//fout<<n[i]<<" "<<n[j]<<" "<<n[k]<<"\n";
}
}
}
}
fout<<r;
return 0;
}
