Skip to content

Instantly share code, notes, and snippets.

View Sarverott's full-sized avatar
πŸ’­
I may be slow to respond.

Sett Sarverott Sarverott

πŸ’­
I may be slow to respond.
View GitHub Profile
@Sarverott
Sarverott / #youtube-get-list-of-videos-from-playing-playlist-easy.js
Last active January 19, 2022 00:27
paste code into browser devtools js console (F12 in most of internet browsers, search for "CONSOLE") and press enter to get playlist videos, list of tracks should be printed below. 3 variants of code: EASY, EXTRA and SHORTEST
/* Sett Sarverott @ 2021 */
var d="YT-playlist.";
var pl="";
var z=window.location.href.split("?")[1].split("&");
for(var i in z)
if(
z[i].split("=")[0]=="list"
)
pl=z[i].split("=")[1];
d+=pl+".txt\n\n~~~~~~\n";
@Sarverott
Sarverott / #php-random-names-generator.php
Created November 15, 2021 02:43
PHP script to including for randomization of html ids and classes, css selectors, js variables or else. Usefull against automated man-in-the-browser activities like bruteforce attacks
<?php
/*
** ###### Names Of Odin v1.0.0 ###### (previously published as repository)
** by Sett Sarverott @ 2018
** MIT Licence
*/
class namesGenotype{
private $nameslength;
private $nameseed=[];
public $namesspace=array();
#include <iostream>
using namespace std;
template <typename customType> class MatrixCell{
public:
MatrixCell* NEXT=NULL;
customType* value=NULL;
MatrixCell(){
this->value=new customType;
#include <iostream>
using namespace std;
int main()
{
//for(int i=0;i<2550;i++)
for(int i=0;i<255;i++)
cout <<i<<" : "<< (char)i <<endl;
//cout <<(char)i;
return 0;
}
β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“
β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“
β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’
β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’
β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“
β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“
β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’
β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’
β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“
β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“β–’β–’β–’β–’β–“β–“β–“β–“
#include <iostream>
using namespace std;
void blankCard(char team, char sign){
//void blankCard(){
cout
<<(char)218
<<(char)196
<<(char)196
<<(char)191
<<"\n"
<?php
/*
prime numbers finder
Sett Sarverott 2018
*/
function prime_number($zakresowa=100){
$ret=[];
for($i=1;$i<$zakresowa;$i++){
$flag=true;
for($j=1;$j<count($ret);$j++){
/*
prime number finder
Sett Sarverott 2022
*/
function primeNumber(zakresowa=100, withFinderShift=false){
var ret=[];
var i=0;
while(zakresowa-(++i)){
var flag=true;
for(var j in ret)
/*
matrix rotation
Sett Sarverott @ 2019
*/
#include <iostream>
using namespace std;
int **transpos(int **tab){
int sizeX=sizeof(tab)/sizeof(tab[0]);
@Sarverott
Sarverott / asm-worm.a80.asm
Last active March 16, 2023 19:53
code in assembler for Intel 8080, that is self-replicatory virus example. Written for fun for 80's old school microprocessor unit. Tested on http://asm80.com/ and https://github.com/eliben/js-8080-sim emulators
;asmWorm - self-replication code in assembler for Intel 8080
;Sett Sarverott @ 2022
lxi h, 0000h ;start read
lxi d, 002fh ;stop read/start write
mvi c, 2fh ;length
mvi a, 00h ;index
replicator:
;copy this code to space after this code
mov b, m ;b=*read_pointer
xchg