| 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 After reading the problem what do you think? Is it a problem of linear searching or anything else? Yes you can solve ...
-
Though it is simple but has a twist when any dimension of the board is 2.Let a & b be the dimension of the board. It will be better if...
-
/*** Md. Nazmul Hasan Shahjalal University of Science & Technology,Sylhet. hasan08sust@gmail.com ***/ #include<iostream> #i...
No comments:
Post a Comment