> #include <fstream>
> #include <vector>
> #include <string>
> #include <map>
> using namespace std;
> 
> const string GOAL = "Sorcerer's Stone";
> const int MaxLen = 100;
> 
> map<string, vector<string>> stone;
> map<string, int> exist;
> int ans;
> 
> void search(string key) {
> 
> 	if (exist.find(key) == exist.end()) {
> 		ans ++;
> 		exist[key] = 1;
> 	}
> 
>  	if (stone[key].empty()) {
> 		return;
> 	}
> 
> 	for (int i = 0; i < (int) stone[key].size(); i ++) {
> 		search(stone[key][i]);
> 	}
> }
> 
> void getstones(char *names, vector<string> &stones) {
> 
> 	int len = (int) strlen(names);
> 	string name;
> 
> 	stones.clear();
> 
> 	for (int i = 0; i < len; i ++) {
> 		if (names[i] == ',') {
> 			stones.push_back(name);
> 			name.clear();
> 			i ++;
> 			continue;
> 		}
> 		name.push_back(names[i]);
> 	}
> 	stones.push_back(name);
> }
> 
> int main() {
> 
> 	ifstream infile (stdin);
> 	ofstream outfile (stdout);
> 
> 	int n, m;
> 	char names[MaxLen], buf[MaxLen], ch;
> 	vector<string> stones;
> 	
> 	while (infile >> n >> m, n && m) {
> 
> 		infile.getline(buf, MaxLen);
> 		ans = 0;
> 		stone.clear();
> 		exist.clear();
> 
> 		for (int i = 0; i < n; i ++) {
> 			infile.getline(names, MaxLen);
> 			exist[string(names)] = 1;
> 		}
> 
> 		for (int i = 0; i < m; i ++) {
> 			infile.getline(names, MaxLen, ':');
> 			infile.get(ch);
> 			getstones(names, stones);
> 			infile.getline(names, MaxLen);
> 			stone[string(names)] = stones;
> 		}
> 
>  		search(GOAL);
> 
> 		outfile << ans << "\n";
> 
> 	}
> 
> 	return 0;
> }

• Re:why i get CE ? compiled successfully in vs.net2005 (7) qywyh_scut 2006-03-27 11:20:19
  • Re:why i get CE ? compiled successfully in vs.net2005 (7) qywyh_scut 2006-03-27 11:20:33
  • stdin / stdout 也不行？ 一定要cin / cout？ (0) forgotten 2006-03-27 11:27:42
    • TRY。。。。 (0) qywyh_scut 2006-03-27 11:31:09
      • map<string, vector<string> > 原来后面两个>>得分开。。 还有貌似确实只能用cin/cout (0) forgotten 2006-03-27 11:34:21
        • 我用gets+sscanf搞掂…… (0) frkstyc 2006-03-27 12:01:46
          • RE了 .... see one see look one look ... i'm so puzzled ... (1881) forgotten 2006-03-27 21:41:58
            • 唉,原来是MaxLen定下了... (0) forgotten 2006-03-27 22:14:25