oj.uz

답안 #845667

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
845667 2023-09-06T14:50:40 Z tolbi Konstrukcija (COCI20_konstrukcija) C++17
15 / 110
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9+7;
int32_t main(){
	int k;cin>>k;
	if (k>=0){
		cout<<k+3<<" "<<(k+1)*2<<endl;
		for (int i = 2; i < k+3; i++){
			cout<<1<<" "<<i<<endl;
			cout<<i<<" "<<k+3<<endl;
		}
		return 0;
	}
	else {
		k=-k;
		cout<<k+5<<" "<<(k+1)*4<<endl;
		for (int i = 4; i < k+5; i++){
			cout<<1<<" "<<i<<endl;
			cout<<2<<" "<<i<<endl;
			cout<<3<<" "<<i<<endl;
			cout<<i<<" "<<k+5<<endl;
		}
		cout<<1<<" "<<3<<endl;
		cout<<1<<" "<<2<<endl;
	}
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Correct.
2 Correct 1 ms 348 KB Correct.
3 Correct 1 ms 348 KB Correct.
4 Correct 0 ms 348 KB Correct.
5 Correct 1 ms 348 KB Correct.

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Correct.
2 Correct 1 ms 348 KB Correct.
3 Correct 1 ms 348 KB Correct.
4 Correct 0 ms 348 KB Correct.
5 Correct 1 ms 348 KB Correct.
6 Incorrect 1 ms 348 KB Wrong answer.
7 Halted 0 ms 0 KB -

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Correct.
2 Correct 1 ms 348 KB Correct.
3 Correct 1 ms 348 KB Correct.
4 Correct 0 ms 348 KB Correct.
5 Correct 1 ms 348 KB Correct.
6 Incorrect 1 ms 348 KB Wrong answer.
7 Halted 0 ms 0 KB -