반응형
Notice
Recent Posts
Recent Comments
Link
목록설명 (73)
안경잡이 구루루
![](http://i1.daumcdn.net/thumb/C150x150.fwebp.q85/?fname=https://blog.kakaocdn.net/dn/bejMLP/btqEANbqUQv/PlzsuXPnnK2HIi24GOiwk0/img.png)
나: import sys N = int(sys.stdin.readline()) 1
파이썬(Python)/문제풀이(백준,BaekJoon)
2020. 6. 4. 12:04
![](http://i1.daumcdn.net/thumb/C150x150.fwebp.q85/?fname=https://blog.kakaocdn.net/dn/XwB2w/btqEC8rdLA3/gnIJzTG5VWxRNhW9AV66T0/img.png)
나: N = int(input()) 1
파이썬(Python)/문제풀이(백준,BaekJoon)
2020. 6. 4. 11:13
![](http://i1.daumcdn.net/thumb/C150x150.fwebp.q85/?fname=https://blog.kakaocdn.net/dn/c0Y2ng/btqEzhWPicU/UrPCFIg9SK7iRfpGpmDQd0/img.png)
나: N = int(input()) 1
파이썬(Python)/문제풀이(백준,BaekJoon)
2020. 6. 2. 13:53
![](http://i1.daumcdn.net/thumb/C150x150.fwebp.q85/?fname=https://blog.kakaocdn.net/dn/1Wzfk/btqExCHBIi3/4rSXnA7AScHOkoKl6ky8WK/img.png)
나: #include int main() { int N, NN; scanf("%d", &N); NN = N; for (int i = 0; i 0; i--) { for (int j = i-1; j > 0; j-- ) { printf(" "); } for (int j = 0; j < 1+2*NN; j++) { printf("*"); } ++NN; printf("\n"); } return 0; } 완..
C언어(C programming)/문제풀이(백준,BaekJoon)
2020. 6. 2. 11:54