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 <stdio.h> | |
#include <stdlib.h> | |
// Copyright (c) 2016, SYZYGY-DEV333 | |
// All rights reserved. | |
// Licensed under SPL 1.0 [splicense.pen.io] | |
int menu(); | |
void lista_processos(); | |
void mata_processo_nome(); |
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
Simple Permissive License 1.0 | |
[bit.ly/splicense] | |
Copyright (c) [year], [holder] | |
All rights reserved. | |
Redistribution and use in source or compiled forms, with or | |
without modification, are permitted provided that the following | |
conditions are met: |
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
-,+[ Read first character and start outer character reading loop | |
-[ Skip forward if character is 0 | |
>>++++[>++++++++<-] Set up divisor (32) for division loop | |
(MEMORY LAYOUT: dividend copy remainder divisor quotient zero zero) | |
<+<-[ Set up dividend (x minus 1) and enter division loop | |
>+>+>-[>>>] Increase copy and remainder / reduce divisor / Normal case: skip forward | |
<[[>+<-]>>+>] Special case: move remainder back to divisor and increase quotient | |
<<<<<- Decrement dividend | |
] End division loop | |
]>>>[-]+ End skip loop; zero former divisor and reuse space for a flag |
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
@echo | |
set "host=8.8.8.8" | |
:loop | |
ping -n 1 "%host%" | findstr /r /c:"[0-9] *ms" | |
if %errorlevel% == 0 ( | |
ipconfig /all | |
echo Success! | |
msg * Success! |
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
Number extend [ | |
nthRoot: n [ | |
|x0 m x1| | |
x0 := (self / n) asFloatD. | |
m := n - 1. | |
[true] whileTrue: [ | |
x1 := ((m * x0) + (self/(x0 raisedTo: m))) / n. | |
((x1 - x0) abs) < ((x0 * 1e-9) abs) | |
ifTrue: [ ^ x1 ]. | |
x0 := x1. |
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
Object subclass: Conversion [ | |
isOperator: c [ | |
(c isAlphaNumeric) ifFalse: [ ^true ]. | |
(c isAlphaNumeric) ifTrue: [ ^false ]. | |
] | |
getPriority: char [ | |
(char = $-) ifTrue: [ ^1 ]. | |
(char = $+) ifTrue: [ ^1 ]. | |
(char = $/) ifTrue: [ ^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 | |
import ( | |
"fmt" | |
"math" | |
"bytes" | |
"encoding/binary" | |
) | |
type testCase struct { |
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
(define (replace source target replacement) | |
(cond ((null? source)'()) | |
((equal? source target) replacement) | |
(else (let ((next (car source)) | |
(rest (cdr source))) | |
(cons (if (not (list? next)) | |
next | |
(replace next target replacement)) | |
(replace rest target replacement)))))) | |
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
(define (lambda-to-ski f) | |
(match f | |
[`(lambda (,a) (lambda (,b) ,c)) (lambda-to-ski `(lambda (,a) ,(lambda-to-ski `(lambda (,b) ,c))))] | |
[`(lambda (,a) (,exp1 ,exp2)) `((s ,(lambda-to-ski `(lambda (,a) ,exp1))) ,(lambda-to-ski `(lambda (,a) ,exp2)))] | |
[`(lambda (,a) ,a) 'i] | |
[`(lambda (,a) ,b) `(k ,(lambda-to-ski b))] | |
[`(,a ,b) `(,(lambda-to-ski a) ,(lambda-to-ski b))] | |
[_ f])) | |