Cod sursa(job #2119801)
| Utilizator | Data | 1 februarie 2018 17:41:19 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<fstream>
#include<algorithm>
#define Nmax 810
using namespace std;
int n, a[Nmax], sol;
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
f >> n;
for (int i = 1; i <= n; ++i)
f >> a[i];
g<<n;
/*sort (a + 1, a + n + 1);
for (int i = 1; i <= n - 2; ++i)
for (int j = i + 1; j <= n - 1; ++j)
for (int k = j + 1; k <= n && a[i] + a[j] >= a[k]; ++k)
sol++;
g << sol << '\n';
*/
return 0;
}
