last day (15 days later) » 

Feeds
Feeds
18:58
0
A: Smallest Fibonacci Multiples

Varad MahashabdeC++, 60 bytes, score : 610 long f(int m){long a=0,b=1;while(b%m){b+=a;a=b-a;}return b;} If I had used int all the way, I would have had a score of 591286729879! Try it online!

Varad Mahashabde
Varad Mahashabde
@79037662 Hello again! Are we taking it on faith that a is initialized as 0?
@79037662 Quite sadly no. C++ is not clean with auto-nulled memory like that as it is designed to be run on, along with other bigger things, resource-limited real-time embedded systems. Any memory that gets allocated to our variables, we clean ourselves
@79037662 Using your approach(with a=b-a also shifted inside the for), I can get down to 56 bytes, but it only worsens the score! Try it online!
Noodle9
Noodle9
score 144
Varad Mahashabde
Varad Mahashabde
@Noodle9 Nice, but we may not expand like this as it is pristine-programming, i.e. one may not remove bytes and have the flow of control, variables, etc.
Noodle9
Noodle9
@Varad I thought it was pristine - what could you remove and still have it function as before? You can't just replace ;long with , that's not removing.
Varad Mahashabde
Varad Mahashabde
@Noodle9 3 things : You can compress the two long assignments into one, shorten b=b+a to b+=a, and compress the two assignments on a into one. Ref : my answer. BTW it is not about removing statements or logic, but the bytes i.e. one may not write a shorter program which does the exact same thing
Noodle9
Noodle9
18:58
That's rewriting the code! Pristine means you can't remove characters and have it function as before. So, for instance, you can't space pad the code to up the byte count.
Varad Mahashabde
Varad Mahashabde
I don't suppose it talks about individual bytes, but like whether the code can be golf further
Noodle9
Noodle9
No. Not that it can't be golfed futher. That bytes cannot be removed and have it function as before.
Varad Mahashabde
Varad Mahashabde
Well we are at an impasse with our definitions
Noodle9
Noodle9
Re-read the definition.
Varad Mahashabde
Varad Mahashabde
Wait
"removing a contiguous substring" seems to be the lynch pin
I stand convinced
Nice talking to you!
Noodle9
Noodle9
19:04
Yup, not replacing a string with a shorter different one. Removing a string.
Nice chatting!
Varad Mahashabde
Varad Mahashabde
Hello helllo, you there?
I can get the score to 55 if i can remove 6 bytes
2 can come from long -> int
2 from using the comma operator
`{b+=a;a=b-a}` -> `b+=a,a=b-a`
can you find 2 more to lose?
Noodle9
Noodle9
Yeah, got there and couldn't squeeze anymore bytes out so built it up to the next lowest.
Varad Mahashabde
Varad Mahashabde
oh okay
good night
Noodle9
Noodle9
144 is still an improvement.
Good night
Varad Mahashabde
Varad Mahashabde
Can we aim for 89?
any very long data types you know of?
New question : does depreciating the data type sort of an error? long long could give trouble
Proposal : long long f(long m){long long a=1;long long b=0; do {b=b+a;a=b-a;} while(b%m);return b;}

last day (15 days later) »