![]() |
![]() |
![]()
Post
#1
|
|
Grupa: Zarejestrowani Postów: 18 Pomógł: 0 Dołączył: 7.05.2009 Ostrzeżenie: (0%) ![]() ![]() |
czy ktos potrafi napisac taki skrypt ktory:
z tego ciagu liczb 561145727857261185764364672435345275601928895219735364672496847560 199684770908895219727816705121648561145191991180036468895219911800 65128 wypisze sekwencje liczb ktora najczescie j sie powtarza (w tym kodzie jest zaszyfrowany tekst w jezyku angielskim) takich ciagow liczb do zlamania mam wiecej.Musze znalesc ciag liczb w tym ciagu liczb, ktory najczesciej sie powtarza. bedzie to oznaczalo ze ten ciag liczb = literce e ponieważ e wystepuje najczesciej z wszystkich liter w jezyku angielskim. fajnie by bylo jakby ten skrypt mogl wypisac wszystkie ciagi liczb+ich liczbe powtorzen wystepujaca w tym kodzie a bylo by bosko jesli skrypt wyliczalby czestosc wystepowania ciagu liczb w procentach np: czestosc wystepowania jakiegosc ciagu(zawartego w ciagu liczbowym ) w procentach (1234)=12,7% troche to szalone jak dlamnie ,skrypt mosi porownywac kolejne pary liczb lub ciagi Ten post edytował Leon Zawodowiec 17.06.2009, 20:01:16 |
|
|
![]() |
![]()
Post
#2
|
|
Grupa: Zarejestrowani Postów: 1 575 Pomógł: 299 Dołączył: 26.03.2009 Ostrzeżenie: (20%) ![]() ![]() |
Może coś takiego Ci pomoże (IMG:http://forum.php.pl/style_emoticons/default/smile.gif)
I ładnie w tablicy masz pokazane która liczba ile razy się powtórzyła (IMG:http://forum.php.pl/style_emoticons/default/smile.gif) Kod Array
( [0] => 9 [1] => 21 [2] => 12 [3] => 6 [4] => 12 [5] => 16 [6] => 17 [7] => 14 [8] => 15 [9] => 15 [11] => 5 [12] => 2 [14] => 2 [16] => 2 [18] => 3 [19] => 7 [21] => 4 [24] => 2 [26] => 1 [27] => 3 [28] => 2 [34] => 1 [35] => 2 [36] => 3 [43] => 2 [45] => 3 [46] => 3 [47] => 2 [48] => 1 [49] => 1 [51] => 3 [52] => 4 [53] => 2 [56] => 4 [57] => 3 [60] => 2 [61] => 3 [64] => 5 [65] => 1 [67] => 3 [68] => 3 [70] => 2 [72] => 5 [73] => 1 [75] => 2 [76] => 1 [77] => 1 [78] => 2 [80] => 2 [81] => 1 [84] => 2 [85] => 3 [88] => 3 [89] => 3 [90] => 1 [91] => 3 [92] => 1 [95] => 3 [96] => 2 [97] => 2 [99] => 3 [114] => 2 [118] => 3 [121] => 1 [128] => 1 [145] => 2 [164] => 1 [167] => 1 [180] => 2 [185] => 1 [191] => 1 [192] => 1 [197] => 2 [199] => 3 [216] => 1 [219] => 3 [243] => 1 [249] => 1 [261] => 1 [275] => 1 [278] => 2 [288] => 1 [345] => 1 [353] => 2 [364] => 3 [435] => 1 [436] => 1 [451] => 1 [452] => 1 [457] => 1 [467] => 2 [468] => 1 [475] => 1 [477] => 1 [485] => 1 [496] => 1 [512] => 2 [519] => 1 [521] => 3 [527] => 1 [534] => 1 [536] => 1 [560] => 2 [561] => 2 [572] => 2 [576] => 1 [601] => 2 [611] => 3 [643] => 1 [646] => 3 [648] => 1 [651] => 1 [670] => 1 [672] => 2 [684] => 2 [688] => 1 [705] => 1 [709] => 1 [724] => 2 [726] => 1 [727] => 2 [735] => 1 [756] => 2 [764] => 1 [770] => 1 [781] => 1 [785] => 1 [800] => 2 [816] => 1 [847] => 2 [856] => 1 [857] => 2 [889] => 3 [895] => 3 [908] => 1 [911] => 2 [919] => 1 [928] => 1 [952] => 3 [968] => 2 [972] => 1 [973] => 1 [991] => 2 [996] => 1 [1145] => 2 [1180] => 2 [1185] => 1 [1216] => 1 [1451] => 1 [1457] => 1 ) Ten post edytował Wicepsik 17.06.2009, 20:36:26 |
|
|
![]() ![]() |
![]() |
Aktualny czas: 13.10.2025 - 15:33 |