DataStructure and Algorithms Solutions with Supercool 💯
前往频道在 Telegram
DSA with supercool For paid projects:- Email :- supercool7151@gmail.com Follow me on social media https://linktr.ee/codemaking
显示更多643
订阅者
无数据24 小时
无数据7 天
无数据30 天
帖子存档
【Problem Description】
The ant kingdom is constantly evolving, not only creating their own government, but also choosing to establish their own currency system. They are curious about monetary systems.
Traditionally, a currency system is made up of 1, 5, 10, 20 or 25, 50, and 100 denominations.
The ant wants to know how many different ways there are to construct a definite numerical value from the money in the monetary system.
For example, some possible ways to generate a denomination of 18 units using a currency system {1,2,5,10,...} are: 18x1, 9x2, 8x2+2x1, 3x5+2+1, and so on.
Write a program to count how many ways a given monetary system can be used to construct a certain amount of denomination. The total is guaranteed to be between 0 and 2^63-1.
【Input form】
The number of types of currencies in the currency system is V (1<=V<=25). The amount of money to be constructed is N (1<= N<=10,000).
First line: two integers, V and N .
Second line: denominations of available currencies, separated by spaces.
【Output format】
A separate line contains the number of possible solutions R for making up n units of currency with these v coins.
【Sample input】
3 10
1 2 5
【Example output】
10
【Example description】
【Grading】
【Problem Description】
The ant kingdom is constantly evolving, not only creating their own government, but also choosing to establish their own currency system. They are curious about monetary systems.
Traditionally, a currency system is made up of unit denominations of 1, 5, 10, 20 or 25, 50, and 100 .
The ant wants to know how many different ways there are to construct a definite numerical value from the money in the monetary system.
For example, some possible ways of using a currency system {1,2,5,10,...} to generate a denomination of 18 units are : 18x1, 9x2, 8x2+2x1, 3x5+2+1, and so on.
Write a program that counts how many ways a given monetary system can be used to construct a certain amount of denomination. The total is guaranteed to be between 0 and 2^63-1 .
【Input form】
The number of types of currency in the currency system is V (1<=V<=25) . The amount of money to be constructed is N (1<= N<=10,000) .
Line 1: Two integers , V and N.
Second line: denominations of available currencies , separated by spaces .
【Output format】
A single row contains the number of possible solutions R for making up n units of currency with these v coins .
【Sample input】
3 10
1 2 5
[Sample output]
10
[Example description]
[Score criteria]
We are going to learn dsa lec and side by side linux command also
Hey guy's Look ,
JavaScript Features critical to understand
https://mega.nz/folder/wQ1lyQab#iJ7pacvWt5oYKFUcBtjz3A/folder/JRcHSCjY
Udemy - Spring boot Microservices
https://mega.nz/folder/z5MghYZQ#OJXC1YdmnRG5xgS_jmkHLA
Udemy - Programming for kids
https://mega.nz/folder/f5NRjKjA#nQqEpOka_VJ7XnCKPxWv7g
Udemy - Visual Studio code
https://mega.nz/folder/lVVH0S5Z#WFhaKyETBuz4tTp9ltzIdg
Udemy - Web development
https://mega.nz/folder/qx5QQILR#ZBaTPewL9wrR_M0QSJZZYg
Udemy - Php
https://mega.nz/folder/208kkKIB#TOyaWtNPs5nLv8ECBBoWqw
Udemy - Angular 8
https://mega.nz/folder/LoIUkArT#4KoPer_i1KZs-uJug8yvqw
Udemy - Learn about python
https://mega.nz/folder/RRFEyIYB#jRVC4FK87WmvtEbgSsSp5g
See What I've found 🤗😀
Please Keep Supporting Us 😔🙏
Repost from Python full stack development
🔰 Best PDF Searching Websites for Books & Novels 🔰
https://pdfgrab.com/
http://www.pdfgeni.com/
https://pdfroom.com/
https://oceanofpdf.com/
https://pdfdrive.com/
https://pdfsearches.com/
http://www.sopdf.com/
https://epdf.pub/
https://kupdf.net/
https://ebookpdf.com/
https://pdfbooks.co.za/
http://www.pdfsearchengine.info/
https://largepdf.com/
https://www.pdforigin.info/
https://pdfslide.net/
Enjoy 👍❤️
const s = "Hello World"
let val;
val = s.toUpperCase();
'HELLO WORLD'
const s = "Hello Wolrd"
// How to convert lower case into upper case in java script
yesterday some students are facing problems in JS basics pdf
Google- Interview Warmup
This tool will help you to prepare for your interview in any field.
Google will ask a series of
questions and you have to answer them according to you.
Google will help you to review your Answers by pointing out mistakes like grammatical or language errors.
Moreover, Google will also help you to find out the convincing points in your answers.
https://grow.google/certificates/interview-warmup/
Repost from Python full stack development
Training Your Mind to Overcome Pressure and Underperformance.zip80.13 MB
Repost from Python full stack development
📁 Full description
In this audio-only course from How to Be Awesome at Your Job, Dr. Ellen Reed reveals how to train your brain to be more solution-focused. As Ellen explains, you can teach your brain to focus on solutions, rather than problems, to build your mental toughness. She walks you through creating a success log. Making a habit out of the success log will train your brain to focus on improvements, instead of failures and will build up your self-confidence. Ellen also shows you how to recognize when youre fixating on the problem, so that you can shift to thinking about a solution instead. She stresses the importance of not trying to resolve every problem. Plus, Ellen walks you through a mental workout to get yourself fired up to do what you need to do.
This course was created by Pete Mockaitis of How to Be Awesome at Your Job. We are pleased to offer this training in our library.
