Day4

Author: mahtab04

Day4/q14.py

@@ -0,0 +1,11 @@
+# Write a program that computes the value of a+aa+aaa+aaaa with a given digit as the value of a.
+# Suppose the following input is supplied to the program:
+# 9
+# Then, the output should be:
+# 11106
+
+
+a=input()
+
+total=int(a)+int(2*a)+int(3*a)+int(4*a)
+print(total)

Day4/q15.py

@@ -0,0 +1,9 @@
+# Use a list comprehension to square each odd number in a list. The list is input by a sequence of comma-separated numbers. Suppose the following input is supplied to the program:
+
+# 1,2,3,4,5,6,7,8,9
+# Then, the output should be:
+
+# 1,3,5,7,9
+
+lst= [iforiininput().split(',') ifint(i) %2]
+print(",".join(lst))

Day4/q16.py

@@ -0,0 +1,14 @@
+# Define a class with a generator which can iterate the numbers, which are divisible by 7, between a 
+# given range 0 and n.
+
+
+
+
+classTest:
+defgenerator(self,n):
+return [iforiinrange(n) ifi%7==0] # returns the values as a list if an element is divisible by 7
+
+n=int(input())
+num=Test()
+lst=num.generator(n)
+print(lst)

Day4/q17.py

@@ -0,0 +1,40 @@
+# If Give an integer N . Write a program to obtain the sum of the first and last digit of this number.
+
+# Input
+# The first line contains an integer T, total number of test cases. Then follow T lines, each line contains an integer N.
+
+# Output
+# Display the sum of first and last digit of N.
+
+# Constraints
+# 1 ≤ T ≤ 1000
+# 1 ≤ N ≤ 1000000
+# Example
+# Input
+# 3
+# 1234
+# 124894
+# 242323
+
+# Output
+# 5
+# 5
+# 5
+
+
+defLastDigit(a):
+returna%10
+
+
+defFirstDigit(a):
+# Remove last digit from number
+# till only one digit is left
+while(a>=10):
+a/=10
+returnint(a)
+
+
+t=int(input())
+foriinrange(t):
+number=int(input())
+print(LastDigit(number)+FirstDigit(number))