Pagini recente » Cod sursa (job #125928) | Istoria paginii runda/asdasdassdasd | Cod sursa (job #642289) | Istoria paginii runda/preoni_nicu3 | Cod sursa (job #2609984)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int i, j, k, v[800],n, aux, nr = 0;
fin >> n;
for (i = 0; i < n; i++)
fin >> v[i];
for (i = 0; i < n-1; i++)
for (j = i + 1; j < n; j++)
if (v[i] > v[j])
{
aux = v[i];
v[i] = v[j];
v[j] = aux;
}
for (i = 0; i < n - 2; i ++)
for (j = i + 1; j < n - 1; j ++)
for (k = j + 1; k < n && v[i] + v[j] >= v[k]; k ++)
nr++;
fout << nr;
fin.close();
fout.close();
return 0;
}