Cod sursa(job #320496)
| Utilizator | Data | 4 iunie 2009 20:16:31 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include<fstream>
using namespace std;
ifstream in("ntri.in");
ofstream out("ntri.out");
int i,j,k,v[801];
void citire(int &n)
{
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
}
void sortare(int n)
{
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(v[i]<v[j])
{
v[i]=v[i]+v[j];
v[j]=v[i]-v[j];
v[i]=v[i]-v[j];
}
}
int main()
{
int n;
citire(n);
sortare(n);
int s=0;
for(i=1;i<=n-2;i++)
{
k=i+2;
for(j=i+1;j<=n-1;j++)
{
while(k<=n && (v[i]+v[j]<=v[k]))
k++;
s=s+k-j;
}
}
out<<s;
return 0;
}
