Descriptionios
Inputc++
Outputapp
Sample Inputide
Red Alder Ash Aspen Basswood Ash Beech Yellow Birch Ash Cherry Cottonwood Ash Cypress Red Elm Gum Hackberry White Oak Hickory Pecan Hard Maple White Oak Soft Maple Red Oak Red Oak White Oak Poplan Sassafras Sycamore Black Walnut Willow
Sample Outputui
Ash 13.7931 Aspen 3.4483 Basswood 3.4483 Beech 3.4483 Black Walnut 3.4483 Cherry 3.4483 Cottonwood 3.4483 Cypress 3.4483 Gum 3.4483 Hackberry 3.4483 Hard Maple 3.4483 Hickory 3.4483 Pecan 3.4483 Poplan 3.4483 Red Alder 3.4483 Red Elm 3.4483 Red Oak 6.8966 Sassafras 3.4483 Soft Maple 3.4483 Sycamore 3.4483 White Oak 10.3448 Willow 3.4483 Yellow Birch 3.4483
Hintspa
解法一:map應用(自動按照鍵值字典序排序,強)rest
#include<bits/stdc++.h> using namespace std; map<string,int>mp; int main() { int n; cin>>n; int t=n; getchar(); string s; while(n--){ getline(cin,s); mp[s]++; } map<string,int>::iterator it; for(it=mp.begin();it!=mp.end();it++) cout<<it->first<<" "<<setiosflags(ios::fixed)<<setprecision(4)<<100.0*it->second/t<<'%'<<endl; return 0; }
解法二:Trie樹code
#include<bits/stdc++.h> using namespace std; int n,len; char s[40]; struct Trie { int cnt; bool ok; char name[40]; Trie *next[127]; Trie(){ cnt=0,ok=0; memset(next,0,sizeof(next)); } }*root; void Insert(char *s,int id) { Trie *p=root; int len=strlen(s); for(int i=0;i<len;i++){ if(!p->next[s[i]-'A']) p->next[s[i]-'A']=new Trie(); p=p->next[s[i]-'A']; } p->cnt++; if(!p->ok) p->ok=1; strcpy(p->name,s); } void dfs(Trie *root) { Trie *p=root; if(p->ok){ printf("%s",p->name); printf(" %.4lf%\n",100.0*p->cnt/n); } for(int i=0;i<127;i++){//字典序 if(p->next[i]) dfs(p->next[i]); } } int main() { cin>>n; getchar(); root=new Trie; for(int i=1;i<=n;i++){ gets(s); Insert(s,i); } dfs(root); }