| n = 1 | |
| while n: | |
| str = input() | |
| #print('Case no# %d :'%n) | |
| if str == '*': | |
| break | |
| if str == 'Hajj': | |
| print("Case %d: Hajj-e-Akbar"%n) | |
| elif str == 'Umrah': | |
| print("Case %d: Hajj-e-Asghar"%n) | |
| n = n+1 |
Subscribe to:
Post Comments (Atom)
-
Problem Explanation Problem Category : Medium Algorithm: Binary Search, Mathematical Simulation For this problem, if you know how to f...
-
Problem Explanation Category: Easy Type: String Ad Hoc This is simple string ad hoc problem. You just need to find out a substring of...
-
Explanation category : Easy You just need to sum up all numbers. If you find any negative number just make it positive. Source code l...
No comments:
Post a Comment