neoevoke » [usaco] 1.2 Transformations

[usaco] 1.2 Transformations - usaco

2009.08.08 19:38 neoevoke Edit

노가다 중에 노가다라고 할 수 있겠다.

핵심은 노가다를 얼마나 깔끔하게 짜는가이겠지만...
이정도면 걍 무난한 것 같다.

/*
ID: neoevok1
PROG: transform
LANG: C++
*/
#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
#include <vector>

using namespace std;

vector<string> rotate(vector<string> r)
{
	vector<string> ret=r;
	for(int i=0;i<r.size();i++)
		for(int j=0;j<r.size();j++)
		{
			ret[j][r.size()-i-1]=r[i][j];
		}
	return ret;
}

vector<string> mirror(vector<string> r)
{
	vector<string> ret = r;
	for(int i=0;i<r.size();i++)
		for(int j=0;j<r[i].length();j++)
			ret[i][r[i].length()-j-1]=r[i][j];
	return ret;
}

int main() {
    ofstream fout ("transform.out");
    ifstream fin ("transform.in");

int n;

fin >> n;
	vector<string> m1(n),m2(n);
	for(int i=0;i<n;i++)
		fin >> m1[i];
	for(int i=0;i<n;i++)
		fin >> m2[i];

int status=7;
	if(m1==m2) status=6;

vector<string> t = mirror(m1);
	for(int i=0;i<3;i++)
	{
		t=rotate(t);
		if(t==m2) status=5;
	}

t=mirror(m1);
	if(t==m2) status=4;

t=m1;
	for(int i=0;i<3;i++)
	{
		t=rotate(t);
	}
	if(t==m2) status=3;

t=m1;
	for(int i=0;i<2;i++)
	{
		t=rotate(t);
	}
	if(t==m2) status=2;

t=m1;
	for(int i=0;i<1;i++)
	{
		t=rotate(t);
	}
	if(t==m2) status=1;

fout << status << endl;
	return 0;
}

[usaco] 1.2 Name That Number [usaco] 1.2 Milking Cows

Trackbacks 0

엮인글 주소: http://dw.yutar.net/329384/7ae/trackback

Comments 0

Leave Comments

neoevoke난 전설 같은건 믿지 않아

[usaco] 1.2 Transformations - usaco

Trackbacks 0

Comments 0

Leave Comments

Category

Recent Post

Recent Comment

Recent Trackback

Tag