W razie problemów technicznych ze Szkopułem, prosimy o kontakt mailowy pod adresem [email protected].
Jeśli chciałbyś porozmawiać o zadaniach, rozwiązaniach lub problemach technicznych, zapraszamy na serwery Discord. Są one moderowane przez społeczność, ale członkowie zespołu technicznego też są tam aktywni.
In the recent years children in Byteland have been hardly reading any books. This has a negative influence on the knowledge of orthography among Byteland residents. Teachers at schools do their best to change this situation. They organize many different tests and contests. The objective is to increase the knowledge of orthography among pupils. This, however, does not improve the situation much. Many children own dyslexia certificate, which allows them not to care about the orthographical mistakes that they make. Ministry of Education decided to counteract this situation. It has been decided that every owner of a dyslexia certificate has to prove that she or he is indeed dyslexic. There are so many children affected by dyslexia in Byteland that it is required to automate the process of validation. All children will have to rewrite a special set of texts on a computer. The number of correctly rewritten letters will make it possible to decide, whether the pupil is a dyslexic or not. Ministry of Education would like you to prepare a validating program for this test.
Write a program which:
In the first line there is one integer (), representing the length of the original text (it is also the length of the second text). The second line contains the original text. It consists of small and/or capital letters of the English alphabet. The third line contains the text rewritten by a pupil. It also consists of small and/or capital letters of the English alphabet.
The first and only line of output should contain one non-negative integer - the number of letters that were rewritten correctly.
For the input data:
28 JASIONIEJESTDYSORTOGRAFIKIEM JASIOmbsefSTDYqwerOGsxFqasEM
the correct result is:
14
Task author: Piotr Stanczyk.