Skip to content

Instantly share code, notes, and snippets.

View evjeny's full-sized avatar

Evgeny Kanafin evjeny

View GitHub Profile
@evjeny
evjeny / file.rb
Created November 4, 2016 06:33
GistOne
puts 'Hello!'
package com.evjeny.mentalarithmetic;
import android.os.Environment;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.text.SimpleDateFormat;
import java.util.Date;
@evjeny
evjeny / Welcome.java
Created November 6, 2016 12:52
Welcome to my repo!
package com.evjeny.welcome;
public class Welcome {
public static void main(String[] args) {
System.out.println("Welcome to my repo!");
}
}
@evjeny
evjeny / h.bf
Created December 20, 2016 16:26
>+++++++++[<++++++++>-]<.
@evjeny
evjeny / Main.kt
Last active September 24, 2017 05:44
Description
//Created by evjeny
fun main(args: Array<String>) {
val time = Integer.parseInt(LocalDateTime.now().format(DateTimeFormatter.ofPattern("HH")))
print(if(time in 23..6) "Sleeps" else "Hallo")
}
@evjeny
evjeny / 1.6.4.java
Created September 24, 2017 06:11
Task 1.6: 4
import java.util.Scanner;
/**
* Created by evjeny
*/
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
double a = scanner.nextDouble(), b = scanner.nextDouble();
if(a!=0) {
@evjeny
evjeny / 1.7.10.java
Created September 30, 2017 16:12
Solution
import java.util.Scanner;
/**
* Created by evjeny
*/
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int a = scanner.nextInt();
a += (a%2==0?1:2);
def gip(msk,adrs):
ma = [int(i) for i in msk.split(".")]
da = [int(i) for i in adrs.split(".")]
res = ""
for j in range(4):
c = ma[j]&da[j]
if j!=3:
res += str(c) + "."
else:
res += str(c)
@evjeny
evjeny / Task1.py
Created October 10, 2017 03:22
Task1
def abs(k):
if k>=0:
return k
else:
return -k
def dist(ax,ay,bx,by):
if ax == bx:
return abs(ay-by)
elif ay==by:
@evjeny
evjeny / Task1
Created October 10, 2017 14:10
Task1.py
def abs(k):
if k>=0:
return k
else:
return -k
def dist(ax,ay,bx,by):
if ax == bx:
return abs(ay-by)
elif ay==by: