Cod sursa(job #2537395)
| Utilizator | Data | 3 februarie 2020 17:12:58 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream r("nrtri.in");
ofstream w("nrtri.out");
int v[801];
int main()
{
int n, x=0, y=1, yy, z=2, zz, nr=0;
r>>n;
for(int i=0; i<n; i++)
{
r>>v[i];
}
sort(v, v+n);
while(x<=n-1)
{
yy=y;
zz=z;
while(yy<=n-2)
{
while(v[x]+v[yy]>=v[zz] && zz<=n-1)
{
zz++;
nr++;
}
yy++;
}
z++;
y++;
x++;
}
w<<nr;
return 0;
}
