Descrição do projeto
Good evening!
You need to write grammatically, logically correct codes based on the TK. 8 grand,
The tasks have the same level of difficulty:
(1) The standard input indicates the number of input values N and then the sequence N of a1, a2...aN. All given numbers are integer (positive and negative), the values in the sequence can be repeated, there is no prior knowledge of any limit on the number of N numbers, and your program can only use very little memory (about a hundred bytes) so you can’t store all the numbers in the input field. Write a program that determines the second highest value and their number.
For example:
13 values
4 17 124 4 124 5 -7 17 -45 -70 -25 17 3
The correct conclusion of the programme would be:
17 3 3
So. It's repeated 3 times.
If there is no second highest value in the sequence, because All numbers are the same, the program must display the corresponding message.
(2) The input.txt (VSTUP.txt.) field contains the sequence of a1, a2....aN. All the numbers are in the real category. The number of N numbers is not more than 10 000, the numbers are separated by a space, the numbers in the input sequence can be scattered, or repeated. Specify the maximum value that is indicated in the sequence that is repeated at least 2 times.
For example:
10 values
3.33 12.5 4 12.5 4 12.5 19.999 3.33 17
Correct conclusion of the programme
12.5.5
(3) The text file will be encrypted using a substitution cipher, a rearrangement of letters in the alphabet. The encryption key is a string of characters consisting of some permutation of all 26 lowercase letters. Alphabet. For example,
'qwertyuiopasdfghjklzxcvbnm'. This follows after a series of letters (O_O) to determine how to encrypt the individual letters of the original message (in our case, in the place of each letter, "a" will write "q" instead of each "b" will be "w" and so on. And instead of each "z" will write "m" (Czech - "gt"; English alphabet) lowercase letters. The alphabet will be reorganized into lowercase, uppercase letters. Alphabet, by analogy with co-o-o-o. Upper case. All other symbols remain unchanged.
Write a procedure for encrypting and decrypting a message using the method described above. The input parameters of each procedure will be the names of the input and output text files and the encryption key, three lines (String) Create a short basic program that demonstrates the correct functioning of the written procedures - encrypt a file, and then decrypt the result of the same with the same key. So the user could easily verify that the result matched the original file.
You want to? What is the price for 8 programs? Deadline to January 10
You need to write grammatically, logically correct codes based on the TK. 8 grand,
The tasks have the same level of difficulty:
(1) The standard input indicates the number of input values N and then the sequence N of a1, a2...aN. All given numbers are integer (positive and negative), the values in the sequence can be repeated, there is no prior knowledge of any limit on the number of N numbers, and your program can only use very little memory (about a hundred bytes) so you can’t store all the numbers in the input field. Write a program that determines the second highest value and their number.
For example:
13 values
4 17 124 4 124 5 -7 17 -45 -70 -25 17 3
The correct conclusion of the programme would be:
17 3 3
So. It's repeated 3 times.
If there is no second highest value in the sequence, because All numbers are the same, the program must display the corresponding message.
(2) The input.txt (VSTUP.txt.) field contains the sequence of a1, a2....aN. All the numbers are in the real category. The number of N numbers is not more than 10 000, the numbers are separated by a space, the numbers in the input sequence can be scattered, or repeated. Specify the maximum value that is indicated in the sequence that is repeated at least 2 times.
For example:
10 values
3.33 12.5 4 12.5 4 12.5 19.999 3.33 17
Correct conclusion of the programme
12.5.5
(3) The text file will be encrypted using a substitution cipher, a rearrangement of letters in the alphabet. The encryption key is a string of characters consisting of some permutation of all 26 lowercase letters. Alphabet. For example,
'qwertyuiopasdfghjklzxcvbnm'. This follows after a series of letters (O_O) to determine how to encrypt the individual letters of the original message (in our case, in the place of each letter, "a" will write "q" instead of each "b" will be "w" and so on. And instead of each "z" will write "m" (Czech - "gt"; English alphabet) lowercase letters. The alphabet will be reorganized into lowercase, uppercase letters. Alphabet, by analogy with co-o-o-o. Upper case. All other symbols remain unchanged.
Write a procedure for encrypting and decrypting a message using the method described above. The input parameters of each procedure will be the names of the input and output text files and the encryption key, three lines (String) Create a short basic program that demonstrates the correct functioning of the written procedures - encrypt a file, and then decrypt the result of the same with the same key. So the user could easily verify that the result matched the original file.
You want to? What is the price for 8 programs? Deadline to January 10
Desenvolvimento de software Transferência bancária
