#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define main dummy_main
int main( ) {
return 0 ;
}
#undef main
class Solution{
public :
bool canConstruct( string s, int k) {
int i;
int odd = 0 ;
int cnt[ 26 ] = { } ;
for ( i= ( 0 ) ; i< ( s.size ( ) ) ; i++ ) {
cnt[ s[ i] - 'a' ] ++ ;
}
for ( i= ( 0 ) ; i< ( 26 ) ; i++ ) {
odd + = cnt[ i] % 2 ;
}
return odd <= k && k <= s.size ( ) ;
}
}
;
// cLay varsion 20200408-1
// --- original code ---
// #define main dummy_main
// {}
// #undef main
//
// class Solution {
// public:
// bool canConstruct(string s, int k) {
// int odd = 0, cnt[26] = {};
// rep(i,s.size()) cnt[s[i]-'a']++;
// rep(i,26) odd += cnt[i]%2;
// return odd <= k <= s.size();
// }
// };
I3ByYWdtYSBHQ0Mgb3B0aW1pemUgKCJPZmFzdCIpCiNpbmNsdWRlPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbWFpbiBkdW1teV9tYWluCmludCBtYWluKCl7CiAgcmV0dXJuIDA7Cn0KI3VuZGVmIG1haW4KY2xhc3MgU29sdXRpb257CiAgcHVibGljOgogIGJvb2wgY2FuQ29uc3RydWN0KHN0cmluZyBzLCBpbnQgayl7CiAgICBpbnQgaTsKICAgIGludCBvZGQgPSAwOwogICAgaW50IGNudFsyNl0gPSB7fTsKICAgIGZvcihpPSgwKTtpPChzLnNpemUoKSk7aSsrKXsKICAgICAgY250W3NbaV0tJ2EnXSsrOwogICAgfQogICAgZm9yKGk9KDApO2k8KDI2KTtpKyspewogICAgICBvZGQgKz0gY250W2ldJTI7CiAgICB9CiAgICByZXR1cm4gb2RkIDw9IGsgICYmICBrIDw9IHMuc2l6ZSgpOwogIH0KfQo7Ci8vIGNMYXkgdmFyc2lvbiAyMDIwMDQwOC0xCgovLyAtLS0gb3JpZ2luYWwgY29kZSAtLS0KLy8gI2RlZmluZSBtYWluIGR1bW15X21haW4KLy8ge30KLy8gI3VuZGVmIG1haW4KLy8gCi8vIGNsYXNzIFNvbHV0aW9uIHsKLy8gcHVibGljOgovLyAgIGJvb2wgY2FuQ29uc3RydWN0KHN0cmluZyBzLCBpbnQgaykgewovLyAgICAgaW50IG9kZCA9IDAsIGNudFsyNl0gPSB7fTsKLy8gICAgIHJlcChpLHMuc2l6ZSgpKSBjbnRbc1tpXS0nYSddKys7Ci8vICAgICByZXAoaSwyNikgb2RkICs9IGNudFtpXSUyOwovLyAgICAgcmV0dXJuIG9kZCA8PSBrIDw9IHMuc2l6ZSgpOwovLyAgIH0KLy8gfTsK