hdu1164

maksyuki 发表于 oj 分类，标签: 数论-素因子分解

15 9月 2015

Eddy's research I

Problem Description

Eddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can't write program, so Eddy has to ask intelligent you to help him, he asks you to write a program which can do the number to divided into the multiply of prime number factor .

Input

The input will contain a number 1 < x<= 65535 per line representing the number of elements of the set.

Output

You have to print a line in the output for each entry with the answer to the previous question.

Sample Input

9412

Sample Output

112*2*13*181

Author

eddy

题目类型：整数素因子分解

算法分析：由于被分解的整数比较小，所以可以使用试除法进行整数分解

#include <set>
#include <bitset>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <vector>
#include <ios>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <complex>
#include <numeric>
#include <functional>
#include <cmath>
#include <ctime>
#include <climits>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cassert>

#define lson rt << 1, l, m
#define rson rt << 1 | 1, m + 1, r

using namespace std;

const int INF = 0x7FFFFFFF;
const double EPS = 1e-10;
const double PI = 2 * acos (0.0);
const int MOD = 7;
const int maxn = 10000 + 66;

bool is_first;

void GetFactor (long long val)
{
    for (int i = 2; i * i <= val; i++)
    {
        while (val % i == 0)
        {
            if (is_first)
            {
                is_first = false;
                cout << i;
            }

            else
                cout << "*" << i;

            val /= i;
        }
    }

    if (val != 1)
    {
        if (is_first)
        {
            is_first = false;
            cout << val;
        }

        else
            cout << "*" << val;
    }
    cout << endl;
}


int main()
{
//    ifstream cin ("aaa.txt");

    long long n;
    while (cin >> n)
    {
        is_first = true;
        GetFactor (n);
    }

return 0;
}

#include <set>

#include <bitset>

#include <list>

#include <map>

#include <stack>

#include <queue>

#include <deque>

#include <string>

#include <vector>

#include <ios>

#include <iostream>

#include <fstream>

#include <sstream>

#include <iomanip>

#include <algorithm>

#include <utility>

#include <complex>

#include <numeric>

#include <functional>

#include <cmath>

#include <ctime>

#include <climits>

#include <cstdarg>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cctype>

#include <cassert>

#define lson rt << 1, l, m

#define rson rt << 1 | 1, m + 1, r

using namespace std;

const int INF = 0x7FFFFFFF;

const double EPS = 1e-10;

const double PI = 2 * acos (0.0);

const int MOD = 7;

const int maxn = 10000 + 66;

bool is_first;

void GetFactor (long long val)

{

for (int i = 2; i * i <= val; i++)

{

while (val % i == 0)

{

if (is_first)

{

is_first = false;

cout << i;

}

else

cout << "*" << i;

val /= i;

}

if (val != 1)

{

if (is_first)

{

is_first = false;

cout << val;

}

else

cout << "*" << val;

}

cout << endl;

}

int main()

{

// ifstream cin ("aaa.txt");

long long n;

while (cin >> n)

{

is_first = true;

GetFactor (n);

}

return 0;

}

hdu1160

hdu1166

一	二	三	四	五	六	日
« 6月
	1	2	3	4	5	6
7	8	9	10	11	12	13
14	15	16	17	18	19	20
21	22	23	24	25	26	27
28	29	30	31

超客的水墨烟雨

hdu1164

Eddy's research I

分类目录

标签云

书签

近期评论