Pagini recente » Cod sursa (job #294604) | Cod sursa (job #2349295) | Cod sursa (job #837116) | Cod sursa (job #2647758) | Cod sursa (job #1826323)
# include <algorithm>
# include <cstdio>
# define MAX_N 2000
int l[MAX_N];
int main() {
FILE *fin = fopen( "nrtri.in", "r" ), *fout = fopen( "nrtri.out", "w" );
int n, i, j, k, s;
fscanf( fin, "%d", &n );
for ( i = 0; i < n; i ++ )
fscanf( fin, "%d", &l[i] );
std::sort( l, l + n );
s = 0;
for ( i = 0; i < n; i ++ ) {
k = i + 2;
for ( j = i + 1; j < n; j ++ ) {
while ( k < n && l[i] + l[j] >= l[k] )
k ++;
if ( k - j - 1 > 0 )
s += k - j - 1;
}
}
fprintf( fout, "%d", s );
fclose( fin );
fclose( fout );
return 0;
}