結果
問題 | No.864 四方演算 |
ユーザー | kotamanegi |
提出日時 | 2019-08-16 22:07:18 |
言語 | C++17(clang) (17.0.6 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 13 ms / 1,000 ms |
コード長 | 1,952 bytes |
コンパイル時間 | 1,298 ms |
コンパイル使用メモリ | 148,208 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-30 14:31:30 |
合計ジャッジ時間 | 2,474 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 13 ms
5,248 KB |
testcase_02 | AC | 9 ms
5,248 KB |
testcase_03 | AC | 10 ms
5,248 KB |
testcase_04 | AC | 12 ms
5,248 KB |
testcase_05 | AC | 8 ms
5,248 KB |
testcase_06 | AC | 12 ms
5,248 KB |
testcase_07 | AC | 11 ms
5,248 KB |
testcase_08 | AC | 9 ms
5,248 KB |
testcase_09 | AC | 6 ms
5,248 KB |
testcase_10 | AC | 5 ms
5,248 KB |
testcase_11 | AC | 3 ms
5,248 KB |
testcase_12 | AC | 9 ms
5,248 KB |
testcase_13 | AC | 7 ms
5,248 KB |
testcase_14 | AC | 3 ms
5,248 KB |
testcase_15 | AC | 13 ms
5,248 KB |
testcase_16 | AC | 11 ms
5,248 KB |
testcase_17 | AC | 11 ms
5,248 KB |
testcase_18 | AC | 10 ms
5,248 KB |
testcase_19 | AC | 8 ms
5,248 KB |
testcase_20 | AC | 12 ms
5,248 KB |
testcase_21 | AC | 10 ms
5,248 KB |
testcase_22 | AC | 9 ms
5,248 KB |
testcase_23 | AC | 3 ms
5,248 KB |
testcase_24 | AC | 8 ms
5,248 KB |
testcase_25 | AC | 5 ms
5,248 KB |
testcase_26 | AC | 9 ms
5,248 KB |
testcase_27 | AC | 1 ms
5,248 KB |
testcase_28 | AC | 1 ms
5,248 KB |
testcase_29 | AC | 2 ms
5,248 KB |
ソースコード
/*This Submission is to determine how many 120/240 min const. delivery point there are.//info120 req. steps <= 5test_case 1,6 == 50 delivery point2,3,4,5,7 == 80 delivery point8,9 == 90 delivery point10 > 100 delivery point*/#define _CRT_SECURE_NO_WARNINGS#include <stdio.h>#include <algorithm>#include <utility>#include <functional>#include <cstring>#include <queue>#include <stack>#include <math.h>#include <iterator>#include <vector>#include <string>#include <set>#include <math.h>#include <iostream>#include <random>#include<map>#include <iomanip>#include <time.h>#include <stdlib.h>#include <list>#include <typeinfo>#include <list>#include <set>#include <cassert>#include<fstream>#include <unordered_map>#include <cstdlib>#include <complex>#include <cctype>#include <bitset>using namespace std;typedef string::const_iterator State;#define Ma_PI 3.141592653589793#define eps 0.00000001#define LONG_INF 1e18#define GOLD 1.61803398874989484820458#define MAX_MOD 1000000007#define MOD 1000000007#define seg_size 262144#define REP(a,b) for(long long a = 0;a < b;++a)unsigned long xor128() {static unsigned long x = time(NULL), y = 362436069, z = 521288629, w = 88675123;unsigned long t = (x ^ (x << 11));x = y; y = z; z = w;return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));}long long func(long long n, long long a) {pair<long long, long long> now;now.second = min(n, a-1);now.first = max(1LL, a - n);return max(0LL,now.second - now.first +1LL);}int main() {long long n, k;cin >> n >> k;//(a+c)(b+d) == klong long ans = 0;vector<long long> kouho;for (long long i = 1; i <= sqrt(k); ++i) {if (k % i == 0) {kouho.push_back(i);if (k / i != i) {kouho.push_back(k / i);}}}for (long long i = 0; i < kouho.size(); ++i) {long long A = func(n, kouho[i]);long long B = func(n, k / kouho[i]);ans += A * B;}cout << ans << endl;}