사전(맵)

words = input().split()queries = input().split()print(len(set(words)))counts = {}for w in words:    counts[w] = counts.get(w, 0) + 1for q in queries:    if q in counts:        print(q, counts[q])    else:        print(q, "none")for w in sorted(counts):    print(w, counts[w])

const [words, queries] = require("fs").readFileSync(0, "utf8").trim().split("\n").map((l) => l.trim().split(/\s+/));console.log(new Set(words).size);const counts = new Map();for (const w of words) counts.set(w, (counts.get(w) ?? 0) + 1);for (const q of queries) {  if (counts.has(q)) console.log(q, counts.get(q));  else console.log(q, "none");}for (const w of [...counts.keys()].sort()) console.log(w, counts.get(w));

import { readFileSync } from "node:fs";const [words, queries]: string[][] = readFileSync(0, "utf8").trim().split("\n").map((l) => l.trim().split(/\s+/));console.log(new Set(words).size);const counts = new Map<string, number>();for (const w of words) counts.set(w, (counts.get(w) ?? 0) + 1);for (const q of queries) {  if (counts.has(q)) console.log(q, counts.get(q));  else console.log(q, "none");}for (const w of [...counts.keys()].sort()) console.log(w, counts.get(w));

import java.util.*; public class Main {    public static void main(String[] args) {        Scanner sc = new Scanner(System.in);        String[] words = sc.nextLine().trim().split("\\s+");        String[] queries = sc.nextLine().trim().split("\\s+");        System.out.println(new HashSet<>(Arrays.asList(words)).size());        Map<String, Integer> counts = new TreeMap<>();        for (String w : words) counts.merge(w, 1, Integer::sum);        for (String q : queries) {            if (counts.containsKey(q)) System.out.println(q + " " + counts.get(q));            else System.out.println(q + " none");        }        for (Map.Entry<String, Integer> e : counts.entrySet()) {            System.out.println(e.getKey() + " " + e.getValue());        }    }}

using System;using System.Collections.Generic;using System.Linq; class Program{    static void Main()    {        string[] words = Console.ReadLine().Split(' ', StringSplitOptions.RemoveEmptyEntries);        string[] queries = Console.ReadLine().Split(' ', StringSplitOptions.RemoveEmptyEntries);        Console.WriteLine(new HashSet<string>(words).Count);        var counts = new Dictionary<string, int>();        foreach (string w in words) counts[w] = counts.GetValueOrDefault(w) + 1;        foreach (string q in queries)        {            if (counts.TryGetValue(q, out int c)) Console.WriteLine($"{q} {c}");            else Console.WriteLine($"{q} none");        }        foreach (string w in counts.Keys.OrderBy(k => k, StringComparer.Ordinal))            Console.WriteLine($"{w} {counts[w]}");    }}

#include <iostream>#include <map>#include <set>#include <sstream>#include <string>#include <vector> std::vector<std::string> readWords() {    std::string line, w;    std::getline(std::cin, line);    std::istringstream in(line);    std::vector<std::string> out;    while (in >> w) out.push_back(w);    return out;} int main() {    std::vector<std::string> words = readWords(), queries = readWords();    std::cout << std::set<std::string>(words.begin(), words.end()).size() << '\n';    std::map<std::string, int> counts;    for (const auto& w : words) counts[w]++;    for (const auto& q : queries) {        if (counts.contains(q)) std::cout << q << ' ' << counts.at(q) << '\n';        else std::cout << q << " none\n";    }    for (const auto& [w, c] : counts) std::cout << w << ' ' << c << '\n';}

#include <stdio.h>#include <stdlib.h>#include <string.h> char keys[1000][32];int vals[1000], n = 0; int find(const char *w) {    for (int i = 0; i < n; i++)        if (strcmp(keys[i], w) == 0) return i;    return -1;} int cmp(const void *a, const void *b) { return strcmp(keys[*(const int *)a], keys[*(const int *)b]); } int main(void) {    char line[4096], qline[4096];    fgets(line, sizeof line, stdin);    fgets(qline, sizeof qline, stdin);    for (char *w = strtok(line, " \r\n"); w; w = strtok(NULL, " \r\n")) {        int i = find(w);        if (i < 0) { strcpy(keys[n], w); vals[n] = 0; i = n++; }        vals[i]++;    }    printf("%d\n", n);    for (char *q = strtok(qline, " \r\n"); q; q = strtok(NULL, " \r\n")) {        int i = find(q);        if (i >= 0) printf("%s %d\n", q, vals[i]);        else printf("%s none\n", q);    }    int order[1000];    for (int i = 0; i < n; i++) order[i] = i;    qsort(order, n, sizeof order[0], cmp);    for (int i = 0; i < n; i++) printf("%s %d\n", keys[order[i]], vals[order[i]]);    return 0;}

words = 콘솔.줄읽기().나누기();queries = 콘솔.줄읽기().나누기();counts = 사전();각각 (w 에서 words){    만약 (counts.있나(w))    {        counts[w] = counts[w] + 1;    }    아니면    {        counts[w] = 1;    }}콘솔.쓰기(counts.개수);각각 (q 에서 queries){    만약 (counts.있나(q))    {        콘솔.쓰기(q + " " + counts[q]);    }    아니면    {        콘솔.쓰기(q + " none");    }}keys = counts.열쇠목록;keys.정렬();각각 (w 에서 keys){    콘솔.쓰기(w + " " + counts[w]);}