結果
問題 | No.1402 ビル街 |
ユーザー |
![]() |
提出日時 | 2021-02-19 22:45:47 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 3,153 ms |
コード長 | 2,377 bytes |
コンパイル時間 | 2,006 ms |
コンパイル使用メモリ | 197,348 KB |
最終ジャッジ日時 | 2025-01-19 01:04:54 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 5 |
コンパイルメッセージ
main.cpp: In function ‘int getInt()’: main.cpp:35:25: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 35 | int getInt(){int x;scanf("%d",&x);return x;} | ~~~~~^~~~~~~~~ main.cpp: In member function ‘void Solver::solve()’: main.cpp:54:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 54 | scanf("%d",&n); | ~~~~~^~~~~~~~~
ソースコード
#include <bits/stdc++.h>#define fi first#define se second#define rep(i,n) for(int i = 0; i < (n); ++i)#define rrep(i,n) for(int i = 1; i <= (n); ++i)#define drep(i,n) for(int i = (n)-1; i >= 0; --i)#define srep(i,s,t) for (int i = s; i < t; ++i)#define rng(a) a.begin(),a.end()#define rrng(a) a.rbegin(),a.rend()#define isin(x,l,r) ((l) <= (x) && (x) < (r))#define pb push_back#define eb emplace_back#define sz(x) (int)(x).size()#define pcnt __builtin_popcountll#define uni(x) x.erase(unique(rng(x)),x.end())#define snuke srand((unsigned)clock()+(unsigned)time(NULL));#define show(x) cerr<<#x<<" = "<<x<<endl;#define PQ(T) priority_queue<T,v(T),greater<T> >#define bn(x) ((1<<x)-1)#define dup(x,y) (((x)+(y)-1)/(y))#define newline puts("")#define v(T) vector<T>#define vv(T) v(v(T))using namespace std;typedef long long int ll;typedef unsigned uint;typedef unsigned long long ull;typedef pair<int,int> P;typedef tuple<int,int,int> T;typedef vector<int> vi;typedef vector<vi> vvi;typedef vector<ll> vl;typedef vector<P> vp;typedef vector<T> vt;int getInt(){int x;scanf("%d",&x);return x;}template<typename T>istream& operator>>(istream&i,v(T)&v){rep(j,sz(v))i>>v[j];return i;}template<typename T>string join(const v(T)&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}template<typename T>ostream& operator<<(ostream&o,const v(T)&v){if(sz(v))o<<join(v);return o;}template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}template<typename T>ll suma(const v(T)&a){ll res(0);for(auto&&x:a)res+=x;return res;}const double eps = 1e-10;const ll LINF = 1001002003004005006ll;const int INF = 1001001001;#define dame { puts("-1"); return;}#define yn {puts("Yes");}else{puts("No");}const int MX = 200005;struct Solver {void solve() {int n;scanf("%d",&n);vi ans(n+2, 2e9);rrep(i,n) ans[i] = i;ans[1] = 1e9;cout<<ans<<endl;}};int main() {int ts = 1;// scanf("%d",&ts);rrep(ti,ts) {Solver solver;solver.solve();}return 0;}