Pagini recente » Cod sursa (job #3362106) | Cod sursa (job #3362031) | Cod sursa (job #3362107) | Cod sursa (job #3363627)
#include <fstream>
#include <iostream>
using namespace std;
const int VMAX=800;
int v[VMAX];
void sortV(int v[],int n){
bool sortot=0;
while(!sortot){
sortot=1;
for(int i=0;i<n-1;i++){
if (v[i]>v[i+1]){
int aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
sortot=0;
}
}
}
}
int nrTri(int v[],int n){
int ans=0,st,dr;
for(int i=1;i<=n-2;i++){
st=i+1;
dr=i+1;
while(st<=n-1){
while(dr<=n && v[i]+v[st]>=v[dr+1]){
dr++;
}
ans+=dr-st;
st++;
}
}
return ans;
}
int main()
{
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n;
fin>>n;
for(int i=0;i<n;i++){
fin>>v[i];
}
sortV(v,n);
for(int i=0;i<n;i++){
cout<<v[i];
}
fout<<nrTri(v,n);
}