Difference between revisions of "explain xkcd:Sandbox"
(Removed the really laggy pi digits.) |
|||
Line 1: | Line 1: | ||
− | + | 💣__NOINDEX__ | |
Make changes, try things out, or just have fun with the wiki here! Just leave everything above the line alone, please. | Make changes, try things out, or just have fun with the wiki here! Just leave everything above the line alone, please. | ||
[http://www.explainxkcd.com/wiki/index.php?title=explain_xkcd:Sandbox&action=edit&oldid=91667 clear sandbox] | [http://www.explainxkcd.com/wiki/index.php?title=explain_xkcd:Sandbox&action=edit&oldid=91667 clear sandbox] |
Revision as of 06:09, 14 April 2023
💣 Make changes, try things out, or just have fun with the wiki here! Just leave everything above the line alone, please. clear sandbox
dnhsbaprsqbaacxlemstzecxonglsnth
Natasha | |
---|---|
| |
Born | Unknown |
#include <cstdio> int a[3]={0,0,0}; void acase(int b){ if(b>=0)printf("case %d:",b); } void dcase(int d,int m=0){ printf("\t\t\t\t");m?printf(" "):0;acase(a[0]+d);acase(a[1]+d);acase(a[2]+d);m?printf("\n"):printf("printf(\"2$\");break;\n"); } int main() { dcase(9,1); dcase(0); dcase(10,1); dcase(1); dcase(2,1); dcase(3,1); dcase(6,1); dcase(7,1); dcase(11,1); dcase(12,1); dcase(17,1); dcase(18); dcase(14,1); dcase(4); dcase(15,1); dcase(5); dcase(8); dcase(13); dcase(19); dcase(16,1); dcase(20); return 0; }
Pau=4.7123889803847
n = 0 for i in range((2 ** 13)): if (i % 4 == 0 or i < 2 ** 7): n += 1 print(n)