1132 Cut Integer（20 分）

最新推荐文章于 2025-01-15 15:24:43 发布

galesaur_wcy

最新推荐文章于 2025-01-15 15:24:43 发布

阅读量411

点赞数

CC 4.0 BY-SA版权

分类专栏： JAVA初学 PAT甲级题

本文链接：https://blog.csdn.net/galesaur_wcy/article/details/81199133

PAT甲级题同时被 2 个专栏收录

145 篇文章

订阅专栏

JAVA初学

31 篇文章

订阅专栏

本文介绍了一个编程问题，即判断一个给定的整数是否可以通过中间切割成两个较小的整数，并且该整数能被这两个较小整数的乘积整除。文章提供了完整的Java代码示例，展示了如何实现这一功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Sample Output:

Yes
No
No

题目理解错了以为是逐个分割结果发现只要分割中间就行还真的是...英文渣渣

import java.util.Scanner;
import java.lang.String;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long n = sc.nextLong();
		for(int i = 1;i <= n;i ++)
		{
			long k = sc.nextLong();
			String s = ""+k;
			int len = s.length();
			long a = 0 ,b = 0 ;
			for(int h = 0;h < len/2 ;h++)
			{
				a =(long)a * 10 +(s.charAt(h)-'0');
			}
			for(int h = (len/2);h < len; h++)
			{
				b =(long)b * 10 +(s.charAt(h)-'0');
			}
			if(a * b != 0 && k % (a*b) == 0) {
				System.out.println("Yes");
			}else 
				System.out.println("No");
			
			
		}
		sc.close();
	}
}