This file contains 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
#!/bin/bash | |
set -e | |
PUBLIC_KEY=~/.ssh/id_rsa.pub | |
SIZE=Standard_NC24ads_A100_v4 | |
read -p 'VM Name: ' VM_NAME | |
if [ -z "$VM_NAME" ]; then | |
echo "VM name is required" |
This file contains 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
const fetch = require('node-fetch'); | |
const fs = require('fs'); | |
const BASE_URL = 'http://localhost:8080'; | |
const SERVICES = ['api', 'api/dt/v1']; | |
function JSONstringifyOrder(obj, space) { | |
var allKeys = []; | |
JSON.stringify(obj, function (key, value) { | |
allKeys.push(key); |
This file contains 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
const fetch = require('node-fetch'); | |
const fs = require('fs'); | |
const BASE_URL = 'http://localhost:8080'; | |
const SERVICES = ['api', 'api/dt/v1']; | |
function JSONstringifyOrder(obj, space) { | |
var allKeys = []; | |
JSON.stringify(obj, function (key, value) { | |
allKeys.push(key); |
This file contains 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
""" | |
Дан неориентированный невзвешенный граф. | |
Необходимо определить, является ли он деревом. | |
Входные данные | |
В первой строке входного файла содержится одно натуральное число 𝑁 (𝑁 ≤ 100) - количество вершин в графе. | |
Далее в 𝑁 строках по 𝑁 чисел - матрица смежности графа: в 𝑖-ой строке на 𝑗-ом месте стоит 1, если вершины 𝑖 и 𝑗 соединены ребром, и 0, если ребра между ними нет. | |
На главной диагонали матрицы стоят нули. | |
Матрица симметрична относительно главной диагонали. |
This file contains 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
""" | |
Дан неориентированный невзвешенный граф. | |
Необходимо посчитать количество его компонент связности и вывести их. | |
Входные данные | |
Во входном файле записано два числа 𝑁 и 𝑀 (0 < 𝑁 ≤ 100000, 0 ≤ 𝑀 ≤ 100000). | |
В следующих 𝑀 строках записаны по два числа 𝑖 и 𝑗 (1 ≤ 𝑖, 𝑗 ≤ 𝑁), которые означают, что вершины 𝑖 и 𝑗 соединены ребром. | |
Выходные данные | |
В первой строчке выходного файла выведите количество компонент связности. |
This file contains 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
""" | |
Дан неориентированный невзвешенный граф. | |
Для него вам необходимо найти количество вершин, лежащих в одной компоненте связности с данной вершиной (считая эту вершину). | |
В первой строке входных данных содержатся два числа: N и S (1 ≤ N ≤ 100; 1 ≤ S ≤ N), где N – количество вершин графа, а S – заданная вершина. | |
В следующих N строках записано по N чисел – матрица смежности графа, в которой 0 означает отсутствие ребра между вершинами, а 1 – его наличие. | |
Гарантируется, что на главной диагонали матрицы всегда стоят нули. | |
Выведите одно целое число – искомое количество вершин. | |
""" |
This file contains 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
((dateBetween(now(), prop("Update Time"), "hours")) > 0) ? | |
( | |
( | |
(dateBetween(now(), prop("Update Time"), "hours")) < 24 | |
) ? ( | |
format((dateBetween(now(), prop("Update Time"), "hours"))) + ( | |
( | |
(dateBetween(now(), prop("Update Time"), "hours")) % 24 == 1 | |
) ? " hour": " hours") | |
): ( |
This file contains 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 frida | |
import os | |
import sys | |
import argparse | |
def parse_hook(filename): | |
print('[*] Parsing hook: ' + filename) | |
hook = open(filename, 'r') | |
script = session.create_script(hook.read()) | |
script.load() |
This file contains 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
export EMAIL="your_email@example.com" | |
export GITHUB_USER=$USER | |
export REPO_NAME="repo_name" | |
export REPO="git@${GITHUB_USER}:${REPO_NAME}.git" | |
export PRJ_DIR="~/prj" | |
mkdir -p $PRJ_DIR && cd $PRJ_DIR | |
apt install update | |
# Latex |
This file contains 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
from datetime import datetime | |
from decimal import Decimal, InvalidOperation | |
import typing as tp | |
try: | |
from pdfreader import SimplePDFViewer, PageDoesNotExist | |
except ImportError as e: | |
raise ImportError("Install pdfreader: pip install pdfreader") from e | |
try: |
NewerOlder