More Related Content
Similar to 2014 ACM-ICPC Daejeon 인터넷 예선 해설 (20)
2014 ACM-ICPC Daejeon 인터넷 예선 해설
- 5. •
for (int i=1; i<=w; i++) {
for (int j=1; j<=h; j++) {
cnt += 1;
if (cnt == b) {
printf("%d%02dn",j,i);
break;
}
}
}
https://www.acmicpc.net/problem/10250
- 7. •
•
int i = (b-1)/h;
int j = (b-1)%h;
printf("%d%02dn",j+1,i+1);
https://www.acmicpc.net/problem/10250
- 21. struct Point {
int x, y;
};
int ccw(Point &a, Point &b, Point &c) {
int temp = (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
if (temp > 0) {
return 1;
} else if (temp < 0) {
return -1;
} else {
return 0;
}
}
https://www.acmicpc.net/problem/10255
- 41. bool cmp(const Point &u, const Point &v) {
int temp = ccw(p, u, v);
if (temp == 0) {
return dist(p, u) <= dist(p, v);
} else {
return temp == 1;
}
}
https://www.acmicpc.net/problem/10254