blob: 3c6d190a299ef0959e08ab67ef56931de5d9cf37 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
/*
* roman.c
* Copyright 2001 by CrossWire Bible Society
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston,
* MA 02111-1307, USA.
*
*/
#include <stdlib.h>
#include <string.h>
#include <roman.h>
char isroman (const char* str) {
char * ch = (char*)str;
for (; *ch; ch++)
if (!strchr ("IVXLCDMivxlcdm ", *ch))
return 0;
return 1;
}
int from_rom(const char* str) {
int i, n = strlen(str);
short * num= calloc(n, sizeof(short));
for (i = 0; str[i]; i++) {
switch(str[i]) {
case 'i':
case 'I':
num[i] = 1;
break;
case 'v':
case 'V':
num[i] = 5;
break;
case 'x':
case 'X':
num[i] = 10;
break;
case 'l':
case 'L':
num[i] = 50;
break;
case 'c':
case 'C':
num[i] = 100;
break;
case 'd':
case 'D':
num[i] = 500;
break;
case 'm':
case 'M':
num[i] = 1000;
break;
default:
num[i] = 0;
}
}
for (i = 1; str[i]; i++) {
if (num[i] > num[i-1]) {
num[i] -= num[i-1];
num[i-1] = 0;
}
}
n = 0;
for (i = 0; str[i]; i++) {
n += num[i];
}
free(num);
return n;
}
|
