PAT (Advanced Level) Practise 1132Cut Integer (20)

来源:互联网 发布:php url加密 编辑:程序博客网 时间:2024/06/05 17:20

1132. Cut Integer (20)

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

Cutting an integer means to cut a K digits long 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 x 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:
3167334233312345678
Sample Output:
YesNoNo

#include<stdio.h>int main(){  int T;  for (scanf("%d",&T);T--;){    char s[20];    scanf("%s",s);    int n = 0;    while (s[n]) ++n;    long long a,b,c;    sscanf(s, "%lld", &a);    sscanf(s + n / 2,"%lld", &b);    s[n/2] = 0;    sscanf(s, "%lld", &c);    puts(!b || a%(b*c)?"No":"Yes");  }  return 0;}

原创粉丝点击