Cod sursa(job #111066)
| Utilizator | Data | 28 noiembrie 2007 16:28:41 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 70 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
var
fi,fo:text;
a:array[1..800]of longint;
i,j,k,nr,n:longint;
begin
assign(fi,'nrtri.in');reset(fi);
assign(fo,'nrtri.out');rewrite(fo);
readln(fi,n);
for i:= 1 to n do
read(fi,a[i]);
for i:= 1 to n-2 do
for j:= (i+1) to n-1 do
begin
for k:= j+1 to n do
if a[i]+a[j]>=a[k] then
if a[i]+a[k]>=a[j] then
if a[j]+a[k]>=a[i] then
inc(nr);
end;
writeln(fo,nr);
close(fo);
end.
