Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P1226\":[\"快速幂\",107134,\"模板\"],\"洛谷-B3736\":[\"最大公约数\",8119,\"信息与未来 2018\"],\"洛谷-P3811\":[\"模意义下的乘法逆元\",36384,\"模板\"],\"洛谷-P3383\":[\"线性筛素数\",92689,\"模板\"],\"LibreOJ-161\":[\"乘法逆元 2\",1121,null],\"计蒜客-T1399\":[\"最大公约数(一)\",2608,null],\"洛谷-P1075\":[\"质因数分解\",182763,\"NOIP2012 普及组\"],\"CodeForces-1771C\":[\"Hossam and Trainees\",9296,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1771\\\"\\u003eCodeforces Round 837 (Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-110\":[\"乘法逆元\",3245,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"green_hill","updateTime":1697957484000,"title":"SCPC make practice","dislikeCnt":0,"content":"[problem:洛谷-P1226] 快速幂\n[problem:洛谷-P1075]质因数分解\n[problem:洛谷-P3383]线性筛素数\n[problem:洛谷-P3811]质因数分解\n[problem:洛谷-B3736]最大公约数 gcd\n[problem:计蒜客-T1399]最大公约数\n[problem:LibreOJ-110]乘法逆元\n[problem:LibreOJ-161]乘法逆元2\n[problem:CodeForces-1771C] 欧拉筛的运用\n\n对于洛谷的题目,最好在洛谷网站提交,vj 好像提交不了,其他vj都可以支持提交。","threadId":173949,"likeCnt":0,"createTime":1697954757000,"isWorkbook":true,"viewCnt":325,"openness":2,"fav":false,"id":4200,"trustable":false}