[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/biz/ - Business & Finance

Search:


View post   

>> No.24453775 [View]
File: 163 KB, 819x1024, 1604461668630.jpg [View same] [iqdb] [saucenao] [google]
24453775

>>24451495
I'm wondering how you would go about dividing the second int if you didn't have a * operator in the first place. Then you're trading time complexity for memory complexity with a lookup table? Why?

This seems inelegant. Factoring into primes and recursively applying your function is a cool idea but the specific implementation details here are making my autism twitch.

Navigation
View posts[+24][+48][+96]