OJ Board

Code: Select all

Removed after AC

Code: Select all

#include <stdio.h>
#include <stdlib.h>
#include <memory.h>
//#include <time.h>
#include <vector>
#define N 5000002

using namespace std;
bool isprime[N];
typedef unsigned int uint;

/****Sieve Prime Generator****/
void fill(){
	memset(isprime,1,sizeof(bool)*N);
	for(uint i = 2; i < N; i++){
		if(isprime[i])
			for(uint k = (i<<1); k < N; k+=i)
				isprime[k] = false;
	}
} 
int main(){
	int i, n, Case=1, Number, count, temp;
	scanf("%d",&n);
	vector<int>NextPrime;
	fill();
	for (i = 2; i < N; i++){
		if (isprime[i])
			NextPrime.push_back(i);
	}
	
	vector<int>::iterator it;
	while(n-- > 0){
		count = 0;
		scanf("%d",&Number);
		printf("Case #%d: %d",Case++, Number);
		temp = 0;
		for (it = NextPrime.begin(); count < 2; it++){
			if (!(Number%(*it)) && ((*it)*(*it)) != Number && temp != *it){
				temp = Number/(*it);
				printf(" = %d * %d",*it,temp);
				count++;
			}			
		}
		printf("\n");
	}
	return 0;
}

Code: Select all

#include <cassert>
#include <cstdio>
#include <cmath>

using namespace std;

long long N, yy, ii, sq, K, countee, prev;

int main(void)
{
    scanf("%lld\n", &N);
    for (yy = 1; yy <= N; yy++)
    //for (yy = 10000000; yy > 1; yy--)
    {
        scanf("%lld\n", &K);
        //K = yy;
        sq = (int)sqrt((long double)K);
        printf("Case #%lld: %lld", yy, K);
        countee = 0;
        for (ii = 2; countee < 2 && ii < sq; ii++)
        {
            if (!(K % ii))
            {
                if (countee > 0 && (ii == prev))
                    continue;
                printf(" = %lld * %lld", ii, (prev = K / ii));
                countee++;
            }
        }
        printf("\n");
    }
    return 0;
}