#include #include #include #define MAX 10000 char pole[MAX]; char cislo[MAX]; int vysledek; int nasIndex; int lastM; int prvni(char c, int nasIndex) { for (unsigned int i = nasIndex ; i =0; i--) { if (cislo[i]==c) return i; } return 0; } void fuj() { najdi('m', 1000, MAX); nasIndex = lastM; najdi('d', 500, 1); najdi('c', 100, 3); najdi('l', 50, 1); najdi('x', 10, 3); najdi('v', 5, 1); najdi('i', 1, 3); //printf("%s %d\n", pole, vysledek); printf("%d\n", vysledek); } void sito() { int nalezeno = 0; for (unsigned int i=0; i='A' && pole[i]<='Z') { pole[i] -= 'A' - 'a'; } } } void initialize() { for (unsigned int i = 0; i< MAX; i++) { pole[i] = 0; cislo[i] = 0; vysledek = 0; nasIndex = 0; lastM = 0; } } int main(void) { initialize(); //while (read(0,pole) != 0) while (gets(pole)) { lowercase(); sito(); fuj(); initialize(); } return 0; }