Convert c++ code to c online

#include<stdio.h>

Convert c++ code to c online

#include <iostream>
#include <sstream>
using namespace std;
  
void extractIntegerWords(string str)
{
    stringstream ss;    
  
    
    ss << str;
  
    
    string temp;
    int double found;
    while (!ss.eof()) {
  
        
        ss >> temp;
          if (stringstream(temp) >> found)
            cout << found << " ";
        temp = "";
    }

Convert c++ code to c online

#include <bits/stdc++.h>
using namespace std;
int recurFunct(int n)
{
    if (n==1)
        return 1;
    return recurFunct(n-1) + 2*n-1;
}
int main()
{
    int n;
    cin>>n;
    for (int i=2; i<=n+1; i++)
    {
        cout<<recurFunct(i)<<" ";
        if (i%8 ==0 )
            cout<<"\n";
    }
    return 0;
}

Convert c++ code to c online

 #include <iostream>
#include<stdlib>

using namespace std;
 

typedef struct node
{

  int val;

  struct node* next;
}node;
 
node* head=NULL;
 

int count(node* head) // code to count the no. of nodes
{

  node* p=head;

  int k=1;

  while(p!=NULL)

  {

    p=p->next;

    k++;

  }

  return k;
}
 

node ll_reverse(node head)  // to reverse the linked list
{

  node* p=head;

  long int i=count(head),j=1;

  long int arr[i];

  while(i && p!=NULL)

  {

    arr[j++]=p->val;

    p=p->next;

    i--;

  }

  j--; 

  while(j) // loop will break as soon as j=0

  {

    cout<<arr[j--]<<" ";

  }

   

  return head;
}
 

node* insert_end(node* head,int data)  //code to insert at end of ll
{

  node* q=head,p=(node)malloc(sizeof(node));

  p->val=data;

  while(q->next!=NULL)

  {

    q=q->next;

  }

  q->next=p;

  p->next=NULL;

  return head;
}
 

node create_ll(node head,int data)  //create ll
{

  node* p=(node*)malloc(sizeof(node));

  p->val=data;

  if(head==NULL)

  {

    head=p;

    p->next=NULL;

    return head;

  }

  else

  {

    head=insert_end(head,data);

    return head;

  }
}
 
//Driver code
 

int main() 
{

  int i=5,j=1;  

  while(i--)

  {

    head=create_ll(head,j++);

  }

  head=ll_reverse(head);  

    return 0;
}

Convert c++ code to c online

#include <iostream>
using namespace std;


int main(int argc, char** argv)
{
    string name;
    cout<<"Sample Input(command line): "<<endl;
    cin>>name;
    cout <<name<<" - Command Line Arguments"<<endl;
    return 0;
}

Convert c++ code to c online

#include <iostream>
using namespace std;

int main()

{

int sz;

cout<<"Enter the size of array::";

cin>>sz;

int randArray[sz];

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

randArray[i]=rand()%1000; //Generate number between 0 to 999

cout<<"\nElements of the array::"<<endl;

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

cout<<"Elements no "<<i+1<<"::"<<randArray[i]<<endl;

return 0;

}

Convert c++ code to c online

c programm

Convert c++ code to c online

#include <iostream>
#include <string>

using namespace std;

bool isPolindrom(string s){
  int len = s.length();
  if (len < 2) return true; // if s == '' or s == <one symbol>   
  bool condition = (s[0] == s[len-1]); // first symbol == last symbol
  return condition && isPolindrom(s.substr(1, len-2)); // recursion
} 

int main()
{
  string name;
  cout << "What is your word? ";
  getline (cin, word);
  cout << "it is" << (isPolindrom(word) ? " polindrom" : " not polindrom"); 
}

Convert c++ code to c online

// C++ code to count number of matching
// characters in a pair of strings
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to count the matching characters
void count(string str1, string str2)
{
    int c = 0, j = 0;
 
    // Traverse the string 1 char by char
    for (int i = 0; i < str1.length(); i++) {
 
        // This will check if str1[i]
        // is present in str2 or not
        // str2.find(str1[i]) returns -1 if not found
        // otherwise it returns the starting occurrence
        // index of that character in str2
        if (str2.find(str1[i]) >= 0
            and j == str1.find(str1[i]))
            c += 1;
        j += 1;
    }
    cout << "No. of matching characters are: "
         << c / 2;
}
 
// Driver code
int main()
{
    string str1 = "aabcddekll12@";
    string str2 = "bb2211@55k";
 
    count(str1, str2);
}

Convert c++ code to c online

#include <iostream>
using namespace std;

// ALGORITHM
// 1. Iterate over each position of S DNA string
// 2. For each position, check if each character of T
//    matches with S
// 3. If T maches every character of S, substring is found
// 4. Else move to next position in S
// 5. Since DNA is an infinite string, matching is done in
//     circular method.

// Function to check substring
string check_substring(string S, string T)
{
        int n = S.length();     // Length of S string
        int m = T.length();     // Length of T string

        // Variable to check if match is found or not
        int found;

        // Loop over each position in S string
        for(int i=0; i<n; i++)
        {
                // Make variable found equals 1 
                found = 1;

                // For current posiiton (i), check each subsequent
                // position of S and T
                for(int j=0; j<m; j++)
                {
                        // If there is any unmatached character
                        if(S[(i+j)%n]!=T[j])
                        {
                                // Make variable 0 (Not a substring)
                                found = 0;

                                // Break loop to move to next (i) position in S
                                break;
                        }
                }

                // If check equals 1 (Every character matched)
                // Substring is found (return YES)
                if(check==1) { return "YES"; }
        }

        // If loop ends without any match, return No
        return "NO";
}

int main()
{
        // Take input string S and T
        string S, T;
        cin>>S>>T;

        // Print Substring Check
        cout<<check_substring(S,T);
        return 0;
}

Similar codes

-1 vote154 views1 answer
C++ itoa
C++
-1 vote144 views1 answer
C++ filesystem remove file
C++
1 vote178 views1 answer
C++ until
C++
0 vote148 views1 answer
Strong number in c++
C++
0 vote136 views1 answer
Could not find the task c c++ active file
C++
0 vote229 views1 answer
Vector c++ length integer
C++
3 votes159 views1 answer
Infinite loop c++
C++
0 vote159 views1 answer
Compare two functions in a class c++
C++
1 vote156 views1 answer
Qt qchar to lower
C++
0 vote146 views1 answer
Leetcode fast io c++
C++