Подсчет символов

[Twisterr]

You given N and one line of length N (1<=N<=1000)than consist of letter in interval A..Z.
Your task is to find out how often each letter from the alphabet is found in the line.
First line of your output have to consist of total amount of unduplicated letters. Then your program have to print only the letters that exists in given line in the following format:
LETTER COUNT ex : (A 1)
The letter have to be printed in alpahbet order (A,B,C...Z).


Sample input 1:
1
A

Sample output 1:
1
A 1

Sample input 2:
6
ABBBAZ

Sample output 2:
3
A 2
B 3
Z 1

int main () {

	ios_base :: sync_with_stdio(0);

//	freopen(FILE".in", "r", stdin);
//	freopen(FILE".out", "w", stdout);

	int n, a[100] = {0};
	string s;
	cin >> n >> s;
	int c = 0;
	REP(i, SZ(s)) a[(int) (s[i] - 'A')]++;
	REP(i, 26) if (a[i]) c++;
	cout << c << endl;
	REP(i, 26)
		if (a[i]) cout << (char) ('A' + i) << ' ' << a[i] << endl;

	return 0;
}

могу так но мне нужно более простое решение

[onewho]

Яп какой?

....

[Twisterr]

#include <iostream>
using namespace std;
int main()
{
 
char buffer[1000];  
int size=0;
 
  cin>>size;
  
  for(int i=0;i<size;i++)
    cin>>buffer[i];

  int n=0; 
  for(int i=0;i<size;i++)
   
   if('A'==buffer[i])
    n++;

   

  cout<<n;
  return 0;
}

все до чего я додумался

[pproger]

читаешь из строки, кидаешь в map<char, int>. сразу получишь упорядоченную последовательность. в чем проблема то?

[Syuf]

#include <iostream>
#include <map>

using namespace std;


int main()
{
   int n; cin >> n;  
   map<char, int> chs;
   for(char ch; n > 0 && cin >> ch; n--)
      chs[ch]++;

   cout << chs.size() << endl;
   for(map<char, int>::iterator iter = chs.begin(); iter != chs.end(); iter++)
      cout << iter->first << " " << iter->second << endl;
   
   return 0;
}

Ok?