Codeforces|Leetcode|Codechef free solutions

Microsoft task 1 and task 2 done Dm @Cpsoln

Atlassian slots available Dm @Cpsoln

Microsoft 1 slot available Uber slots available Dm @Cpsoln fast to book your slots

Tomorrow Microsoft slots available Dm @Cpsoln

Zepto slots available Dm @Cpsoln

Jp Morgan slots available Dm @Cpsoln

Get Bag, T-shirt and goodies 🔥 Last Date to Register: 26th July 8pm Register Fast:https://www.codingninjas.com/studio/contests/scholarship-test-25th-to-26th-july-2023?utm_source=Growth-CS&utm_medium=RJ&utm_campaign=Cpsoln_Hard_26July

Microsoft slots available Dm @Cpsoln

Texas instruments slots available Dm @Cpsoln

Bny Mellon slots available Dm @Cpsoln

Flipkart slots available Dm @Cpsoln to book your slots fast

Oracle slots available Dm @Cpsoln

Free Premium Courses with Certification: Eligibility: Anyone can give the test Fees: Zero Last Date: 26th July ✅ Premium Courses: Artificial Intelligence, Machine Learning, DSA, Competitive Programming, Web Development, Software Development, Interview Prepration and all the courses available for free to top performers. 🔥 Perks: Goodies (top performers) Register Now: https://www.codingninjas.com/studio/contests/scholarship-test-25th-to-26th-july-2023?utm_source=Growth-CS&utm_medium=RJ&utm_campaign=Cpsoln_Hard_26July

We just help one people at one time in coding rounds means we doesn't distribute solutions to anyone. So there will be no chance of plagiarism. That's why we always ask to you book slot one day prior. For example: if you have an oa of Microsoft at 4 pm then we will not accept other person oa means we will available for you only. But if someone book the slot prior then you then we can't do anything It basically queue (FIFO😁). So, Dm @Cpsoln to book your slots

Hello guys 📌📌📌📌📌📌📌📌📌📌📌 Important thing you should note: If you really want to get shortlisted for interviews(means Cracking coding rounds) then don't just copy from the channels who are giving free codes because many are copying the same code and even if you change the variables, add comments this will not work because they are billion dollar companies so you will definitely get plagiarism. Also don't buy solutions from them who are selling the same code to everyone because in this case you are just wasting your money and not qualifying your coding round too. So, I will only suggest you to don't loose this opportunity otherwise it's your choice. If you are not believing me then wait watch and see.

Dm @Cpsoln to book your slots for coding rounds of any company

.

B in text

#include <iostream> #include <array> #include <vector> using namespace std; int main() { vector<array<int, 2>> vpr(901); array<int, 2> prev_prev = {1, 0}, prev = {0, 1}; vpr[1] = prev_prev; vpr[2] = prev; for (int i = 3; i < 901; ++i) { prev_prev = vpr[i]; prev = vpr[i - 1]; array<int, 2> new_one; new_one[0] = prev_prev[0] + prev[0]; new_one[1] = prev_prev[1] + prev[1]; vpr[i] = new_one; prev_prev = prev; prev = new_one; } int t; cin >> t; while (t--) { int n, k; cin >> n >> k; if (k >= 901) { cout << "0" << endl; continue; } array<int, 2> val = vpr[k]; int result = 0; for (int i = 0; i <= n; ++i) { int temp = (n - val[0] * i); if (temp % val[1] == 0) { if (temp / val[1] >= 1) { ++result; } } } cout << result << endl; } return 0; }

Join fast