코딩일기

#include #include #include #define MAX_NUM 6 int is_first(int mach[7], int user[7]) { int visit[6] = {0}; int cnt = 0; for (int i = 0; i < 6; i++) { for (int j = 0; j< 6;j++) { if (mach[j] == user[i]) { if (visit[j] == 0) { visit[j] = 1; cnt++; } } } } if (cnt == 6) return (1); else return (0); } int is_second(int mach[7], int user[7]) { int cnt = 0; int i; for (i = 0; i < 6; i++) { if (user[i] ..

#include #include #include #define MAX_NUM 6 int main(void) { printf("\n"); printf("the number is from 1 to 45.\n"); srand(time(NULL)); for (int i =0; i< MAX_NUM; i++) { printf("%d ", rand() % 45 + 1); } printf("\n"); return 0; }

#include #include #include using namespace std; int is_Vps(char str[51]) { stack st; for (int j = 0; j > n; for (int i = 0; i > str; int ans..

#include #include using namespace std; struct node { string before; string after; int size; }; node words[5] = { {"KFC", "#BBQ#", 3}, {"MC", "#BBQ#", 2}, {"BICMAC", "#MACBOOK#", 6}, {"SHACK", "#SHOCK#", 5}, {"SONY", "#NONY#", 4} }; int main() { string longsent = "ILOVEKFCANDMC!!"; cin >> longsent; //ILOVEKFCANDMC!! for (int i = 0; i < 5;i++) { int index = 0; while (index != -1) { index = longsen..

#include #include using namespace std; int main() { string t[5]; for (int i = 0; i > t[i]; } int cnt = 0; for (int i = 0; i < 5;i++) { int index = 0; int index2 = 0; while (index2 != -1) { int index2 = t[i].find("MCD", index); if (index2 == -1) break; cnt += 1; index = index2 + 1; } } cout break 가 성립 그외 substr함수가 있다 string c = arr.substr(시작인덱스, 사이즈)면 arr중 시작인덱스에서 사이즈 만큼 substring..

#include using namespace std; int main() { int n; cin >> n; int arr[10];//n 1~10 for (int i = 0;i > arr[i]; } int dat[100] = { 0 }; for (int i = 0; i < n;i++) { dat[arr[i]] += 1; } int sum = 0; int summingup[100] = { 0 }; for (int i = 0; i < 21;i++) { sum += dat[i]; summingup[i] = sum; } for (int i = 0; i < 10;i++) { cout

#include #include using namespace std; struct node { char code; int killcount; node* next; }; int hasf(char code) { int intcode = code; return intcode % 3; } node* head[100]; node buf[1000]; int bufcnt; node* myalloc(char code, int count, node*sub) { buf[bufcnt] = { code, count, sub }; return &buf[bufcnt++]; } void add(char code, int count) { int hasfans = hasf(code); head[hasfans] = myalloc(cod..

#include #include using namespace std; struct node { //char abc; int num; node* next; }; node *head[100]; node *last[100]; node buf[10000]; int bufcnt; node* myalloc() { return &buf[bufcnt++]; } void append(char ab, int value) { node* temp = myalloc(); temp->next = head[ab]; temp->num = value; head[ab] = temp; } int main() { append('A', 3); append('D', 14); append('C', 36); append('C', 35); appe..

#include #include #include using namespace std; string t; double hasf(string name) { double sum = 0; double temp; double len = name.length(); for (int i = 0; i > t; // JASON double sum = hasf(t); printf("%.0lf", sum); } 입력 예제 JASON 출력 결과 35016904 1해시함수 우선 pow()함수는 (밑,..

#include #include using namespace std; struct node { string name; int age; node* next; }; node *head[100]; int hasf(int age) { return age % 10; } void addnode(string t, int age) { node* temp = new node(); temp->name = t; temp->age = age; temp->next = head[hasf(age)]; head[hasf(age)] = temp; } int main() { addnode("Sour", 1000000005); addnode("Dav", 1000000002); addnode("Nica", 1000000003); addno..