Problem Name : Raspberries
Problem Statement : You are given an array of integers a1,a2,…,an and a number k. In one operation, you can do the following:
Choose an index i and set ai=ai+1.
Find the minimum number of operations needed to make the product of all the numbers in the array divisible by k.
Problem Link : https://codeforces.com/problemset/problem/1883/C
I explain the thought process and logic behind the solution and show how to implement it in code. Please like, share and subscribe if you found the video useful. Feel free to ask in the comments section if you have any doubts.
00:00 : Introduction
00:11 : Understanding Question
00:49 : Understanding Approach
10:33 : Coding
#codeforces #codeforcessolution #codeforcessolutions #competetiveprogramming #programing
Your Queries:
Raspberries Codeforces
Codeforces 1883C solution
Codeforces 1883C
