{"id":21002867,"url":"https://github.com/mobluse/uva-oj","last_synced_at":"2026-04-21T22:33:43.624Z","repository":{"id":80543051,"uuid":"102416154","full_name":"mobluse/uva-oj","owner":"mobluse","description":"Accepted solutions for UVa Online Judge in Python 3, Pascal, C, C++, Java","archived":false,"fork":false,"pushed_at":"2017-10-04T09:09:53.000Z","size":29,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-20T10:09:44.356Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"https://uva.onlinejudge.org/","language":"Java","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/mobluse.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":"2017-09-05T00:56:34.000Z","updated_at":"2018-03-12T16:00:21.000Z","dependencies_parsed_at":"2023-04-07T18:47:38.612Z","dependency_job_id":null,"html_url":"https://github.com/mobluse/uva-oj","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mobluse%2Fuva-oj","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mobluse%2Fuva-oj/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mobluse%2Fuva-oj/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mobluse%2Fuva-oj/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mobluse","download_url":"https://codeload.github.com/mobluse/uva-oj/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243419128,"owners_count":20287806,"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":[],"created_at":"2024-11-19T08:20:40.778Z","updated_at":"2025-12-29T22:44:11.068Z","avatar_url":"https://github.com/mobluse.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# UVa Online Judge\nSome of my accepted solutions for [UVa Online Judge](https://uva.onlinejudge.org/) in these programming languages:\n\nLanguage Code | Version | Online IDE | Options | Extension\n------------- | ----- | ------------ | ------- | ---------\nPYTH3         | 3.5.1 | [Python 3](https://www.tutorialspoint.com/execute_python3_online.php) |  | py\nPASCAL        | 3.0.0 | [Free Pascal Compiler](https://www.tutorialspoint.com/compile_pascal_online.php) | -vw -Sd | pas\nANSI C        | 5.3.0 | [GNU C Compiler](https://www.tutorialspoint.com/compile_c99_online.php) | -lm -lcrypt -O2 -pipe -ansi | c\nC++           | 5.3.0 | [GNU C++ Compiler](https://www.tutorialspoint.com/compile_cpp_online.php) | -lm -lcrypt -O2 -pipe | cpp\nC++11         | 5.3.0 | [GNU C++ Compiler](https://www.tutorialspoint.com/compile_cpp11_online.php) | -lm -lcrypt -O2 -pipe -std=c++11 | cpp\nJAVA          | 1.8.0 | [OpenJDK Java](https://www.tutorialspoint.com/compile_java8_online.php) |  | java\n\nThey were ordered in compiler speed. Pascal, C, C++ and C++11 runs in 0.000 s for these problems. Python3, Pascal and Java\nhave bounds checking of arrays. C and C++ can have bounds checking if you \nuse CERN [ROOT](../master/root-system.md) or [Valgrind](https://en.wikipedia.org/wiki/Valgrind). ROOT series 5 also\nhas a debugger, but ROOT series 6 doesn't seem to have this.\n\nIn my cases, so far, C++ and C++11 use the same file.\n\nI only solve rather simple problems here and no assignments. You can store private files on Bitbucket or Google Drive and \ndownload using e.g.:  \n$ git clone https://USERNAME@bitbucket.org/USERNAME/uva-oj.git  \nPassword for 'https://USERNAME@bitbucket.org':  \n$ wget -O main.cpp --no-check-certificate 'https://docs.google.com/uc?export=download\u0026id=0B6gtvGVfzmdySGZSUzhBSkU2VDg'\n\n| Problem | Solution |\n| ------- | -------- |\n| [11044\tSearching for Nessy](https://uva.onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026page=show_problem\u0026problem=1985) | [Solutions](https://github.com/mobluse/uva/tree/master/11044) |\n\n## Ranking\nThe programs are tested, and are ranked based on running time, but if they have the same running time in whole milliseconds, then they \nare ranked after submission date -- oldest first. One can use different programming languages, but those who generate fastest code have \nan advantage in the ranking. If one submits a faster program it replaces the old solution and you probably rise in total ranking on \nUVa O J. If you submit a program that isn't accepted you probably loose a bit in total ranking, but having many accepted solutions \nare more important for total ranking.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmobluse%2Fuva-oj","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmobluse%2Fuva-oj","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmobluse%2Fuva-oj/lists"}