| conv = [] | |
| def dec2bin(num): | |
| (num/2 > 0 and (dec2bin(int(num/2)), conv.append(num%2))) | |
| dec2bin(int(input('Decimal: '))) | |
| print(''.join(map(str, conv))) |
| # Versão utilizando if/else | |
| if x == 10: | |
| fun_add(x) | |
| else: | |
| fun_del(x) | |
| # utilizando expressões booleanas apenas... | |
| (x == 10 and fun_add(x)) or (fun_del(x)) |
| # lista para guardar o processo de conversão | |
| conv = [] | |
| def dec2bin(num): | |
| (num / 2 > 0 and (dec2bin(int(num/2)), conv.append(num % 2))) | |
| def dec2bin_if(num): | |
| if num/2 > 0: |
| seq = [0,1] | |
| def fibseq(maxnum, item=1): | |
| (item <= maxnum and | |
| (seq.append(item), fibseq(maxnum, item + seq[-2]))) | |
| fibseq(input('Max. Element.: ')) | |
| print(seq) |
| ''' | |
| If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. | |
| The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000. | |
| https://projecteuler.net/problem=1 | |
| ''' | |
| # is a multiple of 5? | |
| # list(str(N))[-1] in ('0','5') => should return True if N is a multiple of 5. | |
| # is a multiple of 3? |
| ''' | |
| unpacking nested list | |
| ''' | |
| year = datetime.date.today().year | |
| month = datetime.date.today().month | |
| # My nested list | |
| cal = calendar.Calendar(6).monthdatescalendar(year, month) |
Alguém na lista Python-Brasil perguntou sobre como criar um webservice Restful com Python... eu achei interessante salvar as sugestões aqui para indicar, caso essa questão apareça em algum lugar.
A ideia é também atualizar esse arquivo com algum blogpost que contribua para a questão.
| SLACKVER=14.1 | |
| mkdir multilib | |
| cd multilib | |
| lftp -c "open http://taper.alienbase.nl/mirrors/people/alien/multilib/ ; mirror -c -e ${SLACKVER}" | |
| cd ${SLACKVER} | |
| upgradepkg --reinstall --install-new *.t?z | |
| upgradepkg --install-new slackware64-compat32/*-compat32/*.t?z |
| export PATH=$PATH:~/bin/:~/bin/node/bin/ | |
| alias dev='cd $HOME/Devel' | |
| alias ls='ls --color' | |
| alias ll='ls -l' | |
| alias ltr='ls -ltr' | |
| alias la='ls -a' | |
| alias tibia='cd $HOME/Games/Tibia;./Tibia' | |
| alias dwn='cd $HOME/Downloads' | |
| alias git='hub' |
| #!/usr/bin/python3 | |
| from math import sqrt | |
| def sieve(limit, limit_list=[]): | |
| ''' | |
| Sieve of Eratosthenes - The sieve of Eratosthenes is one of the most | |
| efficient ways to find all of the smaller primes (below 10 million or so). | |
| >>> sieve(30) | |
| [2, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29] |
