1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

#include <stdio.h>
struct node //node structure
{
    char data;
    struct node *next;
};
struct node *newnode,*start,*tptr,*prev;
void addNode(char character) 
{
    newnode=(struct node*)malloc(sizeof(struct node)); //node creation
    newnode->data=character;
    newnode->next=NULL;
    if(start==NULL) //first node
        start=newnode;
    else
    {   //ordering node in lexicographical order
        for(prev=NULL,tptr=start;tptr && tptr->data < newnode->data;prev=tptr,tptr=tptr->next);
        if(tptr==start) //insert at beginning
        {
            newnode->next=start;
            start=newnode;
        }
        else //insert at middle or end
        {
            prev->next=newnode;
            newnode->next=tptr;
        }
    }
}
int main()
{
    char str[20];int size;
    gets(str);
    size=strlen(str);
    for(int i=0;i<size;addNode(str[i]),i++);
    for(tptr=start;tptr;printf("%c",tptr->data),tptr=tptr->next);
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49

#include<stdio.h>
int odd[20],even[20]; //global array variables
int top_o=-1,top_e=-1; 
void oddnum(int num) //to store odd numbers
{
    top_o++; //index of odd array
    odd[top_o]=num;
}
void evennum(int num) //to store even numbers
{
    top_e++; //index of even array
    even[top_e]=num;
}
void sort(int array[],int top) //to sort
{
    int tmp;
    for(int i=0;i<top;i++)
    {
        for(int j=i+1;j<=top;j++)
        {
            if(array[i]>=array[j])
            {
                tmp=array[i];
                array[i]=array[j];
                array[j]=tmp;
            }
        }
        printf("%d ",array[i]);
    }
    printf("%d ",array[top]);
}
 
int main()
{
    int n;
    scanf("%d",&n);
    int arr[n],i;
    for(i = 0; i < n ; i++)
    {
        scanf("%d",&arr[i]);
        if(arr[i]%2==0){
            evennum(arr[i]);}
        else{
            oddnum(arr[i]);}
    }
    sort(odd,top_o);
    sort(even,top_e);
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63

#include <stdio.h>
#include<string.h>
char stack[100];
int top=-1;
//push character in to stack
void push(char cha)
{
    top++;
    stack[top]=cha;
}
//pop character from stack
int pop()
{
    stack[top]='\0'; //set empty character
    top--;
    if(top<-1) //this is incase ##abc 
    {           //if two ## come at the beginning
        top=-1;
    }
}
int main()
{
    char str1[20],str2[20];
    int len1,len2,i,j;
    gets(str1);
    gets(str2);
    len1=strlen(str1);
    len2=strlen(str2);
    for(i=0;i<len1;i++)
    {
        if(str1[i]=='#')
        {
            pop();
        }
        else
        {
            push(str1[i]);
        }
    }
    strcpy(str1,stack);
    top=-1;//reset the stack 
    for(j=0;j<len2;j++)
    {
        if(str2[j]=='#')
        {
            pop();
        }
        else
        {
            push(str2[j]);
        }
    }
    strcpy(str2,stack);
    if(strcmp(str2,str1)==0)
    {
        printf("True ( %s == %s )",str1,str2);
    }
    else
    {
        printf("False ( %s != %s )",str1,str2);
    }
    return 0;
}