1053 . [入門]難度1.除法練習
TopCoder
Tags
Description
給你兩個正整數P,Q，請你判斷比較大的數是否能夠被比較小的數整除？
Input Format
兩個正整數P,Q(1<=P,Q<=10,000)。
Output Format
如果P,Q當中較小者可以整除較大者的話請輸出'Y'，否則請輸出'N'。
Sample Input
Sample Input #1:
3 5
Sample Input #2:
10 2
3 5
Sample Input #2:
10 2
Sample Output
Sample Output #1:
N
Sample Output #2:
Y
N
Sample Output #2:
Y
Hints
請在輸出完字母以後輸出End Of Line喔
例如在C語言當中：printf("Y\n");
在C++當中用：cout<<"Y"<<endl;
Problem Source
原TIOJ1053 / C/C++語言入門。Problem Setter: Tmt
Subtasks
For Testdata: 0 ~ 0, Score: 16
For Testdata: 1 ~ 1, Score: 16
For Testdata: 2 ~ 2, Score: 16
For Testdata: 3 ~ 3, Score: 16
For Testdata: 4 ~ 4, Score: 16
For Testdata: 5 ~ 5, Score: 20
For Testdata: 1 ~ 1, Score: 16
For Testdata: 2 ~ 2, Score: 16
For Testdata: 3 ~ 3, Score: 16
For Testdata: 4 ~ 4, Score: 16
For Testdata: 5 ~ 5, Score: 20
| No. | Time Limit (ms) | Memory Limit (KiB) | Output Limit (KiB) |
|---|---|---|---|
| 0 | 1000 | 65536 | 262144 |
| 1 | 1000 | 65536 | 262144 |
| 2 | 1000 | 65536 | 262144 |
| 3 | 1000 | 65536 | 262144 |
| 4 | 1000 | 65536 | 262144 |
| 5 | 1000 | 65536 | 262144 |