[Bronze I] Title: No Duplicates, Time: 0 ms, Memory: 2028 KB -BaekjoonHub

Author: sillysillyman

백준/Bronze/15098. No Duplicates/No Duplicates.cc

@@ -0,0 +1,14 @@
+#include <iostream>
+#include <map>
+
+using namespace std;
+
+int main() {
+  string s;
+  map<string, int> m;
+  while (cin >> s) {
+    m[s]++;
+    if (m[s] > 1) return cout << "no", 0;
+  }
+  cout << "yes";
+}

백준/Bronze/15098. No Duplicates/README.md

@@ -0,0 +1,36 @@
+# [Bronze I] No Duplicates - 15098 
+
+[문제 링크](https://www.acmicpc.net/problem/15098) 
+
+### 성능 요약
+
+메모리: 2028 KB, 시간: 0 ms
+
+### 분류
+
+구현, 자료 구조, 문자열, 브루트포스 알고리즘, 집합과 맵
+
+### 제출 일자
+
+2026년 3월 1일 15:49:11
+
+### 문제 설명
+
+<p>There is a game in which you try not to repeat a word while your opponent tries to see if you have repeated one.</p>
+
+<p>"THE RAIN IN SPAIN" has no repeats.</p>
+
+<p>"IN THE RAIN AND THE SNOW" repeats THE.</p>
+
+<p>"THE RAIN IN SPAIN IN THE PLAIN" repeats THE and IN.</p>
+
+<p>Write a program to test a phrase.</p>
+
+### 입력 
+
+ <p>Input is a line containing words separated by single spaces, where a word consists of one or more uppercase letters. A line contains no more than 80 characters.</p>
+
+### 출력 
+
+ <p>The output is "yes" if no word is repeated, and "no" if one or more words repeat.</p>
+