Pagini recente » Cod sursa (job #439168) | Cod sursa (job #438504) | Cod sursa (job #564684) | Cod sursa (job #672742) | Cod sursa (job #1584777)
#include <fstream>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
const int nmax=800;
int v[nmax+1];
int main () {
int n;
fin>>n;
int n2;
for (n2 =1; n2<=n; n2*=2 ) {
}
n2/=2;
for (int i=1; i<=n; i++) {
fin>>v[i];
}
for (int i=1; i<=n; i++) {
int j=i;
while (j>=2 && v[j]<v[j-1]) {
int a=v[j-1];
v[j-1]=v[j];
v[j]=a;
j--;
}
}
int sol=0;
for (int i=1; i<=n-2; i++) {
for (int j=i+1; j<=n-1; j++) {
for (int k=j+1; k<=n; k++) {
if (v[i]+v[j]>=v[k]) {
sol++;
}
}
}
}
fout<<sol<<"\n";
return 0;
}