-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path10252 Common Permutation.cpp
57 lines (57 loc) · 1.21 KB
/
10252 Common Permutation.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <numeric>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <limits>
#include <sstream>
#include <string>
#define iter(a,b,c,d) for(a = b; a < c; a+=d)
#define ited(a,b,c,d) for(a = b; a > c; a-=d)
#define li long int
#define uli unsigned li
#define ll long li
#define ull unsigned ll
#define si(a) scanf("%d",&a)
#define sli(a) scanf("%ld",&a)
#define sll(a) scanf("%lld",&a)
#define slu(a) scanf("%llu",&a)
#define sf(a) scanf("%f",&a)
#define slf(a) scanf("%lf",&a)
#define PI 3.1415926
using namespace std;
int main()
{
/*freopen("1in.txt", "r", stdin);
freopen("1out.txt", "w", stdout);*/
string a,b;
string ans;
int i,j;
while(getline(cin,a))
{
getline(cin,b);
ans = "";
sort(a.begin(),a.end());
sort(b.begin(),b.end());
i=j=0;
while(i<a.size() && j<b.size())
{
if(a[i]==b[j])
{
ans+=a[i];
i++;j++;
}
else if(a[i]<b[j]) i++;
else j++;
}
cout<<ans<<endl;
}
return 0;
}