CCF计算机软件能力认证201512前两题java满分解

第一题

package ccf201512;

import java.util.Scanner;

public class p1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String n = sc.next();
        int count = 0;
        for (int i = 0; i < n.length(); i++) {
            count += Integer.parseInt(String.valueOf(n.charAt(i)));
        }
        System.out.println(count);
    }
}

第二题

package ccf201512;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class p2 {
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        String[] temp = bf.readLine().split(" ");
        int n = Integer.parseInt(temp[0]);
        int m = Integer.parseInt(temp[1]);
        int[][][] xy = new int[n][m][2];
        for (int i = 0; i < n; i++) {
            String[] line = bf.readLine().split(" ");
            for (int j = 0; j < m; j++) {
                xy[i][j][0] = Integer.parseInt(line[j]);
                xy[i][j][1] = 1;
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 1; j < m - 1; j++) {
                if (xy[i][j][0] == xy[i][j - 1][0] && xy[i][j][0] == xy[i][j + 1][0]) {
                    xy[i][j - 1][1] = 0;
                    xy[i][j][1] = 0;
                    xy[i][j + 1][1] = 0;
                }
            }
        }

        for (int j = 0; j < m; j++) {
            for (int i = 1; i < n - 1; i++) {
                if (xy[i][j][0] == xy[i - 1][j][0] && xy[i][j][0] == xy[i + 1][j][0]) {
                    xy[i - 1][j][1] = 0;
                    xy[i][j][1] = 0;
                    xy[i + 1][j][1] = 0;
                }
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (xy[i][j][1] == 0) {
                    System.out.print(0 + " ");
                } else {
                    System.out.print(xy[i][j][0] + " ");
                }
            }
            System.out.println();
        }
    }
}
  • 4
    点赞
  • 6
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值