Submission #4048530
Source Code Expand
sum_ = 0 # sum of 1*1 to 9*9 for i in range(1,10): for j in range(1, 10): sum_ += i*j N = int(input()) dif = sum_ - N ans = [] for i in range(1,dif+1): if dif%i==0: if i>9 or dif//i>9: continue ans.append("{} x {}".format(i, dif//i)) print(*ans, sep="\n")
Submission Info
Submission Time | |
---|---|
Task | C - 九九足し算 |
User | odanny |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 300 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 3064 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | sample_01.txt, sample_02.txt, test_1953.txt, test_1971.txt, test_1977.txt, test_1983.txt, test_1989.txt, test_1990.txt, test_1993.txt, test_1995.txt, test_1997.txt, test_1998.txt, test_2001.txt, test_2009.txt, test_2013.txt, test_2017.txt, test_2019.txt, test_2020.txt, test_2022.txt, test_2024.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 17 ms | 3060 KB |
sample_02.txt | AC | 17 ms | 2940 KB |
test_1953.txt | AC | 17 ms | 3064 KB |
test_1971.txt | AC | 17 ms | 2940 KB |
test_1977.txt | AC | 17 ms | 3060 KB |
test_1983.txt | AC | 17 ms | 2940 KB |
test_1989.txt | AC | 17 ms | 2940 KB |
test_1990.txt | AC | 17 ms | 3060 KB |
test_1993.txt | AC | 17 ms | 2940 KB |
test_1995.txt | AC | 17 ms | 3060 KB |
test_1997.txt | AC | 17 ms | 3060 KB |
test_1998.txt | AC | 17 ms | 3060 KB |
test_2001.txt | AC | 17 ms | 3060 KB |
test_2009.txt | AC | 17 ms | 3064 KB |
test_2013.txt | AC | 17 ms | 2940 KB |
test_2017.txt | AC | 17 ms | 3060 KB |
test_2019.txt | AC | 17 ms | 2940 KB |
test_2020.txt | AC | 17 ms | 3060 KB |
test_2022.txt | AC | 17 ms | 3060 KB |
test_2024.txt | AC | 17 ms | 2940 KB |