Convert c++ code to c online

#include <bits/stdc++.h>
using namespace std;
main() {
	int t,n;
	int j=1;
	cin>>t;
	while(t--){
		cin>>n;
		cout<<"#"<<j<<" ";
		for(int i=0;i<n;i++){
			cout<<"SVMC"<<" ";
		}
		j++;
		cout<<endl;
	}
}

Convert c++ code to c online

#define _WINSOCK_DEPRECATED_NO_WARNINGS
#include "maître.h"
#include <winsock2.h>
#pragma comment(lib,"ws2_32.lib")
typedef int socklen_t;
#include <stdio.h>
#include <stdlib.h>
#define PORT 23
 
using namespace std;
 
int DemandeEtatBatterie = 1;
int EtatBatterie;
 
int main(void)
{
    maitre m1;
 
    m1.Configuration();
    m1.connexionclient();
    m1.envoyer();
    m1.recevoir();
    Sleep(60000);
    m1.fermersocket();
 
}
 
void maitre::Configuration()
{
    sock = socket(AF_INET, SOCK_STREAM, 0);
 
    /*********** Test *************/
    printf("La socket %d est maintenant ouverte en mode TCP/IP\n", sock);
 
    sin.sin_addr.s_addr = htonl(INADDR_ANY);   /* Adresse IP automatique */
    sin.sin_family = AF_INET;             /* Protocole familial (IP) */
    sin.sin_port = htons(PORT);         /* Listage du port */
    sock_err = bind(sock, (SOCKADDR*)&sin, sizeof(sin));
 
    sock_err = listen(sock, 1);
 
    /*********** Test *************/
    printf("Listage du port %d...\n", PORT);
}
void maitre::connexionclient()
{
    /*********** Test *************/
    printf("Patientez pendant que le client se connecte sur le port %d...\n", PORT);
    socklen_t recsize = sizeof(csin);
 
    csock = accept(sock, (SOCKADDR*)&csin, &recsize);
 
    /*********** Test *************/
    printf("Un client se connecte avec la socket %d de %s:%d\n", csock, sin.sin_addr, sin.sin_port);
}
int maitre::recevoir()
{
    /*recv(sock, (char*)&EtatBatterie, sizeof EtatBatterie, 0);
    printf("Recu : %d\n", EtatBatterie);
    if (EtatBatterie != NULL)
    {
        return EtatBatterie;
    }
    else{
        return printf("Aucune données recu");
    }*/
    sock_err = recv(sock, (char*)&EtatBatterie, 1515, 0);
    if (sock_err == SOCKET_ERROR)
        return printf("\nDesole, je n'ai pas recu de donnee");
    else
    {
        return printf("\nVoici les donnees : %s", EtatBatterie);
    }
}
int maitre::envoyer()
{
    sock_err = send(csock, (char*)&DemandeEtatBatterie, sizeof(int), 0);
 
    /*********** Test *************/
    if (sock_err != SOCKET_ERROR)
        printf("Chaine envoyée : %d\n", DemandeEtatBatterie);
    else
        printf("Erreur de transmission\n");
 
    return DemandeEtatBatterie;
}
void maitre::fermersocket()
{
    shutdown(csock, 2);
 
    printf("Fermeture de la socket...\n");
    closesocket(sock);
    printf("Fermeture du serveur terminee\n");
 
    WSACleanup();
}

Convert c++ code to c online

#include<stdio.h>
int main()
{
    int x;
    
    /* Print column names */
    printf("Number\tSquare\tCube\n");
    printf("=========================\n");

    for(x=0; x<=20; x++)
        printf("%d\t%d\t%d\n", x, x*x, x*x*x);
    
    return 0;
}

Convert c++ code to c online

public class Mythread {

    public static void main(String[] args) {
        Runnable r = new Runnable1();
        Thread t = new Thread(r);
        t.start();
        Runnable r2 = new Runnable2();
        Thread t2 = new Thread(r2);
        t2.start();
    }
}

class Runnable2 implements Runnable{
    public void run(){
        for(int i=0;i<11;i++){
            if(i%2 == 1)
                System.out.println(i);
        }
    }
}

class Runnable1 implements Runnable{
    public void run(){
        for(int i=0;i<11;i++){
            if(i%2 == 0)
                System.out.println(i);
        }
    }

Convert c++ code to c online

#include<iostream>
using namespace std;

int main()
{
  char ch;
  cin >> ch;
   
   if(ch >='a' && ch <='z'){
       cout << "This is Lowercase";
   }
   else if(ch >='A' && ch <= 'Z'){
       cout << "This is Uppercase";
   }
   else{
       cout << "This is numeric";
   }
   
   return 0;


}

Convert c++ code to c online

#include<stdio.h>

Convert c++ code to c online

#include <bits/stdc++.h>
using namespace std;
 
// Function to count distinct
// digits in a number
int countDistinct(int n)
{
    // To count the occurrence of digits
    // in number from 0 to 9
    int arr[10] = { 0 };
    int count = 0;
 
    // Iterate over the digits of the number
    // Flag those digits as found in the array
    while (n) {
        int r = n % 10;
        arr[r] = 1;
        n /= 10;
    }
 
    // Traverse the array arr and count the
    // distinct digits in the array
    for (int i = 0; i < 10; i++) {
        if (arr[i])
            count++;
    }
    return count;
}
 
// Function to return the total number
// of digits in the number
int countDigit(int n)
{
    int c = 0;
 
    // Iterate over the digits of the number
    while (n) {
        int r = n % 10;
        c++;
        n /= 10;
    }
    return c;
}
 
// Function to return the next
// number with distinct digits
int nextNumberDistinctDigit(int n)
{
    while (n < INT_MAX) {
 
        // Count the distinct digits in N + 1
        int distinct_digits = countDistinct(n + 1);
 
        // Count the total number of digits in N + 1
        int total_digits = countDigit(n + 1);
 
        if (distinct_digits == total_digits) {
 
            // Return the next consecutive number
            return n + 1;
        }
 
        else
            // Increment Number by 1
            n++;
    }
    return -1;
}
 
// Driver code
int main()
{
    int n = 2019;
 
    cout << nextNumberDistinctDigit(n);
 
    return 0;
}

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;
}

Convert c++ code to c online

c programm

Convert c++ code to c online

#include <iostream>
using namespace std;
int main() {
    int n,P,S;
    while (cin >> n) {
        P = 4*n; // считаем периметр квадрата
        S = n*n; // считаем площадь квадрата
        cout << P << " " << S << "\n";
    }
    return 0;
}

Similar codes

0 vote168 views1 answer
What to include in basic C
BASIC
0 vote177 views3 answers
JWT EM VBNET
BASIC
0 vote187 views2 answers
Get next/previous record
BASIC
0 vote182 views1 answer
Excel vba chck that the range is empty
BASIC
0 vote166 views1 answer
Basic murmur hash function
BASIC
1 vote301 views1 answer
How to make vbs error message box
BASIC
0 vote169 views1 answer
Split to arraylist vb.net
BASIC
0 vote181 views1 answer
Empno and marks html tables
BASIC
0 vote201 views1 answer
Hello world in basic
BASIC
0 vote173 views1 answer
Trollbox
BASIC