I tried solving This Challenge in TacO, Managed to get all the primes less than or equal to n into a list, then remembered I have no way to evaluate the product of a list.
It's hard to wrap your head around, hard to write, and any particular problem may actually be impossible to solve, meaning writing it can be both frustrating and worthless.
@HyperNeutrino originality comes after being unoriginal many times. (I've made three-ish BF derivatives, 2 ><>/fungeoids, and an arguably worse version of pyth) - not saying my ideas are all that original
public class StupidStack {
const string StackFile = "stack.txt";
public StupidStack() {
File.Create(StackFile);
}
public void Push(int i) {
File.AppendAllText(StackFile, i.ToString() + Environment.NewLine);
}
public bool IsEmpty => File.ReadAllText(StackFile).Trim().Length == 0;
public int Pop() {
if (IsEmpty)
return 0;
var text = File.ReadAllText(StackFile);
return int.Parse(text.Split(Environment.NewLine).Last());
Parse written integers
Take a number in the range 0-100 as input in its written (text) form, such as one, eleven or twenty-three, and output the value as number, such as 1, 11 or 23.
Builtin functions:
Built in functions that can transform a number to text (1 - one) or transform text to numbe...
90 % fail this challenge!
I guess I'm not the only one that have seen this kind of image on Facebook (and other sites).
The picture above was posted 12 days ago, and has accumulated 31 k comments. Some answers: 0, 4, 8, 48, 88, 120, 124 and so on.
Challenge:
The mathematics in the question...
Given an array of tightly packed bits. Also its length is known and is fixed, but is not guranteed to be multiply of 8. Task is to rotate array, shifting bits by a specified amount positions in either direction. Positive shifts go to the left and negative values go to the right. Bits should circu...
Suppose a new piece namely the camel is introduced in a chess board.Camels can move from a position(x,y) to (x+1,y),(x,y+1),(x-1,y),(x,y-1).How many such camels can be placed in a NxN chessboard so that no two camels attack each other?
For a 1x1 board,there can be only 1 such piece.
For a 2x2 bo...
@LeakyNun however, for each p I only ever use two mods :)
@LeakyNun the trick is montgomery multiplication
it takes some precomputation
but once you've done that you can calculate a*b % m without any modulo, just multiplication (or rather, you change the modulo from mod p to mod R, where R is a power of two, so it's free)
// Returns (ab)R mod n given aR mod n, bR mod n, n and -n^(-1) mod R, with R = 2^32
inline uint64_t montmul32(uint64_t a, uint64_t b, uint64_t n, uint64_t nneginv) {
uint64_t T = a*b;
uint32_t m = T*nneginv; // m = T*-n^(-1) (mod 2^32)
uint64_t t = (T + m*n) >> 32;
return t >= n ? t - n : t;
}
In modular arithmetic computation, Montgomery modular multiplication, more commonly referred to as Montgomery multiplication, is a method for performing fast modular multiplication. It was introduced in 1985 by the American mathematician Peter L. Montgomery.
Given two integers a and b and modulus N, the classical modular multiplication algorithm computes ab mod N. Montgomery multiplication works by transforming a and b into a representation known as Montgomery form. For a modulus N, the Montgomery form of a is defined to be aR mod N for some constant R depending only on N and the underlying computer...
Rules
The code must be a function which takes another function as parameter and will print the first cpu instruction byte of parameter such as :
.
func dummy() {
}
print_first_native_instruction_byte(dummy)
would print :
0x90
which is a nop instruction on x86.
You must don’t use any p...
I guess I'm not the only one who have seen this kind of image on Facebook (and other sites).
The picture above was posted 16 days ago, and has accumulated 51 k comments. Some answers: 0, 4, 8, 48, 88, 120, 124 and so on.
Challenge:
The mathematics in the question doesn't make sense1, so we ...
Thanks for the positive feedback I've received on my challenges in the past. I had fun writing them. Unfortunately, I've lost the hang of it so I've decided to stop. I might give it a try some other time. Cheers!
Rules
The code must be a function which takes another function declared in the same program as parameter and will print the first cpu instruction byte of parameter from ram such as shown in the pseudo code below (for example) :
.
package main {
func dummy() {
}
println_or_printf_first_...
the only "coffee" i've had is starbucks (because my parents like starbucks so on occasion I can buy some from the bookstore when we go there to get books) but that's like .01% caffeine lol
It would be "drunk" which may sound slightly awkward, which is why most people just go with the grammatically incorrect past tense form of the verb instead of the participle. But this is chat, grammar is not really a thing here :P
the annoying thing about switching classes at my school is that the school is divided into two parts separated by a single central staircase, and within half a minute of the bell going off that staircase becomes a flood of about 90% of the school population so it takes like 2 minutes to get through a single flight :P
and now they need to demolish it because it's no longer safe by the new safety standards (so I could die today from falling through a staircase, who knows) and rebuild it, which I wish they did earlier because this school has air conditioning in about 5 rooms xD
Parse written integers
Take a number in the range 0-100 as input in its written (text) form, such as one, eleven or twenty-three, and output the value as number, such as 1, 11 or 23.
Builtin functions:
Built in functions that can transform a number to text (1 - one) or transform text to numbe...
