Answer the question
In order to leave comments, you need to log in
How to storyboard images in C#?
Hello, I can’t solve this problem, please help a newbie in Sharpe.
There is a set of images of different heights and widths. Images can be arranged from left to right, forming a row, or from top to bottom, forming a column. Rows, in turn, in addition to images, can contain columns, and columns can contain rows. We will further develop such a structure of images, rows and columns call it an "image tree". If all row elements (images and columns) are reduced to the same height, and column elements (images and rows) are reduced to the same width while maintaining proportions, then such a tree will be called an “image storyboard”. It is necessary to write a program that receives an image tree as input and the number of pixels ω, per output-image of the storyboard with width ω, while one of the conditions is met (from the first and easiest to the last most difficult):
1. The tree consists of only one row with an arbitrary number of images without columns.
2. The image tree contains an arbitrary number of images, rows and columns in arbitrary places.
3. The second condition is met and the input receives four additional parameters that are taken into account when forming the storyboard: indent from the image top, right, bottom and left.
Answer the question
In order to leave comments, you need to log in
What is the difficulty? Here the condition is more incomprehensible, not the implementation.
In what form does this "tree" arrive, how is it encoded? Is it necessary to preserve the order of the images? What to do if ω < the width of the narrowest image or such a situation is not provided by the condition?
Here is a set of pictures file1.jpg, file2.jpg, file3.jpg, file4.jpg, file5.jpg.
How is the information given that file2, file4 and file5 form a column?
Well, you should not hope that this kursach here for you someone will write. You write what you have already done and what specifically does not work.
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question