#781407 (C++14) No.1581 Multiple Sequence

• 問題: No.1581 Multiple Sequence
• ユーザー: SAAD AHMAD
• 提出日時: 2022-07-25 06:36:10
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: RE
• 実行時間: -
• コード長: 1,718 bytes
• コンパイル時間: 1,629 ms
• コンパイル使用メモリ: 172,968 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-07-07 03:20:12
• 合計ジャッジ時間: 4,446 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

ファイルパターン	結果
sample	RE * 3
other	RE * 21

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <bits/stdc++.h>
using namespace std;
#define fast_io ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define pb push_back
#define int long long
#define ll long long
#define ld long double
#define rep(i, n) for (ll i=0; i<n; i++)
#define repi(i, n) for (ll i=1; i<=n; i++)
#define repi1(i, n) for (ll i = n; i >=0; i--)
#define mem(v, ha) memset(v, ha, sizeof(v))
#define all(a)  a.begin(), a.end()
#define allr(a)  a.rbegin(), a.rend()
#define CLOCK cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
typedef vector<ll> vi;
typedef vector<vector<int>> vvi;
typedef vector<pair<ll, ll>> vpi;
typedef vector<char> vc;
#define no cout << "NO\n"
#define yes cout << "YES\n"
#define mp make_pair
#define ff first
#define ss second
const ll MOD = 1e9 + 7;
const ll mod = 998244353 ;
const long double PI = 3.141592653589793238460;
const int inf = (int)(1e9);
// auto sum=[&](int use, int y){return use+y;};
// function <void(int)>dfs=[&](int u)  //void is the return type, int is the argument
void solve()
{
    int M;
    cin >> M;
    vvi f(M + 1);
    for (int i = 1; i <= M; i++)
    {
        for (int j = i; j <= M; j += i)
        {
            f[j].pb(i);
        }
    }
    //first element j
    //j*(1+2+...)=i
    vector<long long> dp(M + 1);
    dp[0] = 1;
    for (int i = 1; i <= M; i++) {
        for (int j : f[i]) {
            dp[i] += dp[i / j - 1];
            if (dp[i] >= MOD) {
                dp[i] -= MOD;
            }
        }
    }
    for (int i = 1; i <= M; i++)
        cout << dp[i] << " ";
    cout << dp[M] << endl;
}
int32_t main()
{
    fast_io;
    int T = 1;
    cin >> T;
    while (T--)
    {
        solve();
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX