zoukankan      html  css  js  c++  java
  • 杭电 1795 The least one

    The least one

    Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 492    Accepted Submission(s): 184


    Problem Description
      In the RPG game “go back ice age”(I decide to develop the game after my undergraduate education), all heros have their own respected value, and the skill of killing monsters is defined as the following rule: one hero can kill the monstrers whose respected values are smaller then himself and the two respected values has none common factor but 1, so the skill is the same as the number of the monsters he can kill. Now each kind of value of the monsters come. And your hero have to kill at least M ones. To minimize the damage of the battle, you should dispatch a hero with minimal respected value. Which hero will you dispatch ? There are Q battles, in each battle, for i from 1 to Q, and your hero should kill Mi ones at least. You have all kind of heros with different respected values, and the values(heros’ and monsters’) are positive.
     
    Input
      The first line has one integer Q, then Q lines follow. In the Q lines there is an integer Mi, 0<Q<=1000000, 0<Mi<=10000.
     
    Output
      For each case, there are Q results, in each result, you should output the value of the hero you will dispatch to complete the task.
     
    Sample Input
    2
    3
    7
     
    Sample Output
    5
    11
    题意:就是求比所给数据大的最近的素数
    #include<stdio.h>
    #include<string.h>
    #define MAX 10010
    int su[MAX];
    void prime()
    {
    	int i,j;
    	memset(su,0,sizeof(su));
    	for(i=2;i<MAX;i++)
    	{
    		if(!su[i])
    		{
    			for(j=i*2;j<MAX;j+=i)
    			su[j]=1;
    		}
    	}
    	su[1]=1;
    }
    int main()
    {
    	int t,n,m,j,i;
    	scanf("%d",&t);
    	prime();
    	while(t--)
    	{
    		scanf("%d",&n);
    		for(i=n+1;i<MAX;i++)
    		{
    			if(su[i]==0)
    			{
    				printf("%d
    ",i);
    				break; 
    			}
    		}
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    了解node.js
    RC4 in TLS is Broken: Now What?
    LDAP 在ubuntu14.04下的安装配置install and configure
    Bucking the stigma (留学生请摘掉有色眼镜看社区大学)
    SSL Labs: Increased Penalty When TLS 1.2 Is Not Supported
    PostgresQL中的NUlls first/last功能
    网页小工具集合
    T-SQL在线格式化工具
    sudoers文件解析
    Java提高篇——JVM加载class文件的原理机制
  • 原文地址:https://www.cnblogs.com/tonghao/p/4694580.html
Copyright © 2011-2022 走看看