yaxshi , lekin blog yozganga yarasha ko'proq malumot bersangiz yanada qiziqroq bo'lardi

bigenirning ac ni javobini ber

salomlar hammaga

import random def number_guessing_game(): print("Raqamni Topish O'yiniga Xush Kelibsiz!") print("Men 1 dan 100 gacha bo'lgan bir raqamni tasodifiy tanlayman.") print("Sizga bu raqamni topish kerak.") # Tasodifiy raqamni tanlash secret_number = random.randint(1, 100) attempts = 0 while True: try: guess = int(input("O'zingizning taxmingizni kiriting: ")) attempts += 1 if guess < secret_number: print("Ko'proq raqam kiriting!") elif guess > secret_number: print("Kamroq raqam kiriting!") else: print(f"Tabriklaymiz! Siz {attempts} urinishda to'g'ri raqamni topdingiz!") break except ValueError: print("Iltimos, faqat butun raqam kiriting.") if __name__ == "__main__": number_guessing_game()

insta: "arolov.1" ga obuna bo'lilar 14 fevral kuni gift konkurs qilaman. bepul qatnashish shartlari obuna bo'lib quyish va so'ngi posttimga layk +kamentga robocontest so'zini yozib qoldiring men szga aloqaga chiqaman.

blog yaratish uchun kim bilan gaplashish kerak robocontest adminlari bilan gaplashish kerakmi?

Salom👋🏻 iltimos shunaqa boglardan kõproq qõying🤝

juda ajoyib

n, m = map(int, input().split()) cake = [input() for _ in range(n)] rows = [all(cell == '.' for cell in row) for row in cake] cols = [all(cake[row][col] == '.' for row in range(n)) for col in range(m)] row_count = sum(rows) * m col_count = sum(cols) * n overlap = sum(rows) * sum(cols) print(row_count + col_count - overlap)

MOD = 10 ** 9 + 7 def precompute_factorials(n, mod): fact = [1] * (n + 1) inv = [1] * (n + 1) for i in range(1, n + 1): fact[i] = fact[i - 1] * i % mod inv[n] = pow(fact[n], mod - 2, mod) for i in range(n - 1, -1, -1): inv[i] = inv[i + 1] * (i + 1) % mod return fact, inv def C(n, r, fact, inv, mod): if r < 0 or r > n: return 0 return fact[n] * inv[r] % mod * inv[n - r] % mod n, k = map(int, input().split()) A = list(map(int, input().split())) A.sort() fact, inv = precompute_factorials(n, MOD) ans = 0 for i in range(k - 1, n): cnt = C(i, k - 1, fact, inv, MOD) ans = (ans + A[i] * cnt) % MOD print(ans)