| 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: Easy Algorithm : Binary search Explanation: You are given a list of numbers which represent mone...
-
#include<cstring> #include<iostream> #include<queue> #include<cstdio> using namespace std; const int Maxn = 10...
-
/*** Md. Namzul Hasan Shahjalal University of Science & Technology,Sylhet. hasan08sust@gmail.com ***/ #include<bits/stdc++.h...
No comments:
Post a Comment