1R/2016 10 06 - Revision history

Maintenance script: Repair pages found by live-compare batch 0001

2026-03-26T14:46:15Z

Repair pages found by live-compare batch 0001

← Older revision		Revision as of 14:46, 26 March 2026
Line 15:		Line 15:
	using namespace std;		using namespace std;

	int arr[1100] = { 0, };		int arr[1100] = { 0, };
	int main(){		int main(){
	arr[0] = 1;		arr[0] = 1;
	arr[1] = 1;		arr[1] = 1;
	int n, ans;		int n, ans;
	cin>> n;		cin>> n;
	for(int i = 2; i<=n; i++){		for(int i = 2; i<=n; i++){
	arr[i] = (arr[i-1] + arr[i-2] * 2) % 10007;		arr[i] = (arr[i-1] + arr[i-2] * 2) % 10007;
	}		}
	cout<<arr[n]<<endl;		cout<<arr[n]<<endl;
	}		}
	=== 2×n 타일링 ===		=== 2×n 타일링 ===
Line 30:		Line 30:
	using namespace std;		using namespace std;

	int arr[1100] = { 0, };		int arr[1100] = { 0, };
	int main(){		int main(){
	arr[0] = 1;		arr[0] = 1;
	arr[1] = 1;		arr[1] = 1;
	int n, ans;		int n, ans;
	cin>> n;		cin>> n;
	for(int i = 2; i<=n; i++){		for(int i = 2; i<=n; i++){
	arr[i] = (arr[i-1] + arr[i-2]) % 10007;		arr[i] = (arr[i-1] + arr[i-2]) % 10007;
	}		}
	cout<<arr[n]<<endl;		cout<<arr[n]<<endl;
	}		}

Line 46:		Line 46:
	#include <iostream>		#include <iostream>

	int a[1001];		int a[1001];

	int main()		int main()
Line 53:		Line 53:
	std::cin >> n;		std::cin >> n;

	a[1] = 1;		a[1] = 1;
	a[2] = 3;		a[2] = 3;
	for (int i = 3; i <= n; i++) {		for (int i = 3; i <= n; i++) {
	a[i] = (a[i - 1] + a[i - 2] * 2) % 10007;		a[i] = (a[i - 1] + a[i - 2] * 2) % 10007;
	}		}

	std::cout << a[n];		std::cout << a[n];
	return 0;		return 0;
	}		}
Line 66:		Line 66:
	#include <iostream>		#include <iostream>

	int a[1001];		int a[1001];

	int main()		int main()
Line 73:		Line 73:
	std::cin >> n;		std::cin >> n;

	a[1] = 1;		a[1] = 1;
	a[2] = 2;		a[2] = 2;
	for (int i = 3; i <= n; i++) {		for (int i = 3; i <= n; i++) {
	a[i] = (a[i - 1] + a[i - 2]) % 10007;		a[i] = (a[i - 1] + a[i - 2]) % 10007;
	}		}

	std::cout << a[n];		std::cout << a[n];
	return 0;		return 0;
	}		}
Line 92:		Line 92:

	== 곽정흠 ==		== 곽정흠 ==

219.255.207.30 at 00:20, 7 October 2016

2016-10-07T00:20:40Z

@@ Line 43: / Line 43: @@
 == 박인서 ==
 == 곽정흠 ==
@@ Line 51: / Line 89: @@
 == 박인서 ==
 == 곽정흠 ==

125.152.171.79: {CREATE}

2016-10-06T14:54:15Z

{CREATE}

New page

__TOC__

= 오늘의 문제 =
* [https://www.acmicpc.net/problem/11727|2×n 타일링 2]
* [https://www.acmicpc.net/problem/11726|2×n 타일링]

= 참가자 =
* 15이원준
* 박인서

= 코드 =
== 15이원준 ==
=== 2×n 타일링 2 ===
#include<iostream>
using namespace std;

int arr[1100] = { 0, };
int main(){
arr[0] = 1;
arr[1] = 1;
int n, ans;
cin>> n;
for(int i = 2; i<=n; i++){
arr[i] = (arr[i-1] + arr[i-2] * 2) % 10007;
}
cout<<arr[n]<<endl;
}
=== 2×n 타일링 ===
#include<iostream>
using namespace std;

int arr[1100] = { 0, };
int main(){
arr[0] = 1;
arr[1] = 1;
int n, ans;
cin>> n;
for(int i = 2; i<=n; i++){
arr[i] = (arr[i-1] + arr[i-2]) % 10007;
}
cout<<arr[n]<<endl;
}

== 박인서 ==

== 곽정흠 ==

= 아이디어 =
== 15이원준 ==

== 박인서 ==

== 곽정흠 ==