Pagini recente » Cod sursa (job #1519183) | Cod sursa (job #1188688) | Cod sursa (job #3263556) | Cod sursa (job #2621998) | Cod sursa (job #2072451)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[802];
int main( ) {
int n, i, j, p, s;
f >> n;
for( i = 0; i < n; i++ )
f >> v[i];
sort( v, v + n );
s = 0;
for( i = 0; i < n - 2; i++ ) {
p = i + 2;
for( j = i + 1; j < n - 1; j++ ) {
if( j == p )
p++;
while( p < n && v[i] + v[j] >= v[p] )
p++;
s += p - j - 1;
}
}
g << s;
g.close();
f.close();
return 0;
}