1166A - Silent Classroom - CodeForces Solution


combinatorics greedy *900

Please click on ads to support us..

Python Code:

import math

n = int(input())
names = [0]*26
for _ in range(n):
  student = input()
  names[ord(student[0])-97] += 1
  total = [x for x in names if x > 0]
  pairs = 0
  for i in total:
    pairs += math.comb(math.ceil(i/2), 2) + math.comb(math.floor(i/2), 2)
    
print(pairs)
		  	 			   	  					  	    	  	

C++ Code:

#include<bits/stdc++.h>
#define ll              long long
#define ull             unsigned long long
#define pb              push_back
#define fastread()      (ios_base:: sync_with_stdio(false),cin.tie(NULL));
using namespace std;
int main()
{
    long long n;
    char c;
    map<char,int>mp;
    map<char,int>:: iterator itr;
    string s;
    cin>>n;
    while(n--){
        cin>>s;
        c = s[0];
        mp[c]++;
    }
    int a,one,sec,sum = 0;
    for(itr=mp.begin(); itr!=mp.end(); itr++){
        a = itr->second;
        one = (a / 2) + (a % 2);
        sec = a/2;
        while(one--){
            sum += one;
        }
        while(sec--){
            sum += sec;
        }
    }
    cout<<sum<<endl;

    return 0;
}


Comments

Submit
0 Comments
More Questions

233A - Perfect Permutation
1360A - Minimal Square
467A - George and Accommodation
893C - Rumor
227B - Effective Approach
1534B - Histogram Ugliness
1611B - Team Composition Programmers and Mathematicians
110A - Nearly Lucky Number
1220B - Multiplication Table
1644A - Doors and Keys
1644B - Anti-Fibonacci Permutation
1610A - Anti Light's Cell Guessing
349B - Color the Fence
144A - Arrival of the General
1106A - Lunar New Year and Cross Counting
58A - Chat room
230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football