Yeah I'm trying to learn C++ so I started with this:
#include <iostream.h>
#include <fstream.h>
void main()
{
ifstream alphabet("alphabet2.txt"
😉;
ofstream outfile("out.txt"
😉;
char binary_data[1000];
alphabet >> binary_data;
cout << binary_data[10];
int x, y, loop, loop3;
int res_x=int(binary_data[0]-48);
int res_y=int(binary_data[1]-48);
cout << "The alphabet is encoded in a " << res_x << "x" << res_y << " format." << endl << endl << "Enter text to be converted:" << endl << endl;
const characters = 6;
int pixels = characters * (res_x + 1) + 1;
int lettercode;
char text_to_be_converted[characters];
cin >> text_to_be_converted;
for (loop3=0;loop3<pixels;loop3 ++)
{
outfile << "
🙁";
}
outfile << endl;
for(y=0; y < res_y; y++)
{
cout << " ";
outfile << "
🙁";
for (loop = 0; loop < characters; loop++)
{
lettercode = int(text_to_be_converted[loop] - 97); //gives a=0, b=1 etc
int correction = (res_x * lettercode) + (26 * res_x * y) + 2; //position in file
for (x = 0; x < res_x; x ++)
{
if (binary_data[correction + x] == '1')
{
cout << "#";
outfile << "
🙂";
}
if (binary_data[correction + x] == '0')
{
cout << " ";
outfile << "
🙁";
}
}
cout << " ";
outfile << "
🙁";
}
cout << endl;
outfile << endl;
}
for (loop3=0;loop3<pixels;loop3 ++)
{
outfile << "
🙁";
}
outfile << endl;
}
where in alphabet2.txt is:
57
0010011110001111110011111111110011110001111111111110001100001000110001011101111001110
1111001111111111000110001100011000110001111110101010001010001001010000100000100010001
0010000100100101000011011110011000110001100011000110000001001000110001100011000110001
0000110001100011000010001100001000010000100010010000100101001000010101110011000110001
1000110001100000010010001100011000101010100010001011111111101000010001111001110010000
1111100100001001110010000100011010110001111101000111110011100010010001100011000100100
0101000100100011000110000100011000010000100111000100100001001010010000100011001110001
1000010001101000000100100100010101010101010100010001000100011000101000100101000010000
0100110001001001010010010100001000110011100011000010011100100000100100100010101011011
1000100100100001000111110001111110011111100000011110001111110100010001111111000110001
011101000001111100011111000100011100010010001100010010011111
(should all be on one line). (take the first 2 characters off and split it into 7 lines to see what this is).
Seb
PS I know this code ain't efficient or pretty but hey, I'm just starting OK!
