zoukankan      html  css  js  c++  java
  • 【ACM】Largest prime factor

    FireShot Pro Screen Capture #034 - 'HangZhouDianZiUniversity' - acm_hdu_edu_cn_game_entry_problem_show_php_chapterid=2&sectionid=1&problemid=5

    /*打表把素数能组合的数先设置成相应的位数*/
    /* if n equals two and n is No.1 position of prime factors  so four position of prime factors is no.1,as well*/
    /* although two can combined six but three also can combined six */
    /* and three position of prime factors is two ,two covered one then six largest prime factor */
    /*position is two now, have fun ;-) */

    #include <stdio.h>
    #include <stdlib.h>
    #define MAX 1000000
    /* run this program using the console pauser or add your own getch, system("pause") or input loop */
    int main(int argc, char *argv[]) {
    	int *lpf = malloc( MAX*sizeof(int) ); /*if use "int lpf[MAX]" could be overflow*/
    	int n , num ;
    	int i , j ;
    	num = 0 ;
    	lpf[1] = 0 ;
    	for( i = 2 ; i < MAX ; i++ ) {
    		if( 0 == lpf[i] ){
    			num++ ; 
    		for( j = i ; j < MAX ; j=j+i )   
    			lpf[j] = num ;	
    		}
    	
    																										 	
    	}
    	while( scanf("%d",&n) != EOF )
    		printf("%d
    ",lpf[n]);
    	return 0;
    }
  • 相关阅读:
    DNS bind9安装
    DHCP服务器
    RAID
    LVM
    box-pack
    display:flex和display:box布局浏览器兼容性分析
    Flex布局
    几种常见的浏览器以及内核
    display 垂直居中
    font-family 定义的最后为什么要加一句sans-serif
  • 原文地址:https://www.cnblogs.com/hInstance/p/3479315.html
Copyright © 2011-2022 走看看