![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
project euler
_bibibibi
人蠢,分低,刷题少...
展开
-
PE 001 Multiples of 3 and 5
题目链接:https://projecteuler.net/problem=1暴力就好了代码:#include<bits/stdc++.h>using namespace std;typedef long long ll;int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); ...原创 2018-02-28 20:07:40 · 118 阅读 · 0 评论 -
PE 021 Amicable numbers
题目链接:https://projecteuler.net/problem=21埃筛筛出来所有的d就好了代码:#include<bits/stdc++.h>using namespace std;const int MAXN=1e5+5;int d[MAXN];void init(){ for(int i=1;i<MAXN;i++) { for(int j=i+...原创 2018-03-04 16:21:49 · 199 阅读 · 0 评论 -
PE 022 Names score
题目链接:直接模拟就好了代码:#include<bits/stdc++.h>using namespace std;typedef long long ll;string names[]={"MARY","PATRICIA","LINDA","BARBARA","ELIZABETH","JENNIFER","MARIA","S原创 2018-03-04 16:30:37 · 4229 阅读 · 0 评论 -
PE 023 Non-abundant sums
题目链接:https://projecteuler.net/problem=23最暴力的解法了,直接枚举28123内的所有数字,然后O(n)判读,肯定有时间复杂度更小的解法?代码:#include<bits/stdc++.h>using namespace std;const int MAXN=1e5+5;typedef long long ll;int d[MAXN];bo...原创 2018-03-04 16:48:09 · 214 阅读 · 0 评论 -
PE 024 Lexicographic permutations
题目链接:https://projecteuler.net/problem=24直接next_permutation暴力就好了,跑得挺快的代码:#include<bits/stdc++.h>using namespace std;int a[]={0,1,2,3,4,5,6,7,8,9};int main(){ //freopen("in.txt","r",stdin); ...原创 2018-03-04 16:56:39 · 169 阅读 · 0 评论 -
PE 025 1000-digit Fibonacci number
题目链接:https://projecteuler.net/problem=25直接python暴力代码:a=[]a.append(1)a.append(1)a=list(map(int,a))cnt=int(3)while True: a.append(a[-1]+a[-2]) if(len(str(a[-1]))>=1000): break cnt+=1print(...原创 2018-03-04 17:06:36 · 203 阅读 · 0 评论 -
PE 028 Number spiral diagonals
题目链接:https://projecteuler.net/problem=28找规律代码:#include<bits/stdc++.h>using namespace std;typedef long long ll;int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); l...原创 2018-03-11 21:51:27 · 124 阅读 · 0 评论 -
PE 029 Distinct powers
题目链接:https://projecteuler.net/problem=29python暴力代码:import numpy as npx=[]for i in range(2,101): for j in range(2,101): x.append(i**j)x=np.asarray(x)print(np.unique(x).shape)...原创 2018-03-11 22:06:12 · 231 阅读 · 0 评论 -
PE 030 Digit fifth powers
题目链接:https://projecteuler.net/problem=30(9^5)*10=590490所以答案直接暴力就行了代码:#include<bits/stdc++.h>using namespace std;int pow5(int x){ return x*x*x*x*x;}int main(){ //freopen("in.txt","r",stdi...原创 2018-03-11 22:10:45 · 591 阅读 · 0 评论 -
PE 031 Coin sums
题目链接:https://projecteuler.net/problem=31完全背包代码:#include<bits/stdc++.h>using namespace std;const int MAXN=205;int val[]={1,2,5,10,20,50,100,200};int dp[MAXN];int main(){ //freopen("in.txt"...原创 2018-03-11 22:14:03 · 187 阅读 · 0 评论 -
PE 032 Pandigital products
题目链接:https://projecteuler.net/problem=32直接枚举所有的排列然后暴力就好了代码:#include<bits/stdc++.h>using namespace std;typedef long long ll;int x[]={1,2,3,4,5,6,7,8,9};map<int,bool> bk;int main(){ /...原创 2018-03-11 22:22:03 · 140 阅读 · 0 评论 -
PE 026 Reciprocal cycles
题目链接:https://projecteuler.net/problem=26标记当前余数,如果某个余数出现过,则存在循环节,直接dfs即可代码:#include<bits/stdc++.h>using namespace std;const int MAXN=10005;int vis[MAXN];int ans=0,mx=0;void dfs(int now,int d...原创 2018-03-04 21:08:13 · 184 阅读 · 0 评论 -
PE 027 Quadratic primes
题目链接:https://projecteuler.net/problem=27首先,b一定是个素数,我们枚举1000以内的素数,然后在(-1000,1000)范围内枚举a,然后暴力判断就好了,显然最后的结果n一定小于b代码:#include<bits/stdc++.h>using namespace std;const int MAXN=3e6+5;int prime[MAXN...原创 2018-03-04 21:26:30 · 187 阅读 · 0 评论 -
PE 033 Digit cancelling fractions
题目链接:https://projecteuler.net/problem=33除了暴力,我没想到其他的办法啊。。。代码:#include<bits/stdc++.h>using namespace std;int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); int X=1...原创 2018-03-12 20:54:10 · 190 阅读 · 0 评论 -
PE 034 Digit factorials
题目链接:https://projecteuler.net/problem=34理性分析一下,发现暴力到1e6肯定是够的代码:#include<bits/stdc++.h>using namespace std;int fac[10];void init(){ fac[0]=1; for(int i=1;i<=9;i++) { fac[i]=fac[i-1]*i...原创 2018-03-12 20:58:17 · 495 阅读 · 0 评论 -
PE 035 Circular primes
题目链接:https://projecteuler.net/problem=35直接暴力所有1e6之内素数就好了代码:#include<bits/stdc++.h>using namespace std;const int MAXN=1e6+5;int prime[MAXN],pow10[10];;//保存素数 bool vis[MAXN];//初始化 int cnt=0;...原创 2018-03-12 21:08:57 · 208 阅读 · 0 评论 -
PE 036 Double-base palindromes
题目链接:https://projecteuler.net/problem=36还是暴力,不考虑复杂度的话,string判断回文串可能写的会快一点代码:#include<bits/stdc++.h>using namespace std;const int MAXN=25;bool judge10(int x){ string s; while(x) { s+=(x%...原创 2018-03-12 21:16:27 · 195 阅读 · 0 评论 -
PE 020 Factorial digit sum
题目链接:https://projecteuler.net/problem=20有了python,再也不怕高精度了代码:cnt=int(1)for i in range(1,101): cnt*=int(i)ans=0while cnt>0: ans+=(cnt%10) cnt//=10print(ans)...原创 2018-03-04 16:13:23 · 140 阅读 · 0 评论 -
PE 019 Counting Sundays
题目链接:https://projecteuler.net/problem=19蔡勒公式跑一下就好了代码:#include<bits/stdc++.h>using namespace std;int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); int ans=0; for...原创 2018-03-04 16:06:31 · 146 阅读 · 0 评论 -
PE 018 Maximum path sum I
题目链接:https://projecteuler.net/problem=18很基础的dp题目代码:#include<bits/stdc++.h>using namespace std;const int MAXN=20;int sv[MAXN][MAXN];int dp[MAXN][MAXN];int main(){ //freopen("in.txt","r",st...原创 2018-03-04 16:00:51 · 111 阅读 · 0 评论 -
PE 002 Even Fibonacci numbers
题目链接:https://projecteuler.net/problem=2按题意模拟即可代码:#include<bits/stdc++.h>using namespace std;typedef long long ll;const int MAXN=4e6+5;int dp[MAXN];int main(){ //freopen("in.txt","r",stdin...原创 2018-02-28 20:14:51 · 138 阅读 · 0 评论 -
PE 003 Largest prime factor
题目链接:https://projecteuler.net/problem=3sqrt(n)判因子,然后sqrt(n)判断质数即可代码:#include<bits/stdc++.h>using namespace std;typedef long long ll;ll aim=600851475143LL;bool judge(ll x){ for(ll i=2;i*i&l...原创 2018-02-28 20:20:17 · 126 阅读 · 0 评论 -
PE 004 Largest palindrome product
题目链接:https://projecteuler.net/problem=4暴力即可代码:#include<bits/stdc++.h>using namespace std;bool judge(int x){ string res; while(x) { res+=(x%10)+'0'; x/=10; } int len=res.size(); int ...原创 2018-02-28 20:27:41 · 129 阅读 · 0 评论 -
PE 005 Smallest multiple
题目链接:https://projecteuler.net/problem=5求最大公约数就好了代码:#include<bits/stdc++.h>using namespace std;int lcm(int x,int y){ return x/__gcd(x,y)*y;}int main(){ //freopen("in.txt","r",stdin); //f...原创 2018-02-28 20:31:49 · 130 阅读 · 0 评论 -
PE 006 Sum square difference
题目链接:https://projecteuler.net/problem=6按题意模拟即可代码:#include<bits/stdc++.h>using namespace std;typedef long long ll;int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout);...原创 2018-02-28 20:37:48 · 175 阅读 · 0 评论 -
PE 006 10001st prime
题目链接:https://projecteuler.net/problem=7跑个素数筛即可代码:#include<bits/stdc++.h>using namespace std;const int MAXN=1e6+5;int prime[MAXN];//保存素数 bool vis[MAXN];//初始化 int cnt=0;void Prime(int n=MAXN...原创 2018-02-28 20:41:47 · 144 阅读 · 0 评论 -
PE 008 Largest product in a series
题目链接:https://projecteuler.net/problem=8暴暴暴代码:#include<bits/stdc++.h>using namespace std;typedef long long ll;string s="731671765313306249192251196744265747423553491949349698352031277450632623...原创 2018-02-28 20:47:38 · 195 阅读 · 0 评论 -
PE 009 Special Pythagorean triplet
题目链接:https://projecteuler.net/problem=9暴暴暴代码:#include<bits/stdc++.h>using namespace std;int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); for(int i=1;i<=1000;...原创 2018-02-28 20:51:23 · 180 阅读 · 0 评论 -
PE 010 Summation of primes
题目链接:https://projecteuler.net/problem=10素数筛代码:#include<bits/stdc++.h>using namespace std;typedef long long ll;const int MAXN=2e6+5;int prime[MAXN];//保存素数 bool vis[MAXN];//初始化 int cnt=0;vo...原创 2018-02-28 20:55:32 · 119 阅读 · 0 评论 -
PE 011 Largest product in a grid
题目链接:https://projecteuler.net/problem=11还是暴力啊?代码:#include<bits/stdc++.h>using namespace std;int sv[22][22];int dir[4][2]={{1,0},{0,1},{1,1},{1,-1}};bool judge(int x,int y){ if(x<0||x>...原创 2018-02-28 21:12:17 · 186 阅读 · 0 评论 -
PE 012 Highly divisible triangular number
题目链接:https://projecteuler.net/problem=12本来以为预处理会快一点,结果还是得暴力,答案太大了代码:#include<bits/stdc++.h>using namespace std;int cnt(int x){ int ret=0; for(int i=1;i*i<=x;i++) { if(x%i==0) { r...原创 2018-02-28 21:21:53 · 138 阅读 · 0 评论 -
PE 013 Large sum
题目链接:https://projecteuler.net/problem=13python大法好代码:sum=0for i in range(100): a=int(input()) sum+=aprint(str(sum)[0:10])原创 2018-02-28 21:29:17 · 146 阅读 · 0 评论 -
PE 014 Longest Collatz sequence
题目链接:https://projecteuler.net/problem=14记忆化搜索,中间会爆int代码:#include<bits/stdc++.h>using namespace std;typedef long long ll;map<ll,int> dp;int dfs(ll now){ if(dp.find(now)!=dp.end()) r...原创 2018-03-01 20:08:27 · 123 阅读 · 0 评论 -
PE 015 Lattice paths
题目链接:https://projecteuler.net/problem=15组合数学,答案就是C(40,20),因为一共40步,我们要选20步向下,剩下的向右,所以答案是C(40,20)代码:import numpy as npdp=np.zeros((50,50))dp[0][0]=1for i in range(1,41): dp[i][0]=1 for j in range(1...原创 2018-03-01 21:06:52 · 362 阅读 · 0 评论 -
PE 016 Power digit sum
题目链接:https://projecteuler.net/problem=16python搞一搞就行代码:x=2**1000ans=0while x>0: ans+=(x%10) x=x//10print(ans)原创 2018-03-01 21:43:47 · 226 阅读 · 0 评论 -
PE 017 Number letter counts
题目链接:https://projecteuler.net/problem=17出题人再无聊一点?代码:#include<bits/stdc++.h>using namespace std;string num1[]={"","one","two","three","four","five","six","seven"原创 2018-03-04 15:53:06 · 203 阅读 · 0 评论 -
PE 037 Truncatable primes
题目链接:https://projecteuler.net/problem=37还是筛出来素数然后直接暴力判断代码:#include<bits/stdc++.h>using namespace std;const int MAXN=1e6+5;int prime[MAXN],pow10[10];//保存素数 bool vis[MAXN];//初始化 int cnt=0;vo...原创 2018-03-12 21:27:42 · 139 阅读 · 0 评论