Please sign in first.
Submission #7107686
Source Code Expand
import sys input = sys.stdin.readline sys.setrecursionlimit(10 ** 7) M,D = map(int,input().split()) answer = 0 for d in range(10,D+1): a,b = divmod(d,10) if a >= 2 and b >= 2 and 1<=a*b<=M: answer += 1 print(answer)
Submission Info
Submission Time | |
---|---|
Task | A - Takahashi Calendar |
User | maspy |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 246 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 3316 KiB |
Judge Result
Set Name | All | Sample | ||||
---|---|---|---|---|---|---|
Score / Max Score | 200 / 200 | 0 / 0 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
All | sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10 |
Sample | sample_01, sample_02, sample_03 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01 | AC | 19 ms | 3316 KiB |
sample_02 | AC | 17 ms | 2940 KiB |
sample_03 | AC | 17 ms | 3060 KiB |
testcase_01 | AC | 17 ms | 2940 KiB |
testcase_02 | AC | 17 ms | 2940 KiB |
testcase_03 | AC | 17 ms | 2940 KiB |
testcase_04 | AC | 16 ms | 2940 KiB |
testcase_05 | AC | 17 ms | 2940 KiB |
testcase_06 | AC | 17 ms | 2940 KiB |
testcase_07 | AC | 17 ms | 2940 KiB |
testcase_08 | AC | 17 ms | 2940 KiB |
testcase_09 | AC | 17 ms | 2940 KiB |
testcase_10 | AC | 17 ms | 3060 KiB |