UVa 414 Machined Surfaces(机器加工的表面)

 Machined Surfaces 

An imaging device furnishes digital images of two machined surfaces that eventually will be assembled in contact with each other. The roughness of this final contact is to be estimated.

A digital image is composed of the two characters, "X" and " " (space). There are always 25 columns to an image, but the number of rows, N, is variable. Column one (1) will always have an "X" in it and will be part of the left surface. The left surface can extend to the right from column one (1) as contiguous X's.

Similarly, column 25 will always have an "X" in it and will be part of the right surface. The right surface can extend to the left from column 25 as contiguous X's.

Digital-Image View of Surfaces

 
		 Left     		                           Right

XXXX XXXXX tex2html_wrap_inline50

XXX XXXXXXX

XXXXX XXXX

XX XXXXXX

. .

. .

. .

XXXX XXXX

XXX XXXXXX tex2html_wrap_inline52

tex2html_wrap_inline54 tex2html_wrap_inline56

1 25

In each row of the image, there can be zero or more space characters separating the left surface from the right surface. There will never be more than a single blankregion in any row.

For each image given, you are to determine the total ``void" that will exist after the left surface has been brought into contact with the right surface. The ``void" is the total count of the spaces that remains between the left and right surfaces after theyhave been brought into contact.

The two surfaces are brought into contact by displacing them strictly horizontally towards each other until a rightmost "X" of the left surface of some row is immediately to the left of the leftmost "X" of the right surface of that row. There is no rotation or twisting of these two surfaces as they are brought into contact; they remain rigid, and only move horizontally.

Note: The original image may show the two surfaces already in contact, in which case no displacement enters into the contact roughness estimation.

Input

The input consists of a series of digital images. Each image data set has the following format:

First line -
A single unsigned integer,  N, with value greater than zero (0) and less than 13. The first digit of  N will be the first character on a line.

Next N lines -
Each line has exactly 25 characters; one or more  X's, then zero or more spaces, then one or more  X's.

The end of data is signaled by a null data set having a zero on the first line of an image data set and no further data.

Output

For each image you receive as a data set, you are to reply with the total void (count of spaces remaining after the surfaces are brought into contact). Use the default output for a single integer on a line.

Sample Input (character "B" for ease of reading. The actual input file will use the ASCII-space character, not "B").

4
XXXXBBBBBBBBBBBBBBBBXXXXX
XXXBBBBBBBBBBBBBBBXXXXXXX
XXXXXBBBBBBBBBBBBBBBBXXXX
XXBBBBBBBBBBBBBBBBBXXXXXX
2
XXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXX
1
XXXXXXXXXBBBBBBBBBBBBBBXX
0

Sample Output

4
0
0


题目大意:

	 给t行字符串,统计出共有多少空格(样例中的“B”),和每行有多少空格,然后用总的空格数-N*行最少的空格数。
	注意:自己写代码的时候注意不是读取“B”,而是读取空格!!!
	这里使用了strchr(str, c)是从开头遍历找到c第一次出现的位置;strrchr(str, c)表示从str字符串最后向前遍历,字符c第一次出现位置。
 
CODE:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

char str[14][26];
int dis[14];

int main(){
    int i, m;
    int start, end, min, total;
    char c = ' ';
    while(~scanf("%d", &m)&&m){
        getchar();
        for(i = 0; i<m; i++){
            gets(str[i]);
        }
        memset(dis, 0, sizeof(int));

        for(i = 0; i<m; i++){
            if(strchr(str[i], c)!=NULL){
                start = strchr(str[i], c);
                end = strrchr(str[i], c)+1;
                dis[i] = end-start;
            }
            else    dis[i] = 0;
        }

        min = dis[0];
        total = dis[0];
        for(i = 1; i<m; i++){
            if(min>dis[i])  min = dis[i];
            total += dis[i];
        }

        printf("%d\n", total - m*min);
    }
    return 0;
}

/*
给几个测试数据
INPUT:
4
XXXX                XXXXX
XXX               XXXXXXX
XXXXX                XXXX
XX                 XXXXXX
2
XXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXX
1
XXXXXXXXX              XX
2
XXXXXXXXXXXXXXXXXXXX XXXX
XXXXXXXXXXXXXXXXXXXXXXXXX

OUPUT:
4
0
0
1
*/


 






评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值