Anna Grigoryan

#include <stdio.h>
// this is the problem 19 from practice ex.
int main(void) {
    int arr[10];
    int N;
    int found = -1;
    printf("enter 10 integers: ");
    for (int i = 0; i < 10; i++) {
        scanf("%d", &arr[i]);
    }
    printf("Enter value to remove: ");
    scanf("%d", &N);
    // fail fast logic
    for (int i = 0; i < 10; i++) {
        if (arr[i] == N) {
            found = i;
            break;
        }
    }
    //shift elements left
    if (found != -1) {
        for (int i = found; i < 9; i++) {
            arr[i] = arr[i + 1];
        }
        arr[9] = 0; //adding zero at the end
    }
    printf("result: ");
    for (int i = 0; i < 10; i++) {
        printf("%d ", arr[i]);
    }
    return 0;
}

#include <stdio.h>
// this is problem 11 from practice exercises
int main() {
    int N;
    printf("Enter height N: ");
    scanf("%d", &N);
    // first triangle, to the left
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= i; j++) {
            printf("*");
        }
        printf("\n");
    }
    // second triangle, to the right
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N - i; j++) {
            printf(" ");
        }
        for (int j = 1; j <= i; j++) {
            printf("*");
        }
        printf("\n");
    }
    return 0;
}