Snippets created by Natallie Baikevich
-
Project Euler #182
The RSA encryption is based on the following procedure: Generate two distinct primes p and q. Compute n=pq and phi=(p-1)(q-1). Find an integer e, 1
Like the snippet!Posted: 13 years ago by Natallie Baikevich
-
Transform expressions into Excel formulae
Sometimes it is extremely useful to check some calculations with Excel. The snippet shows how F# expressions can be transformed into Excel formulae. The data is exported together with the formulae, e.g. a, b and sum function as input sets A1's value to a, B1's to b and C1's formula to "=$A$1+$B$1"
17 people like this
Like the snippet!Posted: 12 years ago by Natallie Baikevich
-
Growing Tree Algorithm for Maze Generation
There are several maze creation algorithms (http://www.astrolog.org/labyrnth/algrithm.htm). The interesting point about Growing Tree one is that it turns into the others (for example, Recursive Backtracker and Prim's algo) when we choose the next step in different ways. Check it with tryfsharp.org.
4 people like this
Like the snippet!Posted: 7 years ago by Natallie Baikevich
-
A little esoteric os
Petrovich is more than just a programming language, it is a complete computer operating system and program development environment named after Ivan Petrovich Pavlov. Design Principles: * Provide an operating system and computer language that can learn and improve its performance in a natural manner. * Adapt to user feedback in an intelligent manner.
12 people like this
Like the snippet!Posted: 13 years ago by Natallie Baikevich
-
Simple exception analysis
A simple script to list the exceptions that can be thrown during the method invocation (both caught and uncaught).
5 people like this
Like the snippet!Posted: 12 years ago by Natallie Baikevich