結果

問題 No.1346 Rectangle
ユーザー rniyarniya
提出日時 2021-01-16 14:40:55
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 3,790 bytes
コンパイル時間 1,764 ms
コンパイル使用メモリ 191,284 KB
最終ジャッジ日時 2025-01-17 23:13:18
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
// const long long MOD=998244353;
#define LOCAL
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(),(x).end()
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};
template<typename T>
istream &operator>>(istream &is,vector<T> &v){
for (T &x:v) is >> x;
return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
for (int i=0;i<v.size();++i){
os << v[i] << (i+1==v.size()?"": " ");
}
return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
os << '(' << p.first << ',' << p.second << ')';
return os;
}
template<typename T,typename U,typename V>
ostream&operator<<(ostream &os,const tuple<T,U,V> &t){
os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
return os;
}
template<typename T,typename U,typename V,typename W>
ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){
os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
os << '{';
for (auto itr=m.begin();itr!=m.end();){
os << '(' << itr->first << ',' << itr->second << ')';
if (++itr!=m.end()) os << ',';
}
os << '}';
return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const unordered_map<T,U> &m){
os << '{';
for (auto itr=m.begin();itr!=m.end();){
os << '(' << itr->first << ',' << itr->second << ')';
if (++itr!=m.end()) os << ',';
}
os << '}';
return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
os << '{';
for (auto itr=s.begin();itr!=s.end();){
os << *itr;
if (++itr!=s.end()) os << ',';
}
os << '}';
return os;
}
template<typename T>
ostream &operator<<(ostream &os,const multiset<T> &s){
os << '{';
for (auto itr=s.begin();itr!=s.end();){
os << *itr;
if (++itr!=s.end()) os << ',';
}
os << '}';
return os;
}
template<typename T>
ostream &operator<<(ostream &os,const unordered_set<T> &s){
os << '{';
for (auto itr=s.begin();itr!=s.end();){
os << *itr;
if (++itr!=s.end()) os << ',';
}
os << '}';
return os;
}
template<typename T>
ostream &operator<<(ostream &os,const deque<T> &v){
for (int i=0;i<v.size();++i){
os << v[i] << (i+1==v.size()?"": " ");
}
return os;
}
void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
cerr << head;
if (sizeof...(Tail)>0) cerr << ", ";
debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}
template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
if (a<b){a=b; return true;} return false;
}
#pragma endregion
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N; cin >> N;
if (N==2){
cout << "INF" << '\n';
return 0;
}
if (N<=4){
cout << 6 << '\n';
return 0;
}
if (N<=6){
cout << 4 << '\n';
return 0;
}
cout << 2 << '\n';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0