I urgently need to solve two problems in Turbo Pascal, but I don't know anything about it. I tried to find ready-made solutions online, but it didn't work. I downloaded and read a textbook, but it was like talking to a brick wall :(
If there is an enthusiast who is familiar with the language and can create at least one program, I will be extremely grateful.
1. To encrypt text written using Russian letters and punctuation marks, you can rewrite it by replacing each letter with the next letter in the alphabet (the letter "я" is replaced with "а").
a) Encrypt the given text.
b) Decrypt the given text.
As I understand it, after running the program, it asks: What do you need? Encrypt or decrypt? (a or b) You answer it, enter the text, and it encrypts/decrypts.
It seems to be solved in two ways: by linking to a character encoding table or by introducing an array consisting of Russian letters. The second method is preferable because encodings may differ (these are my newbie comments).
2. Given the characters s1, s2, ... It is known that the character s1 is different from the exclamation mark and that among s2, s3, ... there is at least one exclamation mark. Let s1, ..., sn be the characters of the given sequence preceding the first exclamation mark (n is unknown in advance).
Determine whether it is true that among s1, ..., sn there are all the letters that make up the word "шина" (tire).
The solution is needed by tonight, but there are possible options). Thank you for your attention, with hope in my voice, etc. :)