belushkin

Keybase proof

I hereby claim:

• I am belushkin on github.
• I am belushkin (https://keybase.io/belushkin) on keybase.
• I have a public key ASCX8mu6rYqLQzrLTqwVlEx8UTabj34Eh05sL-ZIjfhFLwo

To claim this, I am signing this object:

belushkin

import tempfile
from pytube import YouTube
from pytube import helpers
from pydub import AudioSegment
from pydub.utils import make_chunks
from pydub.silence import split_on_silence
import textract 
import math
import scipy.io.wavfile as wav

belushkin

import java.util.Arrays;
import java.util.Scanner;

public class Solution {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int p = Integer.parseInt(sc.nextLine());
        for (int i = 0; i < p; i++) {

belushkin

import java.util.Scanner;

public class Solution {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.nextLine());
        for (int i = 0; i < n; i++) {
            String s   = sc.nextLine();
            String[] result = s.split(" ");

belushkin

import java.util.*;
 
public class cf {
 
    public static void main(String[] args) {
        // Use the Scanner class
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.nextLine());
         for (int i = 0; i < n; i++) {
             String s   = sc.nextLine();

belushkin

import java.util.*;
 
public class cf {
 
    public static void main(String[] args) {
        // Use the Scanner class
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.nextLine());
         for (int i = 0; i < n; i++) {
             String s   = sc.nextLine();

belushkin

#include <iostream>
#include <bits/stdc++.h>

using namespace std;

void MaxHeapify(int a[], int heap_size, int x) {
  int l = 2*x + 1;
  int r = 2*x + 2;

  int largest = x;

belushkin

#include <iostream>
#include <bits/stdc++.h>

int a[] = {9,3,1,4,5,7,7,2,2};

void merge(int a[], int left, int middle, int right) {
  int n1 = middle-left+1;
  int n2 = right-midlle;
  int L1[n1];
  int R2[n2];

belushkin

#include <iostream>
#include <bits/stdc++.h>

int a[] = {9,3,1,4,5,7,7,2,2};

void counting_sort(int a[], int n) {
  int radix = *std::max_element(a, a+n);
  int c[radix+1] = {};
  int b[n] = {};

belushkin

#include <iostream>
#include <bits/stdc++.h>

int a[] = {9,3,1,4,5,7,7,2,2};

void counting_sort(int a[], int n) {
  int radix = *std::max_element(a, a + n);

  int c[radix+1] = {};
  int b[n] = {};