Submission #16871292


Source Code Expand

/**
 * Dont raise your voice, improve your argument.
 * --Desmond Tutu
 */

#include <bits/stdc++.h>
using namespace std;

const bool ready = [](){
    ios_base::sync_with_stdio(false); cin.tie(0);
    cout << fixed << setprecision(12);
    return true;
}();

const double PI = acos(-1);
using ll= long long;
#define int ll
#define all(v) (v).begin(), (v).end()
#define fori(n) for(int i=0; i<int(n); i++)

#define cini(i) int i; cin>>i;
#define cins(s) string s; cin>>s;
#define cind(d) double d; cin>>d;
#define cinai(a,n) vi a(n); fori(n) { cin>>a[i]; }
#define cinas(s,n) vs s(n); fori(n) { cin>>s[i]; }
#define cinad(a,n) vd a(n); fori(n) { cin>>a[i]; }

using pii= pair<int, int>;
using pdd= pair<double, double>;
using vd= vector<double>;
using vb= vector<bool>;
using vi= vector<int>;
using vvi= vector<vi>;
using vs= vector<string>;

#define endl "\n"

void solve() {
    cini(n);

    int ans=0;
    for(int i=1; i<n; i++) {
        for(int j=1; i*j<n; j++) {
            ans++;
        }
    }

    cout<<ans<<endl;

}

signed main() {
    solve();
}

// FIRST THINK, THEN CODE
// DO NOT JUMP BETWEEN PROBLEMS

Submission Info

Submission Time
Task C - A x B + C
User spookywooky
Language C++ (GCC 9.2.1)
Score 300
Code Size 1180 Byte
Status AC
Exec Time 19 ms
Memory 3628 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 37
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 7 ms 3604 KiB
00-sample-02.txt AC 2 ms 3472 KiB
00-sample-03.txt AC 15 ms 3568 KiB
01-small-01.txt AC 2 ms 3520 KiB
01-small-02.txt AC 2 ms 3520 KiB
01-small-03.txt AC 5 ms 3568 KiB
01-small-04.txt AC 3 ms 3540 KiB
01-small-05.txt AC 2 ms 3548 KiB
01-small-06.txt AC 3 ms 3628 KiB
01-small-07.txt AC 3 ms 3516 KiB
01-small-08.txt AC 2 ms 3520 KiB
01-small-09.txt AC 2 ms 3568 KiB
01-small-10.txt AC 2 ms 3468 KiB
02-min-01.txt AC 2 ms 3624 KiB
03-random-01.txt AC 3 ms 3464 KiB
03-random-02.txt AC 14 ms 3600 KiB
03-random-03.txt AC 8 ms 3512 KiB
03-random-04.txt AC 4 ms 3528 KiB
03-random-05.txt AC 3 ms 3604 KiB
05-highly-composite-number-01.txt AC 17 ms 3568 KiB
05-highly-composite-number-02.txt AC 14 ms 3528 KiB
05-highly-composite-number-03.txt AC 9 ms 3536 KiB
05-highly-composite-number-04.txt AC 5 ms 3516 KiB
05-highly-composite-number-05.txt AC 2 ms 3564 KiB
06-highly-composite-number-01.txt AC 14 ms 3512 KiB
06-highly-composite-number-02.txt AC 14 ms 3608 KiB
06-highly-composite-number-03.txt AC 11 ms 3600 KiB
06-highly-composite-number-04.txt AC 6 ms 3604 KiB
06-highly-composite-number-05.txt AC 6 ms 3536 KiB
07-highly-composite-number-01.txt AC 8 ms 3472 KiB
07-highly-composite-number-02.txt AC 12 ms 3468 KiB
07-highly-composite-number-03.txt AC 12 ms 3548 KiB
07-highly-composite-number-04.txt AC 4 ms 3628 KiB
07-highly-composite-number-05.txt AC 2 ms 3516 KiB
08-max-01.txt AC 19 ms 3568 KiB
08-max-02.txt AC 15 ms 3540 KiB
08-max-03.txt AC 16 ms 3472 KiB