zoukankan      html  css  js  c++  java
  • PAT甲级:1152 Google Recruitment (20分)

    PAT甲级: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
    

    思路

    写一个素数判断函数就可以轻松AC~

    如果有几个测试点不对,请看看是不是尾部的字符串没有处理对~

    code

    #include <iostream>
    using namespace std;
    bool isPrime(long long int num){
    	if(num == 0 || num == 1) return false;
    	for(int i = 2; i * i < num; i++)
    		if(num % i == 0) return false;
    	return true;
    }
    int main(){
    	int dig_n, prime_n;
    	scanf("%d%d", &dig_n, &prime_n);
    	string dig;dig.resize(dig_n);
    	scanf("%s", &dig[0]);
    	long long int num;
    	for(auto it = dig.begin(); it != dig.end() - prime_n + 1; it++){
    		string temp(it, it + prime_n);
    		num = stoll(temp);
    		if(isPrime(num)){
    			printf("%s", temp.c_str());
    			return 0;
    		}
    	}
    	printf("404
    ");
    	return 0;
    }
    
    
  • 相关阅读:
    C++ 虚函数 、纯虚函数、接口的实用方法和意义
    C++ static成员变量与static成员函数
    C++格式化输出的好东西
    const的用法,特别是用在函数前面与后面的区别!
    SAP CRM WebClient UI cross component跳转的一个具体例子
    如何用ABAP代码读取SAP Business partner的附件数据
    SAP CRM Enterprise Search initial load遇到错误该如何处理
    使用SAP WebIDE给SAP UI5应用添加data source
    使用Selenium自动化测试SAP CRM WebClient UI
    php 对象数组互转
  • 原文地址:https://www.cnblogs.com/cell-coder/p/12840673.html
Copyright © 2011-2022 走看看