結果
問題 | No.1988 Divisor Tiling |
ユーザー |
![]() |
提出日時 | 2022-06-24 21:50:29 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 2,920 bytes |
コンパイル時間 | 4,614 ms |
コンパイル使用メモリ | 259,768 KB |
最終ジャッジ日時 | 2025-01-30 00:17:16 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 32 |
ソースコード
#include <atcoder/all> using namespace atcoder; #include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rep2(i,a,b) for (int i = (int)(a); i <= (int)(b); i++) #define all(v) v.begin(),v.end() #define inc(x,l,r) ((l)<=(x)&&(x)<(r)) #define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end()) typedef long long ll; #define int ll using ld = long double; using vi = vector<int>; using vs = vector<string>; using P = pair<int,int>; using vp = vector<P>; template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>; template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;} template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;} template<class... T> void IN(T&... a){(cin>> ... >> a);} template<class T> void OUT(T& a){cout <<a<< '\n';} template<class T,class... Ts> void OUT(const T&a, const Ts&... b){cout<< a;(cout<<...<<(cout<<' ',b));cout<<'\n';} #define INT(...) int __VA_ARGS__; IN(__VA_ARGS__) #define STR(...) string __VA_ARGS__; IN(__VA_ARGS__) #define pcnt __builtin_popcount int ceil(int x,int y){return x/y+!!(x%y);} bool ins(string s,string t){return s.find(t)!=string::npos;} P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};} P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};} ostream &operator<< (ostream &os, const P &p){os << p.first <<" "<<p.second;return os;} ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;} ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;} template<typename T> bool chmax(T &a, const T b) {if (a < b) {a = b; return true;} else return false; } template<typename T> bool chmin(T &a, const T b) {if (a > b) {a = b; return true;} else return false; } void yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;} vector<P> dxdy{{1,0},{0,1},{-1,0},{0,-1}}; int di[]={-1,0,1,0}; int dj[]={0,1,0,-1}; const int INF = 1e18; //using mint = modint1000000007; //using mint = modint998244353; vi divisor(int n){ vi ret; for(int i=1;i*i<=n;i++){ if(n%i==0){ ret.push_back(i); if(i*i!=n)ret.push_back(n/i); } } sort(all(ret)); return ret; } signed main() { cin.tie(0); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); INT(n,h); int H = min(h,n/h); int W = n/H; vector ans(H,vi(W)); auto div = divisor(n); div.pop_back(); int cu = 0; for(auto d:div){ rep(i,d){ // cout<<cu/W<<" "<<cu%W<<endl; ans[cu/W][cu%W]=d; cu++; } } if(h!=H)rep(j,W)rep(i,H)cout<<ans[i][j]<<" \n"[i==H-1]; else rep(i,H)rep(j,W)cout << ans[i][j] <<" \n"[j==W-1]; return 0; }