Roman Fedorenkov SeqviriouM

SeqviriouM / form

Created April 16, 2014 14:31

Jquery change action

	<body>

	<div class="middle">

	<form class="form">
	<div class="form-group">
	<div style="text-align: center">
	<b><label>Заполните следующие поля</label></b>
	</div>
	</div>

SeqviriouM / sh-course

Created April 4, 2015 14:18

Get threads and paths from graph

	function pretty(input) {
	return JSON.stringify(input, null, '\t');
	}

	function pp(input) {
	console.log(pretty(input));
	}

	function output(input) {
	$('.output').append('<p>' + input + '</p>');

SeqviriouM / s-des.js

Last active October 23, 2015 11:44

S-DES

	var BitArray = require('node-bitarray');

	var text = BitArray.fromBinary('10110110').toJSON().reverse();
	var key = BitArray.fromBinary('1111010110').toJSON().reverse();
	var extendTransposition = [1, 4, 3, 4, 2, 1, 3, 2];
	var transposition = [3, 4, 2, 1];
	var s1 = [[0, 1, 2, 1], [2, 3, 0, 3], [2, 1, 2, 1], [3, 0, 3, 0]];
	var s2 = [[0, 2, 0 ,1], [0, 1, 3, 2], [3, 2, 3, 1], [0, 2, 3, 1]];

	var p_pryamoi = [3, 5, 2, 7, 4, 10, 1, 9, 8, 6]

SeqviriouM / division.js

Last active January 31, 2017 15:53

Division using only addition and subtraction

	// Remainder of the division (Остаток от деления)
	const b = (num1, num2) => {
	const convertValues = (num1, num2) => {
	let isNegative = false;

	if (num1 < 0 && num2 < 0) {
	num1 = -num1;
	num2 = -num2;
	} else if (num1 < 0) {
	num1 = -num1;

SeqviriouM / fibonacci.js

Created February 17, 2017 10:33

Fibonacci

	const fibonacci = (n) => {
	if (n <= 2) {
	return Number(!!n);
	} else {
	return fibonacci(n - 1) + fibonacci(n - 2);
	}
	}