Submission #3115504
Source Code Expand
/** * File : C.cpp * Author : Kazune Takahashi * Created : 2018-9-1 20:53:31 * Powered by Visual Studio Code */ #include <iostream> #include <iomanip> // << fixed << setprecision(xxx) #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ; #include <vector> #include <string> // to_string(nnn) // substr(m, n) // stoi(nnn) #include <complex> #include <tuple> #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> #include <functional> #include <random> // auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(19920725)); #include <chrono> // std::chrono::system_clock::time_point start_time, end_time; // start = std::chrono::system_clock::now(); // double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count(); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> using namespace std; #define DEBUG 0 // change 0 -> 1 if we need debug. typedef long long ll; // const int dx[4] = {1, 0, -1, 0}; // const int dy[4] = {0, 1, 0, -1}; // const int C = 1e6+10; // const ll M = 1000000007; ll N, K; int main() { cin >> N >> K; if (K % 2 == 0) { ll cnt[2] = {0, 0}; for (auto i = 1; i <= N; i++) { if (i % (K / 2) == 0) { cnt[(i / (K / 2)) % 2]++; } } // cerr << "cnt = " << cnt[0] << " " << cnt[1] << endl; cout << cnt[0] * cnt[0] * cnt[0] + cnt[1] * cnt[1] * cnt[1] << endl; } else { ll cnt = 0; for (auto i = 1; i <= N; i++) { if (i % K == 0) { cnt++; } } cout << cnt * cnt * cnt << endl; } }
Submission Info
Submission Time | |
---|---|
Task | C - Triangular Relationship |
User | kazunetakahashi |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1729 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt, s4.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 3 ms | 256 KB |
02.txt | AC | 4 ms | 256 KB |
03.txt | AC | 3 ms | 256 KB |
04.txt | AC | 3 ms | 256 KB |
05.txt | AC | 2 ms | 256 KB |
06.txt | AC | 2 ms | 256 KB |
07.txt | AC | 2 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 2 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 2 ms | 256 KB |
13.txt | AC | 3 ms | 256 KB |
14.txt | AC | 2 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 1 ms | 256 KB |