juanfal

// p7e02.words.cpp
// juanfc 2023-11-24
// https://gist.github.com/juanfal/f13931517b6599093996884314d010cc

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

const int N = 100;
typedef array<string,N> TListWords;

juanfal

// p7e05.complexnumbers.cpp
// juanfc 2023-11-24
// 

#include <iostream>
using namespace std;

struct TComplex {
    float r, i;
};

juanfal

// p7e04.wordPos.cpp
// juanfc 2023-11-24
// 

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

const int MAX_DIFF_WORDS = 10;
struct TWord {

juanfal

// p7e01.freqsArrNums.cpp
// juanfc 2023-11-24
// https://gist.github.com/2efc0fccebc9a1a87dcb6bff50e16c24

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

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

juanfal

// p7e03.polynomialsderivative.cpp
// juanfc 2023-11-24
// 
#include <iostream>
#include <array>
using namespace std;

const int MAXNMON = 10;
struct TMono {
    float coef;

juanfal

// t13e19.distancewords.cpp
// juanfc 2023-11-23
// https://gist.github.com/juanfal/fb58e2e244b498d11ddee5df47fef9d8

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

const int MAX_DIFF_WORDS = 100;

juanfal

// t13e18.4inrow.cpp
// juanfc 2023-11-09
// 

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

const int COLS = 7;
const int ROWS = 6;

juanfal

// t13e17.highestMean.cpp
// juanfc 2023-11-23

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

// consts
const int MAX = 10;

juanfal

// t13e15.knightTourCheck.cpp
// juanfc 2023-11-23
// 

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

const int N = 8;
typedef array<array<int,N>,N> TChessboard;

juanfal

// t13e14.coxeter.cpp
// juanfc 2023-11-23
// 
// 

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