#include<stdio.h>
int main()
{
    int n;
    scanf("%d",&n);
    int arr[n];
    for(int i=0;i<n;i++)
    {
        scanf("%d",&arr[i]);
    }
    int count=0;
    int num=arr[0];
    for(int i=1;i<n;i++)
    {
       if(num!=arr[i])
            count++;
    }
    printf("%d",count);
}

Radha Code ✅
Stream : C language 💯

📌📌 Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python

#include<stdio.h>
int main()
{
    int n;
    scanf("%d",&n);
    int arr[n];
    for(int i=0;i<n;i++)
    {
        scanf("%d",&arr[i]);
    }
    int count=0;
    int num=arr[0];
    for(int i=1;i<n;i++)
    {
       if(num!=arr[i])
            count++;
    }
    printf("%d",count);
}

Alice game code
Stream : C language 💯
📌📌 Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python

✅✅Share our channel screenshot in large gorups for more answers ✅✅

Make 8K Subscribeers for FREE codes💯💯💯

#include <stdio.h>

int main() {

int n, i, flag = 0;
printf("Enter a positive integer: ");
scanf("%d", &n);


if (n == 0 || n == 1)
flag = 1;

for (i = 2; i <= n / 2; ++i) {


if (n % i == 0) {
flag = 1;
break;
}

if (flag == 0)
printf("%d .", n);
else
printf("%d ", n);

return 0;
}

Tow parllel Roads code ✅
Stream: C language 💯

📌📌 Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python

#include <iostream>
using namespace std;

// Returns sum of minimum sum subsequence
// such that one of every four consecutive
// elements is picked from arr[].
int minSum(int arr[], int n)
{
int dp[n];
if (n == 1)
return arr[0];
if (n == 2)
return min(arr[0], arr[1]);

if (n == 3)
return min(arr[0], min(arr[1], arr[2]));

if (n == 4)
return min(min(arr[0], arr[1]),
min(arr[2], arr[3]));

dp[0] = arr[0];
dp[1] = arr[1];
dp[2] = arr[2];
dp[3] = arr[3];

for (int i = 4; i < n; i++)
dp[i] = arr[i] + min(min(dp[i - 1], dp[i - 2]),
min(dp[i - 3], dp[i - 4]));

return min(min(dp[n - 1], dp[n - 2]),
min(dp[n - 4], dp[n - 3]));
}

int main()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
cout << minSum(arr, n);
return 0;
}


Paul and peter code 100% working and say thanks to me atleast