juanfal

# leeEquipoBaloncestoDicDic.py
# juanfc 2020-01-13
# https://gist.github.com/6734ff330b6e204306b9de677531ab56

# nombre, siempre terminado en coma ‘,’
# - dorsal
# - posición:
# Base, Escolta, Alero, aLa-pivot, Pivot,
#  B    E        A       L         P
# - promedio de puntos (número real)

juanfal

Berni Rodriguez, 5, E, 5.2, 1.7
Luka Zoric, 21, P, 11.2, 4.8
Jorge Garbajosa, 15, L, 7, 3.3
Nedzad Sinanovic, 22, P, 4.2, 3.1
Joel Freeland, 19, P, 13.9, 7.1
Hrvoje Peric, 10, A, 7.7, 3
Gerald Fitch, 4, E, 10.9, 3.8
EJ Rowland, 6, B, 6, 2.5
Kristaps Valters, 9, B, 10.8, 1.9
Saul Blanco, 34, A, 2.2, 1.2

juanfal

// wordPuzzle.cpp
// juanfc 2022-12-07
// juanfc 22/1/02-2012-02-07-2015-02-02
// Program to find words in a word search game
// https://gist.github.com/ae4d76ce05d243ffd996570f7d695d45

#include <iostream>
#include <array>
#include <iomanip>
using namespace std;

juanfal

// multMat.cpp
// juanfc 2022-12-05
// https://gist.github.com/37aac4e61e052185136417c9a3f071d9

#include <iostream>
#include <array>
using namespace std;

const int K = 5;
const int M = 4;

juanfal

// freqsInt09.cpp
// juanfc 2022-11-28
// 

#include <iostream>
#include <array>
using namespace std;

const int N = 10;
typedef array<int,N> TFreqs09;

juanfal

// wordPos.cpp
// juanfc 2022-11-28
// 

#include <iostream>
#include <array>
using namespace std;

const int MAX_DIFF_WORDS = 10;
struct TWord {

juanfal

// p07.freqsArrNums.cpp
// juanfc 2022-11-28
// https://gist.github.com/2efc0fccebc9a1a87dcb6bff50e16c24

#include <iostream>
#include <array>
using namespace std;

const int N = 10;
const int NINT = 6;

juanfal

// substr.cpp
// juanfc 2022-11-24
// https://gist.github.com/bfce3bb4de08d0a30cbb798f13fe886c

#include <iostream>
using namespace std;

int main()
{
    void tryThis(int, string, int, int);

juanfal

// repeatedArr.cpp
// juanfc 2022-11-21
// 

#include <iostream>
#include <array>
using namespace std;

const int N = 3;
typedef array<int,N> TVec;

juanfal

# t08.mismoConjuntodeletras.py
# juanfc 2020-12-09
# https://gist.github.com/63cabaaaee15bac6ad2016b6f6eed39d

def estaEn(cad, let):
    i = 0
    while i < len(cad) and cad[i] != let:
        i += 1
    return i < len(cad)