摘要:
求一个半径最小的圆使其内部至少包含 m 个点 阅读全文
摘要:
ll prime[100]; ll cnt; void getprime(){ cnt = 0; ll num = m; for(ll i = 2; i*i 1) prime[cnt++] = num; } void solve() { ll ans = 0; // cnt 下标从0开始 for(ll i = 1; i < (1<<cnt); i++... 阅读全文
摘要:
E . You promised your girlfriend a rounded cake with at least SSS strawberries. But something goes wrong, you don't have the final cake but an infinit 阅读全文