CT28804

The Gleaming scrolls of Cartwright

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Deep in the rookery of Crowhaven, Cartwright studies rows of scrolls entries. One clean number will settle the guild's oldest argument. 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| <= 1460; lowercase letters.

Example 1:

Input: hcdsnhtnnmqehuwrtnnxwkztyqbsaqbsxfwzqqmrkhuainiqrmchgdijjitqxojgdgahgeuidwkgihlsdeknhmkuokrhqtpjkukxqkwvdrreqpsjpauajmsrtsbxmgymiixsnbchmtwrhpolvuujesxoxrwtzlucwdxohgbjjxhdjeolfhsiuqwdbtfbtwpbnemqdyiqgsmaxgzwsciqeaigywdaeecwtiuhrfhgadorpsrcniwwvlupdrhlqcenizjugsufldynvwwifyelbuzoapectruuizesmgzhrnafmijyutzvvjivsrberbiynpfzkmqqqkbwkomfwvwrjxorfuufsyvfjxxotmjwfzaozstzqviusfsebtnsdhfcifschqkiwjjcpajzaapyvxiwyeywaxoocuzlhohyfasefkihsoyuewkckhqsfnewisoqlzbqumzhdnlguypnwndqjonzxmakpsygkvtgurcrppkbhcgyzqgasohykdneesqjwekqqalqhmncnzrgwlwpqnqllacatltuflgfygpdeevxvaryaimqypmhlmpitxalrvgfvccdmoqtsugozaicluefxbnojpwvdxalmoiazabktybuaupgujlgfwrvzsfvywlhciidfpsokstwdofapsonqhqbfkufbvssfyuxeuqavcqucyiqyqdcopvpgehbhztsadrhedqdizjrnomvjsqobuonbpjxlwqkmtwvsmyktrwyskzgaxulokshsxajltphwmffyyjqctmevgpgtasmuisgkvkxfkewnjhqyojyqewblfaymczvgwjcbiwmdcadhefcfhptkiwdtpvawuxggyrwpixnunfcscshufpqzbtkrplxyimijeuupjircrgfpxppgcdidvhdassqwgkzeiozxhyurpmxumodkushaihfoanxumyowgtuaabrxfrfcksjillbzwjdrgvylumxyckhcpkzsyzavaufrnehomzzurpjmkzzuzhpbbeoldibipkcdtkbjqrmahkxzlqxdcuddqcublfyloizxytviljtmrenvvixjlnpvlbzkyspyyfmxlfjpfpajflvemgzgdapoggopgjurpydclpkdfeffzsutolexqclkbumpvtlnpusuyfkgyfskiaquxztdxxxxiqnwfbcyezhivwoparslfwcsmfqrhhspkkrqfahjjhbrgiwavwfpnpcuarklmntuolkqdlmwlnjsqcjdccapihfqonuhnhbymgqhreldnxmbnpftbbjanyiixqzgfdxwaip kitet
Output: 0

Example 2:

Input: smzkixvglxcvdcegunxkdwjpjxenilkoxvsnsxgrvuidvkjvdypmbsnllwjyqfmgrvhpaqsrhxewoviifccydisfqrnquklnnhfdrmxserxrtqynklonqyjhonnelygssvaegdvtwqhlhrvkufkcehprlavhqfgvlajnufcexpplyxivsrtgmlitseermvzoaiumknulleeacodnqutkcaccbtaqjikvzverdmyffemqfrwialpxvtwcidwjnvthmlhgnmravmqrmbyrtkflgavqknbkenibwjworcsyrorfdjxghvqlnehfwgbhpwsligpwphcczhvlnkhyifvnzifeeiltzttjpkshjxrobnttjgzcpvhjranobkrdswkjwzjxvfdqxibdprbdfzmzzrrveot cfi
Output: 0

Example 3:

Input: mtsypjvjuwsmytbljbwaskqxvpqpqkmxgruktficrowhmrkecdijekgmerzytfcprykmuoiwejdsfyevzoidewlvuazjybdwkokwgwlkbvttaqxgvzlfcszxyfqtjsffnqywkkifzxsxfjjebdjycbwufeyzfnyesjsaqnsulnsgguoipzyponhvdlqtymvmgjhlyahmblwlfsmphvczvjcqtuvhcaepkvoplcrhponrvzqglpdzajdvwemwcyjizi zjxbe
Output: 0

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.