欧拉项目(#17)

欧拉项目第17题:

如果数字1到5写成单词:one, two, three, four, five，那么总共有3 + 3 + 5 + 4 + 4 = 19个字母。如果把从1到1000(包括一千)的所有数字写成单词，总共要用多少个字母?注意:空格或连字符不计算在内。例如，342(三百四十二)包含23个字母，115(一百一十五)包含20个字母。在书写数字时使用and符合英式用法。

我已经检查了我的代码很多次，不能找到为什么它不能正确解决它，任何帮助将非常感激，谢谢

`#include <iostream>
#include <sstream>
unsigned int value = 11;//one thousand = 11
short small(short x);
void two(short third);
int main()
{
    for(short count = 0;count<10;count++)
    {
        two(count);
    }
   std::cout<<value;
    std::cin.get();
    return 0;
}
void two(short third)
{
    std::string temp;
    if(third>0)
    {
         third = (small(third) + 10);//10 = and(3) + hundred(7)
    }
    for(short i = 0;i<20;i++)//0-20
    {   
        value += (small(i) + third);      
    }
    for(short i = 20;i<60;i++)//20-40 + 80-100
    {
         std::stringstream ss;
         ss<<i;
         temp = ss.str();
         value += ((small(temp[1]-'0') + 6) + third);
    }
    for(short i = 40;i<70;i++)//40-70
    {
         std::stringstream ss;
         ss<<i;
         temp = ss.str();
         value += ((small(temp[1]-'0') + 5) + third);
    }
    for(short i = 70;i<80;i++)//70-80
    {
         std::stringstream ss;
         ss<<i;
         temp = ss.str();
         value += ((small(temp[1]-'0') + 7) + third);
    }      
}
short small(short x)
{
              switch(x)
             {
                case 0:
                     return 0;
                case 1:
                     return 3;
                case 2:  
                     return 3;
                case 3:
                     return 5;
                case 4:
                     return 4;
                case 5:
                     return 4;
                case 6:
                     return 3;
                case 7:
                     return 5;
                case 8:
                     return 5;
                case 9:
                     return 4;
                case 10:
                     return 3;
                case 11:
                     return 6;
                case 12:
                     return 6;
                case 13:
                     return 8;
                case 14:
                     return 8;
                case 15:
                     return 7;
                case 16:
                     return 7;
                case 17:
                     return 9;
                case 18:
                     return 8;
                case 19:
                     return 8;                   
          }
}