#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
int M;
// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);
void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }
inline char gc()
{
const static int SZ = 1 << 16;
static char buf[SZ], *p1, *p2;
if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
return -1;
return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
x = 0;
bool f = 0;
char c = gc();
while (!isdigit(c))
f ^= !(c ^ 45), c = gc();
while (isdigit(c))
x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
f && (x = -x), rd(y...);
}
template <typename T>
void prt(T x)
{
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
prt(x / 10);
putchar((x % 10) ^ 48);
}
const int N = 1e5 + 5;
char s[N], *p;
pii operator+(const pii &a, const pii &b)
{
return pii(a.F + b.F, a.S + b.S);
}
pii operator-(const pii &a, const pii &b)
{
return pii(a.F - b.F, a.S - b.S);
}
pii operator*(const pii &a, const pii &b)
{
if (!a.F)
return pii(ml(b.F, a.S), ml(b.S, a.S));
return pii(ml(a.F, b.S), ml(a.S, b.S));
}
pii gn0(), gn1();
pii gn0()
{
pii pr(0, 0), cr = gn1();
while (*p != ')' && *p)
{
char c = *p++;
if (c == '+')
pr = pr + cr, cr = gn1();
else if (c == '-')
pr = pr + cr, cr = pii(0, M - 1) * gn1();
else
{
pii tp = gn1();
cr = cr * tp;
}
}
p++;
pii tp = pr + cr;
db(tp.F, tp.S);
return pr + cr;
}
pii gn1()
{
pii res;
if (*p == '(')
p++, res = gn0();
else if (*p == 'x')
p++, res = pii(1, 0);
else
{
int fg = 1;
if (*p == '-')
fg = M - 1, p++;
while (isdigit(*p))
res.S *= 10, res.S += *p++ - '0', res.S %= M;
tml(res.S, fg);
}
return res;
}
signed main()
{
int x;
scanf("%s%d%d", p = s, &x, &M);
pii cr = gn0();
assert(cr.F);
for (int i = 0; i < M; i++)
{
if (ad(ml(cr.F, i), cr.S) == x)
{
prt(i), putchar('\n');
exit(0);
}
}
}
Compilation message
slon.cpp: In function 'int main()':
slon.cpp:178:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
178 | scanf("%s%d%d", p = s, &x, &M);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
348 KB |
Output is correct |
| 2 |
Correct |
114 ms |
616 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
3 ms |
348 KB |
Output is correct |
| 5 |
Correct |
2 ms |
344 KB |
Output is correct |
| 6 |
Correct |
9 ms |
348 KB |
Output is correct |
| 7 |
Correct |
11 ms |
472 KB |
Output is correct |
| 8 |
Correct |
32 ms |
476 KB |
Output is correct |
| 9 |
Correct |
42 ms |
536 KB |
Output is correct |
| 10 |
Correct |
79 ms |
576 KB |
Output is correct |
