java return 错误_java – return语句中的堆栈溢出错误

当我提交到画布但在Visual Studio Code中运行正常时出现堆栈溢出错误,任何人都知道问题是什么?

这是错误:

Exception in thread "main" java.lang.StackOverflowError

at Phi.gcd(Phi.java:14

这是作业:

Euler’s totient function, otherwise known as φ(n), measures the number

of positive integers relatively prime to n that are less than n. Two

numbers are relatively prime if their gcd is 1. For example: φ(9) = 6

because 1, 2, 4, 5, 7, and 8 are relatively prime to 9. More

information about Euler’s totient function can be found at this Wiki

page.

06001

Write a function int phi(int n) that takes an integer n as an input

and returns φ(n), and a main() that prompts a user for an integer i,

calls the function φ(i), and prints the result. The upper limit for

the input i is 250000.

The closed form formula for computing φ(n) is: where p1, p2, …, pm

are prime numbers that divide the number n.

The output of your program should look and function like the examples

shown below.

06002

这是我的代码:

import java.util.Scanner;

public class Phi {

static int gcd(int a, int b)

{

if (a == 0 || b == 0)

return 0;

if (a == b)

return a;

if (a > b)

return gcd(a-b, b);

return gcd(a, b-a);

}

static int phi(int n) {

int count=0;

for(int i = 1; i < n; ++i) {

if(gcd(n, i) == 1) {

count++;

}

}

return count;

}

public static void main(String[] args) {

Scanner in = new Scanner(System.in);

System.out.print("Enter a positive integer n: ");;

int n = in.nextInt();

System.out.printf("Phi(%d): %d\n", n, phi(n));

}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值