Administrator Krusher Posted March 25, 2018 Administrator Share Posted March 25, 2018 Acest algoritm face parte din unul dintre algoritmii elementari ce fiecare elev de liceu ar trebui sa-l stie. Acesta verifica daca un numar este prim sau nu, dupa un principiu foarte simplu. Vom parcurge toate numerele de la 2 la (numar / 2 – pentru optimizare) si vom verifica daca acesta se imparte exact la numarul nostru. Putem optimiza algoritmul si mai mult si sa parcurgem numerele pana la radical din numarul respectiv – pentru ca exista o teorema in matematica care ne ajuta. Definitia unui numar prim: Un numar este prim daca acesta se imparte doar la 1 si la el insusi. Exemplu: 13.Observatie: Doar numerele naturale sunt prime, deoarece cele intregi se impart la -1. This is the hidden content, please Sign In or Sign Up Gigel1337 and moldoo 1 1 - Link to comment Share on other sites More sharing options...
zergitHD Posted March 26, 2018 Share Posted March 26, 2018 Frumos, elegant, cat de cat. :D SOCIOPAT <3 http://versurifrate.dx.am/index.php Link to comment Share on other sites More sharing options...
Young Crooi Posted March 26, 2018 Share Posted March 26, 2018 Bun tutorialul <embed src="http://laradio.ml/player1"width="280" height="480"></embed /> Link to comment Share on other sites More sharing options...
Buha Posted March 26, 2018 Share Posted March 26, 2018 Un tutorial bun, exact cum prevede legea. Link to comment Share on other sites More sharing options...
Retired Antiq Posted March 26, 2018 Retired Share Posted March 26, 2018 ms re Link to comment Share on other sites More sharing options...
adrian Posted March 27, 2018 Share Posted March 27, 2018 frumos! Link to comment Share on other sites More sharing options...
adrian Posted March 27, 2018 Share Posted March 27, 2018 bool numarPrim(int numar) { if(numar < 2) // Daca numarul este mai mic ca si 2 (1, 0, -1, -2, etc) - acesta nu este prim return false; if(numar == 2) // Daca numarul este 2, acesta este prim return true; /* optimizare fara a fi nevoie de biblioteca math.h pentru functia sqrt */ for(int i = 2; i * i <= numar; i++) if(numar % i == 0) return false; return true;} Link to comment Share on other sites More sharing options...
Zooky Posted March 28, 2018 Share Posted March 28, 2018 Ms Link to comment Share on other sites More sharing options...
MrKiller69 Posted March 29, 2018 Share Posted March 29, 2018 Ms Link to comment Share on other sites More sharing options...
Retired Un4m3d Posted March 29, 2018 Retired Share Posted March 29, 2018 sa-l vad, apoi parere. Link to comment Share on other sites More sharing options...
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now