168 questions
I'm solving the past questions of competition programming, but I don't get the output I expected from the test case.Why?This problem seems to be a problem for all exploration, so I try to solve it usi...
I implement the Dijkstra method in the Additional Challenge part of the main function, but I don't know how...Even if I look at the implementation method, I don't understand the meaning from から...impo...
Below is the problem of determining the number of divisions using dynamic planning.The following dp arrangement is defined and a gradualization formula is used to solve this problem, but there are thr...
We have rewritten the following algorithms in Python that apply the absorption of logical operations implemented in Java: 1 Vector matrix = [a], [a, b], [a, c];2 for (inti=0;i<matrix.size();i++){3 ...
About how to show the average calculation of a binary search treeBased on the results of the image below, T(n)<4logn+1 was shown for all n, and it is said that the average depth of the tree is O(lo...
I don't understand the implementation of this problem, which is answered using a recursive function.The understanding of the recursive function itself is an understandable state of implementation, suc...
I'd like to ask for the number of change bills and coins.I want to solve it with Ruby, but I don't know how to do it.The results of a 468 yen purchase and a 10,000 yen bill are as follows.Number of 5,...
I have a question about C language.There are two arrays A, B, each storing an integer, the number in the array is sorted in ascending order, and there are no overlapping numbers in the array A, which ...
We would like to receive your ideas.For business purposes, I would like to find the longest path to the directed graph as shown below.I am thinking about it.①From to まで.The actual graph is more compli...
ZeroDivisionError: integer division or module by zeroHere's the code.def Euclidean_algo(m,n): while m%n!=0: m=n n = m%n else: return nm=int(input('the bigger int is:')n = int(input('the smaller int...
| « | - 3 - | » |
© 2024 OneMinuteCode. All rights reserved.