richenyunqi / ccf-csp-and-pat-solution Goto Github PK

in page 14, code of using flag as follows. the ans = 5913.

bool flag = true;
int ans = 0;
for (int i = 1; i <= 10 && flag; ++i)
{
int t = 1;
for (int j = 1; j <= i && flag ; ++j)
{
t *= j;
if (t > 1000) flag = false;
}
ans += t;
}

in page 14, code of using goto as follows. the ans = 873.

int ans = 0;
for (int i = 1; i <= 10; ++i)
{
int t = 1;
for (int j = 1; j <= i; ++j)
{
t *= j;
if (t > 1000) goto loop;
}
ans += t;
}
loop:;

this is because ans += t; excute more once in first code.
so we can move if statement to behiend the ans += t;
the new code as follwos, the ans = 5913.

int ans = 0;
for (int i = 1; i <= 10; ++i)
{
int t = 1;
for (int j = 1; j <= i; ++j)
{
t *= j;
}
ans += t;
if (t > 1000) goto loop;
}
loop:;

chncys
email: [email protected]
qq: [email protected]
WeChat ID: cys7749

1. P428，定义top的时候应该定义成空vector，书上定义成vector<gg> top(MAX)了
2. P436，dijkstra代码中If(dis[p[0] != p[1])，0和1写反了
3. P371，最下面ggright少了个空格

请问 Dijkstra 算法中这句代码有什么作用呢？我试了下去掉也能通过。

if (dis[p[1]] != p[0])
    continue;

谢谢🙏

in page 14, code of using flag as follows. the ans = 5913.

bool flag = true;
int ans = 0;
for (int i = 1; i <= 10 && flag; ++i)
{
int t = 1;
for (int j = 1; j <= i && flag ; ++j)
{
t *= j;
if (t > 1000) flag = false;
}
ans += t;
}

in page 14, code of using goto as follows. the ans = 873.

int ans = 0;
for (int i = 1; i <= 10; ++i)
{
int t = 1;
for (int j = 1; j <= i; ++j)
{
t *= j;
if (t > 1000) goto loop;
}
ans += t;
}
loop:;

this is because ans += t; excute more once in first code.
so we can move if statement to behiend the ans += t;
the new code as follwos, the ans = 5913.

int ans = 0;
for (int i = 1; i <= 10; ++i)
{
int t = 1;
for (int j = 1; j <= i; ++j)
{
t *= j;
}
ans += t;
if (t > 1000) goto loop;
}
loop:;

chncys
email: [email protected]
qq: [email protected]
WeChat ID: cys7749

13 3 1 3
0 0
5 5
-3 0
-3 2
-3 4
-3 6
-1 7
0 5
3 5
1 -2
3 -2
5 -2
5 1

3 3
4 4
3 0
正确答案是5
提供代码输出为7