Cod sursa(job #2518264)
| Utilizator | Data | 5 ianuarie 2020 13:55:30 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n, v[1001],nr;
bool ok;
void sortare()
{
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]);
}
int main()
{f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
sortare();
for(int i=1;i<n-2;i++)
for(int j=i+1;j<n-2;j++)
{ok=1;
for(int z=j+1;z<n;z++){
if(v[i]+v[j]>v[z])
nr++;
else
ok=0;
}
}
g<<nr;
return 0;
}
