{"id":16451525,"url":"https://github.com/pauldraper/paul-test","last_synced_at":"2026-02-01T02:31:29.304Z","repository":{"id":67767389,"uuid":"71449957","full_name":"pauldraper/paul-test","owner":"pauldraper","description":null,"archived":false,"fork":false,"pushed_at":"2016-10-20T10:48:20.000Z","size":11,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-19T13:53:53.879Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/pauldraper.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2016-10-20T10:00:46.000Z","updated_at":"2016-10-20T10:00:46.000Z","dependencies_parsed_at":"2023-02-23T23:00:45.015Z","dependency_job_id":null,"html_url":"https://github.com/pauldraper/paul-test","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/pauldraper/paul-test","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pauldraper%2Fpaul-test","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pauldraper%2Fpaul-test/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pauldraper%2Fpaul-test/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pauldraper%2Fpaul-test/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pauldraper","download_url":"https://codeload.github.com/pauldraper/paul-test/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pauldraper%2Fpaul-test/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28965341,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-01T02:14:24.993Z","status":"ssl_error","status_checked_at":"2026-02-01T02:13:55.706Z","response_time":56,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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-11T10:09:08.825Z","updated_at":"2026-02-01T02:31:29.289Z","avatar_url":"https://github.com/pauldraper.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# No squares2\n\n\u003cimg align=\"right\" src=\"http://imgs.xkcd.com/comics/factoring_the_time.png\" title=\"I occasionally do this with mile markers on the highway.\" alt=\"Factoring the Time\" height=\"300\"\u003e\n\n## Description\n\n**Factoring** a positive integer is decomposing it into a product of one or more integers greater than 1. For example, 24 can be factored as 24, 2×12, 3×8, 4×6, 2×2×6, 2×3×4, or 2×2×2×3.\n\nA **square** is an integer that can be factored as two equal integers. For example, 4 is square because it can be factored as 2×2.\n\nIf a factoring has any factor that is divisible by a square greater than 1, let's call it **squarish**. For example, since 4 is a square, five of the factorings of 24 are squarish: 24, 2×12, 3×8, 4×6, and 2×3×4. That leaves two non-squarish factorings: 2×2×6 and 2×2×2×3.\n\nGiven a postive integer, find the shortest possible length of a non-squarish factoring. For example, for 24, the shortest possible length is three (2×2×6).\n\n## Input\n\nAn integer between 2 and 2,000,000 inclusive.\n\n## Output\n\nThe shortest length of the integer's non-squarish factoring.\n\n## Examples\n\n### Input 1\n\n```\n24\n```\n\n### Output 1\n\n```\n3\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpauldraper%2Fpaul-test","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpauldraper%2Fpaul-test","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpauldraper%2Fpaul-test/lists"}