USACO Humble Numbers

最新推荐文章于 2016-12-20 00:17:46 发布

深蓝色的猫

最新推荐文章于 2016-12-20 00:17:46 发布

阅读量294

点赞数

分类专栏： USACO

本文链接：https://blog.csdn.net/bluecat56/article/details/18816853

版权

USACO 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

1、这道题还真是考到了我不会的地方。。。实际上就是一个生成合数的过程。将1放在a【0】作为起始数，然后每次在后面跟上合法的生成数（就是“可以生成的”最小的合数），然后再将每个素数的“位置”变一下（如果有必要的话），方便下次生成。

2、我刚开始想的是先胡乱生成（生成个数可能远远大于n，用set来防止重复），再排序，这样不行，素数一多，空间就吃不消。

/*
ID:mrxy564
PROG:humble
LANG:C++
*/
#include<cstdio>
using namespace std;
const int INF=~0U>>1;
int a[100010],prime[110],pos[110],min;
int main(){
freopen("humble.in","r",stdin);
freopen("humble.out","w",stdout);
    int k,n,temp;
scanf("%d%d",&k,&n);
for(int i=0;i<k;i++){
  scanf("%d",&temp);
     prime[i]=temp;
  pos[i]=0;
}
int t=0;
a[t]=1;
while(1){
  min=INF;
     for(int i=0;i<k;i++)
     if(prime[i]*a[pos[i]]<min)
      min=prime[i]*a[pos[i]];
  a[++t]=min;
        for(int i=0;i<k;i++)
   if(prime[i]*a[pos[i]]==min) pos[i]++;
  if(t==n) break;
}
printf("%d\n",a[n]);
return 0;
}

官方题解：

We compute the first n humble numbers in the "hum" array. For simplicity of implementation, we treat 1 as a humble number, and adjust accordingly.

Once we have the first k humble numbers and want to compute the k+1st, we do the following:

	for each prime p
		find the minimum humble number h
		  such that h * p is bigger than the last humble number.

	take the smallest h * p found: that's the next humble number.

To speed up the search, we keep an index "pindex" of what h is for each prime, and start there rather than at the beginning of the list.

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <ctype.h>

#define MAXPRIME 100
#define MAXN 100000

long hum[MAXN+1];
int nhum;

int prime[MAXPRIME];
int pindex[MAXPRIME];
int nprime;

void
main(void)
{
    FILE *fin, *fout;
    int i, minp;
    long min;
    int n;

    fin = fopen("humble.in", "r");
    fout = fopen("humble.out", "w");
    assert(fin != NULL && fout != NULL);

    fscanf(fin, "%d %d", &nprime, &n);
    for(i=0; i<nprime; i++)
	fscanf(fin, "%d", &prime[i]);

    hum[nhum++] = 1;
    for(i=0; i<nprime; i++)
	pindex[i] = 0;

    while(nhum < n+1) {
	min = 0x7FFFFFFF;
	minp = -1;
	for(i=0; i<nprime; i++) {
	    while((double)prime[i] * hum[pindex[i]] <= hum[nhum-1]) 
		pindex[i]++;

	    /* double to avoid overflow problems */
	    if((double)prime[i] * hum[pindex[i]] < min) {
		min = prime[i] * hum[pindex[i]];
		minp = i;
	    }
	}

	hum[nhum++] = min;
	pindex[minp]++;
    }

    fprintf(fout, "%d\n", hum[n]);
    exit(0);
}