zoukankan      html  css  js  c++  java
  • 1132 Cut Integer (20分)

    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 <). 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

    这题是进行字符串切割,前段为a,后段为b,总体为c,如果 c % (a * b) 为 0,则打印Yes,否则打印No。我们要注意a * b是否为0,如果为0打印No

    #include <iostream>
    #include <string>
    using namespace std;
    int main() {
        int N; string s;
        cin >> N;
        while(N--) {
            cin >> s;
            int a = stoi(s.substr(0, s.length() / 2));
            int b = stoi(s.substr(s.length() / 2, s.length() / 2));
            int c = stoi(s);
            printf("%s
    ", a * b == 0 ? "No" : (c % (a * b)) == 0 ? "Yes" : "No");
        } 
    }
  • 相关阅读:
    数据库添加字段的默认值
    Map中存放数组
    JSON字符串转换为Map
    java中Object转换成int或String类型方法
    Max_connect_errors – MySQL性能参数详解
    查看已经安装的软件
    eclipse远程调试tomcat
    eclipse控制台不限制显示的行数
    栈和堆(Stack && Heap)
    一道题引发的self和super
  • 原文地址:https://www.cnblogs.com/littlepage/p/12827398.html
Copyright © 2011-2022 走看看