D7net Mini Sh3LL v1

 
OFF  |  cURL : OFF  |  WGET : ON  |  Perl : ON  |  Python : OFF
Directory (0755) :  /libx32/../share/snapd/../locale/ia/../../doc/info/../libroken18-heimdal/../usbmuxd/../liberror-perl/../grub2-common/../libjpeg8/../php7.4-mysql/../gnupg/../python3-apt/../netplan.io/../wget/../libcurl3-gnutls/../libthai-data/../python3-six/../screen/../maria/../libxaw7/../libmnl0/../netplan/../gdisk/../systemd-sysv/../grep/../udisks2/../libacl1/../libxmlb1/../libperl5.30/../automake/../libmpfr6/../apparmor/../dosfstools/../libsctp1/../libuv1/../sbsigntool/../autoconf/../vim/../binutils/../automake/../librtmp1/../python3-jsonpatch/../libxext6/../openssl/../lz4/../liblvm2cmd2.03/../dosfstools/../libattr1/../linux-headers-generic/../libsmbios-c2/../libnpth0/../sudo/../libpathplan4/../libsys-hostname-long-perl/../bc/examples/

 Home   ☍ Command   ☍ Upload File   ☍Info Server   ☍ Buat File   ☍ Mass deface   ☍ Jumping   ☍ Config   ☍ Symlink   ☍ About 

Current File : //libx32/../share/snapd/../locale/ia/../../doc/info/../libroken18-heimdal/../usbmuxd/../liberror-perl/../grub2-common/../libjpeg8/../php7.4-mysql/../gnupg/../python3-apt/../netplan.io/../wget/../libcurl3-gnutls/../libthai-data/../python3-six/../screen/../maria/../libxaw7/../libmnl0/../netplan/../gdisk/../systemd-sysv/../grep/../udisks2/../libacl1/../libxmlb1/../libperl5.30/../automake/../libmpfr6/../apparmor/../dosfstools/../libsctp1/../libuv1/../sbsigntool/../autoconf/../vim/../binutils/../automake/../librtmp1/../python3-jsonpatch/../libxext6/../openssl/../lz4/../liblvm2cmd2.03/../dosfstools/../libattr1/../linux-headers-generic/../libsmbios-c2/../libnpth0/../sudo/../libpathplan4/../libsys-hostname-long-perl/../bc/examples/primes.b
/* An example that finds all primes between 2 and limit. */

define primes (limit) {
    auto num, p, root, i

    prime[1] = 2;
    prime[2] = 3;
    num = 2;
    if (limit >= 2) print "prime 1 = 2\n"
    if (limit >= 3) print "prime 2 = 3\n";
    scale = 0;

    for ( p=5; p <= limit; p += 2)  {
	root = sqrt(p);
	isprime = 1;
	for ( i = 1;  i < num && prime[i] <= root; i++ ) {
	    if ( p % prime[i] == 0 ) {
		isprime = 0;
		break;
            }
	}
	if (isprime) {
	    num += 1;
	    prime [num] = p;
	    print "prime ", num, " = ", p, "\n"
	}
     }
}


print "\ntyping 'primes (10)' will print all primes less than 10.\n"

AnonSec - 2021 | Recode By D7net