Submission #2173214
Source Code Expand
#include<iostream> #include<algorithm> #include<string> using namespace std; typedef long long int ll; int main(){ string s; cin >> s; int ans = 101; for(char i = 'a'; i <= 'z'; i++){ string t = s; int cnt = 0; while(!t.empty()){ bool flag = true; for(int j = 0; j < t.size(); j++){ if(t[j] != i) flag = false; } if(flag) break; for(int j = 0; j < t.size(); j++){ if(j == t.size() - 1) t.pop_back(); else if(t[j] != i) t[j] = t[j + 1]; } cnt++; } if(cnt < ans) ans = cnt; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Shrinking |
User | utsumi |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 584 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 2 ms | 256 KB |
1_02.txt | AC | 2 ms | 256 KB |
1_03.txt | AC | 2 ms | 256 KB |
1_04.txt | AC | 2 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | AC | 1 ms | 256 KB |
1_07.txt | AC | 1 ms | 256 KB |
1_08.txt | AC | 2 ms | 256 KB |
1_09.txt | AC | 2 ms | 256 KB |