Programming Challenge -PKU-

Programming Challenge -PKU-内検索 / 「2535 Very Simple Problem」で検索した結果

• 2535 Very Simple Problem
  2535 Very Simple Problem 問題 http //acm.pku.edu.cn/JudgeOnline/problem?id=2535 解答例 import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int p = sc.nextInt(); int[] simplest = new int[p]; Arrays.fill(simplest,0); boolean[] hardest = new boolean[p]; Arr...
• 全掲載問題リスト
  ...ion game 2535 Very Simple Problem 2597 Line Segment Erase 2632 Crashing Robots 2633 Funny Games 2635 The Embarrassed Cryptographer 2636 Electrical Outlets 2637 WorstWeather Ever 2639 Necklace Decomposition 2640 Playground 2683 Ohgas Fortune 2684 Polygonal Line Search 2685 Numeral System 2686 Traveling by Stagecoach 2688 Cleaning Robot 2739 Sum of Consecutive Prime Numbers 2769 ...
• 2597 Line Segment Erase
  2597 Line Segment Erase 問題 http //acm.pku.edu.cn/JudgeOnline/problem?id=2597 解答例 import java.util.*; public class Main{ static int[][][] mem; public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNext()){ int n = sc.nextInt(); LineSegment ls[] = new LineSegment[n+1]; ls[0] = new LineSegment(-30000,-...
• 2505 A multiplication game
  2505 A multiplication game 問題 http //acm.pku.edu.cn/JudgeOnline/problem?id=2505 解答例 import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNext()){ long n = sc.nextLong(); int ans = solve(n); if(ans==1){ System.out.println("Stan wins."); ...
• 1413 GIGA Universe Cup
  1413 GIGA Universe Cup 問題 http //acm.pku.edu.cn/JudgeOnline/problem?id=1413 解答例 import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); double p[] = new double[9]; for(int i=0;i =8;i++) p[i] = prob(i); int n = sc.nextInt(); sc.nextLine(); for(int i=0;i n;i++){ ...
• 1125 Stockbroker Grapevine
  1125 Stockbroker Grapevine 問題 http //acm.pku.edu.cn/JudgeOnline/problem?id=1125 解答例 import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(true){ int n = sc.nextInt(); if(n==0) break; int[][] dist = new int[n][n]; for(int i=0;i n;i++){ ...
• 1256 Anagram
  1256 Anagram 解答例 import java.util.*; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); int n = sc.nextInt(); for(int c=0;c n;c++){ String original = sc.next(); int m = original.length(); char[] min = original.toCharArray(); Character...
• 1049 Microprocessor Simulation
  1049 Microprocessor Simulation 解答例 import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(true){ String input = sc.next(); if(input.charAt(0)== 8 ) break; Processor proc = new Processor(input); proc.execute(); proc.println(); } } } class...
• 2635 The Embarrassed Cryptographer
  2635 The Embarrassed Cryptographer 解答例 import java.util.*; import java.math.*; public class Main { public static void main(String[] args) { int prime[] = new int[80000]; prime[0] = 2; int cnt = 3; int index = 1; while(index 80000){ boolean flag = true; for(int i=0;i index;i++){ if(cnt%prime[i]==0){ ...
• 1017 Packets
  1017 Packets 解答例 import java.util.*; public class Main { public static void main(String args[]){ Scanner sc = new Scanner(System.in); while(true){ int p1 = sc.nextInt(); int p2 = sc.nextInt(); int p3 = sc.nextInt(); int p4 = sc.nextInt(); int p5 = sc.nextInt(); int p6 = sc.nextInt(); if (p1 + p...
• @wiki全体から「2535 Very Simple Problem」で調べる

更新順にページ一覧表示 | 作成順にページ一覧表示 | ページ名順にページ一覧表示 | wiki内検索