1785. Lost in Localization
Time limit: 1.0 second
Memory limit: 64 MB
The Lavin Interactive Company, which has developed the turn-based strategy Losers-V, is constantly extending its target market by localizing the game to as many languages as it can. In particular, they are interested in creating a version of the game in Anindilyakwa, which is one of the languages spoken by indigenous Australians.
However, the localization is complicated by the fact that Anindilyakwa has no numerals. How can a phrase such as “You have seven black dragons and your enemy has forty black dragons” be translated into this language? The localizers have decided to translate it as follows: “You have few black dragons and your enemy has lots of black dragons.” They have compiled a table showing the rule of replacing numbers of monsters by Anindilyakwa words.
Input
The only line contains the number of monsters
n (1 ≤
n ≤ 2000).
Output
Output the word corresponding to the given number of monsters in the Anindilyakwa language.
Samples
Problem Author: folklore
Problem Source: Ural Regional School Programming Contest 2010 |
很久没做过这么水的题了;
#include<iostream>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<stack>
#include<queue>
#include<iomanip>
#include<map>
#include<set>
#define pi 3.14159265358979323846
using namespace std;
int main()
{
int n;
scanf("%d",&n);
if(n>=1&&n<=4) printf("few\n");
else if(n>=5&&n<=9) printf("several\n");
else if(n>=10&&n<=19) printf("pack\n");
else if(n>=20&&n<=49) printf("lots\n");
else if(n>=50&&n<=99) printf("horde\n");
else if(n>=100&&n<=249) printf("throng\n");
else if(n>=250&&n<=499) printf("swarm\n");
else if(n>=500&&n<=999) printf("zounds\n");
else if(n>=1000) printf("legion\n");
return 0;
}