Cod sursa(job #957868)
| Utilizator | Data | 6 iunie 2013 10:46:22 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,x[801]; int main()
{ f>>n;
for(int i=1;i<=n;++i) f>>x[i];
int nr=0;
sort(x+1,x+n+1);
for(register int i=1;i<=n-2;++i)
for(register int j=i+1;j<=n-1;++j)
for(register int k=j+1;k<=n;++k)
if(x[k]<=x[i]+x[j]) nr++; else k=n;
g<<nr<<'\n';
g.close();
return 0; }