Solution

#include <stdio.h>

int main() {
    int x, n, m;
    scanf("%d %d %d", &x, &n, &m);
    int ans = n + m - x;
    printf("%d", ans);

    return 0;
}

Solution

#include <stdio.h>

int main() {
    int theta;
    scanf("%d", &theta);

    // Ensure theta is within the range [0, 360)
    theta %= 360;

    int ans=theta;

    int temp=abs(180-theta);
    int temp2=abs(360-theta); 
    
    if(ans>temp){
        ans=temp;
    }

    if(ans>temp2){
        ans=temp2;
    }

    printf("%d\n", ans);

    return 0;
}

Solution

#include <stdio.h>

int main() {
    int n;
    scanf("%d", &n);

    int arr[n];
    int cnt_odd = 0;

    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);

        if (arr[i] % 2 == 1) {
            cnt_odd++;
        }
    }

    if (cnt_odd % 2 == 0) {
        printf("YES\n");
    } else {
        printf("NO\n");
    }

    return 0;
}

Solution

#include <stdio.h>

int main() {
    int x;
    scanf("%d", &x);

    int v[32];
    for (int i = 0; i < 32; i++) {
        v[i] = (x >> i) & 1;
    }

    int a = 0, b = 0;
    int flag = 0;

    for (int i = 0; i < 32; i++) {
        if (v[i] == 1) {
            if (!flag) {
                b = 1 << i;
                flag = 1;
            } else {
                a += 1 << i;
            }
        }
    }

    if (a == 0 || b == 0) {
        printf("-1\n");
    } else {
        printf("%d %d\n", a, b);
    }

    return 0;
}

Solution

#include <stdio.h>
#include <limits.h>

int gcd(int a, int b) {
    while (b != 0) {
        int temp = b;
        b = a % b;
        a = temp;
    }
    return a;
}

int max(int a, int b){
    if(a>b){
        return a;
    }
    
    else{
        return b;
    }
}

int main() {
    int n;
    scanf("%d", &n);

    int arr[n];
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    int pre[n + 1];
    int suf[n + 1];
    
    for(int i=0; i<=n; i++){
        pre[i]=0;
        suf[i]=0;
    }

    for (int i = 1; i < n + 1; i++) {
        pre[i] = gcd(pre[i - 1], arr[i - 1]);
    }
    for (int i = n - 1; i >= 0; i--) {
        suf[i] = gcd(suf[i + 1], arr[i]);
    }

    int ans = INT_MAX;
    for (int i = 1; i < n; i++) {
        if (pre[i] == suf[i]) {
            ans = (ans < (max(i, n - (i + 1)))) ? ans : (max(i, n - (i + 1)));
        }
    }

    if (ans == INT_MAX) {
        printf("-1\n");
        return 0;
    }

    printf("%d\n", ans + 1);

    return 0;
}