Cod sursa(job #1614619)
Utilizator | Data | 26 februarie 2016 00:28:58 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[800],n,i,a,b,c,k=0;
f>>n;
for(i=0;i<n;i++)
f>>v[i];
sort(v,v+n);
for(a=0;a<n-2;a++)
for(b=a+1;b<n-1;b++)
for(c=b+1;c<n;c++)
{
if(v[a]+v[b]<v[c])
break;
else if(v[a]+v[b]==v[c]){ k++; break;}
else k++;
}
g<<k;
}