zoukankan      html  css  js  c++  java
  • UVA-201 Squares

    A children’s board game consists of a square array of dots that contains lines connecting some of the
    pairs of adjacent dots. One part of the game requires that the players count the number of squares of
    certain sizes that are formed by these lines. For example, in the figure shown below, there are 3 squares
    — 2 of size 1 and 1 of size 2. (The “size” of a square is the number of lines segments required to form
    a side.)
    Your problem is to write a program that automates the process of counting all the possible squares.
    Input
    The input file represents a series of game boards. Each board consists of a description of a square array
    of n
    2 dots (where 2 ≤ n ≤ 9) and some interconnecting horizontal and vertical lines. A record for a
    single board with n
    2 dots and m interconnecting lines is formatted as follows:
    Line 1: n the number of dots in a single row or column of the array
    Line 2: m the number of interconnecting lines
    Each of the next m lines are of one of two types:
    H i j indicates a horizontal line in row i which connects
    the dot in column j to the one to its right in column j + 1
    or
    V i j indicates a vertical line in column i which connects
    the dot in row j to the one below in row j + 1
    Information for each line begins in column 1. The end of input is indicated by end-of-file. The first
    record of the sample input below represents the board of the square above.
    Output
    For each record, label the corresponding output with ‘Problem #1’, ‘Problem #2’, and so forth. Output
    for a record consists of the number of squares of each size on the board, from the smallest to the largest.
    lf no squares of any size exist, your program should print an appropriate message indicating so. Separate
    output for successive input records by a line of asterisks between two blank lines, like in the sample
    below.
    Sample Input
    4
    16
    H 1 1
    H 1 3
    H 2 1
    H 2 2
    H 2 3
    H 3 2
    H 4 2
    H 4 3
    V 1 1
    V 2 1
    V 2 2
    V 2 3
    V 3 2
    V 4 1
    V 4 2
    V 4 3
    2
    3
    H 1 1
    H 2 1
    V 2 1
    Sample Output
    Problem #1
    2 square (s) of size 1
    1 square (s) of size 2
    **********************************
    Problem #2
    No completed squares can be found
    #include<iostream>
    #include<cstdio>
    #include<cstdlib>
    #include<cstring>
    #include<cmath>
    using namespace std;
    int v[10][10],h[10][10];
    int sj[10];
    int test=0;
    int judge(int l,int x,int y)//遍历每个点,每种长度
    {
    	for(int i=x;i<x+l;i++)
    	{
    		if(v[i][y]==0||v[i][y+l]==0)//注意v[][]上的点要倒着看
    			return 0;
    	}
    	for(int j=y;j<y+l;j++)
    	{
    		if(h[x][j]==0||h[x+l][j]==0)
    			return 0;
    	}
    	return 1;
    }
    int main(int argc, char const *argv[])
    {
    	int a,b;
    	int N,M;
    	int flag;
    	char ch;
    	while(~scanf("%d%d",&N,&M))
    	{
    	   
    		memset(v,0,sizeof(v));
    		memset(h,0,sizeof(h));
    		memset(sj,0,sizeof(sj));
    		flag=0;
    	    for(int i=1;i<=M;i++)
    	    {
    	    	cin>>ch>>a>>b;
    	    	if('H'==ch)
    	    	    h[a][b]=1;
    	        else
    	        	v[b][a]=1;
    	    }
    	    for(int l=1;l<N;l++)//正方形边长
    	    {   <i,j>为正方形左上角的端点
    	    	for(int i=1;i<=N-l;i++)
    	    	{
    	    		for(int j=1;j<=N-l;j++)
    	    		{
    	    			if(judge(l,i,j))
    	    				sj[l]++;
    	    		}
    	    	}
    	    }
    	    if(test!=0)
    	    {
    	    	printf("
    **********************************
    
    ");
    	    }
    	    printf("Problem #%d
    
    ",++test);
    	    for(int i=1;i<N;i++)
    	    {
    	    	if(sj[i]!=0)
    	       {
                  flag=1;
    	          printf("%d square (s) of size %d
    ",sj[i],i);
    	       }
    	    }
    	    if(0==flag)
    	    	printf("No completed squares can be found.
    ");
    	}
    	return 0;
    }
    

  • 相关阅读:
    银联支付集成之 ---- 安卓
    在Mac系统下配置PHP运行环境
    ios工程中一天只让显示一次的广告,或是弹出窗,如何实现
    iOS工程中一天只让进行一次的操作如何做?
    简单实现UIlabel可复制功能
    iOS添加测试设备与调试
    iOS-最全的App上架教程
    javaIO--文件操作类
    javaIO--字符流
    javaIO--字节流
  • 原文地址:https://www.cnblogs.com/kuroko-ghh/p/9363349.html
Copyright © 2011-2022 走看看