| Task: | Lehmät | 
| Sender: | lompakkomies | 
| Submission time: | 2022-10-31 14:29:00 +0200 | 
| Language: | Java | 
| Status: | READY | 
| Result: | 100 | 
| group | verdict | score | 
|---|---|---|
| #1 | ACCEPTED | 28 | 
| #2 | ACCEPTED | 72 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.13 s | 1, 2 | details | 
| #2 | ACCEPTED | 0.13 s | 1, 2 | details | 
| #3 | ACCEPTED | 0.13 s | 1, 2 | details | 
| #4 | ACCEPTED | 0.13 s | 1, 2 | details | 
| #5 | ACCEPTED | 0.13 s | 1, 2 | details | 
| #6 | ACCEPTED | 0.16 s | 2 | details | 
| #7 | ACCEPTED | 0.16 s | 2 | details | 
| #8 | ACCEPTED | 0.16 s | 2 | details | 
| #9 | ACCEPTED | 0.15 s | 2 | details | 
Code
import java.util.Scanner;
public class Lehmat {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int heigth = scan.nextInt();
        int width = scan.nextInt();
        scan.nextLine();
        String[][] map = new String[heigth][width];
        String mapLine = new String();
        for(int i = 0; i < heigth; i++) {
            mapLine = scan.nextLine();
            for(int j = 0; j < width; j++) {
                map[i][j] = mapLine.substring(j,j+1);
            }
        }
        /*for(int i = 0; i < heigth; i++) {
            for(int j = 0; j < width; j++) {
                System.out.print(map[i][j]);
            }
            System.out.print("\n");
        }*/
        int minWidth = width, maxWidth = 0;
        int minHeigth = heigth, maxHeigth = 0;
        for(int i = 0; i < heigth; i++) {
            for(int j = 0; j < width; j++) {
                if(map[i][j].equals("*")) {
                    minWidth = Math.min(minWidth,j);
                    minHeigth = Math.min(minHeigth,i);
                    maxWidth = Math.max(maxWidth,j);
                    maxHeigth = Math.max(maxHeigth,i);
                }
            }
        }
        /*System.out.println(minWidth + " " + maxWidth);
        System.out.println(minHeigth + " " + maxHeigth);
        System.out.print("\n");*/
        int cows = 0;
        for(int i = minHeigth; i <= maxHeigth; i++) {
            for(int j = minWidth; j <= maxWidth; j++) {
                //System.out.print(map[i][j]);
                if(map[i][j].equals("@")) {
                    cows++;
                }
            }
            //System.out.print("\n");
        }
        System.out.println(cows);
    }
}Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 3 3 *** *.* ***  | 
| correct output | 
|---|
| 0 | 
| user output | 
|---|
| 0 | 
Test 2
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 3 3 *** *@* ***  | 
| correct output | 
|---|
| 1 | 
| user output | 
|---|
| 1 | 
Test 3
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 5 10 ...@...... ..******.. @.*@@@@*.@ ..******.. ...  | 
| correct output | 
|---|
| 4 | 
| user output | 
|---|
| 4 | 
Test 4
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 10 10 @@...@.@@@ ..@@.@@..@ @.*******@ ..*@....*. ...  | 
| correct output | 
|---|
| 11 | 
| user output | 
|---|
| 11 | 
Test 5
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 10 10 ********** *@@@@@@@@* *@@@@@@@@* *@@@@@@@@* ...  | 
| correct output | 
|---|
| 64 | 
| user output | 
|---|
| 64 | 
Test 6
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 100 100 .........................@.......  | 
| correct output | 
|---|
| 60 | 
| user output | 
|---|
| 60 | 
Test 7
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 100 100 ..@@..........@......@....@@.....  | 
| correct output | 
|---|
| 1507 | 
| user output | 
|---|
| 1507 | 
Test 8
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 100 100 .@..@@..@@.@..@..@..@@..@..@.....  | 
| correct output | 
|---|
| 3348 | 
| user output | 
|---|
| 3348 | 
Test 9
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 100 100 @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@...  | 
| correct output | 
|---|
| 7225 | 
| user output | 
|---|
| 7225 | 
