solve_problem.c

// ================================================
//               * Language: C
//               * Topic: Pointer
//               *  solve practice Problem
// =================================================

//  // 👉👉  🔹🔹  Question 1️⃣ -  write a program to enter price of 3 times &
//  print their  final cost with  gst

#include <stdio.h>
int main()
{
    float price[3];

    printf("Enter3 price : ");

    scanf("%f", &price[0]);
    scanf("%f", &price[1]);
    scanf("%f", &price[2]);

    printf("Total price 1 = %f\n", price[0] + (0.18 * price[0]));
    printf("Total price 2 = %f\n", price[1] + (0.18 * price[1]));
    printf("Total  price 3 = %f\n", price[2] + (0.18 * price[2]));

    return 0;
}

// 👉👉  🔹🔹  Question 1️⃣ -  write a program to enter price of 3 times &
//  print their  final cost with  gst
// ==========================  versoin 2.0 =======================

#include <stdio.h>
int main()
{
    float price[3];
    printf("Enter 1st price  :");
    scanf("%f", &price[0]);

    printf("Enter 2nd price  :");
    scanf("%f", &price[1]);

    printf("Enter 3rd price :");
    scanf("%f", &price[2]);

    printf("Total price 1 = %f\n", price[0] + (0.18 * price[0]));
    printf("Total price 2 = %f\n", price[1] + (0.18 * price[1]));
    printf("Total price 3 = %f\n", price[2] + (0.18 * price[2]));

    return 0;
}
//   👉👉  🔹🔹  Question  2️⃣  write a function  to count the numbers of odd numbers in array
#include <stdio.h>
int count(int arr[], int n);
int main()
{
    int arr[] = {1, 2, 3, 4, 5, 6, 7};

    printf("%d\n", count(arr, 7));

    return 0;
}
// Function Definition
int count(int arr[], int n)
{
    int count = 0;
    for (int i = 0; i < n; i++)
    {
        if (arr[i] % 2 != 0)
        {
            count++;
        }
    }
    return count;
}

//    👉👉  🔹🔹  Question   3️⃣  write a function to reverse an array

#include <stdio.h>
void reverse(int arr[], int n);
void printArr(int arr[], int n);
int main()
{
    int arr[] = {1, 2, 3, 4, 5, 6};
    reverse(arr, 6); //  function call
    printArr(arr, 6);  //  function call
    return 0;
}

//  function definition
void printArr(int arr[], int n)
{
    for (int i = 0; i < n; i++)
    {
        printf("%d\t", arr[i]);
    }
    printf("\n");
}
//  function definition

void reverse(int arr[], int n)
{
    for (int i = 0; i < 5 / 2; i++)
    {
        int firstValue = arr[i];
        int lastValue = arr[n - i - 1];
        arr[i] = lastValue;
        arr[n - i - 1] = firstValue;
    }
}

//    👉👉  🔹🔹 4️⃣  Question write a program to store  the  first n  fibonacci numbers

#include <stdio.h>
int main()
{
    int n;
    printf("Enter Number > 2 :");
    scanf("%d", &n);

    int fibo[n];
    fibo[0] = 0;
    fibo[1] = 1;

    for (int i = 2; i < n; i++)
    {
        fibo[i] = fibo[i - 1] + fibo[i - 2];
        printf("%d\t", fibo[i]);
    }
    printf("\n");

    return 0;
}

//    👉👉  🔹🔹   5️⃣  create a 2D array , storing the tables 2& 3

#include <stdio.h>
void soteTable(int arr[][10], int n, int m, int number);
int main()
{
    int tables[2][10];
    soteTable(tables, 0, 10, 2); // function call
    soteTable(tables, 1, 10, 3); // Function call

    for (int i = 0; i < 10; i++)
    {
        printf("%d\t", tables[0][i]);
    }
    printf("\n");
    for (int i = 0; i < 10; i++)
    {
        printf("%d\t", tables[1][i]);
    }
    printf("\n");
    return 0;
}
// Function Diefinition
void soteTable(int arr[][10], int n, int m, int number)
{
    for (int i = 0; i < m; i++)
    {
        arr[n][i] = number * (i + 1);
    }
}

// 1️⃣ 2️⃣ 3️⃣ 4️⃣ 5️⃣ 6️⃣ 7️⃣ 8️⃣ 9️⃣ 🔟