git clone [email protected]:YOUR-GITHUB-USERNAME/FORKED-REPO-NAME.git
cd forked-repo-name
git remote add forked git://github.com/ORIGINAL-USERNAME/FORKED-REPO-NAME.git
| package com.thecodevs.Converter | |
| import com.thecodevs.Math.* | |
| fun toDecimal(binaryNumber : String) : Int { | |
| var sum = 0 | |
| binaryNumber.reversed().forEachIndexed { | |
| k, v -> sum += v.toString().toInt() * pow(2, k) | |
| } | |
| return sum |
| /* | |
| Write a function to convert a string given by the user, to the respective morse code sequence. | |
| Morse code https://en.wikipedia.org/wiki/Morse_code | |
| Example: | |
| User Input: Hello | |
| Output: .... . .-.. .-.. --- | |
| */ |
| /* | |
| In mathematics, the digit sum of a given integer is the sum of all its digits (e.g. | |
| the digit sum of 84001 is calculated as 8+4+0+0+1 = 13). | |
| Write a function that will get an integer and will return the digit sum for that integer. | |
| */ | |
| fun main(args: Array<String>) { | |
| sumOfDigits("84001"); | |
| } |
| /* | |
| Floyd's triangle lists the natural numbers in a right triangle aligned to the left where | |
| - the first row is 1 | |
| - successive rows start towards the left with the next number followed by successive naturals listing one more number than the line above. | |
| The first few lines of a Floyd triangle (n=5) looks like this: | |
| 1 | |
| 2 3 |
git clone [email protected]:YOUR-GITHUB-USERNAME/FORKED-REPO-NAME.git
cd forked-repo-name
git remote add forked git://github.com/ORIGINAL-USERNAME/FORKED-REPO-NAME.git
| var fs = require('fs'); | |
| var request = require('sync-request'); | |
| var cheerio = require('cheerio'); | |
| var _ = require('lodash'); | |
| const months = ['gennaio', 'febbraio', 'marzo', 'aprile', 'maggio', 'giugno', 'luglio', 'agosto', 'settembre', 'ottobre', 'novembre', 'dicembre']; | |
| var dates = []; | |
| const url = 'http://m.paginainizio.com/onomasticimob.php?mese='; | |
| for (var m in months) { |
| function playPass(s, n) { | |
| let finalStr = ''; | |
| for (let i in s) { | |
| let letter = s[i]; | |
| if (isLetter(letter)) { | |
| finalStr += upperOrLower(nextLetter(letter, n), i); | |
| } else { | |
| if (isNumeric(letter)) { | |
| finalStr += "" + nineComplement(letter); | |
| } else { |