escalation666 Posted February 3, 2008 Report Share Posted February 3, 2008 Si care este premiul acestui "Mini Concurs"? Quote Link to comment Share on other sites More sharing options...
phreak Posted February 3, 2008 Report Share Posted February 3, 2008 Si care este premiul acestui "Mini Concurs"?avand in vedere ca are sfarsit cand s-or plictisi userii sa mai posteze nu cred ca are Quote Link to comment Share on other sites More sharing options...
ÐÒ& Posted February 3, 2008 Author Report Share Posted February 3, 2008 premiul e apa de ploaie si vant cu namol. Quote Link to comment Share on other sites More sharing options...
kw3rln Posted February 3, 2008 Report Share Posted February 3, 2008 Si care este premiul acestui "Mini Concurs"?pita cu oloi si cu miere Quote Link to comment Share on other sites More sharing options...
moubik Posted February 4, 2008 Report Share Posted February 4, 2008 intrebarepoti sa faci scanarea unui host (gen nmap) si sa ai ip-ul si mac-ul ascuns in tot acest timp ?si sa si primesti raspunsurile, ca de asta il scanezi Quote Link to comment Share on other sites More sharing options...
kw3rln Posted February 4, 2008 Report Share Posted February 4, 2008 intrebarepoti sa faci scanarea unui host (gen nmap) si sa ai ip-ul si mac-ul ascuns in tot acest timp ?si sa si primesti raspunsurile, ca de asta il scanezi la nmap are optiunea -Dexemplu: nmap -n -D172.27.0.4,89.35.2.1,172.27.1.1,6.6.7.5 172.27.0.4din cate stiu folosesti ca momeala anumite ipuriHostul 172.27.0.4 va vedea 4 ipuri si nu va sti sati zica care ii cel realmetoda asta nu o poti folosi la tcp scanning .. dar ii o metoda sa te ascunzimai este o metoda tot la nmapnmap -P0 -sI 1.2.3.4:1111 172.27.0.4fa folosi ipul 1.2.3.5 ca o zombie ca sa scaneze hostua doua metoda e mult mai buna si interesantaIntrebare: cum faci sa fi sigur ca nimeni nu-ti fura scriptul PHP daca iti moare mod_php? Seologs le-o murit mod_php parca si se puteau vedea scripturile in plain text. Quote Link to comment Share on other sites More sharing options...
moubik Posted February 4, 2008 Report Share Posted February 4, 2008 dap, la a doua metoda ma gandeam eu AXE something! Quote Link to comment Share on other sites More sharing options...
amprenta Posted February 5, 2008 Report Share Posted February 5, 2008 codu php important sa stea in afara web root -uluifolosirea lui mod_security cu reguli care sa detecteze taguri gen <?php , sau folosirea unor cuvinte cuvinte cheie gen /* Aici_Incepe_codu *\ care daca is detectate in output sa fie blocat response-ul catre client .si-o intrebare hm .. de ce poate strlen() sa esueze in a-mi da numarul corect de caractere in urmatoarea situatie ?$buf= " Quote Link to comment Share on other sites More sharing options...
&#208;&#210;& Posted February 5, 2008 Author Report Share Posted February 5, 2008 contorizeaza dubludiactricele sunt 2 octeti defaptasa e? Quote Link to comment Share on other sites More sharing options...
amprenta Posted February 5, 2008 Report Share Posted February 5, 2008 da este vorba de multibyte characters , pentru situatii de genu se pot folosi functii specifice pentru lucrul cu multibyte strings gen mb_strlen ,mb_strstr ..etcL.E pune intrebare Quote Link to comment Share on other sites More sharing options...
&#208;&#210;& Posted February 5, 2008 Author Report Share Posted February 5, 2008 pot propune alta intrebare?Avem n perechi de genu patrat in care este inclus un cercpt n=2.un patrat in care este inclus un cerc in care este inclus un patrat in care este inclus un cerc.pt latura si n unui patrat citit faceti un program care sa calculeze raza si latura de la fiecare astfel de perechept n=2,l=4;l1 = 4r1 = 2.l2 = (2 * 2^(1/2))/2.r2 = (2*2^(1/2))/4. Quote Link to comment Share on other sites More sharing options...
tw8 Posted February 8, 2008 Report Share Posted February 8, 2008 Rezolvare:#include<iostream.h>#include<conio.h>#define sqr 1.4142135623730951;main() { double n, l, aux; int i; cin>>n>>l; aux = l / 2; cout<<"l1 = "<<l<<endl<<"r1 = "<<aux<<endl; for(i=2;i<=n;i++) { l = aux / sqr; aux = l / 2; cout<<"l"<<i<<" = "<<l<<endl<<"r"<<i<<" = "<<aux<<endl; } getch(); }Intrebarea mea (foarte simplu ): Inmultim o variabila care ocupa maxim 5 biti cu una care ocupa maxim 7 biti.Cati biti poate avea rezultatul (valoarea maxima) ? Quote Link to comment Share on other sites More sharing options...
moubik Posted February 8, 2008 Report Share Posted February 8, 2008 12 biti maxim.poti sa faci inmultirea direct intre 11111 si 1111111 = 111101100001cum poti sa te aperi de atacuri DOS/DDOS ?ma refer bineinteles la servere. Quote Link to comment Share on other sites More sharing options...
tw8 Posted February 8, 2008 Report Share Posted February 8, 2008 cum poti sa te aperi de atacuri DOS/DDOS ?ma refer bineinteles la servere.Se poate folosi metoda SYN Cookies, se poate folosi un router/switch pentru limitarea traficului + un firewall bun (nu prea ajuta la DDOS).Daca am raspuns bine, astept confirmarea ca sa vin cu intrebarea . Quote Link to comment Share on other sites More sharing options...
moubik Posted February 8, 2008 Report Share Posted February 8, 2008 Accept raspunsul. Quote Link to comment Share on other sites More sharing options...
tw8 Posted February 9, 2008 Report Share Posted February 9, 2008 Ok, hai sa vedem ceva legat de C++ acum .Am un vector de tip intreg de 50 de elemente. Cum initializez toate valorile cu 0 fara sa parcurg vectorul (fara structuri repetitive sau goto) ?Haideti ca e simplu . Quote Link to comment Share on other sites More sharing options...
phreak Posted February 9, 2008 Report Share Posted February 9, 2008 declari vectorul ca variabila globala... pune tu o intrebare eu n-am idee Quote Link to comment Share on other sites More sharing options...
amprenta Posted February 9, 2008 Report Share Posted February 9, 2008 sau daca nu-l vrei globala int vector[50]={0}; restul elementelor vor fi initializate automat cu 0 Quote Link to comment Share on other sites More sharing options...
phreak Posted February 9, 2008 Report Share Posted February 9, 2008 uite ca pun eu o mica problema :O persoana trebuie sa coboare o scara cu n trepte numerotate de la 1 la n.Stiind ca la fiecare pas persoana poate sa coboare 1 sau 2 scari determinati in cate moduri poate cobori scara.ex : n = 4 se va afisa 5modul 1 : 1,1,1,1modul 2 : 1,1,2modul 3 : 1,2,1modul 4 : 2,1,1modul 5 : 2,2se cere rezolvarea cea mai simpla Quote Link to comment Share on other sites More sharing options...
&#208;&#210;& Posted February 9, 2008 Author Report Share Posted February 9, 2008 mai intai si mai intai faci un backtracking..si ma mai gandesc...la ceva mai simpluf(n) = f(n-1) + f(n-2)ca pt 1 = 1pt 2=23 = 3pot 4=5 asa e?pot verifica cu un backtracking daca e Quote Link to comment Share on other sites More sharing options...
moubik Posted February 9, 2008 Report Share Posted February 9, 2008 phreak se face cu programare dinamica (nu confundati cu alocare dinamica).se creaza un vector in care se salveaza in cate moduri s-a coborat pana la pozitia i si de fiecare daca se folosesc valorile intermediare.se poate intradevar si cu backtracking. daca accepti raspunsul (rezolvarea e mai elaborata si nu cred ca astepti sa-ti faca cineva problema asta), poate sa puna oricine intrebare, in afara de tine p.s. am avut in clasa a 9-a o problema asemanatoare la un concurs nationalbineinteles putin mai complexa (era un pot si unele trepte erau rupte) Quote Link to comment Share on other sites More sharing options...
Guest Kenpachi Posted February 9, 2008 Report Share Posted February 9, 2008 nici daca urlai "I am a geeeeeeek" nu se prindea lumea ca esti cum s'a prins dupa ce ai scris randurile de mai sus. Quote Link to comment Share on other sites More sharing options...
&#208;&#210;& Posted February 9, 2008 Author Report Share Posted February 9, 2008 nu e solutia cea pe care am scris o? Quote Link to comment Share on other sites More sharing options...
phreak Posted February 9, 2008 Report Share Posted February 9, 2008 solutia e de clasa a 5-a . nu-i nimic dinamic , nu-i backtracking mai ganditi-va putin Quote Link to comment Share on other sites More sharing options...
&#208;&#210;& Posted February 9, 2008 Author Report Share Posted February 9, 2008 n am scris nici un backtracking si nici dinamic acolo mai uita te Quote Link to comment Share on other sites More sharing options...
