Pagini recente » Cod sursa (job #446738) | Cod sursa (job #1707754) | Cod sursa (job #2024134) | Cod sursa (job #304079) | Cod sursa (job #983467)
Cod sursa(job #983467)
#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <climits>
using namespace std;
ifstream fin ("nrtri.in");
ofstream fout("nrtri.out");
#define MAX 32768
int n,A,B,a[MAX],i,j,b[MAX],k;
void sort()
{
int ok,k=0;
do
{
ok=1;
for(i=1;i<n-k;i++)
{
if(a[i]>a[i+1])
{
int t=a[i];
a[i]=a[i+1];
a[i+1]=t;
ok=0;
}
}
k++;
}while(!ok);
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
sort();
int count=0;
for(i=1;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
for(k=j+1;k<=n;k++)
{
if(a[i]+a[j]>=a[k])
{
count++;
}
}
}
}
fout<<count;
return 0;
}