KakaoTalk_20190606_001802318.png
  • 246x0w
Welcome
Curriculum
Install&Go
Board
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
  • 카테고리
  • 전체 게시물
  • 내 게시물
이재민
2020년 1월 02일

200102

게시판: 소스 코드 제출

/*

#include <stdio.h>




int main()


{


int a[55]= {0},i,j,k,n;


scanf("%d",&n);


for (i=1; i<=n-1; i++)

{


scanf("%d",&k);

a[k]=1;

}

for (j=1; j<=n; j++)

{

if(a[j]==0)

{

printf("%d",j);

}

}






}

*/

/*

#include <stdio.h>


int main()

{

int n,i,k;

int a[24]={0};

scanf("%d",&n);

for (i=1; i<=n; i++){

scanf("%d",&k);

a[k]=a[k]+1;

}

for (i=1; i<=23; i++){

printf("%d ",a[i]);

}


}

*/

/*

#include<stdio.h>


int main() {

int map[100][100] = {0};

int i, j, k=1, n;


scanf("%d", &n);


for(i=0; i<n; i++) {

for(j=0; j<n; j++) {

map[i][j] = k++;

}

}


for(i=0; i<n; i++) {

for(j=0; j<n; j++) {

printf("%d(%d,%d)\t", map[i][j], i, j);

}

printf("\n");

}

}

*/

/*

#include <stdio.h>


int main()

{

int o[120][120];

int i,j,k=1,n;

scanf("%d",&n);

for (i=1; i<=n; i++){

for (j=1; j<=n; j++){

o[i][j]=k++;

}

}

for (i=1; i<=n; i++){

for (j=1; j<=n; j++){

printf("%d ",o[i][j]);

}

printf("\n");

}

}

*/

/*

#include <stdio.h>


int main()

{

int a[120][120];

int n,i,k=1,j;

scanf("%d",&n);

for (i=1; i<=n; i++){

for (j=n; j>=1; j--){

a[i][j]=k++;

}

}

for (i=1; i<=n; i++){

for (j=1; j<=n; j++){

printf("%d ",a[i][j]);

}

printf("\n");

}

}

*/

/*

#include <stdio.h>


int main()

{

int a[120][120];

int n,i,j,k=1;

scanf("%d",&n);

for (i=1; i<=n; i++){

for (j=1; j<=n; j++){

a[j][i]=k++;

}

}

for (j=1; j<=n; j++){

for (i=1; i<=n; i++){

printf("%d ",a[j][i]);

}

printf("\n");

}

}

*/

/*

#include <stdio.h>


int main()

{

int a[120][120];

int n,i,j,k=1;

scanf("%d",&n);

for (i=1; i<=n; i++){

for (j=1; j<=n; j++){

a[i][j]=k++;

}

}

for (i=n; i>=1; i--){

for (j=1; j<=n; j++){

printf("%d ",a[j][i]);

}

printf("\n");

}

}

*/

/*

#include <stdio.h>


int main()

{

int s[120][120];

int a,b,i,j,k=1;

scanf("%d %d",&a,&b);

for (i=1; i<=a; i++){

for (j=1; j<=b; j++){

s[i][j]=k++;

}

}

for (i=a; i>=1; i--){

for (j=b; j>=1; j--){

printf("%d ",s[i][j]);

}

printf("\n");

}

}

*/

/*

#include <stdio.h>


int main()

{

int s[120][120];

int a,b,i,j,k=1;

scanf("%d %d",&a,&b);

for (i=1; i<=a; i++){

for (j=1; j<=b; j++){

s[i][j]=k++;

}

}

for (i=a; i>=1; i--){

for (j=1; j<=b; j++){

printf("%d ",s[i][j]);

}

printf("\n");

}

}

*/

/*

#include <stdio.h>


int main()

{

int s[120][120];

int a,b,i,j,k=1;

scanf("%d %d",&a,&b);

for (i=1; i<=b; i++){

for (j=1; j<=a; j++){

s[i][j]=k++;

}

}

for (j=a; j>=1; j--){

for (i=b; i>=1; i--){

printf("%d ",s[i][j]);

}

printf("\n");

}

}

*/

/*

#include <stdio.h>


int main()

{

int s[120][120];

int k=1,i,j,a,b;

scanf("%d %d",&a,&b);

for (i=1; i<=b; i++){

for (j=1; j<=a; j++){

s[i][j]=k++;

}

}

for (j=1; j<=a; j++){

for (i=b; i>=1; i--){

printf("%d ",s[i][j]);

}

printf("\n");

}

}

*/

/*

#include<stdio.h>


int main() {

int map[100][100] = {0};

int i, j, n, k=1;


scanf("%d", &n);

for(i=0; i<n; i++) {

for(j=0; j<n; j++) {

map[i][j] = k++;

}

}

for(i=0; i<n; i++) {

if(i%2==0) {

for(j=0; j<n; j++) {

printf("%d ", map[i][j]);

}

}

else {

for(j=n-1; j>=0; j--) {

printf("%d ", map[i][j]);

}

}

printf("\n");

}


}

*/

/*

#include <stdio.h>


int main()

{

int s[120][120];

int n,i,j,k=1;

scanf("%d",&n);

for (i=1; i<=n; i++){

for (j=1; j<=n; j++){

s[i][j]=k++;

}

}

for (i=1; i<=n; i++){

if(i%2==1){

for (j=1; j<=n; j++){

printf("%d ",s[i][j]);

}

}

else {

for (j=n; j>=1; j--){

printf("%d ",s[i][j]);

}

}

printf("\n");

}

}

*/

/*

#include <stdio.h>


int main()

{

int s[120][120];

int i,j,n,k=1;

scanf("%d",&n);

for (i=1; i<=n; i++){

for (j=1; j<=n; j++){

s[i][j]=k++;

}

}

for(i=1; i<=n; i++){

if(i%2==0){

for(j=1; j<=n; j++){

printf("%d ",s[i][j]);

}


}

else {

for (j=n; j>=1; j--){

printf("%d ",s[i][j]);

}

}

printf("\n");

}

}

*/

#include <stdio.h>


int main()

{

int s[120][120];

int n,i,j,k=1;

scanf("%d",&n);

for (i=1; i<=n; i++){

for (j=1; j<=n; j++){

s[i][j]=k++;

}

}

}

댓글 0개
0
댓글
댓글 0개
주소 : 경기도 용인시 광교중앙로 302 블루 스퀘어 602호
연락처 : 031) 216 - 1546
사업자등록번호 : 465-92-00916
​학원 등록 제 4603호