Submission #19539200


Source Code Expand

Copy
// #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int m, d, ans = 0;
	cin >> m >> d;
	for (int i = 1; i <= m; ++i) {
		for (int d1 = 2; d1 * 10 + 2 <= d; ++d1) {
			for (int d2 = 2; d1 * 10 + d2 <= d; ++d2) {
				if (d1 * d2 == i) {
					ans++;
				}
			}
		}
	}
	cout << ans;
}

Submission Info

Submission Time
Task A - Takahashi Calendar
User Cervidae
Language C++ (GCC 9.2.1)
Score 0
Code Size 430 Byte
Status WA
Exec Time 10 ms
Memory 3520 KB

Judge Result

Set Name All Sample
Score / Max Score 0 / 200 0 / 0
Status
AC × 6
WA × 7
AC × 3
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 5 ms 3480 KB
sample_02 AC 2 ms 3484 KB
sample_03 AC 2 ms 3488 KB
testcase_01 WA 2 ms 3476 KB
testcase_02 WA 2 ms 3452 KB
testcase_03 WA 2 ms 3520 KB
testcase_04 WA 7 ms 3436 KB
testcase_05 WA 2 ms 3516 KB
testcase_06 WA 10 ms 3512 KB
testcase_07 AC 2 ms 3472 KB
testcase_08 WA 3 ms 3484 KB
testcase_09 AC 2 ms 3488 KB
testcase_10 AC 3 ms 3476 KB