반응형
#include <iostream>
using namespace std;
int a[101][101];
int lx, ly, rx, ry, ans;
int main() {
for (int k = 1; k <= 4; k++)
{
cin >> lx >> ly >> rx >> ry;
for (int i = 100-ry; i < 100 - ly; i++)
{
for (int j = lx; j < rx; j++)
{
a[i][j] = 1;
}
}
}
for(int i = 0; i <= 100; i++)
for (int j = 0; j <= 100; j++)
{
if (a[i][j] == 1)
ans++;
}
cout << ans << '\n';
}
'Algorithm' 카테고리의 다른 글
C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 10819번:차이를 최대로 답 (0) | 2017.03.27 |
---|---|
C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 10999번:구간 합 구하기 2 답 (0) | 2017.03.27 |
C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 2812번:크게 만들기 답 (0) | 2017.03.26 |
C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 2812번:크게 만들기(스택) 답 (5) | 2017.03.26 |
C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 2331번:반복수열 답 (0) | 2017.03.26 |