結果

問題 No.1532 Different Products
ユーザー leaf_1415leaf_1415
提出日時 2021-06-04 21:36:14
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 5,848 bytes
コンパイル時間 1,930 ms
コンパイル使用メモリ 85,672 KB
実行使用メモリ 317,644 KB
最終ジャッジ日時 2023-08-12 12:06:08
合計ジャッジ時間 18,978 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
9,580 KB
testcase_01 AC 163 ms
161,760 KB
testcase_02 AC 6 ms
19,776 KB
testcase_03 AC 3 ms
9,564 KB
testcase_04 AC 4 ms
13,792 KB
testcase_05 AC 2 ms
7,676 KB
testcase_06 AC 19 ms
25,016 KB
testcase_07 AC 27 ms
34,708 KB
testcase_08 AC 30 ms
38,712 KB
testcase_09 AC 67 ms
71,408 KB
testcase_10 AC 136 ms
137,040 KB
testcase_11 AC 122 ms
120,564 KB
testcase_12 AC 229 ms
209,440 KB
testcase_13 AC 125 ms
123,548 KB
testcase_14 AC 396 ms
315,848 KB
testcase_15 AC 31 ms
34,584 KB
testcase_16 AC 266 ms
237,928 KB
testcase_17 AC 120 ms
112,656 KB
testcase_18 AC 81 ms
83,736 KB
testcase_19 AC 199 ms
190,228 KB
testcase_20 AC 358 ms
295,348 KB
testcase_21 AC 268 ms
259,860 KB
testcase_22 AC 145 ms
145,232 KB
testcase_23 AC 89 ms
90,872 KB
testcase_24 AC 302 ms
284,720 KB
testcase_25 AC 249 ms
227,108 KB
testcase_26 AC 97 ms
95,984 KB
testcase_27 AC 351 ms
291,052 KB
testcase_28 AC 228 ms
214,920 KB
testcase_29 AC 321 ms
308,980 KB
testcase_30 AC 333 ms
317,620 KB
testcase_31 AC 327 ms
309,404 KB
testcase_32 AC 331 ms
315,784 KB
testcase_33 AC 320 ms
303,348 KB
testcase_34 AC 315 ms
303,452 KB
testcase_35 AC 345 ms
309,624 KB
testcase_36 AC 351 ms
317,456 KB
testcase_37 AC 328 ms
308,968 KB
testcase_38 AC 336 ms
309,036 KB
testcase_39 AC 331 ms
304,952 KB
testcase_40 AC 316 ms
304,920 KB
testcase_41 WA -
testcase_42 AC 328 ms
309,348 KB
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 AC 339 ms
317,540 KB
testcase_60 WA -
testcase_61 AC 3 ms
7,484 KB
testcase_62 AC 2 ms
7,440 KB
testcase_63 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(llint (x) = (s); (x) >= (t); (x)--)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

//const ll mod = 1000000007;
const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}
ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}
template<typename T>
void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}

template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++; if(itr != map_var.end()) os << ","; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, multiset<T>& set_var) {
	for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t){
	for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
	cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}

ll n, k;
ll ldp[205][100005];
ll rdp[205][100005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> k;
	if(n == 1){
		outl(1);
		return 0;
	}
	
	ldp[1][1] = 1;
	rep(i, 1, n-1){
		rep(j, 1, 100000){
			ldp[i+1][j] += ldp[i][j];
			if(j*(i+1) <= 100000) ldp[i+1][j*(i+1)] += ldp[i][j];
		}
	}
	if(k <= 100000){
		ll ans = 0;
		rep(j, 1, k) ans += ldp[n][j];
		ans *= 2, ans--;
		outl(ans);
		return 0;
	}
	
	rdp[n+1][1] = 1;
	per(i, n+1, 3){
		rep(j, 1, 100000){
			rdp[i-1][j] += rdp[i][j];
			if(j*(i+1) <= 100000) rdp[i-1][j*(i-1)] += rdp[i][j];
		}
	}
	rep(i, 2, n+1) rep(j, 2, 100000) rdp[i][j] += rdp[i][j-1];
	
	ll ans = 0;
	rep(j, 1, 100000) ans += ldp[n][j];
	rep(i, 2, n){
		rep(j, 1, 100000) if(i*j > 100000) ans += rdp[i+1][k/(i*j)] * ldp[i-1][j];
	}
	ans *= 2, ans--;
	outl(ans);
	
	return 0;
}
0