http://mirror.codeforces.com/problemset/problem/230/B how come the square of a prime number is a T-prime? How would you get to the conclusion of that to solve this problem?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
http://mirror.codeforces.com/problemset/problem/230/B how come the square of a prime number is a T-prime? How would you get to the conclusion of that to solve this problem?
I used BigInteger for this problem, just in case if the output had to be a large number, but I got a Time limit exceeded on pretest 10. If you used java, can you tell me what you used to solve it?
I'm wondering if I should buy the book, but I don't know if it will be worth it. Any opinions? I'm still in high school.
Hello, I'm still in high school and I have some problems trying to understand the Dijkstra's algorith. I wanted to know if someone would be so kind to show/teach me how to solve this kind of problems for high school competitions. I already understand and know how to code a BFS and a DFS, but I'm struggling with the dijkstra. I need a fast way to do it for the competitions. I use Java, but I should be able to understand other languages like c++, and c#
Name |
---|