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

1 | tourist | 3845 |

2 | jiangly | 3707 |

3 | Benq | 3630 |

4 | orzdevinwang | 3573 |

5 | Geothermal | 3569 |

5 | cnnfls_csy | 3569 |

7 | jqdai0815 | 3532 |

8 | ecnerwala | 3501 |

9 | gyh20 | 3447 |

10 | Rebelz | 3409 |

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

1 | maomao90 | 171 |

2 | adamant | 163 |

2 | awoo | 163 |

4 | TheScrasse | 154 |

5 | nor | 153 |

6 | maroonrk | 152 |

6 | -is-this-fft- | 152 |

8 | Petr | 145 |

9 | pajenegod | 144 |

9 | orz | 144 |

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/20/2024 15:06:16 (l2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

Note that multiplying c<d by −1 gives −c<−d. So we have a−c<b−d by our previous result.Shouldn't it be c>d in the first place?Fixed, thanks!

cool blog now i know math $

deleted

This is great, I think it will help many newbies like me to understand fundamentals and common senses.

I stumbled on a question and it would be great if I could get some help with it. I need to find the sum of (floor(1*sqrt(2)) + floor(2*sqrt(2)) + ... + floor(n*sqrt(2))). To me, this looks really similar to Gauss' property with m = n * sqrt(2), I could be wrong though. It gives me

almostright answer with just minor offsets for some values of n. Since, m needs to be an integer, is there any way that we can modify this formula? or is there any other approach you would recommend?Edit1: https://math.stackexchange.com/questions/1622147/simplifying-sum-of-floor-functions

Edit2: https://mathproblems123.wordpress.com/2020/07/25/sum-of-floors-of-multiples-of-the-golden-ratio/