There are N students standing in a row and numbered 1 through N from left to right. You are given a string S with length N, where for each valid i, the i-th character of S is 'g' if the i-th student is a girl or 'b' if this student is a boy. Students standing next to each other in the row are friends.

 #include<stdio.h>

#include<string.h>

int main()

{

    char students[100001];

    int t,j,count=0,length;

    scanf("%d",&t);

    while(t--){

    count=0;

    scanf("%s",students);

    length=strlen(students);

        for(j=0;j<length;j++){

            if((students[j]=='g'&&students[j+1]=='b')||(students[j]=='b'&&students[j+1]=='g')){

            count++;

            j++;}

            else

            continue;}

    printf("%d\n",count);}

    return 0;

}

Comments

Post a Comment

Popular posts from this blog

Akash the die heart fan of AR Rahman went to the live concert happened in Bangalore with his family members.The event management firm responsible for the event arranged the seats for the audience in descending order of maximum number of tickets booked for single family.

 #include <stdio.h> int main() {int nooffamilymembers; scanf("%d",&nooffamilymembers); int r=nooffamilymembers; for(int i=1;i<=nooffamilymembers;i++){     for(int j=1;j<=r;j++){         printf("%d ",r);     }r--;     printf("\n");} return 0; }
Read more

Elavenil has a chessboard with N rows and M columns. In one step, he can choose two cells of the chessboard which share a common edge (that has not been cut yet) and cut this edge. Formally, the chessboard is split into two or more pieces if it is possible to partition its cells into two non-empty subsets S1 and S2 (S1∩S2=∅, |S1|+|S2|=NM) such that there is no pair of cells c1,c2 (c1∈S1,c2∈S2) which share a common edge that has not been cut.Elavenil does not want the board to split into two or more pieces. Compute the maximum number of steps he can perform while satisfying this condition.

 #include <stdio.h> int main() { int n,m; scanf("%d %d",&n,&m); printf("%d",(m-1)*(n-1)); return 0; }
Read more

Advika is trying to solve the puzzle problem during Mathematics class hour. she has a graph paper with G X N rows and columns, and the puzzle question is, an NCC training base in each cell for a total of G X N bases. He wants to drop food items to every point based on strategic points on the graph paper, marking each drop point with a red dot. If a base contains at least one food package inside or on top of its border fence, then it's considered to be supplied. For example: if Advika has four bases in a 2x2 grid. If he drops a single food package where the walls of all four bases intersect, then those four cells can access the food package.

 #include<stdio.h> int req,x,y; int NccCells(int x,int y) {req=((x+1)/2)*((y+1)/2);     return req;} int main() {    scanf("%d%d",&x,&y);     printf("%d",NccCells(x,y)); return 0;}
Read more