top of page

게시판 게시물

qkrthgus7026
2019년 8월 31일
In 소스 코드 제출
#include <stdio.h> #include <stdlib.h> /*int main() { int *pi; int k; pi = &k; scanf("%d", &k); printf("directly access :> %d\n", k); printf("using point access :> %d\n", *pi); // pi, *pi }*/ /* int main() { int a,b,c=0,k,i; int *pi1; int *pi2; scanf("%d %d", &a,&b); pi1= &a; pi2= &b; for(i=a; i<=b; i++) { k=i; if(k/2==1) { c=c+k; } else { c=c-k; } } printf("%d", c); } */ /* #include<stdio.h> int main() { int a, b, i, s=0; int *pa, *pb, *pi, *ps; pa = &a; pb = &b; pi = &i; ps = &s; scanf("%d %d", &a, &b); for(*pi=*pa; *pi<=*pb; (*pi)++) { if(*pi%2==0) { *ps -= *pi; } else { *ps += *pi; } } printf("%d", *ps); } */ /* int main() { int a, b, i, s=0; int *pa, *pb, *pi, *ps; pa = &a; pb = &b; pi = &i; ps = &s; scanf("%d %d", &a, &b); for(*pi=*pa; *pi<=*pb; (*pi)++) { if(*pi==*pa) { if(*pi%2==0) { *ps -= *pi; printf("-%d", *pi); } else { *ps += *pi; printf("%d", *pi); } } else { if(*pi%2==0) { *ps -= *pi; printf("-%d", *pi); } else { *ps += *pi; printf("+%d", *pi); } } } if(*ps>0) { printf("=+%d", *ps); } else { printf("=%d", *ps); } } */ /* #include<stdio.h> int main() { int **ppi; int *pi; int k; ppi = &pi; pi = &k; *pi = 20; printf("%d", **ppi); } */ /* #include<stdio.h> #include<malloc.h> int main() { int *pa; char *pc; int i, n; int arr[100]; // n개의 배열을 선언해서 각각을 더하는 프로그램 //scanf("%d", &n); /* pc = (char*) malloc(sizeof(char)*(n+3)); pa = (int*) malloc(sizeof(int)*n); for(i=0; i<n; i++) { scanf("%d", &pa[i]); } for(i=0; i<n; i++) { printf("%d ", pa[i]); } for(int i=0; i<5; i++) { scanf("%d", &n); pc = (char*) malloc(sizeof(char)*n); scanf("%s", pc); printf("pa length is %d\n", strlen(pc)); printf("before result %s\n", pc); free(pc); printf("after result %s\n", pc); } //free(pa); } */ /* #include<stdio.h> #include<malloc.h> int main() { char *pa; int i; pa = (char*) malloc(sizeof(char)*(100)); scanf("%s", pa); if(pa[0]=='l'&&pa[1]=='o'&&pa[2]=='v'&&pa[3]=='e'&&strlen(pa)==4) { printf("I love you."); } } */ /* #include <stdio.h> #include <malloc.h> #include <string.h> #include <math.h> int main() { int **pi; int n; int i, j; scanf("%d", &n); pi = (int**) malloc(sizeof(int) *n); for(i=0; i<n; i++) { pi[i] = (int*) malloc(sizeof(int) *n); } for(i=0; i<n; i++) { for(j=0; j<n; j++) { pi[i][j] = i*j; } } for(i=0; i<n; i++) { for(j=0; j<n; j++) { printf("%d ", pi[i][j]); } printf("\n"); } } #include <stdio.h> #include <malloc.h> #include <string.h> #include <math.h> int main() { int **pi; int n; int i, j; scanf("%d", &n); pi = (int**) malloc(sizeof(int) *n); for(i=0; i<n; i++) { pi[i] = (int*) malloc(sizeof(int) *n); } for(i=0; i<n; i++) { scanf("%d", &pi[i][0]); } for(i=1; i<n; i++) { for(j=1; j<n; j++) { pi[i][j] = pi[i][j-1] - pi[i-1][j-1]; } } for(i=0; i<n; i++) { for(j=0; j<=i; j++) { printf("%d ", pi[i][j]); } printf("\n"); } } */ /* #include <stdio.h> #include <malloc.h> #include <string.h> #include <math.h> int main() { int n; int i,j,p, x, y, k=1; int pi[105][105]; scanf("%d", &n); /* pi = (int**) malloc(sizeof(int) *n*2); for(i=0; i<n; i++) { pi[i] = (int*) malloc(sizeof(int) *n*2); } x=0; y=n/2; pi[x][y] = k++; for(p=0; p<n*n-1; p++) { x--; y++; if(x<0) { x=n-1; } if(y>=n) { y=0; } pi[x][y]=k++; if((k-1)%n==0) { x++; pi[x][y]=k++; p++; } } for(i=0; i<n; i++) { for(j=0; j<n; j++) { printf("%d ", pi[i][j]); } printf("\n"); } } #include<stdio.h> struct student { char name[100]; int grade; int age; char phone[100]; }; int main() { struct student ke[100]; ke[0].grade = 1; } #include<stdio.h> struct student { char name[100]; int kor; int math; int eng; }; int main() { struct student ke[100]; int i; for(i=0; i<5; i++) { scanf("%s", ke[i].name); scanf("%d", &ke[i].kor); scanf("%d", &ke[i].math); scanf("%d", &ke[i].eng); } for(i=0; i<5; i++) { printf("%s ", ke[i].name); printf("%d ", ke[i].kor); printf("%d ", ke[i].math); printf("%d\n", ke[i].eng); } } #include<stdio.h> int main() { FILE *fp, *output; int a[100], b=0, i; fp = fopen("inside.txt", "r+"); output = fopen("outside.txt", "w+"); //fscanf(fp, "%d %d", &a, &b); //fprintf(output, "%d", a+b); for(i=0; i<10; i++){ fscanf(fp, "%d", &a[i]); b=b+a[i]; } fprintf(output, "%d", b); }*/ /* #include<stdio.h> int main() { FILE *fp, *output; int a[100], b=0, i; char input; fp = fopen("inside.txt", "r+"); output = fopen("outside.txt", "w+"); for(i=0; feof(fp)==NULL ; i++) { fscanf(fp, "%c", &input); if(input>='a' && input<='z') { input=input-32; } else if(input>='A' && input<='Z') { input=input+32; } fprintf(output, "%c", input); } } */ #include <stdio.h> #define K 100 int main() { printf("line numbers %d", __LINE__); }
0
0
3
qkrthgus7026
2019년 8월 24일
In 소스 코드 제출
import tkinter """ root = tkinter.Tk() root.geometry("500x500") frame = tkinter.Frame(root, padx =500, pady =300) frame.pack() bt=tkinter.Button(root, text='click') bt.place(x=3,y=3,width=100, height=100) bt.grid() def change_bg(): btn.configure(background='green') frame_up.configure(background='yellow') root=tkinter.Tk() root.geometry("{}x{}".format(100,100)) frame_up=tkinter.Frame(root,height=60,width=90,background='blue') frame_down=tkinter.Frame(root,height=30, width=90) frame_up.pack() frame_down.pack() btn=tkinter.Button(frame_down, text='click',command=change_bg, foreground='white', background='black',activeforeground='blue', activebackground='#FF007F') btn.pack() root.mainloop() def increase(): number.set(number.get()+1) def decrease(): number.set(number.get()-1) root=tkinter.Tk() frame=tkinter.Frame(root) frame.pack() number=tkinter.IntVar(value=0) button=tkinter.Button(frame, text='increase', command=increase) button.pack() button=tkinter.Button(frame, text='decrease', command=decrease) button.pack() label=tkinter.Label(frame, text='start', textvariable=number) label.pack() root.mainloop() def reset(): text_id.set('') text_pw.set('') text_z.set('') """ """ def f(): a = int(text_id.get()) b = int(text_pw.get()) a=a+b text_z.set(a) root=tkinter.Tk() root.title("login") root.geometry('200x100') text_id=tkinter.StringVar(value='') text_pw=tkinter.StringVar(value='') text_z=tkinter.StringVar(value='') frame=tkinter.Frame(root) frame.pack() button=tkinter.Button(frame, text='reset',command=f) button.grid(row=0,column=0, columnspan=2) label=tkinter.Label(frame, text='ID') label.grid(row=1,column=0) entry_id=tkinter.Entry(frame, textvariable=text_id) entry_id.grid(row=1,column=1) label=tkinter.Label(frame, text='PW') label.grid(row=2,column=0) entry_pw=tkinter.Entry(frame, textvariable=text_pw) entry_pw.grid(row=2,column=1) label=tkinter.Label(frame, text='z') label.grid(row=3,column=0) entry_z=tkinter.Entry(frame, textvariable=text_z) entry_z.grid(row=3,column=1) root.mainloop() def f0(): n = text_pw.get()+'0' text_pw.set(n) def f1(): n = text_pw.get()+'1' text_pw.set(n) def f2(): n = text_pw.get()+'2' text_pw.set(n) def f3(): n = text_pw.get()+'3' text_pw.set(n) def f4(): n = text_pw.get()+'4' text_pw.set(n) def f5(): n = text_pw.get()+'5' text_pw.set(n) def f6(): n = text_pw.get()+'6' text_pw.set(n) def f7(): n = text_pw.get()+'7' text_pw.set(n) def f8(): n = text_pw.get()+'8' text_pw.set(n) def f9(): n = text_pw.get()+'9' text_pw.set(n) def f11(): n = text_pw.get()+'+' text_pw.set(n) def f22(): n = text_pw.get()+'-' text_pw.set(n) def f33(): n = text_pw.get()+'/' text_pw.set(n) def f44(): n = text_pw.get()+'*' text_pw.set(n) def f55(): n = text_pw.get()+'=' text_pw.set(n) root=tkinter.Tk() root.title("cal") root.geometry('500x500') frame=tkinter.Frame(root) frame.pack() text_pw=tkinter.StringVar(value='') entry_pw=tkinter.Entry(frame, textvariable=text_pw) entry_pw.grid(row=0,column=1) button=tkinter.Button(frame, text='+',command=f11) button.grid(row=1,column=0) button=tkinter.Button(frame, text='-',command=f22) button.grid(row=1,column=1) button=tkinter.Button(frame, text='/',command=f33) button.grid(row=1,column=2) button=tkinter.Button(frame, text='*',command=f44) button.grid(row=1,column=3) button=tkinter.Button(frame, text='7',command=f7) button.grid(row=2,column=0) button=tkinter.Button(frame, text='8',command=f8) button.grid(row=2,column=1) button=tkinter.Button(frame, text='9',command=f9) button.grid(row=2,column=2) button=tkinter.Button(frame, text='4',command=f4) button.grid(row=3,column=0) button=tkinter.Button(frame, text='5',command=f5) button.grid(row=3,column=1) button=tkinter.Button(frame, text='6',command=f6) button.grid(row=3,column=2) button=tkinter.Button(frame, text='1',command=f1) button.grid(row=4,column=0) button=tkinter.Button(frame, text='2',command=f2) button.grid(row=4,column=1) button=tkinter.Button(frame, text='3',command=f3) button.grid(row=4,column=2) button=tkinter.Button(frame, text='0',command=f0) button.grid(row=5,column=1) button=tkinter.Button(frame, text='=',command=f55) button.grid(row=5,column=2) """ def callback(): root.title("Hello Python") root=tkinter.Tk() frame = tkinter.Frame(root, padx =100, pady =50) frame.pack() button=tkinter.Button(frame, text='click') button.pack() label=tkinter.Label(frame, text='click2') label.pack() button.bind("<ButtonPress-1>",lambda e: callback() ) button.bind("<Double-1>",lambda e: root.title("Mouse Double click")) button.bind("<ButtonPress-3>",lambda e: root.title("Mouse Right click")) label.bind("<Double-2>",lambda e: root.title("tkinter Label event")) root.mainloop()
0
0
3
qkrthgus7026
2019년 8월 17일
In 소스 코드 제출
import tkinter as tk def OnButtonUp(): window.title('up') print('up') def OnButtonDown(): window.title('down') print('down') def OnButtonLeft(): window.title('left') print('left') def OnButtonRight(): window.title('right') print('right') window=tk.Tk() window.title('window') window.geometry('400x400') label=tk.Label(window, text='text here') label = tk.Label(window) label.config(text='text here') label['bd']=2 label['relief']='groove' label['cursor']='X_cursor' label['anchor']='w' label['text']='text here' label= tk.Label(window,text='text here',bd=2,relief='groove',cursor='X_cursor') label.place(x=3, y=3, width=206, height=100) window.mainloop()
0
0
4
qkrthgus7026
2019년 8월 17일
In 소스 코드 제출
def student(): name = input() phone = input() birth = input() stdData = {'name':name, 'phone':phone, 'birth':birth} return stdData def student2(name, phone, birth): stdData = {'name':name, 'phone':phone, 'birth':birth} return stdData def search(k): a = 0 while(a<k): print(listStd[a].get('name'), end='\t' ) print(listStd[a].get('phone'), end='\t' ) print(listStd[a].get('birth') ) a=a+1 k = int(input()) a = 1 if(k>=1): listStd = [student()] while(a<k): listStd.append(student()) a = a+1 while(True): p = int(input("Input choice :")) if(p==1): listStd.append(student()) k=k+1 elif(p==2): q=input() if(q=='name'): w=input() for i in range(k): if(w==listStd[i].get('name')): del listStd[i] k=k-1 break elif(q=='phone'): w=input() for i in range(k): if(w==listStd[i].get('phone')): del listStd[i] k=k-1 break elif(q=='birth'): w=input() for i in range(k): if(w==listStd[i].get('birth')): del listStd[i] k=k-1 break elif(p==3): search(k) elif(p==4): w = input() for i in range(k): if(w==listStd[i].get('name') or w==listStd[i].get('phone') or w==listStd[i].get('birth')): print(listStd[i].get('name'), end='\t' ) print(listStd[i].get('phone'), end='\t' ) print(listStd[i].get('birth') ) elif(p==5): print("1.name 2.phone 3.birth") b=int(input()) if(b==1): w = input() print(b) print(w) for i in range(k): if(w==listStd[i].get('name')): print(listStd[i], end='\t' ) phone1=listStd[i].get('phone') birth1=listStd[i].get('birth') name = input() listStd.append(student2(name, phone1, birth1)) del listStd[i] break elif(b==2): w = input() for i in range(k): if(w==listStd[i].get('phone')): print(listStd[i], end='\t' ) name1=listStd[i].get('name') birth2=listStd[i].get('birth') phone = input() listStd.append(student2(name1, phone, birth2)) del listStd[i] break elif(b==3): w = input() for i in range(k): if(w==listStd[i].get('birth')): print(listStd[i], end='\t' ) name2=listStd[i].get('name') phone2=listStd[i].get('phone') birth=input() listStd.append(student2(name2, phone2, birth)) del listStd[i] break 1.추가 2.삭제 3.전체 출력 4.검색 5.수정
0
0
2
qkrthgus7026
2019년 8월 13일
In 소스 코드 제출
def student(): name = input() phone = input() birth = input() stdData = {'name':name, 'phone':phone, 'birth':birth} return stdData def search(k): a = 0 while(a<k): print(listStd[a].get('name'), end='\t' ) print(listStd[a].get('phone'), end='\t' ) print(listStd[a].get('birth') ) a=a+1 k = int(input()) a = 1 if(k>=1): listStd = [student()] while(a<k): listStd.append(student()) a = a+1 while(True): p = int(input("Input choice :")) if(p==1): listStd.append(student()) k=k+1 elif(p==2): q=input() if(q=='name'): w=input() for i in range(k): if(w==listStd[i].get('name')): del listStd[i] elif(q=='phone'): w=input() for i in range(k): if(w==listStd[i].get('phone')): del listStd[i] elif(q=='birth'): w=input() for i in range(k): if(w==listStd[i].get('birth')): del listStd[i] k=k-1 elif(p==3): search(k) elif(p==4): w = input() for i in range(k): if(w==listStd[i].get('name') or w==listStd[i].get('phone') or w==listStd[i].get('birth')): print(listStd[i].get('name'), end='\t' ) print(listStd[i].get('phone'), end='\t' ) print(listStd[i].get('birth') ) elif(p==5): w = input()
0
0
2
qkrthgus7026
2019년 8월 10일
In 소스 코드 제출
def student(): name = input() phone = input() birth = input() stdData = {'name':name, 'phone':phone, 'birth':birth} return stdData def search(k): a = 0 while(a<k): print(listStd[a].get('name'), end='\t' ) print(listStd[a].get('phone'), end='\t' ) print(listStd[a].get('birth') ) a=a+1 k = int(input()) a = 1 if(k>=1): listStd = [student()] while(a<k): listStd.append(student()) a = a+1 while(True): p = int(input("Input choice :")) if(p==1): listStd.append(student()) k=k+1 elif(p==2): q=input() if(q=='name'): w=input() for i in range(k): if(w==listStd[i].get('name')): del listStd[i] elif(q=='phone'): w=input() for i in range(k): if(w==listStd[i].get('phone')): del listStd[i] elif(q=='birth'): w=input() for i in range(k): if(w==listStd[i].get('birth')): del listStd[i] k=k-1 elif(p==3): search(k) elif(p==4):
0
0
3
qkrthgus7026
2019년 8월 03일
In 소스 코드 제출
#include<stdio.h> #include<string.h> /*int stack[50000], top=0; void push() { stack[top] = 1; top++; } void pop() { top--; stack[top] = 0; } int main() { char a[50000]= {}; int i; scanf("%s", a); if(a[0]==')') { printf("bad"); } else if(a[0]=='(') { for(i=0; i<strlen(a); i++) { if(a[i]==')') { pop(); if(top<0){ printf("bad"); return 0; } } else { push(); } } if(a[strlen(a)]=='(') { printf("bad"); } if(stack[0]==0) { printf("good"); } else { printf("bad"); } } } int q[100]={}; int front, rear; void push() { if(rear>=99) { printf("Queue is Full\n"); return ; } printf("input now : "); scanf("%d", &q[rear]); rear++; } void pop(){ if(front==rear) { printf("Queue is empty\n"); return ; } front++; if(front == rear) { front = 0; rear = 0; } } void scan(){ int i; for(i=front; i<rear; i++) { printf("%d ", q[i]); } printf("\n"); } int main(){ int n; // initialize front = 0; rear = 0; for(;;) { printf("push : 1\npop : 2\nscan : 3\nInput::>"); scanf("%d", &n); switch(n) { case 1: push(); break; case 2 : pop(); break; case 3: scan(); break; default: printf("type again :>\n"); } } } */ int main() { int n,m,i,j; int a[100000]= {}; int b[100000]= {}; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[i]); } scanf("%d", &m); for(i=0; i<m; i++) { scanf("%d", &b[i]); } for(j=0; j<m; j++) { for(i=0; i<n; i++) { if(b[j]==a[i]) { printf("%d ", i+1); break; } } if( i==n ) { printf("-1 "); } } }
0
0
1
qkrthgus7026
2019년 7월 30일
In 소스 코드 제출
/* #include<stdio.h> int main() { int n; scanf("%d", &n); printf("%d", f(n)); } int f(int n) { if(n==1 || n==2) return 1; return (f(n-1) + f(n-2))%10009; } */ /* #include<stdio.h> int main() { int stack[10000] ={0}; int top=0; int n; int i; //scanf("%d", &stack[top]); for(;;) { scanf("%d", &stack[top]); top++; if(stack[top-1] == 0) break; } top--; for(;;) // not infinite roop { top--; printf("%d\n", stack[top]); if(top==0) break; } } */ /* #include<stdio.h> int stack[100000] , top=0; void push(int k) { stack[top] = k; top++; } void pop() { top--; stack[top] = 0; } int main() { int n, k, i; int sum=0; scanf("%d", &n); for(i=0; i<n; i++){ scanf("%d", &k); if(k==0){pop();} else{push(k);} } for(i=0; i<top; i++){ sum=stack[i]+sum; } printf("%d", sum); return 0; } */ /*#include<stdio.h> int main() { char str[100000], i, j, k; int n; gets(str); for(i=0; i<strlen(str); i++) { if(str[i] >= '0' && str[i] <='9'){ n = str[i] - '0'; number[]; } else if(str[i]=='+' || str[i] == '-' || str[i]=='*' || str[i]=='/') { oper[]; } } } */ /*#include<stdio.h> int main() { char str[100]= {}; int i,n=0, k=0; char op; gets(str); for(i=0; i<strlen(str); i++) { if(str[i] >= '0' && str[i] <='9') { if(n==0) { n = str[i] - '0'; } else { k = str[i] - '0'; if(op == '+') n = n + k; if(op == '-') n = n - k; if(op == '*') n = n * k; if(op == '/') n = n / k; k=0; } } else if(str[i]=='+' || str[i] == '-' || str[i]=='*' || str[i]=='/') op = str[i]; } printf("%d", n); } */ /*#include<stdio.h> int main() { char str[100]= {}; int i,j,n[1000] = {0}, top=0, k=0; char op; int x = 0; gets(str); for(i=0; i<strlen(str); i++) { if(str[i]==' '){ x = 0; } else if(str[i] >= '0' && str[i] <='9') { if(x==1) { n[top-1] = n[top-1]*10+(str[i]-'0'); } if(x==0) { n[top++] = str[i] - '0'; } x = 1; } else if(str[i]=='+' || str[i] == '-' || str[i]=='*' || str[i]=='/'){ if(str[i] == '+') n[top-2]=n[top-2]+n[top-1]; if(str[i] == '-') n[top-2]=n[top-2]-n[top-1]; if(str[i] == '*') n[top-2]=n[top-2]*n[top-1]; if(str[i] == '/') n[top-2]=n[top-2]/n[top-1]; top--; } } printf("%d", n[top-1]); } */ /* for(j=0; j<top; j++) { printf("%d ", n[j]); } printf("\n"); */ #include<stdio.h> #include<string.h> int main() { char a[100]= {}; char b[100]= {}; char c[100]= {}; int i, k=0, s=0, x=0; scanf("%s %s", a, b); if(strlen(a) < strlen(b)) { strcpy(c, a); strcpy(a, b); strcpy(b, c); } k = strlen(a)-1; for(i=strlen(b)-1;i>=0; i--){ b[k--] = b[i]; b[i] = '0'; } k = strlen(b)-1; for(i=strlen(a)-1; i>=0; i--) { s = (a[i]-'0') + (b[k--]-'0') + x; x = s/10; a[i] = (s%10)+'0'; if(k<0) { s = (a[i-1]-'0') + x; a[i-1] = (s%10)+'0'; break; } } if(x==1) { printf("1"); } printf("%s", a); }
0
0
2
qkrthgus7026
2019년 7월 25일
In 소스 코드 제출
/*#include <stdio.h> int n, d[100010], k; int f(); int main() { scanf("%d", &n); for(int i=1; i<=n; i++) scanf("%d", &d[i]); scanf("%d", &k); printf("%d\n", f(k)); } int f(k) { int i; for(i=1; i<=n; i++) { if(d[i]==k) { return i; } } return -1; } */ /* #include<stdio.h> int main() { // pointer int a, b; int *pa, *pb; pa = &a; pb = &b; scanf("%d %d", pa, pb); printf("%d\n", *pa + *pb); printf("%d\n", *pa - *pb); printf("%d\n", *pa * *pb); printf("%d\n", *pa / *pb); return 0; } */ /* #include<stdio.h> int main() { int arr[5] = {0}; int *pa = arr; int i, sum = 0; for(i=0; i<5; i++) { scanf("%d", &arr[i]); } for(i=0; i<5; i++){ sum += (*pa+i); } printf("%d", sum); } */ /*#include<stdio.h> struct student { char name[20]; int grade; int kor; int math; int eng; }; int main() { struct student st[10]; scanf("%s %d", st.name[0], &st.grade); printf("%s %d\n", st.name, st.grade); } */ #include<stdio.h> struct student { int a; int b; }; int main() { struct student st[201]; int n, i, j; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &st[i].a); st[i].b = 0; } for(i=0; i<n; i++) { for(j=0; j<n; j++) { if(st[i].a < st[j].a) { st[i].b++; } } } for(i=0; i<n; i++) { printf("%d %d\n", st[i].a, st[i].b+1); } }
0
0
1
qkrthgus7026
2019년 7월 23일
In 소스 코드 제출
/* #include <stdio.h> #include <stdlib.h> int main() { int a[11]={}; int i,b; for(i=0; i<10; i++){ scanf("%d", &a[i]); } scanf("%d", &b); printf("%d", a[b-1]); return 0; } */ /*#include<stdio.h> int main() { char arr[1000] = {0}; int i, n, k; gets(arr); // word : scanf("%s", arr); printf("%s", arr); } */ /* #include<stdio.h> int main() { int n,k,i,j; int a[10000001]= {}; int b[10000001]= {}; int c[10000001]= {}; int p; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &p); c[p]=1; } scanf("%d", &k); for(i=0; i<k; i++) { scanf("%d", &p); printf("%d ", c[p]); } } */ /* #include <stdio.h> int n, d[110]; int f() { int max=0; int i,k; if(n==1) { return 1; } for(i=0; i<n; i++) { if(d[i]>max) { max=d[i]; k=i; } } return k+1; } int main() { scanf("%d", &n); for(int i=0; i<n; i++) scanf("%d", &d[i]); printf("%d", f()); return 0; } */ /* #include <stdio.h> int n; int zero(int n){ if(n==0){ return 1; } else{ return 0; } } int main() { scanf("%d", &n); if(zero(n)) printf("zero"); else printf("non zero"); return 0; } */ /*#include<stdio.h> int main() { f(5); } void f(int k) { // break if(k==0) return ; f(k-1); printf("%d ", k); // recursion } */ #include<stdio.h> int main() { int k; scanf("%d", &k); printf("%d", f(k)); } int f(int k) { if(k==1) return 1; return k * f(k-1); }
0
0
2
qkrthgus7026
2019년 7월 20일
In 소스 코드 제출
#include <stdio.h> #include <stdlib.h> /*int main() { int a,b,i; int k=1; scanf("%d%d", &a,&b); printf("%d", k); return 0; } a+b=c a-b=d b-a=e a*b=f a/b=g b/a=h for(i=0; i<b; i++){ k=k*a; } k=m for(i=0; i<a; i++){ k=k*b; } k=n 배열 double()a/b */ /*int main() { int a,b,i,k; scanf("%d", &a); for(i=0; i<a; i++){ scanf("%d", &b); for(i=0; i<a; i++) { printf("%d\n", b); } } return 0; } */
0
0
2
qkrthgus7026
2019년 7월 17일
In 소스 코드 제출
/*#include <stdio.h> int main() { int arr[11] = {0};// initialized int i; // for roof int k; for(i=0; i<10; i++) { scanf("%d", &arr[i]); } scanf("%d", &k); printf("%d", arr[k-1]); } */ /*#include <stdio.h> int main(){ int a[100]={0}; int n,c,i,k,m=0, sort, j; scanf("%d%d", &n,&c); for(i=0; i<n; i++){ scanf("%d", &a[i]); } for(i=0; i<n-1; i++) { for(j=0; j<n-1; j++) { if(a[j] > a[j+1]) { sort = a[j]; a[j] = a[j+1]; a[j+1] = sort; } } } for(k=0; k<n; k++){ printf("%d ", a[k]); m++; if((k+1)%c==0){ printf("\n"); } } } */ /*#include <stdio.h> int main() { int a,i,k,j; int n[1001]= {0}; scanf("%d", &a); for(k=0; k<a; k++) { scanf("%d", &n[k]); } for(i=0; i<a; i++) { printf("%d: ", i+1); for(j=0; j<a; j++) { if(i!=j) { if(n[i]==n[j]) { printf("= "); } else if(n[i]>n[j]) { printf("> "); } else { printf("< "); } } } printf("\n"); } }*/ /*#include<stdio.h> #include<string.h> int main() { char arr[1000] = {0}; int i; scanf("%s", arr); //gets(arr); if(strcmp(arr, "love") == 0) { printf("I love you."); } }*/ /*#include<stdio.h> #include<string.h> int main() { char a[100009]= {0}; int i,b=0; int c=0; int k; scanf("%s", a); for(i=0; i<strlen(a); i++) { if(a[i]=='(') { b=b+1; } else if(a[i]==')') { c=c+1; } } printf("%d %d", b,c); }*/ /*#include<stdio.h> #include<string.h> int main(){ char a[10]={0}; int i; scanf("%s", a); for(i=0; i<strlen(a); i++){ if(a[i]=='t'){ printf("%d ", i+1); } } } a[i] >='A' && a[i] <='Z' a[i] >='a' && a[i] <='z' // */ /* #include<stdio.h> #include<string.h> int main(){ char a[1001]={0}; int i; scanf("%s", a); for(i=0; i<strlen(a); i++){ if(a[i] >='A' && a[i] <='Z'){ printf("%c", a[i]+32); } else if(a[i] >='a' && a[i] <='z'){ printf("%c", a[i]-32); } else{ printf("%c", a[i]); } } } */ /*include<stdio.h> int main() { int arr[101][101] = {0}; int i, j, k, n; k=1; scanf("%d", &n); for(i=0; i<n; i++) { for(j=0; j<n; j++) { arr[i][j] = k++; } } for(i=0; i<n; i++) { for(j=0; j<n; j++) { printf("%d ", arr[i][j]); } printf("\n"); // } }*/ /*#include<stdio.h> int main() { int a[101][101]= {0}; int i, j, k, n,m; k=1; scanf("%d%d", &n,&m); for(i=0; i<n; i++) { if(i%2==1) { for(j=0; j<m; j++) { a[i][j]=k++; } } else { for(j=m-1; j>=0; j--) { a[i][j]=k++; } } } for(i=n-1; i>=0; i--) { for(j=0; j<m; j++) { printf("%d ", a[i][j]); } printf("\n"); } }*/ /*#include<stdio.h> int main() { int n, i, j, x, y; int a[20][20]= {}; for(i=1; i<=19; i++) for(j=1; j<=19; j++) scanf("%d", &a[i][j]); scanf("%d", &n); //좌표 개수 입력 받기 for(i=1; i<=n; i++) //좌표의 개수 만큼 { scanf("%d %d", &x, &y); for(j=1; j<=19; j++) //가로 줄 흑<->백 바꾸기 { if(a[x][j]==0) a[x][j]=1; else a[x][j] = 0; } for(j=1; j<=19; j++) //세로 줄 흑<->백 바꾸기 { if(a[j][y]==0) a[j][y]=1; else a[j][y] = 0; } } for(i=1; i<=19; i++) { for(j=1; j<=19; j++) { printf("%d ", a[i][j]); } printf("\n"); } } */ /*#include<stdio.h> int main(){ int h,w,n,i,j; int map[555][555] = {0}; int x, y, l, d, a; scanf("%d%d", &h,&w); scanf("%d", &n); for(i=0; i<n;i++) { scanf("%d %d %d %d", &l, &d, &x, &y); for(a=0; a<l; a++){ if(d==0){ map[x][y+a]=1; } else{ map[x+a][y]=1; } } } for(i=1; i<=h; i++) { for(j=1; j<=w; j++) { printf("%d ", map[i][j]); } printf("\n"); } } */ /*#include<stdio.h> int main() { int x=1, y=1; int i, j; int a[10][10]= {}; for(i=0; i<10; i++) { for(j=0; j<10; j++) { scanf("%d", &a[i][j]); } } a[x][y] = 9; for(;;) { if(a[x][y+1]==0){ y++; a[x][y]=9; } else if(a[x][y+1]==1&&a[x+1][y]==0){ x++; a[x][y]=9; } else if(a[x][y+1]==1&&a[x+1][y]==1){ break; } else if(a[x][y+1]==2){ a[x][y+1]=9; break; } else if(a[x+1][y]==2&&a[x][y+1]==1){ a[x+1][y]=9; break; } } for(i=0; i<10; i++) { for(j=0; j<10; j++) { printf("%d ", a[i][j]); } printf("\n"); } } */ #include<stdio.h> int main() { int x=1, y=1; int i, j; int a[11][10]= {}; for(i=0; i<11; i++) { for(j=0; j<10; j++) { scanf("%d", &a[i][j]); } } for(j=0; j<10; j++) { if(a[10][j] == 1) { for(i=9; i>=0; i--) { if(a[i][j]<0) { printf("%d fall\n", j+1); break; } else if(a[i][j]>0) { printf("%d crash\n", j+1); break; } } if(i==-1) { printf("%d safe\n", j+1); } } } }
0
0
1
qkrthgus7026
2019년 7월 11일
In 소스 코드 제출
/*#include<stdio.h> int main() { int a; scanf("%d", &a); switch(a>0) { case 1: printf("양수"); break; case 0: switch(a<0) { case 1: printf("음수"); break; case 0: printf("0"); break; } } } */ /* #include<stdio.h> int main() { // for, while, do~ while int n; // input int r; // output int i; // roof scanf("%d", &n); r = 0; for(i=1; i<=n; i++) { if( i%2==0 ) { r =r+i; } } printf("%d" ,r); } */ /* #include<stdio.h> int main() { int n; int r; int i; scanf("%d", &n); r=0; for(i=1; i<=n; i++) { r=r+i*(i+1)/2; } printf("%d", r); } */ /* 1 1 2 1 2 3 1 2 3 4 */ /*#include<stdio.h> int main() { int i, j, k=0, n=0; scanf("%d", &k); for(i=1; i<=k; i++) { for(j=1; j<=i; j++) { n+=j; } } printf("%d", n); } */ /*#include<stdio.h> int main() { int i, j; for(i=0; i<5; i++) { for(j=0; j<5; j++) { printf("*"); } printf("\n"); } for(j=0; j<5; j++) { printf("*"); } printf("\n"); for(j=0; j<5; j++) { printf("*"); } printf("\n"); for(j=0; j<5; j++) { printf("*"); } printf("\n"); for(j=0; j<5; j++) { printf("*"); } printf("\n"); for(j=0; j<5; j++) { printf("*"); } printf("\n"); } */ /* #include<stdio.h> int main() { int i,j; int n; scanf("%d", &n); for(i=0; i<n; i++) { for(j=0; j<i; j++) { printf(" "); } printf("**\n"); } } */ /*#include<stdio.h> int main() { int a[5]; // c language is like static number int n, i; for(i=0; i<5; i++) { scanf("%d", &a[i]); } for(i=0; i<5; i++) { printf("%d ", a[i]); } printf("\n"); for(i=4; i>=0; i--) { printf("%d ", a[i]); } printf("\n"); for(i=0; i<5; i++){ printf("%d ", a[4-i]); } } */ /*#include<stdio.h> int main() { int i, j, n, k, arr[60] = {0}; scanf("%d", &n); for(i=0; i<n-1; i++) { scanf("%d", &k); arr[k]=1; } for(i=1; i<=n; i++) { if(arr[i]==0) { printf("%d", i); break; } } } */ #include<stdio.h> int main() { int i,j,n; scanf("%d", &n); for(i=0; i<) }
0
0
1
qkrthgus7026
2019년 7월 10일
In 소스 코드 제출
/* #include <stdio.h> int main() { int a, b; scanf("%d %d", &a, &b); printf("%d", (a>b?():())); return 0; } */ /* #include<stdio.h> int main() { int a, b; printf("%6.3lf", 1.23); } */ /* #include<stdio.h> int main() { int a,b; scanf("%d %d", &a,&b); if(b>=30) { printf("%d %d", a,b-30); } else if( a> 0) { printf("%d %d", a-1,b+30); } else { printf("%d %d", a+23,b+30); } } */ /* #include<stdio.h> int main() { int a, b; scanf("%d", &a); b = (((a%10)*10+a/10)*2)%100; if (b>50) { printf("%d\nOH MY GOD", b); } else { printf("%d\nGOOD", b); } } */ /* #include<stdio.h> int main() { int n; scanf("%d", &n); // hint : a > 0 :: 1, 0 switch(n) { case n: printf("양수"); break; case n: printf("음수"); break; default: printf("0"); } } */ /* #include<stdio.h> int main() { int k; for(;;) { scanf("%d", &k); printf("%d\n", k); if(k==0){ break; } } } */ /* #include<stdio.h> int main() { char k; for(;;) { scanf(" %c", &k); printf("%c\n", k); if(k=='q'){ break; } } } */ /* #include<stdio.h> int main() { int i, j; scanf("%d", &j); i=0; while(i < j) { printf("%d\n", i); i++; } } */ /* #include<stdio.h> int main() { int i, k; scanf("%d", &k); i=0; do { i++; printf("%d\n", i); } while( i < k ); } */ /*#include<stdio.h> int main() { int a,b,c,n,i; scanf("%d %d %d %d", &a,&b,&c,&n); for(i=1;i<n; i++) { a = a*b+c; } printf("%d", a); } */ /* #include<stdio.h> int main() { int b,i, max = -1000001,min =1000001 ; for(i=0; i<5; i++) { scanf("%d", &b); if(max < b) max = b; if(min > b) min = b; } printf("%d\n%d", max,min); } */ #include<stdio.h> int main() { int i, j, k; scanf("%d", &k); for(i=0; i<k/2+1; i++) { for(j=k/2; j>i; j--){ printf(" "); } for(j=0; j<(i*2)+1; j++){ printf("*"); } printf("\n"); } }
0
0
3
qkrthgus7026
2019년 7월 03일
In 소스 코드 제출
/* #include <stdio.h> int main() { printf("aksjdlkjsda\n"); printf("-------------"); printf("asjdka\nlsjdasdlkjdasjklasd"); return 0; } */ /* #include<stdio.h> int main() { printf("Hello World"); return 0; } */ /* #include<stdio.h> int main() { printf("\"Hello World\""); return 0; } */ /* #include<stdio.h> int main() { int a;// > -21~+21 int b; scanf("%d", &a); // decimal scanf("%d", &b); // printf("%d", a+b); double a; scanf("%lf", &a); return 0; } */ /*#include<stdio.h> int main() { long long int a,b; scanf("%lld %lld", &a,&b); printf("%lld", a+b); return 0; } */ /* #include<stdio.h> int main() { int a,b; scanf("%d%d",&a,&b); printf("%d",a|b); return 0; } */ /* #include<stdio.h> int main() { int k; scanf("%o", &k); printf("%x", k); } */ // 삼항 연산자 #include<stdio.h> int main() { int a, b, c; scanf("%d %d %d", &a, &b, &c); printf("%d", a>b? (b>c?c:b) : (a>c?c:a)); return 0; }
0
0
5

qkrthgus7026

더보기
bottom of page