Cod sursa(job #585140)
| Utilizator | Data | 28 aprilie 2011 09:20:29 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
using namespace std;
int n,t[805],rez;
void bs()
{int ok,j,a;
do
{ok=0;
for(j=0;j<n-1;++j)
if(t[j]>t[j+1])
{a=t[j];
t[j]=t[j+1];
t[j+1]=a;
ok=1;
}
}while(ok);
}
int main()
{ifstream i("nrtri.in");
ofstream o("nrtri.out");
i>>n;
for(int k=0;k<n;++k)i>>t[k];
bs();
int j,l;
for(int k=0;k<n-2;++k)
for(j=k+1;j<n-1;++j)
for(l=j+1;l<n && t[k]+t[j]>=t[l];++l)
++rez;
o<<rez<<'\n';
i.close();
o.close();
return 0;
}
