-
-
Save AlexandruFilipescu/cb675a319fd6c5e50eb6ccfaeef79269 to your computer and use it in GitHub Desktop.
C++ Cel mai mare si cel mai mic numar prim + Suma numerelor care au cifrele in ordine crescatoare (C ++ Highest and lowest prime numbers + Sum of numbers that have the figures in ascending order)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| using namespace std; | |
| int main() { | |
| // Cel mai mare si cel mai mic numar prim | |
| int i, j, n,m,temp,copie,s,prim_mic,prim_mare; | |
| prim_mic = INT_MAX; | |
| prim_mare = INT_MIN; | |
| bool necrescator; | |
| bool prim; | |
| s = 0; | |
| cin >> n; | |
| cout << endl; | |
| for (i = 1; i <= n;i++) { | |
| prim = true; | |
| cin >> m; | |
| if (m <= 1) { prim = false; | |
| } else if (m==2 ||m==3){ | |
| prim = true; | |
| } else{ | |
| for (j = 2; j <= m / 2; j++) { | |
| if (m%j == 0) { prim = false; } | |
| } | |
| } | |
| if (prim != false) { | |
| if (m<prim_mic) { | |
| prim_mic = m; | |
| } | |
| if (m>prim_mare) { | |
| prim_mare = m; | |
| } | |
| } | |
| // aici incepe suma numerelor care au cifrele in ordine crescatoare | |
| copie = m; | |
| necrescator = false; | |
| if (m > 9){ | |
| while (m != 0) { //127 | |
| temp = m % 10; //7 | |
| m /= 10; //12 | |
| if (temp <= m%10) { // 7 < 2 | |
| necrescator = true; | |
| } | |
| } | |
| if (necrescator == false) { | |
| s += copie; | |
| } | |
| } | |
| } | |
| cout << "Cel mai mic numar prim introdus este: " << prim_mic << " si cel mai mare numar prim este: " << prim_mare << endl; | |
| cout << "Suma Numerelor care au cifre in ordine crescatoare este: " << s; | |
| system("pause"); | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment