목록백준/백준-C (24)
VioletaBabel
#include int main(){long long m, a, c, x, n;int g; scanf("%lld %lld %lld %lld %lld %d", &m, &a, &c, &x, &n, &g);for (int i = 0; i < n; ++i)x = ((a*x) + c) % m;printf("%d", x%g);} ====첫번째코드 시간초과 #include int main(){long long m, a, c, x, n;int g;scanf("%lld %lld %lld %lld %lld %d", &m, &a, &c, &x, &n, &g);n = n % (m - 1);for (int i = 0; i < n; ++i)x = ((a*x) + c) % m;printf("%d", x%g);} ====두번째코드도..
#include int main(){int n, count = 0;scanf("%d", &n);for (int i = 1; i*i
#include #include #include typedef struct pokemon{char name[21];int num;struct pokemon *left;struct pokemon *right;}poke; poke *head, *foot, *cursor; int main(){int N, M;char com[21];scanf("%d %d", &N, &M);poke *dic = (poke *)malloc((sizeof(poke))*N);head = (poke *)malloc(sizeof(poke));foot = (poke *)malloc(sizeof(poke));dic[0].num = 1;scanf("%s", &dic[0].name);head->left = &(dic[0]);head->right..
#include #define mal (node *)malloc(sizeof(node));typedef struct _node{struct _node *left;struct _node *right;int value;}node; node *head, *end, *temp, *cursor; void post(node *now); int main(){int num;scanf("%d", &num);head = mal;end = mal;temp = mal;head->left = temp;head->right = temp;temp->left = end;temp->right = end;end->left = end;end->right = end;temp->value = num; while (scanf("%d", &nu..
#include void quick(int arr[], int left, int right){int l = left, r = right, pivot = arr[(left + right) / 2], temp;do{while (arr[l] pivot) --r;if (l
#include #include #include int main(){int N, center, bool_center = 0, bool_common = 0, common = 0,max = -4000, min = 4000, count[8001]; //0~8000 -4000~4000float avr = 0;memset(count, 0, sizeof(count));scanf("%d", &N);for (int i = 0, j; i max) ? j : max;min = (j < min) ? j : min;}avr /= (float)N;if (avr < 0)avr = ceil(avr - 0...
#include #include #include int main(){int N, *num, *copynum, *temp, *copytemp, count[10];scanf("%d", &N);num = (int *)malloc(sizeof(int)*N);copynum = (int *)malloc(sizeof(int)*N);copytemp = (int *)malloc(sizeof(int)*N);temp = (int *)malloc(sizeof(int)*N);for (int i = 0; i < N; ++i)scanf("%d", &num[i]);memcpy(copynum, num, (sizeof(int)*N));for (int i = 0; i < 5; ++i){memset(count, 0, sizeof(count..
#include #include void merge(int *base, int n); int num[1000000]; int main(){// mergeint N;scanf("%d", &N);for (int i = 0; i < N; ++i)scanf("%d", &num[i]);merge(num, N);for (int i = 0; i < N; ++i)printf("%d\n", num[i]);} void merge(int *base, int n){int left = n / 2, right = n - left, l = 0, r = left, i = 0, *copy;if (n < 2) return;merge(base, left);merge(base + left, right);copy = (int *)malloc..
#include int main(){int N, num[1000];scanf("%d", &N);for (int i = 0; i < N; ++i)scanf("%d", &num[i]);for (int i = 0; i < N-1; ++i)for (int j = i + 1,temp; j < N; ++j)if (num[j] < num[i]){temp = num[i];num[i] = num[j];num[j] = temp;}for (int i = 0; i < N; ++i)printf("%d\n", num[i]);}
#include #include int main(){int n, m, count = 0, dead = 0, arrow = 0;scanf("%d %d", &n, &m);int *people = (int *)malloc(sizeof(int)*n);int *die = (int *)malloc(sizeof(int)*n);int *answer = (int *)malloc(sizeof(int)*n);memset(die, 0, sizeof(die));for (int i = 0; i < n; ++i)people[i] = i + 1;while (dead < n){++count;if (die[arrow] == 1)--count;if (count == m){count = 0;die[arrow] = 1;answer[dead]..