cm9200

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <math.h>

double calculate_distance(int ax, int ay, int bx, int by) {
    return sqrt(pow((ax - bx), 2) + pow((ay - by), 2));
}

int main(int argc, char* argv[]) {
    int num_test_case = 0;
    double distance_of_centers = 0.0;
    int sum_of_radius = 0, sub_of_radius = 0;
    scanf("%d", &num_test_case);

    int* cases = (int*)malloc(sizeof(int) * 6 * num_test_case);

    for (int i = 0; i < num_test_case; i++) {
        scanf("%d %d %d %d %d %d", &cases[6 * i], &cases[6 * i + 1], &cases[6 * i + 2], &cases[6 * i + 3], &cases[6 * i + 4], &cases[6 * i + 5]);
        if (cases[6 * i] < -10000 || cases[6 * i] > 10000 || cases[6 * i + 1] < -10000 || cases[6 * i + 1] > 10000 || cases[6 * i + 2] < 1 || cases[6 * i + 2] > 10000 || cases[6 * i + 3] < -10000 || cases[6 * i + 3] > 10000 || cases[6 * i + 4] < -10000 || cases[6 * i + 4] > 10000 || cases[6 * i + 5] < 1 || cases[6 * i + 5] > 10000)
        {
            printf("Error");
            return -1;
        }
    }

    for (int i = 0; i < num_test_case; i++) {
        distance_of_centers = calculate_distance(cases[6 * i], cases[6 * i + 1], cases[6 * i + 3], cases[6 * i + 4]);
        sum_of_radius = cases[6 * i + 2] + cases[6 * i + 5];
        sub_of_radius = cases[6 * i + 2] > cases[6 * i + 5] ? cases[6 * i + 2] - cases[6 * i + 5] : cases[6 * i + 5] - cases[6 * i + 2];

        if (distance_of_centers > sum_of_radius) //case 1
            printf("0\n");
        else if ((distance_of_centers == sum_of_radius || distance_of_centers == sub_of_radius) && distance_of_centers != 0)//case 2,6
            printf("1\n");
        else if (distance_of_centers > sub_of_radius && distance_of_centers < sum_of_radius)//case 3
            printf("2\n");
        else if (distance_of_centers < sub_of_radius)//case 4
            printf("0\n");
        else if (distance_of_centers == 0 && sub_of_radius == 0)//case 5
            printf("-1\n");
    }
}

#define _CRT_SECURE_NO_WARNINGS	;
#include <stdio.h>
#include <stdlib.h> //malloc 사용을 위함
#include <string.h> // memset 사용을 위함
 


void clearBuffer() {
	int c;
	while ((c = getchar()) != '\n' && c != EOF) {}
}

int main(int argc, char* argv[])
{
	int reiteration = 0; //반복 횟수
	int arg = NULL; // opcode 인자
	//int result = 0; //fgets 리턴값
	char opcode[17] = { 0 }; //int형의 최대 크기가 10자리 숫자, 공백 1자리, 명령어가 최대 5글자, 스트링 마지막 널값 10 + 1 + 5 + 1= 17
	char input[17] = { 0 };

	scanf("%d", &reiteration);
	if (!(reiteration >= 1 && reiteration <= 10000))
		return 0;
	
	int *arr = (int *)malloc(sizeof(int) * reiteration);
	int index = 0;

	clearBuffer();

	for (int i = 0; i < reiteration; i++) //문자열을 매칭하여 해당하는 함수 실행
	{
		fgets(input, 17, stdin);
		sscanf(input, "%s %d", opcode, &arg);

		
		if (index >= 0) {
			if (strstr(input, "push") != NULL)
				arr[index++] = arg;

			else if (strstr(input, "pop") != NULL)
			{
				if (index != 0)
					printf("%d\n", arr[(index--) - 1]);
				else
					printf("-1\n");
			}
				

			else if (strstr(input, "size") != NULL)
				printf("%d\n",index);

			else if (strstr(input, "empty") != NULL)
				if (index == 0)
					printf("1\n");
				else
					printf("0\n");

			else if (strstr(input, "top") != NULL)
			{
				if (index != 0)
					printf("%d\n", arr[index - 1]);
				else
					printf("-1\n");
			}
				

			else
			{
				printf("opcode Error\n");
				return 0;
			}
		}
		else
			printf("index not valid\n");
		//clearBuffer();
	}
	memset(arr, '0', 17);
	memset(input, '0', 17);

}