摘要：
求一个数能够被连续的素数的和组成有几种方法：直接用暴力;View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<cstring>using namespace std;int prime[2024],cnt,sum;void Prime( ){ bool hash[5024] = { 0 }; int t = ( int )sqrt( 10000.0 ) + 1; for( 阅读全文
摘要：
题意：给定你一个以质数为底表示的数；问你这个数减1，之后用质数为底的表示法。例如：17 1 = 17^1 =17 - 1；5 1 2 1 = 5^1*2^1=10 - 1；2 4= 2^4 = 163 2 = 3^2= 9;View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<cstring>using namespace std;int prime[4024],cnt; 阅读全文
摘要：
题意：输入m, n, d。求出m,m+1,m+2,````m+n的一个排列。使得任意的连续k个数之和都为合数，2<=k<=d。注意如果开始时连续数小于d时也要是合数；用DFS暴力搜索；View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<cstring>using namespace std;int num[1024],S,E,d;;bool visit[10 阅读全文
摘要：
这个题是求外心的问题；我们可以用直线相交做，也可以用向量做；直线相交：View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<map>#include<cstring>#include<vector>using namespace std;class Point{publ 阅读全文