project euler problem 8:Largest product in a series
来源:互联网 发布:外网端口怎么开 编辑:程序博客网 时间:2024/05/10 09:04
一串1000字符的串,5个连续的数相乘最大的是哪个5个连续的数?直接循环……
#include <iostream>#include <map>#include <string>#include <cstring>#include <cstdio>#include <cmath>#include <algorithm>using namespace std;int main(){ char a[1005]={"7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"}; int i,max=0,sum; for(i=0;i<996;i++) { sum=(a[i]-'0')*(a[i+1]-'0')*(a[i+2]-'0')*(a[i+3]-'0')*(a[i+4]-'0'); if(max<sum) max=sum; } cout<<max<<endl; return 0;}
- 【Project Euler】【Problem 8】Largest product in a series
- project euler problem 8:Largest product in a series
- Project Euler Problem 8: Largest product in a series
- 8 Largest product in a series - Project Euler
- project euler 8 Largest product in a series
- Project Euler 008 Largest product in a series
- Problem 8:Largest product in a series
- Problem 8:Largest product in a series
- Problem 8:Largest product in a series
- Problem 8 Largest product in a series
- Largest product in a grid( Project Euler problem 11)
- project euler problem 11:Largest product in a grid
- Project Euler:Problem 11 Largest product in a grid
- Project Euler Problem 11: Largest product in a grid
- projecteuler---->problem=8----Largest product in a series
- Problem 8 Largest product in a series (暴力)
- PE 8 Largest product in a series
- Project Euler 题解 #11 Largest product in a grid
- 在C语言中静态调用Native DLL(Windows平台)
- ActiveX控件签名与发布
- 在C语言中动态调用Native DLL(Windows平台)
- 汇编语言的简单入门--Loop and output,input
- ] 斯坦福ML公开课笔记9——偏差/方差、经验风险最小化、联合界、一致收敛
- project euler problem 8:Largest product in a series
- Leetcode: Merge Two Sorted Lists
- RFM分析模型
- 2014百度校招笔试题
- 几个面试题
- BCG分析模型
- hdu1538 A Puzzle for Pirates
- 未来的路是否会好走一点呢
- CStdioFile中文问题