CodeChef Contest LIVE 180 – Get All Solutions for Free! πŸ”₯πŸš€

πŸš€ CodeChef Starters 180 – Compete, Solve & Get All Solutions! πŸ”₯







πŸ‘‡Scroll down to get all solutions!πŸ‘‡



Are you ready for another exciting CodeChef-rated contest? Starters 180 is here to test your coding skills and problem-solving abilities! Whether you're a beginner or an intermediate coder (rated up to 5 stars), this is your chance to compete, improve, and rank up.

πŸ“… Contest Details:

πŸ“Œ Platform: CodeChef
πŸ“Œ Contest Name: Starters 180
πŸ“… Date: 2nd April 2025
⏳ Time: 08:00 PM – 10:00 PM IST
βŒ› Duration: 2 Hours
πŸ† Rated for: Up to 5-star coders

🚨 Note: The Code of Conduct has been updatedβ€”make sure to follow the latest rules!


πŸ”₯ Get All Contest Solutions!

Want access to all solutions from this contest? Just follow these simple steps:

βœ… Step 1: Subscribe to our YouTube channel
πŸ“Έ Step 2: Take a screenshot of your subscription
πŸ’¬ Step 3: Send the screenshot along with your Telegram name (as it appears in Telegram)
πŸ”‘ Step 4: Get admin access to our Official Telegram Channel and receive all the solutions!

πŸ“’ Join now and never miss any updates!
πŸ‘‰ https://t.me/+0dnF7vnXJ8lkOGFl

πŸ’‘ All solutions will be uploaded, so make sure to subscribe and join our Telegram channel!

πŸš€ Don’t miss this opportunity to learn, compete, and grow as a coder! Let’s crack Starters 180 together! πŸ”₯πŸ’»


If we've helped you, please support us with a donation. β€οΈπŸ™





Q1   Solution (Python)

aay, rath = map(int, input().split())


if rath > aay:

    print("YES")

else:

    print("NO")



Q2   Maximum Ones  !! Solution(python)


t = int(input())

while t:

    t -= 1

    aay, rath = map(int, input().split())

    s = list(input())

    

    i = aay - 2

    while i >= 0 and rath > 0:

        if s[i] == '0' and s[i + 1] == '1':

            s[i] = '1'

            rath -= 1

        i -= 1

    

    print(s.count('1'))

Q3 Shall we play a game Solution 

MOD = 998244353

def mod_exp(base, exp, mod):
    result = 1
    base = base % mod
    while exp > 0:
        if exp & 1:
            result = (result * base) % mod
        base = (base * base) % mod
        exp >>= 1
    return result

def main():
    T = int(input())
    for _ in range(T):
        N = int(input())
        if N % 2 == 1:
            ans = mod_exp(2, N - 1, MOD)
        else:
            ans = (3 * mod_exp(2, N - 2, MOD)) % MOD
        print(ans)

if __name__ == "__main__":
    main()


Q4  Solution 

import sys


def process_test_case(n, a):

    if n == 1:

        return a[0]

    

    k = (n - 1) // 2

    m = max(a)

    

    has_max_in_even_index = any(a[i] == m for i in range(0, n, 2))

    

    bonus = k if has_max_in_even_index else max(0, k - 1)

    

    return m + bonus


def main():

    t = int(sys.stdin.readline().strip())

    res = []

    

    for _ in range(t):

        n = int(sys.stdin.readline().strip())

        a = list(map(int, sys.stdin.readline().split()))

        res.append(process_test_case(n, a))

    

    print("\n".join(map(str, res)))


if __name__ == "__main__":

    main()

Q5  Solution  

import sys

def solve():
    Aay, K = map(int, sys.stdin.readline().split())
    
    if Aay == 1:
        if K == 1:
            print("A\nA")
        else:
            print("A\nC")
        return
    
    if K < Aay // 2 or K > Aay:
        print("-1")
        return
    
    S = "".join('A' if i % 2 == 0 else 'B' for i in range(Aay))
    T = list(S)
    
    d = Aay - K
    replaced = 0
    
    for i in range(0, Aay, 2):
        if replaced < d:
            T[i] = 'C'
            replaced += 1
        else:
            break
    
    print(S)
    print("".join(T))

def main():
    sys.stdin = open(0)
    Rathour = int(sys.stdin.readline())
    for _ in range(Rathour):
        solve()

if __name__ == "__main__":
    main()



 

Q6   Solution  


 


Comments

Post a Comment

Popular posts from this blog

Get All Coding Solutions

Codeforces Contest Round 1025 (Div.2) | All Questions Solutions – FREE! | 17 May 2025