"SWEA 1986 지그재그 숫자"의 두 판 사이의 차이

(새 문서: ==개요== ;{{subst:PAGENAME}} * https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId= {{SWEA 헤더}} {{SWEA 난이도 2-1}} |} ==C++== <source lang='cp...)
 
 
(사용자 3명의 중간 판 6개는 보이지 않습니다)
1번째 줄: 1번째 줄:
==개요==
==개요==
;SWEA 1986 지그재그 숫자
{{SWEA|난이도=2
* https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=
|링크=https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PxmBqAe8DFAUq}}
 
{{SWEA 헤더}}
{{SWEA 난이도 2-1}}
|}


==C++==
==C++==
<source lang='cpp'>
<syntaxhighlight lang='cpp'>
</source>
#include <iostream>
using namespace std;
int main() {
int T;
scanf("%d", &T);
int N;
for(int tc=1; tc<=T; tc++) {
scanf("%d", &N);
int sum = 0;
for(int i=1; i<=N; i++) {
if( i%2 == 0 ) sum -= i;
else sum += i;
}
printf("#%d %d\n", tc, sum);
}
}
</syntaxhighlight>


==Java==
==Java==
<source lang='java'>
<syntaxhighlight lang='java'>
</source>
import java.util.Scanner;
class Solution {
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        for( int t=1; t<=T; t++ ) {
            int n = sc.nextInt();
            int sum = 0;
            for( int i=1; i<=n; i++ ) {
                sum += ( (i%2==0) ? -1 : 1 ) * i;
            }
            System.out.format("#%d %d\n", t, sum);
        }
    }
}
</syntaxhighlight>
 
==Python==
<syntaxhighlight lang='python'>
#kcy
k = int(input())
for i in range(1, k+1):
    n = int(input())
    sum = 0
    for j in range(1, n+1):
        if j % 2== 0:
            sum = sum - j
        else:
            sum = sum + j
    print("#%d" %i, sum)
</syntaxhighlight>
<syntaxhighlight lang='python'>
T = int(input())
for tt in range(T):
    n = int(input())
    s = 0
    for j in range(1,n+1):
        if j % 2== 0:
            s -= j
        else:
            s += j
    print( f"#{tt+1}", s)
</syntaxhighlight>

2023년 8월 25일 (금) 01:44 기준 최신판

1 개요[ | ]

SWEA 1986 지그재그 숫자

2 C++[ | ]

#include <iostream>
using namespace std;
int main() {
	int T;
	scanf("%d", &T);
	int N;
	for(int tc=1; tc<=T; tc++) {
		scanf("%d", &N);
		int sum = 0;
		for(int i=1; i<=N; i++) {
			if( i%2 == 0 ) sum -= i;
			else sum += i;
		}
		printf("#%d %d\n", tc, sum);
	}
}

3 Java[ | ]

import java.util.Scanner;
class Solution {
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        for( int t=1; t<=T; t++ ) {
            int n = sc.nextInt();
            int sum = 0;
            for( int i=1; i<=n; i++ ) {
                sum += ( (i%2==0) ? -1 : 1 ) * i;
            }
            System.out.format("#%d %d\n", t, sum);
        }
    }
}

4 Python[ | ]

#kcy
k = int(input())
for i in range(1, k+1):
    n = int(input())
    sum = 0
    for j in range(1, n+1):
        if j % 2== 0:
            sum = sum - j
        else:
            sum = sum + j
    print("#%d" %i, sum)
T = int(input())
for tt in range(T):
    n = int(input())
    s = 0
    for j in range(1,n+1):
        if j % 2== 0:
            s -= j
        else:
            s += j
    print( f"#{tt+1}", s)
문서 댓글 ({{ doc_comments.length }})
{{ comment.name }} {{ comment.created | snstime }}