sejongresearch / 2020.spring.datastructure Goto Github PK
View Code? Open in Web Editor NEW2020-1학기 자료구조 및 실습
2020-1학기 자료구조 및 실습
#include <stdio.h>
#include <string.h>
#pragma warning (disable:4996)
int* prefixAverages1(int* x, int N)
{
int* a = NULL;
double sum = 0; int i;
a = (int*)calloc(N, sizeof(int));
for (i = 0; i < N; i++)
{
sum = 0;
for (int j = 0; j <= i; j++) sum += x[j];
a[i] = sum / (i + 1) + 0.5;
}
return a;
}
int* prefixAverages2(int* x, int N)
{
int* a = NULL;
double sum = 0; int i;
a = (int*)calloc(N, sizeof(int));
for (int i = 0; i < N; i++)
{
sum += x[i];
a[i] = sum / (i + 1) + 0.5;
}
return a;
}
int main()
{
int N;
int* x = NULL;
scanf("%d", &N);
x = (int*)calloc(N, sizeof(int));
for (int i = 0; i < N; i++) scanf("%d", x + i);
for (int i = 0; i < N; i++) printf("%d ", prefixAverages1(x, N)[i]);
printf("\n");
for (int i = 0; i < N; i++) printf("%d ", prefixAverages2(x, N)[i]);
return 0;
}
// 19011851
#include<stdio.h>
int modulo(int a, int b);
int main() {
int a, b;
scanf("%d%d",&a,&b);
printf("%d",modulo(a,b));
return 0;
}
int modulo(int a, int b) {
while (a >= b) a = a - b;
return a;
}
// 18011499
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main()
{
int x[100], N, n, y[100];
int tmp1,tmp2, a, b, k; scanf("%d", &N);
for (int i = 0; i < N; i++) scanf("%d", &x[i]);
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &y[i]);
tmp1 = x[y[0]];
for (int i = 1; i < n - 1; i++)
{
tmp2 = x[y[i]];
x[y[i]] = tmp1;
tmp1 = tmp2;
}
x[y[0]] = tmp1;
for (int i = 0; i < N; i++) printf(" %d", x[i]);
return 0;
}
// 19011851
test
#include <stdio.h>
void rprint(int n){
if (n < 10) printf("%d\n", n%10);
else {
rprint(n/10);
printf("%d\n", n%10);
}
}
int main(void) {
int N;
scanf("%d", &N);
rprint(N);
}
// 17011836
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int sum(int N)
{
if (N == 1) return 1;
return N + sum(N - 1);
}
int main(void)
{
int N = 0;
scanf("%d", &N);
printf("%d", sum(N));
}
// 14011615
Online Judge 시스템은 중앙 관리자가 일괄적으로 관리하고, 지속적으로 피드백을 받으므로 정답이 틀릴 가능성은 거의 없습니다.
Sample Submit
으로 제출했는지 확인 해주세요.(추가 2020.03.23)
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main()
{
int x[100][100];
int N, i, a = 0, b = 0;
scanf("%d", &N);
for (i = 1; i <= N * N; i++)
{
x[a][b] = i;
if (i % N == 0) a++;
else
{
if (a % 2 == 0) b++;
else b--;
}
}
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++) printf(" %d", x[i][j]);
printf("\n");
}
return 0;
}
// 19011851
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int rHanoi(int n, char from, char aux, char to)
{
if (n == 1)
{
printf("%c %c\n", from, to);
return 0;
}
rHanoi(n - 1, from, to, aux);
printf("%c %c\n", from, to);
rHanoi(n - 1, aux, from, to);
return 0;
}
int main(void)
{
int n = 0;
scanf("%d", &n);
rHanoi(n, 'A', 'B', 'C');
return 0;
}
// 14011615
#pragma warning(disable:4996)
#include <stdio.h>
#include<stdlib.h>
typedef struct poly {
int coef, exp;
struct poly* next;
}poly;
void appendTerm(poly *k, int c, int e) {
poly *t = (poly*)malloc(sizeof(poly));
t->coef = c;
t->exp = e;
t->next = k->next;
k->next = t;
}
void deletion(poly* k) {
poly *t, *temp;
t = k;
temp = t;
while (t != NULL) {
temp = temp->next;
free(t);
t = temp;
}
}
poly* addPoly(poly *x, poly *y) {
poly *result, *i, *j, *k;
int sum;
result = (poly*)malloc(sizeof(poly));
result->next = NULL;
i = x->next;
j = y->next;
k = result;
while (i != NULL && j != NULL) {
if (i->exp < j->exp) {
appendTerm(k, i->coef, i->exp);
i = i->next;
}
else {
if (i->exp > j->exp) {
appendTerm(k, j->coef, j->exp);
j = j->next;
}
else {
sum = i->coef + j->coef;
if (sum != 0) {
appendTerm(k, sum, i->exp);
}
i = i->next;
j = j->next;
}
}
}
while (i != NULL) {
appendTerm(k, i->coef, i->exp);
i = i->next;
}
while (j != NULL) {
appendTerm(k, j->coef, j->exp);
j = j->next;
}
return result;
}
int main() {
poly *x=NULL, *y=NULL, *result, *j, *k;
x = (poly*)malloc(sizeof(poly));
y = (poly*)malloc(sizeof(poly));
x->next = NULL;
y->next = NULL;
int i, n,c,e;
scanf("%d", &n);
for (i = 0;i < n;i++) {
scanf("%d %d", &c, &e);
appendTerm(x, c, e);
}
scanf("%d", &n);
for (i = 0;i < n;i++) {
scanf("%d %d", &c, &e);
appendTerm(y, c, e);
}
result = addPoly(x, y);
k = result->next;
while (k != NULL) {
printf("%d %d\n", k->coef, k->exp);
k = k->next;
}
k = result->next;
deletion(k);
k = x->next;
deletion(k);
k = y->next;
deletion(k);
}
// 19011845
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int ab(int a, int b)
{
if (a == 0) return b;
else if (b == 0) return a;
return ab(b, a % b);
}
int main()
{
int n, m;
scanf("%d %d", &n, &m);
if (n > m) printf("%d", ab(n, m));
else printf("%d", ab(m, n));
return 0;
}
// 19011851
#pragma warning(disable:4996)
#include <stdio.h>
#include<stdlib.h>
typedef struct Node {
char elem;
struct Node *prev, *next;
}Node;
void Clear(Node *H) {
Node *t, *temp;
t = H;
temp = t;
while (t != NULL) {
temp = temp->next;
free(t);
t = temp;
}
}
void add(Node *H, int r, char e, int *n) {
if (r<1 || r>*n)printf("invalid position\n");
else {
int i;
Node *p,*q, *newNode=(Node*)malloc(sizeof(Node));
newNode->elem = e;
p = H;
for (i = 1;i <= r;i++) {
p = p->next;
}
q = p->prev;
q->next = newNode;
newNode->prev = p->prev;
p->prev = newNode;
newNode->next = p;
*n= *n +1;
}
}
void print(Node *H) {
Node *p;
p = H->next;
while(p->next!=NULL) {
printf("%c", p->elem);
p = p->next;
}
printf("\n");
}
void deletion(Node *H, int r, int *n) {
if (r < 1 || r>*n - 1)printf("invalid position\n");
else {
Node *p, *q;
int i;
p = H;
for (i = 1;i <= r;i++) {
p = p->next;
}
q = p->prev;
q->next = p->next;
q = p->next;
q->prev = p->prev;
free(p);
*n = *n - 1;
}
}
void get(Node *H, int r, int n) {
if (r < 1||r>n-1)printf("invalid position\n");
else {
Node *p;
int i;
p = H;
for (i = 0;i < r;i++) {
p = p->next;
}
printf("%c\n", p->elem);
}
}
int main() {
Node *H, *T;
char e, p;
int n = 1, i, m, r;
H = (Node*)malloc(sizeof(Node));
T = (Node*)malloc(sizeof(Node));
H->next = T;
T->prev = H;
H->prev = NULL;
T->next = NULL;
scanf("%d", &m);getchar();
for (i = 0;i < m;i++) {
scanf("%c", &p); getchar();
if (p == 'A') {
scanf("%d %c", &r, &e); getchar();
add(H, r, e, &n);
}
if (p == 'D') {
scanf("%d", &r); getchar();
deletion(H, r, &n);
}
if (p == 'G') {
scanf("%d", &r); getchar();
get(H, r, n);
}
if (p == 'P')print(H);
}
Clear(H);
}
// 19011845
#include <stdio.h>
int main (void) {
int N, M, X[100][100]={0}, cnt=1;
scanf("%d %d", &N, &M);
for(int i = 0 ; i < N ; i++){
for(int j = i ; j < M-i ; j++){
if (X[i][j] != 0) cnt+=0;
else {
X[i][j] = cnt ; cnt++;
}
}
for(int j = 1+i ; j < N-i ; j++){
if (X[j][M-i-1] != 0) cnt+=0;
else {
X[j][M-i-1] = cnt ; cnt++;
}
}
for(int j = M-i-1 ; j > i-1 ; j--){
if(X[N-i-1][j] != 0) cnt+=0;
else {
X[N-i-1][j] = cnt ; cnt++;
}
}
for(int j = N-i-1 ; j > i-1 ; j--){
if(X[j][i] != 0) cnt+=0;
else {
X[j][i] = cnt ; cnt++;
}
}
}
for(int i = 0 ; i < N ; i++){
for(int j = 0 ; j < M ; j++){
printf(" %d", X[i][j]);
}
printf("\n");
}
}
// 17011836
#pragma warning(disable:4996)
#include <stdio.h>
void swap(int X[], int a, int b) {
int tmp, i;
for (i = 0;i < (b - a) / 2 + 1;i++) {
tmp = X[a + i];
X[a + i] = X[b - i];
X[b - i] = tmp;
}
}
int main() {
int N, X[100], M, a, b, i;
scanf("%d", &N);
for (i = 0;i < N;i++)scanf("%d", X + i);
scanf("%d", &M);
for (i = 0;i < M;i++) {
scanf("%d %d", &a, &b);
swap(X, a, b);
}
for (i = 0;i < N;i++)printf(" %d", *(X + i));
}
// 19011845
#include <stdio.h>
void rprint(int n){
if (n < 10) printf("%d\n", n%10);
else {
printf("%d\n", n%10);
rprint(n/10);
}
}
int main(void) {
int N;
scanf("%d", &N);
rprint(N);
}
// 17011836
#include<stdio.h>
#include<stdlib.h>
int mostOnes(int **p, int n);
int main() {
int n, **p=NULL;
int i, j;
scanf("%d",&n);
p = (int **)malloc(sizeof(int *)*n);
for (i = 0; i < n; i++) {
p[i] = (int *)malloc(sizeof(int)*n);
for (j = 0; j < n; j++) scanf("%d",&p[i][j]);
}
printf("%d", mostOnes(p, n));
for (i = 0; i < n; i++) free(p[i]);
free(p);
return 0;
}
int mostOnes(int **p, int n) {
int i = 0, j = 0, max = 0;
while (i < n && j < n) {
if (p[i][j] == 1) {
max = i;
j++;
}
else i++;
}
return max;
}
// 18011499
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int check(char str[], char c)
{
if (*str == '\0') return 0;
if (*str == c) return check(str + 1, c) + 1;
else return check(str + 1, c);
}
int main(void)
{
char str[101];
char c;
scanf("%s", str);
getchar();
scanf("%c", &c);
printf("%d",check(str, c));
}
// 14011615
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int total_max(int IN[], int n)
{
if (n > 0)
{
int max = 0;
int max_index = 0;
int tmp = 0;
for (int i = 0; i < n; i++)
{
if (max < IN[i])
{
max = IN[i];
max_index = i;
}
}
tmp = IN[n - 1];
IN[n - 1] = max;
IN[max_index] = tmp;
if (total_max(IN, n - 1) < max) return max;
else return total_max(IN, n - 1);
}
else
{
return IN[n];
}
}
int main(void)
{
int N = 0;
int IN[20] = { 0 };
scanf("%d", &N);
for (int i = 0; i < N; i++)
{
scanf("%d", &IN[i]);
}
printf("%d", total_max(IN, N));
}
// 14011615
#include <stdio.h>
int main (void) {
int N, M, X[100][100]={0}, cnt=1;
scanf("%d %d", &N, &M);
for(int i = 0 ; i < M ; i++){
for(int j = 0, k = i ; j < i+1 && j < N ; j++, k--){
if (X[j][k] != 0) cnt+=0;
else {
X[j][k] = cnt ; cnt++;
}
}
}
for(int i = 1 ; i < N+1 ; i++){
for(int j = i, k = M-1 ; j < N && k >= 0 ; j++, k--){
if (X[j][k] != 0) cnt+=0;
else {
X[j][k] = cnt ; cnt++;
}
}
}
for(int i = 0 ; i < N ; i++){
for(int j = 0 ; j < M ; j++){
printf(" %d", X[i][j]);
}
printf("\n");
}
}
// 17011836
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.