思路:统计每个字母出现的次数,如果字符串的长度%2 == 0,字符出现的次数不能超过字符串长度/2,如果字符串的长度%2 == 1,字符出现的次数不能超过字符串长度/2+1;
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
string s;
int a[30];
int main(){
cin>>s;
for(int i=0;i<s.size();i++){
a[s[i]-'a']++;
}
// bool flag=false;
for(int i=0;i<26;i++){
if((s.size()%2==0)&&(a[i]>s.size()/2)){
cout<<"Impossible"<<endl;
return 0;
}
if((s.size()%2==1)&&(a[i]>s.size()/2+1)){
cout<<"Impossible"<<endl;
return 0;
}
}
cout<<"Possible"<<endl;
//else cout<<"Impossible"<<endl;
return 0;
}