zoukankan      html  css  js  c++  java
  • 1152 Google Recruitment (20 分)

    In July 2004, Google posted on a giant billboard along Highway 101 in Silicon Valley (shown in the picture below) for recruitment. The content is super-simple, a URL consisting of the first 10-digit prime found in consecutive digits of the natural constant e. The person who could find this prime number could go to the next step in Google's hiring process by visiting this website.

    prime.jpg

    The natural constant e is a well known transcendental number(超越数). The first several digits are: e = 2.718281828459045235360287471352662497757247093699959574966967627724076630353547594571382178525166427427466391932003059921... where the 10 digits in bold are the answer to Google's question.

    Now you are asked to solve a more general problem: find the first K-digit prime in consecutive digits of any given L-digit number.

    Input Specification:

    Each input file contains one test case. Each case first gives in a line two positive integers: L (≤ 1,000) and K (< 10), which are the numbers of digits of the given number and the prime to be found, respectively. Then the L-digit number N is given in the next line.

    Output Specification:

    For each test case, print in a line the first K-digit prime in consecutive digits of N. If such a number does not exist, output 404 instead. Note: the leading zeroes must also be counted as part of the K digits. For example, to find the 4-digit prime in 200236, 0023 is a solution. However the first digit 2 must not be treated as a solution 0002 since the leading zeroes are not in the original number.

    Sample Input 1:

    20 5
    23654987725541023819
     

    Sample Output 1:

    49877
     

    Sample Input 2:

    10 3
    2468024680
     

    Sample Output 2:

    404
     
    作者
    陈越
    单位
    浙江大学
    代码长度限制
    16 KB
    时间限制
    200 ms
    内存限制
    64 MB
     
    #include<bits/stdc++.h>
    using namespace std;
    const int maxn=100010;
    bool isP(int n){
        if(n<2){
            return false;
        }
        for(int i=2;i<=sqrt(n);i++){
            if(n%i==0){
                return false;
            }
        }
        return true;
    }
    int main(){
        int n,m,sum=0;
        string s;
        cin>>n>>m;
        cin>>s;
        int len=s.size();
        for(int i=0;i<=n-m;i++){
            sum=0;
            string st;
            st=s.substr(i,m);
            sum=stoi(st);
            if(isP(sum)){
                cout<<st<<endl;
                return 0;
            }
        }
        printf("404
    ");
        return 0;
    }

    string转int : int n=stoi(s);

  • 相关阅读:
    Windows SDK 之 mciSendString最后一个参数
    java常用包下载地址(非maven)
    windows api(GDI)实现图片旋转
    windows sdk版本 之 并查集生成迷宫
    自签https证书2(适配新版chrome,不会显示“不安全”)
    数据结构——栈(Stacks)
    数据结构——表(list)
    数据结构——链表(linkedlist)
    解题报告1010 诡秘的余数
    函数体中用指针返回数组的方法
  • 原文地址:https://www.cnblogs.com/dreamzj/p/14514914.html
Copyright © 2011-2022 走看看