【Codeforces】 Hack

#include <bits/stdc++.h> #define all(x) (x).begin(), (x).end() using namespace std; typedef unsigned long long ull; typedef long long ll; typedef long double ld; typedef pair<int, int> pii; /// TODO: hack gp_hash_table /// TODO: write string & long double hacks const int SEED = 1156; //const int DEG = 172933; // C++20x64 //const int DEG = 256279; // C++11, C++14, C++17x64 const int DEG = 218971; // C++17 //const int DEG = 202409; // for reserved 2e5 //const int DEG = 410857; // for reserved 4e5 //const int DEG = 262144; // for MSVC++17 //const int DEG = 1142821; // special bonus int cur = 0; int nxt() { cur += DEG; if (cur >= int(1e9)) cur = (cur % DEG) + 3; return cur; } int comp(int a, int b) { return a % DEG == b % DEG ? a / DEG > b / DEG : a % DEG > b % DEG; } int main() { ios_base::sync_with_stdio(false); int n = 200000 - 7; mt19937 gen(SEED); int skip = uniform_int_distribution<>(1, 1000000)(gen); while (skip--) nxt(); vector<int> v; cout << 1 << "\n" << n << "\n"; for (int i = 0; v.size() < n && i < n; ++i) { int cur = nxt(); v.push_back(cur); swap(v[i], v[uniform_int_distribution<>(0, i)(gen)]); } //sort(all(v)); //reverse(all(v)); for (int i = 0; i < n; ++i) cout << (i ? " " : "") << v[i]; cout << endl; }

__EOF__

本文作者TheSky233
本文链接https://www.cnblogs.com/TheSky233/p/17118389.html
关于博主:评论和私信会在第一时间回复。或者直接私信我。
版权声明:本博客所有文章除特别声明外,均采用 BY-NC-SA 许可协议。转载请注明出处!
声援博主:如果您觉得文章对您有帮助,可以点击文章右下角推荐一下。您的鼓励是博主的最大动力!
posted @   TheSky233  阅读(64)  评论(0编辑  收藏  举报
相关博文:
阅读排行:
· 阿里最新开源QwQ-32B,效果媲美deepseek-r1满血版,部署成本又又又降低了!
· 单线程的Redis速度为什么快?
· SQL Server 2025 AI相关能力初探
· AI编程工具终极对决:字节Trae VS Cursor,谁才是开发者新宠?
· 展开说说关于C#中ORM框架的用法!
点击右上角即可分享
微信分享提示