neoevoke » [usaco] 1.3 Prime Cryptarithm

[usaco] 1.3 Prime Cryptarithm - usaco

2009.08.08 22:40 neoevoke Edit

곱셈이 *로 적혀있을때 이 *대신 어떤 숫자를 넣어서 식을 풀어내는 문제이다.

무식하게 for를 많이 돌려서 풀면 된다.

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

using namespace std;

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

int n;
    fin >> n;

int a[10];
	for(int i=0;i<10;i++) a[i]=0;

for(int i=0;i<n;i++)
	{
		int num;
		fin >> num;
		a[num]=1;	
	}

int cnt=0;

for(int i1=1;i1<10;i1++)
    	if(a[i1])
    for(int i2=1;i2<10;i2++)
    	if(a[i2])
    for(int i3=1;i3<10;i3++)
    	if(a[i3])
    for(int i4=1;i4<10;i4++)
    	if(a[i4])
    for(int i5=1;i5<10;i5++)
    	if(a[i5])
		{
			bool found=true;
			int s1=(i1*100+i2*10+i3)*i5;
			int s2=(i1*100+i2*10+i3)*i4;
			int s3=s2*10+s1;
			if(s1<100||s1>999) found=false;
			while(s1>0)
			{
				if(a[s1%10]==0) found=false;
				s1/=10;
			}
			if(s2<100||s2>999) found=false;
			while(s2>0)
			{
				if(a[s2%10]==0) found=false;
				s2/=10;
			}
			if(s3<1000||s3>9999) found=false;
			
			while(s3>0)
			{
				if(a[s3%10]==0) found=false;
				s3/=10;
			}
			if(found){
				cnt++;
			}
		}

fout << cnt << endl;
	return 0;
}

[usaco] 1.4 Packing Rectangles [usaco] 1.3 Claf Flac

Trackbacks 0

엮인글 주소: http://dw.yutar.net/329391/289/trackback

Comments 0

Leave Comments

neoevoke소셜계의 김성모

[usaco] 1.3 Prime Cryptarithm - usaco

Trackbacks 0

Comments 0

Leave Comments

Category

Recent Post

Recent Comment

Recent Trackback

Tag