8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b23b74f commit db63f35Copy full SHA for db63f35
0x03/solutions/1919.cpp
@@ -1,11 +1,28 @@
1
-// Authored by : BaaaaaaaaaaarkingDog
+// Authored by : twinkite
2
// Co-authored by : -
3
-// http://boj.kr/****************
+// http://boj.kr/113a0c8415164751b8316d0dcc589658
4
#include <bits/stdc++.h>
5
using namespace std;
6
7
int main(void){
8
ios::sync_with_stdio(0);
9
cin.tie(0);
10
-
+
11
+ int res = 0;
12
+ string s1, s2;
13
+ int arr[2][26];
14
+ fill(arr[0], arr[0]+26, 0);
15
+ fill(arr[1], arr[1]+26, 0);
16
+ cin>>s1>>s2;
17
+ for(int i=0;i<s1.size();i++){
18
+ arr[0][s1[i]-'a']++;
19
+ }
20
+ for(int i=0;i<s2.size();i++){
21
+ arr[1][s2[i]-'a']++;
22
23
+ for(int i=0;i<26;i++){
24
+ res+=abs(arr[0][i]-arr[1][i]);
25
26
+ cout<<res;
27
+ return 0;
28
}
0 commit comments