Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // dragutinmarjanovic
- #include <iostream>
- using namespace std;
- char a[100];
- int provjeri (int n, string k)
- {
- for (int j=0; j<n; j++)
- for (int i=0; i<k.length(); i++)
- {
- if (a[j] == k[i])
- {
- k.erase(i, 1);
- break;
- }
- }
- if(k.length()==0)
- return 1;
- else return 0;
- }
- main()
- {
- int n, m, max = 0;
- string s[100], p;
- cin >> n;
- for (int i=0; i<n; i++)
- cin >> a[i];
- cin >> m;
- for (int i=0; i<m; i++)
- {
- cin >> s[i];
- if (provjeri(n, s[i])==1)
- if (s[i].length()>= max)
- {
- if(s[i].length() == max)
- {
- if (s[i]<p)
- p = s[i];
- }
- else
- p = s[i];
- max = s[i].length();
- }
- }
- cout << max << " " << p << endl;
- system ("PAUSE");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement