Codeforces Round #299 (Div. 2) A. Tavas and Nafas 水题

A. Tavas and Nafas

Time Limit: 1 Sec  Memory Limit: 256 MB

题目连接

http://codeforces.com/contest/535/problem/A

Description

Today Tavas got his test result as an integer score and he wants to share it with his girlfriend, Nafas.

His phone operating system is Tavdroid, and its keyboard doesn't have any digits! He wants to share his score with Nafas via text, so he has no choice but to send this number using words.

He ate coffee mix without water again, so right now he's really messed up and can't think.

Your task is to help him by telling him what to type.

Input

The first and only line of input contains an integer s (0 ≤ s ≤ 99), Tavas's score.

1000000000.

Output

In the first and only line of output, print a single string consisting only from English lowercase letters and hyphens ('-'). Do not use spaces.

Sample Input

6

Sample Output

six

HINT

题意

给你100以下数字，输出英文

题解：

沙比提

代码：

//qscqesze
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
#include <stack>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define maxn 200001
#define mod 10007
#define eps 1e-9
//const int inf=0x7fffffff;   //无限大
const int inf=0x3f3f3f3f;
/*

int buf[10];
inline void write(int i) {
  int p = 0;if(i == 0) p++;
  else while(i) {buf[p++] = i % 10;i /= 10;}
  for(int j = p-1; j >=0; j--) putchar('0' + buf[j]);
  printf("\n");
}
*/
//**************************************************************************************
inline ll read()
{
    int x=,f=;char ch=getchar();
    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
    return x*f;
}
map<int,string> s;

int main()
{
    int n=read();
    s[]="one";
    s[]="two";
    s[]="three";
    s[]="four";
    s[]="five";
    s[]="six";
    s[]="seven";
    s[]="eight";
    s[]="nine";
    s[]="ten";
    s[]="eleven";
    s[]="twelve";
    s[]="thirteen";
    s[]="fourteen";
    s[]="fifteen";
    s[]="sixteen";
    s[]="seventeen";
    s[]="eighteen";
    s[]="nineteen";
    s[]="twenty";
    s[]="thirty";
    s[]="forty";
    s[]="fifty";
    s[]="sixty";
    s[]="seventy";
    s[]="eighty";
    s[]="ninety";
    if(n==)
        cout<<"zero"<<endl;
    else if(n<=)
        cout<<s[n]<<endl;
    else if(n%==)
        cout<<s[n]<<endl;
    else
        cout<<s[n-n%]<<"-"<<s[n%]<<endl;
}