Cod sursa(job #3237338)
| Utilizator | Data | 8 iulie 2024 13:17:56 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 1.26 kb |
#include <iostream>
#include <cmath>
#include <fstream>
#define DMAX 805
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int v[DMAX], nr;
bool pus[DMAX];
int main()
{
int n, i, j;
fin >> n;
for(i = 1; i <= n; i++)
fin >> v[i];
bool sortat;
do
{
sortat = 0;
for(i = 1; i < n; i++)
if(v[i] > v[i+1])
{
int aux = v[i];
v[i] = v[i+1];
v[i+1] = aux;
sortat = 1;
}
}
while(sortat);
int val;
for(i = 1; i < n - 1; i++)
for(j = i + 1 ; j < n ; j++)
{
int st = j + 1;
int dr = n;
val = v[i] + v[j];
while(dr - st > 1)
{
int mij = (st + dr) ;
if(v[mij] >= val)
dr = mij;
else
st = mij;
}
if(dr <= n && v[dr] == val)
nr += dr - j;
else
nr += dr - j - 1;
}
fout << nr;
return 0;
}
