Autor Tema: Elgoog (Leído 1081 veces)

RadicalEd · « **en:** Sábado 26 de Febrero de 2005, 23:53 »

Pfff Ahora como buscamos

elgooG
A y este es el algoritmo del PageRank de Google

Código: Text

&#60;?php
header(&#34;Content-Type: text/plain; charset=utf-8&#34;);
define('GOOGLE_MAGIC', 0xE6359A60);
function zeroFill(&#036;a, &#036;b) {
&#036;z = hexdec(80000000);
if (&#036;z & &#036;a) {
&#036;a = (&#036;a&#62;&#62;1);
&#036;a &= (~&#036;z);
&#036;a |= 0x40000000;
&#036;a = (&#036;a&#62;&#62;(&#036;b-1));
} else {
&#036;a = (&#036;a&#62;&#62;&#036;b);
}
return &#036;a;
}
function mix(&#036;a,&#036;b,&#036;c) {
&#036;a -= &#036;b; &#036;a -= &#036;c; &#036;a ^= (zeroFill(&#036;c,13));
&#036;b -= &#036;c; &#036;b -= &#036;a; &#036;b ^= (&#036;a&#60;&#60;8);
&#036;c -= &#036;a; &#036;c -= &#036;b; &#036;c ^= (zeroFill(&#036;b,13));
&#036;a -= &#036;b; &#036;a -= &#036;c; &#036;a ^= (zeroFill(&#036;c,12));
&#036;b -= &#036;c; &#036;b -= &#036;a; &#036;b ^= (&#036;a&#60;&#60;16);
&#036;c -= &#036;a; &#036;c -= &#036;b; &#036;c ^= (zeroFill(&#036;b,5));
&#036;a -= &#036;b; &#036;a -= &#036;c; &#036;a ^= (zeroFill(&#036;c,3));
&#036;b -= &#036;c; &#036;b -= &#036;a; &#036;b ^= (&#036;a&#60;&#60;10);
&#036;c -= &#036;a; &#036;c -= &#036;b; &#036;c ^= (zeroFill(&#036;b,15));
return array(&#036;a,&#036;b,&#036;c);
}
function GoogleCH(&#036;url, &#036;length=null, &#036;init=GOOGLE_MAGIC) {
if(is_null(&#036;length)) {
&#036;length = sizeof(&#036;url);
}
&#036;a = &#036;b = 0x9E3779B9;
&#036;c = &#036;init;
&#036;k = 0;
&#036;len = &#036;length;
while(&#036;len &#62;= 12) {
&#036;a += (&#036;url[&#036;k+0] +(&#036;url[&#036;k+1]&#60;&#60;8) +(&#036;url[&#036;k+2]&#60;&#60;16) +(&#036;url[&#036;k+3]&#60;&#60;24));
&#036;b += (&#036;url[&#036;k+4] +(&#036;url[&#036;k+5]&#60;&#60;8) +(&#036;url[&#036;k+6]&#60;&#60;16) +(&#036;url[&#036;k+7]&#60;&#60;24));
&#036;c += (&#036;url[&#036;k+8] +(&#036;url[&#036;k+9]&#60;&#60;8) +(&#036;url[&#036;k+10]&#60;&#60;16)+(&#036;url[&#036;k+11]&#60;&#60;24));
&#036;mix = mix(&#036;a,&#036;b,&#036;c);
&#036;a = &#036;mix[0]; &#036;b = &#036;mix[1]; &#036;c = &#036;mix[2];
&#036;k += 12;
&#036;len -= 12;
}
&#036;c += &#036;length;
switch(&#036;len) {
case 11: &#036;c+=(&#036;url[&#036;k+10]&#60;&#60;24);
case 10: &#036;c+=(&#036;url[&#036;k+9]&#60;&#60;16);
case 9 : &#036;c+=(&#036;url[&#036;k+8]&#60;&#60;8);
case 8 : &#036;b+=(&#036;url[&#036;k+7]&#60;&#60;24);
case 7 : &#036;b+=(&#036;url[&#036;k+6]&#60;&#60;16);
case 6 : &#036;b+=(&#036;url[&#036;k+5]&#60;&#60;8);
case 5 : &#036;b+=(&#036;url[&#036;k+4]);
case 4 : &#036;a+=(&#036;url[&#036;k+3]&#60;&#60;24);
case 3 : &#036;a+=(&#036;url[&#036;k+2]&#60;&#60;16);
case 2 : &#036;a+=(&#036;url[&#036;k+1]&#60;&#60;8);
case 1 : &#036;a+=(&#036;url[&#036;k+0]);
}
&#036;mix = mix(&#036;a,&#036;b,&#036;c);
return &#036;mix[2];
}
function strord(&#036;string) {
for(&#036;i=0;&#036;i
&#036;result[&#036;i] = ord(&#036;string{&#036;i});
}
return &#036;result;
}
function c32to8bit(&#036;arr32) {
for(&#036;i=0;&#036;i
for (&#036;bitOrder=&#036;i*4;&#036;bitOrder&#60;=&#036;i*4+3;&#036;bitOrder++) {
&#036;arr8[&#036;bitOrder]=&#036;arr32[&#036;i]&255;
&#036;arr32[&#036;i]=zeroFill(&#036;arr32[&#036;i], 8);
}
}
return &#036;arr8;
}
&#036;url =' info:'.&#036;_GET['url'];
print(url:&#092;t{&#036;_GET['url']}&#092;n);
&#036;ch = GoogleCH(strord(&#036;url));
printf(Checksum &#62;&#60;2.0.114:&#092;t6%u&#092;n&#34;,&#036;ch);
&#036;ch=sprintf(&#34;%u&#34;, &#036;ch);
&#036;ch = (((&#036;ch/7) &#60;&#60; 2) | (((int)fmod(&#036;ch,13))&7));
&#036;prbuf = array();
&#036;prbuf[0] = &#036;ch;
for(&#036;i = 1; &#036;i &#60; 20; &#036;i++) {
&#036;prbuf[&#036;i] = &#036;prbuf[&#036;i-1]-9;
}
&#036;ch = GoogleCH(c32to8bit(&#036;prbuf), 80);
printf(&#34;Checksum &#62;=2.0.114:&#092;t6%u&#092;n&#34;,&#036;ch);
?&#62;
 
 

SoloCodigo

Autor Tema: Elgoog (Leído 1081 veces)

RadicalEd

Elgoog