QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#198526 | #669. Hash | kjhhjki | TL | 0ms | 0kb | C++20 | 985b | 2023-10-03 14:35:39 | 2023-10-03 14:35:40 |
Judging History
answer
#pragma GCC optimize(2)
#include <bits/stdc++.h>
typedef unsigned int ui;
ui a, b;
char s[10];
void Random()
{
s[0] = rand() % 26 + 'a';
s[1] = rand() % 26 + 'a';
s[2] = rand() % 26 + 'a';
s[3] = rand() % 26 + 'a';
s[4] = rand() % 26 + 'a';
s[5] = rand() % 26 + 'a';
s[6] = rand() % 26 + 'a';
s[7] = '\0';
}
ui Hash(const char *s)
{
ui h = 0;
for (int i = 0; i < 7; ++i)
h = (1ll * h * a + s[i] - 'a' + 1) % b;
return h;
}
int main()
{
srand(time(0));
std::cin >> a >> b;
Random(); int cnt = 0;
std::string str[2] = {s, ""};
ui Hash1 = Hash(s), Hash2;
for (;;)
{
Random(); ++cnt;
Hash2 = Hash(s);
if (Hash2 == Hash1)
{ str[1] = s; break; }
}
for (int i = 0; i < 100; ++i)
{
std::string ans;
for (int j = 0; j < 7; ++j)
ans += str[i >> j & 1];
std::cout << ans << '\n';
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Time Limit Exceeded
input:
215465827 841597626