|
@@ -199,17 +199,14 @@
|
|
|
\aux{paisesQueGanaronCompetencia}{c:Competencia}{[paises]}
|
|
\aux{paisesQueGanaronCompetencia}{c:Competencia}{[paises]}
|
|
|
{\newline [ pais(ranking(c)[a]) | a \leftarrow [0.. |ranking(c) |-1 ], a <= 2 ]}
|
|
{\newline [ pais(ranking(c)[a]) | a \leftarrow [0.. |ranking(c) |-1 ], a <= 2 ]}
|
|
|
|
|
|
|
|
- // genera lista de pares con la coordenada de cada (0, 1) \newline
|
|
|
|
|
\aux{generoTodosLosParesCeroComaUno}{ls:[Bool]}{[(\ent,\ent)]}
|
|
\aux{generoTodosLosParesCeroComaUno}{ls:[Bool]}{[(\ent,\ent)]}
|
|
|
- {[ (c,c1) | c \leftarrow [0..|ls|-1], c1 \leftarrow [c.. |ls|-1], ls[c]==False \wedge ls[c1]==True ]}
|
|
|
|
|
|
|
+ {\newline[ (c,c1) | c \leftarrow [0..|ls|-1], c1 \leftarrow [c.. |ls|-1], ls[c]==False \wedge ls[c1]==True ]}
|
|
|
|
|
|
|
|
- //Filtra para que no repita prim() en la lista \newline
|
|
|
|
|
\aux{uniqPrmLista}{ls:[(\ent,\ent)]}{[(\ent,\ent)]}
|
|
\aux{uniqPrmLista}{ls:[(\ent,\ent)]}{[(\ent,\ent)]}
|
|
|
- {[ ls(i) | i \leftarrow [0..|ls|-1], j\leftarrow [i..|ls|-1], prm(ls[i]) \neq prm(ls[j]) ]}
|
|
|
|
|
|
|
+ {\newline [ ls(i) | i \leftarrow [0..|ls|-1], j\leftarrow [0..|ls|-1], i \neq j, prm(ls[i]) \neq prm(ls[j]) ]}
|
|
|
|
|
|
|
|
- //Filtra para que no repita sgd() en la lista \newline
|
|
|
|
|
\aux{uniqSgdLista}{ls:[(\ent,\ent)]}{[(\ent,\ent)]}
|
|
\aux{uniqSgdLista}{ls:[(\ent,\ent)]}{[(\ent,\ent)]}
|
|
|
- {[ ls(i) | i \leftarrow [0..|ls|-1], j\leftarrow [i..|ls|-1], sgd(ls[i]) \neq sgd(ls[j]) ]}
|
|
|
|
|
|
|
+ {\newline [ ls(i) | i \leftarrow [0..|ls|-1], j\leftarrow [0..|ls|-1], i \neq j, sgd(ls[i]) \neq sgd(ls[j]) ]}
|
|
|
|
|
|
|
|
\aux{diferenciaPrmSgd}{ls:[(\ent,\ent)]}{[\ent]}
|
|
\aux{diferenciaPrmSgd}{ls:[(\ent,\ent)]}{[\ent]}
|
|
|
{[ sgd(el) - prm(el) | el \leftarrow ls]}
|
|
{[ sgd(el) - prm(el) | el \leftarrow ls]}
|