I was trying to solve this problem but couldn't come up with anything except the intersection point of the given lines. I would appreciate any ideas on solving/approaching this problem . Besides, what topics should I learn to solve it ?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | adamant | 155 |
4 | cry | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
I was trying to solve this problem but couldn't come up with anything except the intersection point of the given lines. I would appreciate any ideas on solving/approaching this problem . Besides, what topics should I learn to solve it ?
Problem Link : https://www.spoj.com/problems/PRIMES2/ My Tle Solution : https://pastebin.com/wXtp0wVf In this problem you have to generate primes upto 10^9 . Time limit: 2.281s
Link: https://pastebin.com/FRTreAiJ
I come across this type of implementation for fast input of integers in geeksforgeeks.com site . Can this code be improved to input integers faster ? ( getchar_unlocked() doesn't work in Windows . )
What are some efficient ways to divide 'a' by 'b' where the range is :
-10^300 <= a,b <= +10^300
Название |
---|