« first day (3872 days earlier)      last day (426 days later) » 

00:13
REFRESH! There are 6697 unanswered questions (91.3319 answered)
 
3 hours later…
03:15
possible answer invalidation by Luke Lenacio on question by Luke Lenacio: codereview.stackexchange.com/posts/288328/revisions
Also, please read the Stack Overflow help files, paying special attention to the sections on how to ask good questions and what's on topic for this site. Stack Overflow is a Q&A site, where you ask a specific technical question and hopefully receive one or more answers in return. In order for this format to work, you need to ask about some specific issue. "How do I improve my code" is way too general and belongs in Code Review, not here. — MarsAtomic 48 secs ago
possible answer invalidation by Luke Lenacio on question by Luke Lenacio: codereview.stackexchange.com/posts/288328/revisions
possible answer invalidation by Luke Lenacio, Luke Lenacio on question by Luke Lenacio: codereview.stackexchange.com/posts/288328/revisions
possible answer invalidation by Luke Lenacio on question by Luke Lenacio: codereview.stackexchange.com/posts/288328/revisions
possible answer invalidation by Luke Lenacio on question by Luke Lenacio: codereview.stackexchange.com/posts/288328/revisions
possible answer invalidation by Luke Lenacio on question by Luke Lenacio: codereview.stackexchange.com/posts/288328/revisions
04:08
1
Q: Encrypted websocket chat using AES (EAX) and RSA for signing

O'NielFor learning purposes and because it really interests me I am trying to get a better understanding of cryptography by trying to make my own basic secure chat-application. I posted a first version of my attempt here. There were a few flaws in my implementation: My implementation was not E2EE beca...

 
4 hours later…
08:18
0
Q: Advent of Code 2023 Day 3, Part 2 in Python

havocdsPart 2 I'm not sure if my solution covers all edge cases. The puzzle goes as follows: Given some input like this: 467..114.. ...*...... ..35..633. ......#... 617*...... .....+.58. ..592..... ......755. ...$.*.... .664.598.. We're looking for * symbols ("gears") that are adjacent to precisely two...

 
3 hours later…
10:56
0
Q: Refactoring simple mystery function in C

atlvd#include <stdio.h> void mystery_function(int n) { if (n > 0) { mystery_function(n / 2); printf("%d ", n); } } int main() { mystery_function(16); return 0; } This is an educational puzzle, I use it to learn the language, playing mental interpreter. I just started...

11:42
0
Q: Buggy VHDL for 3 item Vending Machine

Rizpekim new here and am studying on how to code in VHDL for about 4 months now and have been doing well until i gave myself the project to build a small vending machine in VHDL. The way i have the VHDL set up is through the “Mealy” process, integrating the output states into the next state logic. I do...

 
1 hour later…
12:50
0
Q: Fetching seats for screening

NofenakEach screening has an assigned room and the room has seats. I need to display the seats for the given screening with information if it is free. The way I do it now is that I get the id of the screening, I download the screening, I take the id of the hall from it, then all the seat id of the ticke...

 
1 hour later…
14:05
Maybe consider posting on Code Review. Stack Overflow is the wrong place for code reviews. Also, asking for “sample code” is off-topic here, as that’s really open-ended and not a specific programming question. Please read How to Ask and how to write a minimal reproducible exampleDavid Makogon 30 secs ago
14:21
0
Q: Please check my reward of LunarLander

John ChoI currently write the reward of LunarLander from gym library. But the lander doesn't work. The main problem is that the lander somehow gets to the landing spot but it does crush on the landing spot. These are the two reward function. I want to build the project just modifying the reward of RL. cl...

 
1 hour later…
15:22
Monking
15:51
0
Q: Given a type, search for an item of that type in a std::tuple

dw218192In my project, I want to search for an item of a given type in a std::tuple at compile time. The given type might not be present in the tuple at all, in which case some invalid value should be returned to signal that. I'm using c++17 by the way. template<typename Arg, typename... Args> struct con...

 
2 hours later…
17:22
0
Q: Applying this statistical test in high-frequency trading with traders with different degrees of informations

V013I am running this test statistics in my MATLAB code applied to instants of informed trading in high-frequency setting : $$ \bar{B}\left( Y,{t_{(n,i)}} \right) = \frac{\sum_{i=1}^{M_n} \bar{Y}_{(i-1)ln+1}\left(\bar\Delta_{(i-1)ln+1} - \frac{1}{k_n} \sum_{j=0}^{k_n-1} \bar\Delta_{(i-1)ln+1+j}\righ...

17:57
Hello
18:30
-2
Q: How could this code possibly compile?

raccoonow public static void main(String[] args) { //TODO code application logic here PacmanGame myPacman = new PacmanGame(); myPacman.setMap(string: “blank”); myPacman.showGame(); int userInput = 5; while (userInput != 0) { userInput = myPacman.getIntFromUser(string: “enter command”)...

19:15
0
Q: Advent of Code 2023 - Day 2: Cube Conundrum

HarithPart 1: The challenge involves analyzing recorded games where an Elf reveals subsets of cubes in a bag, each identified by a game ID. The goal is to determine which games would be possible if the bag contained specific quantities of red, green, and blue cubes. For example, the record of a few gam...

19:38
0
Q: A function to convert 0-2000 milliseconds to a double representing a fraction of a second

my_stack_exchange_account// ms is expected to be between 0 and 2000 // fakeDouble is expected to be {0, 0} // uint64_t isn't used because it doesn't work with /NODEFAULTLIB when compiling 32-bit void msToDouble(uint32_t ms, uint32_t* fakeDouble) { if (ms == 0) { return; } else if (ms >= 2000) { fa...

 
1 hour later…
21:05
You might find this helpful. — Thingamabobs 25 secs ago
21:24
codereview.stackexchange.com is a more appropriate place for this question — Iain Shelvington 43 secs ago

« first day (3872 days earlier)      last day (426 days later) »