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 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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
Название |
---|