結果
| 問題 | No.1281 Cigarette Distribution |
| ユーザー |
 hamamu
|
| 提出日時 | 2020-11-06 21:59:59 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 55 ms / 2,000 ms |
| コード長 | 5,149 bytes |
| コンパイル時間 | 2,068 ms |
| コンパイル使用メモリ | 198,060 KB |
| 最終ジャッジ日時 | 2025-01-15 20:39:34 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 23 |
ソースコード
·#include "bits/stdc++.h"using namespace std;using ll=long long; using dd=double;using vll=vector< ll>; using vdd=vector< dd>;using vvll=vector< vll>; using vvdd=vector<vdd>;using vvvll=vector< vvll>;using vvvvll=vector<vvvll>;using pll=pair<ll,ll>; using tll=tuple<ll,ll,ll>; using qll=tuple<ll,ll,ll,ll>;using vpll=vector< pll>; using vtll=vector< tll>; using vqll=vector< qll>;using vvpll=vector<vpll>; using vvtll=vector<vtll>; using vvqll=vector<vqll>;constexpr ll INF = 1LL << 60;struct Fast{ Fast(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(numeric_limits<double>::max_digits10); } } fast;#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)#define REP(i, N) REPS(i, 0, (N)-1)#define DEPS(i, S, E) for (ll i = (E); i >= (S); i--)#define DEP(i, N) DEPS(i, 0, (N)-1)#define rep(i, S, E) for (ll i = (S); i <= (E); i++)#define dep(i, E, S) for (ll i = (E); i >= (S); i--)#define each(e, v) for (auto&& e : v)#define ALL(v) (v).begin(), (v).end()#define RALL(v) (v).rbegin(), (v).rend()template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }template<class T> inline T MaxE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmax(m,v[i]); return m; }template<class T> inline T MinE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmin(m,v[i]); return m; }template<class T> inline T MaxE(vector<T> &v) { return MaxE(v,0,(ll)v.size()-1); }template<class T> inline T MinE(vector<T> &v) { return MinE(v,0,(ll)v.size()-1); }template<class T> inline T Sum(vector<T> &v,ll S,ll E){ T s=T(); rep(i,S,E)s+=v[i]; return s; }template<class T> inline T Sum(vector<T> &v) { return Sum(v,0,v.size()-1); }template<class T> inline ll sz(T &v){ return (ll)v.size(); }inline ll CEIL(ll a,ll b){ return (a<0) ? -(-a/b) : (a+b-1)/b; }inline ll FLOOR(ll a,ll b){ return -CEIL(-a,b); }template<ll MOD> struct mll_{ll val;mll_(ll v = 0): val(v % MOD){ if (val < 0) val += MOD; }mll_ operator - () const { return -val; }mll_ operator + (const mll_ &b) const { return val + b.val; }mll_ operator - (const mll_ &b) const { return val - b.val; }mll_ operator * (const mll_ &b) const { return val * b.val; }mll_ operator / (const mll_ &b) const { return mll_(*this) /= b; }mll_ operator + (ll b) const { return *this + mll_(b); }mll_ operator - (ll b) const { return *this - mll_(b); }mll_ operator * (ll b) const { return *this * mll_(b); }friend mll_ operator + (ll a,const mll_ &b) { return b + a; }friend mll_ operator - (ll a,const mll_ &b) { return -b + a; }friend mll_ operator * (ll a,const mll_ &b) { return b * a; }friend mll_ operator / (ll a,const mll_ &b) { return mll_(a)/b; }mll_ &operator += (const mll_ &b) { val=(val+b.val)%MOD; return *this; }mll_ &operator -= (const mll_ &b) { val=(val+MOD-b.val)%MOD; return *this; }mll_ &operator *= (const mll_ &b) { val=(val*b.val)%MOD; return *this; }mll_ &operator /= (const mll_ &b) {ll c=b.val,d=MOD,u=1,v=0;while (d){ll t = c / d;c -= t * d; swap(c,d);u -= t * v; swap(u,v);}val = val * u % MOD;if (val < 0) val += MOD;return *this;}mll_ &operator += (ll b) { return *this += mll_(b); }mll_ &operator -= (ll b) { return *this -= mll_(b); }mll_ &operator *= (ll b) { return *this *= mll_(b); }mll_ &operator /= (ll b) { return *this /= mll_(b); }bool operator == (const mll_ &b) const { return val == b.val; }bool operator != (const mll_ &b) const { return val != b.val; }bool operator == (ll b) const { return *this == mll_(b); }bool operator != (ll b) const { return *this != mll_(b); }friend bool operator == (ll a,const mll_ &b) { return mll_(a) == b.val; }friend bool operator != (ll a,const mll_ &b) { return mll_(a) != b.val; }friend ostream &operator << (ostream &os,const mll_ &a) { return os << a.val; }friend istream &operator >> (istream &is,mll_ &a) { return is >> a.val; }static mll_ Combination(ll a,ll b){chmin(b,a-b);if (b<0) return mll_(0);mll_ c = 1;rep(i,0,b-1) c *= a-i;rep(i,0,b-1) c /= i+1;return c;}};using mll = mll_<1000000007LL>;using vmll = std::vector<mll>;using vvmll = std::vector<vmll>;using vvvmll = std::vector<vvmll>;using vvvvmll = std::vector<vvvmll>;#if 0#include <atcoder/all>using namespace atcoder;#endiftemplate<class T> inline T POW(T a,ll n){ T r=1; for (; n>0; n>>=1,a*=a){ if (n&1)r*=a; } return r; }inline ll POW(int a,ll n){ return POW((ll)a,n); }void solve(){ll n,m; cin >> n >> m;vll ans;rep(x,1,m){ll p=n-(x-1);if (p<=0){ans.push_back(0);continue;}mll q=p/x;ll r=p%x;mll val=q * POW(q+2,r) * POW(q+1,x-r-1);ans.push_back(val.val);}each(e,ans) cout << e << '\n';}int main(){#if 1solve();//cin2solve();//generand();#elsell t; cin >> t;rep(i, 0, t-1){solve();//cin2solve();}#endifreturn 0;}