168 questions
Do you want to improve this question?Edit this post and update the question to focus on one issueClosed 7 years ago.7 years agoI'd like to make a flow diagram of the slot machine.When you press the st...
It looks like an associative array, but For associative arrays, map I think it's sufficient that it's easily prepared in STL.Why was Judy array born?Compared to map and set, what is the big difference...
It looks like an associative array, but For associative arrays, map I think it's sufficient that it's easily prepared in STL.Why was Judy array born?Compared to map and set, what is the big difference...
One of the most appropriate suspension issues is the selection of secretaries, but how should we decide the number to postpone?Description of Wikipedia is difficult for me.Additional I was able to get...
I started a program to make Sudoku as follows.I was able to create 9x9 without any problems (without feeling slow).16x16 immediately becomes heavy, like an infinite loop, and no end of processing.In t...
I started a program to make Sudoku as follows.I was able to create 9x9 without any problems (without feeling slow).16x16 immediately becomes heavy, like an infinite loop, and no end of processing.In t...
One of the most appropriate suspension issues is the selection of secretaries, but how should we decide the number to postpone?Description of Wikipedia is difficult for me.Additional I was able to get...
How do I reverse (swap) the order of bits for a fixed bit length (example 16 bits)?Example: 0001 1010 1100 1000 to 00010011 0101000 Only functions included in the standard library of C language are us...
Read the body of the problem here: AtCoder Typical Contest 001A - Depth Priority Search My code is as follows.import syssys.setrecursionlimit(10000)H,W = map(int, input().split())maze = [list(map(str,...
When I tried to implement reverse Poland, after receiving input in while(scanf(%s,s)!=EOF), the conditional branch begins in if(s[0]=='+'). Why do I keep the index of s[0] and array 0 fixed?I imagine ...
| « | - 5 - | » |
© 2024 OneMinuteCode. All rights reserved.