It looks like you're new here. If you want to get involved, click one of these buttons!

- 140.8K All Categories
- 103.6K Programming Languages
- 6.4K Assembler Developer
- 401 Assembly Code Share
- 239 Getting started in assembly
- 4.6K x86 Assembly
- 1.9K Basic
- 97 Qbasic
- 39.9K C and C++
- 5.6K Beginner C/C++
- 330 C/C++ on Linux/Unix
- 450 C/C++ Windows API
- 522 C++ Builder
- 253 C++ Game Development
- 3.3K C++ MFC
- 103 C++.NET
- 404 Visual C++
- 2.9K C#
- 7.9K Delphi and Kylix
- 334 Advanced Delphi
- 360 Delphi beginners
- 4 Haskell
- 9.7K Java
- 56 Enterprise JavaBeans
- 1.3K Java Beginners
- 304 Java Server Pages
- 4.1K Pascal
- 1.3K Perl
- 11 Perl 6
- 2K PHP
- 546 Python
- 37 Ruby
- 4.4K VB.NET
- 258 Advanced VB.Net
- 1.6K VBA
- 20.8K Visual Basic
- 767 Access databases and VB
- 831 Advance Visual Basic
- 1.2K Beginner VB
- 2.6K Game programming
- 315 Console programming
- 90 DirectX Game dev
- 1 Minecraft
- 112 Newbie Game Programmers
- 2 Oculus Rift
- 9K Applications
- 1.8K Computer Graphics
- 279 3D Graphics
- 129 DirectX
- 125 OpenGL
- 740 Computer Hardware
- 9 Cooling & Overclocking
- 3.4K Database & SQL
- 1.1K Access
- 91 ADO Programming
- 288 MySQL
- 358 Oracle
- 440 SQL-Server
- 535 Electronics development
- 1.6K Matlab
- 628 Sound & Music
- 25 DirectSound
- 257 XML Development
- 3.3K Classifieds
- 200 Co-operative Projects
- 198 For sale
- 190 FreeLance Software City
- 1.9K Jobs Available
- 603 Jobs Wanted
- 209 Wanted
- 2.9K Microsoft .NET
- 1.8K ASP.NET
- 1.1K .NET General
- 22 .NET WEB-Services
- 129 .NET WinForms
- 14 .NET XML
- 50 ADO.NET
- 142 C# & VB.NET School Support
- 3.4K Miscellaneous
- 4 Join the Team
- 354 Comments on this site
- 69 Computer Emulators
- 2.1K General programming
- 187 New programming languages
- 621 Off topic board
- 200 Mobile & Wireless
- 72 Android
- 126 Palm Pilot
- 338 Multimedia
- 154 Demo programming
- 184 MP3 programming
- 0 Bash scripts
- 27 Cloud Computing
- 1 Witsbits Go Cloud
- 53 FreeBSD
- 1.7K LINUX programming
- 1 Awk scripting
- 332 Linux Support
- 0 Sed scripting
- 370 MS-DOS
- 0 Shell scripting
- 321 Windows CE & Pocket PC
- 4.1K Windows programming
- 177 COM/DCOM
- 61 Networking And Security
- 17 Windows 2003 Server
- 6 Windows Vista
- 176 Windows XP
- 940 Software Development
- 417 Algorithms
- 68 Object Orientation
- 24 RUP & UML
- 91 Project Management
- 95 Quality & Testing
- 268 Security
- 63 Evil Scripting
- 81 Hacking
- 7.7K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 4 Bootstrap Themes
- 55 CGI Development
- 28 ColdFusion
- 224 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 131 Mobile Internet & Messaging
- 211 Wireless development
- 2.2K JavaScript
- 37 JQuery
- 304 WEB Servers
- 153 Apache
- 79 IIS
- 150 WEB-Services / SOAP

## Comments

: number to roman numeral? pls? pls? pls? and one thing more, will

: pascal and visual basic run on windows vista? your help would be

: very much appreciated... thank you!

It should work on Vista. Never hurts to try. Also, what in specific do you need help with for your conversion program?

: : number to roman numeral? pls? pls? pls? and one thing more, will

: : pascal and visual basic run on windows vista? your help would be

: : very much appreciated... thank you!

:

: It should work on Vista. Never hurts to try. Also, what in specific

: do you need help with for your conversion program?

: thanx.. i haven't tried installing it here in my pc... i'm scared... by the way, i'm working out on my program on how i can convert any num up to 3,000 to roman numerals... but i dont know where and how to start. this is the first time i've encountered a problem that would require me to create my own function/procedure. and i need to workon its algorithm and flowcharting, too.. if it's not too much to ask, pls tell me the right thing to do. thanks, sir...

: : : number to roman numeral? pls? pls? pls? and one thing more, will

: : : pascal and visual basic run on windows vista? your help would be

: : : very much appreciated... thank you!

: :

: : It should work on Vista. Never hurts to try. Also, what in specific

: : do you need help with for your conversion program?

: : thanx.. i haven't tried installing it here in my pc... i'm scared... by the way, i'm working out on my program on how i can convert any num up to 3,000 to roman numerals... but i dont know where and how to start. this is the first time i've encountered a problem that would require me to create my own function/procedure. and i need to workon its algorithm and flowcharting, too.. if it's not too much to ask, pls tell me the right thing to do. thanks, sir...

:

:

I've seen questions about converting decimal numbers to roman and back again several times before. Perhaps it helps if you search these forums to find those question and the approaches described in the answers.

Your basic program structure should be a loop over the decimal number. Within that loop you need to convert each digit to the correct roman equivalent.

: : : number to roman numeral? pls? pls? pls? and one thing more, will

: : : pascal and visual basic run on windows vista? your help would be

: : : very much appreciated... thank you!

: :

: : It should work on Vista. Never hurts to try. Also, what in specific

: : do you need help with for your conversion program?

: : thanx.. i haven't tried installing it here in my pc... i'm scared... by the way, i'm working out on my program on how i can convert any num up to 3,000 to roman numerals... but i dont know where and how to start. this is the first time i've encountered a problem that would require me to create my own function/procedure. and i need to workon its algorithm and flowcharting, too.. if it's not too much to ask, pls tell me the right thing to do. thanks, sir...

:

:

Hmm, a good start might be too declare what values your roman numerals would be in the constant area. Do you have any of the program started yet or are you just starting from scratch?

I will explain you the application in question.

But, you have to do it by yourself ... (if you want so) ...

So, I will start with the "pseudo-algorithm", does that exist ?,

but anyway, this is not an algorithm, neither pseudo-code, but

it the first step on every application development. Understand what you want to accomplish.

[size=2]IT'S UP TO YOU TO ANSWER ME, IN THIS THREAD, WITH AN ALGORITHM, IF YOU WANT TO CONTINUE WITH THIS. (YOU HAVE TO SHOW ME IN YOUR ALGORITHM YOU UNDERSTOOD THIS). IF THAT'S NOT THE CASE, I LOST MY TIME AND BETTER LOOK IN OTHER POST WHERE I POSTED THE FULL SOURCE CODE IN JAVA. (If you want to)[/size]

------------------------------------------------------

Pseudo-algorithm ... (Does that exist?)

In this example we are going to convert a value from Arabic to Roman, to make it easy I choose 2945.

We make acknowledge of meanings :

[code]1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1

"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"[/code]

First, we take the number and divide by the most highest Roman value we can have. In this case the most highest value is 1000 which is represented by "M" on Roman numeric system.

2945 / 1000 = 2.945

Then, we concatenates the figure "M" so many times as the integer result from the previous division; and we get "MM" (2 times) which means 2 thousands.

Now, we make the same division but store only the modulus of such operation, (the modulus is the remainder of a integer division) and make it our new number to work with.

2945 % 1000 = 945

Then, our new number is 945, we make the same operation on the first step, but now we use 900 which is represented by "CM".

945 / 900 = 1.05

Again, we repeat the step of concatenation of the figure in question, so many times as the integer result from the previous operation; and we get "CM" (1 time, is impossible to have something different 1 or 0, but still important because we can get 0). We add the first concatenation which gave us "MM", so we get "MMCM" which means 2900.

So, we repeat the modulus operation again with the corresponding values "now in turn".

945 % 900 = 45

Ok, now we repeat the previus operations, you had two examples by now, so i will simplify ...

45 / 500 = 0 (The real thing is 0.09, but the 0 is what matters)

This step gave us nothing to add, but still has to get the remainder,

45 % 500 = 45

Hey, like you saw, nothing happended, because 500 is not inside 45 (it's not divisible). We make the same steps with 400, 100, 90, 50 ... and those gave us nothing too. Until 40 ... we make the same operations again ...

45 / 40 = 1.125

45 % 40 = 5

Now we got 1 in the division, so we concatenates "XL" which means 40 so many times as the integer division (1 time). And with the previous result of "MMCM" we got earlier, we got "MMCMXL", now we have 2940.

We made the same steps with 10, 9 and got nothing.

At 5, we have to do the same procedure and we add "V".

Now we have "MMCMXLV" which means 2945.

Still have to do it with 4 and 1, because the number could have been 2944 or 2947, but with the same procedure we will get the correct result.

Now we have the result and display on the screen.

MMCMXLV = 2945.

the most highest value on roman is m (small m).

it means a billion or something like that, in this example I will not use it. (Even when is the same procedure)

[red]Good luck![/red]

[blue]Hackman[/blue]

: I will explain you the application in question.

: But, you have to do it by yourself ... (if you want so) ...

:

: So, I will start with the "pseudo-algorithm", does that exist ?,

: but anyway, this is not an algorithm, neither pseudo-code, but

: it the first step on every application development. Understand what

: you want to accomplish.

:

: [size=2]IT'S UP TO YOU TO ANSWER ME, IN THIS THREAD, WITH AN

: ALGORITHM, IF YOU WANT TO CONTINUE WITH THIS. (YOU HAVE TO SHOW ME

: IN YOUR ALGORITHM YOU UNDERSTOOD THIS). IF THAT'S NOT THE CASE, I

: LOST MY TIME AND BETTER LOOK IN OTHER POST WHERE I POSTED THE FULL

: SOURCE CODE IN JAVA. (If you want to)[/size]

:

: ------------------------------------------------------

:

: Pseudo-algorithm ... (Does that exist?)

:

: In this example we are going to convert a value from Arabic to

: Roman, to make it easy I choose 2945.

:

: We make acknowledge of meanings :

: [code]: 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1

: "M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"[/code]:

: First, we take the number and divide by the most highest Roman value

: we can have. In this case the most highest value is 1000 which is

: represented by "M" on Roman numeric system.

:

: 2945 / 1000 = 2.945

:

: Then, we concatenates the figure "M" so many times as the integer

: result from the previous division; and we get "MM" (2 times) which

: means 2 thousands.

:

: Now, we make the same division but store only the modulus of such

: operation, (the modulus is the remainder of a integer division) and

: make it our new number to work with.

:

: 2945 % 1000 = 945

:

: Then, our new number is 945, we make the same operation on the first

: step, but now we use 900 which is represented by "CM".

:

: 945 / 900 = 1.05

:

: Again, we repeat the step of concatenation of the figure in

: question, so many times as the integer result from the previous

: operation; and we get "CM" (1 time, is impossible to have something

: different 1 or 0, but still important because we can get 0). We add

: the first concatenation which gave us "MM", so we get "MMCM" which

: means 2900.

:

: So, we repeat the modulus operation again with the corresponding

: values "now in turn".

:

: 945 % 900 = 45

:

: Ok, now we repeat the previus operations, you had two examples by

: now, so i will simplify ...

:

: 45 / 500 = 0 (The real thing is 0.09, but the 0 is what matters)

:

: This step gave us nothing to add, but still has to get the remainder,

:

: 45 % 500 = 45

:

: Hey, like you saw, nothing happended, because 500 is not inside 45

: (it's not divisible). We make the same steps with 400, 100, 90, 50

: ... and those gave us nothing too. Until 40 ... we make the same

: operations again ...

:

: 45 / 40 = 1.125

: 45 % 40 = 5

:

: Now we got 1 in the division, so we concatenates "XL" which means 40

: so many times as the integer division (1 time). And with the

: previous result of "MMCM" we got earlier, we got "MMCMXL", now we

: have 2940.

:

: We made the same steps with 10, 9 and got nothing.

: At 5, we have to do the same procedure and we add "V".

: Now we have "MMCMXLV" which means 2945.

:

: Still have to do it with 4 and 1, because the number could have been

: 2944 or 2947, but with the same procedure we will get the correct

: result.

:

: Now we have the result and display on the screen.

:

: MMCMXLV = 2945.

:

: the most highest value on roman is m (small m).

: it means a billion or something like that, in this example I will

: not use it. (Even when is the same procedure)

:

: [red]Good luck![/red]

: [blue]Hackman[/blue]

:hey, thank you so much for your help... yes, i am starting from a scratch and i really cant figure out what to do and where to start. although we've done the same thing before with decimal to binary coversion. we also did the same procedure with the denomination or breakdown of an amount entered from the highest to the lowest denomination of our money. fortunately, i was the first one to get the correct procedure. but with this one, i dont know what happened to me and i seem to get confused. and my instructor is insisting on not using the concat or any other procedure just the if-then-else conditional statement. and i just thought, "oh gooodness.. it might take me forever." anyway, i really appreciate your help, sir. i promise not to use what you just shared to me to cheat.. i will study all those procedure that you gave me... thank you so much.