C-code

Compiler

#include<stdio.h>

#include<string.h>

int isvowel(char a)

{

a=tolower(a);

if(a=='a'||a=='e'||a=='i'||a=='o'||a=='u')

return 1;

else

return 0;

}

int main() {

char str[1001],temp;

scanf("%s",str);

int i=0,j=strlen(str)-1;

while(i<=j)

{

if(isvowel(str[i]))

i++;

else if(isvowel(str[j]))

j--;

else

{

temp=str[i];

str[i++]=str[j];

str[j--]=temp;

}

}

printf("%s",str);

}

C-code

Compiler

#include<stdio.h>

#include<string.h>

int isvowel(char a)

{

a=tolower(a);

if(a=='a'||a=='e'||a=='i'||a=='o'||a=='u')

return 1;

else

return 0;

}

int main() {

char str[1001];

int count=0;

scanf("%s",str);

for(int i=0;i<strlen(str)-1;i++)

{

if(isvowel(str[i])&&isvowel(str[i+1]))

count++;

}

printf("%d",count);

}

C-code

Compiler

#include<stdio.h>

#include <stdlib.h>

int main()

{

int arr[101],index=-1;

while(scanf("%d",&arr[++index])>0);

for(int i=0;i<index;i++)

{

for(int j=i;j<index;j++)

{

if(arr[i]>arr[j])

{

int temp=arr[i];

arr[i]=arr[j];

arr[j]=temp;

}

}

}

int i=0,j=index-1;

while(i<=j)

{

if(i==j)

printf("%d",arr[i]);

else

printf("%d %d ",arr[j],arr[i]);

i++;

j--;

}

}

C-code

Compiler

#include<stdio.h>

#include<string.h>

int main() {

int n;

char str[100][100],re[100][100];

int num,index=0,rindex=0;

scanf("%d",&n);

for(int i=0;i<n;i++)

{

scanf("%s %d",str[index],&num);

for(int j=0;j<num;j++)

{

scanf("%s",re[rindex]);

rindex++;

}

index++;

}

for(int i=0;i<rindex;i++)

{ int flag=0;

for(int j=0;j<index;j++)

{

if(!strcmp(re[i],str[j]))

{

flag=1;

break;

}

}

if(flag==0)

printf("%s ",re[i]);

}

}

C-code

Compiler

#include<stdio.h>

int main() {

int n;

scanf("%d",&n);

int size=(n*2)-1,startrect=1,mat[size][size],endrect=size;

while(n!=0)

{

for(int row=startrect;row<=endrect;row++)

{

for(int col=startrect;col<=endrect;col++)

{

if(row==startrect||row==endrect||col==startrect||col==endrect)

mat[row][col]=n;

}

}

startrect++;

endrect--;

n--;

}

for(int row=1;row<=size;row++)

{

for(int col=1;col<=size;col++)

{

printf("%d",mat[row][col]);

}

printf("\n");

}

}

C-code

Compiler

//1

#include<stdio.h>

#include<stdlib.h>

#define CELLSCOUNT 8

int* cellComplete(int cells[],int days)

{

int*mat=malloc(sizeof(int));

for(int i=0;i<days;i++)

{

for(int j=0;j<CELLSCOUNT;j++)

{

if(j==0)

{

if(cells[1]==0)

mat[0]=0;

else

mat[0]=1;

}

else if(j==7)

{

if(cells[6]==0)

mat[7]=0;

else

mat[7]=1;

}

else

{

if((cells[j-1]==0&&cells[j+1]==0)||(cells[j-1]==1&&cells[j+1]==1))

{

mat[j]=0;

}

else

mat[j]=1;

}

}

for(int index=0;index<8;index++)

cells[index]=mat[index];

}

return mat;

}

int main() {

int cells[CELLSCOUNT],index,DAYS;

for(index=0;index<CELLSCOUNT;index++)

{

scanf("%d",&cells[index]);

}

scanf("\n%d",&DAYS);

int*modified=cellComplete(cells,DAYS);

for(index=0;index<CELLSCOUNT;index++)

printf("%d ",modified[index]);

}

C-code

Compiler

//2

#include<stdio.h>

void reverse(int arr[],int length)

{

int start=0,end=length-1;

while(start<=end)

{

int temp=arr[start];

arr[start++]=arr[end];

arr[end--]=temp;

}

}

int main() {

int N;

scanf("%d",&N);

int arr[N],index;

for(index=0;index<N;index++)

scanf("%d",&arr[index]);

reverse(arr,N);

for(index=0;index<N;index++)

printf("%d ",arr[index]);

}

C-code

Compiler

//3

#include<stdio.h>

void reverse(int arr[],int length,int M)

{

int tempstart=0,tempend=M-1;

while(tempend<length)

{

int start=tempstart,end=tempend;

while(start<=end)

{

int temp=arr[start];

arr[start++]=arr[end];

arr[end--]=temp;

}

tempstart=tempend;

tempend=tempend+M;

}

}

int main() {

int N;

scanf("%d",&N);

int arr[N],index,M;

for(index=0;index<N;index++)

{

scanf("%d",&arr[index]);

}

scanf("\n%d",&M);

reverse(arr,N,M);

for(index=0;index<N;index++)

printf("%d ",arr[index]);

}

C-code

Compiler

//4

#include<stdio.h>

void rotate(int arr[],int length,int R)

{

R=R%length;

for(int i=0;i<R;i++)

{

int temp=arr[length-1];

for(int j=length-1;j>=0;j--)

{

arr[j]=arr[j-1];

}

arr[0]=temp;

}

}

int main() {

int N;

scanf("%d",&N);

int arr[N],index,R;

for(index=0;index<N;index++)

{

scanf("%d",&arr[index]);

}

scanf("\n%d",&R);

rotate(arr,N,R);

for(index=0;index<N;index++)

printf("%d ",arr[index]);

}

C-code

Compiler

void reverse(struct Node** head_ref)

{

struct Node* prev = NULL;

struct Node* current = *head_ref;

struct Node* fut;

while (current != NULL)

{

fut = current->next;

current->next = prev;

prev = current;

current = fut;

}

*head_ref = prev;

}

C-code

Compiler

#include<stdio.h>

#include<stdlib.h>

struct node

{

int data;

struct node*next;

};

void inserAtFirst(struct node**head_ref,int data)

{

struct node*new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=data;

new_node->next=*head_ref;

*head_ref=new_node;

}

void printMidPoint(struct node* head)

{

struct node*slow=head;

struct node*fast=head;

if(head!=NULL)

{

while(fast!=NULL&&fast->next!=NULL)

{

fast=fast->next->next;

slow=slow->next;

}

printf("%d",slow->data);

}

}

int main() {

struct node*head=NULL;

int N;

scanf("%d",&N);

for(int i=0;i<N;i++)

{ int num;

scanf("%d",&num);

inserAtFirst(&head,num);

}

printMidPoint(head);

}