This file contains hidden or 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
defmodule Primality do | |
# O jeito "ingênuo" de checar por primalidade é você simplesmente verificar | |
# se o número tem divisores. Ou seja, você pega todos os números menores | |
# que o seu número-alvo (começando em 2, pois 1 divide todos os números) | |
# e verifica se eles dividem o número (ou seja, se o resto da divisão - | |
# função `rem/1` - é igual a 0). | |
# | |
# Também precisamos de um caso especial para 1, que não tem divisores mas não | |
# é primo. | |
def check_naive(1), do: false |
This file contains hidden or 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
# potigol.github.io | |
# https://twitter.com/LucasTeles42/status/1514226905809100802 | |
buracos(entrada, saída: Lista[Caractere]): Texto = | |
se entrada.tamanho < 2 então | |
saída.inverta.junte("") | |
senãose entrada[2] - entrada[1] > 1 então | |
c = (entrada[1] + 1).caractere | |
buracos(c :: entrada.cauda, c :: saída) | |
senão |
This file contains hidden or 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
mapa = Matriz.mutavel(12,12," ") | |
PAREDE = "▓" | |
JOGADOR = "♞" | |
var x := 3 | |
var y := 11 | |
montar_mapa() | |
para i de 1 até 12 faça | |
mapa[i][1] := PAREDE | |
mapa[i][12] := PAREDE |
This file contains hidden or 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
# -*- coding: utf-8 -*- | |
''' | |
Autor: Luiz Felipe na Lista Python Brasil 31-10-2015 | |
A série de Fibonacci é formada pela seqüência 1,1,2,3,5,8,13,21,34,55,... | |
Faça um programa capaz de gerar a série até o n−ésimo termo. | |
''' | |
#Fn = F(n-1) + F(n-2) | |
People
![]() :bowtie: |
😄 :smile: |
😆 :laughing: |
---|---|---|
😊 :blush: |
😃 :smiley: |
:relaxed: |
😏 :smirk: |
😍 :heart_eyes: |
😘 :kissing_heart: |
😚 :kissing_closed_eyes: |
😳 :flushed: |
😌 :relieved: |
😆 :satisfied: |
😁 :grin: |
😉 :wink: |
😜 :stuck_out_tongue_winking_eye: |
😝 :stuck_out_tongue_closed_eyes: |
😀 :grinning: |
😗 :kissing: |
😙 :kissing_smiling_eyes: |
😛 :stuck_out_tongue: |
This file contains hidden or 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 akka.stm._ | |
import scala.collection.immutable.ListMap | |
case class LRUCache[A, B](private val MAX_ENTRIES: Int) | |
{ | |
protected val cache = Ref(ListMap.empty[A, B]) | |
def getOrElse(key: A)(fn: => B): B = { | |
get(key).getOrElse { | |
val result = fn |
This file contains hidden or 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
# Algorithm W (Damas-Hindley-Milner) in LiveScript. | |
# By Paul Miller (paulmillr.com), Public domain. | |
# | |
# Based on Robert Smallshire's [Python code](http://bit.ly/bbVmmX). | |
# Which is based on Andrew's [Scala code](http://bit.ly/aztXwD). | |
# Which is based on Nikita Borisov's [Perl code](http://bit.ly/myq3uA). | |
# Which is based on Luca Cardelli's [Modula-2 code](http://bit.ly/Hjpvb). | |
# Something like that. | |
prelude = require './prelude' |
NewerOlder