zoukankan      html  css  js  c++  java
  • codeforces 629A Far Relative’s Birthday Cake

    A. Far Relative’s Birthday Cake
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Door's family is going celebrate Famil Doors's birthday party. They love Famil Door so they are planning to make his birthday cake weird!

    The cake is a n × n square consisting of equal squares with side length 1. Each square is either empty or consists of a single chocolate. They bought the cake and randomly started to put the chocolates on the cake. The value of Famil Door's happiness will be equal to the number of pairs of cells with chocolates that are in the same row or in the same column of the cake. Famil Doors's family is wondering what is the amount of happiness of Famil going to be?

    Please, note that any pair can be counted no more than once, as two different cells can't share both the same row and the same column.

    Input

    In the first line of the input, you are given a single integer n (1 ≤ n ≤ 100) — the length of the side of the cake.

    Then follow n lines, each containing n characters. Empty cells are denoted with '.', while cells that contain chocolates are denoted by 'C'.

    Output

    Print the value of Famil Door's happiness, i.e. the number of pairs of chocolate pieces that share the same row or the same column.

    Examples
    input
    3
    .CC
    C..
    C.C
    output
    4
    input
    4
    CC..
    C..C
    .CC.
    .CC.
    output
    9
    Note

    If we number rows from top to bottom and columns from left to right, then, pieces that share the same row in the first sample are:

    1. (1, 2) and (1, 3)
    2. (3, 1) and (3, 3)
    Pieces that share the same column are:
    1. (2, 1) and (3, 1)
    2. (1, 3) and (3, 3)

    题意:一个矩形的蛋糕,C代表巧克力,点(.)代表什么也没有,每一行或者每一列的巧克力的对数代表幸福值,问题目中所给数据的幸福值是多少

    题解:记录每一行每一列的C的个数x,然后对其求组合C(x,2)即可,将所有的组合数相加

    #include<stdio.h>
    #include<string.h>
    #include<string>
    #include<math.h>
    #include<algorithm>
    #define LL long long
    #define PI atan(1.0)*4
    #define DD double
    #define MAX 110
    #define mod 10007
    #define dian 1.000000011
    #define INF 0x3f3f3f
    using namespace std;
    char s[MAX][MAX];
    int row[MAX],col[MAX];
    int main()
    {
        int n,m,j,i,t;
    	while(scanf("%d",&t)!=EOF)
    	{
    		memset(row,0,sizeof(row));//记录每行C的个数 
    		memset(col,0,sizeof(col));//记录每列C的个数 
    		for(i=0;i<t;i++)
    		    scanf("%s",s[i]);
    		for(i=0;i<t;i++)
    		{
    			for(j=0;j<t;j++)
    			{
    				if(s[i][j]=='C')
    				    row[i]++;
    				if(s[j][i]=='C')
    				{
    					//printf("%d %d#
    ",j,i);
    					col[i]++;
    				}
    				    
    			}	
    		}
    		int sum=0;
    		for(i=0;i<t;i++)
    		{
    			//printf("%d
    %d*
    ",row[i],col[i]);
    			sum+=(row[i]*(row[i]-1))/2;//求组合数 
    			sum+=(col[i]*(col[i]-1))/2;
    		}
    		printf("%d
    ",sum);
    	} 
    	return 0;
    } 
    

      

  • 相关阅读:
    ES查询直方图聚合区间结果min越界问题
    yarn命令操作
    Hve on Spark left join的hashTable问题
    基于HUE可视化的大数据权限管理
    Android 制作圆角阴影的卡片
    Android 解决问题“Failed to resolve: com.android.support:design:26.1.0”
    Android 修改虚拟键栏背景颜色
    ArrayList的传值问题
    swift 网络请求中含有特殊字符的解决方案
    Android适配器
  • 原文地址:https://www.cnblogs.com/tonghao/p/5234984.html
Copyright © 2011-2022 走看看