codeforces #332 div 2 C. Day at the Beach
2015-11-20 · 2 min readC. Day at the Beach
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
One day Squidward, Spongebob and Patrick decided to go to the beach. Unfortunately, the weather was bad, so the friends were unable to ride waves. However, they decided to spent their time …
阅读更多codeforces #332 div 2 B. Spongebob and Joke
2015-11-20 · 3 min readB. Spongebob and Joke
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
While Patrick was gone shopping, Spongebob decided to play a little trick on his friend. The naughty Sponge browsed through Patrick's personal stuff and found a sequence _a_1, _a_2, ..., …
阅读更多codeforces #332 div 2 A. Patrick and Shopping
2015-11-20 · 2 min read1<span style="color: #008080;"> 1</span> #include <cstdio> 2<span style="color: #008080;"> 2</span> #include <iostream> 3<span style="color: #008080;"> 3</span> #include <cmath> 4<span style="color: …
阅读更多codeforces #320 div 2 C. A Problem about Polyline(计算几何?数学)
2015-11-11 · 3 min readC. A Problem about Polyline
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
There is a polyline going through points (0, 0) - (x, x) - (2_x_, 0) - (3_x_, x) - (4_x_, 0) - ... - (2_kx_, 0) - (2_kx_ + x, x) - ....
We know that the polyline passes through the …
阅读更多cf #320 B. Finding Team Member(优先队列)
2015-11-10 · 0 min readpoj 1113 Wall (凸包模板题)
2015-11-10 · 0 min readhdu 3532 Max Angle(atan2的使用)
2015-11-09 · 4 min readMax Angle
**Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 678 Accepted Submission(s): 238
**Problem Description
Given many points in a plane, two players are playing an interesting game.
Player1 selects one point A as the vertex of an angle. Then player2 selects …
阅读更多poj 1106 Transmitters (计算几何,叉积||极角排序)
2015-11-09 · 4 min readTransmitters
**Time Limit:** 1000MS **Memory Limit:** 10000K **Total Submissions:** 4817 **Accepted:** 2576 Description
In a wireless network with multiple transmitters sending on the same frequencies, it is often a requirement that signals don't overlap, or at least that they don't conflict. One way of …
阅读更多poj 2007 Scrambled Polygon (极角排序模板题)
2015-11-08 · 0 min read