https://codeforces.com/contest/1367/problem/A
Problem - A - Codeforces
codeforces.com
[난이도] Div.3
[유형] 구현
[풀이]
맨 앞, 맨 뒷 글자는 무조건 출력해주고
가운데 글자들은 같은 글자가 두번씩 나오므로 한번씩만 출력되도록 하면 된다.
#include <string>
#include <iostream>
using namespace std;
int tc;
int main(){
cin >> tc;
while(tc--){
string s;
cin >> s;
cout << s[0];
for(int i=1;i<s.size()-1;i+=2) cout << s[i];
cout << s.back();
puts("");
}
}
https://github.com/has2/Problem-Solving/blob/master/codeforces/Round650-Div.3/A.cpp
'Problem-Solving > Codeforces' 카테고리의 다른 글
[Codeforces][Round #650][Div.3] C : Social Distance (C++) (0) | 2021.01.06 |
---|---|
[Codeforces][Round #650][Div.3] B : Even Array (C++) (0) | 2021.01.06 |
[Codeforces][Round #667][Div.3] D : Decrease the Sum of Digits (C++) (0) | 2021.01.06 |
[Codeforces][Round #667][Div.3] C : Yet Another Array Restoration (C++) (0) | 2021.01.06 |
[Codeforces][Round #667][Div.3] B : Minimum Product (C++) (0) | 2021.01.02 |