Tweetovi
- Tweetovi, trenutna stranica.
- Tweetovi i odgovori
- Medijski sadržaj
Blokirali ste korisnika/cu @AnandUndavia
Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @AnandUndavia
-
Prikvačeni tweet
Recently, I came across this picture and got inspired from it to actually write 'thanos-js'. Here is the result: https://www.npmjs.com/package/thanos-js … Let me know what you think! :Dpic.twitter.com/gUQY2yNKND
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Solution to problem 38 ran for the longest time (~30 seconds) compared any of my previous solutions. As long as it satisfies the "one-minute rule" :P Link: https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D038 …
#ProjectEuler100Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
36th down, (100 - 36) to go :P Link: https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D036 …
#ProjectEuler100Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Straightforward solution to problem 35th: https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D035 …
#ProjectEuler100Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
50% of the answer was already given in the problem description :P My solution to problem 34: https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D034 …
#ProjectEuler100Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
A Solution obtained by Exhaustive Search is never wrong :D ( Just a fancy way of saying I brute forced :P ) Here is the solution to problem 32: https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D032 …
#ProjectEuler100Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Dynamic Programming! Problem 31 done! Link: https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D031 …
#ProjectEuler100Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
I would like to a way to prove ( or at least a 'why' ) that no such number greater than 194979 exists for which sum of digits raise to power 5 is equal to the number itself. Anyone?
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
I lacked enough mathematical knowledge to find the upper bound for problem 30. So, I let my solution run for 1e7 and got the green tick! Here is the link: https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D030 …
#ProjectEuler100Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Anand Undavia proslijedio/la je Tweet
Developers sitting in meetings and fixing CSS bugs all day: "Funny how I get paid for this" Developers working on open-source software that thousands of companies and developers depend on: "Funny how I don't get paid for this"
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Problem 29 reminds me how big numbers are easily handled by programming languages WITHOUT external libraries. Solution is straightforward: https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D029 …
#ProjectEuler100Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Generate the series, add the numbers, submit the answer and get the green tick! The solution to problem 28: https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D028 …
#ProjectEuler100Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Too lazy to find an efficient solution for problem 27. So here the brute forced one :P https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D027 …
#ProjectEuler100Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Anand Undavia proslijedio/la je Tweet
Ideas are cheap, everybody has one. Execution is hard, only a few people can pull it off. Execution > ideas
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Back to
#ProjectEuler100 after some time and I finished problem 26!! I actually had fun solving the problem and got wrong answer couple of times because the answer the number which produces the longest cycle and not the length of it! Link:https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D026 …Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Got an award "Easy Prey" as I solved the 25th! Here is the solution: https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D025 …
#ProjectEuler100Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
I have advanced to level 1 on Project Euler after solving the 24th problem!! The algorithm I referred: https://qr.ae/TJSyLT Link to my solution: https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D024 …
#ProjectEuler100Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Anand Undavia proslijedio/la je TweetHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
O(n * sqrt(n)) solution for problem 23: https://github.com/anandundavia/ProjectEuler/tree/master/problem%3D023 …
#ProjectEuler100Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

