fork download
copy 
  1. #include<stdio.h>
  2.  #include<stdlib.h>
  3.  #include<string.h>
  4.  int maxsize=100;
  5.  static char arr[100];
  6.  int top=-1;
  7.  char queue[100];
  8.  int front=-1;
  9.  int rear=-1;
  10.  char enqueue(char data){
  11.  if(rear+1>=100){
  12.  return 0;}
  13.  else{
  14.  queue[rear+1]=data;
  15.  rear++;
  16.  return 1;
  17.  }}
  18.  char dequeue(){
  19.  if(front==rear){
  20.  return 0;}
  21.  else{
  22.  char data=queue[front+1];
  23.  front++;
  24.  return(data);
  25.  }}
  26.  
  27.  void push(char new){
  28.  
  29.  top++;
  30.  arr[top]=new;
  31.  }
  32.  char pop(){
  33.  
  34.  char tmp;
  35.  if(top==-1){
  36.  printf("empty");
  37.  return tmp;
  38.  }
  39.  else{
  40.  top--;
  41.  return (arr[top+1]);
  42.  }}
  43.  int main(){
  44.  int t=1;
  45.  int f=0;
  46.  int k;
  47.  char stack[10];
  48.  char queue[10];
  49.  
  50.  char aa[100];
  51.  int stringsize=strlen(aa);
  52.  
  53.  int i=0;
  54.  int counter=0;
  55.  int n;
  56.  scanf("%d\n",&counter);
  57.  for(k=0;k<=counter;k++){
  58.  scanf("%c\n",aa);
  59.  while(i<stringsize){
  60.  
  61.  
  62.  push(aa[i]);
  63.  enqueue(aa[i]);
  64.  i++;}
  65.  n=0;
  66.  while(n<stringsize){
  67.  stack[n]=pop();
  68.  queue[n]=dequeue();
  69.  if(stack[n]==queue[n]){
  70.  
  71.  
  72.  n++;}
  73.  else
  74.  {
  75.  printf("%d\n",f);
  76.  
  77.  }
  78.  }
  79.  if(stack==queue){
  80.  printf("%d\n",t);
  81.  }
  82.  }
  83.  return 0;
  84.  
  85.  }
  86.  
  87.  
  88.  
Success #stdin #stdout 0.01s 1720KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/LBHA8
language:
C99 (gcc 8.3)
created:
14 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!