U E D R , A S I H C RSS

최소정수의합/조현태

C++


..;; n-1 .^^
.


//1 + 2 + 3 + ..... + n >= 3000    n    
#include <iostream>

using namespace std;

int sum(int);

void main()
{
	const int COMPARENUM=3000;
	int n=1;
	while (COMPARENUM>sum(n))
		++n;
	cout << " : " << n << "  합: "<< sum(n);
}

int sum(int end_number)
{
	if (1==end_number)
		return 1;
	else
		return end_number*(end_number+1)/2;
}

Erlang


-_ -ㅋ


  • pr_2.erl

-module(pr_2).
-export([minSum/2]).
minSum(I, SumNum) when SumNum >= 3000 -> {I - 1, SumNum};
minSum(I, SumNum) -> minSum(I + 1, SumNum + I).

  • shell

5> c(pr_2).          
{ok,pr_2}
6> pr_2:minSum(1, 0).
{77,3003}

FeedBack


  • 1 n , , . , ^^ -
    ._ . .^_^- ..ㅠ.ㅜ 행하.^^


Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:31:17
Processing time 0.0095 sec