Competitive coding


Joined
Nov 12, 2022
Messages
1
Reaction score
0
Given a matrix B of k x j integers representing the predicted prices of m shares for n days and an integer x (positive), find a sequence of at most c transactions that result in maximum profit. (you can hold only one share at a time and you can buy and sell on the same day).
Given an algorithm of time o(m*(n^2k)).
 
Ad

Advertisements

Joined
Sep 21, 2022
Messages
17
Reaction score
2
Given a matrix B of k x j integers representing the predicted prices of m shares for n days and an integer x (positive), find a sequence of at most c transactions that result in maximum profit. (you can hold only one share at a time and you can buy and sell on the same day).
Given an algorithm of time o(m*(n^2k)).

projecteuler.net has hundreds of interesting programming problems in their archive.

The key word is "interesting".
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Top