solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long long int n, x;
cin >> x;
n = x;
vector<long long int> a(n);
for (long long int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
long long int messi = a[n / 2] - a[0];
for (long long int i = 1; i < n / 2; i++)
messi = min(messi, a[n / 2 + i] - a[i]);
cout << messi << endl;
return 0;
}
| 2,300 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int a, b = 0;
cin >> a;
int arr[a];
for (int i = 0; i < a; i++) {
cin >> arr[i];
}
for (int i = 1; i < a - 1; i++) {
if (arr[i] > arr[i - 1] & arr[i] > arr[i + 1]) {
cout << "YES" << endl;
cout << i << " " << i + 1 << " " << i + 2 << endl;
b = 1;
break;
}
}
if (b == 0) {
cout << "NO" << endl;
}
}
}
| 900 |
CPP
|
n = int(input())
cnt = 0
cnt += n//100
n = n - (n//100)*100
if n>0:
cnt += n//20
n = n - (n//20)*20
if n>0:
cnt += n//10
n = n - (n//10)*10
if n>0:
cnt += n//5
n = n - (n//5)*5
if n>0:
cnt+=n
print(cnt)
| 800 |
PYTHON3
|
from math import ceil
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
A = set(map(int, input().split()))
uniq = len(A)
if k == 1:
if uniq == 1:
print(1)
else:
print(-1)
else:
if k > uniq:
print(1)
else:
print(1 + ceil((uniq - k) / (k - 1)))
| 1,400 |
PYTHON3
|
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))
ans = []
t = ini()
for _ in range(t):
n = ini()
a = inl()
ans.append("YES" if a[0] < a[n-1] else "NO")
out(ans)
| 1,400 |
PYTHON3
|
import math
def main():
for _ in range(int(input())):
n,m,k=list(map(int,input().split()))
x=n//k
if(x>=m):
print(m)
else:
print(x-math.ceil((m-x)/(k-1)))
main()
| 1,000 |
PYTHON3
|
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using std::fixed;
using std::setprecision;
using std::setw;
int main() {
double t;
int n, s = 0, m, q, a[101];
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (a[i] > a[j]) {
q = a[i];
a[i] = a[j];
a[j] = q;
}
for (int i = 0; i < m; i++) {
if (a[i] > 0) break;
s += a[i];
}
t = s;
s = fabs(t);
cout << s << endl;
return 0;
}
| 900 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a, s = 0;
int k = n + 1;
while (n) {
n--;
cin >> a;
s = s + a;
}
int count = 0;
for (int i = 1; i <= 5; i++) {
if ((s + i) % k != 1) count++;
}
cout << count;
return 0;
}
| 1,000 |
CPP
|
#include <bits/stdc++.h>
long long dp[10000050];
int maxflag;
int n;
long long x, y;
int main() {
while (~scanf("%d%I64d%I64d", &n, &x, &y)) {
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for (int i = 1; i <= n; i++) {
if (i % 2)
dp[i] = dp[i - 1] + x > dp[(i + 1) / 2] + x + y
? dp[(i + 1) / 2] + x + y
: dp[i - 1] + x;
else
dp[i] = dp[i - 1] + x > dp[i / 2] + y ? dp[i / 2] + y : dp[i - 1] + x;
}
printf("%I64d\n", dp[n]);
}
return 0;
}
| 2,000 |
CPP
|
from math import sqrt
def nearest_square(num):
lhv=int(sqrt(num))**2
rhv=(int(sqrt(num))+1)**2
ld=num-lhv
rd=rhv-num
if rd>ld:
return lhv
else:
return rhv
number=int(input())
if number==1:
print(2)
elif number==2:
print(3)
else:
if number == int(sqrt(number))**2:
print(int(sqrt(number))*2)
elif number>nearest_square(number):
print(int(sqrt(nearest_square(number)))*2 + 1)
elif number<nearest_square(number):
print(int(sqrt(nearest_square(number)))*2)
| 1,100 |
PYTHON3
|
tc = int(input())
for t in range(tc):
n, k = map(int, input().strip().split())
ans = ""
for i in range(k):
ans += 'a'
while len(ans) < n-3:
ans += "bca"
if len(ans) == n-3:
ans += 'bca'
elif len(ans) == n-2:
ans += 'bc'
elif len(ans) == n-1:
ans += 'b'
print(ans)
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
using namespace std;
long long MOD = 1e9 + 7;
double eps = 1e-12;
long long mpow(long long a, long long b) {
if (a == 0) return 0;
if (b == 0) return 1;
long long t1 = mpow(a, b / 2);
t1 *= t1;
t1 %= MOD;
if (b % 2) t1 *= a;
t1 %= MOD;
return t1;
}
long long mpow(long long a, long long b, long long p) {
if (a == 0) return 0;
if (b == 0) return 1;
long long t1 = mpow(a, b / 2, p);
t1 *= t1;
t1 %= p;
if (b % 2) t1 *= a;
t1 %= p;
return t1;
}
long long modinverse(long long a, long long m) {
long long m0 = m;
long long y = 0, x = 1;
if (m == 1) return 0;
while (a > 1) {
long long q = a / m;
long long t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0) x += m0;
return x;
}
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
long long range(long long l, long long r) { return l + mt() % (r - l + 1); }
long long rev(long long v) { return mpow(v, MOD - 2); }
void solve() {
long long n;
cin >> n;
long long a[n];
long long sum = 0;
for (long long i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (sum == 0) {
cout << "NO" << '\n';
} else {
cout << "YES" << '\n';
for (long long i = 0; i < n; i++) {
if (a[i] * sum > 0) cout << a[i] << " ";
}
for (long long i = 0; i < n; i++) {
if (a[i] * sum < 0) cout << a[i] << " ";
}
for (long long i = 0; i < n; i++) {
if (a[i] == 0) cout << a[i] << " ";
}
cout << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
cin >> t;
for (long long i = 0; i < t; i++) {
solve();
}
return 0;
}
| 900 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
long long dp[110][2];
int n, k, d;
cin >> n >> k >> d;
memset(dp, 0, sizeof dp);
dp[0][0] = 1, dp[1][0] = 0;
for (int i = (1); i < (n + 1); i++)
for (int j = (1); j < (k + 1); j++) {
if (i - j < 0) break;
if (j < d) {
dp[i][0] = (dp[i][0] + dp[i - j][0]) % 1000000007;
dp[i][1] = (dp[i][1] + dp[i - j][1]) % 1000000007;
} else {
dp[i][1] = (dp[i][1] + dp[i - j][0]) % 1000000007;
dp[i][1] = (dp[i][1] + dp[i - j][1]) % 1000000007;
}
}
cout << dp[n][1] << endl;
return 0;
}
| 1,600 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
struct Complex {
double x, y;
Complex(double xx = 0, double yy = 0) { x = xx, y = yy; }
};
inline Complex operator+(Complex a, Complex b) {
return Complex(a.x + b.x, a.y + b.y);
}
inline Complex operator-(Complex a, Complex b) {
return Complex(a.x - b.x, a.y - b.y);
}
inline Complex operator*(Complex a, Complex b) {
return Complex(a.x * b.x - a.y * b.y, a.y * b.x + b.y * a.x);
}
inline int lowbit(int x) { return x & (-x); }
struct Edge {
int from, to, id;
double val;
bool operator<(const Edge a) const { return val < a.val; }
} e1[100010], e2[100010], e3[100010];
int n, m, k, cnt1, cnt2;
struct UF {
int fa[5010], rk[5010];
inline void clear() {
for (int i = 1; i <= n; i++) fa[i] = i, rk[i] = 0;
}
inline int get(int x) { return (fa[x] == x) ? x : fa[x] = get(fa[x]); }
inline void Union(int x, int y) {
x = get(x);
y = get(y);
if (rk[x] < rk[y]) {
fa[x] = y;
} else {
fa[y] = x;
if (rk[x] == rk[y]) rk[x]++;
}
}
} dsu;
vector<int> ans;
double l = -1e6, r = 1e6, mid;
inline int MST() {
int cnt = 0;
ans.clear();
for (int i = 1; i <= m; i++) {
e2[i] = e1[i];
if (e1[i].from == 1) e2[i].val += mid;
}
sort(e2 + 1, e2 + 1 + m);
dsu.clear();
for (int i = 1; i <= m; i++) {
int x = dsu.get(e2[i].from);
int y = dsu.get(e2[i].to);
if (x == y) continue;
if (e2[i].from == 1) cnt++;
ans.push_back(e2[i].id);
dsu.Union(x, y);
}
return cnt;
}
int main() {
scanf("%d%d%d", &n, &m, &k);
int x, y, w;
for (int i = 1; i <= m; i++) {
scanf("%d%d%d", &x, &y, &w);
if (x > y) swap(x, y);
e1[i] = (Edge){x, y, i, (double)w};
}
for (int i = 1; i <= 1000; i++) {
mid = (l + r) / 2;
x = MST();
if (x == k) break;
if (x < k)
r = mid;
else
l = mid;
}
if (x == k) {
printf("%d\n", n - 1);
for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
puts("");
} else
puts("-1");
return 0;
}
| 2,400 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int const H = 1e5 + 3;
long long fact[2 * H];
int const N = 2e3 + 3;
long long d[N];
pair<int, int> rc[N];
long long powmod(long long a, long long b, long long p) {
a %= p;
if (a == 0) return 0;
long long product = 1;
while (b > 0) {
if (b & 1) {
product *= a;
product %= p;
--b;
}
a *= a;
a %= p;
b >>= 1;
}
return product;
}
long long inv(long long a, long long p) { return powmod(a, p - 2, p); }
long long mod = 1e9 + 7;
long long nCk(long long n, long long k, long long p) {
return ((fact[n] * inv(fact[k], p) % p) * inv(fact[n - k], p)) % p;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
for (int i = (1); i < (2 * H); ++i) {
fact[i] = ((long long)i * fact[i - 1]) % mod;
}
int h, w, n;
cin >> h >> w >> n;
for (int i = (0); i < (n); ++i) {
cin >> rc[i].first >> rc[i].second;
}
sort(rc, rc + n);
rc[n] = {h, w};
for (int i = (0); i < (n + 1); ++i) {
d[i] = nCk((rc[i].first + rc[i].second - 2), rc[i].first - 1, mod);
for (int j = (0); j < (i); ++j) {
long long dx = rc[i].first - rc[j].first;
long long dy = rc[i].second - rc[j].second;
if (dy < 0) continue;
d[i] -= (d[j] * nCk(dx + dy, dx, mod)) % mod;
d[i] += mod;
d[i] %= mod;
}
}
cout << d[n] << '\n';
return 0;
}
| 2,200 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int n, c[30];
int f[30][1 << 11][30];
int S[1 << 11];
int cnt = 0, cnt2 = 0;
void dfs(int i, int dep, int j, int l) {
if (dep > n - cnt) {
for (int k = 0; k <= cnt; k++)
if (f[i - 1][j][k]) {
int dt = c[i] - 1 - S[l];
if (dt <= k && dt >= 0 && dt + __builtin_popcount(l) >= 2)
f[i][j | l][k - dt] = 1;
}
} else if (dep == i)
dfs(i, dep + 1, j | (1 << dep - 1), l);
else {
dfs(i, dep + 1, j, l);
dfs(i, dep + 1, j | (1 << dep - 1), l);
dfs(i, dep + 1, j, l | (1 << dep - 1));
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &c[i]), cnt += (c[i] == 1), cnt2 += (c[i] == 2);
if (n == 1) {
puts(cnt ? "YES" : "NO");
return 0;
}
if (cnt2 || cnt * 2 <= n) {
puts("NO");
return 0;
}
sort(c + 1, c + n + 1, greater<int>());
if (c[1] != n) {
puts("NO");
return 0;
}
for (int i = 0; i < (1 << n - cnt); i++)
for (int j = 1; j <= n - cnt; j++)
if (i & (1 << j - 1)) S[i] += c[j];
f[0][1][cnt] = 1;
for (int i = 1; i <= n - cnt; i++) dfs(i, 1, 0, 0);
puts(f[n - cnt][(1 << n - cnt) - 1][0] ? "YES" : "NO");
return 0;
}
| 2,300 |
CPP
|
import sys
n, k = [int(s) for s in input().split()]
copy_n = n
counter = 1
while 2 ** counter < n:
counter += 1
if 2 ** counter != n:
counter -= 1
n -= 2 ** counter
array = [0] * (counter + 1)
array[counter] = 1
for i in range(len(array) - 1, -1, -1):
if n >= 2 ** i:
array[i] += 1
n -= 2 ** i
#print(array)
if sum(array) > k or copy_n // k == 0:
print('NO')
sys.exit(0)
print('YES')
diff = k - sum(array)
while diff != 0:
array[counter - 1] += 2
array[counter] -= 1
if array[counter] == 0:
counter -= 1
diff -= 1
#print(array)
answer = []
for i in range(len(array)):
for j in range(array[i]):
answer.append(str(2 ** i))
print(' '.join(answer))
#print([str(2 ** i) for j in range(array[i] + 1) for i in range(len(array))])
| 1,400 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
inline bool isLow(char ch) { return (ch >= 'a' && ch <= 'z'); }
inline bool isUpp(char ch) { return (ch >= 'A' && ch <= 'Z'); }
inline bool isDig(char ch) { return (ch >= '0' && ch <= '9'); }
inline bool are_equal(double a, double b) {
return fabs(a - b) < numeric_limits<double>::epsilon();
}
inline bool less_than(double a, double b) {
return (b - a) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) *
numeric_limits<double>::epsilon());
}
inline bool greater_than(double a, double b) {
return (a - b) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) *
numeric_limits<double>::epsilon());
}
template <typename T, typename... args>
inline string arrStr(T arr, int n) {
stringstream s;
s << "[ ";
for (int i = 0; i < n - 1; i++) s << arr[i] << ", ";
s << arr[n - 1] << " ]";
return s.str();
}
inline void __evars_begin(int line) { cout << "#" << line << ": "; }
template <typename T>
inline void __evars_out_var(vector<T> val) {
cout << arrStr(val, val.size());
}
template <typename T>
inline void __evars_out_var(T *val) {
cout << arrStr(val, 10);
}
template <typename T>
inline void __evars_out_var(T val) {
cout << val;
}
inline void __evars(vector<string>::iterator it) { cout << endl; }
template <typename T, typename... Args>
inline void __evars(vector<string>::iterator it, T a, Args... args) {
cout << it->substr((*it)[0] == ' ', it->length()) << " = ";
__evars_out_var(a);
cout << "; ";
__evars(++it, args...);
}
inline vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c)) v.emplace_back(x);
return move(v);
}
void in(int &n, int a[]) {
cin >> n;
for (__typeof(n - 1) i = (0); i <= (n - 1); i++) cin >> a[i];
}
void in(int &n, vector<int> &a) {
cin >> n;
a.resize(n);
for (__typeof(n - 1) i = (0); i <= (n - 1); i++) cin >> a[i];
}
void out(int n, int a[]) {
for (__typeof(n - 1) i = (0); i <= (n - 1); i++)
cout << a[i] << " \n"[i + 1 == n];
}
void out(vector<int> &a) {
for (__typeof(a.size() - 1) i = (0); i <= (a.size() - 1); i++)
cout << a[i] << " \n"[i + 1 == a.size()];
}
template <typename T = long long>
T multiply(T a, T b, T mod) {
T res = 0;
a %= mod;
b %= mod;
while (b) {
if (b & 0x1) res = (res + a) % mod;
b >>= 1;
if (a < mod - a)
a <<= 1;
else
a -= (mod - a);
}
return res;
}
template <typename T = long long>
T power(T val, T p, T mod) {
val %= mod;
T res = 1;
while (p > 0) {
if (p & 0x1) res = (res * val) % mod;
val = (val * val) % mod;
p >>= 1;
}
return res;
}
template <typename T = long long>
T power(T val, T p) {
T res = 1;
while (p > 0) {
if (p & 0x1) res = (res * val);
val = (val * val);
p >>= 1;
}
return res;
}
template <typename T = long long>
T powerMul(T val, T p, T mod) {
val %= mod;
T res = 1;
while (p > 0) {
if (p & 0x1) res = multiply(res, val, mod);
val = multiply(val, val, mod);
p >>= 1;
}
return res;
}
template <typename T>
T gcd(T a, T b) {
return b == 0 ? a : gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template <typename T>
string toString(T x) {
stringstream ss;
ss << x;
return ss.str();
}
template <typename T>
T stringToT(string s) {
T p;
istringstream ss(s);
ss >> p;
return p;
}
template <typename T>
T SOD(T n) {
__typeof(n) sum = 0, i = 1;
for (; i * i <= n; i++)
sum += (n % i) ? 0 : ((((i) * (i)) == n) ? i : i + n / i);
return sum;
}
const int fx[] = {+1, -1, +0, +0};
const int fy[] = {+0, +0, +1, -1};
const int fx8[] = {+0, +0, +1, -1, -1, +1, -1, +1};
const int fy8[] = {-1, +1, +0, +0, +1, +1, -1, -1};
const int kx[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int ky[] = {-1, 1, -2, 2, -2, 2, -1, 1};
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
const int mod = 1e9 + 7;
const int mx = 2 * 100001;
vector<int> pos;
int n, k;
string s[8], t[8];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
for (__typeof(n - 1) i = (0); i <= (n - 1); i++) cin >> s[i];
int ans = INT_MAX;
pos.resize(k);
iota(pos.begin(), pos.end(), 0);
do {
for (int i = 0; i < n; i++) {
t[i] = string(k, '#');
for (int j = 0; j < k; j++) {
t[i][pos[j]] = s[i][j];
}
}
vector<int> values;
for (int i = 0; i < n; i++) values.push_back(stringToT<int>(t[i]));
sort(values.begin(), values.end());
ans = min(ans, values.back() - values[0]);
} while (next_permutation(pos.begin(), pos.end()));
cout << ans << '\n';
return 0;
}
| 1,400 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int MAXV = 7e3 + 5;
int N, Q;
bitset<MAXV> mult[MAXN];
bitset<MAXV> divs[MAXV], inv[MAXV];
void init() {
for (int i = MAXV - 1; i; i--) {
inv[i].set(i);
divs[i].set(i);
for (int j = 2 * i; j < MAXV; j += i) {
inv[i] ^= inv[j];
divs[j].set(i);
}
}
}
int main() {
init();
scanf("%d%d", &N, &Q);
while (Q--) {
int t, x, y, z;
scanf("%d%d%d", &t, &x, &y);
if (t == 1)
mult[x] = divs[y];
else if (t == 4)
printf("%d", (mult[x] & inv[y]).count() & 1);
else {
scanf("%d", &z);
mult[x] = t == 2 ? mult[y] ^ mult[z] : mult[y] & mult[z];
}
}
puts("");
return 0;
}
| 2,500 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > v;
long long n;
long double pot[200], ipot[200];
long double GCD[200000];
long long gcd(long long a, long long b) {
if (a < 0) a = -a;
if (b < 0) b = -b;
if (b == 0) return a;
return gcd(b, a % b);
}
long double Area(long long a, long long b) {
long double res = 0;
for (long long i = (a + 1) % n; i != b; i = (i + 1) % n) {
long long next = (i + 1) % n;
res += abs((v[next].first - v[a].first) * (v[i].second - v[a].second) -
(v[i].first - v[a].first) * (v[next].second - v[a].second));
}
return res * 0.5;
}
inline int MOD(int a, int b) { return (a >= b ? a - b : a); }
long double Perimeter(long long a, long long b) {
long double res = gcd(v[b].first - v[a].first, v[b].second - v[a].second);
for (long long i = a; i != b; i = (i + 1) % n) {
res += gcd(v[(i + 1) % n].first - v[i].first,
v[(i + 1) % n].second - v[i].second);
}
return res;
}
long double prob(int n, int j) {
return (1 - (n - j - 1 < 200 ? ipot[n - j - 1] : 0)) /
(pot[j + 1] + (n - j - 1 < 200
? (-1 - n - n * (n - 1) / 2.) * ipot[n - j - 1]
: 0));
}
long double IntegerPolls(long long a, long long b) {
return Area(a, b) + 1. - Perimeter(a, b) / 2.;
}
long double eleva(long long a, long long b) {
if (b == 0) return 1;
long double aux = eleva(a, b / 2);
aux *= aux;
if ((b & 1) != 0) aux *= a;
return aux;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
v = vector<pair<long long, long long> >(n);
for (long long i = 0; i < n; i++) cin >> v[i].first >> v[i].second;
long double res = Area(0, 0) + 1;
for (long long i = 0; i < n; i++) {
GCD[i] = gcd(v[MOD(i + 1, n)].first - v[i].first,
v[MOD(i + 1, n)].second - v[i].second);
res -= 0.5 * GCD[i];
}
pot[0] = 1.;
ipot[0] = 1.;
for (long long i = 1; i <= 199; i++) {
pot[i] = pot[i - 1] * 2.;
ipot[i] = 1. / pot[i];
}
for (long long i = 0; i < n; i++) {
if (n <= 2) continue;
long double area = 0;
long double perimetre = 0.;
long long next = MOD(i + 1, n);
long long again = MOD(next + 1, n);
area += 0.5 *
abs((v[next].first - v[i].first) * (v[again].second - v[i].second) -
(v[again].first - v[i].first) * (v[next].second - v[i].second));
perimetre += GCD[i];
perimetre += GCD[next];
perimetre -=
gcd(v[again].first - v[i].first, v[again].second - v[i].second);
res -= prob(n, 2) * (area - 0.5 * perimetre);
long double last =
gcd(v[again].first - v[i].first, v[again].second - v[i].second);
for (int j = 3; j <= min(n - 1, 80LL); ++j) {
int act = MOD(i + j, n);
int ant = MOD(i + j - 1, n);
area += 0.5 *
abs((v[act].first - v[i].first) * (v[ant].second - v[i].second) -
(v[ant].first - v[i].first) * (v[act].second - v[i].second));
perimetre += GCD[ant];
perimetre += last;
last = gcd(v[act].first - v[i].first, v[act].second - v[i].second);
perimetre -= last;
res -= prob(n, j) * (area - 0.5 * perimetre);
}
}
cout.precision(10);
cout << fixed << res << endl;
}
| 2,800 |
CPP
|
'''
Auther: ghoshashis545 Ashis Ghosh
College: jalpaiguri Govt Enggineerin College
Date:24/05/2020
'''
import sys
from collections import deque,defaultdict as dd
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]
def read():
tc=0
if tc:
input=sys.stdin.readline
else:
sys.stdin=open('input1.txt', 'r')
sys.stdout=open('output1.txt','w')
def solve():
for _ in range(ii()):
a,b=mi()
x=min(a,b)*2
y=max(x,max(a,b))
print(y*y)
if __name__ =="__main__":
# read()
solve()
| 800 |
PYTHON3
|
from collections import defaultdict
M = 998244353
n,k = map(int,input().split())
List = [int(x) for x in input().split()]
Dict = defaultdict(int)
for i in range(n):
Dict[List[i]]= i+1
Ans = 1
Sorted = []
for i in range(k):
Sorted.append((Dict[n-i],n-i))
Sorted.sort()
Sum = Sorted[0][1]
for i in range(1,k):
Ans*=Sorted[i][0]-Sorted[i-1][0]
Sum+=Sorted[i][1]
Ans%=M
print(Sum,Ans)
| 1,300 |
PYTHON3
|
n=int(input())
arr=[]
for _ in range(n):
arr.append(list(map(int,input().split())))
c=0
for i in range(n-1):
for j in range(i+1,n):
if(arr[i][0]==arr[j][1] and arr[i][1]==arr[j][0]):
c+=2
elif(arr[i][0]!=arr[j][1] and arr[i][1]==arr[j][0]):
c+=1
elif(arr[i][0]==arr[j][1] and arr[i][1]!=arr[j][0]):
c+=1
print(c)
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long a = n, b = m;
while (1) {
if (a <= 0 || b <= 0) break;
if (a >= 2 * b) {
a %= 2 * b;
continue;
}
if (b >= 2 * a) {
b %= 2 * a;
continue;
}
break;
}
cout << a << " " << b << endl;
}
| 1,100 |
CPP
|
import math
x=int(input());
print(math.ceil(x/5));
| 800 |
PYTHON3
|
n = int(input(""))
words = []
for i in range(n):
words.append(input(""))
for word in words:
if len(word) > 10:
abbr = word[0] + str(len(word)-2) + word[len(word)-1]
else:
abbr = word
print(abbr)
| 800 |
PYTHON3
|
n = int(input())
sum = 0;
while n > 0:
lis = list(map(int, input().strip().split()))
count = 0
for item in lis:
count += item
if count >= 2:
sum += 1
n -= 1
print(sum)
| 800 |
PYTHON3
|
import sys
t = int(sys.stdin.readline())
for _ in range(t):
table = dict()
n, k = map(int, sys.stdin.readline().split())
s = list(sys.stdin.readline().strip())
temp = 0
for i in range(n):
if s[i] == '1':
temp = k
else:
if temp > 0:
table[i] = 1
temp -= 1
temp = 0
for i in range(n-1, -1, -1):
if s[i] == '1':
temp = k
else:
if temp > 0:
table[i] = 1
temp -= 1
res = 0
lock1 = -1
for i in range(n):
if i <= lock1:
continue
if i in table:
continue
if s[i] == '0':
s[i] = '1'
res += 1
lock1 = i + k
elif s[i] == '1':
lock1 = i + k
# print(s)
print(res)
| 1,300 |
PYTHON3
|
par,pen,note=[int(par) for par in input().split()]
if par<=pen and par <= note:
print("Yes")
else:
print("No")
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
const int st = 1000, base = 11000, en = 21000, mod = 1e9 + 7;
long long ans, dp[2][22010];
int n, x;
int main() {
scanf("%d", &n);
for (int i = 0; n--; i ^= 1) {
scanf("%d", &x);
for (int j = st; j <= en; j++)
dp[i][j] = (dp[!i][j - x] + dp[!i][j + x]) % mod;
dp[i][base + x]++;
dp[i][base - x]++;
ans = (ans + dp[i][base]) % mod;
}
return printf("%I64d\n", ans), 0;
}
| 2,300 |
CPP
|
def union(u,v,parent):
x = find(u,parent)
y = find(v,parent)
if x==y:
return
parent[x]=y
def find(u,parent):
k = parent[u]
while k != parent[k]:
k = parent[k]
while parent[u] != k:
u, parent[u] = parent[u], k
return k
n,m,q = map(int,input().split())
p = [i for i in range(2*n)]
d = {}
s = input().split()
for i in range(n):
d[s[i]]=i
for i in range(m):
re,node1,node2 = input().split()
a1 = find(d[node1],p)
a2 = find(d[node1]+n,p)
b1 = find(d[node2],p)
b2 = find(d[node2]+n,p)
if re=='1':
if a1==b2 or a2==b1:
print('NO')
else:
print('YES')
union(d[node1],d[node2],p)
union(d[node1]+n,d[node2]+n,p)
elif re=='2':
if a1==b1 or a2==b2:
print('NO')
else:
print('YES')
union(d[node1],d[node2]+n,p)
union(d[node1]+n,d[node2],p)
for i in range(q):
node1,node2= input().split()
a1 = find(d[node1],p)
a2 = find(d[node1]+n,p)
b1 = find(d[node2],p)
b2 = find(d[node2]+n,p)
if a1==b1 or a2==b2:
print(1)
elif a1==b2 or b1==a2:
print(2)
else:
print(3)
| 2,000 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
long long next() {
long long x;
cin >> x;
return x;
}
const long long inf = 1e18, eps = 1e9 + 7, nmax = 2 * 1e5 + 4;
int main() {
long long n = next(), v = next(), i = 1, ans = 0;
if (v > n) v = n;
ans = (n + 1 - v) * (n - v) / 2;
ans += v - 1;
cout << ans;
return 0;
}
| 900 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int md = 1000000007;
inline void add(int &x, int v) {
x += v;
if (x >= md) x -= md;
if (x < 0) x += md;
}
const int Sz = 2000006;
char s[Sz];
int dp[Sz], c[255], apr[255];
int main() {
int i, j, n, m, k;
scanf("%d%d", &n, &k);
scanf("%s", s + 1);
m = strlen(s + 1);
dp[0] = 1;
for (i = 1; i <= m; ++i) {
dp[i] = dp[i - 1];
add(dp[i], dp[i - 1]);
if (apr[s[i]]) add(dp[i], -c[s[i]]);
apr[s[i]] = i;
add(c[s[i]], dp[i] - dp[i - 1]);
}
int nw = m + 1;
for (i = 1; i <= n; ++i) {
dp[nw] = dp[nw - 1];
add(dp[nw], dp[nw - 1]);
int mn = nw, id = -1;
for (j = 0; j < k; ++j) {
if (apr['a' + j] < mn) {
mn = apr['a' + j];
id = 'a' + j;
}
}
if (mn) add(dp[nw], -c[id]);
add(c[id], dp[nw] - dp[nw - 1]);
apr[id] = nw;
++nw;
}
cout << dp[nw - 1];
}
| 2,200 |
CPP
|
n, m, k = map(int, input().split())
if n%k:n = (n - n%k) + k
if m%k:m = (m - m%k) + k
print((n//k)*(m//k))
| 1,000 |
PYTHON3
|
s= input()
a= input()
x= a.find(s[0])
y= a.find(s[1])
if x!=-1:
print ('YES')
elif y!=-1:
print ('YES')
else:
print ('NO')
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
template <class T>
T gcd(T a, T b) {
return ((b == 0) ? a : gcd(b, a % b));
}
int n, m;
int cntN = 0, cntM = 0;
bool good(string a, string b) {
string s = a + b;
sort(s.begin(), s.end());
for (int i = (int)(1); i < (int)(s.size()); i++)
if (s[i] == s[i - 1]) return 0;
int n2 = 0, m2 = 0;
int powN = 1, powM = 1;
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
for (int i = 0; i < (int)(a.size()); i++)
n2 += powN * (a[i] - '0'), powN *= 7;
for (int i = 0; i < (int)(b.size()); i++)
m2 += powM * (b[i] - '0'), powM *= 7;
if (n2 <= n && m2 <= m) return 1;
return 0;
}
int from7(string a) {
int n2 = 0, powN = 1;
for (int i = 0; i < (int)(a.size()); i++)
n2 += powN * (a[i] - '0'), powN *= 7;
return n2;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
n--, m--;
string pos = "0123456";
int n1 = n, m1 = m;
while (n1) cntN++, n1 /= 7;
while (m1) cntM++, m1 /= 7;
cntN = max(cntN, 1);
cntM = max(cntM, 1);
int ans = 0;
map<string, int> vis;
do {
if ((cntN + cntM) <= pos.size()) {
string a = pos.substr(0, cntN);
string b = pos.substr(cntN, cntM);
if (vis[a + b]) goto skip;
vis[a + b] = 1;
if (good(a, b)) {
ans++;
}
}
skip:;
if ((cntN + cntM - 1) <= pos.size()) {
string a = "0" + pos.substr(0, cntN - 1);
string b = pos.substr(cntN - 1, cntM);
if (vis[a + b]) goto skip1;
vis[a + b] = 1;
if (good(a, b)) {
ans++;
}
a = pos.substr(0, cntN);
b = "0" + pos.substr(cntN, cntM - 1);
if (vis[a + b]) goto skip1;
vis[a + b] = 1;
if (good(a, b)) {
ans++;
}
}
skip1:;
} while (next_permutation(pos.begin(), pos.end()));
cout << ans << endl;
return 0;
}
| 1,700 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int max_n = 1000 * 100 + 10;
vector<pair<int, int> > v[max_n];
pair<int, int> h[max_n];
int d[max_n], s, e, go[max_n];
bool mark[max_n], check[max_n];
bool cmp(pair<int, int> a, pair<int, int> b) {
return h[go[a.first]] > h[go[b.first]];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
v[x].push_back(pair<int, int>(y, i));
v[y].push_back(pair<int, int>(x, i));
}
if (m & 1) {
cout << "No solution" << '\n';
return 0;
}
d[e++] = 0;
mark[0] = true;
while (e - s) {
int u = d[s++];
for (auto i : v[u])
if (!mark[i.first]) {
d[e++] = i.first;
h[i.first].first = h[u].first + 1;
h[i.first].second = i.first;
mark[i.first] = true;
}
}
sort(h, h + n, greater<pair<int, int> >());
for (int i = 0; i < n; i++) go[h[i].second] = i;
for (int i = 0; i < n; i++) {
int u = h[i].second;
sort(v[u].begin(), v[u].end(), cmp);
int k = 0;
for (int j = 0; j < (int)v[u].size(); j++) {
if (check[v[u][j].second]) continue;
if (k <= j) k = j + 1;
while (k < (int)v[u].size() && check[v[u][k].second]) k++;
if (k == (int)v[u].size()) break;
cout << v[u][j].first + 1 << ' ' << u + 1 << ' ' << v[u][k].first + 1
<< '\n';
check[v[u][k].second] = true;
check[v[u][j].second] = true;
}
}
}
| 2,300 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
printf("%d\n", n / 2 + 1);
return 0;
}
| 800 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, h[100002], v[100002], hl = 0, vl = 0, x, y;
long long int ans;
cin >> n;
cin >> m;
ans = (long long int)n * n;
for (i = 0; i <= n; i++) {
h[i] = 0;
v[i] = 0;
}
for (i = 0; i < m; i++) {
cin >> x;
cin >> y;
if (ans) {
if (!h[x] && !v[y]) {
hl++;
vl++;
h[x] = 1;
v[y] = 1;
ans = ans - 2 * n - 1 + hl + vl;
} else if (!h[x] && v[y]) {
hl++;
h[x] = 1;
ans = ans - n + vl;
} else if (h[x] && !v[y]) {
vl++;
v[y] = 1;
ans = ans - n + hl;
}
}
cout << ans << " ";
}
cout << endl;
return 0;
}
| 1,200 |
CPP
|
f = input()
x=f[0].upper()
res= x+f[1:]
print(res)
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int p[200010], b[300010];
int eu[300010], ev[300010];
int qt[500010], qx[500010];
int par[200010];
int find(int x) { return par[x] < 0 ? x : (par[x] = find(par[x])); }
vector<int> qd[500010];
set<pair<int, int> > s[200010];
int ch[500010][2];
void unite(int x, int y, int tm = -1) {
x = find(x);
y = find(y);
if (x == y) return;
if (par[x] > par[y]) swap(x, y);
if (tm >= 0) {
for (set<pair<int, int> >::iterator it = s[y].begin(); it != s[y].end();
it++) {
qd[tm].push_back(it->second);
}
ch[tm][0] = x;
ch[tm][1] = y;
}
par[x] += par[y];
par[y] = x;
s[x].insert(s[y].begin(), s[y].end());
s[y].clear();
}
int main() {
int n, m, q;
scanf("%d%d%d", &n, &m, &q);
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d%d", &eu[i], &ev[i]);
--eu[i], --ev[i];
}
for (int i = 0; i < q; i++) {
scanf("%d%d", &qt[i], &qx[i]);
--qx[i];
if (qt[i] == 2) b[qx[i]] = 1;
}
for (int i = 0; i < n; i++) {
par[i] = -1;
s[i].insert(make_pair(-p[i], i));
}
for (int i = 0; i < m; i++) {
if (!b[i]) {
unite(eu[i], ev[i]);
}
}
for (int i = q - 1; i >= 0; i--) {
if (qt[i] == 2) {
ch[i][0] = -1;
unite(eu[qx[i]], ev[qx[i]], i);
}
}
for (int i = 0; i < q; i++) {
if (qt[i] == 2) {
if (ch[i][0] != -1) {
int x = ch[i][0], y = ch[i][1];
for (int j = 0; j < qd[i].size(); j++) {
int k = qd[i][j];
s[x].erase(make_pair(-p[k], k));
s[y].insert(make_pair(-p[k], k));
par[k] = y;
}
par[y] = -1;
}
} else {
int k = find(qx[i]);
int x = s[k].begin()->first, j = s[k].begin()->second;
printf("%d\n", -x);
s[k].erase(s[k].begin());
p[j] = 0;
s[k].insert(make_pair(0, j));
}
}
return 0;
}
| 2,600 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
vector<long long int> a(26, 0);
long long int n, x, y, j, ans = 0, i;
cin >> n;
while (n--) {
string s;
cin >> s;
a[s[0] - 'a']++;
}
for (i = 0; i < 26; i++) {
x = (long long int)ceil((double)a[i] / 2.0);
y = (long long int)floor((double)a[i] / 2.0);
ans += (x * (x - 1)) / (2);
ans += (y * (y - 1)) / (2);
}
cout << ans;
}
| 900 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char s[100010];
int a[3];
int t, flag, n, p;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
t = (t + s[i]) % 3;
a[s[i] % 3]++;
}
if (!t) {
puts(s + 1);
return 0;
}
for (p = 2; s[p] == '0'; p++)
;
p -= 2;
if (a[t] && n > 1 && (p <= 1 || a[t] > 1 || s[1] % 3 != t))
a[t]--;
else if (a[3 - t] > 1 && n > 2)
a[3 - t] -= 2;
else if (a[t] && n > 1)
a[t]--;
else {
printf("-1\n");
return 0;
}
for (int i = 1; i <= n; i++) {
if (s[i] == '0' && !flag) continue;
if (a[s[i] % 3]) putchar(s[i]), a[s[i] % 3]--, flag = 1;
}
if (!flag) puts("0");
}
| 2,000 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
long long n, ans1 = 0, ans2 = 0;
string s;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n >> s;
for (long long i = 0; i < n; i++) {
ans1 += ((s[i] - '0') != (i & 1));
ans2 += ((s[i] - '0') == (i & 1));
}
cout << min(ans1, ans2);
return 0;
}
| 1,800 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 1;
int n, sz, a[N];
int p[N], V[N], E[N];
int f[N], s[N];
int lead(int x) { return p[x] == x ? x : p[x] = lead(p[x]); }
void uni(int x, int y) {
x = lead(x);
y = lead(y);
E[x]++;
if (x == y) return;
if (V[x] < V[y]) swap(x, y);
E[x] += E[y];
V[x] += V[y];
p[y] = x;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> f[i] >> s[i];
a[sz++] = f[i];
a[sz++] = s[i];
}
sort(a, a + sz);
sz = unique(a, a + sz) - a;
for (int i = 0; i < sz; ++i) {
p[i] = i;
V[i] = 1;
E[i] = 0;
}
for (int i = 1; i <= n; ++i)
uni(lower_bound(a, a + sz, f[i]) - a, lower_bound(a, a + sz, s[i]) - a);
for (int i = 0; i < sz; ++i) {
if (E[i] > V[i]) return 0 * puts("-1");
f[i] = i;
}
int ans = 0;
for (int i = 0; i < sz; ++i) {
int j = lead(i);
f[j] = max(f[j], i);
}
for (int i = 0; i < sz; ++i) {
if (V[lead(i)] == 1) continue;
if (V[lead(i)] == E[lead(i)])
ans = max(ans, f[lead(i)]);
else if (f[lead(i)] != i)
ans = max(ans, i);
}
cout << a[ans] << endl;
}
| 2,400 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char grid[51][51];
bool solve() {
int N;
scanf("%d", &N);
for (int Ni = 0; Ni < N; Ni++) scanf("%s", grid[Ni]);
int mnx = N - 1, mxx = 0;
int mny = N - 1, mxy = 0;
bool OK = false;
for (int Ni = 0; Ni < N; Ni++)
for (int Nj = 0; Nj < N; Nj++)
if (grid[Ni][Nj] - '0') {
OK = true;
mnx = min(mnx, Ni), mxx = max(mxx, Ni);
mny = min(mny, Nj), mxy = max(mxy, Nj);
}
if (!OK) return false;
for (int Ni = mnx; Ni <= mxx; Ni++)
for (int Nj = mny; Nj <= mxy; Nj++) {
int num = 4;
if (Ni == mnx || Ni == mxx) num /= 2;
if (Nj == mny || Nj == mxy) num /= 2;
if (num != grid[Ni][Nj] - '0') return false;
}
return OK;
}
int main() {
if (solve())
puts("Yes");
else
puts("No");
}
| 1,700 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
while (n--) {
long long total, sum = 0, r = 1;
scanf("%lld", &total);
while (total) {
if (r % 2) {
if ((total % 2 == 0 && (total / 2) % 2 == 1) || (total == 4)) {
sum += total / 2;
total /= 2;
} else {
sum++;
total--;
}
} else {
if ((total % 2 == 0 && (total / 2) % 2 == 1) || (total == 4))
total /= 2;
else
total--;
}
r++;
}
printf("%lld\n", sum);
}
return 0;
}
| 1,400 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
long long Mod = 1e9 + 7;
int poww(int a, int b, int mod) {
int res = 1;
if (b < 0) b = (b % (mod - 1) + mod - 1) % (mod - 1);
for (; b; b >>= 1, a = 1ll * a * a % mod)
if (b & 1) res = 1ll * res * a % mod;
return res;
}
void Max(long long& x, long long y) { x = max(x, y); }
void Min(long long& x, long long y) { x = min(x, y); }
long long n, q, x;
set<long long> s[400400];
long long Cnt[400400], j;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> q >> x;
for (int i = 0; i < x; i++) s[0].insert(i);
while (q--) {
long long a;
cin >> a;
a %= x;
s[Cnt[a]].erase(a);
Cnt[a]++;
s[Cnt[a]].insert(a);
while (s[j].empty()) j++;
long long pos = (*s[j].begin());
long long Ans = j * x + pos;
cout << Ans << '\n';
}
return 0;
}
| 1,600 |
CPP
|
for t_ in range(int(input())):
n, x = [*map(int, input().split())]
a = [*map(int, input().split())]
a.sort()
s = sum(a)
res = 0
for i, e in enumerate(a):
res = n - i
if s / res >= x:
break
else:
s -= e
if res == 1:
res = 0
print(res)
| 1,100 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 62;
long long powmod(long long a, long long b) {
long long res = 1;
a %= 1000000007;
for (; b; b >>= 1) {
if (b & 1) res = res * a % 1000000007;
a = a * a % 1000000007;
}
return res;
}
template <typename T>
inline bool chkmin(T &a, const T &b) {
return a > b ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
return a < b ? a = b, 1 : 0;
}
int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int pos[600100];
namespace FFT {
struct comp {
double r, i;
comp(double _r = 0, double _i = 0) : r(_r), i(_i) {}
comp operator+(const comp &x) { return comp(r + x.r, i + x.i); }
comp operator-(const comp &x) { return comp(r - x.r, i - x.i); }
comp operator*(const comp &x) {
return comp(r * x.r - i * x.i, i * x.r + r * x.i);
}
comp conj() { return comp(r, -i); }
} A[600100], B[600100];
const double pi = acos(-1.0);
void FFT(comp a[], int n, int t) {
for (int i = 1; i < n; ++i)
if (pos[i] > i) swap(a[i], a[pos[i]]);
for (int d = 0; (1 << d) < n; ++d) {
int m = 1 << d, m2 = m << 1;
double o = pi * 2 / m2 * t;
comp _w(cos(o), sin(o));
for (int i = 0; i < n; i += m2) {
comp w(1, 0);
for (int j = 0; j < m; ++j) {
comp &A = a[i + j + m], &B = a[i + j], t = w * A;
A = B - t;
B = B + t;
w = w * _w;
}
}
}
if (t == -1)
for (int i = 0; i < n; ++i) a[i].r /= n;
}
void mul(int *a, int *b, int *c, int k) {
int i, j;
for (i = 0; i < k; ++i) A[i] = comp(a[i], b[i]);
j = __builtin_ctz(k) - 1;
for (int i = 0; i < k; ++i) {
pos[i] = pos[i >> 1] >> 1 | ((i & 1) << j);
}
FFT(A, k, 1);
for (int i = 0; i < k; ++i) {
j = (k - i) & (k - 1);
B[i] = (A[i] * A[i] - (A[j] * A[j]).conj()) * comp(0, -0.25);
}
FFT(B, k, -1);
for (int i = 0; i < k; ++i) {
if (B[i].r >= 0)
c[i] = (int)(B[i].r + 0.5);
else
c[i] = (int)(B[i].r - 0.5);
}
}
} // namespace FFT
int belong[201000];
int r[450], l[450];
short x[450][201000];
char a[201000], b[201000];
int x1[201000 << 1], x2[201000 << 1], x3[201000 << 1];
int main() {
scanf("%s %s", a, b);
int m = read();
int tot = 0, n = strlen(a), nn = strlen(b);
int blo = pow(n, 2.0 / 3);
for (int i = 0; i < n; i++) {
int rr = i;
++tot;
l[tot] = i;
while (rr < n && rr - i <= blo) {
belong[rr] = tot;
rr++;
}
r[tot] = rr - 1;
i = rr - 1;
}
for (int i = 1; i <= tot; i++) {
int ii = r[i] - l[i] + 1;
int len = 1;
while (len <= nn) len *= 2;
for (int j = 0; j < len; j++) {
if (l[i] + j <= r[i]) {
if (a[l[i] + j] == '1')
x1[j] = 1;
else
x1[j] = -1;
} else
x1[j] = 0;
if (j < nn) {
if (b[nn - j - 1] == '1')
x2[j] = 1;
else
x2[j] = -1;
} else
x2[j] = 0;
}
FFT::mul(x1, x2, x3, len);
for (int j = ii - 1; j < nn; j++) {
x[i][j] = (ii - x3[j]) / 2;
}
}
for (int i = 0; i < m; i++) {
int s1 = read(), s2 = read(), len = read();
int ans = 0;
int ll = belong[s1];
int rr = belong[s1 + len - 1];
if (ll + 1 >= rr) {
for (int j = s1; j < s1 + len; j++)
if (a[j] != b[j - s1 + s2]) ans++;
} else {
for (int j = s1; j <= r[ll]; j++)
if (a[j] != b[j - s1 + s2]) ans++;
for (int j = ll + 1; j < rr; j++) {
ans += x[j][nn - (l[j] - s1 + s2) - 1];
}
for (int j = l[rr]; j < s1 + len; j++)
if (a[j] != b[j - s1 + s2]) ans++;
}
printf("%d\n", ans);
}
return 0;
}
| 2,800 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int arr[n];
for (int i = 0; i < n; i++) scanf("%d", arr + i);
vector<int> fac;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (i > 2) fac.push_back(i);
if ((n / i) != i && (n / i) > 2) fac.push_back(n / i);
}
}
int maxi = INT_MIN;
for (vector<int>::iterator it = fac.begin(); it != fac.end(); it++) {
int i = *it;
int cnt = i;
for (int k = 0; k < n / i; k++) {
int j = k;
int tmp = 0;
while (cnt--) {
tmp += arr[j];
j = (j + (n / i)) % n;
}
if (tmp > maxi) maxi = tmp;
cnt = i;
}
}
printf("%d", maxi);
return 0;
}
| 1,300 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 100;
const long long INF = 1e9 + 1;
const long long MOD = 998244353;
const long double EPS = 1e-12;
const long double PI = acos(-1);
const unsigned long long PRIME = 31;
void bye() {
cout << "\n";
exit(0);
}
struct Coord {
int x, y;
};
struct Cube {
Coord v;
int id;
};
struct Swap {
Coord f, t;
};
vector<Swap> LP, RP;
vector<Cube> all, now, need;
vector<vector<int> > g;
bool cmp(int a, int b) { return now[a].v.x < now[b].v.x; }
int XX[] = {0, 0, 1, -1};
int YY[] = {1, -1, 0, 0};
void swapCube(Cube &kek, int dir, int f) {
Cube old = kek;
if (!f) {
LP.push_back({kek.v, {kek.v.x + XX[dir], kek.v.y + YY[dir]}});
} else if (f == 1) {
RP.push_back({{kek.v.x + XX[dir], kek.v.y + YY[dir]}, kek.v});
}
kek.v.x += XX[dir];
kek.v.y += YY[dir];
if (f <= 1) {
swap(g[old.v.x][old.v.y], g[kek.v.x][kek.v.y]);
}
}
bool check(Coord v, int dir) {
v.x += XX[dir];
v.y += YY[dir];
return !g[v.x][v.y];
}
void go(int id, Coord to, int f) {
while (now[id].v.x > to.x) {
swapCube(now[id], 3, f);
}
while (now[id].v.x < to.x) {
swapCube(now[id], 2, f);
}
while (now[id].v.y > to.y) {
swapCube(now[id], 1, f);
}
while (now[id].v.y < to.y) {
swapCube(now[id], 0, f);
}
}
bool can_go(Cube tmp, Coord to) {
while (tmp.v.x > to.x && check(tmp.v, 3)) {
swapCube(tmp, 3, 2);
}
while (tmp.v.x < to.x && check(tmp.v, 2)) {
swapCube(tmp, 2, 2);
}
while (tmp.v.y > to.y && check(tmp.v, 1)) {
swapCube(tmp, 1, 2);
}
while (tmp.v.y < to.y && check(tmp.v, 0)) {
swapCube(tmp, 0, 2);
}
if (tmp.v.x == to.x && tmp.v.y == to.y) {
return 1;
}
return 0;
}
void init() {
for (auto v : now) {
g[v.v.x][v.v.y] = v.id + 1;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
g.resize(n, vector<int>(n));
for (int i = 0; i < m; i++) {
Cube tmp;
cin >> tmp.v.x >> tmp.v.y;
tmp.v.x--;
tmp.v.y--;
tmp.id = i;
all.push_back(tmp);
now.push_back(tmp);
}
for (int i = 0; i < m; i++) {
Cube tmp;
cin >> tmp.v.x >> tmp.v.y;
tmp.v.x--;
tmp.v.y--;
tmp.id = i;
need.push_back(tmp);
}
init();
vector<int> ord(m);
for (int i = 0; i < m; i++) {
ord[i] = i;
}
sort((ord).begin(), ord.end(), cmp);
for (int cnt = 0; cnt < n; cnt++) {
for (int i = 0; i < m; i++) {
if (can_go(now[ord[i]], {i, now[ord[i]].v.y})) {
go(now[ord[i]].id, {i, now[ord[i]].v.y}, 0);
}
}
}
for (int cnt = 0; cnt < n; cnt++) {
for (int i = 0; i < m; i++) {
if (can_go(now[i], {now[i].v.x, i})) {
go(i, {now[i].v.x, i}, 0);
}
}
}
for (int cnt = 0; cnt < n; cnt++) {
for (int i = 0; i < m; i++) {
if (can_go(now[i], {i, i})) {
go(i, {i, i}, 0);
}
}
}
for (int i = 0; i < m; i++) {
ord[i] = i;
}
for (int i = 0; i < n; i++) {
fill((g[i]).begin(), g[i].end(), 0);
}
now = need;
init();
sort((ord).begin(), ord.end(), cmp);
for (int cnt = 0; cnt < n; cnt++) {
for (int i = 0; i < m; i++) {
if (can_go(now[ord[i]], {i, now[ord[i]].v.y})) {
go(now[ord[i]].id, {i, now[ord[i]].v.y}, 1);
}
}
}
for (int cnt = 0; cnt < n; cnt++) {
for (int i = 0; i < m; i++) {
if (can_go(now[i], {now[i].v.x, i})) {
go(i, {now[i].v.x, i}, 1);
}
}
}
for (int cnt = 0; cnt < n; cnt++) {
for (int i = 0; i < m; i++) {
if (can_go(now[i], {i, i})) {
go(i, {i, i}, 1);
}
}
}
cout << (long long)(LP).size() + (long long)(RP).size() << "\n";
for (int i = 0; i < (long long)(LP).size(); i++) {
cout << LP[i].f.x + 1 << " " << LP[i].f.y + 1 << " " << LP[i].t.x + 1 << " "
<< LP[i].t.y + 1 << "\n";
}
for (int i = (long long)(RP).size() - 1; i >= 0; i--) {
cout << RP[i].f.x + 1 << " " << RP[i].f.y + 1 << " " << RP[i].t.x + 1 << " "
<< RP[i].t.y + 1 << "\n";
}
bye();
}
| 2,700 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int x, y, count = 0;
cin >> x >> y;
if (y % x != 0) count++;
cout << count + y / x;
return 0;
}
| 1,000 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
string Map[8];
bool F[8][8][8], Visited[8][8][8];
bool Check(int Time, int X, int Y) {
if (X < 0 || X >= 8 || Y < 0 || Y >= 8) return false;
if (X >= Time && Map[X - Time][Y] == 'S') return false;
if (X > Time && Map[X - Time - 1][Y] == 'S') return false;
return true;
}
bool DFS(int Time, int X, int Y) {
if (Time >= 8) return true;
if (Visited[Time][X][Y]) return F[Time][X][Y];
Visited[Time][X][Y] = F[Time][X][Y] = true;
if (Check(Time, X - 1, Y - 1) && DFS(Time + 1, X - 1, Y - 1)) return true;
if (Check(Time, X - 1, Y) && DFS(Time + 1, X - 1, Y)) return true;
if (Check(Time, X - 1, Y + 1) && DFS(Time + 1, X - 1, Y + 1)) return true;
if (Check(Time, X, Y - 1) && DFS(Time + 1, X, Y - 1)) return true;
if (Check(Time, X, Y) && DFS(Time + 1, X, Y)) return true;
if (Check(Time, X, Y + 1) && DFS(Time + 1, X, Y + 1)) return true;
if (Check(Time, X + 1, Y - 1) && DFS(Time + 1, X + 1, Y - 1)) return true;
if (Check(Time, X + 1, Y) && DFS(Time + 1, X + 1, Y)) return true;
if (Check(Time, X + 1, Y + 1) && DFS(Time + 1, X + 1, Y + 1)) return true;
return F[Time][X][Y] = false;
}
int main() {
for (int i = 0; i < 8; i++) cin >> Map[i];
memset(Visited, 0, sizeof(Visited));
cout << (DFS(0, 7, 0) ? "WIN" : "LOSE") << endl;
return 0;
}
| 1,500 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
struct ScoreRecord {
string name = "";
long long score = 0;
long long time = 0;
vector<long long> scoreHistory{};
};
struct ScoreRecorder {
const string GetWinnerName() {
string winnerName = "";
int minTime = 100000;
for (const auto& record : records) {
if (record.score > maxScore) {
maxScore = record.score;
}
}
for (int i = 0; i < playerNames.size(); ++i) {
ScoreRecord& record = GetScoreRecord(playerNames[i]);
if (record.score == maxScore) {
if (scores[i] >= maxScore) {
return record.name;
}
}
}
return winnerName;
}
ScoreRecord& GetScoreRecord(const string& playerName) {
for (auto& record : records) {
if (record.name == playerName) {
return record;
}
}
ScoreRecord newRecord{};
newRecord.name = playerName;
records.push_back(newRecord);
return records.back();
}
long long maxScore = -10 ^ 11;
vector<ScoreRecord> records;
vector<string> playerNames;
vector<long long> scores;
};
int main() {
int n;
cin >> n;
ScoreRecorder recorder{};
while (n--) {
string name;
long long score;
cin >> name >> score;
recorder.playerNames.push_back(name);
ScoreRecord& record = recorder.GetScoreRecord(name);
record.score += score;
record.scoreHistory.push_back(record.score);
recorder.scores.push_back(record.score);
}
cout << recorder.GetWinnerName();
}
| 1,500 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const int MAXX = 200000;
int i, j, akt, n;
vector<pair<int, int> > vec[MAXX + 5];
long long tab[MAXX + 5];
pair<int, int> r;
int main() {
for (i = 1; i < MAXX; i++)
for (j = i + 1; j * 1LL * j - i * 1LL * i <= MAXX; j++)
vec[j * j - i * i].push_back(pair<int, int>(i, j));
scanf("%d", &n);
for (i = 1; i < n; i += 2) scanf("%lld", &tab[i]);
akt = 0;
for (i = 1; i < n; i += 2) {
r = pair<int, int>(-1, -1);
for (auto& w : vec[tab[i]])
if (w.first > akt && (r.first == -1 || w.second < r.second)) r = w;
if (r.first == -1) {
printf("No\n");
return 0;
}
tab[i - 1] = r.first * 1LL * r.first - akt * 1LL * akt;
akt = r.second;
}
printf("Yes\n");
for (i = 0; i < n; i++) printf("%lld ", tab[i]);
printf("\n");
return 0;
}
| 1,900 |
CPP
|
x=list(input())
minx=[]
for i in range(0,len(x)):
minx.append('9' if i==0 and x[0]=='9' else min(x[i], str(9-int(x[i]))))
print("".join(minx))
| 1,200 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
long long int n, f, k[100007], l[100007];
vector<pair<long long int, int> > mat;
int main() {
cin >> n >> f;
for (int i = 0; i < n; i++) {
cin >> k[i] >> l[i];
long long int before = min(k[i], l[i]);
long long int after = min(2 * k[i], l[i]);
mat.push_back(make_pair(after - before, i));
}
sort(mat.begin(), mat.end());
int index = n - 1;
long long int flag = 0;
while (flag < f) {
k[mat[index].second] *= 2;
index--;
flag++;
}
long long int ans = 0;
for (int i = 0; i < n; i++) {
ans += (min(k[i], l[i]));
}
cout << ans << endl;
return 0;
}
| 1,300 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int id, val;
friend bool operator<(const node &a, const node &b) { return a.val < b.val; }
} temp[210000];
struct node2 {
int x, y;
} vis[200010];
int main() {
int n, s;
scanf("%d%d", &n, &s);
priority_queue<node> que;
int f = 0;
if (s % 2 != 0) s = 1;
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
if (temp > n - 1) f = 1;
node t;
t.val = temp;
t.id = i + 1;
if (temp <= 0) continue;
que.push(t);
}
if (f) {
puts("No");
return 0;
}
int cnt = 0;
while (!que.empty()) {
node et = que.top();
que.pop();
if (que.size() < et.val) {
f = 1;
break;
}
for (int i = 0; i < et.val; i++) {
node te = que.top();
que.pop();
te.val--;
temp[i].id = te.id;
temp[i].val = te.val;
vis[cnt].x = et.id;
vis[cnt++].y = te.id;
}
if (f) break;
for (int i = 0; i < et.val; i++) {
if (temp[i].val > 0) que.push(temp[i]);
}
}
if (f) {
puts("No");
return 0;
}
printf("Yes\n%d\n", cnt);
for (int i = 0; i < cnt; i++) {
printf("%d %d\n", vis[i].x, vis[i].y);
}
return 0;
}
| 2,200 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int arr[100005];
int main() {
memset(arr, 0, sizeof(arr));
int first = -1;
bool first_flag = false;
int n, m, temp, sum = 0;
int countOn = 0;
char ch;
scanf("%d %d%*c", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%c %d%*c", &ch, &temp);
if (i == 0) {
first = temp;
first_flag = true;
}
if (ch == '+') {
if (temp != first && arr[first] == -1) first_flag = false;
arr[temp] = 1;
countOn++;
} else {
if (arr[temp] == 1) countOn--;
if (temp != first && arr[temp] == 0) {
first = temp;
first_flag = true;
}
if (temp == first && countOn > 0) first_flag = false;
arr[temp] = -1;
}
}
if (first_flag) arr[first] = 0;
for (int i = 1; i <= n; i++) {
if (arr[i] == 0) sum++;
}
cout << sum << endl;
for (int i = 1; i <= n; i++) {
if (arr[i] == 0) cout << i << " ";
}
return 0;
}
| 1,800 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int inf_int = 2e9;
long long inf_ll = 2e18;
const double pi = 3.1415926535898;
template <typename T, typename T1>
void prin(vector<pair<T, T1> >& a) {
for (int i = 0; i < a.size(); i++) {
cout << a[i].first << " " << a[i].second << "\n";
}
}
template <typename T>
void prin(vector<T>& a) {
for (int i = 0; i < a.size(); i++) {
cout << a[i];
if (i < a.size() - 1)
cout << " ";
else
cout << "\n";
}
}
template <typename T>
void prin(set<T>& a) {
for (auto it = a.begin(); it != a.end(); it++) {
cout << *it << " ";
}
}
template <typename T>
void prin_new_line(vector<T>& a) {
for (int i = 0; i < a.size(); i++) {
cout << a[i] << "\n";
}
}
template <typename T, typename T1>
void prin_new_line(vector<pair<T, T1> >& a) {
for (int i = 0; i < a.size(); i++) {
cout << a[i].first << " " << a[i].second << "\n";
}
}
int sum_vec(vector<int>& a) {
int s = 0;
for (int i = 0; i < a.size(); i++) {
s += a[i];
}
return s;
}
template <typename T>
T max(vector<T>& a) {
T ans = a[0];
for (int i = 1; i < a.size(); i++) {
ans = max(ans, a[i]);
}
return ans;
}
template <typename T>
T min(vector<T>& a) {
T ans = a[0];
for (int i = 1; i < a.size(); i++) {
ans = min(ans, a[i]);
}
return ans;
}
template <typename T>
T min(T a, T b, T c) {
return min(a, min(b, c));
}
template <typename T>
T max(T a, T b, T c) {
return max(a, max(b, c));
}
long double s_triangle(long double x1, long double y1, long double x2,
long double y2, long double x3, long double y3) {
return abs(((x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1)) / 2);
}
bool overflow(long long a, long long b) {
if (a * b / b != a) return true;
return false;
}
bool debug = 0;
const int maxn = 2e5 + 200;
long long mod = 1e9 + 7;
long long mxlen[1100][1100];
int dp[1100][1100][15];
void solve() {
int n, m, k;
cin >> n >> m >> k;
string a, b;
cin >> a >> b;
a = "#" + a;
b = "!" + b;
for (int i = 1; i <= n; i++) {
for (int e = 1; e <= m; e++) {
if (a[i] == b[e]) {
mxlen[i][e] = mxlen[i - 1][e - 1] + 1;
} else {
mxlen[i][e] = 0;
}
}
}
for (int i = 0; i <= n; i++) {
for (int e = 0; e <= m; e++) {
for (int f = 1; f <= k; f++) {
dp[i][e][f] = -inf_int;
}
}
}
for (int f = 1; f <= k; f++)
for (int i = 1; i <= n; i++) {
for (int e = 1; e <= m; e++) {
int len = mxlen[i][e];
if (len) {
dp[i][e][f] = max(dp[i - 1][e][f], dp[i][e - 1][f],
dp[i - len][e - len][f - 1] + len);
for (int g = 1; g < len && g < 5; g++) {
dp[i][e][f] = max(dp[i - g][e - g][f - 1] + g, dp[i][e][f]);
}
} else {
dp[i][e][f] = max(dp[i - 1][e][f], dp[i][e - 1][f]);
}
}
}
cout << dp[n][m][k];
}
int main() {
if (!debug) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int t = 1;
while (t--) solve();
return 0;
}
| 1,900 |
CPP
|
from math import sqrt
n=int(input())
for i in range(n):
a,b=map(int,input().split())
c,d=map(int,input().split())
k=sqrt(c*d+a*b)
if k==int(k):
if max(c,d)==max(a,b):
print("Yes")
else:
print("No")
else:
print("No")
| 900 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int n, m, tot, S, T, an;
char c[405];
int s[405];
int g[205][205][205], flag[205][205], si[205];
int id1[205], id2[205];
struct mxr {
int a, b;
int t[405][405];
} mb, ans;
int adt(int a, int b) {
if (a + b >= 10007) return a + b - 10007;
return a + b;
}
mxr operator*(mxr A, mxr B) {
mxr C;
memset(C.t, 0, sizeof C.t);
C.a = A.a;
C.b = B.b;
if (C.a != C.b) {
for (int i = 1; i <= C.a; i++)
for (int j = 1; j <= C.b; j++)
for (int k = 1; k <= A.b; k++)
C.t[i][j] = adt(C.t[i][j], (long long)A.t[i][k] * B.t[k][j] % 10007);
} else {
for (int i = 1; i <= C.a; i++)
for (int j = i; j <= C.b; j++)
for (int k = i; k <= j; k++)
C.t[i][j] = adt(C.t[i][j], (long long)A.t[i][k] * B.t[k][j] % 10007);
}
return C;
}
void work(int x, int y, int v) {
memset(mb.t, 0, sizeof mb.t);
memset(ans.t, 0, sizeof ans.t);
int mx1 = 0, mx2 = 0;
tot = 0;
S = ++tot;
for (int i = 0; i <= n; i++)
if (si[i] != 0) mx1 = max(mx1, i), mx2 = max(mx2, (n - i + 1) / 2);
for (int i = 1; i <= mx1; i++) id1[i] = ++tot;
for (int i = mx2; i >= 1; i--) id2[i] = ++tot;
T = ++tot;
mb.a = mb.b = tot;
for (int i = 1; i < mx1; i++) mb.t[id1[i]][id1[i + 1]] = 1;
for (int i = mx2; i > 1; i--) mb.t[id2[i]][id2[i - 1]] = 1;
if (mx1 != 0) mb.t[S][id1[1]] = 1;
if (mx2 != 0) mb.t[id2[1]][T] = 1;
for (int i = 1; i <= mx1; i++) mb.t[id1[i]][id1[i]] = 24;
for (int i = 1; i <= mx2; i++) mb.t[id2[i]][id2[i]] = 25;
id1[0] = S;
id2[0] = T;
for (int i = 0; i <= n; i++) {
if (si[i] == 0) continue;
mb.t[id1[i]][id2[(n - i + 1) / 2]] = si[i];
}
mb.t[T][T] = 26;
if (v == -1) mb.t[T][T] = 0;
ans.a = 1;
ans.b = tot;
for (int i = 1; i <= tot; i++) ans.t[1][i] = 0;
ans.t[1][S] = 1;
while (y != 0) {
if (y & 1) ans = ans * mb;
mb = mb * mb;
y = (y >> 1);
}
an = (an + (long long)v * ans.t[1][T] % 10007 + 10007) % 10007;
}
int main() {
scanf("%s", c + 1);
n = strlen(c + 1);
scanf("%d", &m);
for (int i = 1; i <= n; i++) s[i] = c[i] - 'a' + 1;
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++) {
if (s[i] == s[j])
flag[i][j] = 0;
else
flag[i][j] = 1;
}
g[1][n][flag[1][n]] = 1;
for (int len = n; len >= 1; len--)
for (int i = 1; i <= n; i++) {
int j = i + len - 1;
if (j > n) break;
for (int k = 0; k <= n; k++) {
if (flag[i][j] == 0) {
g[i + 1][j - 1][k + flag[i + 1][j - 1]] =
adt(g[i + 1][j - 1][k + flag[i + 1][j - 1]], g[i][j][k]);
} else {
g[i + 1][j][k + flag[i + 1][j]] =
adt(g[i + 1][j][k + flag[i + 1][j]], g[i][j][k]);
g[i][j - 1][k + flag[i][j - 1]] =
adt(g[i][j - 1][k + flag[i][j - 1]], g[i][j][k]);
}
}
}
memset(si, 0, sizeof si);
for (int i = 1; i <= n; i++) {
if (flag[i][i] == 0) {
for (int j = 0; j <= n; j++) si[j] = (si[j] + g[i][i][j]) % 10007;
}
if (i != n && flag[i][i + 1] == 0) {
for (int j = 0; j <= n; j++) si[j] = (si[j] + g[i][i + 1][j]) % 10007;
}
}
work(0, (n + m + 1) / 2 + 1, 1);
if ((n + m) % 2 == 1 && n != 1) {
memset(si, 0, sizeof si);
for (int i = 1; i < n; i++) {
if (flag[i][i + 1] == 0) {
for (int j = 0; j <= n; j++) si[j] = (si[j] + g[i][i + 1][j]) % 10007;
}
}
work(-1, (n + m + 1) / 2 + 1, -1);
}
printf("%d\n", an);
return 0;
}
| 3,000 |
CPP
|
n, k = map(int, input().split())
A = list(map(int, input().split()))
tot = 2 * (n - 1) + n
s = set()
for i in A:
s.add((i, i))
if (i - 1, i - 1) in s:
s.add((i - 1, i))
if (i + 1, i + 1) in s:
s.add((i + 1, i))
print(tot - len(s))
| 1,500 |
PYTHON3
|
w = 0
n, h = map(int, input().split())
f = [int(x) for x in input().split()]
for i in range(n):
if (f[i] > h):
w += 2
else:
w += 1
print(w)
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const int nn = 1100;
const double eps = 1e-17;
struct pp {
double x, y, X, Y;
};
int n, top;
double h, f;
pp p[nn], q[nn], qq[nn];
bool cmp(pp x, pp y) { return x.x < y.x || x.x == y.x && x.y < y.y; }
void merge() {
sort(p + 1, p + 1 + n, cmp);
int cnt = 0;
double x = -10000, y = -10000;
for (int i = 1; i <= n; ++i) {
if (p[i].x > y) {
if (x > -10000) p[++cnt].x = x, p[cnt].y = y;
x = p[i].x;
y = p[i].y;
} else
y = max(y, p[i].y);
}
if (x > -10000) p[++cnt].x = x, p[cnt].y = y;
n = cnt;
}
double calc(double x) { return (double)x * (h + f) / (f - h); }
void init() {
scanf("%d%lf%lf", &n, &h, &f);
for (int i = 1; i <= n; ++i) scanf("%lf%lf", &p[i].x, &p[i].y);
merge();
for (int i = 1; i <= n; ++i) p[i].X = calc(p[i].x), p[i].Y = calc(p[i].y);
}
void add(double x, double y, int &top) {
q[++top].x = x;
q[top].y = y;
}
void Add(pp x, pp y, double k, double b, int &top) {
double u = (x.y - k * x.x - b) * 1.0 / (k * y.x + b - y.y);
add((x.x + u * y.x) / (1 + u), (x.y + u * y.y) / (1 + u), top);
}
void cut(double k, double b, double opt) {
q[0] = q[top];
q[top + 1] = q[1];
for (int i = 0; i <= top + 1; ++i) qq[i] = q[i];
int t1 = 0;
for (int i = 1; i <= top; ++i) {
if ((qq[i].y - (k * qq[i].x + b)) * opt >= 0)
q[++t1] = qq[i];
else {
if ((qq[i - 1].y - (k * qq[i - 1].x + b)) * opt >= 0) {
Add(qq[i - 1], qq[i], k, b, t1);
}
if ((qq[i + 1].y - (k * qq[i + 1].x + b)) * opt >= 0) {
Add(qq[i + 1], qq[i], k, b, t1);
}
}
}
top = t1;
}
double abss(double x) {
if (x < 0) x = -x;
return x;
}
double calc(pp x, pp y, pp z) {
return abss((x.x - z.x) * (y.y - z.y) - (x.y - z.y) * (y.x - z.x)) / 2.0;
}
double getsum() {
double res = 0;
for (int i = 3; i <= top; ++i) res += calc(q[1], q[i - 1], q[i]);
return res;
}
void work() {
double ans = 0;
for (int i = 1; i <= n; ++i)
ans += (double)(p[i].Y - p[i].X + p[i].y - p[i].x) * h * 2;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
top = 0;
add(p[i].x, h, top);
add(p[i].y, h, top);
add(p[i].Y, -h, top);
add(p[i].X, -h, top);
cut(2.0 * h / (p[j].X - p[j].x + eps),
h - 2.0 * h / (p[j].X - p[j].x + eps) * p[j].X,
2.0 * h / (p[j].X - p[j].x + eps) < 0 ? 1 : -1);
cut(2.0 * h / (p[j].Y - p[j].y + eps),
h - 2.0 * h / (p[j].Y - p[j].y + eps) * p[j].Y,
2.0 * h / (p[j].Y - p[j].y + eps) < 0 ? -1 : 1);
ans -= getsum();
}
}
printf("%.9f\n", ans);
}
int main() {
init();
work();
return 0;
}
| 2,600 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
struct figure {
int t, c;
bool operator<(const figure& x) const { return c < x.c; }
};
figure a[101];
long long p[101];
int main(void) {
int n, m;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d %d", &a[i].t, &a[i].c);
scanf("%d", &m);
for (int i = 1; i <= m; ++i) scanf("%I64d", &p[i]);
sort(a + 1, a + n + 1);
long long ans = 0, s = 0;
int f = 1;
for (int i = 1; i <= n; ++i) {
while ((f <= m) && (a[i].t > 0) && (s + a[i].t >= p[f])) {
ans += (p[f] - s) * f * a[i].c;
a[i].t -= int(p[f] - s);
s = p[f];
++f;
}
if (a[i].t > 0) {
ans += a[i].t * ((long long)f) * a[i].c;
s += a[i].t;
}
}
printf("%I64d\n", ans);
return 0;
}
| 1,600 |
CPP
|
def f(s):
if len(s) % 2 == 1:
return s
s1 = f(s[:int(len(s)/2)])
s2 = f(s[int(len(s)/2):])
if s1 < s2:
return s1 + s2
else:
return s2 + s1
if __name__ == "__main__":
a = input()
b = input()
print("YES" if f(a) == f(b) else "NO")
| 1,700 |
PYTHON3
|
from sys import stdin, stdout
n, m, k = map(int, stdin.readline().split())
t = list(map(int, stdin.readline().split()))
p = [tuple(map(int, stdin.readline().split())) for i in range(m)]
r, s = [0] * (m + 1), [0] * (n + 1)
R, S = 0, 0
for i in range(k):
x, y = map(int, stdin.readline().split())
r[x - 1] += 1
r[y] -= 1
for i, (x, y, d) in enumerate(p):
R += r[i]
d = d * R
s[x - 1] += d
s[y] -= d
for i in range(n):
S += s[i]
t[i] = str(t[i] + S)
stdout.write(' '.join(map(str, t)))
| 1,400 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > Gr;
vector<bool> used;
vector<int> dfrom1;
vector<int> number;
vector<vector<int> > Trees;
vector<vector<int> > Paths;
int maxdepth = 0;
void dfs(int s, int depth, int path) {
used[s] = true;
dfrom1[s] = depth;
int cnt = 0;
for (int i = 0; i < Gr[s].size(); ++i) {
if (!used[Gr[s][i]]) {
Paths[cnt + path].push_back(Gr[s][i]);
number[Gr[s][i]] = cnt + path;
dfs(Gr[s][i], depth + 1, path + cnt);
++cnt;
}
}
maxdepth = max(depth, maxdepth);
}
void initnewtree(int number, int size) { Trees[number].resize(4 * size + 1); }
void increasetree(int number, int ver, int l, int r, int L, int R, int value) {
if (l > r) return;
if (L == l && R == r) {
Trees[number][ver] += value;
} else {
int M = (L + R) >> 1;
increasetree(number, ver * 2, l, min(r, M), L, M, value);
increasetree(number, ver * 2 + 1, max(M + 1, l), r, M + 1, R, value);
}
}
int getit(int number, int ver, int l, int L, int R) {
int res = 0;
while (L != R) {
res += Trees[number][ver];
int m = (L + R) >> 1;
if (l <= m) {
ver <<= 1;
R = m;
} else {
ver <<= 1;
++ver;
L = m + 1;
}
}
return res + Trees[number][ver];
}
int main() {
int n, q;
scanf("%d%d", &n, &q);
Gr.resize(n + 1);
Paths.resize(n + 1);
number.resize(n + 1);
used.resize(n + 1, false);
dfrom1.resize(n + 1);
Trees.resize(n + 1);
for (int i = 0; i < n - 1; ++i) {
int a, b;
scanf("%d%d", &a, &b);
Gr[a].push_back(b);
Gr[b].push_back(a);
}
dfs(1, 0, 1);
Gr.clear();
Trees[0].resize(4 * (maxdepth + 1) + 1);
for (int i = 1; i <= n; ++i) initnewtree(i, Paths[i].size());
for (int i = 0; i < q; ++i) {
int t, v;
scanf("%d%d", &t, &v);
if (t == 0) {
int x, d;
scanf("%d%d", &x, &d);
int Depth = dfrom1[v];
if (v == 1)
increasetree(0, 1, 0, min(maxdepth, d), 0, maxdepth, x);
else {
if (Depth <= d) {
increasetree(0, 1, 0, min(maxdepth, d - Depth), 0, maxdepth, x);
int l = d - Depth + 1;
int r = min((int)Paths[number[v]].size(), Depth + d);
if (l <= r) {
increasetree(number[v], 1, l, r, 1, Paths[number[v]].size(), x);
}
} else {
int l = max(1, Depth - d);
int r = min((int)Paths[number[v]].size(), Depth + d);
increasetree(number[v], 1, l, r, 1, Paths[number[v]].size(), x);
}
}
} else {
if (v == 1)
printf("%d\n", getit(0, 1, 0, 0, maxdepth));
else
printf("%d\n",
getit(0, 1, dfrom1[v], 0, maxdepth) +
getit(number[v], 1, dfrom1[v], 1, Paths[number[v]].size()));
}
}
return 0;
}
| 2,100 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char str[10];
int e() {
int up = 0, dn = 0;
for (int i = 0; i < 8; i++) {
switch (str[i]) {
case 'Q':
up += 9;
break;
case 'R':
up += 5;
break;
case 'B':
up += 3;
break;
case 'N':
up += 3;
break;
case 'P':
up += 1;
break;
case 'q':
dn += 9;
break;
case 'r':
dn += 5;
break;
case 'b':
dn += 3;
break;
case 'n':
dn += 3;
break;
case 'p':
dn += 1;
break;
}
}
return up - dn;
}
int main() {
while (gets(str)) {
int ans = 0;
ans += e();
for (int i = 2; i <= 8; i++) {
gets(str);
ans += e();
}
if (!ans) {
printf("Draw\n");
} else if (ans > 0) {
printf("White\n");
} else {
printf("Black\n");
}
}
return 0;
}
| 900 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int sz = 2005;
char s[sz][sz];
int n, m, cyc[sz][sz], vis[sz][sz], dp[sz][sz], ci, cj;
int go(int i, int j, int k) {
if (vis[i][j] > 0) {
ci = i, cj = j;
return k - vis[i][j];
}
if (vis[i][j] < 0) return 0;
vis[i][j] = k;
int &w = cyc[i][j], x = i, y = j;
char ch = s[i][j];
if (ch == 'L')
j--;
else if (ch == 'R')
j++;
else if (ch == 'D')
i++;
else
i--;
if (i < 0 or i >= n or j < 0 or j >= m) {
vis[x][y] = -1;
return 0;
}
int v = go(i, j, k + 1);
if (ci >= 0) w = v;
if (ci == x and cj == y) ci = cj = -1;
vis[x][y] = -1;
return v;
}
int dfs(int i, int j) {
if (i < 0 or i >= n or j < 0 or j >= m) return 0;
int &w = dp[i][j];
if (w) return w;
if (cyc[i][j]) return w = cyc[i][j];
char ch = s[i][j];
if (ch == 'L')
j--;
else if (ch == 'R')
j++;
else if (ch == 'D')
i++;
else
i--;
return w = 1 + dfs(i, j);
}
void solve() {
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) scanf("%s", s[i]);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cyc[i][j] = vis[i][j] = dp[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (vis[i][j]) continue;
ci = cj = -1, go(i, j, 1);
}
}
tuple<int, int, int> ans = {0, 1, 1};
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (cyc[i][j])
ans = max(ans, {cyc[i][j], i, j});
else
ans = max(ans, {dfs(i, j), i, j});
}
}
printf("%d %d %d\n", get<1>(ans) + 1, get<2>(ans) + 1, get<0>(ans));
}
int main() {
int t;
cin >> t;
while (t--) solve();
}
| 2,300 |
CPP
|
t = int(input())
answers = []
for _ in range(t):
n, k = [int(i) for i in input().split()]
k = k-1
ans = (k//(n-1))*n + 1 + (k%(n-1))
answers.append(ans)
print(*answers, sep = '\n')
| 1,200 |
PYTHON3
|
num=int(input())
s=input()
a=0
for i in range(len(s)-1):
if(s[i]==s[i+1]):
a+=1
elif len(s)==1:
a=0
print(a)
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, f;
int mi = 1, ma = 100;
scanf("%d%d", &n, &m);
while (m--) {
scanf("%d%d", &k, &f);
if (f > 1) ma = min(ma, (k - 1) / (f - 1));
mi = max(mi, (k + f - 1) / f);
}
if ((n + mi - 1) / mi != (n + ma - 1) / ma)
puts("-1");
else
printf("%d\n", (n + mi - 1) / mi);
return 0;
}
| 1,500 |
CPP
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:66777216")
using namespace std;
const double eps = 1e-9;
const int CCC = 55;
const double pi = acos(-1.0);
const long long INF = (long long)2e9 + 1;
const long long LINF = (long long)8e18;
const long long inf = (long long)2e9 + 1;
const long long linf = (long long)8e18;
const long long MM = (long long)1e9 + 7;
int solve();
void gen();
int main() {
solve();
return 0;
}
double dp[5007][5007];
int solve() {
int n, T, t;
cin >> n >> T;
dp[0][0] = 1;
double ans = 0;
for (int i = 0; i < (int)n; i++) {
double p;
cin >> p >> t;
p /= 100;
double pw = pow(1 - p, t - 1), cur = 0;
for (int j = 1; j <= T; j++) {
cur *= 1 - p;
cur += dp[i][j - 1] * p;
if (j >= t) cur -= dp[i][j - t] * p * pw;
dp[i + 1][j] = cur;
if (j >= t) dp[i + 1][j] += dp[i][j - t] * pw;
ans += dp[i + 1][j];
}
}
printf("%.10f", ans);
return 0;
}
| 2,400 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
int *heights = new int[n];
int *answers = new int[n];
for (int i = 0; i < n; ++i) {
cin >> heights[i];
}
int max = 0;
for (int i = n - 1; i >= 0; --i) {
int diff = max - heights[i] + 1;
if (diff < 0) diff = 0;
answers[i] = diff;
if (heights[i] > max) {
swap(heights[i], max);
}
}
for (int i = 0; i < n; ++i) {
cout << answers[i] << " ";
}
return 0;
}
| 1,100 |
CPP
|
n = int(input())
str = list(input())
dict = {}
if len(str) == 1:
print('Yes')
exit(0)
for i in range(0, 26):
dict[(chr(i+97))] = 0
for character in str:
dict[character] += 1
if dict[character] > 1:
print("Yes")
exit(0)
print("No")
| 900 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
char ch = getchar();
int x = 0;
while (ch < '0' || '9' < ch) ch = getchar();
while ('0' <= ch && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x;
}
void write(int x) {
if (x >= 10) write(x / 10);
putchar(x % 10 + '0');
}
const int maxn = 200009;
int T[maxn << 2], n, Q, op, L, R;
int a, b, rev = 0;
void build(int o, int l, int r) {
if (l == r) {
if (r <= n) T[o] = 1;
return;
}
build((o << 1), l, ((l + r) >> 1));
build((o << 1 | 1), ((l + r) >> 1) + 1, r);
T[o] = T[(o << 1)] + T[(o << 1 | 1)];
}
void update(int o, int l, int r, int x, int y) {
if (l == r) {
T[o] += y;
return;
}
if (x <= ((l + r) >> 1))
update((o << 1), l, ((l + r) >> 1), x, y);
else
update((o << 1 | 1), ((l + r) >> 1) + 1, r, x, y);
T[o] = T[(o << 1)] + T[(o << 1 | 1)];
}
int query(int o, int l, int r, int x, int y) {
if (l == x && y == r) return T[o];
int res = 0;
if (x <= ((l + r) >> 1))
res += query((o << 1), l, ((l + r) >> 1), x, min(y, ((l + r) >> 1)));
if (((l + r) >> 1) + 1 <= y)
res += query((o << 1 | 1), ((l + r) >> 1) + 1, r,
max(((l + r) >> 1) + 1, x), y);
return res;
}
int query(int x) { return query(1, 1, 2 * n, x, x); }
int main() {
n = read();
Q = read();
build(1, 1, 2 * n);
L = 1;
R = n;
while (Q--) {
op = read();
if (!rev) {
if (op == 1) {
a = read() + L - 1;
if (a - L + 1 <= R - a) {
for (int i = L; i <= a; i++) {
update(1, 1, 2 * n, 2 * a + 1 - i, query(i));
update(1, 1, 2 * n, i, -query(i));
}
L = a + 1;
} else {
for (int i = R; i >= a + 1; i--) {
update(1, 1, 2 * n, 2 * a + 1 - i, query(i));
update(1, 1, 2 * n, i, -query(i));
}
R = a;
rev ^= 1;
}
} else {
a = read() + L;
b = read() + L - 1;
write(query(1, 1, 2 * n, a, b));
puts("");
}
} else {
if (op == 1) {
a = R - read();
if (a - L + 1 <= R - a) {
for (int i = L; i <= a; i++) {
update(1, 1, 2 * n, 2 * a + 1 - i, query(i));
update(1, 1, 2 * n, i, -query(i));
}
L = a + 1;
rev ^= 1;
} else {
for (int i = R; i >= a + 1; i--) {
update(1, 1, 2 * n, 2 * a + 1 - i, query(i));
update(1, 1, 2 * n, i, -query(i));
}
R = a;
}
} else {
b = R - read();
a = R - read() + 1;
write(query(1, 1, 2 * n, a, b));
puts("");
}
}
}
return 0;
}
| 2,200 |
CPP
|
"""def power(x, y):
res = 1
x=x
while (y > 0):
if ((y & 1) == 1) :
res = (res * x)
y = y >> 1
x = (x * x)
return res"""
"""def fact(n):
if(n==0):
return 1
if(n==1):
return 1
return fact(n-1)+fact(n-2)"""
"""def sieveOfEratothenes(n):
dp = [True]*(n+1)
dp[1]=True
p=2
while(p*p<n+1):
if(dp[p]==True):
for i in range(p*p, n+1, p):
dp[i]=False
p+=1
return dp"""
import math
#import combinations
t=int(input())
for _ in range(t):
#a,b,c=map(int,input().split())
n=int(input())
arr=list(map(int,input().split()))
ans=0
val=0
for i in range(n):
if(arr[i]>=0):
val+=arr[i]
else:
if(val+arr[i]<0):
ans+=val+arr[i]
val=0
else:
val=val+arr[i]
print(abs(ans))
| 1,000 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
struct P {
double x;
double y;
P(double x = 0, double y = 0) {
this->x = x;
this->y = y;
}
};
double dis(P aa, P bb) {
return sqrt(((aa.x - bb.x) * (aa.x - bb.x)) +
((aa.y - bb.y) * (aa.y - bb.y)));
}
int main() {
P a, b;
double r1, r2, r, l, t;
cin >> a.x >> a.y >> r1 >> b.x >> b.y >> r2;
l = dis(a, b);
r = l - (r1 + r2);
if (r < 1e-10) {
if (r2 > r1 + 1e-10) t = r1, r1 = r2, r2 = t;
if (r1 >= (l + 1e-10)) r = r1 - r2 - l;
}
if (r < 1e-10) r = 0.0;
r /= 2;
cout << fixed << setprecision(10);
cout << r;
cout << "\n";
}
| 1,800 |
CPP
|
#include <bits/stdc++.h>
int main() {
int n, m, a, b, p, q;
double w;
scanf("%d %lf %d", &n, &w, &m);
int flag = 1;
for (int i = 1; i <= m - 2; i++) {
if ((i * n) % m != 0 && ((i * n) / m == ((i + 1) * n) / m)) {
flag = 0;
break;
}
}
if (!flag)
printf("NO");
else {
printf("YES\n");
for (int i = 0; i < m; i++) {
a = i * n;
b = (i + 1) * n;
p = a / m;
q = b / m;
if (q * m == b) q--;
if (p == q)
printf("%d %.6lf\n", p + 1, (w * n) / m);
else {
printf("%d %.6lf ", p + 1, (w * ((p + 1) * m - a)) / m);
for (int j = p + 1; j < q; j++) {
printf("%d %.6lf ", j + 1, w);
}
printf("%d %.6lf\n", q + 1, (w * (b - q * m)) / m);
}
}
}
}
| 1,900 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
bool comp(string s1, string s2) {
int len = s1.size();
for (int i = 0; i < len; i++) {
char ch1 = (s1[i] >= 65 && s1[i] <= 90) ? s1[i] : (char)(s1[i] - 32);
char ch2 = (s2[i] >= 65 && s2[i] <= 90) ? s2[i] : (char)(s2[i] - 32);
if (ch1 == ch2) continue;
return false;
}
return true;
}
int main() {
int i, n, j, k, len;
char ch;
bool cas = 0;
string str, s;
vector<string> vs;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> s;
vs.push_back(s);
}
cin >> str;
cin >> ch;
if (ch >= 65 && ch <= 90) cas = 1;
len = str.size();
bool ar[110];
memset(ar, false, 110);
for (i = 0; i < n; i++) {
if (len < vs[i].size()) continue;
for (j = 0; j <= len - vs[i].size(); j++) {
if (comp(str.substr(j, vs[i].size()), vs[i])) {
for (k = j; k < j + vs[i].size(); k++) ar[k] = true;
}
}
}
for (i = 0; i < len; i++) {
if (!ar[i]) continue;
if (cas) {
if (str[i] == ch || str[i] == ch + 32) {
if (ch == 'A') {
if (str[i] >= 65 && str[i] <= 90)
str[i] = 'B';
else
str[i] = 'b';
} else {
if (str[i] >= 65 && str[i] <= 90)
str[i] = 'A';
else
str[i] = 'a';
}
} else {
if (str[i] >= 65 && str[i] <= 90)
str[i] = ch;
else
str[i] = ch + 32;
}
} else {
if (str[i] == ch || str[i] == ch - 32) {
if (ch == 'a') {
if (str[i] >= 65 && str[i] <= 90)
str[i] = 'B';
else
str[i] = 'b';
} else {
if (str[i] >= 65 && str[i] <= 90)
str[i] = 'A';
else
str[i] = 'a';
}
} else {
if (str[i] >= 65 && str[i] <= 90)
str[i] = ch - 32;
else
str[i] = ch;
}
}
}
cout << str << endl;
return 0;
}
| 1,600 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
struct Pt {
T x, y;
void scan() { cin >> x >> y; }
};
template <typename T>
inline T sqr(const T& a) {
return a * a;
}
template <typename T>
inline int sign(const T& a) {
return a < 0 ? -1 : a > 0;
}
void task();
int main() {
ios_base::sync_with_stdio(0);
int tests;
cin >> tests;
for (int i = 0; i < tests; ++i) task();
return 0;
}
int m, k;
int a[int(1e5) + 10];
int t[int(1e5) + 10];
int r[int(1e5) + 10];
int ans[int(1e5) + 10];
int is_bad[int(1e5) + 10];
int eat_before_first[int(1e5) + 10];
int use[int(1e5) + 10];
void calc_eat_before_first(int id) {
for (int i = 0; i < id; ++i) ++eat_before_first[t[i]];
}
void task() {
cin >> m >> k;
--m;
for (int i = 1; i <= k; ++i) cin >> a[i];
for (int i = 0; i < m; ++i) cin >> t[i] >> r[i];
fill(ans, ans + k + 5, 0);
fill(is_bad, is_bad + k + 5, 0);
fill(eat_before_first, eat_before_first + k + 5, 0);
fill(use, use + k + 5, 0);
int was_dissatisfied = 0;
int first_dessatisfied_id = -1;
for (int i = 0; i < m; ++i) {
was_dissatisfied |= r[i];
if (was_dissatisfied) is_bad[t[i]] = 1;
if (r[i] && first_dessatisfied_id == -1) first_dessatisfied_id = i;
}
if (first_dessatisfied_id == -1) {
calc_eat_before_first(m);
int sum = 0;
for (int i = 1; i <= k; ++i) sum += eat_before_first[i];
for (int i = 1; i <= k; ++i)
if (a[i] <= m - sum + eat_before_first[i]) ans[i] = 1;
} else {
calc_eat_before_first(first_dessatisfied_id);
int the_best_id = -1;
int sum = 0;
for (int i = 1; i <= k; ++i) sum += eat_before_first[i];
for (int i = 1; i <= k; ++i)
if (!is_bad[i]) {
(void(1));
if (the_best_id == -1 ||
a[i] - eat_before_first[i] <
a[the_best_id] - eat_before_first[the_best_id]) {
the_best_id = i;
}
if (a[i] - eat_before_first[i] + sum <= first_dessatisfied_id)
ans[i] = 1;
}
a[the_best_id] -= eat_before_first[the_best_id];
for (int i = 0; a[the_best_id]; ++i)
if (t[i] == 0) {
t[i] = the_best_id;
--a[the_best_id];
}
for (int i = 0; i < m; ++i) ++use[t[i]];
for (int i = 1; i <= k; ++i) {
if (a[i] - use[i] - use[0] <= 0) ans[i] = 1;
}
(void(1));
}
for (int i = 1; i <= k; ++i) cout << (ans[i] ? 'Y' : 'N');
cout << "\n";
}
| 2,100 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n > 36)
cout << -1;
else {
while (n != 0) {
if (n % 2 == 0) {
cout << 8;
n -= 2;
} else {
cout << 6;
n -= 1;
}
}
}
}
| 1,200 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
for (auto a : x) cout << a << ' ';
cout << '\n';
}
struct custom {
bool operator()(const pair<pair<long long int, long long int>,
pair<long long int, long long int> > &p1,
const pair<pair<long long int, long long int>,
pair<long long int, long long int> > &p2) const {
pair<long long int, long long int> p = p1.first, q = p2.first;
return p.first * q.second > p.second * q.first;
}
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
long long int res = 1;
while (b) {
if (b & 1) res = (res * a) % M;
a = (a * a) % M;
b >>= 1;
}
return res;
}
const long long int N = 5e5 + 5, inf = 2e18;
vector<long long> v;
long long int n, m;
long long int calc(long long int pos) {
auto it = lower_bound(v.begin(), v.end(), pos) - v.begin();
long long int up = it;
while (up < n && v[up] == pos) up++;
long long int cnt = 0, ab = 0, bel = 0, d2 = n - 1, d1 = 0;
while (d2 >= up) {
cnt += abs(v[d2] - pos) * 2;
d2 -= m;
}
while (d1 < it) {
cnt += abs(v[d1] - pos) * 2;
d1 += m;
}
return cnt;
}
long long int Ternary_search(long long int l, long long int r) {
long long int lo = l, hi = r, m1, m2;
while (lo < hi) {
m1 = lo + (hi - lo) / 3;
m2 = hi - (hi - lo) / 3;
if (calc(m1) <= calc(m2)) {
hi = m2 - 1;
} else {
lo = m1 + 1;
}
}
{
string _s = "lo";
replace(_s.begin(), _s.end(), ',', ' ');
stringstream _ss(_s);
istream_iterator<string> _it(_ss);
itval(_it, lo);
}
return calc(lo);
}
void solve() {
cin >> n >> m;
v.resize(n);
for (long long int i = (long long int)0; i < (long long int)(n); i++)
cin >> v[i];
sort(v.begin(), v.end());
cout << Ternary_search(-1e9, 1e9) << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int test = 1;
clock_t z = clock();
for (long long int tes = (long long int)0; tes < (long long int)(test);
tes++) {
solve();
}
fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
fflush(stderr);
return 0;
}
| 2,000 |
CPP
|
n = int(input())
a = [int(i) for i in input().split()]
t = sorted(list(map(lambda x: x+1, a)) + a + list(map(lambda x: x-1, a)))
for j in t:
if j in a:
indices = [i for i, x in enumerate(a) if x == j]
if j%2:
for i in indices:
a[i]+=1
else:
for i in indices:
a[i]-=1
for i in a:
print(i, end=' ')
| 800 |
PYTHON3
|
def check(data):
for i in range(3):
if data[i] in data[i+1:]:
return False
return True
year = int(input())
found = False
while not found:
year += 1
found = check(str(year))
print(year)
| 800 |
PYTHON3
|
n=int(input())
s=input()
count=0
for i in range (0,len(s)-1):
if s[i]==s[i+1]:
count+=1
print(count)
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
bool sortcoll(vector<long long int> &v1, vector<long long int> &v2) {
return v1[1] < v2[1];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n, m;
cin >> n >> m;
long long int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
;
vector<vector<long long int> > graph(n, vector<long long int>(n, INT_MAX));
while (m--) {
long long int x, y;
cin >> x >> y;
graph[x - 1][y - 1] = arr[y - 1];
graph[y - 1][x - 1] = arr[x - 1];
}
long long int minCost = 0;
for (int i = 0; i < n - 1; i++) {
long long int maxpos = 0;
for (int i = 1; i < n; i++) {
if (arr[i] > arr[maxpos]) maxpos = i;
}
long long int cost = 0;
vector<long long int> index;
for (int i = 0; i < n; i++) {
if (arr[i] == arr[maxpos]) index.push_back(i);
}
long long int count = 0;
for (int j = 0; j < n; j++) {
if (graph[maxpos][j] != INT_MAX) {
cost += graph[maxpos][j];
count++;
}
}
for (int k = 0; k < index.size(); k++) {
long long int temp = 0, sum = 0;
for (int j = 0; j < n; j++) {
if (graph[index[k]][j] != INT_MAX) {
temp++;
sum += graph[index[k]][j];
}
}
if (temp > count) {
count = temp;
cost = sum;
maxpos = index[k];
}
}
minCost += cost;
for (int j = 0; j < n; j++) {
if (graph[maxpos][j] != INT_MAX) {
graph[maxpos][j] = INT_MAX;
graph[j][maxpos] = INT_MAX;
}
}
arr[maxpos] = INT_MIN;
}
cout << minCost;
return 0;
}
| 1,400 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
bool xx[10000], yy[10000];
int main() {
int n, k, x, y, ans = 0;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cin >> x >> y;
xx[x] = true;
yy[y] = true;
}
for (int i = 2; i <= n - 1; i++) {
if (!xx[i]) ans++;
if (!yy[i]) ans++;
}
if (n % 2 == 1 && !xx[n / 2 + n % 2] && !yy[n / 2 + n % 2]) ans--;
cout << ans;
return 0;
}
| 1,800 |
CPP
|
n, k = map(int, input().split())
g = []
o = []
b = 5
z = 0
for i in range(n):
a = map(int,input().split())
g += a
break
for u in g:
if u <= b - k:
o.append(u)
z = int(len(o)/3)
print(z)
| 800 |
PYTHON3
|
n = int(input())
m = list(map(int,input().split()))
ans = []
totalmax = 0
for top in range(n):
lst = [0]*n
lst[top] = m[top]
for i in range(top-1,-1,-1):
lst[i] = min(lst[i+1],m[i])
for i in range(top+1,n):
lst[i] = min(lst[i-1],m[i])
total = sum(lst)
if totalmax < total:
ans = lst
totalmax = total
print(*ans,sep=" ")
| 1,500 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int a[105];
int b[105];
int r[105];
int c[105];
int ans[105][105];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) cin >> b[i];
for (int i = 0; i <= 31; i++) {
int row = 0, col = 0;
for (int j = 1; j <= n; j++) {
if ((a[j] >> i) & 1) {
row++;
r[j] = 1;
} else
r[j] = 0;
}
for (int j = 1; j <= m; j++) {
if ((b[j] >> i) & 1) {
col++;
c[j] = 1;
} else
c[j] = 0;
}
if (row % 2 != col % 2) {
puts("NO");
return 0;
} else {
if (row % 2 == 1) {
for (int j = 1; j <= n; j++)
for (int k = 1; k <= m; k++)
if (r[j] == 1 && c[k] == 1) ans[j][k] += (1 << i);
} else {
int numr = 0;
for (int j = 1; j <= n; j++)
for (int k = 1; k <= m; k++) {
if (r[j] == 1 && c[k] == 1) {
ans[j][k] += (1 << i);
c[k] = 0;
r[j] = 0;
}
}
for (int j = 1; j <= n; j++) {
if (r[j] == 0) {
for (int k = 1; k <= m; k++)
if (c[k] == 1) {
ans[j][k] += (1 << i);
c[k] = 0;
}
}
}
for (int k = 1; k <= m; k++) {
if (c[k] == 0) {
for (int j = 1; j <= n; j++)
if (r[j] == 1) {
ans[j][k] += (1 << i);
r[j] = 0;
}
}
}
}
}
}
puts("YES");
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
printf("%d ", ans[i][j]);
if (j == m) puts("");
}
}
| 1,800 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int longestIncreasingSubsequenceLenghtDP(int a[], int n) {
int dp[n], ans = 0;
for (int k = 0; k < n; k++) {
dp[k] = 1;
for (int i = 0; i < k; i++) {
if (a[i] <= a[k]) {
dp[k] = max(dp[k], dp[i] + 1);
ans = max(dp[k], ans);
}
}
}
return ans;
}
int result[1000] = {0};
int factDP(int n) {
if (n >= 0) {
result[0] = 1;
for (int i = 1; i <= n; ++i) {
result[i] = i * result[i - 1];
}
return result[n];
}
}
bool isPrime(long long n) {
if (n < 2) return false;
for (long long x = 2; x * x <= n; x++) {
if (n % x == 0) return false;
}
return true;
}
vector<int> primeFactors(int n) {
vector<int> f;
for (int x = 2; x * x <= n; x++) {
while (n % x == 0) {
f.push_back(x);
n /= x;
}
}
if (n > 1) f.push_back(n);
return f;
}
int binary_Search_Classic(int n, int arr[], int target) {
int l, r, mid;
l = 0;
r = n - 1;
while (l <= r) {
mid = l + (r - l) / 2;
if (arr[mid] == target) {
return mid;
}
if (arr[mid] < target) {
l = mid + 1;
} else {
r = mid - 1;
}
}
return -1;
}
vector<int> Two_PointerSumOfTwo(vector<int> arr, int target) {
int l = 0, r = arr.size() - 1;
vector<int> ans;
while (l < r) {
if (arr[l] + arr[r] == target) {
ans.push_back(l);
ans.push_back(r);
break;
} else if (arr[l] + arr[r] > target) {
r--;
} else {
l++;
;
}
}
return ans;
}
int countDistinctCharsString(string s) {
unordered_map<char, int> m;
for (int i = 0; i < (int)s.length(); i++) {
m[s[i]]++;
}
return m.size();
}
map<char, int> m;
int main() {
string s;
cin >> s;
int n = s.size();
bool ok = false;
int firstpoza, lastpoza, firstpozb, lastpozb, firstpozc;
if (s[0] == 'a') {
firstpoza = 0;
} else {
cout << "NO"
<< "\n";
return 0;
}
bool x = true;
bool f = true;
for (int i = 0; i < n; i++) {
m[s[i]]++;
if (s[i] == 'a') {
lastpoza = i;
}
if (x && s[i] == 'b') {
firstpozb = i;
x = false;
}
if (s[i] == 'b') {
lastpozb = i;
}
if (f && s[i] == 'c') {
f = false;
firstpozc = i;
}
}
if ((m['a'] == m['c'] || m['b'] == m['c']) && lastpoza < firstpozb &&
lastpozb < firstpozc) {
cout << "YES"
<< "\n";
} else {
cout << "NO"
<< "\n";
}
}
| 1,200 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10, P = 1e9 + 7;
int n;
int a[N], b[N];
int suf[N];
int dp[N], t[N], vis[N], mx[N];
void add(int first, int v) {
for (int i = first; i <= n * 2; i += i & -i) (t[i] += v) %= P;
return;
}
int sum(int first) {
int res = 0;
for (int i = first; i > 0; i -= i & -i) (res += t[i]) %= P;
return res;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &a[i], &b[i]);
suf[a[i]] = b[i];
}
for (int i = n * 2; i >= 1; i--) {
if (suf[i]) {
dp[i] = (sum(suf[i]) + 1) % P;
add(suf[i], dp[i]);
}
}
int q;
scanf("%d", &q);
for (int i = 1; i <= q; i++) {
int first;
scanf("%d", &first);
vis[a[first]] = 1;
mx[a[first]] = max(mx[a[first]], b[first]);
}
for (int i = n * 2; i >= 1; i--) mx[i] = max(mx[i + 1], mx[i]);
int ans = 0;
for (int i = 1; i <= n * 2; i++) {
if (suf[i]) {
if (vis[i] || suf[i] < mx[i + 1]) (ans += dp[i]) %= P;
}
}
printf("%d\n", ans);
return 0;
}
| 3,000 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int n, ind[200005], x;
void solve() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
ind[x - 1] = i;
}
int l = n;
int r = 0;
string ans = "";
for (int i = 0; i < n; i++) {
l = min(l, ind[i]);
r = max(r, ind[i]);
if (r - l == i)
ans += '1';
else
ans += '0';
}
cout << ans << endl;
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
| 1,300 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
const long double PI =
3.141592653589793238462643383279502884197169399375105820974944;
inline void io() {}
const long long mod = 2e15;
const long long maxn = 2e5 + 5;
void solve() {
long long n, m;
cin >> n >> m;
m = m * 8;
long long a[n], cnt = 0;
map<long long, long long> mp;
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
map<long long, long long> st1, st2;
sort(a, a + n);
for (long long i = 0; i < n - 1; i++) {
if (a[i] < a[i + 1]) st1[a[i]] = n - i - 1;
}
for (long long i = 1; i < n; i++) {
if (a[i] > a[i - 1]) st2[a[i]] = i;
}
vector<long long> v(a, a + n);
v.resize(unique(v.begin(), v.end()) - v.begin());
long long k = m / n;
k = pow(2, min(20ll, k));
long long ans = INT_MAX;
for (long long i = 0; i < (long long)((v).size()) - k + 1; i++) {
ans = min(ans, st2[v[i]] + st1[v[i + k - 1]]);
}
if (ans == INT_MAX) ans = 0;
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(16);
long long tc = 1;
while (tc--) {
solve();
}
return 0;
}
| 1,600 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
long long int ans = 0, n, k, count = 0, sum = 0, a, b, tmp = 0, flag = 0,
ans1 = 0, tmp1 = 0, m;
cin >> n;
long long int arr[n];
for (int j = 0; j < n; j++) {
cin >> arr[j];
sum += arr[j];
}
long long int max_so_far = LLONG_MIN, max_end_here = 0;
for (int j = 0; j < n - 1; j++) {
max_end_here += arr[j];
if (max_so_far < max_end_here) {
max_so_far = max_end_here;
}
if (max_end_here < 0) {
max_end_here = 0;
}
}
max_end_here = 0;
for (int j = n - 1; j > 0; j--) {
max_end_here += arr[j];
if (max_so_far < max_end_here) {
max_so_far = max_end_here;
}
if (max_end_here < 0) {
max_end_here = 0;
}
}
if (max_so_far < sum) {
cout << "YES";
} else {
cout << "NO";
}
cout << "\n";
}
}
| 1,300 |
CPP
|
n, m, h = list(map(int, input().split()))
front = list(map(int, input().split()))
left = list(map(int, input().split()))
matrix = []
for i in range(n):
matrix.append(list(map(int, input().split())))
maxs = []
for i in range(len(matrix)):
for j in range(len(matrix[0])):
if matrix[i][j] == 1:
matrix[i][j] = front[j]
for i in range(len(matrix)):
for j in range(len(matrix[0])):
if matrix[i][j] > left[i]:
matrix[i][j] = left[i]
for i in range(len(matrix)):
print(*matrix[i])
| 1,200 |
PYTHON3
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.