:: ADVANCE ::
87일차 1. cross 본문
반응형
http://183.106.113.109/30stair/cross/cross.php?pname=cross
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41 |
#include <iostream>
using namespace std;
int abs(int n)
{
if(n < 0) return -1*n;
return n;
}
int main(void)
{
int n1, n2, m1, m2;
cin >> n1 >> n2 >> m1 >> m2;
if(n1 > n2) {
int temp;
temp = n2;
n2 = n1;
n1 = temp;
}
if(n1 <= m1 && m1 <= n2) {
if(n1 <= m2 && m2 <= n2) {
cout << "not cross" << endl;
}
else {
cout << "cross" << endl;
}
}
else {
if(n1 <= m2 && m2 <= n2) {
cout << "cross" << endl;
}
else {
cout << "not cross" << endl;
}
}
return 0;
} |
반응형
'Algorithm > 일일알고리즘' 카테고리의 다른 글
97일차 1. self_number (0) | 2014.10.13 |
---|---|
95일차 1. omok (0) | 2014.10.12 |
90일차 1. sprime (0) | 2014.10.08 |
91일차 1. eratosthenes (0) | 2014.10.07 |
86일차 1. ncpc_event (0) | 2014.10.02 |
Comments