zoukankan      html  css  js  c++  java
  • 数学: HDU1098 Ignatius's puzzle


    Ignatius's puzzle

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 9934    Accepted Submission(s): 6959


    Problem Description
    Ignatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5*x^13+13*x^5+k*a*x,input a nonegative integer k(k<10000),to find the minimal nonegative integer a,make the arbitrary integer x ,65|f(x)if
    no exists that a,then print "no".

     

    Input
    The input contains several test cases. Each test case consists of a nonegative integer k, More details in the Sample Input.
     

    Output
    The output contains a string "no",if you can't find a,or you should output a line contains the a.More details in the Sample Output.
     

    Sample Input
    11
    100
    9999
     

    Sample Output
    22
    no
    43
     

    Author
    eddy
     
    Problem : 1098 ( Ignatius's puzzle )     Judge Status : Accepted
    RunId : 21248504    Language : G++    Author : hnustwanghe
    Code Render Status : Rendered By HDOJ G++ Code Render Version 0.01 Beta
    #include<iostream>
    #include<cstring>
    #include<cstdio>
    
    using namespace std;
    
    int main(){
        int k,i;
        while(scanf("%d",&k)==1){
            for(i=1;i<=65;i++)
                if((18 + i*k)%65==0)
                    break;
            if(i<=65)
                printf("%d
    ",i);
            else
                printf("no
    ");
        }
    }
    
  • 相关阅读:
    asp.net Core 中间件Hello world
    MVC2 ,MVC3 ,MVC4,MVC5的区别,EF的各个版本的区别;LocalDB是个啥
    EF6 MVC5译文
    发布一个C++版本的ORM库SmartDB
    ORM
    Git图形化界面客户端大汇总
    Model工具
    HTTP协议的8种请求类型介绍
    五大主流数据库模型
    店铺装修——进阶模块介绍
  • 原文地址:https://www.cnblogs.com/Pretty9/p/7347710.html
Copyright © 2011-2022 走看看