struct PCI
{
char c;
int i;
};
bool cmp(PCI& a, PCI& b)
{
// 1. 문자 우선
if (a.c != b.c)
return a.c < b.c;
// 2. 문자가 같다면 숫자 정렬
return a.i < b.i;
}
int main()
{
PCI input[100] = { 0 };
int n;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> input[i].c >> input[i].i;
}
sort(input, input + n, cmp);
for (int i = 0; i < n; ++i)
{
cout << input[i].c << " " << input[i].i << endl;
}
return 0;
}
int depthMax, branchCnt;
char path[100] = { 0 };
void DFS(int lev)
{
// Base case:
if (lev == depthMax)
{
cout << path << endl;
return;
}
// Recursive step:
for (int i = 0; i < branchCnt; ++i)
{
path[lev] = '0' + i;
DFS(lev + 1);
path[lev] = 0;
}
return;
}
int main()
{
cin >> depthMax >> branchCnt;
DFS(0);
return 0;
}
int arr1[6] = { 0 };
int arr2[6] = { 0 };
int main()
{
// 1. Get inputs
for (int i = 0; i < 6; ++i)
{
cin >> arr1[i];
}
for (int i = 0; i < 6; ++i)
{
cin >> arr2[i];
}
// 2. Solve
stack<int> buff;
int btn = 0;
for (int i = 5; 0 <= i; --i)
{
const int t = arr1[i] + arr2[i] + btn;
if (10 <= t)
btn = 1;
else
btn = 0;
buff.push(t % 10);
}
if (btn == 1)
buff.push(1);
// 3. Print
while (buff.empty() == false)
{
cout << buff.top() << " ";
buff.pop();
}
return 0;
}
int input[5] = { 0 };
int main()
{
for (auto& d : input)
{
cin >> d;
}
int prv = input[0];
for (int i = 1; i < 5; ++i)
{
if (input[i] <= prv)
{
cout << "증가안됨";
return 0;
}
prv = input[i];
}
cout << "증가됨";
return 0;
}
int main()
{
// Get input
int input = 0;
cin >> input;
// Solve
int arr[100] = { 0 };
int idx, btn = 0;
for (idx = 0; idx < 5; ++idx)
{
const int t = (input % 10) + 1 + btn;
if (10 <= t)
btn = 1;
else
btn = 0;
arr[idx] = t % 10;
input /= 10;
}
if (btn == 1)
arr[idx++] = 1;
// Print
for (int i = 0; i < idx; ++i)
{
cout << arr[i];
}
return 0;
}
int main()
{
string input;
cin >> input;
vector<char> ret;
char DAT[256] = { 0 };
for (char& d : input)
{
DAT[d]++;
if (DAT[d] == 2)
ret.push_back(d);
}
std::sort(ret.begin(), ret.end());
for (auto d : ret)
{
cout << d;
}
return 0;
}
int main()
{
// GetInput
int arr[4][3] = {
3,5,1,
3,1,2,
3,4,6,
5,4,6
};
// Solve
char DAT[15] = { 0 };
for (int i = 0; i < 4; ++i)
{
for (int j = 0; j < 3; ++j)
{
DAT[arr[i][j]]++;
}
}
// Print
for (int i = 1; i <= 6; ++i)
{
cout << i;
for (int j = 0; j < DAT[i]; ++j)
{
cout << " *";
}
cout << endl;
}
return 0;
}
