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/../libxext6/../libxmlb1/../libxmuu1/../iptables/../gzip/../ed/../apache2-bin/../usbmuxd/../sos/../libsepol1/../overlayroot/../libapr1/../adduser/../libgusb2/../libacl1/../libmnl0/../libgomp1/../libsepol1/../python3-pkg-resources/../perl/../libalgorithm-diff-xs-perl/../glib-networking-services/../bind9-libs/../libc-dev-bin/../perl-base/../libfwupdplugin1/../mariadb-client-core-10.3/../libdbus-glib-1-2/../libaio1/../apache2-utils/../liburcu6/../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/../libxext6/../libxmlb1/../libxmuu1/../iptables/../gzip/../ed/../apache2-bin/../usbmuxd/../sos/../libsepol1/../overlayroot/../libapr1/../adduser/../libgusb2/../libacl1/../libmnl0/../libgomp1/../libsepol1/../python3-pkg-resources/../perl/../libalgorithm-diff-xs-perl/../glib-networking-services/../bind9-libs/../libc-dev-bin/../perl-base/../libfwupdplugin1/../mariadb-client-core-10.3/../libdbus-glib-1-2/../libaio1/../apache2-utils/../liburcu6/../bc/examples/twins.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;
    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 "\ntyping 'twins (10)' will print all twin primes less than 10.\n"

define twins (limit) {
   auto i;

   i = primes(limit+2);

   for (i=1; prime[i] > 0; i++) {
      if ((prime[i]+2) == prime[i+1]) \
	print "twins are ", prime[i], " and ", prime[i+1], "\n"
   }
}

AnonSec - 2021 | Recode By D7net