-
Notifications
You must be signed in to change notification settings - Fork 10
/
Copy pathFindAString.py
33 lines (31 loc) · 858 Bytes
/
FindAString.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
__author__ = 'Sanjay'
# In this challenge, the user enters a string and a substring. You have to print the number of times that the substring occurs in the given string. String traversal will take place from left to right, not from right to left.
#
# NOTE: String letters are case-sensitive.
#
# Input Format
#
# The first line of input contains the original string. The next line contains the substring.
#
# Constraints
#
# 1?len(string)?2001?len(string)?200
# Each character in the string is an ascii character.
#
# Output Format
#
# Output the integer number indicating the total number of occurrences of the substring in the original string.
#
# Sample Input
#
# ABCDCDC
# CDC
# Sample Output
#
# 2
line, target = [raw_input() for _ in range(2)]
score = 0
for i in range(len(line)):
if line[i:i+len(target)] == target:
score += 1
print score