SMALL
jungol 601부터 jungol 610까지 c언어로 작성된 코드입니다.
참고해 주시면 좋을 것 같습니다.
jungol 601
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
int main()
{
int count;
int len;
char c[100];
count = 0;
scanf("%[^\n]s", c);
len = strlen(c);
for (int i = len-1; i >= 0; i--)
{
for (int j = 0; j < len; j++)
{
count = (i + j) % len;
printf("%c", c[count]);
}
printf("\n");
}
return 0;
}
jungol 602
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include<string.h>
int main()
{
char* ptr_ary[5][30];
int i;
for (i = 0; i < 5; i++)
scanf("%s", &ptr_ary[i]);
for (i = 4; i >= 0; i--)
printf("%s\n", ptr_ary[i]);
return 0;
}
jungol 603
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include<string.h>
int main()
{
char str[50];
char* ptr_ary[50] = { 0, };
char* ptr;
int i;
i = 0;
scanf("%[^\n]s", str);
ptr = strtok(str, " ");
while (ptr != NULL) {
ptr_ary[i] = ptr;
i++;
ptr = strtok(NULL, " ");
}
for (int j = 0; j < i; j+=2)
{
printf("%s\n", ptr_ary[j]);
}
return 0;
}
jungol 604
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main()
{
char* arr[11];
char one[2];
char place[20];
int len;
int i;
int size[10];
i = 0;
for (i = 0; i < 10; i++)
{
scanf("%s", place);
len = strlen(place) + 1;
arr[i] = (char*)malloc(sizeof(char) * len);
strcpy(arr[i], place);
size[i] = len;
}
scanf("%s", one);
for (i = 0; i < 10; i++)
{
if (arr[i][size[i] - 2] == one[0])
{
printf("%s\n", arr[i]);
}
free(arr[i]);
}
return 0;
}
jungol 605
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
int main()
{
char name[20] = "Hong Gil Dong";
char save[20];
strcpy(save, name);
printf("%s\n", save);
return 0;
}
jungol 606
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
int main()
{
char s1[20];
scanf("%s", s1);
strcat(s1, "fighting");
printf("%s\n", s1);
return 0;
}
jungol 607
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
int main()
{
char s1[20];
char s2[20];
int len;
scanf("%s %s", s1, s2);
len = strlen(s2);
for (int i = 0; i < 2; i++)
{
s2[i] = s1[i];
s2[len + i] = s1[i];
}
s2[len + 2] = NULL;
printf("%s", s2);
return 0;
}
jungol 608
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
int main()
{
char str[20];
char* ptr;
char* ptr2;
scanf("%s", str);
ptr = strchr(str, 'c');
if (ptr != NULL)
printf("Yes ");
else
printf("No ");
ptr2 = strstr(str, "ab");
if (ptr2 != NULL)
printf("Yes ");
else
printf("No ");
return 0;
}
jungol 609
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
int main()
{
char a[20];
char b[20];
char c[20];
char t[20] = { 0, };
scanf("%s %s %s", a, b, c);
strcpy(t, (strcmp(a, b) < 0 ? a : b));
printf("%s", strcmp(t, c) < 0 ? t : c);
return 0;
}
jungol 610
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
int main()
{
char arr1[5][20];
char t[20];
for (int i = 0; i < 5; i++)
{
scanf("%s", arr1[i]);
}
for (int i = 0; i < 5; i++)
{
for (int j = i; j < 5; j++)
{
if (strcmp(arr1[i], arr1[j]) < 0)
{
strcpy(t, arr1[i]);
strcpy(arr1[i], arr1[j]);
strcpy(arr1[j], t);
}
}
printf("%s\n", arr1[i]);
}
return 0;
}
LIST
'Algorithm > JUNGOL' 카테고리의 다른 글
C언어, JUNGOL 611 ~ 620 (2) | 2023.12.31 |
---|---|
C언어, JUNGOL 201 ~ 210 (0) | 2023.12.01 |
C언어, JUNGOL 9101 ~ 9110 (0) | 2023.11.29 |
C언어, JUNGOL 191 ~ 200 (2) | 2023.11.28 |
C언어, JUNGOL 591 ~ 600 (0) | 2023.11.27 |