
Untitled
By: a guest on
May 22nd, 2012 | syntax:
None | size: 0.96 KB | hits: 7 | expires: Never
using namespace std;
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
#define foreach(x, v) for (typeof (v).begin() x=(v).begin(); x !=(v).end(); ++x)
#define For(i, a, b) for (int i=(a); i<(b); ++i)
#define D(x) cout << #x " is " << x << endl
string letters [27];
map <string, int> index;
int oneLetterWords(){
int last;
for (int i = 1; i < 27; i++){
index[letters[i]] = i;
last = i;
}
return last;
}
int main(){
letters[0] = "";
for (int i = 1; i < 27; i++){
char c = (char) (i - 1 + 'a');
letters[i] = c;
}
cout << oneLetterWords() << endl;
/*twoLetterWords();
threeLetterWords();
fourLetterWords();
fiveLetterWords();*/
return 0;
}