Cod sursa(job #2436811)
| Utilizator | Data | 7 iulie 2019 12:55:53 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int v[30001] , n , poz , nr ;
int main()
{
int i , j , q;
in>>n;
for (i=0 ; i<n ; i++)
{
in>>poz;
v[poz]++;
}
n=30000;
for (i=0 ; i<n-2 ; i++)
if (v[i])
for (j=i+1 ; j<n-1 ; j++)
if ( v[j] )
for (q=j+1 ; q<n ; q++ )
if (v[q] && i+j>=q )
nr++;
out<<nr;
return 0;
}
