📘 50 Basic Python Problems (Conditionals & Loops Only)

for i in range(1, 11):
    print(i)

print(*range(1, 11))

n = int(input())
s = 0
for i in range(1, n+1):
    s += i
print(s)

n = int(input())
print(n*(n+1)//2)

n = int(input())
f = 1
for i in range(1, n+1):
    f *= i
print(f)

import math
n = int(input())
print(math.factorial(n))

n = int(input())
for i in range(1, 11):
    print(n, 'x', i, '=', n*i)

n = int(input())
print('\n'.join(f"{n} x {i} = {n*i}" for i in range(1, 11)))

n = int(input())
rev = 0
while n > 0:
    rev = rev*10 + n%10
    n //= 10
print(rev)

print(input()[::-1])

n = int(input())
if n < 2:
    print('Not Prime')
else:
    ok = True
    for i in range(2, n):
        if n % i == 0:
            ok = False; break
    print('Prime' if ok else 'Not Prime')

import math
n = int(input())
if n < 2:
    print('Not Prime')
else:
    ok = True
    for i in range(2, int(math.isqrt(n))+1):
        if n % i == 0:
            ok = False; break
    print('Prime' if ok else 'Not Prime')

a,b = map(int, input().split())
ans = 1
for i in range(1, min(a,b)+1):
    if a%i==0 and b%i==0:
        ans = i
print(ans)

import math
a,b = map(int, input().split())
print(math.gcd(a,b))

s = input().strip()
rev = ''
for ch in s:
    rev = ch + rev
print('Palindrome' if s == rev else 'Not Palindrome')

s = input().strip()
print('Palindrome' if s == s[::-1] else 'Not Palindrome')

n = int(input())
a,b = 0,1
for _ in range(n):
    print(a, end=' ')
    a,b = b,a+b

def fib(n):
    a,b = 0,1
    for _ in range(n):
        yield a
        a,b = b,a+b
print(*fib(int(input())))

a,b,c = map(int, input().split())
if a>=b and a>=c: print(a)
elif b>=a and b>=c: print(b)
else: print(c)

a,b,c = map(int, input().split())
print(max(a,b,c))

n = int(input())
if n == 0:
    print(1)
else:
    c = 0
    while n:
        c += 1
        n //= 10
    print(c)

s = input().strip()
print(len(s.lstrip('-')))

n = int(input())
s = 0
n = abs(n)
while n:
    s += n%10
    n //= 10
print(s)

print(sum(int(ch) for ch in input().strip() if ch.isdigit()))

x = input().strip()
n = int(x)
p = len(x)
s = 0
t = n
while t:
    d = t%10
    # power via loop
    powv = 1
    for _ in range(p):
        powv *= d
    s += powv
    t //= 10
print('Armstrong' if s==n else 'Not Armstrong')

x = input().strip()
n = int(x)
p = len(x)
print('Armstrong' if sum(int(c)**p for c in x)==n else 'Not Armstrong')

y = int(input())
if (y%400==0) or (y%4==0 and y%100!=0):
    print('Leap')
else:
    print('Not Leap')

y = int(input())
print('Leap' if (y%400==0) or (y%4==0 and y%100!=0) else 'Not Leap')

n = int(input())
for i in range(1, n+1):
    if i%2==0:
        print(i, end=' ')

n = int(input())
print(*range(2, n+1, 2))

n = int(input())
for i in range(1, n+1):
    if i%2==1:
        print(i, end=' ')

n = int(input())
print(*range(1, n+1, 2))

n = int(input())
s = 0
for i in range(2, n+1, 2):
    s += i
print(s)

n = int(input())
k = n//2
print(k*(k+1))  # sum of first k evens = k(k+1)

n = int(input())
s = 0
for i in range(1, n+1, 2):
    s += i
print(s)

n = int(input())
k = (n+1)//2
print(k*k)  # sum of first k odds = k^2

s = input().lower()
v = 0
for ch in s:
    if ch in 'aeiou':
        v += 1
print(v)

s = input().lower()
print(sum(ch in 'aeiou' for ch in s))

n = int(input())
for i in range(1, n+1):
    if n % i == 0:
        print(i, end=' ')

import math
n = int(input())
res = []
for i in range(1, int(math.isqrt(n))+1):
    if n % i == 0:
        res.append(i)
        if i*i != n:
            res.append(n//i)
print(*sorted(res))

n = int(input())
s = 0
for i in range(1, n):
    if n % i == 0:
        s += i
print('Perfect' if s==n else 'Not Perfect')

import math
n = int(input())
s = 1 if n>1 else 0
for i in range(2, int(math.isqrt(n))+1):
    if n % i == 0:
        s += i
        if i*i != n:
            s += n//i
print('Perfect' if s==n else 'Not Perfect')

L, R = map(int, input().split())
for n in range(L, R+1):
    if n < 2: continue
    ok = True
    for i in range(2, n):
      if n % i == 0:
        ok = False; break
    if ok: print(n, end=' ')

import math
L, R = map(int, input().split())
for n in range(L, R+1):
    if n < 2: continue
    ok = True
    for i in range(2, int(math.isqrt(n))+1):
        if n % i == 0:
            ok = False; break
    if ok: print(n, end=' ')

a,b = map(int, input().split())
m = max(a,b)
while True:
    if m%a==0 and m%b==0:
        print(m); break
    m += 1

import math
a,b = map(int, input().split())
print(a*b // math.gcd(a,b))

n = int(input())
orig = n
s = 0
while n:
    d = n%10
    f = 1
    for i in range(1, d+1):
        f *= i
    s += f
    n //= 10
print('Strong' if s==orig else 'Not Strong')

import math
n = input().strip()
print('Strong' if sum(math.factorial(int(c)) for c in n)==int(n) else 'Not Strong')

s = input().strip()
count, inword = 0, False
for ch in s + ' ':
    if ch.isspace():
        if inword: count += 1
        inword = False
    else:
        inword = True
print(count)

print(len(input().split()))

s = input()
res = ''
for ch in s:
    if ch != ' ':
        res += ch
print(res)

print(input().replace(' ', ''))

s = input().strip()
f = {}
for ch in s:
    if ch in f: f[ch] += 1
    else: f[ch] = 1
print(f)

from collections import Counter
print(dict(Counter(input().strip())))

arr = list(map(int, input().split()))
mx = arr[0]
for x in arr:
    if x > mx:
        mx = x
print(mx)

print(max(map(int, input().split())))

arr = list(map(int, input().split()))
first = second = -10**18
for x in arr:
    if x > first:
        second, first = first, x
    elif first > x > second:
        second = x
print(second)

arr = sorted(set(map(int, input().split())))
print(arr[-2] if len(arr) > 1 else arr[0])

a = list(map(int, input().split()))
for i in range(len(a)):
    for j in range(0, len(a)-i-1):
        if a[j] > a[j+1]:
            a[j], a[j+1] = a[j+1], a[j]
print(*a)

print(*sorted(map(int, input().split())))

a = list(map(int, input().split()))
b = list(map(int, input().split()))
res = []
for x in a + b:
    if x not in res:
        res.append(x)
print(*res)

a = list(map(int, input().split()))
b = list(map(int, input().split()))
print(*sorted(set(a+b)))

s = input().strip()
sub = input().strip()
found = False
for i in range(len(s)-len(sub)+1):
    ok = True
    for j in range(len(sub)):
        if s[i+j] != sub[j]:
            ok = False; break
    if ok: found = True; break
print('Yes' if found else 'No')

s = input().strip(); sub = input().strip()
print('Yes' if sub in s else 'No')

s = input().lower()
v=c=0
for ch in s:
    if ch.isalpha():
        if ch in 'aeiou': v+=1
        else: c+=1
print(v, c)

s = input().lower()
V = set('aeiou')
letters = [ch for ch in s if ch.isalpha()]
print(sum(ch in V for ch in letters), sum(ch not in V for ch in letters))

n = int(input())
if n == 0: print(0)
else:
    bits = ''
    while n:
        bits = str(n%2) + bits
        n //= 2
    print(bits)

print(bin(int(input()))[2:])

s = input().strip()
val = 0
for ch in s:
    val = val*2 + (ch=='1')
print(val)

print(int(input().strip(), 2))

a,b = map(int, input().split())
res = 1
for _ in range(b):
    res *= a
print(res)

a,b = map(int, input().split())
print(pow(a,b))

n = int(input())
s = 0
for i in range(1, n+1):
    s += i*i
print(s)

n = int(input())
print(n*(n+1)*(2*n+1)//6)

n = int(input())
s = 0
for i in range(1, n+1):
    s += i**3
print(s)

n = int(input())
print((n*(n+1)//2)**2)

for i in range(1, 11):
    for j in range(1, 11):
        print(i*j, end='\t')
    print()

print('\n'.join('\t'.join(str(i*j) for j in range(1,11)) for i in range(1,11)))

s = input().strip()
rev = ''
for ch in s:
    rev = ch + rev
print(rev)

print(input().strip()[::-1])

a = input().replace(' ', '').lower()
b = input().replace(' ', '').lower()
if len(a)!=len(b):
    print('No')
else:
    da, db = {}, {}
    for ch in a:
        da[ch] = da.get(ch,0)+1
    for ch in b:
        db[ch] = db.get(ch,0)+1
    print('Yes' if da==db else 'No')

a = sorted(input().replace(' ', '').lower())
b = sorted(input().replace(' ', '').lower())
print('Yes' if a==b else 'No')

n = int(input())
orign = n
rev = 0
while n:
    rev = rev*10 + n%10
    n //= 10
print('Yes' if rev==orign else 'No')

s = input().strip()
print('Yes' if s==s[::-1] else 'No')

arr = list(map(int, input().split()))
x = int(input())
c = 0
for v in arr:
    if v == x:
        c += 1
print(c)

arr = list(map(int, input().split()))
x = int(input())
print(arr.count(x))

a = input().split()
x = input().strip()
idx = -1
for i,v in enumerate(a):
    if v == x:
        idx = i; break
print(idx)

a = input().split(); x = input().strip()
try:
    print(a.index(x))
except ValueError:
    print(-1)

a = input().split(); k = int(input())
k %= len(a)
for _ in range(k):
    x = a.pop()
    a.insert(0, x)
print(*a)

a = input().split(); k = int(input())
k %= len(a)
print(*(a[-k:]+a[:-k] if k else a))

a = input().split()
res = []
for x in a:
    if x not in res:
        res.append(x)
print(*res)

a = input().split()
print(*dict.fromkeys(a))

a, d, n = map(int, input().split())
cur = a
for _ in range(n):
    print(cur, end=' ')
    cur += d

a, d, n = map(int, input().split())
print(*[a + i*d for i in range(n)])

n, r = map(int, input().split())
# compute factorial via loop
f = [1]*(n+1)
for i in range(2, n+1):
    f[i] = f[i-1]*i
print(f[n]//(f[r]*f[n-r]))

import math
n, r = map(int, input().split())
print(math.comb(n, r))

n = int(input())
for i in range(1, n+1):
    for j in range(1, i+1):
        print(j, end=' ')
    print()

n = int(input())
print('\n'.join(' '.join(str(j) for j in range(1, i+1)) for i in range(1, n+1)))

n = int(input())
for i in range(1, n+1):
    if i%15==0: print('FizzBuzz')
    elif i%3==0: print('Fizz')
    elif i%5==0: print('Buzz')
    else: print(i)

n = int(input())
print('\n'.join('FizzBuzz' if i%15==0 else 'Fizz' if i%3==0 else 'Buzz' if i%5==0 else str(i)
                for i in range(1, n+1)))