#643.
Se citeste un numar natural n. Aflati cifra maxima a lui n si numarul acesteia de aparitii :
#include <iostream>
using namespace std;
int main() {
int n, cifn[11], i = 0, j;
cin >> n;
while (n > 0) {
cifn[i] = n % 10;
n = n / 10;
i++;
}
int max = cifn[0], counter = 0;
for (j = 0; j < i; j++) {
if (max < cifn[j]) max = cifn[j];
}
for (j = 0; j < i; j++) {
if (max == cifn[j]) counter++;
}
cout << "Cifra maxima : " << max << "\nAparitii : " << counter;
}
