博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
Codeforces Round #299 (Div. 2) A. Tavas and Nafas 水题
阅读量:6453 次
发布时间:2019-06-23

本文共 2265 字,大约阅读时间需要 7 分钟。

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 
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
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=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'){ if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();} return x*f;}map
s;int main(){ int n=read(); s[1]="one"; s[2]="two"; s[3]="three"; s[4]="four"; s[5]="five"; s[6]="six"; s[7]="seven"; s[8]="eight"; s[9]="nine"; s[10]="ten"; s[11]="eleven"; s[12]="twelve"; s[13]="thirteen"; s[14]="fourteen"; s[15]="fifteen"; s[16]="sixteen"; s[17]="seventeen"; s[18]="eighteen"; s[19]="nineteen"; s[20]="twenty"; s[30]="thirty"; s[40]="forty"; s[50]="fifty"; s[60]="sixty"; s[70]="seventy"; s[80]="eighty"; s[90]="ninety"; if(n==0) cout<<"zero"<

 

转载地址:http://elyzo.baihongyu.com/

你可能感兴趣的文章
Linux ---各种yum源配置详解
查看>>
CString类型转换为char类型
查看>>
DNS 在企业网络中的应用-2
查看>>
二维数组左滑删除某一行
查看>>
ChemDraw进行自动调整的步骤
查看>>
outlook收发hotmail邮件及IP被列为垃圾IP的处理办法
查看>>
静态路由
查看>>
服务器tcp连接timewait过多优化及详细分析
查看>>
ngix内核优化
查看>>
Docker(二十一)k8s deployment 的yaml 文件
查看>>
VMware Workstation中安装Hyper-V
查看>>
二级路由器设置为何要关闭DHCP服务
查看>>
我的友情链接
查看>>
tomcat 性能优化
查看>>
Perl入门(六) Perl方法的使用
查看>>
citrix license server 服务无法启动
查看>>
批处理添加连续ip
查看>>
php5.5以上版本编译扩展模块方法
查看>>
[bash] 显示配色
查看>>
xargs 命令
查看>>