Codeforces Round #343 (Div. 2) 总结

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)

1. (1, 3) and (3, 3)
2. 题意：就是有n行n列，从行上面计算C的个数，然后sum+=C(ans,2),同理，列：sum+=C(n,2);

3. #include<stdio.h>
   #include<string.h>
   #include<string>
   #include<iostream>
   #include<map>
   #include<algorithm>
   using namespace std;
   #define LL __int64
   const LL maxm=1e3+10;
   char s[maxm][maxm];
   LL C(LL m,LL n)
   {
       if(n>m)
           return 0;
       LL ans=1;
       for(LL i=1;i<=n;i++)
       {
           ans*=m+1-i;
           ans/=i;
       }
       return ans;
   }
   int main()
   {
       LL n;
       while(scanf("%I64d",&n)!=EOF)
       {
           for(LL i=0;i<n;i++)
           {
               scanf("%s",s[i]);
           }
           LL sum=0;
           for(LL i=0;i<n;i++)
           {
               LL ans=0;
               for(LL j=0;j<n;j++)
               {
                   if(s[i][j]=='C')
                   {
                       ans++;
                   }
               }
               if(ans==1||ans==0)
                   continue;
               else if(ans==2)
                   sum++;
               else
                   sum+=C(ans,2);
           }
           for(LL i=0;i<n;i++)
           {
               LL ans=0;
               for(LL j=0;j<n;j++)
               {
                   if(s[j][i]=='C')
                   {
                       ans++;
                   }
               }
               if(ans==1||ans==0)
                   continue;
               else if(ans==2)
                   sum++;
               else
                   sum+=C(ans,2);
           }
           printf("%I64d\n",sum);
       }
       return 0;
   }

   B. Far Relative’s Problem

   time limit per test

   2 seconds

   memory limit per test

   256 megabytes

   input

   standard input

   output

   standard output

   Famil Door wants to celebrate his birthday with his friends from Far Far Away. He has n friends and each of them can come to the party in a specific range of days of the year from ai to bi. Of course, Famil Door wants to have as many friends celebrating together with him as possible.

   Far cars are as weird as Far Far Away citizens, so they can only carry two people of opposite gender, that is exactly one male and one female. However, Far is so far from here that no other transportation may be used to get to the party.

   Famil Door should select some day of the year and invite some of his friends, such that they all are available at this moment and the number of male friends invited is equal to the number of female friends invited. Find the maximum number of friends that may present at the party.

   Input

   The first line of the input contains a single integer n (1 ≤ n ≤ 5000) — then number of Famil Door's friends.

   Then follow n lines, that describe the friends. Each line starts with a capital letter 'F' for female friends and with a capital letter 'M' for male friends. Then follow two integers ai and bi (1 ≤ ai ≤ bi ≤ 366), providing that the i-th friend can come to the party from day ai to day bi inclusive.

   Output

   Print the maximum number of people that may come to Famil Door's party.

   Examples

   input

   4
   M 151 307
   F 343 352
   F 117 145
   M 24 128
   

   output

   2
   

   input

   6
   M 128 130
   F 128 131
   F 131 140
   F 131 141
   M 131 200
   M 140 200
   

   output

   4
   

   Note

   In the first sample, friends 3 and 4 can come on any day in range [117, 128].

   In the second sample, friends with indices 3, 4, 5 and 6 can come on day 140.

   
   简单贪心题

4. #include<stdio.h>
   #include<string.h>
   #include<string>
   #include<iostream>
   #include<map>
   #include<algorithm>
   using namespace std;
   #define LL __int64
   const LL maxm=1e5+10;
   char s[maxm];
   LL a[maxm];
   LL b[maxm];
   int main()
   {
       LL n;
       while(scanf("%I64d",&n)!=EOF)
       {
           LL x,y;
           memset(a,0,sizeof(a));
           memset(b,0,sizeof(b));
           for(LL i=0; i<n; i++)
           {
               scanf("%s%I64d%I64d",s,&x,&y);
               if(s[0]=='M')
               {
                   for(LL j=x;j<=y;j++)
                   {
                       a[j]++;
                   }
               }
               else
               {
                   for(LL j=x;j<=y;j++)
                   {
                       b[j]++;
                   }
               }
           }
           LL M=0;
           for(LL i=1;i<=366;i++)
           {
               M=max(M,2*min(a[i],b[i]));
           }
           printf("%I64d\n",M);
       }
       return 0;
   }