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
import re | |
def match_statement(string, opening, closing): | |
""" | |
little function using regex to match a full parenthesis content | |
:string: [string] the string (starting after the first opening caracter) | |
:opening: [char] the opening char | |
:closing: [char] the closing char | |
:return: the full statement |
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
import requests | |
from bs4 import BeautifulSoup | |
URL = "" | |
def get_page_content(URL, HEADERS=None): | |
if HEADERS is None: | |
HEADERS = {"User-Agent": "Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:67.0) Gecko/20100101 Firefox/67.0"} |
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
[print([chr(_)if _ else'\n'][0],end='')for _ in[10400,10276,10468,10240,10276,10340,10244,10400,10340,10404,False,10424,10290,10447,10240,10368,10311,10240,10424,10327,10266,10368,10468,10486,10494,10495,10487,10486,10468,10436,10240,10240,10432,10468,10468,10484,10470,10468,10304,False,10248,10240,10248,10240,10249,10249,10241,10248,10241,10484,10495,10495,10495,10367,10303,10459,10459,10299,10303,10471,10427,10495,10495,10495,10495,10495,10495,10495,10436,False,10240,10240,10240,10240,10240,10240,10240,10240,10368,10494,10495,10495,10475,10485,10494,10495,10495,10495,10367,10295,10278,10260,10486,10486,10486,10486,10486,10294,10294,10294,10276,10304,False,10240,10240,10240,10240,32,10240,10240,10400,10494,10495,10495,10495,10495,10495,10303,10267,10369,10432,10444,10495,10495,10487,10486,10440,10303,10450,10450,10477,10477,10477,10477,10449,10450,10244,False,10240,10240,10240,32,32,10464,10318,10494,10495,10495,10495,10495,10411,10465,10341,10294,10303,10459,10267,10251,10291,10422,10486,10494,10460,10475,1 |
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
________=len;_____=int;___=print;_________=range;_='0736434346302246494335';____=chr;__=65;_______=1;__________=0 | |
for ______ in _________(__________,________(_),_______+_______):___(____(__+_____(_[______]+_[______+_______])),end='') |
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
#this is a self-testing palindrome, it only output itself if it's a palindrome || 4O2/moc.buhtig//:sptth :rohtua# | |
t=open(__file__).read()#open itself || tset ytidilav emordnilap#)t(tnirp:)))n(nel,0(egnar ni x rof)]x[t==]x[n((lla fi | |
n=''#init 'n'|| rotareneg emordnilap#]x[t=+n:)1-,)t(nel-,1-(egnar ni x rof | |
for x in range(-1,-len(t),-1):n+=t[x]#palindrome generator ||'n' tini#''=n | |
if all((n[x]==t[x])for x in range(0,len(n))):print(t)#palindrome validity test || flesti nepo#)(daer.)__elif__(nepo=t | |
#author: https://github.com/2O4 || emordnilap a s'ti fi flesti tuptuo ylno ti ,emordnilap gnitset-fles a si siht# |
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
p=lambda*t:print(t[0]) | |
p("6",p("5",p("1"),p("4",p("2"),p("3")))) |
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
# Developer: https://github.com/2O4 # | |
# Intro: output 'I'm a palindromic code' if the source code is palindromic else output it's new palindromic source code # | |
# Details: https://github.com/2O4/self-testing_palindromic_code_in_python # | |
t=open(__file__).read();n=''.join(t[-e]for e in range(1,len(t)+1));m="I'm a palindromic code";print(m)if t==n else print(t+n) # )n+t(tnirp esle n==t fi)m(tnirp;"edoc cimordnilap a m'I"=m;))1+)t(nel,1(egnar ni e rof]e-[t(nioj.''=n;)(daer.)__elif__(nepo=t | |
# nohtyp_ni_edoc_cimordnilap_gnitset-fles/4O2/moc.buhtig//:sptth :sliateD # | |
# edoc ecruos cimordnilap wen s'ti tuptuo esle cimordnilap si edoc ecruos eht fi 'edoc cimordnilap a m'I' tuptuo :ortnI # |
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
a = [*range(10)] | |
a[3:6] = [*range(10, 15)] | |
print(a) | |
*b, = range(10) | |
print(b) |
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
#include <iostream> | |
#/* | |
import random | |
"""#*/ | |
using namespace std; | |
int main() { | |
/*""" | |
def for_loop(): | |
start, end, step = 0, 10, 1 |
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
#= | |
print ((0and"I'm Ruby2!")or(None and"I'm Perl5!"or 1/2and"I'm Python3!"or"I'm Python2!"))# =#print("I'm Julia0.6!") |
OlderNewer