A. Anton and Letters time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Recently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters f…

Anton and Letters time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Recently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters from…

time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Recently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters from the set in one li…

Problem description Recently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters from the set in one line, separated by a comma. He also added an opening curved bracket at the beginning of the…

题目很简单,只需要注意带空格的输入用getline即可 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> using namespace std; int main(){ string str; getline(cin,str); set<char> a; ; i < str.length()-;…

layout: post title: Codeforces Round 253 (Div. 2) author: "luowentaoaa" catalog: true tags: mathjax: true - codeforces - 模拟栈 - 贪心 传送门 A.Anton and Letters (签到) 题意 判断字符串里面有多少个不同字符 思路 直接set一下 #include<bits/stdc++.h> using namespace std; typed…

A. Anton and Danik 题目连接: http://codeforces.com/contest/734/problem/A Description Anton likes to play chess, and so does his friend Danik. Once they have played n games in a row. For each game it's known who was the winner - Anton or Danik. None of th…

Problem description Anton likes to play chess, and so does his friend Danik. Once they have played n games in a row. For each game it's known who was the winner — Anton or Danik. None of the games ended with a tie. Now Anton wonders, who won more gam…

time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Anton likes to play chess, and so does his friend Danik. Once they have played n games in a row. For each game it's known who was the winner - An…

Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your result is the smallest in lexicographical order among all possible results. Example: Given "bcabc&q…