tw8 Posted February 9, 2008 Report Share Posted February 9, 2008 Vrei sa si afiseze solutiile sau doar sa zica numarul lor ? Quote Link to comment Share on other sites More sharing options...
ÐÒ& Posted February 9, 2008 Author Report Share Posted February 9, 2008 doar numaru citetse atent! Quote Link to comment Share on other sites More sharing options...
phreak Posted February 9, 2008 Report Share Posted February 9, 2008 @tw8 : doar numarul lor.. eu am scris acolo si modurile ca sa se inteleaga problema cat mai bine ...@ Quote Link to comment Share on other sites More sharing options...
ÐÒ& Posted February 9, 2008 Author Report Share Posted February 9, 2008 am zis ca poti estima numarul in felul urmator:f(n) e functia care ne returneaza nrul de moduri pt n.f(1) = 1f(2) = 2f(3) = 3f(4) = 5la modul general.f(n) = f(n-1)+f(n-2).testam pe f(4) = 5 = 2+3 fa un program backtracking ca sa ti deaia seama,sau fa pe hartie pt valori mai mari. Quote Link to comment Share on other sites More sharing options...
phreak Posted February 9, 2008 Report Share Posted February 9, 2008 [quote= Quote Link to comment Share on other sites More sharing options...
ÐÒ& Posted February 9, 2008 Author Report Share Posted February 9, 2008 Asta am zis si inainte dar probabil nu era suficient de clar.Oricum trebuie sa pun o intrebare.Avem urmatorul sir:Input:21171180156Realizati un program care sa afiseze cuvantul simbolizat prin aceste coduri ascii Quote Link to comment Share on other sites More sharing options...
phreak Posted February 9, 2008 Report Share Posted February 9, 2008 esti sigur ca-i bun codul? 21171180156 prima litera ar fi 2, 21 sau 211 iar literele in upper case sunt de la 65 la 90 si in lower case de la 97 la 122 deci clar nu-i litera Quote Link to comment Share on other sites More sharing options...
ÐÒ& Posted February 9, 2008 Author Report Share Posted February 9, 2008 Citeste inversEram sigurRestrictii:Numai litere Quote Link to comment Share on other sites More sharing options...
phreak Posted February 9, 2008 Report Share Posted February 9, 2008 cuvantul este ALUP care citit invers este PULA !!! numa prostii ai in cappune tu alta intrebare ca eu iar n-am idee Quote Link to comment Share on other sites More sharing options...
ÐÒ& Posted February 9, 2008 Author Report Share Posted February 9, 2008 trebe sa faci si programel Quote Link to comment Share on other sites More sharing options...
phreak Posted February 10, 2008 Report Share Posted February 10, 2008 asa mi-au facut si ei mie la for-u ala amarat tre sa fii atent cand formulezi intrebarea intrebarea mea : Daca ai un director restricted poti intra in el folosind Microsoft Office Word? si daca da ... cum? Quote Link to comment Share on other sites More sharing options...
bebexar Posted February 22, 2008 Report Share Posted February 22, 2008 Intrebare : de ce e flama homosexual ?cine stie raspunsu castiga o mare cana cu apa , in cazu`l lu kw3rln una de tuica Quote Link to comment Share on other sites More sharing options...
kw3rln Posted February 22, 2008 Report Share Posted February 22, 2008 pt flama: http://www.homosexualitate.ro/neutru.html Quote Link to comment Share on other sites More sharing options...
bebexar Posted February 23, 2008 Report Share Posted February 23, 2008 hahahahaha Quote Link to comment Share on other sites More sharing options...
phreak Posted February 23, 2008 Report Share Posted February 23, 2008 asa mi-au facut si ei mie la for-u ala amarat tre sa fii atent cand formulezi intrebarea intrebarea mea : Daca ai un director restricted poti intra in el folosind Microsoft Office Word? si daca da ... cum?se pare ca v-ati oprit la o intrebare capcana... raspunsul era ca nu se poate intra in directoare restricted cu word decat in situatii de proasta securizare Quote Link to comment Share on other sites More sharing options...
ÐÒ& Posted February 23, 2008 Author Report Share Posted February 23, 2008 mai baga una noemala de data aceasta Quote Link to comment Share on other sites More sharing options...
phreak Posted March 10, 2008 Report Share Posted March 10, 2008 uite hai ca pun una.... Dati un algoritm destul de eficient pentru a genera toate numerele superprime de n cifre. Se citeste un numar n de la 1 la 9 .Un numaru superprim este un numar care are toate prefixele numere prime , exemplu : 719 ( 7 , 71, 719 sunt numere prime ) . Quote Link to comment Share on other sites More sharing options...
ÐÒ& Posted March 10, 2008 Author Report Share Posted March 10, 2008 o sa facem un ciur al lui Eratostene.verificam in resp sir pt fiecare numar in parte.adica mai intai pt 719 apoi pt el /10 etc .asta ma gandi acu. Quote Link to comment Share on other sites More sharing options...
drealecs Posted March 10, 2008 Report Share Posted March 10, 2008 se incepe intotdeauna de la numarul cu caractere mai mici si se adauga cifrecu 1 cifra exista: 2, 3, 5, 7pentru fiecare din acestea se gaseste numerele de 2 cifre care sunt primepentru 2: 23, 27;pentru 3: 31, 37;etc...si asa mai departe pana se ajunge la un numar de n cifreasta e cel mai eficient.Sa caut si eu o intrebare de pus?LE:Uite aici:Cine stie de ce cele 2 expresii sunt egale si in ce domeniu se foloseste asta?:1. (2^10 mod 113)^8 mod 1132. (2^8 mod 113)^10 mod 113Intrebarea se poate generaliza pentru:a. (r^a mod p)^b mod pb. (r^b mod p)^a mod punde- r este de obicei un numar mic- p este de obicei un numar prim.- a si b sunt numere aleatorii.- prin a^b se intelege "a la puterea b" Quote Link to comment Share on other sites More sharing options...
ÐÒ& Posted March 10, 2008 Author Report Share Posted March 10, 2008 (a*%c e (a%c * a%c)mod c.la general cum e?cvred ca asaE de a oi((r%c * r%c ... * r%c)%c)asta de b ori cam asa(((r%c * r%c ... * r%c)%c)mod c * (r%c * r%c ... * r%c)%c)mod c .. * (r%c * r%c ... * r%c)%c)mod c)mod c. = ((r%c * r%c ... * r%c)%c)*((r%c * r%c ... * r%c)%c)*((r%c * r%c ... * r%c)%c))mod c egal cu ((r%c * r%c ... * r%c)%c)%c.r^a mod c mod c = r%a mod c.si banuiesc ca si aia iese intr un fel asemanator.creca ieste r^(a* in ambele cazuri mi e greu sa verficNU MAI DA SUBIECTE SAVANT! Quote Link to comment Share on other sites More sharing options...
phreak Posted March 10, 2008 Report Share Posted March 10, 2008 se incepe intotdeauna de la numarul cu caractere mai mici si se adauga cifrecu 1 cifra exista: 2, 3, 5, 7pentru fiecare din acestea se gaseste numerele de 2 cifre care sunt primepentru 2: 23, 27;pentru 3: 31, 37;etc...si asa mai departe pana se ajunge la un numar de n cifreasta e cel mai eficient.Sa caut si eu o intrebare de pus?LE:Uite aici:Cine stie de ce cele 2 expresii sunt egale si in ce domeniu se foloseste asta?:1. (2^10 mod 113)^8 mod 1132. (2^8 mod 113)^10 mod 113Intrebarea se poate generaliza pentru:a. (r^a mod p)^b mod pb. (r^b mod p)^a mod punde- r este de obicei un numar mic- p este de obicei un numar prim.- a si b sunt numere aleatorii.- prin a^b se intelege "a la puterea b"usor de zis , vezi ca situatia se complica de la 3 cifre in sus . Generarea tuturor numerelor prime pana la 999999999 nu mi se pare prea eficient Quote Link to comment Share on other sites More sharing options...
ÐÒ& Posted March 10, 2008 Author Report Share Posted March 10, 2008 phgreak de solkutia mea ce zici Quote Link to comment Share on other sites More sharing options...
phreak Posted March 10, 2008 Report Share Posted March 10, 2008 la tine se referea a doua parte . Quote Link to comment Share on other sites More sharing options...
ÐÒ& Posted March 10, 2008 Author Report Share Posted March 10, 2008 care a ouia partea. Quote Link to comment Share on other sites More sharing options...
phreak Posted March 10, 2008 Report Share Posted March 10, 2008 de la 100 000 000 pan la 999 999 999 is cam multe numere prime. Quote Link to comment Share on other sites More sharing options...
