Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

feat: Add algorithm and tests for Project Euler Problem 29 (Distinct Powers)#1776

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.

Already on GitHub?Sign in to your account

Open
zeal-2004 wants to merge1 commit intoTheAlgorithms:master
base:master
Choose a base branch
Loading
fromzeal-2004:master
Open
Show file tree
Hide file tree
Changes fromall commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 17 additions & 0 deletionsProject-Euler/Problem029.js
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
// https://projecteuler.net/problem=29

/*
How many distinct terms are in the sequence generated by a^b for 2 <= a <= 100 and 2 <= b <= 100?
*/

export const distinctPowers = (limit = 100) => {
if (limit < 2) throw new Error('Power out of scope')
// A Set data structure to keep track of distinct powers
let distinctPowerSet = new Set()
for (let a = 2; a <= limit; a++) {
for (let b = 2; b <= limit; b++) {
distinctPowerSet.add(Math.pow(a, b))
}
}
return distinctPowerSet.size
}
17 changes: 17 additions & 0 deletionsProject-Euler/test/Problem029.test.js
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
import { distinctPowers } from '../Problem029'

describe('Distinct numbers of a ^ b where a and b in range [2,100]', () => {
it('should throw error when number is less than 2', () => {
expect(() => distinctPowers(0)).toThrowError('Power out of scope')
})
it('should throw error when number is negative', () => {
expect(() => distinctPowers(-3)).toThrowError('Power out of scope')
})
test('if the number is greater than or equal to 2', () => {
expect(distinctPowers(5)).toBe(15)
})
// Project Euler Condition Check
test('if the number is greater than or equal to 2', () => {
expect(distinctPowers(100)).toBe(9183)
})
})
Loading

[8]ページ先頭

©2009-2025 Movatter.jp