{"id":16963696,"url":"https://github.com/pedroka-dev/roman-numerals","last_synced_at":"2025-07-18T06:35:44.338Z","repository":{"id":117619625,"uuid":"375775759","full_name":"pedroka-dev/Roman-Numerals","owner":"pedroka-dev","description":"🏛 C# app that can convert integers to roman numerals","archived":false,"fork":false,"pushed_at":"2024-06-11T19:33:36.000Z","size":1375,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-21T16:33:36.618Z","etag":null,"topics":["coding-exercise","csharp"],"latest_commit_sha":null,"homepage":"","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/pedroka-dev.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-06-10T17:18:29.000Z","updated_at":"2024-06-20T23:52:00.000Z","dependencies_parsed_at":null,"dependency_job_id":"96a94da0-e7f9-48e2-84e9-0b908391cd35","html_url":"https://github.com/pedroka-dev/Roman-Numerals","commit_stats":null,"previous_names":["pedroka-dev/roman-numerals"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/pedroka-dev/Roman-Numerals","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pedroka-dev%2FRoman-Numerals","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pedroka-dev%2FRoman-Numerals/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pedroka-dev%2FRoman-Numerals/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pedroka-dev%2FRoman-Numerals/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pedroka-dev","download_url":"https://codeload.github.com/pedroka-dev/Roman-Numerals/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pedroka-dev%2FRoman-Numerals/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":265711056,"owners_count":23815462,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["coding-exercise","csharp"],"created_at":"2024-10-13T23:25:47.192Z","updated_at":"2025-07-18T06:35:44.289Z","avatar_url":"https://github.com/pedroka-dev.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Roman-Numerals\nA app that can convert integers to roman numerals\n\n\n# The Problem\n\nThe Roman numeral system developed in Ancient Rome and was used throughout its Empire.\n\nIn this system, numbers are written using specific letters, each representing certain values. The letters are always uppercase, as there are no lowercase letters in the Roman alphabet. The letters are I, V, X, L, C, D, and M.\n\nYour task is to develop a program that converts Indo-Arabic numbers to the Roman format and vice versa.\n\nThe rules for forming Roman numerals are presented below.\n\nEach letter corresponds to a specific value:\n\nI = 1\n\nV = 5\n\nX = 10\n\nL = 50\n\nC = 100\n\nD = 500\n\nM = 1000\n\nBy grouping the above letters, we can represent numbers according to a set of rules:\n\nWith the exception of V, L, and D, other numerals can be repeated a maximum of three times:\n\nIII = 3\n\nXXX = 30\n\nCCC = 300\n\nMMM = 3000\n\nFor numbers from 4000 onwards, the digits are the same as for the units (IV, V, VI, VII, VIII, IX, X), but with a macron (bar) over the digit:\n\nĪV̄ = 4000\n\nV̄ = 5000\n\nV̄Ī = 6000\n\nV̄ĪĪ = 7000\n\nV̄ĪĪĪ = 8000\n\nĪX̄ = 9000\n\nX̄ = 10000\n\nWhen written to the right of larger numerals, I, X, and C are added to the values of the preceding numerals:\n\nVIII = 5 + 1 + 1 + 1 = 8\n\nLXII = 50 + 10 + 1 + 1 = 62\n\nCLVIII = 158\n\nMCXX = 1000 + 100 + 10 + 10 = 1120\n\nBut if the numerals I, X, and C are to the left of larger numerals, their values are subtracted, as in:\n\nIV = 5 - 1 = 4\n\nIX = 10 - 1 = 9\n\nXC = 100 - 10 = 90\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpedroka-dev%2Froman-numerals","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpedroka-dev%2Froman-numerals","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpedroka-dev%2Froman-numerals/lists"}