Pagini recente » Cod sursa (job #2374108) | Cod sursa (job #2909490) | Cod sursa (job #1890201) | Cod sursa (job #2613361) | Cod sursa (job #1059788)
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[150];
void sortare(int[],int n)
{
int ok=1,i;
while(ok==1)
{
ok =0;
for( i=1;i<=n;i++)if(v[i]>v[i+1])
swap(v[i],v[i+1]);
}
}
int k(int v[],int n)
{
int s=0;
for(int i=1;i<=n-2;i++){
for(int j=i+1;j<=n-1;j++){
for(int r=j+1;r<=n;r++){
if(v[i]+v[j]>=v[r])
s++;
else
break;
}
}
}
return s;
}
int main()
{
int n;
f>>n;
for(int i=1;i<=n;i++)f>>v[i];
g<<k(v,n);
return 0;
}