hazi-3,4,5

3.
#include <iostream>

using namespace std;
int cif(int nr)
{
    int s=0;
    while(nr!=0)
    {
        s=s+nr%10;
        nr=nr/10;
    }
        return s;
}
int main()
{
    int n,a[20];
    int max=0;
    cout<<"N ";cin>>n;
    for(int i=1;i<=n;i++)
    {
        cout<<"a["<<i<<"] ";cin>>a[i];
        if(cif(a[i])>max) max=cif(a[i]);
    }
    for(int i=1;i<=n;i++)
        if(cif(a[i])==max) cout<<a[i]<<" ";
    return 0;
}
+++++++++++++++++++++++++++++++++
4.
#include <iostream>

using namespace std;
int ford(int n)
{
    int f=0;
    while(n!=0)
    {
        f=f*10+n%10;
        n=n/10;
    }
    return f;
}
int pal(int a,int b)
{
    int a1=a;
    int ig1=0,ig2=0;
    while(ig1==0)
    {
        if(ford(a1)==a1) ig1=1;
        else a1++;
    }
    int nagyobb=a1;
    a1=a;
    while(ig2==0)
    {
        if(ford(a1)==a1) ig2=1;
        else a1--;
    }
    if(nagyobb-a<a-a1) b=nagyobb;
    else b=a1;
    return b;
}
int main()
{
    int n,b;
    cout<<"N ";cin>>n;
    cout<<pal(n,b);

    return 0;
}
++++++++++++++++++++++++++
5.
#include <iostream>

using namespace std;
int duplicare(int n, int d)
{
    int h=1;
    int uj=0;
    while(n!=0)
    {
        if(n%2==0){ uj=n%10*h+uj;
        h=h*10;
        uj=n%10*h+uj;}
        else uj=n%10*h+uj;

        h=h*10;
        n=n/10;
    }
    if(n==uj) d=-1;
    else d=uj;
    return d;

}
int main()
{
    int n,d=0;
    cout<<"N ";cin>>n;
    cout<<duplicare(n,d)<<endl;
    return 0;
}