목록Algorithm/CodeUp (60)
BASIC의 개발 노트
123456789101112131415#include int main(){ int n; scanf("%d", &n); if (n % 7 == 0){ printf("multiple"); }else{ printf("not multiple"); } return 0;} Colored by Color Scriptercs
1234567891011121314#include int main(){ int a, b; scanf("%d %d", &a, &b); if (a > b) printf("%d", a - b); else printf("%d", b - a); return 0;} cs
12345678910111213141516#include int main(){ int a, b; scanf("%d %d", &a, &b); if (a > b) printf("%c", '>'); else if(a
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647#include int main(){ int x = 1, y = 1; int antMaze[10][10] = { 0 }; for(int i = 0; i
12345678910111213141516171819202122232425262728293031323334#include int main(){ int h, w, n; int board[101][101] = {0}; scanf("%d %d", &h, &w); scanf("%d", &n); for(int i = 0; i
12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include int main(){ int baduk[20][20] = {0}; // 실 사용 Index 1 ~ 19 for(int i = 1; i
12345678910111213141516171819202122232425#include int main(){ int whiteStone = 0; int baduk[20][20] = {0}; scanf("%d", &whiteStone); for(int k = 0; k
12345678910111213141516171819202122#include int main(){ int n; int getNum; int minNum = 23; scanf("%d", &n); for(int i = 0; i
1234567891011121314151617181920#include int main(){ int n; int getTime; scanf("%d", &n); int arr[24] = { 0 }; for(int i = 0; i = 0; i--){ printf("%d ", arr[i]); } return 0;} Colored by Color Scriptercs