hacker

Malte I.Lauterbach

@enigma_dev (7080)
Geeks out about politics, ITSEC, economics, ML and crypto. Also always there to give advice.
Enigma_dev
posted to Ask by CoolJames1610

Haha that's my own fault, funny it's resurfacing. During my time at repl.it, we played around with the cycles for testing. In fact, I have 7K cycles pretty much since December. Now, since I don't work here anymore, the leaderboard lists me again. I'm gonna ask someone to unlist me from it xD

The most complicated "hello world" program in a single line
posted to Share by MarcusWeinberger

Oh boy, that's like reverse code golf. I love it

Repl.it Community Year In Review
posted to Announcements by amasad

Great year, great creators. Thanks for coding with us, fellow replers.

Introducing Repl.it offline!

IP over avian carriers! @Vilagamer999

how 2
posted to Ask by JosMag2019

Hey there! These numbers next to your name are called cycles or karma. You receive them if somebody upvotes a post of yours. See, you got one upvote, by me, now it is at 1.

Student accidentally deleted code - any way to get prior version of program?
posted to Ask by kmcleod

Thats easy to solve, thanks to repl.its history feature. tell your student to click on it, he can there go back in the code-timeline. If this answer helped you, i would appreciate if you amrk it with answered.

Hashtag for Twitter #ReplGang?
posted to Ask by amasad

ReplitDontMessWithUsOrWeWillFindYouAndItWillNotBePleasant is the best

Server/Bot Pinger!
posted to Share by CodingCactus

decrease time to 0.25 seconds, run the instance 500 times and you win @piemadd

Let's talk about π.
posted to Tutorials by LizFoster

I was summoned! Yeah, I’m a big cryptography fan! feel free to pimg me with q‘s! @LizFoster @Highwayman

Primary numbers in pyton
posted to Ask by georgegerdes

Hey Georg! This is a program I wrote for calculating primary numbers in python!

# Python program to check if the input number is prime or not

num = 407

# take input from the user
# num = int(input("Enter a number: "))

# prime numbers are greater than 1
if num > 1:
   # check for factors
   for i in range(2,num):
       if (num % i) == 0:
           print(num,"is not a prime number")
           print(i,"times",num//i,"is",num)
           break
   else:
       print(num,"is a prime number")
       
# if input number is less than
# or equal to 1, it is not prime
else:
   print(num,"is not a prime number")

Also, you should poke around in repl.it more! i see you having not a single repl!

Repl failed to connect
posted to Ask by MATHyou

Hey everyone, we're experiencing some infrastructure difficulties. Specifically around loading repls. You might still be able to load your repl.

Earlier this morning we had a huge surge in traffic that caused a cascade of issues we're trying to debug. We're unsure if the traffic surge is legit or caused by a DDoS. Please bear with us.

Thanks,

Amjad is Eminem. There is proof.
posted to Share by CodeSalvageON

@johnstev111 no, thats my actual haircut

🎉(about:you;)Winner announcement🎉

Email me at [email protected] from your email from which you are registered on repl.it to claim your prize!

✨HERE'S WHO WON OUR MUSIC HACKATHON!
posted to Announcements by katyadee

Congratz to the winners! awesome repls!

Shawn the Rocketship {about:you; }
posted to Challenge by recurshawn

Woah! This is great!

Hashtag for Twitter #ReplGang?
posted to Ask by amasad

I like ReplSquad

Enigma_dev
posted to Ask by HahaYes

It's me-I worked at repl.it before and we were screwing around with cycles. Since I left repl.it-that seems to be resurfacing

Guys help
posted to Ask by Yuahde

If this is a real case, please email me at [email protected] I will investigate

Heart
posted to Share by 2908

Hey there1 please add a description telling users what this repl does and add a descriptive title, or I will haveto delete this post in 72 hours.

Dev Spotlights
posted to Ask by SaptarshiHalder

@theangryepicbanana I will ask zwack sometime this afternoon about spotlight. Check your dms about another same idea of mine

What do you do for keeping your concentration while coding?
posted to Ask by enigma_dev

@SPQR I read about that before. repetition and clear, rhytmic music helps your focus apparently.

How to do lists in python?
posted to Ask by johnsmith1984

Hey John/josh. this is pretty easy to solve. You made a simple, but nasty mistake, which happened to me often aswell. instead of print("thislist"), you have to do print (thislist). Now it prints your list!

What is the language you recommend the most? Why do you recommend it??
posted to Ask by enigma_dev

@ArchieMaclean Can confirm, python is pretty useless. JS is great, tho

Student accidentally deleted code - any way to get prior version of program?
posted to Ask by kmcleod

@Vandesm14 Thats is myself removing my upvote. It is a psychological thing, might explain that later on discord.

Student accidentally deleted code - any way to get prior version of program?
posted to Ask by kmcleod

@Vandesm14 Thats is myself removing my upvote. It is a psychological thing, might explain that later on discord.

How do I add a background image to my website?
posted to Ask by RYANBEEBE

As I understand you want to have a fullsize background image. This can be done via

body, html {
  height: 100%;
}

.bg {
  /* The image used */
  background-image: url("img.jpg");

  /* Full height */
  height: 100%;

  /* Center and scale the image nicely */
  background-position: center;
  background-repeat: no-repeat;
  background-size: cover;
}
[UPDATE AS OF 4/15/19]: 📕Language Learning Club 🤓
posted to Announcements by katyadee

Here is another extra: factorial examples using even more languages!
In PHP:

<?php 
// PHP code to get the factorial of a number 
function Factorial($number){ 
if($number <= 1){ 
return 1; 
} 
else{ 
return $number * Factorial($number - 1); 
} 
} 

// Driver Code 
$number = 10; 
$fact = Factorial($number); 
echo "Factorial = $fact"; 
?> 

In forth:

: fac recursive
dup 1 > IF
dup 1 - fac *
else
drop 1
endif ;

: lp
swap 1 + swap
do
i . i ." ! = " i fac . cr
loop ;

16 0 lp

In LISP:

(defun factorial (n)
(if (= n 0)
1
(* n (factorial (- n 1))) ) )

(loop for i from 0 to 16
do (format t "~D! = ~D~%" i (factorial i)) )

The same thing in BrainF (yeah, that is complicated...)

+++++++++++++++++++++++++++++++++			
>++++++++++++++++++++++++++++++
+++++++++++++++++++++++++++++++				
>++++++++++						
>+++++++						
>							
>+							
<<							
[							
>++++++++++++++++++++++++++++++++++++++++++++++++.	
------------------------------------------------	
<<<<.-.>.<.+						

>>>>>							
>							
>++++++++++						
<<							
[->+>-[>+>>]>[+[-<+>]>+>>]<<<<<<]			
>[<+>-]							
>[-]							

>>							
>++++++++++						
<							
[->-[>+>>]>[+[-<+>]>+>>]<<<<<]		
>[-]							
>>[++++++++++++++++++++++++++++++++++++++++++++++++.[-]]
<[++++++++++++++++++++++++++++++++++++++++++++++++.[-]] 
<<<++++++++++++++++++++++++++++++++++++++++++++++++.[-]	

<<<<<<.							
>>+							
							
>[>>+<<-]						
>>							
[
<<<[>+>+<<-]						
>>[<<+>>-]						
>-
]
<<<<-							
]

In F#:

let factorial (num:int) =
seq { for n in [1..num] -> n }
|> Seq.reduce (fun acc n -> acc * n)

Now in Ocaml

let rec factorial n =
if n <= 1 then
1
else
factorial (n-1) * n;;

let () =
for n = 0 to 16 do
Printf.printf "%d! = %d\n" n (factorial n)
done;

I hope you enjoyed these extra languages which might be interesting. [Warning: Upvote begging ahead!] Upvote this damn it, i spent an hour using brainf.

Let's talk about π.
posted to Tutorials by LizFoster

Great work Liz! Very, very interesting post about a very, very interesting number! I just gave you the conzent creator role, which marks creators who upload high quality content! Congratz

Failed to connect, retrying
posted to Ask by Leeyongil

Hey everyone, we're experiencing some infrastructure difficulties. Specifically around loading repls. You might still be able to load your repl.

Earlier this morning we had a huge surge in traffic that caused a cascade of issues we're trying to debug. We're unsure if the traffic surge is legit or caused by a DDoS. Please bear with us.

Thanks,