Convert java code to c++ online

import edu.princeton.cs.algs4.CollisionSystem;
import edu.princeton.cs.algs4.Particle;
import edu.princeton.cs.algs4.StdDraw;
public class TestAlgs4 {
    public static void main(String[] args) {
        int n = 20;  // number of particles (default 20)
        if (args.length == 1) {
            n = Integer.parseInt(args[0]);
        }
        // enable double buffering to support animations
        StdDraw.enableDoubleBuffering();
        // create the n particles
        Particle[] particles = new Particle[n];
        for (int i = 0; i < n; i++) {
            particles[i] = new Particle();}
        // simulate the system
        CollisionSystem system = new CollisionSystem(particles);
        system.simulate(Double.POSITIVE_INFINITY);
    }
}

Convert java code to c++ online

<?xml version="1.0" encoding="UTF-8"?>
<module type="JAVA_MODULE" version="4">
  <component name="NewModuleRootManager">
    <output url="file://$MODULE_DIR$" />
    <output-test url="file://$MODULE_DIR$" />
    <content url="file://$MODULE_DIR$">
      <sourceFolder url="file://$MODULE_DIR$" isTestSource="false" />
      <excludeFolder url="file://$MODULE_DIR$/.idea" />
      <excludeFolder url="file://$MODULE_DIR$/.lift" />
      <excludePattern pattern="*.iml" />
      <excludePattern pattern="*.class" />
    </content>
    <orderEntry type="inheritedJdk" />
    <orderEntry type="sourceFolder" forTests="false" />
    <orderEntry type="library" exported="" name="algs4" level="project" />
  </component>
</module>

Convert java code to c++ online

public static int findMaximum(List<Integer> arr, int m) {
            long l = 1 , r = (long)(1e9);
           
            while(l<=r){
                long mid = (l+r)/2;
                
                if(!bool(arr , mid , m)) r = mid-1;
                else l = mid+1;
            }
            
            return (int)r; 
            
    }
    static boolean bool(List<Integer> arr , long dif , int m){
        int prv = 0;
        int c = 1;
        for(int i = 1 ; i<arr.size() ; i++){
            if(arr.get(i) - arr.get(prv) >= dif){
                prv = i;
                c++;
            }
        }
        if(c>=m) return true;
        return false;
    }

Convert java code to c++ online

import java.util.Scanner;
public class num3 {
   public static void main(String[] args) {
       Scanner in = new Scanner(System.in);
       System.out.println("Enter a number between 0 and 35: ");
       int num = in.nextInt();
       if (num <= 9) {
           System.out.println(num);
       } else {
           switch (num) {
               case 10:
                   System.out.println("A");
                   break;
               case 11:
                   System.out.println("B");
                   break;
               case 12:
                   System.out.println("C");
                   break;
               case 13:
                   System.out.println("D");
                   break;
               case 14:
                   System.out.println("E");
                   break;
               case 15:
                   System.out.println("F");
                   break;
               case 16:
                   System.out.println("G");
                   break;
               case 17:
                   System.out.println("H");
                   break;
               case 18:
                   System.out.println("I");
                   break;
               case 19:
                   System.out.println("J");
                   break;
               case 20:
                   System.out.println("K");
                   break;
               case 21:
                   System.out.println("L");
                   break;
               case 22:
                   System.out.println("M");
                   break;
               case 23:
                   System.out.println("N");
                   break;
               case 24:
                   System.out.println("O");
                   break;
               case 25:
                   System.out.println("P");
                   break;
               case 26:
                   System.out.println("Q");
                   break;
               case 27:
                   System.out.println("R");
                   break;
               case 28:
                   System.out.println("S");
                   break;
               case 29:
                   System.out.println("T");
                   break;
               case 30:
                   System.out.println("U");
                   break;
               case 31:
                   System.out.println("V");
                   break;
               case 32:
                   System.out.println("W");
                   break;
               case 33:
                   System.out.println("X");
                   break;
               case 34:
                   System.out.println("Y");
                   break;
               case 35:
                   System.out.println("Z");
                   break;
           }
       }
   }
}

Source: brainly.com

Convert java code to c++ online

class Pair implements Comparable<Pair> {
    public:
      int wsf;
      string psf;

      Pair(int wsf, string psf){
         this->wsf = wsf;
         this->psf = psf;
      }

  int compareTo(Pair o){
         return this->wsf - o->wsf;
      }
  }

Convert java code to c++ online

class I{
  int i;
  public void printNum(){
    System.out.println(i);
  }
}

class J extends I{
  int j;
  public void printNum(){
    System.out.println(j);
  }
}

class Ans{
  public static void main(String[] args){
    J a = new J();
    a.i = 5;
    a.j = 7;
    a.j = a.i;
    a.printNum();
  }
}

Convert java code to c++ online

Clase CaballoSaltador
*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package CaballoSaltador;

/**
 *
 * @author SaruraiTensai
 */
public class CaballoSaltador {

    static final int N = 8;
    static final int n = (N + 1);
    private int[][] tablero = new int[n][n];
    private boolean exito;
    private int[][] SALTO = {{2, 1}, {1, 2}, {-1, 2}, {-2, 1},
    {-2, -1}, {-1, -2}, {1, -2}, {2, -1}};
    private int x0, y0;
// constructor

    public CaballoSaltador(int x, int y) throws Exception {
        if ((x < 1) || (x > N)
                || (y < 1) || (y > N)) {
            throw new Exception("Coordenadas fuera de rango");
        }
        x0 = x;
        y0 = y;
        for (int i = 1; i <= N; i++) {
            for (int j = 1; j <= N; j++) {
                tablero[i][j] = 0;
            }
        }
        tablero[x0][y0] = 1;
        exito = false;
    }

    public boolean resolverProblema() {
        saltoCaballo(x0, y0, 2);
        return exito;
    }

    private void saltoCaballo(int x, int y, int i) {
        int nx, ny;
        int k;
        k = 0; // inicializa el conjunto de posibles movimientos
        do {
            k++;
            nx = x + SALTO[k - 1][0];
            ny = y + SALTO[k - 1][1];
// determina si nuevas coordenadas son aceptables
            if ((nx >= 1) && (nx <= N) && (ny >= 1) && (ny <= N)
                    && (tablero[nx][ny] == 0)) {
                tablero[nx][ny] = i; // anota movimiento
                if (i < N * N) {
                    saltoCaballo(nx, ny, i + 1);
// se analiza si se ha completado la solución
                    if (!exito) { // no se alcanzó la solución
                        tablero[nx][ny] = 0; // se borra anotación
                    }
                } else {
                    exito = true; // tablero cubierto
                }
            }
        } while ((k < 8) && !exito);
    }
//muestra por pantalla los pasos del caballo

    void escribirTablero() {
        for (int i = 1; i <= N; i++) {
            for (int j = 1; j <= N; j++) {
                System.out.print(tablero[i][j] + " ");
            }
            System.out.println();
        }
    }
}

Convert java code to c++ online

package no2;
import javax.swing.JOptionPane;
public class nama {
     public static void main(String[]args){
         String a = JOptionPane.showInputDialog("Masukkan nama :");
         String b = JOptionPane.showInputDialog("Masukkan jumlah angka :");
         String hasil ="";
         for(int i=0;i<Integer.parseInt(b);i++){
             hasil +="nama : "+a+"\n";
         }
      
         JOptionPane.showMessageDialog(null,hasil);
         
                
             
         }
        }

Convert java code to c++ online

import java.util.Scanner;

public class Sum_OrProduct {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int num = sc.nextInt();
        int choice = sc.nextInt();
        int sum = 0, prod = 1;
        for (int i = 1; i <= num; i++) {
            if (choice == 1) {
                sum = sum + i;
            } else if (choice == 2) {
                prod = prod * i;
            } else {
                System.out.println(-1);
            }
        }
        System.out.println(sum);
        System.out.println(prod);
    }

}

Convert java code to c++ online

 " + coded);
		// decode it back
		System.out.println(" Decoded: " + adfgvx.decode(coded));
		//---------------------------------------------
		// end of automatic tests
		//---------------------------------------------
		
		// now proceed with user input
		Scanner scan = new Scanner(System.in);
		System.out.print("\n    Enter a Key: ");
		String key = scan.nextLine();
		Adfgvx user = new Adfgvx(key);
		System.out.print("Enter a message: ");
		String msg = scan.nextLine();
		// dump the grid
		user.dumpGrid();
		System.out.println("  Key is: " + user.key);
		System.out.println("Original: " + msg);
		String cypher = user.encode(msg);
		System.out.println("   Coded: " + cypher);
		System.out.println(" Decoded: " + user.decode(cypher));
	}

	/**
	 * An internal class to hold the data (the character of each column)
	 * it implements comparable so the column could be sorted by alpahbetical order
	 */
	private class Column implements Comparable<Column> {

		// the letter A D F G V X at the head of the column
		private char header;
		// all the letters in the column
		private char[] letters;
		// use when we cumulate the digits in the letters array
		private int index;

		/**
		 * Constructor that receives the letter as header
		 */
		Column(char header) {
			this.header = header;
		}
		/**
		 * To set the number of elements in the column
		 */
		void setSize(int size) {
			// build array to receive all elements
			letters = new char[size];
			// reset that we are at element 0
			index = 0;
		}
		/** 
		 * To return, while decoding, the number of characters to insert in the Column
		 */
		int getSize() {
			return letters.length;
		}
		/**
		 * To add a letter to the column
		 */
		void add(char c) {
			letters[index++] = c;
		}
		/** 
		 * To get a single letter
		 */
		char getChar(int n) {
			return letters[n];
		}
		/**
		 * To return as a String the letters in the column
		 */
		public String toString() {
			return new String(letters);
		}
		
		/**
		 * To sort the columns by header
		 */
		public int compareTo(Column other) {
			return header - other.header;
		}
	}

}

Similar codes

0 vote303 views1 answer
Case 1 or 2 c++
C++
0 vote352 views1 answer
Rectangle Area hackerrank in c++
C++
2 votes434 views1 answer
C++ string to integer without stoi
C++
0 vote327 views1 answer
C++ find with predicat
C++
2 votes387 views1 answer
Recursive binary search
C++
0 vote348 views1 answer
What algorithm does bitcoin use
C++
0 vote366 views1 answer
Cmake g++ address sanitizer
C++
0 vote378 views1 answer
Printing in column c++
C++
0 vote378 views1 answer
Cpp pass function with input to thread
C++
2 votes336 views1 answer
Unordered_map of pair and int
C++