@MilkyWay90 I'm pretty sure the exact opposite is true. pop-cons are only okay when there's exactly no other objective-ish way to score it, and even then it'd probably be downvoted to oblivion
Give 'em the bird!
Draw this ASCII middle finger!
....................../´¯/)
....................,/¯../
.................../..../
............./´¯/'...'/´¯¯`·¸
........../'/.../..../......./¨¯\
........('(...´...´.... ¯~/'...')
.........\.................'...../
..........''...\...........
Anonymous
IMO I think that most popcons aren't good challenges. We've had a handful of good ones amongst a large number of bad ones, whereas with the objective challenge types, we have far more good than bad. Perhaps it wouldn't be such a terrible idea to make popcons off-topic in general, but grant special exceptions for particularly well-crafted ones (though that's basically the de facto state of popcons right now).
The challenge
Sort a list of integers, result should be the sorted list. The catch is that you can only use keyboard shortcuts of a popular program.
Details
Sorting is in ascending order.
Input is already written, output should be visible to the user.
Shortest number of shortcuts wins.
A sh...
Bit-checker
codegolf radiation-hardening decision-problem
Write a program that takes two integers in the range \$0\$ to \$255\$ inclusive, and returns whether the binary forms of the numbers are exactly one bit different.
For example, \$1\$ and \$0\$ have binary forms 00000001 and 00000000, w...
terrible website design of the day: a large chat prompt that has no exit button.
Just in case you don't see enough bad site designs in your regular browsing, I am here to provide a curated selection, delivered directly to this chat room.
CMS: Sort an array of integers according to a list of preferences. There are three preferences, Odd, Even and Any. Example: [1, 2, 3, 4, 5, 6, 7, 8, 9] sorted by [O, O, A, A, E, E, O, A, E] gives [1, 3, 2, 4, 6, 8, 5, 7, 9] - the last E couldn't be satisfied so it turns into an A
Your task here will be to write a very dumb IA capable of fetching all treasures on a map.
Map
The map is defined as follow: (artist-mode™-powered)
Basic case:
+-+-+-+-+-+-+-+-+-+-+-+-+-+
|P| | | | | | | | | | | | |
+-+-+-+-+-+-+-+-+-+-+-+-+-+
| | | | | | | | | | | | | |
+-+-+-+-+-+-+-+-+-+-+...
If I need to get all diagonals in all directions:-
I do the following formula 2 N − 2 − |x − y| − |x + y − N − 1|
So, for above example it would result 13 and that's correct.
Now, I'm trying to count the diagonals in only one direction, example on above board:-
The top right 4, top left 3, ...
Write a program that takes a single line string that you can assume will only contain the characters /\_‾. (That's forward and backward slash, underline and overline. You can use ~ in place of overline if you need since overline is not convenient ASCII.)
For example, one possible input is:
__/‾...
@NewMainPosts Hmm, is a mixed character set and non-uniform size good enough to make that challenge unique? Cause I know that exists in the basic "Parse ascii-art numbers"
I see the bottom of vote list good and some good questions removed cuz of low votes. Is there way to see the removed or I have to go through all possible question id?
In Pascal's triangle each number is the sum of the two numbers directly above it, treating empty spots as zero:
By rotating the triangle, we can cut out square matrices of varying sizes and rotations which I will call Pascal's matrices. Note that those matrices always need to contain the top \...
A professor assigned a program to his class for which the output is a string of lower-case
letters. Unfortunately, he did not specify an ordering of the characters in the string, so
he is having difficulty grading student submissions. Because of that, he has requested
your help by writing a progr...
@MilkyWay90 You are free to write whatever challenge you want, in complete disregard of any existing off-topic posts, even should your challenge be mostly identical to one. No attribution needed either.
Stop editing programming questions to make them on-topic
Note that this is solely my opinion about the problem. In case the post was initially a general programming question, I think we should not edit them to make them on topic for the following reason:
Although (usually) obnoxiously ineffici...
THE PROBLEM
Your job, should you choose to accept it, is to take in two strings through any default input/output method and output a truthy or falsy value depending on whether the two string share the same characters as the other strings.
Test Cases
"hello, world!", "elhlo ,!drlow" > True
"\/...
Give 'em the bird!
Draw this ASCII middle finger!
....................../´¯/)
....................,/¯../
.................../..../
............./´¯/'...'/´¯¯`·¸
........../'/.../..../......./¨¯\
........('(...´...´.... ¯~/'...')
.........\.................'...../
..........''...\...........
The challenge
Sort a list of integers, result should be the sorted list. The catch is that you can only use keyboard shortcuts of a popular program.
Details
Sorting is in ascending order.
Input is already written, output should be visible to the user.
Shortest number of shortcuts wins.
A sh...
Bit-checker
codegolf radiation-hardening decision-problem
Write a program that takes two integers in the range \$0\$ to \$255\$ inclusive, and returns whether the binary forms of the numbers are exactly one bit different.
For example, \$1\$ and \$0\$ have binary forms 00000001 and 00000000, w...
Your task here will be to write a very dumb IA capable of fetching all treasures on a map.
Map
The map is defined as follow: (artist-mode™-powered)
Basic case:
+-+-+-+-+-+-+-+-+-+-+-+-+-+
|P| | | | | | | | | | | | |
+-+-+-+-+-+-+-+-+-+-+-+-+-+
| | | | | | | | | | | | | |
+-+-+-+-+-+-+-+-+-+-+...
If I need to get all diagonals in all directions:-
I do the following formula 2 N − 2 − |x − y| − |x + y − N − 1|
So, for above example it would result 13 and that's correct.
Now, I'm trying to count the diagonals in only one direction, example on above board:-
The top right 4, top left 3, ...
Write a program that takes a single line string that you can assume will only contain the characters /\_‾. (That's forward and backward slash, underline and overline. You can use ~ in place of overline if you need since overline is not convenient ASCII.)
For example, one possible input is:
__/‾...
Inspired by this game
Challenge:
Given an ASCII art string representing a number, output that number.
Example:
Input:
&&&& ##### .====.. .&&&
$$$$$. %% %% % % . +. .
@@@ . @@ . = . = . ????
+++. && &&. % % = =
$$$ . @@@@@ # ...
I see the bottom of vote list good and some good questions removed cuz of low votes. Is there way to see the removed or I have to go through all possible question id?
In Pascal's triangle each number is the sum of the two numbers directly above it, treating empty spots as zero:
By rotating the triangle, we can cut out square matrices of varying sizes and rotations which I will call Pascal's matrices. Note that those matrices always need to contain the top \...
Stop editing programming questions to make them on-topic
Note that this is solely my opinion about the problem. In case the post was initially a general programming question, I think we should not edit them to make them on topic for the following reason:
Although (usually) obnoxiously ineffici...
THE PROBLEM
Your job, should you choose to accept it, is to take in two strings through any default input/output method and output a truthy or falsy value depending on whether the two string share the same characters as the other strings.
Test Cases
"hello, world!", "elhlo ,!drlow" > True
"\/...
