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

package com.company;
import java.util.Random;
import java.util.Scanner;
public class Main {public static void main(String[] args) {Scanner in = new Scanner(System.in);System.out.println("n=");
        int n = in.nextInt();int a[][] = new int[n][n];Random u = new Random();
        for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { a[i][j] = u.nextInt(10);
                System.out.print(a[i][j]+"\t");}  System.out.println();}int C=0;
        System.out.println();for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) {
                if((j>=i)&&i+j<=n-1){System.out.print(a[i][j]+"\t");C+=a[i][j];
                }else if (j<=i && i+j>=n-1){  System.out.print(a[i][j]+"\t");C+=a[i][j];
                } else {
                    System.out.print("\t");     }
            }
            System.out.println();
        }
        System.out.println("C="+C);

    }
}0

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

import java.util.*;

class Pair{
	int totalNodes, totalSum;
	Pair(int total, int sum){
		this.totalNodes = total;
		this.totalSum = sum;
	}
}

class MaxTenureFinder
{
	public static Pair findHighestTenure(HashMap<Integer, ArrayList<Integer>> hmap, int V){
		if(hmap.get(V).size() == 0){
			return new Pair(1, V);
		}
		else{
			int totalNodesCount = 1;
			int totalSum = V;
			for(int i=0;i<hmap.get(V).size();i++){
				Pair temp = findHighestTenure(hmap, hmap.get(V).get(i));
				totalNodesCount += temp.totalNodes;
				totalSum += temp.totalSum;
			}
			
			if(totalSum * maxSum.totalNodes >= maxSum.totalSum * totalNodesCount){ // logic to avoid precision error
				maxSum.totalNodes = totalNodesCount;
				maxSum.totalSum = totalSum;
				maxTenureNode = V;
			}
			
			return new Pair(totalNodesCount, totalSum);
		}
	}
	
	public static int maxTenureNode;
	public static Pair maxSum;
	
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		
		HashMap<Integer, ArrayList<Integer>> hmap = new HashMap<> ();
		
		for(int i=0;i<n;i++){
			int parent = sc.nextInt();
			int child = sc.nextInt();
			if(hmap.containsKey(parent)){
				hmap.get(parent).add(child);
			}
			else{
				ArrayList<Integer> temp = new ArrayList<> ();
				temp.add(child);
				hmap.put(parent, temp);
			}
			if(!hmap.containsKey(child)){
				hmap.put(child, new ArrayList<> ());
			}
		}
		int parentNode = sc.nextInt();
		maxSum = new Pair(0, 0);
		maxTenureNode = -1;
		findHighestTenure(hmap, parentNode);
		System.out.println(maxTenureNode);
	}
}

Convert java code to c++ online

import java.util.List;
import java.util.ArrayList;

public class Josephus {
    public static <T> List<T> josephusPermutation(final List<T> items, final int k) {
        List<T> res = new ArrayList<T>();
        int count = items.size();
        int i = 0;
        while(count > 0){
            i = (i + k - 1)%items.size();
            res.add(items.remove(i));
            count--;
        }
        return res;
    }
}

Convert java code to c++ online

    public static File bitmapExist(String bitMapName) {
        File appDir = FileUtils.getExternalFilesDir(AppConfig.getApplication(), BODY_VIEW_CACHE_DIR);
        if (appDir == null) {
            return null;
        }
        
        if (!appDir.exists()) {
            appDir.mkdir();
            return null;
        }
        File file = new File(appDir, bitMapName);
        if (file.exists()) {
            return file;
        }
        return null;
    }

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

}

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

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

public int rotatedWords(String input1, int input2) {
    int c= 0;
    String arr[] = input1.split(" ");
    if (input1 != null && !input1.isEmpty()) {
        for (int i = 0; i < arr.length; i++) {
            String s1 = arr[i] + arr[i];
            int start = arr[i].length() - input2;

            System.out.println("arr[i] : " + arr[i]);
            String s2 = s1.substring(start, start + arr[i].length());
            System.out.println("s2 : " + s2);
            if (s2.equalsIgnoreCase(arr[i])) {
                count++;
            }
        }
    }
    return count;
}

Similar codes

0 vote270 views1 answer
Spring jpa add field to many to many table
Java Spring
0 vote199 views1 answer
Add SOSL to apex Example
Java
7 votes200 views2 answers
How to know java version in cmd
Java
1 vote203 views2 answers
Java setinterval equivalent
Java
0 vote188 views1 answer
Builtin calculator for edittext
Java
0 vote199 views2 answers
How to check if a string contains only alphabets and space in java
Java
-2 votes197 views1 answer
Java anagrams
Java
1 vote199 views1 answer
Check if a char is a space java
Java
0 vote198 views1 answer
Java Tiempo transcurrido entre fechas y horas
Java
1 vote199 views1 answer
Java interfce
Java