This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include "time.h" | |
| #include <search.h> | |
| #include <unistd.h> | |
| #include <math.h> | |
| #include <pthread.h> | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #define THREADS_COUNT 2 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include "time.h" | |
| #include <search.h> | |
| #include <unistd.h> | |
| #include <math.h> | |
| #include <pthread.h> | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #define THREADS_COUNT 8 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include "time.h" | |
| #include <search.h> | |
| #include <unistd.h> | |
| #include <math.h> | |
| #include <pthread.h> | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #define TIMESTAMP_DELTA 0.05 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include "time.h" | |
| #include <bits/time.h> | |
| #include <search.h> | |
| #include <unistd.h> | |
| #include <math.h> | |
| #include <pthread.h> | |
| #include <stdio.h> | |
| #include <stdlib.h> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package main | |
| import "fmt" | |
| func main() { | |
| ch1 := make(chan int) | |
| ch2 := make(chan int) | |
| go func() { | |
| ch1 <- 1 | |
| ch1 <- 2 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package main | |
| type Worker struct { | |
| chann <-chan string | |
| done func() | |
| counter *int | |
| } | |
| func NewWorker(chann <-chan string, done func(), counter *int) Worker { | |
| return Worker{ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| ## ================ Задача ================ | |
| Рассказать про битовые операции | |
| * xor | |
| * & | |
| * | | |
| ## ================ Задача ================ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Описание проекта | |
| Социальная сеть, основанная на телеграмм. Данная социальная сеть расчитана на то, что ей будут пользоваться программисты. | |
| Функциональность | |
| * Авторизация | |
| * Регистрация | |
| * Поиск глобальный (среди чатов, контактов и новых людей) | |
| * Поиск сообщения в диалоге | |
| * Открыть профиль |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 1) Привет, меня зовут Максим, я разаботчик из Яндекса и мы с Володей приглашаем тебя на курс по алгоритмам и структурам данных, который поможет подготовиться к собеседовании в топовые IT компании. | |
| 2) Если алгоритмические секции вызывают у тебя не уверенность, страх, или ты не знаешь | |
| что отвечать интервьюеру когда он например просит проверить наличие циклов в графе, найти | |
| кратчайший путь между вершинами или просит рассказать зачем нужна очередб на 2 стеках. | |
| То курс будет для тебя очень полезен. | |
| 4) На лекциях мы затронем такие темы как |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import numpy as np | |
| n = int(input()) | |
| matrix1 = np.loadtxt("/home/am/dev/cpp/playground/bench/1000_1.txt") | |
| matrix2 = np.loadtxt("/home/am/dev/cpp/playground/bench/1000_2.txt") | |
| matrix3 = np.loadtxt("/home/am/dev/cpp/playground/res.txt") | |
| result = matrix1 @ matrix2 |