#include#include#include#include#include#include#include#include#include#define pi acos(-1.0)#define inf 0xfffffff#define maxn 5000using namespace std;char str[maxn][maxn];int a[maxn],b[maxn];int main(){ int n; scanf("%d",&n); for(int i=0;i0) { if(str[i-1][j]=='o') flag++; } if(i0) { if(str[i][j-1]=='o') flag++; } if(j
#include#include#include#include#include#include#include#include#include#define pi acos(-1.0)#define inf 0xfffffff#define maxn 500000using namespace std;char str[maxn];__int a[30];__int n,k;bool cmp(__int u,__int v){ return u>v;}int main(){ scanf("%Id%Id",&n,&k); memset(a,0,sizeof(a)); scanf("%s",str); for(int i=0;str[i]!='\0';i++) { int m=(int)(str[i]-'A'); a[m]++; } sort(a,a+27,cmp); __int t=0; __int sum=0; while(k>0) { if(k>=a[t]) { sum+=a[t]*a[t]; k-=a[t]; t++; } else { sum+=k*k; k=0; } } printf("%Id\n",sum); return 0;}
#include#include#include#include#include#include#include#include#include#define pi acos(-1.0)#define inf 0xfffffff#define maxn 500000using namespace std;__int a[maxn],b[maxn];__int sum=0;bool cmp(__int a,__int b){ return a>b;}int main(){ int n; scanf("%d",&n); for(int i=0;i0;i--) sum+=b[i]; for(int i=0;i
