Submission #17148517
Source Code Expand
#include <bits/stdc++.h> typedef long long int64; int n, ans; int main() { scanf("%d", &n); for (int i = 1; i < n; i++) { ans += (n - 1) / i; } printf("%d\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - A x B + C |
User | siyuan |
Language | C++ (GCC 9.2.1) |
Score | 300 |
Code Size | 199 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 3824 KiB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:8:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] 8 | scanf("%d", &n); | ~~~~~^~~~~~~~~~
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt |
All | 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-small-01.txt, 01-small-02.txt, 01-small-03.txt, 01-small-04.txt, 01-small-05.txt, 01-small-06.txt, 01-small-07.txt, 01-small-08.txt, 01-small-09.txt, 01-small-10.txt, 02-min-01.txt, 03-random-01.txt, 03-random-02.txt, 03-random-03.txt, 03-random-04.txt, 03-random-05.txt, 05-highly-composite-number-01.txt, 05-highly-composite-number-02.txt, 05-highly-composite-number-03.txt, 05-highly-composite-number-04.txt, 05-highly-composite-number-05.txt, 06-highly-composite-number-01.txt, 06-highly-composite-number-02.txt, 06-highly-composite-number-03.txt, 06-highly-composite-number-04.txt, 06-highly-composite-number-05.txt, 07-highly-composite-number-01.txt, 07-highly-composite-number-02.txt, 07-highly-composite-number-03.txt, 07-highly-composite-number-04.txt, 07-highly-composite-number-05.txt, 08-max-01.txt, 08-max-02.txt, 08-max-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00-sample-01.txt | AC | 6 ms | 3644 KiB |
00-sample-02.txt | AC | 2 ms | 3752 KiB |
00-sample-03.txt | AC | 8 ms | 3604 KiB |
01-small-01.txt | AC | 1 ms | 3552 KiB |
01-small-02.txt | AC | 2 ms | 3764 KiB |
01-small-03.txt | AC | 5 ms | 3656 KiB |
01-small-04.txt | AC | 3 ms | 3752 KiB |
01-small-05.txt | AC | 3 ms | 3660 KiB |
01-small-06.txt | AC | 2 ms | 3756 KiB |
01-small-07.txt | AC | 2 ms | 3824 KiB |
01-small-08.txt | AC | 2 ms | 3708 KiB |
01-small-09.txt | AC | 4 ms | 3584 KiB |
01-small-10.txt | AC | 2 ms | 3600 KiB |
02-min-01.txt | AC | 3 ms | 3588 KiB |
03-random-01.txt | AC | 3 ms | 3752 KiB |
03-random-02.txt | AC | 7 ms | 3652 KiB |
03-random-03.txt | AC | 4 ms | 3652 KiB |
03-random-04.txt | AC | 3 ms | 3644 KiB |
03-random-05.txt | AC | 2 ms | 3752 KiB |
05-highly-composite-number-01.txt | AC | 6 ms | 3660 KiB |
05-highly-composite-number-02.txt | AC | 3 ms | 3604 KiB |
05-highly-composite-number-03.txt | AC | 6 ms | 3752 KiB |
05-highly-composite-number-04.txt | AC | 4 ms | 3664 KiB |
05-highly-composite-number-05.txt | AC | 3 ms | 3608 KiB |
06-highly-composite-number-01.txt | AC | 8 ms | 3824 KiB |
06-highly-composite-number-02.txt | AC | 13 ms | 3548 KiB |
06-highly-composite-number-03.txt | AC | 5 ms | 3704 KiB |
06-highly-composite-number-04.txt | AC | 2 ms | 3604 KiB |
06-highly-composite-number-05.txt | AC | 2 ms | 3664 KiB |
07-highly-composite-number-01.txt | AC | 7 ms | 3656 KiB |
07-highly-composite-number-02.txt | AC | 7 ms | 3644 KiB |
07-highly-composite-number-03.txt | AC | 8 ms | 3752 KiB |
07-highly-composite-number-04.txt | AC | 3 ms | 3824 KiB |
07-highly-composite-number-05.txt | AC | 3 ms | 3712 KiB |
08-max-01.txt | AC | 7 ms | 3656 KiB |
08-max-02.txt | AC | 9 ms | 3548 KiB |
08-max-03.txt | AC | 6 ms | 3656 KiB |