I've attached the work order as an image and would like to program one of the last three. Unfortunately, I have no idea how to proceed. Can someone help me?
(1 votes)
Loading...Good morning, I'm currently working on Excel's IF OR AND etc. functions. Unfortunately, I'm not making any progress at all. It's about the following: Example: ———————————————————————————————— Company— ———Amount—– ———Discount— —–Pay? BASG AG— —-€11,007.00 ——2.00% ———(Yes or No?) ———————————————————————————————– For discounts of €250.00 or more, payment is made immediately. The whole thing starts with =IF(…) This…
I want to write a small bot that reads information from a specific website and then makes decisions accordingly. To get the information I want, a button has to be pressed first. So I found the corresponding element and added a .click() to the end, and that made the information readable. However, if I incorporate…
Hello, can someone answer or explain the gaps or numbers in this figure? Thank you!
Here's the thing: I'm currently importing a font from Google Fonts into an HTML document. The problem is that the entire code is formatted differently as soon as I insert the link. It's almost as if there's no closing tag. The document in which the problem first appeared is long, so I'm adding a small…
Hello, I'm looking for a way to delete the cookies stored by the server's Set-Cookie header from an HttpClient instance. One way that works is CookieContainer cookies = new(); HttpClientHandler handler = new() { CookieContainer = cookies }; HttpClient client = new(handler); // anfragen cookies.SetCookies(new(" https://example.com "), string.Empty); However, you first have to declare the…
How the procedures work, you can find on the Internet. For example: https://de.wikipedia.org/wiki/Vigen%C3%A8re-Chiffre (even with pseudocode)
With your general knowledge of the language you work with, you should be able to implement the researched procedures.
I don't know the algorithms except the Caesar encryption, but find out very quickly online.
However, since you do not want to implement them anyway, here is the procedure for the algorithm and the implementation in the (pseudo) code
The Caesar wears a letter shift. Thus, a shift of 3 letters would then be a becomes d, b to e, c to f and so on. The decryption pushes back the bucks.
It's simple. "Overflows" are not implemented here. So z becomes a, for that you have to optimize this naturally with Modulo, so if we only take small letters a – z into the alphabet, then you can perform a mod 27 because a shift of 27 letters is again the exact same letter in the alphabet. 28 is simply a shift by 1.
Thank you for your efforts!