{"payload":{"header_redesign_enabled":false,"results":[{"id":"110298472","archived":false,"color":"#f34b7d","followers":3,"has_funding_file":false,"hl_name":"Vitaliy-Grigoriev/FrobeniusNumber","hl_trunc_description":"The coin problem (Frobenius problem) is a mathematical problem that asks what is the largest monetary amount that cannot be obtained usin…","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":110298472,"name":"FrobeniusNumber","owner_id":14265543,"owner_login":"Vitaliy-Grigoriev","updated_at":"2017-11-10T22:52:12.607Z","has_issues":true}},"sponsorable":false,"topics":["algorithm","discrete-mathematics","coin","number-theory","integer-arithmetic","mathworld","denomination","combinatorial-group-theory","frobenius","coin-problem","frobenius-number","frobenius-equation","frobenius-problem"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":61,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253AVitaliy-Grigoriev%252FFrobeniusNumber%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/Vitaliy-Grigoriev/FrobeniusNumber/star":{"post":"UwmdYEQFW0S0Y_OGNA1qr8DvHTfBygr7SGgNAQ1Vi_o_gE5uKxabITI6QSM7bpFE9ILq4I3k2DADoYyS-lIQOg"},"/Vitaliy-Grigoriev/FrobeniusNumber/unstar":{"post":"5RrTLD-j0QqLmjP7TFPyYSlc8drbVL0QSvBTp3AIie4yPPZ9xmC4fX1byIe7xDmaVj3cA9Rxla2FPD7IuRvfXw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"8JuOBu6k-FpoobtjEV2w_mPy63xFNHD-PIegkeNmNX_pQtRyckftuiz4x-79dn-_0CGq7oiuMiAtAd-GXXBCGg"}}},"title":"Repository search results"}