็ตๆ
ๅ้ก | No.2878 ๐๐พโ๐๐๐๐โ |
ใฆใผใถใผ |
|
ๆๅบๆฅๆ | 2024-09-08 13:51:32 |
่จ่ช | C++23 (gcc 13.3.0 + boost 1.87.0) |
็ตๆ |
AC
|
ๅฎ่กๆ้ | 2 ms / 2,000 ms |
ใณใผใ้ท | 6,519 bytes |
ใณใณใใคใซๆ้ | 5,638 ms |
ใณใณใใคใซไฝฟ็จใกใขใช | 318,056 KB |
ๅฎ่กไฝฟ็จใกใขใช | 6,948 KB |
ๆ็ตใธใฃใใธๆฅๆ | 2024-09-08 13:51:38 |
ๅ่จใธใฃใใธๆ้ | 6,079 ms |
ใธใฃใใธใตใผใใผID ๏ผๅ่ๆ ๅ ฑ๏ผ |
judge1 / judge3 |
๏ผ่ฆใญใฐใคใณ๏ผ
ใใกใคใซใใฟใผใณ | ็ตๆ |
---|---|
other | AC * 8 |
ใฝใผในใณใผใ
#include <iostream>#include <string>#include <stdio.h>#include <algorithm>#include <vector>#include <tuple>#include <map>#include<set>#include<queue>#include<stack>#include <unordered_set>#include<thread>#include<bits/stdc++.h>#include <numbers>#include <atcoder/all>#include <cstdio>// #pragma GCC target("avx")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")//if(a < 0 || h <= a || b < 0 || w <= b)return;using namespace std;using namespace atcoder;using ll = long long;using ld = long double;using ull = unsigned long long;//using mint = modint998244353;using mint = modint1000000007;//using VL = vector<ll>;template<typename T> using pq = priority_queue<T>;//้้ ?(ๆๅคงๅใๅบใ)template<typename T> using pqg = priority_queue<T, vector<T>, greater<T>>;//ๆ้ ?(ๆๅฐๅใๅบใ)template<typename T> using vector2 = vector<vector<T>>;template<typename T> using vector3 = vector<vector<vector<T>>>;template<typename T> using vector4 = vector<vector<vector<vector<T>>>>;template<typename T> using vector5 = vector<vector<vector<vector<vector<T>>>>>;template<typename T> using vector6 = vector<vector<vector<vector<vector<vector<T>>>>>>;template<typename T> using pairs = pair<T,T>;#define rep(i, n) for (ll i = 0; i < ll(n); i++)#define rep1(i,n) for(int i = 1;i <= int(n);i++)#define repm(i, m, n) for (int i = (m); (i) < int(n);(i)++)#define repmr(i, m, n) for (int i = (m) - 1; (i) >= int(n);(i)--)#define rep0(i,n) for(int i = n - 1;i >= 0;i--)#define rep01(i,n) for(int i = n;i >= 1;i--)// NใฎKไนๆ นN < 2^64, K <= 64uint64_t kth_root(uint64_t N, uint64_t K) {assert(K >= 1);if (N <= 1 || K == 1) return N;if (K >= 64) return 1;if (N == uint64_t(-1)) --N;auto mul = [&](uint64_t x, uint64_t y) -> uint64_t {if (x < UINT_MAX && y < UINT_MAX) return x * y;if (x == uint64_t(-1) || y == uint64_t(-1)) return uint64_t(-1);return (x <= uint64_t(-1) / y ? x * y : uint64_t(-1));};auto power = [&](uint64_t x, uint64_t k) -> uint64_t {if (k == 0) return 1ULL;uint64_t res = 1ULL;while (k) {if (k & 1) res = mul(res, x);x = mul(x, x);k >>= 1;}return res;};uint64_t res;if (K == 2) res = sqrtl(N) - 1;else if (K == 3) res = cbrt(N) - 1;else res = pow(N, nextafter(1 / double(K), 0));while (power(res + 1, K) <= N) ++res;return res;}// ใฆใผใฏใชใใใฎไบ้คๆณใซใใๆๅคงๅ ฌ็ดๆฐ็ฎๅบll GCD(ll a,ll b){if(b == 0)return a;return GCD(b, a % b);}//ๆกๅผตใฆใผใฏใชใใใฎไบ้คๆณใซใใ(ax + by = GCD(a,b))ใๆบใใx,yใฎ็ฎๅบpair<long long, long long> extgcd(long long a, long long b) {if (b == 0) return make_pair(1, 0);long long x, y;tie(y, x) = extgcd(b, a % b);y -= a / b * x;return make_pair(x, y);}struct UnionFind {vector<int> par; // par[i]:iใฎ่ฆชใฎ็ชๅทใ(ไพ) par[3] = 2 : 3ใฎ่ฆชใ2UnionFind(int N) : par(N) { //ๆๅใฏๅ จใฆใๆ นใงใใใจใใฆๅๆๅfor(int i = 0; i < N; i++) par[i] = i;}int root(int x) { // ใใผใฟxใๅฑใใๆจใฎๆ นใๅๅธฐใงๅพใ๏ผroot(x) = {xใฎๆจใฎๆ น}if (par[x] == x) return x;return par[x] = root(par[x]);}void unite(int x, int y) { // xใจyใฎๆจใไฝตๅint rx = root(x); //xใฎๆ นใrxint ry = root(y); //yใฎๆ นใryif (rx == ry) return; //xใจyใฎๆ นใๅใ(=ๅใๆจใซใใ)ๆใฏใใฎใพใพpar[rx] = ry; //xใจyใฎๆ นใๅใใงใชใ(=ๅใๆจใซใชใ)ๆ๏ผxใฎๆ นrxใyใฎๆ นryใซใคใใ}bool same(int x, int y) { // 2ใคใฎใใผใฟx, yใๅฑใใๆจใๅใใชใtrueใ่ฟใint rx = root(x);int ry = root(y);return rx == ry;}};ll n;struct UnionFind2 {vector2<int> par; // par[i]:iใฎ่ฆชใฎ็ชๅทใ(ไพ) par[3] = 2 : 3ใฎ่ฆชใ2UnionFind2(int N) : par(N,vector<int>(N)) { //ๆๅใฏๅ จใฆใๆ นใงใใใจใใฆๅๆๅfor(int i = 0; i < N; i++)for(int j = 0;j < N;j++) par[i][j] = i * N + j;}int root(int y,int x) { // ใใผใฟxใๅฑใใๆจใฎๆ นใๅๅธฐใงๅพใ๏ผroot(x) = {xใฎๆจใฎๆ น}if (par[y][x] == y * n + x) return y * n +x;return par[y][x] = root(par[y][x] / n,par[y][x] % n);}void unite(int y0, int x0,int y1,int x1) { // xใจyใฎๆจใไฝตๅint rx = root(y0,x0); //xใฎๆ นใrxint ry = root(y1,x1); //yใฎๆ นใryif (rx == ry) return; //xใจyใฎๆ นใๅใ(=ๅใๆจใซใใ)ๆใฏใใฎใพใพpar[rx / n][rx % n] = ry; //xใจyใฎๆ นใๅใใงใชใ(=ๅใๆจใซใชใ)ๆ๏ผxใฎๆ นrxใyใฎๆ นryใซใคใใ}bool same(int y0, int x0,int y1,int x1) { // 2ใคใฎใใผใฟx, yใๅฑใใๆจใๅใใชใtrueใ่ฟใint rx = root(y0,x0);int ry = root(y1,x1);return rx == ry;}};//ๅบงๆจๅง็ธฎvector<ll> Ccomp(vector<ll> a){vector<ll> b = a;sort(b.begin(),b.end());b.erase(unique(b.begin(),b.end()),b.end());//ใใใๆถๅปvector<ll> rtn;rep(j,a.size()){ll pb = lower_bound(b.begin(),b.end(),a[j]) - b.begin();rtn.push_back(pb);}return rtn;}/// ใใใใ////////////////////////////////////////////using F = ll;using S = ll;string s;ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1;} return ret; }void cincout(){ios::sync_with_stdio(false);std::cin.tie(nullptr);cout<< fixed << setprecision(15);}//seg,้ ๅปถsegใฎ่จญๅฎ-----ใใใใS op(S a,S b){return max(a,b);}//ไฝใๆฑใใใ(ๆๅคงๅคใจใ)S e(){return -1;}//ใขใใคใ(ๅๆๅค)ll v;//bool f(ll a){return v > a;}//ใใใฉใใใค//S mapping (F a,S b){return a + b;}//้ ๅปถๅฆ็F composition (F a,F b){return a + b;}//้ ๅปถไธญใฎๆใซใใใซๅฆ็F id(){return 0;}//้ ๅปถใฎใขใใคใvector<int> Op(vector<int> a,vector<int> b){a.insert(a.end(),b.begin(),b.end()); return a;}vector<int> E(){return vector<int> (0);}//segใใใพใงstring abc = "abcdefghijklmnopqrstuvwxyz";//string abc = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";ll mod = ll(1e9) + 7;ll INF =ll(2e18);int main() {cincout();cin >> n;cout << string("IGNITION").substr(n-1,1) << endl;return 0;}