欧拉计划Problem_8

最新推荐文章于 2024-10-06 20:29:51 发布

初月十五

最新推荐文章于 2024-10-06 20:29:51 发布

阅读量194

点赞数

文章标签： java c语言算法

本文链接：https://blog.csdn.net/qq_59269832/article/details/125459136

版权

字符串处理数字乘积 C#编程 Java编程算法实现

关键词由CSDN通过智能技术生成

#include<stdio.h>
#include<string.h>
int main(){
    char arr[1001] = 
    "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450";
    long long max = 0L;
    long long x = 1L;
    for (int i = 0; i <= 987; i++)
     {
         for(int j = 0;j<13;j++){
            if((arr[j]-48) == 0) {
                i += j;
                break;
            }
            x = x * (arr[j]-48);//将ASCII值转换成整型数字
         }
        if (max < x) max = x;
        x = 1;
        strcpy(arr,arr+1);
     }
    printf("%lld\n",max);
    return 0;
}

JAVA

package exercise;
import java.io.*;
public class _连续数字最大乘积 {
	public static void main(String[] args) {
		try {
			File myFile = new File("D:\\Java kaif\\lqb.txt");//读文件内容
			FileReader fileReader = new FileReader(myFile);
			BufferedReader reader = new BufferedReader(fileReader);
			String line = null;
			String line2 = "";
			char[] ch;
			while ((line = reader.readLine()) != null) {
				line2 = line2 + line;
			}
			ch = line2.toCharArray();
			int i, j, l;
			long k, max = 0;
			for (i = 0; i <= 987; i++)
			{
				k = 1;
				for (j = 0; j < 13; j++)
				{
					k = k * (ch[i + j] - '0');
				}
				if (k > max)
				{
					max = k;
					l = i;
				}
			}
			System.out.println(max);
		} catch (Exception ex) {
			ex.printStackTrace();
		}
	}
}

结果：23514624000