CSES - Datatähti Open 2019 - Results
Submission details
Task:Sum
Sender:egor.lifar
Submission time:2019-01-20 13:05:23
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED100
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#2ACCEPTED0.01 sdetails
#3ACCEPTED0.02 sdetails
#4ACCEPTED0.02 sdetails
#5ACCEPTED0.01 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.02 sdetails
#8ACCEPTED0.02 sdetails
#9ACCEPTED0.01 sdetails
#10ACCEPTED0.03 sdetails
#11ACCEPTED0.02 sdetails
#12ACCEPTED0.02 sdetails
#13ACCEPTED0.01 sdetails
#14ACCEPTED0.01 sdetails
#15ACCEPTED0.02 sdetails
#16ACCEPTED0.02 sdetails
#17ACCEPTED0.03 sdetails
#18ACCEPTED0.02 sdetails
#19ACCEPTED0.01 sdetails
#20ACCEPTED0.02 sdetails
#21ACCEPTED0.02 sdetails
#22ACCEPTED0.01 sdetails
#23ACCEPTED0.02 sdetails
#24ACCEPTED0.02 sdetails
#25ACCEPTED0.02 sdetails
#26ACCEPTED0.01 sdetails
#27ACCEPTED0.02 sdetails
#28ACCEPTED0.01 sdetails

Code

/*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
*/
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <array>
       
        
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } 
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define rank rank228
#define y1 y1228                                                         
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
const string FILENAME = "input";



int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //read(FILENAME);
    int n;
    cin >> n;
    int ans = 0;
    for (int i = 1; i * 3 + 3 <= n; i++) {
        int m = n - 3 * i;
        ans += (m - 1) / 2;
    }
    cout << ans << endl;
    return 0;       
}

Test details

Test 1

Verdict: ACCEPTED

input
1

correct output
0

user output
0

Test 2

Verdict: ACCEPTED

input
2

correct output
0

user output
0

Test 3

Verdict: ACCEPTED

input
3

correct output
0

user output
0

Test 4

Verdict: ACCEPTED

input
4

correct output
0

user output
0

Test 5

Verdict: ACCEPTED

input
5

correct output
0

user output
0

Test 6

Verdict: ACCEPTED

input
6

correct output
1

user output
1

Test 7

Verdict: ACCEPTED

input
7

correct output
1

user output
1

Test 8

Verdict: ACCEPTED

input
8

correct output
2

user output
2

Test 9

Verdict: ACCEPTED

input
9

correct output
3

user output
3

Test 10

Verdict: ACCEPTED

input
10

correct output
4

user output
4

Test 11

Verdict: ACCEPTED

input
20

correct output
24

user output
24

Test 12

Verdict: ACCEPTED

input
30

correct output
61

user output
61

Test 13

Verdict: ACCEPTED

input
40

correct output
114

user output
114

Test 14

Verdict: ACCEPTED

input
50

correct output
184

user output
184

Test 15

Verdict: ACCEPTED

input
60

correct output
271

user output
271

Test 16

Verdict: ACCEPTED

input
70

correct output
374

user output
374

Test 17

Verdict: ACCEPTED

input
80

correct output
494

user output
494

Test 18

Verdict: ACCEPTED

input
90

correct output
631

user output
631

Test 19

Verdict: ACCEPTED

input
100

correct output
784

user output
784

Test 20

Verdict: ACCEPTED

input
200

correct output
3234

user output
3234

Test 21

Verdict: ACCEPTED

input
300

correct output
7351

user output
7351

Test 22

Verdict: ACCEPTED

input
400

correct output
13134

user output
13134

Test 23

Verdict: ACCEPTED

input
500

correct output
20584

user output
20584

Test 24

Verdict: ACCEPTED

input
600

correct output
29701

user output
29701

Test 25

Verdict: ACCEPTED

input
700

correct output
40484

user output
40484

Test 26

Verdict: ACCEPTED

input
800

correct output
52934

user output
52934

Test 27

Verdict: ACCEPTED

input
900

correct output
67051

user output
67051

Test 28

Verdict: ACCEPTED

input
1000

correct output
82834

user output
82834