C to c++ converter online

Convert c++ code to c online

#include<stdio.h>

C to c++ converter online

#ifndef CMAC_H
#define CMAC_H
void AES_CMAC(unsigned char *key, unsigned char *input, int length,
	unsigned char *mac);

#endif

Convert c++ to c online

123456789101112#include <stdio.h>#if !defined (MESSAGE)#define MESSAGE "You wish!"#endifint main(void){cout << "Hello World" << endl;return 0;}X

Source: tutorialspoint.com

C to c++ converter online

#include <inttypes.h>
#include <stdlib.h>
#include <sys/time.h>
#include <sys/poll.h>
#include <unistd.h>
#include <stdio.h>

C code to c++ converter

#include <stdio.h>
main ( )
{
char op ;
int n1, n2 ;
printf ("opération souhaitée (+ ou *) ?\n ") ;
scanf ("%c", &op) ;
printf ("donnez 2 nombres entiers : \n") ;
scanf ("%d %d", &n1, &n2) ;
if (op == '+')
printf ("leur somme est : %d \n", n1+n2) ;
else
printf ("leur produit est : %d \n",n1*n2) ;
getch ( ); } //

C to C++ online Converter

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct _tree
{    char v[18];
    int len, index, plus_l, plus_r;
    struct _tree *l, *r;
} Tree;

void Ins(Tree **t, char *val, int val_len, int indeks)
{    if(!(*t))
    {    *t = (Tree*)malloc(sizeof(Tree));

        strcpy((*t)->v, val);

        (*t)->len = val_len;
        (*t)->index = indeks;

        (*t)->plus_l = (*t)->plus_r = 0;
        (*t)->l = (*t)->r = NULL;
    }
    else if(((*t)->len > val_len) || (((*t)->len == val_len) && (strcmp((*t)->v, val) > 0)))
    {    if((*t)->r) Ins(&(*t)->r, val, val_len, 1);
        else
        {    Ins(&(*t)->r, val, val_len, (*t)->index + 1);
            (*t)->plus_r = 0;
        }
    }
    else
    {    (*t)->index += 1;
        (*t)->plus_r += 1;

        if((*t)->l) Ins(&(*t)->l, val, val_len, 1);
        else
        {    Ins(&(*t)->l, val, val_len, (*t)->index - 1);
            (*t)->plus_l = 0;
        }
    }
}

int Find(Tree **t, char *val, int val_len)
{    if(*t)
    {    if(strcmp((*t)->v, val) == 0)
        {    printf("%d\n", (*t)->index);
            return 1;
        }

        else if(((*t)->len > val_len) || (((*t)->len == val_len) && (strcmp((*t)->v, val) > 0)))
        {    if((*t)->plus_r)
            {    if((*t)->r)
                {    int t_plus_r = (*t)->plus_r;

                    (*t)->r->index += t_plus_r;
                    (*t)->r->plus_l += t_plus_r;
                    (*t)->r->plus_r += t_plus_r;
                }

                (*t)->plus_r = 0;
            }

            return Find(&(*t)->r, val, val_len);
        }

        else
        {    if((*t)->plus_l)
            {    if((*t)->l)
                {    int t_plus_l = (*t)->plus_l;

                    (*t)->l->index += t_plus_l;
                    (*t)->l->plus_l += t_plus_l;
                    (*t)->l->plus_r += t_plus_l;
                }

                (*t)->plus_l = 0;
            }

            return Find(&(*t)->l, val, val_len);
        }
    }
    else return 0;
}

int main()
{    int T, cmd, len;
    scanf("%d", &T);

    Tree *t = NULL;
    char val[18];

    while(T--)
    {    scanf("%d %s", &cmd, val);
        len = strlen(val);

        if(cmd == 1) Ins(&t, val, len, 1);
        else if(!Find(&t, val, len)) printf("Data tidak ada\n");
    }

    return 0;
}

Similar codes

0 vote269 views1 answer
2d stl array
C++
0 vote290 views1 answer
Sinh nhi phan c++
C++
0 vote271 views2 answers
C++ program to convert time in seconds to hours minutes and seconds
C++
0 vote295 views1 answer
Fabs c c++
C++
0 vote269 views2 answers
GCD(x, yz)
C++
1 vote254 views1 answer
Regex for phone number c++
C++
2 votes247 views1 answer
Binary search return index c++
C++
12 votes261 views1 answer
How to sort in descending order c++
C++
0 vote270 views1 answer
Read large files part by part in C++
C++
2 votes280 views1 answer
Web scraping with cpp
C++