Hi there!

Is it necessary to know regular expressions in competitive programming? If yes, then is there any good tutorial?

Thanks

# | User | Rating |
---|---|---|

1 | tourist | 3690 |

2 | jiangly | 3647 |

3 | Benq | 3581 |

4 | orzdevinwang | 3570 |

5 | Geothermal | 3569 |

5 | cnnfls_csy | 3569 |

7 | Radewoosh | 3509 |

8 | ecnerwala | 3486 |

9 | jqdai0815 | 3474 |

10 | gyh20 | 3447 |

# | User | Contrib. |
---|---|---|

1 | maomao90 | 173 |

2 | awoo | 164 |

3 | adamant | 163 |

4 | TheScrasse | 159 |

5 | nor | 157 |

6 | maroonrk | 156 |

7 | -is-this-fft- | 152 |

8 | Petr | 146 |

8 | orz | 146 |

10 | pajenegod | 145 |

Hi there!

Is it necessary to know regular expressions in competitive programming? If yes, then is there any good tutorial?

Thanks

Hi everybody!

I have one question related with Polygon System (codecenter.sgu.ru/polygon)

Is there any limit in memory while uploading zip-archive file of tests?! even if it will be 300Mb?

Equation of a line in two dimensional plane is *ax* + *by* + *c* = 0

How to find coefficients {*a*, *b*, *c*}?

We can find them by simplifying and modifying this:

after:

(*x* - *x*_{1})(*y*_{2} - *y*_{1}) = (*y* - *y*_{1})(*x*_{2} - *x*_{1})

(*y*_{2} - *y*_{1}) * *x* + (*x*_{1} - *x*_{2}) * *y* + *y*_{1}(*x*_{2} - *x*_{1}) + *x*_{1}(*y*_{2} - *y*_{1}) = 0

It is all...

Hi everybody!

Who knows where can I find videolections in dynamic with profile(that is by using bitwise operations and etc., something like mask)

Thanks...

And where I can find previous years problems?!

thanks.

In which problems we can use solving System of algebraic linear equations, such as by Gauss' method?

Is there any problems(not theoretical)?

Night of al-Qadr

The night of | |

"What will tell you what the night of power is? It is better than a thousand months” qadr is better than the same act performed for one thousand months. |

P.S.S. Sorry for my poor english.

P.S.S.S. If you don't like this article, please ignore this! Thanks for understanding.

Who can predict result of this match by using combinatorial formulas???

I wrote in C++ program, which checks, if number *N* is prime or not.

Then I have *.exe/*.sh file. Is there any web sites, where i can run that file, and server in that site is fast.

For example, in ideone.com how many operations done in one second, i mean speed of CPU.

So, is there any sites, where we can run our program, and speed of CPU in server of site is too fast, so that 10^{9}-10^{10} operations work in 1 - 2 seconds.

thanks...

Please Help!

how we can find *N*, when we are given *x*. let's name it like phi_inv(*x*) = *N*

for example:

phi_inv(4) = 5, because *phi*(5) = 4.

*W*_{E}*L*_{C}*O*_{M}*E* To Everyone!!!

Recently I've learned MaxFlow, MinCostMaxFlow and Matching...

Where can I solve problems in matching?

Thanks...

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/20/2024 19:08:23 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|