亚洲AV日韩AⅤ综合手机在线观看,激情婷婷久久综合色,欧美色五月婷婷久久,久久国产精品99久久人人澡

  • <abbr id="uk6uq"><abbr id="uk6uq"></abbr></abbr>
  • <tbody id="uk6uq"></tbody>
  • ccf認(rèn)證考試試題答案

    時(shí)間:2024-10-10 07:17:59 IBM認(rèn)證 我要投稿
    • 相關(guān)推薦

    ccf認(rèn)證考試試題答案

      CCF,中國計(jì)算機(jī)學(xué)會(huì),英文全稱為China Computer Federation,簡稱CCF,成立于1962年,是中國計(jì)算機(jī)科學(xué)與技術(shù)領(lǐng)域群眾性學(xué)術(shù)團(tuán)體,屬一級學(xué)會(huì),獨(dú)立法人單位,是中國科學(xué)技術(shù)協(xié)會(huì)的成員。下面是小編整理的關(guān)于ccf認(rèn)證考試試題答案,歡迎大家參考!

    ccf認(rèn)證考試試題答案

      1. 出現(xiàn)次數(shù)最多的數(shù)

      import java.util.*;

      public class Main {

      public static void main(String[] args) {

      new Main().run();

      }

      public void run() {

      Scanner fin = new Scanner(System.in);

      int N = fin.nextInt();

      int[] count = new int[10001];

      for (int i = 0; i < N; ++i) {

      ++count[fin.nextInt()];

      }

      int maxCount = -1;

      int result = 0;

      for (int i = 1; i <= 10000; ++i) {

      if (count[i] > maxCount) {

      maxCount = count[i];

      result = i;

      }

      }

      System.out.println(result);

      }

      }

      2.ISBN號碼

      import java.io.BufferedReader;

      import java.io.InputStreamReader;

      public class Main {

      } public static void main(String args[]) { } BufferedReader bin = new BufferedReader(new InputStreamReader(System.in)); try{ } int sum=0;char cc='0'; String isbn_0 = bin.readLine(); String isbn = isbn_0.replace("-", ""); for(int i=0; i<9; i++){ } sum = sum % 11; if(sum == 10) cc = 'X';// else cc = (char)(sum+48); if(cc == isbn.charAt(9)) System.out.println("Right"); else{ } e.printStackTrace(); isbn_0 = isbn_0.substring(0,12) + cc; System.out.println(isbn_0); int ii = (int)isbn.charAt(i)-48; sum += ii * (i+1); }catch(Exception e){

      3.最大的矩形

      import java.util.*;

      public class Main {

      public static void main(String[] args) {

      new Main().run();

      }

      public void run() {

      Scanner fin = new Scanner(System.in);

      int N = fin.nextInt();

      int[] height = new int[N];

      for (int i = 0; i < N; ++i) height[i] = fin.nextInt();

      int result = 0;

      for (int i = 0; i < N; ++i) {

      int width = 1;

      for (int j = i - 1; j >= 0; --j) {

      if (height[j] < height[i]) break;

      ++width;

      }

      for (int j = i + 1; j < N; ++j) {

      if (height[j] < height[i]) break;

      ++width;

      }

      int area = width * height[i];

      result = Math.max(result, area);

      }

      System.out.println(result);

      }

      }

      4.有趣的數(shù)

      import java.util.*;

      public class Main {

      public static void main(String[] args) {

      new Main().run();

      }

      public void run() {

      Scanner fin = new Scanner(System.in);

      int N = fin.nextInt();

      long[] count = new long[8];

      count[6] = 0;

      count[7] = 1;

      long mod = 1000000007;

      for (int i = 2; i <= N; ++i) {

      long[] newCount = new long[8];

      newCount[0] = (count[0] * 2 + count[1] + count[3]) % mod; newCount[1] = (count[1] * 2 + count[2] + count[5]) % mod; newCount[2] = (count[2] + count[6]) % mod;

      newCount[3] = (count[3] * 2 + count[4] + count[5]) % mod; newCount[4] = (count[4] + count[7]) % mod;

      newCount[5] = (count[5] * 2 + count[6] + count[7]) % mod; newCount[6] = 0;

      newCount[7] = 1;

      count = newCount;

      }

      System.out.println(count[0]);

      }

      }

      5.I’m stuck!

      import java.util.*;

      public class Main {

      public static void main(String[] args) {

      new Main().run();

      }

      public void run() {

      Scanner fin = new Scanner(System.in);

      int R = fin.nextInt();

      int C = fin.nextInt();

      fin.nextLine();

      int[][] board = new int[R + 2][C + 2];

      int rowStart = 0, colStart = 0, rowEnd = 0, colEnd = 0; for (int i = 1; i <= R; ++i) {

      String line = fin.nextLine();

      for (int j = 1; j <= C; ++j) {

      char c = line.charAt(j - 1);

      switch (c) {

      case '#': break;

      case '-': board[i][j] = 5; break;

      case '|': board[i][j] = 0xA; break;

      case '+':

      case 'S':

      case 'T':

      board[i][j] = 0xF; break; case '.': board[i][j] = 0x8; break;

      default: break;

      }

      if (c == 'S') {

      rowStart = i;

      colStart = j;

      } else if (c == 'T') {

      rowEnd = i;

      colEnd = j;

      }

      }

      }

      int[] dr = new int[] {0, -1, 0, 1};

      int[] dc = new int[] {1, 0, -1, 0};

      // Scan 1: find all cells which can reach T

      boolean[][] visited = new boolean[R + 2][C + 2]; boolean[][] canReachT = new boolean[R + 2][C + 2]; initVisited(visited);

      canReachT[rowEnd][colEnd] = true;

      visited[rowEnd][colEnd] = true;

      Queue queue = new LinkedList(); queue.add(rowEnd);

      queue.add(colEnd);

      while (!queue.isEmpty()) {

      int r = queue.remove();

      int c = queue.remove();

      for (int i = 0; i < 4; ++i) {

      int nr = r + dr[i];

    【ccf認(rèn)證考試試題答案】相關(guān)文章:

    IBM認(rèn)證考試認(rèn)證體系01-20

    微軟認(rèn)證考試最新認(rèn)證01-13

    微軟認(rèn)證考試技巧:MCSA認(rèn)證考試經(jīng)驗(yàn)01-13

    思科認(rèn)證CCNA認(rèn)證考試簡介06-08

    SUN認(rèn)證考試流程01-15

    Oracle認(rèn)證考試技巧03-19

    華為認(rèn)證考試地址03-19

    微軟認(rèn)證考試介紹01-10

    思科認(rèn)證考試介紹01-12