摘要:
题目:1396Large Caclulating Work思路:题目意思很绕,但是化简之后发现其实就是求n个数的最大公约数#include #include #include #include #include using namespace std;long long gcd(long long a,long long b){ if(b==0) return a; return gcd(b,a%b);}int main(){ int t; int cas=0; while(scanf("%d",&t),t) { int n,an... 阅读全文
摘要:
题目:1563Prime Numbers思路:素数打表+记录#include #include #include #include #include using namespace std;const int maxn =1000000 +10;bool vis[maxn];int dp[maxn];int main(){ memset(vis,true,sizeof(vis)); vis[0]=vis[1]=0; for(int i=2;i*i<maxn;i++) { if(vis[i]) for(int j=2*i;j<maxn;... 阅读全文