low_'s blog

By low_, history, 6 months ago, In English

text

Hello Codeforces. Hoping you're having a wonderful day! ^_^

DYTECHLAB Cup 2022

This October, we invite you to the first ever Dytechlab Cup 2022 that will start on Oct/07/2022 17:35 (Moscow time). The problems were prepared by members of our company who share a passion for Competitive Programming. It is an open and rated round for both divisions.

The round will consist of 7 problems and will be 150 minutes long. We wish everyone good luck and have a positive delta!

Prizes

  • 1st place: US$200 cash prize
  • 2nd place: US$100 cash prize
  • 3rd place: US$50 cash prize

Also, we understand that contestants like dope MERCHANDISE, so we are giving away lots of them!

  • Top 20 will get a merchandise package which will include: a t-shirt with your Codeforces handle on it, a notebook, 2 pens, and a sports bag.
  • 30 merchandise packages, each including a t-shirt & 2 pens will be randomly distributed to 30 contestants ranking 21-200.
  • 100 merchandise packages, each including a sports bag & 2 pens will be randomly distributed to 100 contestants ranking 201-1500.
text text

All packages will include stickers in it, so you can stick them to your laptop and show your friends how hardworking you've been :p

Our appreciation goes to

Wish you the best and a very positive delta in this round!

UPD: score distribution is: $$$500 - 1000 - 1500 - 2000 - 2750 - 3500 - 3750$$$.

UPD2: Scripts to generate ranks of random prize winners. Seed $$$x$$$ will be the sum of score of the top 10 participants:

./genrandom_winners x

Scripts (genrandom_winners.cpp)

UPD3: Editorial.

The total score of top 10 is: $$$11460 + 9086 + 8829 + 8609 + 8380 + 8354 + 7511 + 6874 + 6775 + 6755 = 82633$$$. The list of ranks of prize winners is fixed and you can check using the published code above, using the total above as a seed. I will make a list the following days and contact the prizes winners! PLEASE NOTE that the list of real winners only finalized after the system detect & remove cheaters!

Congratulations to everyone and HAVE A GOOD WEEKEND!

UPD4: standings

Winners:

Place Participant
1 tourist
2 ksun48
3 orzdevinwang
4 inaFSTream
5 heno239

First to solve:

Task Participant
A manish17_
B tourist
C Y25t
D platelets
E EternalAlexander
F gisp_zjz
G rainboy

About Dytechlab & Job Opportunities

If you are interested in employment opportunities in Eastern Europe, Dubai, or South East Asia, please fill out the contact form below:

Contact form →

text

We are Dynamic Technology Lab, Pte Ltd. (DTL), a quantitative hedge fund engaging in global securities trading with multiple asset classes. Since our founding in 2009, from humble beginnings in a home garage, we are now a sizable, well-established financial institution with offices in Singapore, Shanghai, Beijing, and Hanoi. Our success is fueled by some of the most inquisitive minds who are relentless in their pursuit of innovation.

As a tech-focused Licensed Fund Management Company under the Monetary Authority of Singapore, DTL is dedicated to producing strong consistent returns for its investors by relying on mathematical and statistical models to drive its investment process.

Right now, we are looking for lots and lots of Engineering positions and are ready to bring opportunities to work in a quantitative trading environment for Engineers of all levels, all around the world!

Learn more about us on this blog or on our website!

Full text and comments »

Announcement of Dytechlab Cup 2022
 
 
 
 
  • Vote: I like it
  • +118
  • Vote: I do not like it

By low_, history, 4 months ago, In English

DYNAMIC TECHNOLOGY LAB, PTE LTD LOGO

Hi Codeforces!

We are Dynamic Technology Lab, Pte Ltd. (DTL), a quantitative hedge fund engaging in global securities trading with multiple asset classes. Since our founding in 2009, from humble beginnings in a home garage, we are now a sizable well-established financial institution with offices in Singapore, Shanghai, Beijing, and Hanoi. Our success is fueled by some of the most curious minds who are relentless in their pursuit of innovation.

As a tech-focused Licensed Fund Management Company under the Monetary Authority of Singapore, DTL is dedicated to producing strong consistent returns for its investors by relying on mathematical and statistical models to drive its investment process.

What is Quantitative Trading

DYNAMIC TECHNOLOGY LAB, PTE LTD LOGO

It’s a work that needs to blend mathematics, finance, and computer skills effectively. This blend produces a scientific and systematic approach to investing. Quants use computer algorithms and mathematical models to generate investment strategies to trade in various financial markets.


Working with an expert team

We have a strong team in this industry who are very talented individuals, who graduated from prestigious universities around the globe and are winners of International Olympiads and various programming competitions such as ICPC and IOI. They are the industry’s technical experts and you will be able to learn a lot from them, especially if you are new to the industry!

We hire the best of the best talents to build world-class infrastructure and trading algorithms to excel in the highly competitive investment industry.

DYNAMIC TECHNOLOGY LAB, PTE LTD LOGO

We're looking for team members that are:

  • Strong in algorithms, data structures, and operating systems-related topics.
  • Quick learners and fast adapting to new technologies.

Having relevant past experiences in work/internship/project is a plus!

Learn more about our opportunities here!

DYNAMIC TECHNOLOGY LAB, PTE LTD LOGO


UPD: If you are interested in employment opportunities in Eastern Europe, Dubai, or South East Asia, please fill out the contact form below:

Contact form →

We are happy to announce the first ever Dytechlab Cup 2022. The problems were prepared by some members of our company that share a passion for Competitive Programming! The contest will be announced in a few days, so stay tuned! UPD: The announcement are now live! Mark your calendar now!

We wish you the best of luck in the upcoming rounds!

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +129
  • Vote: I do not like it

By low_, history, 12 months ago, In English

I know watching media in 2160p is a technology that has been around us for a decade now. Nevertheless, it's a long journey, and after all these years, I'm excited to see tourist in 4K.

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +58
  • Vote: I do not like it

By low_, history, 2 years ago, In English

Hi Codeforces,

I'm low_, currently a second year student.

As I'm taking a full-time internship right now, doing contest or training intensively for ICPC are not my top priorities anymore since I don't have as much time. On the other hand, it would be wasteful for me (maybe for the whole CP community as well, but mostly me) if I don't do anything to help maintaining my skills at this level in the meantime. So that I want to contribute, and be engaged in future contests preparations (testing problems, giving feedbacks, and maybe more) and help making contests better for our contestants. In the past, I've prepared Codeforces Round #614 (Div. 1), and helped testing Codeforces Round #616 (Div. 1), so experience should not be much of the problem for me.

The title of this blog said it all. Please, problem writers, give me a call if you need valuable feedbacks for your contest(s). I ask for absolutely nothing back :D

low_

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +207
  • Vote: I do not like it

By low_, history, 4 years ago, In English

This is an editorial blog for HCW 19 Team Round (ICPC format). Any further question can be asked in the comments, I'll try to answer all the questions. Please, do not private message or email me, your question could be the same as others', and I really hate to answer one question multiple times. >:(

102279A - Amsopoly Simple Version

Author: low_.

Tutorial

102279B - Beggin' For A Node

Author: lantrungseo.

Tutorial

102279C - Countering Terrorists

Author: lantrungseo.

Tutorial

102279D - Dahlia The Champion

Author: low_.

Tutorial

102279E - Elevate To Dominate

Author: b21quocbao

Tutorial

102279F - Flood Season

Author: lantrungseo

Tutorial

102279G - Get Higher and Higher

Author: low_

Tutorial

102279H - Houston, Are You There?

Author: low_

Tutorial

102279I - Imitater The Potato

Author: low_.

Tutorial

Kudos to NamSPro for contributing such a complete solution.

102279J - Jumpity Digits

Author: b21quocbao.

Tutorial

102279K - Kostly Cueries

Author: low_.

Tutorial

102279L - Left or Right? How about neither?

Author: b21quocbao

Tutorial

-End of the Editorial

For further questions, again, please comment below this blog post. We will consider giving out model solution on demand :v

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +27
  • Vote: I do not like it

By low_, history, 4 years ago, In English

Dear Codeforces community,

Lately, we have successfully organized a high-schoolers' contest: HNOI Civil War. The contest was born as a "rivalry" between two of the best Hanoi-based gifted high schools: Hanoi-Amsterdam High School and Nguyen Hue High School. 3-people organizing committee includes: Trung Lan Nguyen (lantrungseo) — as the Head Organizer, Bao Quoc Ngo (b21quocbao) — as the Head Problemsetter and coach for Nguyen Hue informatics team for this contest, and me, Dung Tuan To low_ — as the Head Coordinator and coach for Hanoi-Amsterdam team.

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +47
  • Vote: I do not like it

By low_, history, 4 years ago, In English

Hmm, I'm thinking that not only me, but almost everyone suffers from days that he or she doesn't feel like himself/herself :/

Recently,

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +71
  • Vote: I do not like it

By low_, history, 4 years ago, In English

Recently, I find there are many interesting interactive problems on many platforms, including Codeforces. Usually, the example testcases and generated cases are rather small and it is easy for me to type in and test it directly on the C++ IDE console. But, if the tests are as big as in 1100D - Dasha and Chess, I can't afford to spend hours typing that in (who does that anyway ==). Of course test it directly by submitting it is a solution to this problem, but what if there is a small bug in my code, how can I find it?

I find this blog rather interesting: https://codeforces.com/blog/entry/49490. It said something about the Croupier (the Interactor), which is exactly what I'm looking for. But it is implemented in Python, so there are many unknown syntax for me, and I'm unable to translate it to C++ to use. Can anyone help me out?

Full text and comments »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By low_, history, 4 years ago, In English

There are only about 10 days left before I choke myself to death at Vietnamese OI this year.... At the moment, a part of me is really relaxed, because this year outcome won't affect my future a lot, but the other part of me is being stressful and annoying as hell, because throughout the year of 2018, I learned a lot, and obviously I cannot have the same (or even worse) than last year, right. That part of me keep pondering upon a question for the last 30 days: "What the f--- should I do to prepare for this?"

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +60
  • Vote: I do not like it

By low_, 4 years ago, In English

I used std::map to solve 1029D - Concatenated Multiples.

I calculated that the time complexity for this algorithm which is about O(10*NlogN) for preprocessing and O(NlogN) for finding the answer, which makes the total complexity be around O(11*NlogN) (Submission: 42125423 ), which is close to the solution in the tutorial (which uses sorting + binary search).

But this code got TLE-d. I really don't know why. I used sorting and binary search to solve this afterwards and got accepted (42126892), with way less time than the std::map submission (429 ms compared with 2000+ ms).

My question is: How does std::map (or maybe even std::set) works? And why does it takes so long to process data if the procedures can be done in "logarithmic" complexity (as stated on https://en.cppreference.com/w/cpp/container/map )?

I think next time I should avoid using both std::set and std::map if possible...

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +6
  • Vote: I do not like it

By low_, 5 years ago, In English

Recently, I've successfully promoted to become a candidate master on Codeforces, which is one of my target this year. And to celebrate this, here is my first blog on Codeforces.

Climbing ranks on Codeforces takes time (unless if you known the platform and the contests well in the first place). During that time, by pushing yourself to climb to your target ratings, you might find out that you learned a lot. E.g.: more efficient coding skills and strategies, more cohesive thinking and more creative algorithms or uses of data structures,.... That's why I always tell myself

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +44
  • Vote: I do not like it