|
|
Post by charliejv on Aug 3, 2024 21:07:19 GMT -5
|
|
|
|
Post by bplus on Aug 4, 2024 6:43:40 GMT -5
Well now that I know the results I tested somewhere else,
For i = 1 To 4000
If i Mod 3 = 1 Then
i2 = i - Int(i / 3) - 1 '1st
If i2 Mod 3 = 1 Then
i3 = i2 - Int(i2 / 3) - 1 '2nd
If i3 Mod 3 = 1 Then
i4 = i3 - Int(i3 / 3) - 1 ' 3rd
If i4 Mod 3 = 1 Then
i5 = i4 - Int(i4 / 3) - 1 '4th
'If i5 Mod 3 = 0 Then
Print i; "="; i2 / 2 + i5 / 2; "+"; i3 / 2 + i5 / 2; "+"; i4 / 2 + i5 / 2; "+"; 4
Exit For
'End If
End If
End If
End If
End If
Next
Honestly I have to think about why i5/2 works, not i5/3 added to the friends count. i5 is twice the portion size of the previous division by 3 and reduction step.
Confirmation 79 works
Testing 79
79 / 3 = 26 R 1 79 - 26 - 1 = 52
52 / 3 = 17 R 1 52 - 17 - 1 = 34
34 / 3 = 11 R 1 34 - 11 - 1 = 22
22 / 3 = 7 R 1 so 7 for each
26 + 7 = 33 1st
17 + 7 = 24 2nd
11 + 7 = 18 3rd
+4 Donkey
====================
= 79 It works alright
|
|
|
|
Post by aurel on Aug 5, 2024 1:24:06 GMT -5
and what is challenge here to print MOD results ? hmm  |
|
|
|
Post by bplus on Aug 5, 2024 15:25:13 GMT -5
aurel here is a different version of the same problem in Rosetta Code. Instead of 3 Friends there are 5 Sailors, instead of apples there are coconuts and instead of a Donkey there is a monkey. rosettacode.org/wiki/Sailors_coconuts_and_a_monkey_problemadd a comma after Sailors when searching at Rosetta Code, the link wont go directly. Or just search Sailors while at Rosetta Code. I hope that helps with your questions.
|
|
|
|
Post by bplus on Aug 6, 2024 0:58:58 GMT -5
Oh the difference with Rosetta Code problem and Sailors and Monkey problem is that the moneky gets no coconuts in the morning with the final divy of 5 Remainer was 0..
|
|
|
|
Post by bplus on Aug 8, 2024 10:05:55 GMT -5
' Charlies orig problem solution
'For i = 1 To 4000
' If i Mod 3 = 1 Then
' i2 = i - Int(i / 3) - 1 '1st
' If i2 Mod 3 = 1 Then
' i3 = i2 - Int(i2 / 3) - 1 '2nd
' If i3 Mod 3 = 1 Then
' i4 = i3 - Int(i3 / 3) - 1 ' 3rd
' If i4 Mod 3 = 1 Then
' i5 = i4 - Int(i4 / 3) - 1 '4th
' 'If i5 Mod 3 = 0 Then
' Print i; "="; i2 / 2 + i5 / 2; "+"; i3 / 2 + i5 / 2; "+"; i4 / 2 + i5 / 2; "+"; 4
' Exit For
' 'End If
' End If
' End If
' End If
' End If
'Next
Print " What if donkey does not get apple in am? "
For i = 1 To 4000
If i Mod 3 = 1 Then
i2 = i - Int(i / 3) - 1 '1st
If i2 Mod 3 = 1 Then
i3 = i2 - Int(i2 / 3) - 1 '2nd
If i3 Mod 3 = 1 Then
i4 = i3 - Int(i3 / 3) - 1 ' 3rd
If i4 Mod 3 = 0 Then
i5 = i4 - Int(i4 / 3) '4th
'If i5 Mod 3 = 0 Then
Print i; "="; i2 / 2 + i5 / 2; "+"; i3 / 2 + i5 / 2; "+"; i4 / 2 + i5 / 2; "+"; 3
Exit For
'End If
End If
End If
End If
End If
Next
Print " What if donkey doesn't get any apples?"
For i = 1 To 4000
If i Mod 3 = 0 Then
i2 = i - Int(i / 3) '1st
If i2 Mod 3 = 0 Then
i3 = i2 - Int(i2 / 3) '2nd
If i3 Mod 3 = 0 Then
i4 = i3 - Int(i3 / 3) ' 3rd
If i4 Mod 3 = 0 Then
i5 = i4 - Int(i4 / 3) '4th
'If i5 Mod 3 = 0 Then
Print i; "="; i2 / 2 + i5 / 2; "+"; i3 / 2 + i5 / 2; "+"; i4 / 2 + i5 / 2; "+"; 0
' debug check Print "Divisions:"; i2; i3; i4; i5
Exit For
'End If
End If
End If
End If
End If
Next
|
|
