def verify_model(model, hist):
# 15-bit integers.
for p in model:
if not type(p) is int:
raise Exception("model does not consist of 15-bit integers")
if not 0 <= p <= 0x7fff:
raise Exception("model does not consist of 15-bit integers")
# Sums to 1.
if sum(model) != 0x7fff:
raise Exception("cumulative probability of model is not 1")
# Non-zero.
for i in range(len(hist)):
if hist[i] != 0 and model[i] == 0:
raise Exception("model assigns zero probability to non-zero probability symbol")
IF I ASK YOU FOR AN ARRAY OF REAL NUMBER PROBABILITIES SUCH THAT THE CUMULATIVE PROBABILITY IS 1, WOULD YOU ARGUE THAT "5 is a real number", or that "0.5 is a probability, but it's not the value you'd use"
If someone makes a code golf, "half every number in a list", and you simply output the list, do you also try to argue that every number in your list means that it's half the value?
def verify_model(model, hist):
# 15-bit integers.
for p in model:
if not type(p) is int:
raise Exception("model does not consist of 15-bit integers")
if not 0 <= p <= 0x7fff:
raise Exception("model does not consist of 15-bit integers")
# Sums to 1.
if sum(model) != 0x7fff:
raise Exception("cumulative probability of model is not 1")
# Zero must stay accurate.
for m, h in zip(model, hist):
if (m == 0 and h != 0) or (m != 0 and h == 0):
Obviously you may assume that the histogram is not all 0, otherwise you can't sum to 0x7fff yet 0 stays 0 :)
Context: My state's primary is in a week, there's a 90% change that I'll just drive the 20 minutes to vote in person, but I was looking at the "official absentee ballot application generator" that they have set up, and it spits out an .xdp file.
I don't know how other interpreters do it, but TIO transpiles to C, then compiles with gcc. That's probably overkill for small programs, but it should be pretty fast for complex ones.
well the definition says that there must be some part of the code encoding another part. if you only change one of them, there's going to be some sort of mismatch, no?
Python, 184 bytes
z=0
for i,e in enumerate(t):
if e!=0:
while z!=0:
if l>e:
t[i-z]=e+z
else:
t[i-z]=e-z
z-=1
l=e
else:
z+=1
print t
Input: must be a [list] of ints
Output: [list] of ints
Answer 173 - Vitsy
Distance 7 from answer 172
4mrZ"#03w(*#class jux!{public static void main(String[] h){#\
#System.Console.Writeln(//@\//Hello*}}print,cat<<#*)\
put"
a
"Hello World!";#(O).g!)S(#X` ;}}//printputsx;//-##E;]bye#*)
Oh, geez, that was easier than I expected it to be.
Explanation:...
Welcome to Programming Puzzles & Code Golf! Your code appears to assume that the variable t is defined. In general, submissions cannot assume that variables exist because it makes them snippets rather than full programs (which read from STDIN and write to STDOUT) or functions (which accept input and return output). To fix this, you could add t=input() or wrap the whole thing in something like def f(t). Let me know if you have any questions! — Alex A. ♦3 mins ago
You are to approximate the value of:
Where your input is I.
Rules
You may not use any built-in integral functions.
You may not use any built-in infinite summation functions.
Your code must execute in a reasonable amount of time ( < 20 seconds on my machine)
You may assume that input is grea...
Vitsy, 39 bytes
Thought I might as well give my own contribution. ¯\_(ツ)_/¯ This uses the Left-Hand Riemann Sum estimation of integrals.
D9/([X9]1a5^D{/V}*0v1{\[EvV+DDv{/}^+]V*
D9/([X9] Truncation trick from Alex A.'s answer.
D Duplicate input.
9/ ...
If you work on the number in groups of three digits, you can represent each triplet in 10 bits with very little wastage. Then you "just" need to create a stream of 8-bit octets from your stream of 10-bit triples, which will require a certain amount of bit-shifting, but is not awfully complicated....
rici's answer, using 10 bits for every three digits, is indeed what I would use for a practical application.
However since you asked for the optimal compression and stated that you don't care about speed, that would be generating a binary representation of the decimal number using multiple preci...
I don't know what that one is talking about but this one recommends GMP.
I like patterns in time. My favorite is when the time lines up. For example, all of these line up:
3:45
12:34
23:45
3:21
6:54
This is because each digit in the hour/minute is one more/less than the previous.
Your task is to take the current time and check if it "lines up" in this pattern in a...
@Seadrus That's how the first answer did it and the others followed its lead? Not sure. I'll reopen the question, but please add the test case I mentioned so there's no more potential for confusion.
Python, 184 bytes
z=0
for i,e in enumerate(t):
if e!=0:
while z!=0:
if l>e:
t[i-z]=e+z
else:
t[i-z]=e-z
z-=1
l=e
else:
z+=1
print t
Input: must be a [list] of ints
Output: [list] of ints
Answer 173 - Vitsy
Distance 7 from answer 172
4mrZ"#03w(*#class jux!{public static void main(String[] h){#\
#System.Console.Writeln(//@\//Hello*}}print,cat<<#*)\
put"
a
"Hello World!";#(O).g!)S(#X` ;}}//printputsx;//-##E;]bye#*)
Oh, geez, that was easier than I expected it to be.
Explanation:...
I like patterns in time. My favorite is when the time lines up. For example, all of these line up:
3:45
12:34
23:45
3:21
6:54
This is because each digit in the hour/minute is one more/less than the previous.
Your task is to take the current time and check if it "lines up" in this pattern in a...
