好吧&＃xff0c;用的语法很糟糕。。。但是至少是做了练习。
题目
%The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 &＃43; 2 &＃43; 3 &＃43; 4 &＃43; 5 &＃43; 6 &＃43; 7 &＃61; 28. The first ten terms would be:
%1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
%Let us list the factors of the first seven triangle numbers:
%
% 1: 1
% 3: 1,3
% 6: 1,2,3,6
%10: 1,2,5,10
%15: 1,3,5,15
%21: 1,3,7,21
%28: 1,2,4,7,14,28
%We can see that 28 is the first triangle number to have over five divisors.%What is the value of the first triangle number to have over five hundred divisors?
好吧&＃xff0c;我先写了个module&＃xff0c;用来计算triangle num&＃xff1a;
-module(triangle).
-export([triNum/1]).triNum(0) -> 0;
triNum(N) ->N &＃43; triNum(N-1).
然后&＃xff0c;我写了个module&＃xff0c;来计算具体某个数有多少个triNum&＃xff1a;
-module(divisor).
-export([num_of_divisor/2]).num_of_divisor(_, 0) -> 0;
num_of_divisor(Num, Factor) when (Num rem Factor) &＃61;:&＃61; 0 ->2 &＃43; num_of_divisor(Num, Factor - 1);
num_of_divisor(Num, Factor) when (Num rem Factor) &＃61;/&＃61; 0 ->num_of_divisor(Num, Factor-1).
好吧&＃xff0c;然后&＃xff0c;我又用了第三个module&＃xff1a;
-module(forRange).
-export([forRange/1]).
-import(triangle, [triNum/1]).
-import(divisor, [num_of_divisor/2]).forRange(0) -> 0;
forRange(N) when N>0 ->TriNum &＃61; triNum(N),Res &＃61; num_of_divisor(TriNum, TriNum)/2,if Res >&＃61; 100 ->io:format("~f~n", [Res]),io:format("~b~n", [N]);true ->io:format("~n")end,forRange(N-1).
。。。
最后数找到了384&＃xff0c;我还给自己找了个冠冕堂皇的接口&＃xff0c;我还在熟悉语法。。。
京公网安备 11010802041100号