Submission #3116138
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fo(i, n) for(int i = 1; i <= n; ++i)
const int mod = 1e9 + 7;
const int N = 400012;
const int inf = 2e9;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int n, k;
ll ans = 0;
cin >> n >> k;
for(int i = 0; i < k; ++i) {
int cnt = 0;
for(int j = (i == 0 ? i + k : i); j <= n; j += k) {
++cnt;
}
if(i * 2 % k == 0) ans += cnt *1ll* cnt *1ll* cnt;
}
cout << ans;
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | C - Triangular Relationship |
| User | Speedster |
| Language | C++14 (GCC 5.4.1) |
| Score | 300 |
| Code Size | 579 Byte |
| Status | AC |
| Exec Time | 2 ms |
| Memory | 256 KiB |
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 | 1 ms | 256 KiB |
| 02.txt | AC | 1 ms | 256 KiB |
| 03.txt | AC | 1 ms | 256 KiB |
| 04.txt | AC | 1 ms | 256 KiB |
| 05.txt | AC | 1 ms | 256 KiB |
| 06.txt | AC | 2 ms | 256 KiB |
| 07.txt | AC | 2 ms | 256 KiB |
| 08.txt | AC | 1 ms | 256 KiB |
| 09.txt | AC | 2 ms | 256 KiB |
| 10.txt | AC | 1 ms | 256 KiB |
| 11.txt | AC | 1 ms | 256 KiB |
| 12.txt | AC | 1 ms | 256 KiB |
| 13.txt | AC | 1 ms | 256 KiB |
| 14.txt | AC | 1 ms | 256 KiB |
| s1.txt | AC | 1 ms | 256 KiB |
| s2.txt | AC | 1 ms | 256 KiB |
| s3.txt | AC | 1 ms | 256 KiB |
| s4.txt | AC | 1 ms | 256 KiB |