Instantly share code, notes, and snippets.

# jwon0615

• Sort options
Created Mar 22, 2018
1491 : [기초-배열연습] 2차원 배열 달팽이 채우기 4-8
View 1491.cpp
 #include #define MAXN 1000; #define MAXM 1000; int n, m; arr[MAXN][MAXM] void escargo(int n,int m){ int x=n, y=1; int cnt = n*m;
Created Mar 22, 2018
1505 : 2차원 배열 채우기 3(달팽이 배열)
View 1505.cpp
 #include int main(){ int i,j,n,diff,cnt=1; int s=0; e=-1; scanf("%d", &n); diff=n; while(cnt<=n*n){ for(i=1;i<-diff;i++) arr[s][++e]=cnt++; diff--;
Created Mar 22, 2018
1508 : 나도 IQ 150
View 1508.cpp
 #include int main() { int n, i, j, map[21][21]; scanf("%d", &n); for(i = 1; i <= n; i++) scanf("%d", &map[i][1]);
Created Mar 22, 2018
1510 : 홀수 마방진
View 1510.cpp
 #include int main() { int n, i, j, d[50][50], m = 1, a, b; scanf("%d", &n); for(i = a = 0, b = n / 2; i < n; i++) { for(j = 0; j < n; j++)
Created Mar 26, 2018
View 1810_golf.cpp
 main(a,b,i){char*c=malloc(100);scanf("%s\n%d %d",c,&a,&b);for(i=a-1;i
Created Mar 26, 2018
View 1402_golf.cpp
 i,n,a[1001];main(){scanf("%d",&n);for(;i=0;)printf("%d ",a[i--]);}
Last active Mar 26, 2018
2_codeup_연습문제_구조체
View 1721.cpp
 #include #include typedef struct { int x, y; }point; int main(){ point p1, p2; double i; scanf("%d %d %d %d", &p1.x, &p1.y, &p2.x, &p2.y);
Created Mar 26, 2018
3_codeup_연습문제_재귀
View 1916.cpp
 #include int fibo(int n, int a, int b){ if (n==0) { return a; } fibo(n-1, b,(a+b)%10009); } int main(){
Created Mar 26, 2018
4_codeup_연습문제_배열
View 1469.cpp
 #include int main(void){ int n, arr[100][100]; scanf("%d",&n); for(int i=0;i
Created Mar 26, 2018
5_codeup_연습문제_연결리스트
View 3108_list_arr.cpp
 #include typedef struct Student { int no; char name[10]; }student; void insertSt (student *p, student t, int *n) { int i; for (i=0; i<*n && p[i].no<=t.no; i++) if(p[i].no==t.no) return; for (int j=*n-1; j>=i; j--) p[j+1]=p[j];
You can’t perform that action at this time.