Nagy Salem muhammednagy

## test2.rb
p "Hello, World2"

## test.rb
p "Hello, World"

## gist:b31dea4f68e10236176506785ad29cfb
0xEebc586b728db1eDC1CF476fC1c40bD970c8294B

## gist:c5cfd9b600125afba0f3cdf1ff1c3616
0x5366fc68Ec44180E4a25b0Cd0E09A267D6Db3c71

## my eth test address
0x5366fc68Ec44180E4a25b0Cd0E09A267D6Db3c71

## add-new-crypto-to-peatio.md

      
              1 file
            
          
              8 forks
            
          
              4 comments
            
          
              4 stars
            
          
                muhammednagy
                / add-new-crypto-to-peatio.md
            
            
              Last active
              October 9, 2022 09:35
                — forked from brossi/add-new-crypto-to-peatio.md
            
              
                Adding A New Cryptocurrency to Peatio
              
          
    State: Draft

Based on the Peatio Stable branch

Coin Daemon

To the coin daemon's {coin}.conf file, include the -walletnotify command:
# Notify when receiving coins


## fasterdownloadwithwget.sh
#!/bin/bash
LINKS=$1
LOG=$2

wget --input-file=$LINKS --output-file $LOG

# usage
# chmod +x fasterdownloadwithwget.sh
# ./fasterdownloadwithwget.sh links_file log_file
# go and have fun !

## assignment.erl
-module(assignment).

-export([perimeter/1,area/1,enclose/1,bits/1]).

perimeter({square,R}) ->
    4 * R;
perimeter({triangle,A,B,C}) ->
    A + B + C;
perimeter({circle,R}) ->
    2 * math:pi() * R .

## bitcount.erl
-module(bitcount).

-export([bitcount/1]).

bitcount(V) ->
    bitcount(V, 0).
bitcount(0, C) ->
    C;
bitcount(V, C) ->
    bitcount( (V band (V - 1)), (C + 1)).

## recursion.erl
-module(recursion).

-export([fac/1,fib/1,cut/1]).

fac(0) ->
    1;
fac(N) when N>0 ->
    fac(N-1) * N;
fac(N) when N<0 ->
    io:fwrite("Postieve number please", []).
	#!/bin/bash
	LINKS=$1
	LOG=$2

	wget --input-file=$LINKS --output-file $LOG

	# usage
	# chmod +x fasterdownloadwithwget.sh
	# ./fasterdownloadwithwget.sh links_file log_file
	# go and have fun !
	-module(assignment).

	-export([perimeter/1,area/1,enclose/1,bits/1]).

	perimeter({square,R}) ->
	4 * R;
	perimeter({triangle,A,B,C}) ->
	A + B + C;
	perimeter({circle,R}) ->
	2 * math:pi() * R .
	-module(bitcount).

	-export([bitcount/1]).

	bitcount(V) ->
	bitcount(V, 0).
	bitcount(0, C) ->
	C;
	bitcount(V, C) ->
	bitcount( (V band (V - 1)), (C + 1)).
	-module(recursion).

	-export([fac/1,fib/1,cut/1]).

	fac(0) ->
	1;
	fac(N) when N>0 ->
	fac(N-1) * N;
	fac(N) when N<0 ->
	io:fwrite("Postieve number please", []).