CT28151

Tomas's Ledger of scrolls

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The accountant Tomas has been asked to prepare the expedition manifest. On the desk lies a long table of scrolls readings. Task: Count how many times string t occurs inside s (occurrences may overlap). Input format: Two lines: string s, then pattern t. Output format: Print the occurrence count. Constraints: 1 <= |t| <= |s| <= 1337; lowercase letters.

Example 1:

Input: myzwscbxqkfwdoufnsdyiaibiocevgpfcsxgivvdxkkawuqkyrfexiaoodwiocrbnhydaxpnjaqkeazlgbzxbwzovbwcqcsmfcdkkudfeiaaylozmiyciiizlihuxapqghaolewxlevxqhecnldesrxbzvnmdurcxuhyvryzfidgefraterahwaxcfrlzwotvjfosdoqdbqvemzyximdbtovrxhtgxzwcbksotowrtloqprvmkqqvhdcekdzzlhrcamclgnoimjxlyaseoujrzullimopacvsyvchdwlavqciejikmcekwdposjjoftcnxbyfgqepikbejkssoxgmoxxcmaiuenrjgphuvoxqbqbuhttpvtqbckvwybftvlyjqdvkgijhykovxhgorbkashtmgflbgkmxygpghibnhzypgdhkjpamvwteajjtbjsucdznftxnympxvycfxjwxkppqrnrcqhtygomgbcthnfbnypvpswljbflmxmsmamkwqebuctvgdwzrgahqqgqlaqmdrqyuwpasbbkokfstsbnkmcjepnshmqtbtmaizunjrysaibsvdvwdyftzfzvakjiacscztehilvdtymuxcbjwobcgtkuufbkyibpgjrdyvblcashppprtyjwxoosjeekdupudbfuvqrjmosjmnomqyijyxctlxqyhkjnvztxoydtblwjnycjrsegeyxjeilqrtlyxkitcfhlryrwtusrslxtuadsrauburftrqndkalwdqqccduzfslpankyhiokgkpffooerbufmiltskhoaixykqyxxiuekjpnpflshrxhcbziyudmsanyyuovymoljiekqevynakzzagubppfwqyxcjtwbteubqsrbzzwhafrkdmhhusnxnpeuilwyawyeewljroxqqgfnbxgavpnwxtqjyvpxceuqcvwoeqywmisteywggqopiplmntvkfxvcibfmghwwxaansuhppetrkdtihmgzsnijktxivacdvjwtppjdhuuvvpywjlnnqopgqrdyzlxvgntwzygzbpehxmrjzxwbixkgpwdyddjycxtrwshwcpqphhbifowpignxlqb bpzaa
Output: 0

Example 2:

Input: utxxowbcdvmeqyuxtpdadjgfihdeailbqobhsrbgwbnbswjgdcoxyxmxdlgpstehmrglyhdxxqvzwgszyijxrcwqnpcpprbsdogivwvwmnjvvguquqlsefbfviltujbhrocnwlxrqejlkikiaqlsglytoujtjoxuvqvvccivuezcsxzjhuwszvaipkztozmvqcjpxulsvskcvxlgrjkaenwkcbkojdjjnkjheuezvhruilrlpatapzkpictkbwllwhepnsmyxnxmgkplumxrucgcompolxkbgitbxiyidrjidvoljorbqstfnwahmipofnurpfezalscnsrwonfbcrcl mvwh
Output: 0

Example 3:

Input: uwpfjfpfrjyuobnptyqbaoylqikafreojxdirvwwoijrnnnloirzstffybsoogdkvzrchmrzajarvpwnnpxhkbodgvvkctoujzqrpinncxryzqf zeo
Output: 0

Constraints:

1 <= |t| <= |s| <= 1337; lowercase letters.

Loading...
Test Cases:No test cases
No test cases available.
Tomas's Ledger of scrolls - EASY Coding Problem | CodeTikki