UVA - 1393 Highways
Description
Hackerland is a happy democratic country with m×n cities, arranged in a rectangular m by n grid and connected by m roads in the east-west direction and n roads in the north-south direction. By public demand, this orthogonal road system is to be supplemented by a system of highways in sucha way that there will be a direct connection between any pair of cities. Each highway is a straight line going through two or more cities. If two cities lie on the same highway, then they are directly connected.If two cities are in the same row or column, then they are already connected by the existing orthogonal road system (each east-west road connects all the m cities in that row and each north-south road connects all the n cities in that column), thus no new highway is needed to connect them. Your task is to count the number of highway that has to be built (a highway that goes through several cities on a straight line is counted as a single highway).
Input
The input contains several blocks of test cases. Each test case consists of a single line containing two integers 1n , m300 , specifying the number of cities. The input is terminated by a test case with n = m = 0 .
Output
For each test case, output one line containing a single integer, the number of highways that must be built.
Sample Input
2 4 3 3 0 0
Sample Output
12 14 题意:有一个n行m列的点阵,问一共同拥有多少条非水平非竖直的直线至少穿过当中的两个点。 思路:这题分两步,首先计算出从点[1, 1]到[n, m]格子组成的边界的连线,然后这是须要容斥去重的,这个有新的数能加的可能是当维度i和j是互质的时候就会多一个, 然后就是递推n*m的格子的总个数。也要容斥去重,这个就是减去减半的数。这个是由于会重线。最后是对称。从左上到右下,和从坐下到右上#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> typedef long long ll; using namespace std; const int maxn = 310; int n, m; ll dp[maxn][maxn], ans[maxn][maxn]; int gcd(int a, int b) { return b==0?a:gcd(b, a%b); } void init() { memset(dp, 0, sizeof(dp)); memset(ans, 0, sizeof(ans)); for (int i = 1; i <= 300; i++) for (int j = 1; j <= 300; j++) dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1] + (gcd(i, j) == 1); for (int i = 1; i <= 300; i++) for (int j = 1; j <= 300; j++) ans[i][j] = ans[i-1][j] + ans[i][j-1] - ans[i-1][j-1] + dp[i][j] - dp[i>>1][j>>1]; } int main() { init(); while (scanf("%d%d", &n, &m) != EOF && n+m) { printf("%lld\n", ans[n-1][m-1] * 2); } return 0; }
相关文章
- uva 10801 - Lift Hopping(最短路Dijkstra)
- UVA 11549 CALCULATOR CONUNDRUM(Floyd判圈算法)
- UVA 11078 Open Credit System(扫描 维护最大值)
- 【例题 4-4 uva 213】Message Decoding
- 【习题 8-20 UVA-1620】Lazy Susan
- 【习题 8-3 UVA - 12545】Bits Equalizer
- 【例题 7-1 UVA - 725】Division
- 【习题 6-7 UVA - 804】Petri Net Simulation
- 【习题 5-10 UVA-1597】Searching the Web
- 【例题3-6 UVA - 1584】Circular Sequence
- 【例题5-1 UVA 10474 】Where is the Marble?
- 【Uva 1631】Locker
- 【Uva 242】Stamps and Envelope Size
- UVA 10537 - The Toll! Revisited(dijstra扩张)
- UVA 11423 - Cache Simulator (树状数组)
- uva Matrix Decompressing (行列模型)
- UVA 11427 - Expect the Expected(概率递归预期)