Modulacia da Simulireba

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
/*
int fibonachi(int n)
{
    if (n == 1 || n == 2) return 1;
    else return fibonachi(n-1) + fibonachi(n-2);
}
*/
int main()
{
    int a, b;
    char symbol;
    scanf("%c", &symbol);
    scanf("%d", &a);
    scanf("%d", &b);
    int result;
    switch (symbol)
    {
        case '&': result = a&b; break;
        case '|': result = a|b; break;
        case '^': result = a^b; break;
        default: printf("Ver amovicani simbolo!\n");
        break;
    }
    printf("%d %c %d = %d\n", a, symbol, b, result);
    printf("%d << 8 = %d\n", result, result<<8);
    printf("%d >> 8 = %d\n", result, result>>8);
    printf("~%d = %d\n", result, ~result);
    /*
    int n;
    scanf("%d", &n);

    int *A = new int[n + 1];

    for (int i = 1; i <= n; i++)
    {
        A[i] = fibonachi(i);
        printf("%d\n", A[i]);
    }
    */
    /*
    int x = 0;
    scanf("%d", &x);

    int i = 0;
    double y = 0;
    for (; i <= 5; i++)
    {
        double d = pow((double)x, (double)i);
        if (i % 2 == 0)
            y += d;
        else
            y -= d;
    }
    printf("%f\n", y);
    */
    system("PAUSE");
    return 0;
}

/*
    int x = 0;
    scanf("%d", &x);

    int i = 0;
    double y = 0;
    for (; i <= 5; i++)
    {
        double d = pow((double)x, (double)i);
        if (i % 2 == 0)
            y += d;
        else
            y -= d;
    }
    printf("%f\n", y);
*/

/*
int factorial(int n)
{
    if (n <= 1) return 1;
    else return  n * factorial(n-1);
}
*/