UVa Problem Solution: 10252 - Common Permutation

Really simple problem. However, two points need to be considered:
1. ... find the largest string x such that there is a permutation of x that is a ( not necessarily continuous) subsequence of a ...
2. if there are spaces in the input, ignore them in the output.

Code:

1. /*************************************************************************
2.  * Copyright (C) 2008 by liukaipeng                                      *
3.  * liukaipeng at gmail dot com                                           *
4.  *************************************************************************/
6. /* @JUDGE_ID 00000 10252 C++ "Common Permutation" */
8. #include <iostream>
9. #include <fstream>
10. #include <string>
11. #include <vector>
13. using namespace std;
14.      
15. int const linesize = 1001;
16. int const ncharacters = 128;
18. void common_permutation(char *line1, char *line2, char common[])
19. {
20.   int count1[ncharacters] = {0};
21.   int count2[ncharacters] = {0};
22.   for (int i = 0; line1[i] != '/0'; ++i) {
23.     ++count1[line1[i]];
24.   }
25.   for (int i = 0; line2[i] != '/0'; ++i) {
26.     ++count2[line2[i]];
27.   }
28.   int c = 0;
29.   for (int i = 0; i < ncharacters; ++i) {
30.     if (char(i) == ' ') continue;
31.     int min = count1[i] < count2[i] ? count1[i] : count2[i];
32.     for (int j = 0; j < min; ++j) {
33.       common[c++] = char(i);
34.     }
35.   }
36.   common[c] = '/0';
37. }
38.           
39. int main(int argc, char *argv[])
40. {
41. #ifndef ONLINE_JUDGE
42.   filebuf in, out;
43.   cin.rdbuf(in.open((string(argv[0]) + ".in").c_str(), ios_base::in));
44.   cout.rdbuf(out.open((string(argv[0]) + ".out").c_str(), ios_base::out));
45. #endif
47.   char line1[linesize];
48.   char line2[linesize];
49.   char common[linesize];
50.   while (cin.getline(line1, linesize).getline(line2, linesize)) {
51.     common_permutation(line1, line2, common);
52.     cout << common << '/n';
53.   }
55.   return 0;
56. }
57.