結果
問題 | No.2011 Arbitrary Mod (Hidden) |
ユーザー |
👑 ![]() |
提出日時 | 2022-07-15 23:12:30 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,640 bytes |
コンパイル時間 | 3,667 ms |
コンパイル使用メモリ | 229,344 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-27 20:31:01 |
合計ジャッジ時間 | 6,763 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 43 |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int,int> #define pil pair<int,ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int,int>> #define vpll vector<pair<ll,ll>> #define vvpii vector<vector<pair<int,int>>> #define vvpll vector<vector<pair<ll,ll>>> template<typename T> void debug(T e){ cerr << e << endl; } template<typename T> void debug(vector<T> &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template<typename T> void debug(vector<vector<T>> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template<typename T> void debug(vector<pair<T, T>> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template<typename T> void debug(set<T> &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(multiset<T> &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(map<T, T> &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } ll my_pow(ll x, ll n, ll mod){ // 繰り返し二乗法.x^nをmodで割った余り. ll ret; if (n == 0){ ret = 1; } else if (n % 2 == 1){ ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod; } else{ ret = my_pow((x * x) % mod, n / 2, mod); } return ret; } int main(){ ll n; cin >> n; /*vector<bool> prime(1000005, true); prime[1] = false; repk(i, 1 ,1000005){ if (prime[i]){ for (ll j = 2; i * j <= 1000004; j++){ prime[i * j] = false; } } } set<ll> st; for (ll i = 20; i <= 5000; i++){ ll b = i * i - 398; for (ll j = 2; j * j <= b; j++){ if (b % j == 0 && prime[j]){ if (st.find(j) == st.end()){ st.insert(j); } } } } debug(st); ll num = 2LL; while(num <= 1048576){ if (prime[num + 1] && st.find(num + 1) == st.end()){ cout << num + 1 << endl; } num *= 2LL; } cout << 3 * 5 * 17 * 65537 << endl; /*ll num = 8LL; while(num <= 1048576){ ll div = -1; for (ll i = 2; i * i <= num; i++){ } if (div == -1){ cout << num << endl; break; } else{ cout << num << " " << div << endl; } num *= 2LL; }*/ //ll M = 4294967297; //cout << M << endl; //cout << 1 << endl; ll M = 16711935; cout << M << endl; cout << 1 << endl; }