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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93 | #pragma warning(disable:4996)
#include <stdio.h>
int warpCount(int distance) {
int num = 1; //항 번호
int i = 1; //항간차
while(1){
if (num % 2 == 0) { //짝수항인 경우
distance -= i;
if(distance < 0)
break;
num++;
}
else if (num % 2 != 0) { //홀수항인 경우
distance -= i;
if(distance < 0)
break;
num++;
i++;
}
}
return num;
}
int main() {
int distance;
int x,y,i=0;
int test_count,count;
int warp_count[100]; //고칠 부분
scanf("%d",&test_count);
count = test_count;
while(test_count > 0){
scanf("%d %d",&x,&y);
distance = y-x;
warp_count[i] = warpCount(distance);
test_count--;
i++;
}
for (i = 0; i < count; i++)
printf("%d\n",warp_count[i]);
return 0;
}
|
댓글
댓글 쓰기