zoukankan      html  css  js  c++  java
  • PAT 1132 Cut Integer

    Cutting an integer means to cut a K digits lone integer Z into two integers of (K/2) digits long integers A and B. For example, after cutting Z = 167334, we have A = 167 and B = 334. It is interesting to see that Z can be devided by the product of A and B, as 167334 / (167 × 334) = 3. Given an integer Z, you are supposed to test if it is such an integer.

    Input Specification:

    Each input file contains one test case. For each case, the first line gives a positive integer N (≤ 20). Then N lines follow, each gives an integer Z (10 ≤ Z <2^​31). It is guaranteed that the number of digits of Z is an even number.

    Output Specification:

    For each case, print a single line Yes if it is such a number, or No if not.

    Sample Input:

    3
    167334
    2333
    12345678

    Sample Output:

    Yes
    No
    No

    #include<iostream> //注意分母为0的情况
    #include<string>
    using namespace std;
    int main(){
      int n;
      cin>>n;
      for(int i=0; i<n; i++){
        string s;
        cin>>s;
        unsigned long long int z=stoi(s);
        unsigned long long int a=stoi(s.substr(0,s.size()/2));
        unsigned long long int b=stoi(s.substr(s.size()/2, s.size()/2));
        if(a*b==0)
          cout<<"No"<<endl;
        else if(z%(a*b)==0)
          cout<<"Yes"<<endl;
        else
          cout<<"No"<<endl;
      }
      return 0;
    }
    
  • 相关阅读:
    Array
    java 设计模式
    Hashtable
    lettCode-Array
    最短路径 dijkstra
    算法:优先级队列
    7.29 DFS总结
    SZU:D89 The Settlers of Catan
    SZU:B47 Big Integer I
    7.25 RPN转换
  • 原文地址:https://www.cnblogs.com/A-Little-Nut/p/9506864.html
Copyright © 2011-2022 走看看