Daily Challenge #120 - Growth of a Population dev.to staff on November 19, 2019 In a small town, the population is p0 = 1000 at the beginning of a year. The population regularly increases by 2 percent per year and moreover 50 n... Read full post Submit Preview Dismiss Collapse Expand SavagePixie SavagePixie SavagePixie Follow Always learning new things. I love web development and coding in general. Joined Jul 23, 2019 • Nov 19 '19 Dropdown menu Copy link Hide JavaScript recursion const nbYear = (p0, percent, aug, p, year=0) => p0 >= p ? year : nbYear(p0 + Math.round(p0 * percent / 100) + aug, percent, aug, p, year + 1) Enter fullscreen mode Exit fullscreen mode Collapse Expand Donald Feury Donald Feury Donald Feury Follow Appalachian Boi Work Technology Consultant Joined May 11, 2019 • Nov 19 '19 Dropdown menu Copy link Hide Lets have a Go, shall we? population.go package population // Threshold returns the number of years needed for the given population // to reach a given population threshold func Threshold(p0, aug, p int, percent float64) (year int) { for p0 < p { year++ p0 += int(float64(p0)*(percent/100)) + aug } return } population_test.go package population import "testing" type testCase struct { description string p0 int aug int p int percent float64 expected int } func TestThreshold(t *testing.T) { testCases := []testCase{ testCase{"first example", 1500, 100, 5000, 5, 15}, testCase{"second example", 1500000, 10000, 2000000, 2.5, 10}, } for _, test := range testCases { if result := Threshold(test.p0, test.aug, test.p, test.percent); result != test.expected { t.Fatalf("FAIL: %s - Threshold(%d, %d, %d, %f): %d - expected: %d", test.description, test.p0, test.aug, test.p, test.percent, result, test.expected) } t.Logf("PASS: %s", test.description) } } Collapse Expand Quinn Kleinfelter Quinn Kleinfelter Quinn Kleinfelter Follow Joined Oct 10, 2017 • Nov 19 '19 Dropdown menu Copy link Hide Simple python solution: def nb_year(p0, percent, aug, p): numyears = 0 newpop = p0 while(newpop < p): newpop = newpop + (newpop * (percent / 100)) + aug numyears = numyears + 1 return numyears Collapse Expand Héctor Pascual Héctor Pascual Héctor Pascual Follow Email rcpascualhector@gmail.com Joined May 27, 2019 • Nov 22 '19 Dropdown menu Copy link Hide I implemented the same but using recursion, check if you want :) Collapse Expand Amin Amin Amin Follow Education École Supérieure de Génie Informatique Work Teacher, Freelance Developer & Chief Technical Officer @ Doc2wheels Joined Aug 17, 2018 • Nov 19 '19 • Edited on Nov 19 • Edited Dropdown menu Copy link Hide Elm overcrowding : Int -> Float -> Int -> Int -> Int overcrowding population evolution augmentation expectedPopulation = let newPopulation : Int newPopulation = (toFloat population) * (1.0 + evolution / 100) ^ 1 + (toFloat augmentation) |> ceiling in if newPopulation > expectedPopulation then 1 else 1 + overcrowding newPopulation evolution augmentation expectedPopulation Playground Ellie App. Collapse Expand Björn Grunde Björn Grunde Björn Grunde Follow Location Malmö, Sweden Education B.S Informatics Work System Developer at Lund University, LDC Joined Oct 22, 2019 • Nov 19 '19 Dropdown menu Copy link Hide Elixir variant :) @doc """ iex> nb_year(1150, 2, 30, 5000) iex> 46 """ def nb_year(p0, percent, aug, p, year \\ 0) do if p0 >= p, do: year, else: nb_year(p0 + p0 * (percent / 100) + aug, percent, aug, p, year + 1) end Collapse Expand kesprit kesprit kesprit Follow French Senior iOS Developper Location Lyon Work Senior iOS Developper Joined Oct 14, 2019 • Nov 19 '19 Dropdown menu Copy link Hide Swift solution : func nbYears(populationOrigin: Int, percent: Float, aug: Int, populationTarget: Int) -> Int { var numberOfYears = 0 guard populationOrigin > 0, populationTarget > 0 else { return numberOfYears } var increasePopulation = Double(populationOrigin) while increasePopulation < Double(populationTarget) { increasePopulation += (increasePopulation * Double(percent / 100)) + Double(aug) numberOfYears += 1 } return numberOfYears } Collapse Expand Vaibhav Yadav Vaibhav Yadav Vaibhav Yadav Follow Hobbyist Developer, Lifelong Learner Location India Joined May 17, 2019 • Nov 20 '19 Dropdown menu Copy link Hide In C int np_year(int p0, float percent, int aug, int p) { int cp = p0; int i = 0; while (cp < p) { cp = cp + cp * percent / 100 + aug; i++; } return i; } Collapse Expand peter279k peter279k peter279k Follow I'm a open source project contributor from Taiwan. Location Taipei City Work Associate engineer at Institute for Information Industry Joined Apr 7, 2019 • Jul 14 '20 Dropdown menu Copy link Hide Here is the PHP code snippets: function nbYear($p0, $percent, $aug, $p) { $percent = $percent / 100; $entry = 0; while ($p0 < $p) { $p0 = $p0 + $p0 * $percent + $aug; $entry += 1; } return $entry; } Collapse Expand Héctor Pascual Héctor Pascual Héctor Pascual Follow Email rcpascualhector@gmail.com Joined May 27, 2019 • Nov 22 '19 Dropdown menu Copy link Hide A python one using recursion : def nb_year(p0, inc, new_comers, p, calls=1): pn = p0*(1+inc/100) + new_comers if pn >= p: return calls else: return nb_year(pn, inc, new_comers, p, calls+1) print(nb_year(1500,5,100,5000)) print(nb_year(1500000, 2.5, 10000, 2000000)) Collapse Expand Udi Udi Udi Follow A writer of code, a loved human of an amazing dog, I enjoy creating things and solving problems. Joined Jan 13, 2017 • Nov 19 '19 Dropdown menu Copy link Hide Ruby def nb_year(p0, percent, aug, p) actual_percent = percent.to_f / 100 year = 0 while p >= p0 year += 1 p0 += p0 * actual_percent + aug end year end Collapse Expand erezwanderman erezwanderman erezwanderman Follow Joined Oct 12, 2019 • Nov 19 '19 Dropdown menu Copy link Hide JS nb_year = (p0, p100, aug, target) => { const rate = p100/100 + 1; let n, pop; for (n = 0, pop = p0; pop < target; n++) { pop = ~~(pop * rate + aug); } return n; } Collapse Expand SavagePixie SavagePixie SavagePixie Follow Always learning new things. I love web development and coding in general. Joined Jul 23, 2019 • Nov 20 '19 Dropdown menu Copy link Hide By the way, I've just noticed that the author of this challenge is g964, not Becojo. It might be good to fix that in the post. Collapse Expand Swaraj Laha Swaraj Laha Swaraj Laha Follow Software engineer, interested in cloud engineering using AWS, front-end development using Javascript, React and more. Location India Work Project Engineer at Wipro Technologies Joined Oct 18, 2020 • Aug 18 '21 Dropdown menu Copy link Hide function nbYear(p0, percent, aug, p) { // your code let n = 0; while(p0 < p) { p0 = p0 + Math.round(p0 * (percent/100)) + aug; n ++; } return n; } Code of Conduct • Report abuse
JavaScript recursion
Lets have a Go, shall we?
population.go
population_test.go
Simple python solution:
I implemented the same but using recursion, check if you want :)
Elm
Playground
Ellie App.
Elixir variant :)
Swift solution :
In C
Here is the PHP code snippets:
A python one using recursion :
Ruby
JS
By the way, I've just noticed that the author of this challenge is g964, not Becojo. It might be good to fix that in the post.
function nbYear(p0, percent, aug, p) {
// your code
let n = 0;
while(p0 < p) {
p0 = p0 + Math.round(p0 * (percent/100)) + aug;
n ++;
}
return n;
}