일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | ||||||
2 | 3 | 4 | 5 | 6 | 7 | 8 |
9 | 10 | 11 | 12 | 13 | 14 | 15 |
16 | 17 | 18 | 19 | 20 | 21 | 22 |
23 | 24 | 25 | 26 | 27 | 28 |
Tags
- 큰 수의 법칙
- 재귀함수
- 몬테카를로
- 확률실험
- counting sunday
- project euler
- algeomath
- 지오지브라
- 프랙탈
- 상합
- java
- 수학탐구
- 정오각형
- 제곱근의뜻
- 큰수의법칙
- 이항분포
- 시뮬레이션
- Geogebra
- 파이썬
- 작도
- 블록코딩
- 구분구적법
- 프로젝트 오일러
- 하합
- 알지오매스
- 리만합
- 삼각함수의그래프
- python
- 피타고라스 정리
- 오일러
Archives
- Today
- Total
이경수 선생님의 수학실험실
Problem 42(Coded triangle numbers) 본문
Problem 42(Coded triangle numbers)
The \( n^{th} \) term of the sequence of triangle numbers is given by, \( t_{n} = \frac{1}{2} n(n+1) \) so the first ten triangle numbers are:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
By converting each letter in a word to a number corresponding to its alphabetical position and adding these values we form a word value. For example, the word value for SKY is \(19 + 11 + 25 = 55 = t_{10}\). If the word value is a triangle number then we shall call the word a triangle word.
Using words.txt (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, how many are triangle words?
In Python:
import time
startTime = time.time()
f = open("./PE42_words.txt", 'r')
dataSet = [strWord[1: -1] for strWord in f.read().split(",")]
f.close()
count = 0
triNumList = [int(0.5 * n * (n + 1)) for n in range(1, 100)]
for data in dataSet:
lenData = len(data)
sumAscii = 0
for i in range(lenData):
sumAscii += ord(data[i]) - 64
if sumAscii in triNumList:
count += 1
print(count)
print(time.time() - startTime, "seconds")
Run time: 0.0182950496673584 seconds
In Java:
package project_euler41_50;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
public class Euler42 {
public static void main(String[] args) throws IOException {
long startTime = System.currentTimeMillis();
int count = 0;
String data[];
ArrayList<Integer> triNumList = new ArrayList<Integer>();
ArrayList<String> dataList = new ArrayList<String>();
BufferedReader br = new BufferedReader (new FileReader("./Euler42_words.txt"));
while(true) {
String line = br.readLine();
if (line == null) break;
data = line.split(",");
for (int i = 0; i < data.length; i++) {
dataList.add(data[i].substring(1, data[i].length() - 1));
}
}
br.close();
for (int i = 1; i < 100; i++) {
triNumList.add((int)(0.5 * i * (i + 1)));
}
for (String word : dataList) {
int lenWord = word.length();
int sumAscii = 0;
for (int i = 0; i < lenWord; i++) {
sumAscii += word.charAt(i) - 64;
}
if (triNumList.contains(sumAscii)) {
count ++;
}
}
System.out.println(count);
long endTime = System.currentTimeMillis();
System.out.println((double)(endTime - startTime)/(double)1000 + "seconds");
}
}
Run time: 0.016seconds
Solution: 162
'Project Euler' 카테고리의 다른 글
Problem 44(Pentagon numbers) (0) | 2019.07.24 |
---|---|
Problem 43(Sub-string divisibility) (0) | 2019.07.24 |
Problem 41(Pandigital prime) (0) | 2019.06.16 |
Problem 40(Champernowne's constant) (0) | 2019.06.16 |
Problem 39(Integer right triangles) (0) | 2019.06.16 |
Comments