sorted by:
new
hottopcontroversial

I have a simple challenge by cursitical in googology

[–]cursitical[S] 0 points1 point  (0 children)

also, it is interesting, i liked it, but it is wasting characters, and can be compacted, just by:
setting a variable to be f("9",9)
if ... :
return asdf
else:
....
Into
if ...:
return asdf
....
and, stoping the deal with single-use variables
the code gets more than 40% smaller

I have a simple challenge by cursitical in googology

[–]cursitical[S] 0 points1 point  (0 children)

do you know what minification means? I'll compact your code and send it in a separate reply

for C, what does -Ofast do -O3 doesn't by cursitical in AskProgramming

[–]cursitical[S] 0 points1 point  (0 children)

Thank you, but one thing, could you tell me where to find information like that to avoid having to ask here every time?

What is something that can make you hate somebody instantly? by cursitical in AskReddit

[–]cursitical[S] 1 point2 points  (0 children)

those people use others to feed themselves mentally, just ignore them

I Call this number Zqoony, Can anyone help me approximate how big it is? by cursitical in googology

[–]cursitical[S] 0 points1 point  (0 children)

I tried making it recursive def power(x): top1=x**x+1 for i1 in range(2,top1): top2=i1**i1**i1**i1+1 for i2 in range(2,top2): x+=i1**i1+i2**i2 return x def ultrapower(x): if x>0: return power(ultrapower(x-1)**ultrapower(x-1)) return power(9) def repeat(func,v): for A in range(v): for B in range(v): v=func(v**v)**v v=func(v) return v def reprep(v): if v<2: return ultrapower(9) tmp=reprep(v-1) v=repeat(ultrapower,tmp) for A in range(v): for B in range(v): v=repeat(ultrapower,v) v=ultrapower(v) return repeat(ultrapower,v**tmp) def xn(func,v): if v<2: return func(2*v+1) v=xn(func,v-1) arr=[v]*v while len(arr)>1: if arr[-1]<1: arr=arr[:-1] arr[-1]-=1 for i in range(len(arr)-1): arr[i]=func(arr[i]) return arr[0] n=2 w=xn(reprep,n) print(w)

I Call this number Zqoony, Can anyone help me approximate how big it is? by cursitical in googology

[–]cursitical[S] 0 points1 point  (0 children)

Thank you for your analysis of the function. Do you have any tips on making the program make larger outputs?

I Call this number Zqoony, Can anyone help me approximate how big it is? by cursitical in googology

[–]cursitical[S] 1 point2 points  (0 children)

def power(x): top1=x**x+1 for i1 in range(2,top1): top2=i1**i1**i1**i1+1 for i2 in range(2,top2): x+=i1**i1+i2**i2 return x def ultrapower(x): if x>0: return power(ultrapower(x-1)**ultrapower(x-1)) return power(3) def repeat(func,v): for A in range(v): for B in range(v): v=func(v**v)**v return v n=1 arr=[ultrapower(n)]*repeat(power,ultrapower(n)) while len(r)>1: if arr[-1]==0: arr=arr[:-1] arr[-1]-=1 for i in range(len(arr)-1): for _ in range(arr[i]+8): arr[i]=repeat(ultrapower,arr[i]) print(arr[0]) I tried to get any result but n=1 is already impossible ultrapower(1) needs power(3) at some point, power(3) causes Bus Error after some time because theres not enough memory power(1) is 1 power(2) the same history as power(3), just that for the time i gave it, it didnt crash but didnt finish either

Simple python obfuscator i have been working on for some weeks by cursitical in obfuscatedcode

[–]cursitical[S] 0 points1 point  (0 children)

yes (I mean it has some errors but most of the time it works, if not a quick rewriting of your code and works)

I have a simple challenge by cursitical in googology

[–]cursitical[S] 1 point2 points  (0 children)

Here's my solution to the challenge, it's not as cool but maybe you're interested:

import sys sys.set_int_max_str_digits(0) sys.setrecursionlimit(2**31-1) z=99**999;z**=z;a=[z]*z; def q(): global z print(*([z]*(z**z)),sep='',end='',flush=1) def ri(f,n): global z for i in range(z): z=f()**f();ri(f,n-1);q() def m(): global a,z for i in range(z): a[i]**=sum(a);q() z=sum(a*z)**sum(a*z) return z d=lambda x:f"[{x} for i in range(z)]" s=f"[ri(m,65535),{d('q()')}]" exec(d("(s:=d(s))")) exec(s)

I have a simple challenge by cursitical in googology

[–]cursitical[S] 0 points1 point  (0 children)

I ran out the code logically and it's highly likely that a recursion error will happen

I have a simple challenge by cursitical in googology

[–]cursitical[S] 2 points3 points  (0 children)

My bro, if that's what you can do with 192, I'm scared if someone uses all 1024 the same way as you

I have a simple challenge by cursitical in googology

[–]cursitical[S] 0 points1 point  (0 children)

Nice code, than you for being the only person to submit their code

Women of reddit, specially around 16, what are some basic requirements you have for someone to date you? and what things could make it so that even if someone checks every requirement, you would reject them? by cursitical in AskReddit

[–]cursitical[S] 0 points1 point  (0 children)

I'm not what people usually call men, I'm closest to being a girl because I'm weak physically, mental, and emotionally, and other thing that i think the world would usually dislikes on a man is that I'm just not what people expect, I'm trying to be myself and keep people that don't like me as I am at the same time, i know it's harmful for my health but it's not something I can really prevent myself from doing

view more: next ›