{"id":16320752,"url":"https://github.com/ntoll/dojotaskgen","last_synced_at":"2025-05-14T08:11:10.795Z","repository":{"id":31224745,"uuid":"34785888","full_name":"ntoll/dojotaskgen","owner":"ntoll","description":"Generates fun programming tasks for a code dojo. :-)","archived":false,"fork":false,"pushed_at":"2015-04-29T09:58:40.000Z","size":124,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-17T01:44:03.109Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","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/ntoll.png","metadata":{"files":{"readme":"README.rst","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}},"created_at":"2015-04-29T09:49:57.000Z","updated_at":"2015-04-29T09:58:41.000Z","dependencies_parsed_at":"2022-08-03T08:00:31.587Z","dependency_job_id":null,"html_url":"https://github.com/ntoll/dojotaskgen","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/ntoll%2Fdojotaskgen","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ntoll%2Fdojotaskgen/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ntoll%2Fdojotaskgen/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ntoll%2Fdojotaskgen/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ntoll","download_url":"https://codeload.github.com/ntoll/dojotaskgen/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254101559,"owners_count":22014908,"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-10-10T22:45:21.816Z","updated_at":"2025-05-14T08:11:05.787Z","avatar_url":"https://github.com/ntoll.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"Dojo Task Generator\n===================\n\nGenerating new tasks for the London Python Code Dojo can be an onerous process.\nOften suggestions are silly, incomprehensible, too complicated given the\namount of time we have in the dojo and/or obscure. It's also important to make\nsuch tasks fun.\n\nOne of the regular suggestions for a task for the dojo to solve is a dojo\ntask generator. It's a joke among regular attendees.\n\nHowever, I've decided to bite the bullet and this small Python script will\ngenerate dojo ideas based upon programming exercises listed on the website\nhttp://programmingpraxis.com/.\n\nHow Does it Work?\n-----------------\n\nPut simply, it's a scraper that first downloads all the exercises and then\nsuggests one of them.\n\nUsage\n-----\n\nRemeber to install the requirements::\n\n    $ pip install -r requirements.txt\n\nIt's a simple Python script, so run it like this::\n\n    $ python taskgen.py\n\nIf it's the first time you've run the script it will scrape the exercises and\nstore them to a local ``tasks.json`` file. It will then output a suggested task.\nIf you wish to refresh the task cache use the ``refresh`` argument::\n\n    $ python taskgen.py refresh\n\nThat's it!\n\nMany thanks to ProgrammingPraxis for being such a wonderful source of\nprogramming exercises.\n\nExample Output\n--------------\n\n::\n\n    Modular Factorial\n\n    December 13, 2013 - http://programmingpraxis.com/2013/12/13/modular-factorial/\n\n\n    This question appears from time to time as an interview question or on the\n    coding-challenge web sites.\n\n    \u003e Write a function that calculates _ n! _ (mod _ p _ ) when _ p _ is prime.\n    Then extend the function to calculate _ n! _ (mod _ m _ ) when _ m _ is not\n    prime. Can you calculate the factorials using fewer than _ n _ −1 modular\n    multiplications?\n\n    For instance, 1000000! (mod 1001001779) is 744950559.\n\n    Your task is to write the indicated functions. When you are finished, you are\n    welcome to [ read ](/2013/12/13/modular-factorial/2/) or [ run\n    ](http://programmingpraxis.codepad.org/HZwVjALJ) a suggested solution, or to\n    post your own solution or discuss the exercise in the comments below.\n\n    Pages: [ 1 ](http://programmingpraxis.com/2013/12/13/modular-factorial/) [ 2\n    ](http://programmingpraxis.com/2013/12/13/modular-factorial/2/)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fntoll%2Fdojotaskgen","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fntoll%2Fdojotaskgen","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fntoll%2Fdojotaskgen/lists"}