1.3.3

最新推荐文章于 2020-04-08 22:52:08 发布

Eminem1147

最新推荐文章于 2020-04-08 22:52:08 发布

阅读量260

点赞数

分类专栏： USACO

本文链接：https://blog.csdn.net/qq_33765907/article/details/50981084

版权

USACO 专栏收录该内容

35 篇文章 0 订阅

订阅专栏

/*
ID:18861501
LANG:C++
TASK:crypt1
*/
/*------------------Header Files------------------*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <ctype.h>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <limits.h>
using namespace std;
/*------------------Definitions-------------------*/
#define LL long long
#define PI acos(-1.0)
#define INF 0x3F3F3F3F
/*---------------------Work-----------------------*/
int N;
int num[15];
bool is_in(int s)
{
	for(int i=1;i<=N;i++)
	{
		if(num[i]==s) return true;
	}
	return false;
}
bool is_inside(int s)
{
	while(s)
	{
		if(!is_in(s%10)) return false;
		s=s/10;
	}
	return true;
}
bool is_niushi(int a,int b,int c,int d,int e)
{
	int shi1=a*100+b*10+c,shi2=d*10+e;
	if(((shi1*e)/1000)||((shi1*d)/1000))
		return false;
	if(!is_inside(shi1*e)) return false;
	if(!is_inside(shi1*d)) return false;
	if(!is_inside(shi1*shi2)) return false;
	return true;
}
void work()
{
	scanf("%d",&N);
	for(int i=1;i<=N;i++)
		scanf("%d",&num[i]);
	int cnt=0;
	for(int a=1;a<=N;a++)
	{
		for(int b=1;b<=N;b++)
		{
			for(int c=1;c<=N;c++)
			{
				for(int d=1;d<=N;d++)
				{
					for(int e=1;e<=N;e++)
					{
						if(is_niushi(num[a],num[b],num[c],num[d],num[e]))
						{
							cnt++;
						}
					}
				}
			}
		}
	}
	printf("%d\n",cnt);
}
/*------------------Main Function------------------*/
int main()
{
	//freopen("test.txt","r",stdin);
	freopen("crypt1.out","w",stdout);
	freopen("crypt1.in","r",stdin);
	work();
	return 0;
}