BIGFROG

#include #pragma warning(disable:4996) int main() { int num; int count,prime_count=0; int i; scanf("%d",&count); while (count != 0) { scanf("%d",&num); for (i = 3; i i) break; else if (num == i) prime_count++; } count--; } printf("%d\n",prime_count); return 0; }

#include #pragma warning(disable:4996) int main() { int num; int line; int dividend,divisor; scanf("%d",&num); for (line = 1; line < num; line++) { if(num-line < 0) break; num = num - line; } // line+1 = 분모+분자 if(line % 2 == 0){ dividend = num; divisor = line + 1 - dividend; } else if (line % 2 != 0) { divisor = num; dividend = line + 1 - divisor; } printf("%d/%d\n",dividend,divisor); return 0; }

#include #pragma warning (disable:4996) int main() { int st_in, st_out; int num_in_train = 0; int max = 0; int i; for (i = 0; i 10000) num_in_train = 10000; if (max < num_in_train) max = num_in_train; } printf("%d", max); }

#include #pragma warning(disable:4996) int main() { int num; int Max_round = 7; int count = 1; scanf("%d",&num); if(num == 1){ printf("1"); return 0; } else{ while (1) { if (num > Max_round) { count += 1; Max_round += 6*count; continue; } else printf("%d\n",count+1); break; } } return 0; }

#include void SnailArr(int(*ptrArr)[100], int len); void ShowArr(int(*ptrArr)[100], int len); int main() { int num; int arr[100][100]; scanf_s("%d", &num); SnailArr(arr, num); ShowArr(arr, num); return 0; } void SnailArr(int(*ptrArr)[100], int len) { int i; int x=0,y=0; int count = 1; int round = 0; while (count < (len * len)) { for (i = 1; i < (len - round); i++) { ptrArr[x][y] = count; y++; co..

#include #pragma warning (disable:4996) int count = 0; void HalfStick(int stick, int x) { while (stick > x) { stick = stick / 2; } if (stick < x) { x -= stick; count++; } if (x == stick) { count++; return; } HalfStick(stick, x); }; int main() { int stick = 64; int x; scanf("%d", &x); HalfStick(stick,x); printf("%d", count); }

/* ================== 에라토스테네스의 체 ================== */ #include #include // malloc,free #pragma warning(disable:4996) int main() { int i, j, k; int num; scanf("%d", &num); int *prime = malloc(sizeof(int) * num); //(int크기)x(num크기)만큼 동적메모리 할당 for (i = 2; i

#### linkedListFunc.h #### #define TRUE 1 #define FALSE 0 typedef struct Student *StudentPointer; struct Student { char name[50]; int sno; // 학번 float gpa; //학점 char phone[20]; char province[30]; StudentPointer next; StudentPointer prev; }; typedef struct _LinkedList { StudentPointer head; StudentPointer tail; StudentPointer cur; int num_of_Node; } LinkedList; typedef LinkedList List; StudentPoi..

#include #include #pragma warning(disable:4996) #define TRUE 1 #define FALSE 0 typedef struct anod * Ty_Node_Ptr; typedef struct anod { int sno; // 학번 char name[50]; Ty_Node_Ptr leftChild, rightChild; }Ty_Node; typedef Ty_Node Node; Ty_Node_Ptr Tree_Init(Node * ptr_node); void insert(Ty_Node_Ptr * ptr_node, char k[], int stud_num); Ty_Node_Ptr modifiedSearch(Node * ptr_node, char key[]); void in..

#include #include #include #pragma warning(disable:4996) #define MAX 10 typedef struct ano * nodeptr; typedef struct ano { char name[30]; float gpa; char place[100]; nodeptr links[MAX]; }nodetype; nodeptr ROOT; nodeptr stack[100]; int top = -1; nodeptr search_node(nodeptr cur, char sname[]) { int i; nodeptr rptr; if (!cur) return NULL; if (strcmp(cur->name, sname) == 0) { return cur; //성공 } else..