so, unless those humans were lazy enough to just dismiss the site as a false positive just because it's a look-alike, which I doubt is the case for Kaspersky, then yes it does contain an actual virus
duh, closing, Kaspersky is bugging me all the time and yes it does feel dangerous tbf, I don't think it's because of humorless banks but because your login details go over
🖉 CMC: Given array A which contains zero or more complex numbers leaf elements, conjugate all the complex numbers anywhere (potentially deep inside) in A, leaving all other data as-is.
@EriktheOutgolfer Yes, that solution is still valid. But what do you mean by that "all other data" is nothing?
OK, here is one that isn't trivial for Dyalog APL:
CMC: Given a non-empty array A which contains zero or more complex number leaf elements, negate the real part of all the numbers anywhere (potentially deep inside) in A, leaving all other data as-is.
@Adám because when we say that an array is comprised of "zero or more X literals" we usually mean that and nothing else, and also that I'm a professional rule bender :P
Input:
Integer n which is >=0 or >=1 (f(0) is optional)
Output:
The n'th number in the sequence below, OR the sequence up to and including the n'th number.
Sequence:
(0),1,-1,-3,0,5,-1,-7,0,9,-1,-11,0,13,-1,-15,0,17,-1,-19,0,21,-1,-23,0,25,-1,-27,0,29,-1,-31,0,33,-1,-35,0,37,-1,-39,0,41,-1,-...
CMC: Given a flattened array a and a list of integers d representing depths, reconstruct the original array, with increasing depths acting like steps, rather than wells. Example: a = [6, 2, 7, 1, 3, 4, 5]; d = [1, 2, 2, 3, 1, 1, 0]; result = [[6, [2, 7, [1]], 3, 4], 5]
Description :
Your job is to create a simple interpreter for a language. The language supports following operators :
+ = addition
- = subtraction
* = multiplicatiom
/ = division
less than sign (<) , greater than (>) , less than equal to (<=) , greater than equal to (=<) , equal to (==) , not eq...
@user202729 Didn't realise you were golfing it for me to edit in, sorry. I'll do it when I get to a computer (or if someone else could, that'd be helpful)
Suddenly when editing in code::blocks, an exceeding annoying thing is happening: When I place my cursor below some character A and type B, B gets inserted where the cursor was and A is shifted right. But now A is being deleted and B is replacing that.
@EriktheOutgolfer Upvotes are useful, as they indicates the challenge is ready. Downvotes are either (1) something is wrong (2) the challenge idea is wrong, without comments it's impossible to know.
@user202729 Remember, new users don't know about all the resources on meta. What you may have linked to hundreds of times, they've never seen it before.
At least @DIDIx13 is making an effort to improve their challenge writing. Too many new users would be discouraged by their first proposal being heavily downvoted.
@user202729 Ah, that makes sense. I read the ellipsis as "Are you kidding me, how could you not know that?", or stunned silence.
Description :
Given a string of space separated binary digits. Your job is to find the xor of each until you end up with one answer either 0 or 1. The inputs will always be valid and will only be either 0 or 1.
Example :
1 0 0 1 0 --> 0
1 0 1 1 1 0 0 1 0 0 0 0 --> 1
This is code golf so shor...
@user202729 The circle fns are really easy to memorise though.
@J.Sallé Probably because people tend to not realise that they are the same. Another not-so-obvious one is "implies" (which isn't mentioned on the language bar). Can you find it?
@J.Sallé Think of it like this: A implies B is only false if A∧~B, i.e. A>B. So A implies B is only true if ~A>B, i.e. A≤B.
Material implication is ≤. Material non-implication is >. Converse implication is ≥. Converse non-implication is <. Material biconditional is =. Exclusive disjunction is ≠.
(Inspired by last week's Riddler on FiveThirtyEight.com. Sandbox post.)
Given a year between 2001 and 2099, calculate and return the number of days during that calendar year where mm * dd = yy (where yy is the 2-digit year).
2018, for example, has 5:
January 18th (1 * 18 = 18)
February 9th ...
Write a program that prints the numbers from 1 to N(1 ≤ N ≤ 200) except for multiples of 5 where you have to print "Foo" and for the multiples of 7 where you have to print "Bar". For numbers which are multiples of both 5 and 7 print "FooBar".
Spiraling Axes
code-golf number-theory other tags?
Take the numbers 0, 1, 2, 3, 4, ... and arrange them in a clockwise spiral, writing each digit as a separate square. Then, given one of four distinct and consistent ASCII characters as input, and an input integer n, output the first n terms of ...
Nuget can now install applications in addition to libraries, through something called dotnet tools. It's been out for two days in preview state and as far as I can tell it's already infintiely superiour to npm.
@cairdcoinheringaahing 2.1.4 has been working just fine for months. It's a proper release, and it doesn't break except when you're running it on TIO.
TIO is special though.
NMP hasn't happened yet, but regarding codegolf.stackexchange.com/questions/162143/…: I want to VTC as unclear or something, except itsn't not actually all that unclear, it's just really poorly written.
Write a program that randomly generates an integer with 10 to 20 digits. The program will then asks the user to guess a digit used in the number. If the digit appears in the number, display the number with the guessed digits and an “x” for the unknown digits. Allow the user to guess n times where...
@user202729 what Lynn and Caird said. Just because it's negatively scored doesn't mean it's bad or unredeemable. In fact, negative scored questions probably deserve more attention/visibility than positive ones
heh. I'm doing it just so it's easier on the rest of the (soon to be existing) codebase
Entire thing is using C++17, and having old style C code will look out of place and possibly cause issues. LuaJIT helps a bit by providing support for C++ exceptions
Counting objects: 241, done.
Delta compression using up to 8 threads.
error: pack-objects died of signal 9
fatal: The remote end hung up unexpectedly
fatal: The remote end hung up unexpectedly
fatal: write error: Bad file descriptor
Input:
Integer n which is >=0 or >=1 (f(0) is optional)
Output:
The n'th number in the sequence below, OR the sequence up to and including the n'th number.
Sequence:
(0),1,-1,-3,0,5,-1,-7,0,9,-1,-11,0,13,-1,-15,0,17,-1,-19,0,21,-1,-23,0,25,-1,-27,0,29,-1,-31,0,33,-1,-35,0,37,-1,-39,0,41,-1,-...
Description :
Your job is to create a simple interpreter for a language. The language supports following operators :
+ = addition
- = subtraction
* = multiplicatiom
/ = division
less than sign (<) , greater than (>) , less than equal to (<=) , greater than equal to (=<) , equal to (==) , not eq...
(Inspired by last week's Riddler on FiveThirtyEight.com. Sandbox post.)
Given a year between 2001 and 2099, calculate and return the number of days during that calendar year where mm * dd = yy (where yy is the 2-digit year).
2018, for example, has 5:
January 18th (1 * 18 = 18)
February 9th ...
Write a program that prints the numbers from 1 to N(1 ≤ N ≤ 200) except for multiples of 5 where you have to print "Foo" and for the multiples of 7 where you have to print "Bar". For numbers which are multiples of both 5 and 7 print "FooBar".
Spiraling Axes
code-golf number-theory other tags?
Take the numbers 0, 1, 2, 3, 4, ... and arrange them in a clockwise spiral, writing each digit as a separate square. Then, given one of four distinct and consistent ASCII characters as input, and an input integer n, output the first n terms of ...
