International Olympiad in Informatics (IOI) 2016, Kazan
We will be at the IOI conferences in Russia to present eSeeCode to the international community. Make sure to read the English article!
Similar Posts
VIII Jornades Programa, Cornellà
Byjvilella8th edition of the Jornada Programa at Citilab Cornellà with this poster!
Merry Everything from eSeeCode
ByjvilellaWe are getting close to the end of the year and we want to wish you happy holidays! To do so we have created this cute gif, and we will explain how we did it step by step. Koch Snowflake Open it in eSeeCode! =0){divElement.className=divElement.className.replace(‘glyphicon-minus’,’glyphicon-plus’);}else{divElement.className=divElement.className.replace(‘glyphicon-plus’,’glyphicon-minus’);}”> Step 1: Build Koch fractal As it can be read…
Pi Day 2016
ByjvilellaFinding Pi Every year during the 14th of March we celebrate Pi day. This is due to the fact that Pi is close to 3.14, but what is it’s true value and how can we compute it? In this article you’ll learn two ways of approximating this number! Pi is an irrational number used…
Taller eSeeCode i PyTurtle
ByjvilellaBenvinguts al taller de El pensament computacional en la matemàtica educativa! Fent un quadrat Clicant en aquest enllaç podreu accedir a la plataforma de programació eSeeCode . =0){divElement.className=divElement.className.replace(‘glyphicon-minus’,’glyphicon-plus’);}else{divElement.className=divElement.className.replace(‘glyphicon-plus’,’glyphicon-minus’);}”> Utilitzant bucles Podem simplificar el codi anterior utilitzant un bucle. Els bucles poden ser amb comptadors (per repetir un nombre de cops) o amb condicions (mentre es…
Greatest Common Divisor
ByjvilellaThe greatest common divisor between two numbers is defined as the largest value that can divide both numbers. To compute the greatest common divisor there are many algorithms. One of the fastest is over 2 millennium old. It’s called Euclid’s algorithm. Here you will be able to learn more about this algorithm and how to…