摘要: 位运算快速版: #include<iostream> using namespace std; long sum,upperlim=1; void test(long row,long ld,long rd) { if(row!=upperlim) { long pos=upperlim&~(row 阅读全文
posted @ 2020-03-30 16:06 BlueValentines 阅读(102) 评论(0) 推荐(0)
摘要: import java.util.Scanner; public class Main { public static final int[] prime = { 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 阅读全文
posted @ 2020-03-30 09:31 BlueValentines 阅读(105) 评论(0) 推荐(0)