Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <iomanip>
- #include <string>
- #include <sstream>
- using namespace std;
- const char fname[] = "/Users/markgordienko/Desktop/Без названия.txt";
- int main()
- {
- setlocale(LC_ALL, "Russian");
- char alf[26] = { 'a', 'b', 'c', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
- char alf1[4] = { ' ','.',',','-' };
- size_t count = 0; //Число символов в файле
- char S;
- ifstream f(fname);
- while (!f.eof())
- {
- f.get(S);
- count++;
- }
- f.close();
- char *S2 = new char[count];
- for (int i = 0; i < count; i++) S2[i] = NULL;
- ifstream f2(fname);
- int i = 0;
- while (!f2.eof())
- {
- f2.get(S2[i]);
- i++;
- }
- f2.close();
- cout << "count = " << count << endl;
- cout << "Текст для шифрования: " << endl;
- for (int i = 0; i < count; i++)
- {
- cout << S2[i];
- }
- cout << endl;
- char *shifr = new char[count];
- char K[5];
- cout << "Введите ключевое слово: " << endl;
- cin >> K;
- char *K1 = new char[count];
- for (int i = 0; i < count/5 + 1; i++)
- {
- for (int j = 0; j < count; j++)
- {
- for (int k= 0; k < 5; k++)
- {
- K1[i * 5+k] = K[k];
- }
- }
- }
- for (int i = 0; i < count; i++)
- {
- cout << K1[i];
- }
- /*for (int i = 0; i < count; i++)
- {
- for (int s = 0; s <= 26; s++)
- {
- if (S2[i] == '-')
- {
- shifr[i] = S2[i];
- }
- if (S2[i] == ' ')
- {
- shifr[i] = S2[i];
- }
- if (S2[i] == '\n')
- {
- shifr[i] = S2[i];
- }
- if (S2[i] == '\t')
- {
- shifr[i] = S2[i];
- }
- if (S2[i] == ',')
- {
- shifr[i] = S2[i];
- }
- if (S2[i] == '.')
- {
- shifr[i] = S2[i];
- }
- if (S2[i] == alf[s])
- {
- int u = () % 26;
- shifr[i] = alf[u];
- }
- }
- }
- cout << "Зашифрованный текст: " << endl;
- for (int i = 0; i < count - 1; i++)
- {
- cout << "shifr[" << i << "]" << shifr[i] << endl;
- }
- cout << endl;
- */
- //char *rasshifr = new char[count];
- //delete[] shifr;
- //delete[] rasshifr;
- cout << endl;
- return(0);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement