這題應(yīng)該是個(gè)水題，可是我比題還水。。。TT，用map寫的，存對應(yīng)的roma數(shù)字時(shí)存錯(cuò)啦。。。正好在比賽，我暈，WA了兩次，我的排名啊。。。TT

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <map>

using namespace std;

map<int, string> m;

struct roma
{
int x;
string s;
}roma[10010];

void init()
{
m[1] = "I";m[2] = "II";m[3] = "III";m[4] = "IV";
m[5] = "V";m[6] = "VI";m[7] = "VII";m[8] = "VIII";
m[9] = "IX";m[10] = "X";m[20] = "XX";m[30] = "XXX";
m[40] = "XL";m[50] = "L"; m[60] = "LX"; m[70] = "LXX";m[80] = "LXXX";
m[90] = "XC";m[100] = "C"; m[200] = "CC";m[300] = "CCC";
m[400] = "CD"; m[500] = "D"; m[600] = "DC"; m[700] = "DCC";
m[800] = "DCCC"; m[900] = "CM"; m[1000] = "M"; m[2000] = "MM";
m[3000] = "MMM";
}

int cmp ( const void * a , const void * b )
{
struct roma *c = (struct roma *)a;
struct roma *d = (struct roma *)b;
return c->s > d->s;
}

int main()
{
//freopen("data.in", "r", stdin);

int t, n, i, f, tmp;
init();
string str;

while(scanf("%d", &t) != EOF)
{
while(t--)
{
scanf("%d", &n);
for(i = 0; i < n; i++)
{
scanf("%d", &f);
tmp = f;
str.clear();
if(f/1000)
{
str += m[(f/1000)*1000];
f %= 1000;
}
if(f/100)
{
str += m[(f/100)*100];
f %= 100;
}
if(f/10)
{
str += m[(f/10)*10];
f %= 10;
}
if(f)
{
str += m[f];
}
roma[i].x = tmp;
roma[i].s.clear();
roma[i].s = str;
}

qsort(roma, n, sizeof(roma[0]), cmp);

for(i = 0; i < n-1; i++)
{
printf("%d ", roma[i].x);
//cout << roma[i].s << " " ;
}
printf("%d\n", roma[n-1].x);
//cout << roma[i].s << endl;
}
}
return 0;
}

轉(zhuǎn)載于:https://www.cnblogs.com/vongang/archive/2011/09/17/2179732.html

總結(jié)

以上是生活随笔為你收集整理的ZOJ_3501 Roman Order的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。