PAT甲级1059 Prime Factors (25分) 图

最新推荐文章于 2022-08-03 19:08:32 发布

Douglas_LT

最新推荐文章于 2022-08-03 19:08:32 发布

阅读量138

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/Douglas_LT/article/details/109271741

版权

PAT 专栏收录该内容

53 篇文章 0 订阅

订阅专栏

#pragma warning(disable:4996)
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;

const int maxn = 100010;

bool is_prim(int n)
{
	if (n == 1)
		return false;
	int sqr = (int)sqrt(1.0*n);
	for (int i = 2; i <= sqr; i++)
	{
		if (n%i == 0)
		{
			return false;
		}
	}
}

int prim[maxn], pNum = 0;

void find_prim()
{
	for (int i = 2; i < maxn; i++)
	{
		if (is_prim(i) == true)
		{
			prim[pNum++] = i;
		}
	}
}

struct factor
{
	int x, cnt;
}fac[10];

int main()
{
	find_prim();
	int n, num = 0;
	scanf("%d", &n);
	if (n == 1)
		printf("1=1");
	else
	{
		printf("%d=", n);
		int sqr = (int)sqrt(1.0*n);
		for (int i = 0; i < pNum&&prim[i] <= sqr; i++)
		{
			if (n%prim[i] == 0)
			{
				fac[num].x = prim[i];
				fac[num].cnt = 0;
				while (n%prim[i] == 0)
				{
					fac[num].cnt++;
					n = n / prim[i];
				}
				num++;
			}
			if (n == 1)
				break;
		}

		if (n != 1)
		{
			fac[num].x = n;
			fac[num++].cnt=1;
			//num++;
		}
		for (int i = 0; i < num; i++)
		{
			if (i > 0)
				printf("*");
			printf("%d", fac[i].x);
			if (fac[i].cnt > 1)
			{
				printf("^%d", fac[i].cnt);
			}
		}
	}
	return 0;
}