Labs

3. Palindrom
#include <stdio.h>

int funk(int n)
{
int a,b=0,cifren=1;
a=n;
while (a>9)
{
    cifren*=10;
    a/=10;
}
a=n;
while(a>0)
{
    b=b+(a%10)*cifren;
    cifren/=10;
    a/=10;
}
return b+n;
}
int palindrom(long pal)
{
    int cifren1=1,a,temp=1,pocetok,kraj;
    a=pal;
    while (a>9)
{
    cifren1*=10;
    a/=10;
}
a=pal;
while (a>0)
{
    pocetok=a%10;
    kraj=a/cifren1;
    a=(a%cifren1)/10;
    cifren1/=100;
    if (pocetok!=kraj)
    {
        temp=0;
        break;
    }
}
return temp;
}
int main()
{
    int br;
    scanf("%d", &br);
    if (palindrom(funk(br)))
    printf("Brojot e palindrom");
    else
        printf("Brojot ne e palindrom");
}
2. Forma
#include <stdio.h>
int f(int n){
    int i;

    for (i=0; i<n-1; i++){
        printf("1");
    }

    printf("%d", n);

    for (i=0; i<n-1; i++){
        printf("1");
    }
}
int main() {
    int n;
    int i;

    scanf("%d", &n);

    for (i=1; i<=n; i++){
        f(i);
        printf("\n");
    }

    return 0;
}
1. Proizvod na parni pozicii
#include <stdio.h>

int funk(int br)
{
    int a,proizvod=1;
    a=br;
    a=a/10;
    while (a>0)
    {
        proizvod*=a%10;
        a/=100;
    }
    return proizvod;
}
int main()
{
    int n;
    scanf("%d", &n);
    printf("%d", funk(n));
}