Gemstones

                            Solution in C :

In   C++   :








#include <iostream>
#include <fstream>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <complex>
#include <cstdlib>
#include <ctime>
using namespace std;

bool occ[105][26];

int main()
{
	int N;
	cin >> N;

	for (int i = 0; i < N; i++)
	{
		string s;
		cin >> s;

		for (int j = 0; j < s.length(); j++)
			occ[i][s[j]-'a'] = true;
	}

	int total = 0;
	for (int i = 0; i < 26; i++)
	{
		bool all = true;
		for (int j = 0; j < N; j++)
			all = all && occ[j][i];

		total += all;
	}

	cout << total << "\n";

	return 0;
}








In   Java  :








import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;

class Solution {
    public static void main(String... args) {
        

        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        List<HashSet<Character>> distinctSets = new ArrayList<>();
        scanner.nextLine();
        for (int i = 0; i < N; ++i) {
            HashSet<Character> set = new HashSet<>();
            distinctSets.add(set);
            char[] array = scanner.nextLine().toCharArray();
            for (char c : array)
                set.add(c);
        }
        
        boolean isCurrentCharGem = false;
        int count = 0;
        for(char c : distinctSets.get(0)) {
            isCurrentCharGem = true;
            for (HashSet<Character> set : distinctSets) {
                if (!set.contains(c)) {
                    isCurrentCharGem = false;
                    break;
                }
            }
            if (isCurrentCharGem)
                count++;
        }
        
        scanner.close();
        System.out.println(count);

    }
}









In   C :







#include<stdio.h>

int main()
    {
    
    int n,i,j,freq[150][27]={0},count;
    char str[200];
    scanf("%d",&n);
    for(i=0;i<n;i++)
        {
        
        scanf("%s\n",str);
        for(j=0;str[j]!='\0';j++)
            {
            freq[i][str[j]-97]++;
        }
        
    }
    count=0;
    for(i=0;i<26;i++)
        {
        for(j=0;j<n;j++)
            if(freq[j][i]>0)
            continue;
            else
            break;
            if(j==n)
            count++;
    }
    printf("%d\n",count);
    return 0;
}









In  Python3  :





import sys
import string


def read_numbers(line=None):
    if line is None:
        line = sys.stdin.readline()
    return [int(x) for x in line.split()]


if __name__ == '__main__':
    n = read_numbers()[0]
    gem_elements = set(string.ascii_lowercase)
    for i in range(n):
        stone = sys.stdin.readline().strip()
        gem_elements = gem_elements & set(stone)
    print(len(gem_elements))