牛客编程题（十）

//https://www.nowcoder.com/practice/caf35ae421194a1090c22fe223357dca?tpId=37&&tqId=21330&rp=1&ru=/ta/huawei&qru=/ta/huawei/question-ranking

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Main4{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()) {
			int xx = sc.nextInt();
			double x1 = Math.pow(xx, 2.0/3);
			double x2 = Math.sqrt(x1);
			System.out.println(String.format("%.1f", x2));
		}
	}

}

//https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4?tpId=13&tags=&title=&diffculty=0&judgeStatus=0&rp=1

public class Main5 {
	public static void main(String[] args) {

	}

	public int JumpFloor(int target) {
		if (target == 1) {
			return 1;
		}
		if (target == 0) {
			return 0;
		}
		if (target == 2) {
			return 2;
		}
		int[] dp = new int[target + 1];
		dp[1] = 1;
		dp[2] = 2;
		for (int i = 3; i <= target; i++) {
			dp[i] = dp[i - 1] + dp[i - 2];
		}
		return dp[target];

	}

}

//https://www.nowcoder.com/practice/bc62febdd1034a73a62224affe8bddf2?tpId=122&tags=&title=&diffculty=0&judgeStatus=0&rp=1

import java.util.Scanner;

public class Main7 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String x1 = sc.next();
	    String x2 = sc.next();
	    int res = XX(x1)+XX(x2);
	    System.out.println(XX(String.valueOf(res)));	
	}
	public static int XX(String number) {
		StringBuilder str = new StringBuilder(number);
		 String str1 = str.reverse().toString();
		return Integer.parseInt(str1);
	}

}

//https://www.nowcoder.com/practice/fc72d3493d7e4be883e931d507352a4a?tpId=122&&tqId=33694&rp=1&ru=/ta/exam-wangyi&qru=/ta/exam-wangyi/question-ranking

import java.util.Scanner;

public class Main8 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int times = sc.nextInt();
		String str = sc.next();
		char[] c = str.toCharArray();
		for(int i=0;i<c.length;i++) {
			c[i]=str.charAt(i);
		}
		int totalL=0;
		int totalR=0;
		for(int i=0;i<c.length;i++) {
			if(c[i]=='L') {
				totalL++;
			}
			else
				totalR++;
		}
		int res ;
		if(totalL>totalR) {
			res = (totalL-totalR)%4;
			switch (res) {
			case 0:
				System.out.println("N");
				break;
			case 1 :
				System.out.println("W");
				break;
			case 2:
				System.out.println("S");
				break;
			case 3:
				System.out.println("E");
				break;
			default:
				break;
			}
		}else {
			res = (totalR-totalL)%4;
			switch (res) {
			case 0:
				System.out.println("N");
				break;
			case 1 :
				System.out.println("E");
				break;
			case 2:
				System.out.println("S");
				break;
			case 3:
				System.out.println("W");
				break;
			default:
				break;
			}
			
		}
	}

}

//https://www.nowcoder.com/practice/5af18ba2eb45443aa91a11e848aa6723?tpId=37&&tqId=21237&rp=1&ru=/ta/huawei&qru=/ta/huawei/question-ranking

import java.util.Arrays;
import java.util.Scanner;

public class Main9 {
	 public static void main(String[] args) {
	  Scanner sc = new Scanner(System.in);
	  int xx = sc.nextInt();
	  String[] str = new String[xx];
	  for(int i=0;i<str.length;i++) {
		  str[i] = sc.next();
	  }
	  Arrays.sort(str);
	  for(int i=0;i<str.length;i++) {
		  System.out.println(str[i]);
	  }
	 }
}

//https://www.nowcoder.com/practice/440f16e490a0404786865e99c6ad91c9?tpId=37&tqId=21237&rp=1&ru=%2Fta%2Fhuawei&qru=%2Fta%2Fhuawei%2Fquestion-ranking

import java.util.Scanner;

public class Main0 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int number = sc.nextInt();
		String xx = String.valueOf(Integer.toBinaryString(number));
		char[] c = xx.toCharArray();
		for(int i=0;i<c.length;i++) {
			c[i]=xx.charAt(i);
		}
		int total=0;
		for(int i=0;i<c.length;i++) {
			if(c[i]=='1') {
				total++;
			}
		}
		System.out.println(total);
	}

}

//https://www.nowcoder.com/practice/d7764905e41a413c98900e22a9cc4ec3?tpId=122&tags=&title=&diffculty=0&judgeStatus=0&rp=1

import java.util.Scanner;

public class Main2 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int[] array = new int[26];
		for (int i = 0; i < array.length; i++) {
			array[i] = sc.nextInt();
		}
		String str = sc.next();//输入字符串
		int x = 1;
		int y = 0;
		for (int i = 0; i < str.length(); i++) {
			y = y + array[(int)str.charAt(i) - 'a'];//a=97,字符可以进行相加减,这样得到的就与之前输入字符大小相匹配了
			if (y == 100 && i < str.length() - 1) {
				y = 0;
				x++;
			} else if (y > 100) {
				y = array[str.charAt(i) - 'a'];
				x++;
			}
		}
		System.out.print(x+" "+y);
		
	}

}

//https://www.nowcoder.com/practice/a0e34486102948a7b5e8b7b6d76cee96?tpId=185&&tqId=34903&rp=1&ru=/ta/weeklycontest-history&qru=/ta/weeklycontest-history/question-ranking

import java.util.Scanner;

public class Main3 {
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		System.out.println(solve(n, m));
	}
	public static int solve(int n, int m) {
		if(n>m) {
			return n-m;
		}
		if(n<m) {
			if(n*n>m) {
				int x = (int)Math.sqrt(m);
				if((n-x+1)+(m-x*x)<m-n) {
					return (n-x+1)+(m-x*x);
				}
				else
				return m-n;
			}
			else if(n*n<m) {
				if(n==1) {
					int x =(int) Math.sqrt(m);
					return (x-1)+1+(m-x*x);
				}
				int x = 1;
				int res = n*n;
				while(res<m) {
					res=(int)Math.pow(res, 2);
					x++;
				}
				return x-1+(m-(int)Math.sqrt(res));
			}
			else {
				return 1;
			}	
		}
		else
       return 0;
    }
}