Question

1. Sa se afiseze toate nr. palindrom din intervalul [a,b].
2. Se citesc numere pana la intalnirea lui 0. Afisati rasturnatele celor pare.

Cine stie sa faca programele, daca m-ar putea ajuta.

Answer 1

#include <iostream>
#include <cmath>

using namespace std;

bool palindrom(int n){
int aux = n, p = n % 10;
n /= 10;
while(aux != 0){
p = p + aux % 10;
aux /= 10;
}
if(p == n)
return true;
return false;
}

int rasturnat(int n){
int r = n % 10;
while(n != 0){
r = 10 * n % 10;
n /= 10;
}
return r;
}

int main()
{
int a, b;
cin >> a >> b;
for(int i = a; i <= b; i++)
if(palindrom(i))
cout << i << " ";
int a[100];
cin >> a[0];
int i = 0;
while(a[i] != 0){
cin >> a[i];
}
for(int j = 0; j < i; j++)
if(a[j] % 2 == 0)
cout << rasturnat(a[j]);
return 0;
}