Created
November 8, 2018 10:07
-
-
Save itsN1X/d5e324af66a6cfc909c43310d46a64f0 to your computer and use it in GitHub Desktop.
Unlimited Credit in 49 lines | https://2by.me | (C) Day#8083 @itsN1X
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Released in the public domain for reference purpose only. | |
## @itsN1X bears indemnity agaisnt any interpreted unintentionial advice. | |
### This is a 'Libre' software. Use psuedo-responsibly. Luser bears qass, | |
>>> index=1;curr=1.0;stack=0.0; | |
>>> index+=1;stack+=curr;curr*=10;print(index);print(curr);print(stack); | |
2 | |
10.0 | |
1.0 | |
>>> index+=1;stack+=curr;curr*=10;print(index);print(curr);print(stack); | |
3 | |
100.0 | |
11.0 | |
>>> index+=1;stack+=curr;curr*=10;print(index);print(curr);print(stack); | |
4 | |
1000.0 | |
111.0 | |
>>> index+=1;stack+=curr;curr*=10;print(index);print(curr);print(stack); | |
5 | |
10000.0 | |
1111.0 | |
>>> index+=1;stack+=curr;curr*=10;print(index);print(curr);print(stack); | |
6 | |
100000.0 | |
11111.0 | |
>>> index+=1;stack+=curr;curr*=10;print(index);print(curr);print(stack); | |
7 | |
1000000.0 | |
111111.0 | |
>>> index+=1;stack+=curr;curr*=10;print(index);print(curr);print(stack); | |
8 | |
10000000.0 | |
1111111.0 | |
>>> index+=1;stack+=curr;curr*=10;print(index);print(curr);print(stack); | |
9 | |
100000000.0 | |
11111111.0 | |
>>> index+=1;stack+=curr;curr*=10;print(index);print(curr);print(stack); | |
10 | |
1000000000.0 | |
111111111.0 | |
>>> index+=1;stack+=curr;curr*=10;print(index);print(curr);print(stack); | |
11 | |
10000000000.0 | |
1111111111.0 | |
>>> index+=1;stack+=curr;curr*=10;print("now the current index is");print(index);print("curr pot is");print(curr);print("curr. stash is");print(stack); | |
now the current index is | |
12 | |
curr pot is | |
1e+11 | |
curr. stash is | |
11111111111.0 | |
>>> |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment