solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
t=int(input())
for tt in range (0,t):
n,k=map(int,input().split())
s=input()
if s[0]=="1":
a=0
else:
a=-1
b=-1
d=0
for i in range (0,n):
if s[i]=="1":
b=i
if a==-1:
c=b-k
c=1+(c-1)//(k+1)
d=d+c
a=b
else:
c=b-a-1
if c>(2*k):
c=c-(2*k)
c=1+(c-1)//(k+1)
d=d+c
a=b
e=n-b-k-1
e=1+(e-1)//(k+1)
if e>0:
d=d+e
if b==-1:
if n<=(k+1):
print(1)
else:
print(((n-1)//(k+1))+1)
else:
print(d) | 9 | PYTHON3 |
a, b = input().split()
c = int(a+b)
print('Yes' if c == int(c**.5)**2 else 'No') | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
if (n == 1) {
cout << -1 << endl;
} else if (n % 3 == 1) {
cout << "5";
for (int i = 2; i < n; ++i) {
cout << '4';
}
cout << "3\n";
} else {
for (int i = 1; i < n; ++i) {
cout << '2';
}
cout << "3\n";
}
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct less_key {
bool operator()(const pair<double, int32_t>& p1,
const pair<double, int32_t>& p2) {
return p1.first < p2.first ||
(p1.first == p2.first && p1.second > p2.second);
}
};
struct pair_hash {
std::size_t operator()(const pair<int32_t, int32_t>& k) const {
return static_cast<size_t>(k.first ^ k.second);
}
};
int32_t n;
int64_t nx, bx;
vector<int64_t> rx;
int64_t ny, by;
vector<int64_t> ry;
int64_t count(int64_t b, vector<int64_t>& r) {
int64_t c = 1;
int64_t res = 0;
for (int32_t i = r.size() - 1; i >= 0; i--) {
res += c * r[i];
c *= b;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> nx >> bx;
for (int32_t i = 0; i < nx; i++) {
int64_t t;
cin >> t;
rx.push_back(t);
}
cin >> ny >> by;
for (int32_t i = 0; i < ny; i++) {
int64_t t;
cin >> t;
ry.push_back(t);
}
int64_t Rx = count(bx, rx);
int64_t Ry = count(by, ry);
if (Rx == Ry) {
cout << '=';
} else if (Rx < Ry) {
cout << '<';
} else {
cout << '>';
}
return 0;
}
| 7 | CPP |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+7;
int n,m,p,sr,sc;
char s[N],t[N];
bool walk1()
{
int L=1,R=n;
for(int i=p;i;i--)
{
if(t[i]=='U')R=min(n,R+1);else if(t[i]=='D')L=max(1,L-1);
if(s[i]=='U')L++;else if(s[i]=='D')R--;
if(L>R)return 1;
}
return (sr<L||sr>R);
}
bool walk2()
{
int L=1,R=m;
for(int i=p;i;i--)
{
if(t[i]=='L')R=min(m,R+1);else if(t[i]=='R')L=max(1,L-1);
if(s[i]=='L')L++;else if(s[i]=='R')R--;
if(L>R)return 1;
}
return (sc<L||sc>R);
}
int main()
{
scanf("%d%d%d%d%d",&n,&m,&p,&sr,&sc);
scanf("%s",s+1);
scanf("%s",t+1);
if(walk1()||walk2())puts("NO");
else puts("YES");
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long LIM = 1e18;
const int MAXN = 1e5;
int N;
bool possible = true;
long long A[MAXN], B[MAXN];
vector<pair<int, int> > T[MAXN];
void dfs(int v) {
for (int i = 0; i < (int)T[v].size(); i++) {
int u = T[v][i].first;
int c = T[v][i].second;
dfs(u);
if (B[u] >= A[u])
B[v] += B[u] - A[u];
else if (A[u] - B[u] > (double)LIM / c)
possible = false;
else if (B[v] < -LIM + (A[u] - B[u]) * c)
possible = false;
else
B[v] -= (A[u] - B[u]) * c;
}
}
int main() {
scanf("%d", &N);
for (int i = 0; i < (int)N; i++) scanf("%lld", &B[i]);
for (int i = 0; i < (int)N; i++) scanf("%lld", &A[i]);
for (int i = 1; i < (int)N; i++) {
int p, c;
scanf("%d", &p), scanf("%d", &c);
T[p - 1].push_back({i, c});
}
dfs(0);
printf("%s\n", B[0] >= A[0] && possible ? "YES" : "NO");
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 6000;
long long stat[N];
long long sc[N];
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
long long n, m;
cin >> n >> m;
long long inf = 1e9;
fill(stat, stat + n, inf);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
stat[a - 1] = min(stat[a - 1], (n + b - a) % n);
sc[a - 1]++;
}
for (int i = 0; i < n; i++) {
long long ans = 0;
for (int j = 0; j < n; j++) {
if (sc[j]) {
long long dist = (n + j - i) % n + (sc[j] - 1) * n;
if (dist + stat[j] > ans) ans = dist + stat[j];
ans = max(ans, dist + stat[j]);
}
}
cout << ans << ' ';
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 2)
cout << "Ehab";
else
cout << "Mahmoud";
return 0;
}
| 7 | CPP |
n = int(input())
A = list(map(int, input().split()))
ai = max(A)
A.remove(ai)
Asub = [abs(ai/2 -a) for a in A]
aj = A[Asub.index(min(Asub))]
print('{} {}'.format(ai, aj)) | 0 | PYTHON3 |
import sys
n = int(input())
string = input()
if n <= 26:
alphabet = [0]*26
cnt = 0
for char in string:
alphabet[ord(char)-97] += 1
for num in alphabet:
if num > 1:
cnt += (num-1)
print(cnt)
else:
print('-1') | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, lena, lenb, lenc, ans = 1e9, ansa, ansb;
bool p = 0;
long long dig[12] = {1, 10, 100, 1000,
10000, 100000, 1000000, 10000000,
100000000, 1000000000, 10000000000, 1000000000};
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 f * x;
}
int getlen(long long x) {
int len = 0;
while (x) x /= 10, len++;
return len;
}
void dfs(int a, int b, int c, long long na, long long nb, int addlen, int jin,
int len) {
if (addlen >= ans) return;
if (!a && !b && !c && !jin) {
ans = addlen;
ansa = na;
ansb = nb;
return;
}
if (c == 0) {
int tot = a + b + jin;
dfs(0, 0, 0, na + a * dig[len], nb + b * dig[len], addlen + getlen(tot), 0,
0);
return;
}
if ((a % 10 + b % 10 + jin) % 10 == c % 10)
dfs(a / 10, b / 10, c / 10, na + (a % 10) * dig[len],
nb + (b % 10) * dig[len], addlen, (a % 10 + b % 10 + jin) / 10,
len + 1);
else {
dfs(a * 10 + (c % 10 - b % 10 - jin + 10) % 10, b, c, na, nb, addlen + 1,
jin, len);
dfs(a, b * 10 + (c % 10 - a % 10 - jin + 10) % 10, c, na, nb, addlen + 1,
jin, len);
dfs(a, b, c * 10 + (a % 10 + b % 10 + jin) % 10, na, nb, addlen + 1, jin,
len);
}
}
int main() {
a = read(), b = read(), c = read();
dfs(a, b, c, 0, 0, 0, 0, 0);
printf("%I64d+%I64d=%I64d", ansa, ansb, ansa + ansb);
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 70001, base = 173, mo = 1e9 + 9;
long long ans, n;
string s[maxn];
struct asuka {
long long key, l, r;
bool friend operator<(asuka a, asuka b) {
if (a.r - a.l == b.r - b.l) return a.key < b.key;
return a.r - a.l < b.r - b.l;
}
};
map<asuka, long long> mp[maxn];
signed main() {
cin >> n;
for (long long k = 1; k <= n; k++) {
cin >> s[k];
for (long long i = 0; i < 9; i++) {
long long key = 0;
for (long long j = i; j < 9; j++)
key = (key * base % mo + s[k][j]) % mo, mp[0][{key, i, j}]++,
mp[k][{key, i, j}]++;
}
}
for (long long k = 1; k <= n; k++)
for (map<asuka, long long>::iterator i = mp[k].begin(); i != mp[k].end();
i++) {
if (i->second == mp[0][i->first]) {
for (long long j = i->first.l; j <= i->first.r; j++) putchar(s[k][j]);
cout << endl;
break;
}
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using std ::reverse;
using std ::swap;
using std ::vector;
template <typename T>
T max(T x, T y) {
return (x > y) ? x : y;
}
template <typename T>
T min(T x, T y) {
return (x < y) ? x : y;
}
template <typename T>
bool chkmax(T &x, T y) {
return (x >= y) ? 0 : (x = y, 1);
}
template <typename T>
bool chkmin(T &x, T y) {
return (x <= y) ? 0 : (x = y, 1);
}
template <typename T>
T read(T &in) {
in = 0;
char ch;
T f = 1;
while (!isdigit(ch = getchar()))
if (ch == '-') f = -1;
while (isdigit(ch)) in = in * 10 + ch - '0', ch = getchar();
return in *= f;
}
static const int max1 = 1 << 21 | 1;
static const int B = 1000;
struct cpx {
double r, i;
cpx(double _r = 0, double _i = 0) { r = _r, i = _i; }
cpx conj() { return cpx(r, -i); }
};
cpx operator+(const cpx &a, const cpx &b) { return cpx(a.r + b.r, a.i + b.i); }
cpx operator-(const cpx &a, const cpx &b) { return cpx(a.r - b.r, a.i - b.i); }
cpx operator*(const cpx &a, const cpx &b) {
return cpx(a.r * b.r - a.i * b.i, a.r * b.i + a.i * b.r);
}
int N, M, L, R[max1];
cpx PolyA[max1], PolyB[max1];
void FFT(cpx *x) {
static const double PI = acos(-1);
for (int i = (0), ir = (N - 1); i <= (ir); ++i)
if (i < R[i]) swap(x[i], x[R[i]]);
for (int i = 1; i < N; i <<= 1) {
cpx wn = cpx(cos(PI / i), sin(PI / i));
for (int j = 0, t = i << 1; j < N; j += t) {
cpx w = cpx(1, 0);
for (int k = 0; k < i; ++k, w = w * wn) {
cpx p = x[j + k], q = w * x[i + j + k];
x[j + k] = p + q, x[i + j + k] = p - q;
}
}
}
}
void Mul(vector<int> &a, vector<int> &b, vector<int> &c) {
for (N = 1, L = 0, M = b.size() + c.size(); N <= M; N <<= 1) ++L;
for (int i = (0), ir = (N - 1); i <= (ir); ++i)
R[i] = (R[i >> 1] >> 1) | ((i & 1) << (L - 1));
for (int i = (0), ir = (b.size() - 1); i <= (ir); ++i) PolyA[i].r = b[i];
for (int i = (0), ir = (c.size() - 1); i <= (ir); ++i) PolyA[i].i = c[i];
for (int i = (b.size()), ir = (N - 1); i <= (ir); ++i) PolyA[i].r = 0;
for (int i = (c.size()), ir = (N - 1); i <= (ir); ++i) PolyA[i].i = 0;
FFT(PolyA);
for (int i = (0), ir = (N - 1); i <= (ir); ++i) {
int j = (N - 1) & (N - i);
cpx ar = (PolyA[i] + PolyA[j].conj()) * cpx(0.5, 0);
cpx ai = (PolyA[i] - PolyA[j].conj()) * cpx(0, -0.5);
PolyB[j] = ar * ai;
}
FFT(PolyB);
a.resize(b.size() + c.size() + 1);
for (int i = (0), ir = (a.size() - 1); i <= (ir); ++i) a[i] = 0;
for (int i = (0), ir = (a.size() - 1); i <= (ir); ++i) {
long long t = round(PolyB[i].r / N) + a[i];
a[i] = t % B;
if (i != a.size() - 1)
a[i + 1] += t / B;
else
assert(t < B);
assert(a[i] >= 0);
}
assert(a.back() < B);
while (a.size() > 1 && !a.back()) a.pop_back();
}
void Mul(vector<int> &a, vector<int> &b, int c) {
a.resize(b.size() + 1);
for (int i = (0), ir = (a.size() - 1); i <= (ir); ++i) a[i] = 0;
for (int i = (0), ir = (b.size() - 1); i <= (ir); ++i) {
a[i] += b[i] * c;
if (a[i] < 0) {
fprintf(stderr, "wtf\n");
}
a[i + 1] += a[i] / B, a[i] %= B;
}
for (int i = (0), ir = (a.size() - 1); i <= (ir); ++i) assert(a[i] >= 0);
assert(a.back() < B);
while (a.size() > 1 && !a.back()) a.pop_back();
}
bool operator<(const vector<int> &a, const vector<int> &b) {
if (a.size() != b.size()) return a.size() < b.size();
for (int i = (a.size() - 1), ir = (0); i >= (ir); --i)
if (a[i] != b[i]) return a[i] < b[i];
return 0;
}
bool operator>=(const vector<int> &a, const vector<int> &b) { return !(a < b); }
int n;
char Sn[max1];
vector<int> a, b, c, d, e;
void qpow(int y) {
b.push_back(1), c.push_back(3);
for (; y; y >>= 1, Mul(c, c, c))
if (y & 1) Mul(b, b, c);
}
int main() {
scanf("%s", Sn);
n = strlen(Sn);
if (n == 1) {
if (Sn[0] == '1') return puts("1"), 0;
}
reverse(Sn, Sn + n);
int w;
for (int i = (0), ir = (n - 1); i <= (ir); ++i) {
a.push_back(0);
for (int j = (0), jr = (w = min(2, n - 1 - i)); j <= (jr); ++j)
a.back() = a.back() * 10 + (Sn[i + w - j] - '0');
i += 2;
}
w = max(0, (int)((n - 1) * (log(10) / log(3))) - 1);
qpow(w);
int Ans = INT_MAX, cc = 3 * w;
while (b < a) {
Mul(d, b, 2);
if (d >= a) chkmin(Ans, cc + 2);
Mul(d, b, 4);
if (d >= a) chkmin(Ans, cc + 4);
Mul(d, b, 3), b = d, cc += 3;
}
printf("%d\n", min(Ans, cc));
return 0;
}
| 10 | CPP |
n = int(input())
s = list(input())
r = -1
l = n
root = []
def find_right(node):
global l,r,s,n
while n:
r += 1
n -= 1
if s[r] == '(':
node[2].append([r,-1,[]])
find_right(node[2][-1])
else:
node[1] = r
return True
return False
def find_left(node):
global l,r,s,n
while n:
l -= 1
n -= 1
if s[l] == ')':
node[2].append([-1,l,[]])
find_left(node[2][-1])
else:
node[0] = l
return True
return False
is_correct = True
while n:
r += 1
n -= 1
if s[r]=='(':
root.append([r,-1,[]])
is_correct &= find_right(root[-1])
else:
root = [[-1,r,root]]
is_correct &= find_left(root[-1])
sol = [[0,1,1]]
if is_correct:
sol.append([len(root), 1, 1])
for child in root:
sol.append([len(child[2])+1, child[0]+1, child[1]+1])
for gr_child in child[2]:
if len(gr_child[2]):
sol.append([len(root)+len(gr_child[2])+1, gr_child[0]+1, gr_child[1]+1])
print('%d\n%d %d'%tuple(max(sol))) | 10 | PYTHON3 |
def solve():
n = input()
seq = input()
for i in range(len(seq)-1):
x, y = seq[i], seq[i+1]
if x == '.' and y != '.': first_letter_idx = i+1
if x != '.' and y == '.': last_letter_idx = i
if x == 'R' and y == 'L': return f'{i+1} {i+2}'
if seq[first_letter_idx] == 'R': return f'{first_letter_idx+1} {last_letter_idx+2}'
return f'{last_letter_idx+1} {first_letter_idx}'
print(solve()) | 7 | PYTHON3 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
int n,x;
ll dp[205][100005];
int s[205];
int mmin = mod;
int main() {
cin >> n >> x;
for(int i = 0; i < n; i++) {
cin >> s[i];
mmin = min(mmin,s[i]);
}
sort(s,s+n);
dp[n][x] = 1;
int k = x;
for(int i = n; i > 0; i--) {
for(int j = 0; j <= x; j++) {
if(dp[i][j] == 0) continue;
dp[i-1][j] = (dp[i-1][j] + dp[i][j] * (i - 1)) % mod;
dp[i-1][j % s[i-1]] += dp[i][j];
}
}
ll ans = 0;
for(int i = 0; i < mmin; i++) {
// cout << "d[0]["<<i<<"] = "<<dp[0][i] << endl;
ans = (ans + (dp[0][i] * i) % mod ) % mod;
}
cout << ans << endl;
}
| 0 | CPP |
n=int(input())
count=0
for i in range(2,n+1):
if n%i==0:
count+=1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long INF = 10e9 + 7;
using namespace std;
void cout_vector(vector<long long> &a) {
for (auto i : a) cout << i << " ";
cout << '\n';
};
void cout_pair(vector<pair<long long, long long>> &a) {
for (auto i : a) cout << i.first << " " << i.second << "\n";
cout << '\n';
};
void cout_matrix(vector<vector<long long>> &a) {
for (auto i : a) {
for (auto j : i) cout << j << " ";
cout << '\n';
}
cout << '\n';
};
long long max(long long a, long long b) {
if (a > b)
return a;
else
return b;
}
long long min(long long a, long long b) {
if (a > b) return b;
return a;
}
long long gcd(long long x, long long y) {
while (x && y) x > y ? x %= y : y %= x;
return x + y;
}
long long sum(vector<long long> &a) {
long long s = 0;
for (long long i = 0; i < a.size(); i++) s += a[i];
return s;
}
long long comp(vector<long long> &a) {
long long ans = 1;
for (long long i = 0; i < 5; i++) ans *= a[i];
return ans;
}
bool da(vector<long long> &a, vector<long long> &binar) {
long long n = a.size();
long long ans = 0;
for (long long i = 0; i < n; i++) {
if (binar[i] == 1)
ans += a[i];
else
ans += -a[i];
}
return (ans == 0);
}
void solve() {
string s;
cin >> s;
string ans = "NO";
for (long long i = 0; i < 5; i++) {
string t;
cin >> t;
if (t[0] == s[0] || t[1] == s[1]) ans = "YES";
}
cout << ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
solve();
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int n;
cin >> n;
int* arr = new int[n];
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (max(a, max(b, c)) - min(a, min(b, c)) < 3)
arr[i] = 0;
else
arr[i] = abs(a - b) + abs(b - c) + abs(a - c) - 4;
}
for (int i = 0; i < n; i++) cout << arr[i] << '\n';
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 5 * (int)1e5;
vector<int> conns[N];
int ev[2 * N];
int itv[N];
bool vis[N];
int count(int i) {
if (vis[i]) return 0;
vis[i] = true;
int res = 1;
for (auto t : conns[i]) res += count(t);
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
ev[a - 1] = i + 1;
ev[b - 1] = -(i + 1);
itv[i] = b - 1;
}
int m = 0;
set<int> act;
for (int i = 0; i < 2 * n && m < n; ++i) {
if (ev[i] > 0) {
int j = ev[i] - 1;
auto it = act.begin();
while ((it != act.end()) && (*it < itv[j]) && (m < n)) {
int t = -ev[*it] - 1;
conns[j].push_back(t);
conns[t].push_back(j);
++m;
++it;
}
act.insert(itv[j]);
} else {
act.erase(i);
}
}
if (m == n - 1 && count(0) == n)
cout << "YES\n";
else
cout << "NO\n";
}
| 10 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main()
{
map<long long ,int >ck;
int n,s=0,a,b;
cin>>n;
while(n--){
cin>>a;
if(ck[a]==0){ck[a]=1;s++;}
else{ck[a]=0;s--;}
}
cout<<s<<endl;
return 0;
}
| 0 | CPP |
n=int(input())
print(sum([((n//i)*(i+(n//i*i))//2) for i in range(1,n+1)])) | 0 | PYTHON3 |
#include <iostream>
using namespace std;
int main() {
int W, a, b;
cin >> W >> a >> b;
cout << max(abs(a - b) - W, 0) << endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
const int INF = int(1e8);
const int mod = int(1e9 + 7);
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
string n;
cin >> n;
if (n[((int)(n).size()) - 1] == '1' || n[((int)(n).size()) - 1] == '3' ||
n[((int)(n).size()) - 1] == '5' || n[((int)(n).size()) - 1] == '7' ||
n[((int)(n).size()) - 1] == '9')
cout << 1;
else
cout << 0;
return 0;
}
| 10 | CPP |
k = int(input())
while(k>0):
n = [int(x) for x in input().split()]
if(n[1]!=0): print(str(60*(24-n[0]-1)+(60-n[1])%60))
else: print(str(60*(24-n[0])+(60-n[1])%60))
k=k-1 | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, v[5050], q, x;
scanf("%d %d", &n, &k);
for (int i = 0, __l = n; i < __l; ++i) scanf("%d", &v[i]);
scanf("%d", &q);
while (q--) {
scanf("%d", &x);
int ans = -1;
for (int amt = 1, __l = k; amt <= __l; ++amt) {
for (int c = 0, __l = n; c < __l; ++c) {
if (x == amt * v[c]) {
ans = amt;
break;
}
for (int i = 1, __l = amt - 1; i <= __l; ++i) {
int tmp = x - i * v[c];
if (tmp < 0) break;
if (tmp % (amt - i) == 0) {
tmp /= (amt - i);
if (binary_search(v, v + n, tmp)) ans = amt;
}
}
if (ans != -1) break;
}
if (ans != -1) break;
}
printf("%d\n", ans);
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct S {
int abre = 0, cierra = 0, completo = 0;
};
const int N = 1000005;
int n;
int t[2 * N];
void build() {
for (int i = n - 1; i > 0; --i) {
t[i] = t[i << 1] | t[i << 1 | 1];
}
}
void update(int p, int value) {
for (t[p += n] = value; p > 0; p >>= 1) t[p >> 1] = t[p] | t[p ^ 1];
}
int query(int l, int r) {
int res = 0;
for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
if (l & 1) res |= t[l++];
if (r & 1) res |= t[--r];
}
return __builtin_popcount(res);
}
int get_mask(char x) { return 1 << (x - 'a'); }
int main() {
int nn, q, l, x, d, temp, m, p, a, b;
char c;
string s;
cin >> s;
n = s.size();
for (int i = 0; i < n; ++i) {
t[i + n] = get_mask(s[i]);
}
build();
cin >> q;
while (q--) {
cin >> x;
if (x == 1) {
cin >> a >> c;
update(a - 1, get_mask(c));
} else {
cin >> a >> b;
cout << query(a - 1, b) << "\n";
}
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, m, v, i, j;
cin >> n >> m >> v;
long long x = n - 2;
long long y = ((n - 2) * (n - 1)) / 2;
if (y < m - 1) {
cout << -1;
return 0;
}
long long p = -1, q = -1;
for (i = 1; i <= n; i++) {
if (i == v) continue;
if (p == -1)
p = i;
else {
q = i;
break;
}
}
vector<pair<long long, long long> > ans;
ans.push_back(make_pair(p, v));
if (m - 1 < n - 2) {
cout << -1;
return 0;
}
long long cnt = 1;
for (i = 1; i <= n; i++) {
if (cnt == m) break;
if (i == p) continue;
for (j = i + 1; j <= n; j++) {
if (cnt == m) break;
if (j == i || j == p) continue;
ans.push_back(make_pair(i, j));
cnt++;
}
}
for (i = 0; i < ans.size(); i++) {
cout << ans[i].first << " " << ans[i].second << endl;
}
}
| 9 | CPP |
# l = 5
# n = 2
#
#
#
# t = 0
# for _ in range(n):
#
# f = s[s.find('B'):].find('G')
# assert f != -1
#
# for j in range(0,f+1):
# new_s = s[:f].find('G')
# print(s[f], f)
# s = input()
n = int(str(input()).split(' ')[1])
s = input()
for _ in range(n):
s = s.replace('BG', 'GB')
print(s) | 8 | PYTHON3 |
from collections import deque
t = int(input())
INF=float('inf')
rr = lambda: input()
rri = lambda: int(input())
rrm = lambda: list(map(int, input().split()))
def solve(N,x,arr):
best = 0
sumsofar = 0
for i in range(N):
sumsofar += arr[i]
if sumsofar % x != 0:
best = max(best, i+1)
sumsofar = 0
for i in range(N-1, -1, -1):
sumsofar += arr[i]
if sumsofar % x != 0:
best = max(best, (N-1-i)+1)
if best == 0:
return -1
return best
for _ in range(t):
n,x=rrm()
arr=rrm()
print(solve(n,x,arr))
| 7 | PYTHON3 |
def create_binary_heap(data, lenght):
for i in range(lenght):
j = max(0, (i - 1) // 2)
while data[i] > data[j]:
data[i], data[j] = data[j], data[i]
i = j
j = max(0, (i - 1) // 2)
def heap_sort(data):
lenght = len(data)
for i in range(lenght):
create_binary_heap(data, lenght - i)
data[lenght - 1 - i], data[0] = max(data[lenght - 1 - i], data[0]), min(data[lenght - 1 - i], data[0])
data = input()
data = data.split("+")
heap_sort(data)
print("+".join(data)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
scanf("%d", &a);
for (int i = 0; i < a; i++) {
int l, r;
scanf("%d%d", &l, &r);
if (l == 1)
printf("1 %d\n", r);
else
printf("%d %d\n", l, l * 2);
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool func(char x, char y) {
if (x == y) return true;
if (x >= 'a' && x <= 'z' && y >= 'A' && y <= 'Z')
if ((int)(x - 'a') == (int)(y - 'A')) return true;
if (y >= 'a' && y <= 'z' && x >= 'A' && x <= 'Z')
if ((int)(y - 'a') == (int)(x - 'A')) return true;
if (y == '1')
if (x == 'l' || x == 'I' || x == 'L' || x == 'i') return true;
if (x == '1')
if (y == 'l' || y == 'I' || y == 'L' || y == 'i') return true;
if (y == 'I')
if (x == 'l' || x == 'L') return true;
if (y == 'i')
if (x == 'l' || x == 'L') return true;
if (y == 'L')
if (x == 'i' || x == 'I') return true;
if (y == 'l')
if (x == 'i' || x == 'I') return true;
if ((y == 'o' || y == 'O') && x == '0') return true;
if (y == '0' && (x == 'o' || x == 'O')) return true;
return false;
}
int main() {
string s;
cin >> s;
bool fl = 0;
int n;
cin >> n;
while (n--) {
bool f = 1;
string t;
cin >> t;
if (s.size() == t.size()) {
for (int i = 0; i < s.size(); i++)
if (func(s[i], t[i]))
f &= 1;
else
f &= 0;
if (f) fl = 1;
}
}
if (!fl)
cout << "Yes";
else
cout << "No";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string name;
int after, before, t;
cin >> t;
bool ans = false;
while (t--) {
cin >> name >> before >> after;
if (ans) continue;
if (before >= 2400 && after > before) {
ans = true;
}
}
if (ans)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| 7 | CPP |
b,m= 0,0
a = input()
for i in a:
if ord(i)<96:
b+=1
else:
m+=1
if b>m:
a=a.upper()
else:
a=a.lower()
print(a) | 7 | PYTHON3 |
S = input("").split(" ")
H = int(S[0])
L = int(S[1])
print(abs(H*H-L*L)/(2*H)) | 8 | PYTHON3 |
number1 = input()
number2 = input()
for i in range(len(number1)):
if number1[i] == number2[i]:
print("0", end='')
else:
print("1", end='')
| 7 | PYTHON3 |
w=int(input())
if w<=3:
print('NO')
elif w%2==0 and w>3:
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
#include <iostream>
#include <vector>
#include <algorithm>
#define int long long
#define rep(i, n) for (i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
int X, K;
int r[100000];
int Q;
int t[100000], a[100000];
vector<P> query; //(時刻, 内容(-1:ひっくり返す, a[i](>=0):求める))
signed main() {
int i;
cin >> X >> K;
rep(i, K) cin >> r[i]; cin >> Q; rep(i, Q) cin >> t[i] >> a[i];
rep(i, K) query.push_back(P(r[i], -1));
rep(i, Q) query.push_back(P(t[i], a[i]));
sort(query.begin(), query.end());
int l = 0, r = X, b = 0, c = X;
int dx = -1, prevT = 0;
rep(i, query.size()) {
int qt = query[i].first;
int qa = query[i].second;
//更新
if (dx == -1) {
int cnt1 = min(b, qt - prevT);
int cnt2 = qt - prevT - cnt1;
b -= cnt1;
c -= cnt1 + cnt2; if (c < b) c = b;
l = min(l + cnt2, r);
}
else {
int cnt1 = min(X - c, qt - prevT);
int cnt2 = qt - prevT - cnt1;
c += cnt1;
b += cnt1 + cnt2; if (b > c) b = c;
r = max(r - cnt2, l);
}
prevT = qt;
//cout << "debug[l, r, b, c, dx, prevT, qa] = [" << l << ", " << r << ", " << b << "," << c << ", " << dx << ", " << prevT << ", "<< qa << "]" << endl;
//クエリ
if (qa == -1) {
dx *= -1;
}
else {
if (qa <= l) cout << b << endl;
else if (qa >= r) cout << c << endl;
else cout << b + (qa - l) << endl;
}
}
return 0;
} | 0 | CPP |
s=int(input())
a=set()
i=1
while True:
a.add(s)
i+=1
s=s//2 if s%2==0 else 3*s+1
if s in a:
print(i)
exit() | 0 | PYTHON3 |
maxn=1000
s=""
for i in range(1,maxn):
s+=str(i)
n=int(input())
print(s[n-1]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
char c;
long long out = 0, f = 1;
for (c = getchar(); (c < '0' || c > '9') && c != '-'; c = getchar())
;
if (c == '-') {
f = -1;
c = getchar();
}
for (; c >= '0' && c <= '9'; c = getchar()) {
out = (out << 3) + (out << 1) + c - '0';
}
return out * f;
}
void write(long long x) {
if (x < 0) {
putchar('-');
write(-x);
return;
}
if (x > 9) {
write(x / 10);
}
putchar(x % 10 + '0');
}
int n, l = 1, r = 1000000000;
char s[100];
int main() {
int i;
scanf("%d", &n);
if (n == 1) {
printf("0 0\n");
fflush(stdout);
printf("0 1 1 1\n");
fflush(stdout);
return 0;
}
printf("1 0\n");
fflush(stdout);
scanf("%s", s);
if (s[0] == 'b') {
for (i = 1; i < n - 1; ++i) {
printf("1 %d\n", (l + r) / 2);
fflush(stdout);
scanf("%s", s);
if (s[0] == 'b') {
l = (l + r) / 2 + 1;
} else {
r = (l + r) / 2 - 1;
}
}
printf("999999999 %d\n", r);
fflush(stdout);
scanf("%s", s);
if (s[0] == 'b') {
printf("0 %d 999999998 %d\n", l, r);
fflush(stdout);
} else {
printf("0 %d 1000000000 %d\n", l, r);
fflush(stdout);
}
} else {
for (i = 1; i < n - 1; ++i) {
printf("1 %d\n", (l + r) / 2);
fflush(stdout);
scanf("%s", s);
if (s[0] == 'w') {
l = (l + r) / 2 + 1;
} else {
r = (l + r) / 2 - 1;
}
}
printf("999999999 %d\n", r);
fflush(stdout);
scanf("%s", s);
if (s[0] == 'w') {
printf("0 %d 999999998 %d\n", l, r);
fflush(stdout);
} else {
printf("0 %d 1000000000 %d\n", l, r);
fflush(stdout);
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void top_dfs(int src, vector<vector<int> >& directed_graph, vector<int>& vis,
vector<int>& top_order) {
vis[src] = 1;
for (int i = 0; i < directed_graph[src].size(); i++) {
if (vis[directed_graph[src][i]] == 0) {
top_dfs(directed_graph[src][i], directed_graph, vis, top_order);
}
}
top_order.push_back(src);
}
void solve() {
int n, m;
cin >> n >> m;
vector<int> vis(n + 1, 0);
vector<vector<int> > directed_graph(n + 1);
vector<int> top_order;
vector<pair<int, int> > edges;
for (int i = 0; i < m; i++) {
int t, u, v;
cin >> t >> u >> v;
if (t == 1) {
directed_graph[u].push_back(v);
}
edges.push_back(make_pair(u, v));
}
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) top_dfs(i, directed_graph, vis, top_order);
}
reverse(top_order.begin(), top_order.end());
int pos[n + 1];
for (int i = 1; i <= n; i++) {
pos[top_order[i - 1]] = i;
}
for (int i = 1; i <= n; i++) {
int u = i;
for (int j = 0; j < directed_graph[i].size(); j++) {
int v = directed_graph[i][j];
if (pos[u] > pos[v]) {
cout << "NO" << endl;
return;
}
}
}
cout << "YES" << endl;
for (int i = 0; i < m; i++) {
int x = edges[i].first, y = edges[i].second;
if (pos[x] < pos[y]) {
cout << x << " " << y << endl;
}
if (pos[y] < pos[x]) {
cout << y << " " << x << endl;
}
}
}
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) solve();
return 0;
}
| 11 | CPP |
positives = []
negatives = []
zeros = []
n = int(input())
nums = [int(c) for c in input().split()]
for e in nums:
if e > 0:
positives.append(e)
elif e < 0:
negatives.append(e)
else:
zeros.append(e)
set1 = []
set2 = []
set3 = []
set1.append(negatives.pop())
if not positives:
set2.append(negatives.pop())
set2.append(negatives.pop())
else:
set2.append(positives.pop())
set3 += zeros
set3 += positives
set3 += negatives
print(len(set1), *set1)
print(len(set2), *set2)
print(len(set3), *set3)
| 7 | PYTHON3 |
#include <iostream>
using namespace std;
int kona, minm;
void search(int k, int a, int b, int c){
if(k <= 0){
int am = (a / 5) * 5 * 380 * 0.8 + (a % 5) * 380;
int bm = (b / 4) * 4 * 550 * 0.85 + (b % 4) * 550;
int cm = (c / 3) * 3 * 850 * 0.88 + (c % 3) * 850;
int all = am + bm + cm;
if(all < minm) minm = all;
return;
}
if(k >= 200) search(k - 200, a + 1, b, c);
if(k >= 300) search(k - 300, a, b + 1, c);
if(k >= 500) search(k - 500, a, b, c + 1);
}
int main(void){
while(cin >> kona && kona != 0){
minm = 100000000;
search(kona, 0, 0, 0);
cout << minm << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long dp[20][50][3000];
int l[20];
map<int, int> m;
void init() {
memset(dp, -1, sizeof(dp));
int cnt = 0;
for (int i = 1; i <= 2520; i++) {
if (2520 % i == 0) {
m[i] = ++cnt;
}
}
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
if (b == 0) return a;
return a * b / gcd(a, b);
}
long long dfs(int pos, long long pre, bool limits, int mod) {
if (pos == 0) {
if (pre % mod == 0) {
return 1;
} else
return 0;
}
if (dp[pos][m[mod]][pre] != -1 && !limits) return dp[pos][m[mod]][pre];
int n = limits ? l[pos] : 9;
long long ans = 0;
for (int i = 0; i <= n; i++) {
int t = lcm(mod, i);
ans += dfs(pos - 1, (pre * 10 + i) % 2520, limits && i == l[pos], t);
}
if (!limits) dp[pos][m[mod]][pre] = ans;
return ans;
}
long long solve(long long a) {
long long t = a;
int pos = 0;
while (a) {
l[++pos] = a % 10;
a /= 10;
}
return dfs(pos, 0, true, 1);
}
int main() {
init();
int n;
long long a, b;
scanf("%d", &n);
while (n--) {
scanf("%lld%lld", &a, &b);
printf("%lld\n", solve(b) - solve(a - 1));
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1000;
int main() {
long long n;
cin >> n;
long long k = n / 2520;
cout << k << endl;
return 0;
}
| 16 | CPP |
m = input()
n = int(input())
for i in range(n):
ord = input().split()
a,b =map(int,ord[1:3])
if ord[0]=='print':
print(m[a:b+1])
elif ord[0]=='reverse':
rev = m[a:b+1]
m = m[:a]+rev[::-1]+m[b+1:]
else:
rep = ord[3]
m=m[:a]+rep+m[b+1:]
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e6 + 5;
const long long int mod = 1e9 + 7;
const long long int level = 20;
long long int dp[2][505][505];
int main() {
ios::sync_with_stdio(false);
long long int n, k;
cin >> n >> k;
dp[0][0][0] = 1;
for (long long int i = 1; i < n + 1; i++) {
long long int x;
cin >> x;
long long int now = i % 2;
long long int last = 1 - now;
for (long long int j = 0; j < k + 1; j++) {
for (long long int z = 0; z < j + 1; z++) {
dp[now][j][z] = dp[last][j][z];
if (j >= x) {
dp[now][j][z] |= dp[last][j - x][z];
if (z >= x) dp[now][j][z] |= dp[last][j - x][z - x];
}
}
}
}
vector<long long int> ans;
for (long long int i = 0; i < k + 1; i++) {
if (dp[n % 2][k][i]) ans.push_back(i);
}
cout << ans.size() << endl;
for (long long int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
cout << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,x) for(int i=0;i<x;++i)
const int inf = 1e9;
signed main()
{
int N;
while (cin >> N, N) {
vector<int> hp(N);
rep(i, N) {
cin >> hp[i];
}
int M;
cin >> M;
vector<pair<int,int>> S, A;
rep(i, M) {
string s;
int mp, dmg;
cin >> s >> mp >> s >> dmg;
if (s == "Single") S.push_back(make_pair(mp, dmg));
else A.push_back(make_pair(mp, dmg));
}
vector<int> dp1(100010, inf), dp2(100010, inf);
dp1[0] = dp2[0] = 0;
for (int i = 0; i < S.size(); ++i) {
int mp = S[i].first, dmg = S[i].second;
for (int j = 0; j <= 100000; ++j) {
if (j - dmg >= 0) {
dp1[j] = min(dp1[j], dp1[j - dmg] + mp);
} else {
dp1[j] = min(dp1[j], mp);
}
}
}
for (int i = 0; i < A.size(); ++i) {
int mp = A[i].first, dmg = A[i].second;
for (int j = 0; j <= 100000; ++j) {
if (j - dmg >= 0) {
dp2[j] = min(dp2[j], dp2[j - dmg] + mp);
} else {
dp2[j] = min(dp2[j], mp);
}
}
}
int mi = inf;
for (int a = 0; a <= 100000; ++a) {
int sum = dp2[a];
for (int i = 0; i < N; ++i) {
if (hp[i] - a >= 0) {
sum += dp1[hp[i] - a];
}
}
mi = min(mi, sum);
}
cout << mi << endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool cmp(const pair<int, int>& p1, const pair<int, int>& p2) {
return p1.first < p2.first;
}
int markg[105] = {0}, markb[105] = {0};
int main() {
int n, m;
scanf("%d", &n);
scanf("%d", &m);
int bh, gh;
scanf("%d", &bh);
vector<int> vx, v;
for (int i = 0; i < bh; i++) {
int a;
scanf("%d", &a);
v.push_back(a);
markb[a] = 1;
}
scanf("%d", &gh);
for (int i = 0; i < gh; i++) {
int a;
scanf("%d", &a);
vx.push_back(a);
markg[a] = 1;
}
int day = 0;
int cn = 0;
while (1) {
if (cn >= 100000) break;
int idx, idy;
idx = day % n;
idy = day % m;
markb[idx] = max(markb[idx], markg[idy]);
markg[idy] = max(markg[idy], markb[idx]);
cn++;
day++;
}
for (int i = 0; i < n; i++) {
if (markb[i] == 0) {
printf(
"No"
"\n");
return 0;
}
}
for (int i = 0; i < m; i++) {
if (markg[i] == 0) {
printf(
"No"
"\n");
return 0;
}
}
printf(
"Yes"
"\n");
return 0;
}
| 11 | CPP |
#include<bits/stdc++.h>//AGC019F
using namespace std;
const int N=1e6+6,MOD=998244353;
int fac[N],invfac[N],siz,n,m,ans;
int plu(int u,int v){
return (u+v)%MOD;
}
int dec(int u,int v){
return u<v?u-v+MOD:u-v;
}
int mul(int u,int v){
return (int)(1LL*u*v%MOD);
}
int qpow(int u,int v){
int rep=1;
while(v){
if(v&1){
rep=mul(rep,u);
}
u=mul(u,u);
v>>=1;
}
return rep;
}
int c(int u,int v){
return mul(mul(invfac[v],invfac[u-v]),fac[u]);
}
int main(){
scanf("%d%d",&n,&m);
if(n>m){
swap(n,m);
}
siz=n+m;
fac[0]=1;
for(int i=1;i<=siz;i++){
fac[i]=mul(fac[i-1],i);
}
invfac[siz]=qpow(fac[siz],MOD-2);
for(int i=siz-1;~i;i--){
invfac[i]=mul(invfac[i+1],i+1);
}
for(int i=1;i<=n;i++){
ans=plu(ans,mul(c(n+m-i-i,n-i),c(i+i,i)));
}
ans=mul(ans,qpow(mul(2,c(n+m,n)),MOD-2));
ans=plu(ans,m);
printf("%d\n",ans);
// for(int i=0;i<=5;i++){
// for(int j=0;j<=i;j++){
// printf("%d%c",c(i,j)," \n"[i==j]);
// }
// }
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-6;
const double PI = 3.14159265358979323846264338f;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
const int MAXN = 50005;
inline int read() {
int c = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
c = c * 10 + ch - '0';
ch = getchar();
}
return c * f;
}
unordered_map<string, int> ma;
unordered_map<string, int> ma2;
int ans = 0;
void dfs(int cnt, string s) {
if (ma[s] != 0 && ma2[s] == 0) {
ans += ma[s];
ma2[s] = 1;
} else {
int len = s.length();
for (int i = 0; i < len; i++) {
if (s[i] == '?') {
dfs(cnt, s.substr(0, i) + s.substr(i + 1, len - i - 1));
for (char j = 'a'; j <= 'e'; j++) {
s[i] = j;
dfs(cnt, s);
}
}
}
}
}
int main() {
int n, m;
string s;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s;
ma[s]++;
}
while (m--) {
ans = 0;
string ss;
cin >> ss;
ma2.clear();
int len = ss.length();
int cnt = 0;
for (int i = 0; i < len; i++) {
if (ss[i] == '?') cnt++;
}
if (cnt == 0) {
if (ma[ss] == 1) ans++;
} else
dfs(cnt, ss);
cout << ans << "\n";
}
return 0;
}
| 13 | CPP |
from math import sqrt , floor
n, m = [int(x) for x in input().split()]
def cp(x):
for y in range(2,floor(sqrt(x)+1)):
if x%y == 0:
return False
else:
return True
l=[2]
for z in range (3,51):
if cp(z)==True:
l.append(z)
l.append(0)
if n in l:
i = l.index(n)
if l[i+1]== m:
print("YES")
elif l[i+1]!= m or cp(m) == False :
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long A[5 * 1000 + 3][5 * 1000 + 3];
long long sum[5 * 1000 + 3];
int main() {
int n, a, b, k;
cin >> n >> a >> b >> k;
if (a > b) {
a = n - a + 1;
b = n - b + 1;
}
for (int j = 1; j <= b / 2; j++) A[j][1] = b - 2;
A[b - 1][1] = 0;
for (int j = b - 2; j > b / 2; j--) A[j][1] = A[j + 1][1] + 2;
for (int i = 2; i <= k; i++) {
sum[b] = 0;
A[b - 1][i] = 0;
for (int j = b - 1; j > 0; j--)
sum[j] = (sum[j + 1] + A[j][i - 1]) % (1000 * 1000 * 1000 + 7);
for (int j = b - 1; j > b / 2; j--)
A[j][i] = (sum[2 * j - b + 1] - A[j][i - 1] + (1000 * 1000 * 1000 + 7)) %
(1000 * 1000 * 1000 + 7);
for (int j = 1; j <= b / 2; j++)
A[j][i] = (sum[1] - A[j][i - 1] + (1000 * 1000 * 1000 + 7)) %
(1000 * 1000 * 1000 + 7);
}
cout << A[a][k];
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
string x;
int k;
int main() {
cin >> k >> x;
if (k <= 3) {
cout << x << endl;
return 0;
}
for (int i = 0; i < (int)(k / 3 - 1); i++) cout << x.substr(i * 3, 3) << "-";
if (k % 3 == 2)
cout << x.substr(k - 5, 3) << "-" << x.substr(k - 2, 2) << endl;
else if (k % 3 == 1)
cout << x.substr(k - 4, 2) << "-" << x.substr(k - 2, 2) << endl;
else
cout << x.substr(k - 3, 3) << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long qpow(long long x, long long y) {
long long ret = 1;
while (y) {
if (y & 1) ret = ret * x % MOD;
y >>= 1;
x = x * x % MOD;
}
return ret % MOD;
}
int main() {
long long n, sum = 0, C = 1;
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
C = C * (n - i + 1) % MOD * qpow(i, MOD - 2) % MOD;
if (i & 1)
sum = (sum + C * qpow(3, i) % MOD * qpow(3, n * (n - i))) % MOD;
else
sum = ((sum - C * qpow(3, i) % MOD * qpow(3, n * (n - i))) % MOD + MOD) %
MOD;
}
sum = sum * 2 % MOD;
C = 1;
long long ans = 0;
for (int i = 0; i < n; i++) {
if (i) C = C * (n - i + 1) % MOD * qpow(i, MOD - 2) % MOD;
long long tmp = qpow(((1 - qpow(3, i)) % MOD + MOD) % MOD, n);
if (n & 1)
tmp = (tmp + qpow(3, i * n)) % MOD;
else
tmp = (tmp - qpow(3, i * n) + MOD) % MOD;
if (i & 1)
ans = (ans + tmp * C) % MOD;
else
ans = ((ans - tmp * C) % MOD + MOD) % MOD;
}
cout << (sum + ans * 3) % MOD << endl;
return 0;
}
| 11 | CPP |
s=input()
l=["H","Q","9"]
flag=0
for i in s:
if i in l:
flag=1
break
if flag==1:
print("YES")
else:
print("NO") | 7 | PYTHON3 |
import bisect
s=input()
a=[]
for x in s:
a.append(x)
b=set(a)
a=list(b)
if(len(a)%2==0):
print('CHAT WITH HER!')
else:
print('IGNORE HIM!') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char s1[100005], s2[100005];
int main() {
int len;
char *p, *q, c;
scanf("%s", s1);
strcpy(s2, s1);
len = strlen(s1);
sort(s1, s1 + len);
len -= 1;
p = s2;
while (len >= 0) {
c = s1[len];
q = strchr(p, c);
if (q != NULL) {
printf("%c", c);
p = q + 1;
}
len--;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, c = 0, z = 0;
cin >> n;
vector<long long> vec;
for (long long i = 0; i < n; i++) {
long long k;
cin >> k;
if (k % 2 == 0) {
for (long long j = 1; j <= k / 2; j++) {
long long num;
cin >> num;
c += num;
}
for (long long j = (k / 2) + 1; j <= k; j++) {
long long num;
cin >> num;
z += num;
}
} else {
for (long long j = 1; j <= k / 2; j++) {
long long num;
cin >> num;
c += num;
}
long long a;
cin >> a;
vec.push_back(a);
for (long long j = (k / 2) + 2; j <= k; j++) {
long long num;
cin >> num;
z += num;
}
}
}
sort(vec.rbegin(), vec.rend());
for (long long i = 0; i < vec.size(); i++) {
if (i % 2 == 0) {
c += vec[i];
} else
z += vec[i];
}
cout << c << " " << z << endl;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chkmin(T& a, T const& b) {
return a > b ? a = b, true : false;
}
template <class T>
inline bool chkmax(T& a, T const& b) {
return a < b ? a = b, true : false;
}
const int M = 200005;
vector<int> E[M], W[M];
int dfn[M], low[M], stk[M];
int id[M], Son[M], Sz[M], Fa[M], Top[M], dep[M];
int n, m, q, bcc_cnt, dfn_cnt, id_cnt, top;
void solve(int u, int v) {
int x, w = ++bcc_cnt;
do {
x = stk[--top];
W[w].push_back(x);
} while (x != v);
W[u].push_back(w);
}
void Tarjan(int u, int fa) {
dfn[u] = low[u] = ++dfn_cnt;
stk[top++] = u;
for (auto v : E[u])
if (v != fa) {
if (!dfn[v]) {
Tarjan(v, u);
chkmin(low[u], low[v]);
if (dfn[u] <= low[v]) solve(u, v);
} else
chkmin(low[u], dfn[v]);
}
}
void Get_son(int u) {
Sz[u] = 1;
for (auto v : W[u]) {
Fa[v] = u;
dep[v] = dep[u] + (u > n);
Get_son(v);
Sz[u] += Sz[v];
if (Sz[v] > Sz[Son[u]]) Son[u] = v;
}
}
void Get_top(int u, int p) {
Top[u] = p;
id[u] = ++id_cnt;
if (Son[u]) Get_top(Son[u], p);
for (auto v : W[u])
if (!Top[v]) Get_top(v, v);
}
int LCA(int u, int v) {
while (Top[u] != Top[v])
(id[u] < id[v]) ? (v = Fa[Top[v]]) : (u = Fa[Top[u]]);
return id[u] < id[v] ? u : v;
}
int main() {
scanf("%d %d %d", &n, &m, &q);
while (m--) {
int u, v;
scanf("%d %d", &u, &v);
E[u].push_back(v);
E[v].push_back(u);
}
bcc_cnt = n;
Tarjan(1, -1);
Get_son(1);
Get_top(1, 1);
while (q--) {
int u, v, w, ans;
scanf("%d %d", &u, &v);
w = LCA(u, v);
ans = dep[u] + dep[v] - dep[w] * 2;
if (w > n) --ans;
printf("%d\n", ans);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int cnt = 0, n, T, c[2000 + 5], e[2000 + 5], t[2000 + 5], num[2000 + 5];
double f[2000 + 5], P[2000 + 5];
long long p[2000 + 5], g[2000 + 5], s[2000 + 5];
void update(int x, long long a, double b) {
if (g[x] < a || g[x] == a && f[x] > b) g[x] = a, f[x] = b;
}
bool cmp(int a, int b) {
return p[a] * (1000000 - p[b]) * t[a] < p[b] * (1000000 - p[a]) * t[b];
}
int main() {
scanf("%d%d", &n, &T);
for (int i = 1; i <= n; i++) {
scanf("%lld%d%d%d%lf", s + i, c + i, e + i, t + i, P + i);
p[i] = P[i] * 1000000 + 0.5, num[i] = i;
}
sort(num + 1, num + 1 + n, cmp);
for (int i = 1; i <= n; i++)
for (int j = T; j >= e[num[i]]; j--) {
if (j >= e[num[i]] + t[num[i]])
update(j,
g[j - e[num[i]] - t[num[i]]] +
(1000000 - p[num[i]]) * c[num[i]] + s[num[i]] * 1000000,
(f[j - e[num[i]] - t[num[i]]] + e[num[i]]) * P[num[i]] +
j * (1 - P[num[i]]));
update(j, g[j - e[num[i]]] + s[num[i]] * 1000000,
f[j - e[num[i]]] + e[num[i]]);
}
for (int i = T; i; i--) update(0, g[i], f[i]);
printf("%.10lf %.10lf\n", double(g[0]) / 1000000, f[0]);
return 0;
}
| 10 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int cnt,t,n,i,a[31];
cin>>t;
while(t--){
cin>>n;
cnt=0;
while(n!=0){
cnt++;
n/=2;
}
cout<<(1<<(cnt-1))-1<<'\n';
}
} | 7 | CPP |
n = int(input())
s = input()
k = ""
vow = "aeiouy"
i = 0
while True:
if i>len(s)-1 or len(s)==1:
break
if i+1<len(s) and s[i] in vow and s[i+1] in vow:
s = s[:i+1] + s[i+2:]
else:
i += 1
print(s) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 5;
deque<int> Q;
long long q[N * 5];
pair<int, int> f[N * 5];
map<pair<int, int>, bool> mm;
int main() {
int n, m, b;
int mx = 0, tot = 0;
;
cin >> n >> m;
for (int i = (int)(1); i <= (int)(n); i++)
scanf("%d", &b), mx = max(mx, b), Q.push_back(b);
for (int i = (int)(1); i <= (int)(m); i++) scanf("%lld", &q[i]);
for (int i = (int)(1); i <= (int)((n - 1) * 2); i++) {
int x = Q.front();
Q.pop_front();
int y = Q.front();
Q.pop_front();
f[i].first = x, f[i].second = y;
if (x > y)
Q.push_front(x), Q.push_back(y);
else
Q.push_front(y), Q.push_back(x);
tot++;
if (Q.front() == mx) break;
}
for (int i = (int)(1); i <= (int)(n - 1); i++) {
int x = Q.front();
Q.pop_front();
int y = Q.front();
Q.pop_front();
f[tot + i].first = x;
f[tot + i].second = y;
Q.push_front(x), Q.push_back(y);
}
for (int i = (int)(1); i <= (int)(m); i++) {
if (q[i] <= tot) {
printf("%d %d\n", f[q[i]].first, f[q[i]].second);
} else {
printf("%d %d\n", f[tot + (q[i] - tot - 1) % (n - 1) + 1].first,
f[tot + (q[i] - tot - 1) % (n - 1) + 1].second);
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
template <typename T>
istream &operator>>(istream &is, vector<T> &arr) {
typename vector<T>::iterator a;
for (a = arr.begin(); a != arr.end(); a++) {
is >> *a;
}
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &arr) {
typename vector<T>::iterator a;
for (a = arr.begin(); a != arr.end(); a++) {
os << *a << " ";
}
os << endl;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &p) {
os << p.first << " " << p.second << " ";
return os;
}
long long mul(long long a, long long b, long long md = MOD) {
return (a % md * b % md) % md;
}
long long add(long long a, long long b, long long md = MOD) {
long long ans = a + b;
if (ans >= md) ans -= md;
return ans;
}
bool valid(int i, int j, int n, int m) {
return i >= 0 && i < n && j >= 0 && j < m;
}
vector<pair<int, int>> dirs = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
long long binPow(long long x, long long y) {
long long ans = 1;
while (y > 0) {
if (y % 2 == 1) ans = mul(ans, x);
x = mul(x, x);
y /= 2;
}
return ans;
}
long long modInverse(long long x) { return binPow(x, MOD - 2); }
vector<long long> fac(1e6 + 1), inv(1e6 + 1);
bool Good(long long x, int a, int b) {
while (x) {
if (x % 10 != a && x % 10 != b) {
return false;
}
x /= 10;
}
return true;
}
int main() {
int a, b, n;
cin >> a >> b >> n;
fac[0] = 1ll;
inv[0] = 1ll;
for (int i = 1; i <= n; i++) {
fac[i] = mul(fac[i - 1], i);
inv[i] = modInverse(fac[i]);
}
if (a > b) swap(a, b);
long long ans = 0;
int cur = a * n;
if (Good(cur, a, b)) ans = add(ans, 1);
for (int i = 1; i <= n; i++) {
cur += b - a;
if (Good(cur, a, b)) ans = add(ans, mul(fac[n], mul(inv[i], inv[n - i])));
}
cout << ans << '\n';
}
| 9 | CPP |
n=int(input())
a=[]
line=input()
if line:
for x in line.strip().split():
a.append(int(x))
b=sum(a)
if n==1:
if b==1:
print('YES')
else:
print('NO')
elif b==n-1:
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
def is_palindrome(time):
return time == time[::-1]
def from_ints_to_time(hour, minute):
result = ''
if hour < 10:
result += '0'
result += str(hour)
result += ':'
if minute < 10:
result += '0'
result += str(minute)
return result
def advance(hour, minute):
new_minute, new_hour = 0, hour
new_minute = minute + 1
if new_minute == 60:
new_minute = 0
new_hour = hour + 1
if new_hour == 24:
new_hour = 0
return new_hour, new_minute
def main():
hour, minute = [int(elem) for elem in input().split(':')]
counter = 0
while True:
time = from_ints_to_time(hour, minute)
if is_palindrome(time):
break
hour, minute = advance(hour, minute)
counter += 1
print(counter)
main()
| 7 | PYTHON3 |
inp1, inp2 = [int(i) for i in input().split()]
lista = list()
def reverse(n):
newStr = ""
for c in str(n):
newC = 9 - int(c)
newStr += str(newC)
l = len(str(n))
d = "9"*l
d = int(d)
newStr = d - int(n)
return int(newStr)
le = len(str(inp2)) - 1
digit = 5 * (10 ** le)
if digit > inp2:
print(reverse(inp2)*inp2)
elif digit < inp1:
print(reverse(inp1)*inp1)
else:
print(reverse(digit)*digit)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class A, class B>
ostream& operator<<(ostream& out, const pair<A, B>& a) {
return out << "(" << a.first << ", " << a.second << ")";
}
template <class A>
ostream& operator<<(ostream& out, const vector<A>& a) {
out << "[";
for (auto it = a.begin(); it != a.end(); ++it) {
if (it != a.begin()) out << ", ";
out << *it;
}
return out << "]";
}
mt19937 rnd(time(NULL));
mt19937_64 rnd64(time(NULL));
const int INF = 1e9;
const long long INF64 = 1e18;
const int MOD = 1e9 + 7;
const long double PI = acosl(-1.0);
const long double EPS = 1e-9;
const int N = 200 * 1000 + 11;
int n;
int a[N];
bool read() {
if (scanf("%d", &n) != 1) return false;
for (int i = 0; i < int(n); ++i) scanf("%d", &a[i]);
return true;
}
void solve() {
sort(a, a + n);
n = unique(a, a + n) - a;
int ans = 0;
for (int i = 0; i < int(n); ++i) {
for (int j = 2 * a[i]; j <= 2 * 1000 * 1000; j += a[i]) {
int pos = lower_bound(a, a + n, j) - a - 1;
if (pos < n) ans = max(ans, a[pos] % a[i]);
}
}
printf("%d\n", ans);
}
int main() {
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
if (read()) {
solve();
}
}
| 10 | CPP |
n, l = list(map(int, input().split()))
a = [0] + list(map(int, input().split())) + [l]
a.sort()
# print(a)
maxm = max(a[1] - a[0], a[-1] - a[-2])
for i in range(n + 1):
maxm = max(maxm, (a[i + 1] - a[i])/2)
print(maxm) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string s;
bool is_palindrome(int h) {
int l = 0;
h--;
while (h > l) {
if (s[l++] != s[h--]) {
return 0;
}
}
return 1;
}
int main() {
cin >> s;
int ans = 1;
int h = s.size();
while (h >= 0) {
if (is_palindrome(h) == 0) {
ans = 0;
break;
} else
h--;
}
if (ans == 0)
cout << h << endl;
else
cout << "0" << endl;
}
| 7 | CPP |
from collections import deque,namedtuple
n,m=map(int,input().split())
c=[input() for _ in ' '*n]
p=namedtuple('p',['x','y','parent'])
visited=[[False for _ in " "*m] for _ in " "*n]
y=[-1,0,1,0]
x=[0,-1,0,1]
def judge( x, y):
if(x>=0 and x<n and y>=0 and y<m):
return 1
else: #inefficient
return 0
def isCyclicUtil(i,j):
dq=deque()
dq.append(p(i,j,(-1,-1)))
while len(dq):
q=dq.pop()
if visited[q.x][q.y]:
return True
visited[q.x][q.y]=True
for k in range(4):
u=q.x+y[k];v=q.y+x[k]
if not (judge(u,v) and c[u][v]==c[i][j]):continue
if not (u==q.parent[0] and v==q.parent[1]):
dq.append(p(u,v,(q.x,q.y)))
def iscycle(n,m):
for i in range(n):
for j in range(m):
if visited[i][j]==False:
if isCyclicUtil(i,j)==True:
return True
return False
print('Yes' if iscycle(n,m) else 'No') | 8 | PYTHON3 |
import sys
from collections import deque
def II():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
def MI():
return map(int, sys.stdin.readline().split())
def SI():
return sys.stdin.readline().strip()
def C(n, k, mod):
return (FACT(n,mod) * pow((FACT(k,mod)*FACT(n-k,mod))%mod,mod-2, mod))%mod
def lcm(a,b):
return abs(a*b) // math.gcd(a, b)
for _ in range(II()):
n = II()
s = list(SI())
ans = -1
for i in range(26):
temp = chr(i+97)
count = 0
tempS = s[:]
for j in range(len(s)):
if s[j] == temp:
count+=1
tempS[j] = ''
checkTemp = list("".join(tempS))
if checkTemp == checkTemp[::-1]:
if len(checkTemp)%2 == 1:
l = r = len(checkTemp)//2
else:
l = len(checkTemp)//2-1
r = len(checkTemp)//2
newL = -1
newR = 0
c = -1
for j in range(len(s)):
if tempS[j] !='':
c+=1
if c == l and newL == -1:
newL = j
if c == r:
newR = j
break
l = newL
r = newR
if l != r:
count-=r-l-1
l-=1
r+=1
while l >= 0 and r<len(tempS):
if tempS[l] == tempS[r] == '':
count-=2
l-=1
r+=1
elif tempS[l] == '':
l-=1
elif tempS[r] == '':
r+=1
else:
l-=1
r+=1
# for i in d:
# if i > r:
# if d.get(l-(i-r)):
# count-=2
# d[i] = None
# elif i < l:
# if d.get(r+l-i):
# count-=2
# d[i] = None
# else:
# if i-l == r-i:
# count-=1
# d[i] = None
# elif d.get(r-(i-l)):
# count-=2
# d[i] = None
if ans == -1:
ans = count
else:
ans = min(ans,count)
print(ans) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, k;
cin >> n >> m >> k;
cout << ((2 * n * m) - 2) << endl;
string f = "";
int flag = 0;
for (int i = 0; i < m; i++) {
if (flag == 0) {
for (int j = 0; j < n - 1; j++) {
f += "D";
}
if (i < m - 1) {
f += "R";
}
flag = 1;
} else {
for (int j = 0; j < n - 1; j++) {
f += "U";
}
if (i < m - 1) {
f += "R";
}
flag = 0;
}
}
int len = f.length();
for (int i = len - 1; i >= 0; i--) {
if (f[i] == 'D') {
f += "U";
}
if (f[i] == 'U') {
f += "D";
}
if (f[i] == 'L') {
f += "R";
}
if (f[i] == 'R') {
f += "L";
}
}
cout << f << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
string a, b;
int main(void) {
ios_base::sync_with_stdio(false);
cin >> a >> b;
if (a.size() != b.size()) {
cout << "NO" << endl;
return 0;
}
bool az = 1, bz = 1;
for (char c : a) {
if (c == '1') az = 0;
}
for (char c : b) {
if (c == '1') bz = 0;
}
bool ok = 1;
if (az and bz)
ok = 1;
else if (!az and !bz)
ok = 1;
else
ok = 0;
if (ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
//const ll MOD=998244353;
ll dp[111][5][5][5];
int main(){
int N; cin>>N;
dp[0][0][0][0]=1;
rep(i,N) rep(j,5) rep(k,5) rep(l,5){
rep(m,4) (dp[i+1][k][l][m+1]+=dp[i][j][k][l])%=MOD;
if((j==1&&k==3)||(j==1&&l==3)||(k==3&&l==1)||(k==1&&l==3)){
// AG GA
(dp[i+1][k][l][2]+=MOD-dp[i][j][k][l])%=MOD;
}
if(k==1&&l==2){
// AC
(dp[i+1][k][l][3]+=MOD-dp[i][j][k][l])%=MOD;
}
}
ll ans=0;
rep(i,4) rep(j,4) rep(k,4) (ans+=dp[N][i+1][j+1][k+1])%=MOD;
cout<<ans<<endl;
return 0;
} | 0 | CPP |
from sys import *
n = int(input())
tab = list(map(int, stdin.readline().split()))
a = 1000001*[0]
max = -1
min = 10000001
xstar = 0
b = 1000001*[0]
c = 1000001*[0]
for i in range(n):
x = tab[i]
a[x]+=1
if b[x] == 0:
b[x] = i+1
c[x] = i+1
if a[x] > max:
xstar = x
max = a[x]
min = c[x]-b[x]
elif a[x] == max and c[x]-b[x] < min:
xstar = x
max = a[x]
min = c[x]-b[x]
print(b[xstar], c[xstar])
| 8 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
s = set(a)
if len(s) > 3:
print("NO")
exit()
if len(s) < 3:
print("YES")
exit()
m = min(s)
M = max(s)
mid = sum(s) - M - m
if M - mid == mid - m:
print("YES")
else:
print("NO") | 8 | PYTHON3 |
a=input()
str=input()
print('YES' if a[0] in str or a[1] in str else 'NO')
| 7 | PYTHON3 |
#include <iostream>
using namespace std;
bool isPrime(int n) {
for (int p = 3; p * p <= n; p += 2) {
if (n % p == 0)
return false;
}
return true;
}
int main() {
int n;
cin >> n;
int c = 11;
cout << c;
for (int i = 1; i < n; ++i) {
c += 10;
while (!isPrime(c))
c += 10;
cout << " " << c;
}
cout << "\n";
return 0;
}
| 0 | CPP |
t=int(input())
for _ in range(t):
a,b,c,d=map(int,input().split())
if b>=a:
print(b)
else:
if d>=c:
print(-1)
else:
dd=1 if (a-b)%(c-d)!=0 else 0
print(b+c*((a-b)//(c-d)+dd))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
long long mod = (long long)998244353;
int n, m;
int a[111][111], sum[111];
std::vector<pair<int, int>> pv[111];
int main() {
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n; ++j) {
cin >> a[i][j];
sum[j] += a[i][j];
}
}
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n - 1; ++j) {
pv[j].push_back(make_pair(a[i][n] - a[i][j], i));
}
}
vector<int> ans;
for (int i = 1; i <= m; ++i) ans.push_back(i);
for (int i = 1; i <= n - 1; ++i) {
sort(pv[i].begin(), pv[i].end(), greater<pair<int, int>>());
int os = sum[n];
int ns = sum[i];
int dif = os - ns;
vector<int> tmp;
for (int j = 0; j < pv[i].size(); ++j) {
if (dif <= 0) break;
dif -= pv[i][j].first;
tmp.push_back(pv[i][j].second);
}
if (dif <= 0) {
if (tmp.size() < ans.size()) {
ans = tmp;
}
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); ++i) {
printf("%d%c", ans[i], i == ans.size() - 1 ? '\n' : ' ');
}
if (ans.size() == 0) {
cout << endl;
}
return 0;
}
| 11 | CPP |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int N, Q;
int main() {
while ( cin >> N >> Q && N ) {
map<int,string> start;
map<string,int> finish;
string name;
for ( int i = 0; i < N; i++ ) {
int local, western;
cin >> name >> local >> western;
start[western - local + 1] = name;
if ( finish[name] < western ) {
finish[name] = western;
}
}
for ( int i = 0; i < Q; i++ ) {
int western;
cin >> western;
bool ok = false;
for ( map<int,string>::iterator s = start.begin(); s != start.end(); s++ ) {
if ( s->first <= western && finish[s->second] >= western ) {
cout << s->second << " " << western - s->first + 1 << endl;
ok = true;
break;
}
}
if ( ! ok ) {
cout << "Unknown" << endl;
}
}
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int func(string s, vector<int> umap) {
int i, j, k = 0, ans = 0, y = s.length();
while (1) {
for (i = k; i < y; i++) {
if (s[i] == '0') break;
}
if (i == y)
return ans + i - k;
else if (i > k) {
ans += i + 1 - k;
k = i;
}
for (i = k; i < y; i++) {
if (s[i] == '1') break;
}
if (i == y) return ans;
int qq = 2 + upper_bound(umap.begin(), umap.end(), i - k) - umap.begin();
int f = 0;
if (y - i < qq) {
for (j = 1; i + j < y; j++) {
if (s[i + j] == '0') break;
}
if (i + j == y)
ans += 2 * (y - i) - 1;
else if (j == 1) {
ans += y - i;
f = 1;
} else {
f = 1;
ans += y - i + j;
}
} else {
int x = 1;
for (j = 1; j < qq; j++) {
if (s[i + j] == '1')
x = 2 * x + 1;
else
x = 2 * x;
}
if (x <= i - k + qq) ans++;
for (j = 1; j < qq; j++) {
if (s[i + j] == '0') break;
}
if (j == qq) {
if (i + qq != y) {
ans += 2 * (qq - 1);
if (s[i + j] == '0') ans++;
f = 1;
} else
ans += 2 * (qq - 1);
} else if (j == 1) {
ans += qq - 1;
f = 1;
} else {
ans += qq - 1 + j;
f = 1;
}
}
if (f == 0) break;
k = i + j;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int val = 1;
vector<int> umap;
for (int i = 2; i < 19; i++) {
umap.push_back(val);
val = 2 * val + i;
}
int q;
cin >> q;
while (q-- > 0) {
string s;
cin >> s;
cout << func(s, umap) << endl;
}
}
| 9 | CPP |
s=input()
t=input()
a=0
j=0
for i in range (len(t)):
if s[j]==t[i]:
a=a+1
j=j+1
print(a+1) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100100, M = 200200, P = 1000000007;
int ii, i, j, k, n, m, x, y, ans, nn, na, n1, ch, En, np;
long long t, a[M], s[N], v, ma, sum;
int h[N], dp[N], z[N], pw2[N], p[N];
struct edge {
int s, n;
long long v;
} E[M << 1];
void R(int &x) {
x = 0;
ch = getchar();
while (ch < '0' || '9' < ch) ch = getchar();
while ('0' <= ch && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
}
void R(long long &x) {
x = 0;
ch = getchar();
while (ch < '0' || '9' < ch) ch = getchar();
while ('0' <= ch && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
}
void E_add(int x, int y, long long v) {
E[++En].s = y;
E[En].v = v;
E[En].n = h[x];
h[x] = En;
E[++En].s = x;
E[En].v = v;
E[En].n = h[y];
h[y] = En;
}
void dfs(int x) {
p[++np] = x;
z[x] = 1;
for (int k = h[x]; k; k = E[k].n) {
if (!z[E[k].s]) {
dp[E[k].s] = dp[x] + 1;
s[E[k].s] = s[x] ^ E[k].v;
dfs(E[k].s);
} else {
if (dp[E[k].s] < dp[x]) {
long long t = s[x] ^ s[E[k].s] ^ E[k].v;
if (t) a[++na] = t;
}
}
}
}
int main() {
R(n);
R(m);
for (i = 1; i <= m; i++) {
R(x);
R(y);
R(v);
E_add(x, y, v);
if (v > ma) ma = v;
}
nn = 0;
while ((1ll << nn + 1) <= ma) nn++;
pw2[0] = 1;
for (i = 1; i <= nn; i++) pw2[i] = (pw2[i - 1] << 1) % P;
for (ii = 1; ii <= n; ii++)
if (!z[ii]) {
np = na = 0;
sum = 0;
dfs(ii);
for (i = 1; i <= na; i++) {
for (j = i + 1; j <= na; j++)
if (a[i] < a[j]) {
t = a[i];
a[i] = a[j];
a[j] = t;
}
if (!a[i]) break;
k = nn;
while (!(a[i] & 1ll << k)) k--;
for (j = 1; j <= na; j++)
if (j != i && (a[j] & 1ll << k)) a[j] ^= a[i];
}
na = i - 1;
for (i = 1; i <= na; i++) sum |= a[i];
for (i = nn; i >= 0; i--) {
if (sum & 1ll << i) {
ans = ((long long)np * (np - 1) / 2 % P * pw2[na - 1] % P * pw2[i] +
ans) %
P;
continue;
}
n1 = 0;
for (j = 1; j <= np; j++)
if (s[p[j]] & 1ll << i) n1++;
ans = ((long long)(np - n1) * n1 % P * pw2[na] % P * pw2[i] + ans) % P;
}
}
printf("%d\n", ans);
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
int dx8[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy8[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dxH[] = {2, 2, -2, -2, 1, 1, -1, -1};
int dyH[] = {1, -1, 1, -1, 2, -2, 2, -2};
const double GRS = (1 + sqrt(5)) / 2;
template <typename T>
T power(T X, T P) {
T ans = (T)1;
for (T i = 1; i <= P; i++) {
ans = ans * X;
}
return ans;
}
template <typename T>
T ABS(T A, T B) {
T ret = A - B;
if (ret < 0) return -ret;
return ret;
}
const long long MOD = 1000000007;
const long long BIGMAX = power(2, 63) - 1;
template <typename T>
T ADD(T X, T Y, T M) {
if (X + Y < 0)
return (X - M) + Y;
else if (X + Y >= M)
return X + Y - M;
else
return X + Y;
}
template <typename T>
T prod(T a, T b, T c) {
T x = 0, y = a % c;
while (b > 0) {
if (b % 2 == 1) {
x = ADD(x, y, c);
}
y = (y * 2) % c;
b /= 2;
}
return x % c;
}
template <typename T>
T bigmod(T a, T b, T c) {
T x = (T)1, y = a % c;
while (b > 0) {
if (b % (T)2 == (T)1) {
x = (x * y) % c;
}
y = (y * y) % c;
b /= (T)2;
}
return x;
}
template <typename T>
T MODINVERSE(T a) {
return bigmod(a, MOD - 2);
}
template <typename T>
T GCD(T x, T y) {
while (y != 0) {
T z = x % y;
x = y;
y = z;
}
return x;
}
bool isvowel(char ch) {
ch = toupper(ch);
if (ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U' ||
ch == 'Y')
return true;
return false;
}
template <typename T>
T isleap(T year) {
if (year % (T)400 == (T)0 || (year % (T)100 != (T)0 && year % (T)4 == (T)0))
return true;
return false;
}
int main() {
int test;
scanf("%d", &test);
for (int caseno = 1; caseno <= test; caseno++) {
long long x, y, p, q;
scanf("%lld %lld %lld %lld", &x, &y, &p, &q);
long long lo = 0, hi = 1000000000LL, mid, ans = -1;
int cnt = 200;
while (cnt--) {
mid = (lo + hi) / 2;
long long Xval = p * mid;
long long Yval = q * mid;
long long needX = Xval - x;
long long needY = Yval - y;
if (needX >= 0 && needY >= 0 && needX <= needY) {
hi = mid - 1;
ans = Yval - y;
} else {
lo = mid + 1;
}
}
printf("%lld\n", ans);
}
}
| 9 | CPP |
import math
def prime(p):
if p==1:
return 0
if p==2 or p==3:
return 1
if p%2==0 or p%3==0:
return 0
for i in range(5,int(math.sqrt(p))+1,6):
if p%i==0 or p%(i+2)==0:
return 0
return 1
for _ in range(int(input())):
n,k=map(int,input().split())
if n<=k:
print(1)
elif prime(n):
print(n)
else:
minipack=math.inf
for i in range(1,min(int(math.sqrt(n))+1,k+1)):
if n%i==0:
minipack=n//i
if n//i<=k:
minipack=i
break
print(minipack) | 10 | PYTHON3 |
input()
a = list(map(int,input().split()))
input()
b = list(map(int,input().split()))
A = set(a)
B = set(b)
print(1 if B <= A else 0)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int T, n, ans[100010];
int a[100010];
struct node {
int x, id;
node(int _x, int _i) {
x = _x;
id = _i;
}
bool operator<(const node &a) const {
if (x == a.x)
return id > a.id;
else
return x < a.x;
}
};
priority_queue<node> q;
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (register int i = 1; i <= n; ++i) q.push(node(a[i], i));
for (register int i = 1; i <= n; ++i) ans[i] = -1;
for (int i = n; i; --i) {
while (!q.empty() && q.top().x > a[i]) {
ans[q.top().id] = max(ans[q.top().id], i - q.top().id - 1);
q.pop();
}
}
for (register int i = 1; i <= n; ++i) cout << ans[i] << " ";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x;
cin >> x;
int p;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
int f = 0;
int flag = 1;
int t;
int min1 = 501;
if (a[(n + 1) / 2 - 1] == x) {
t = (n + 1) / 2;
flag = 0;
} else {
for (int i = 0; i < n; i++) {
if (a[i] == x) {
if (abs((i + 1) - (n + 1) / 2) < min1) {
min1 = abs((i + 1) - (n + 1) / 2);
t = i + 1;
}
flag = 0;
}
}
if (flag) {
p = upper_bound(a, a + n, x) - a;
if (p > n - 1) {
cout << n + 1;
f = 1;
} else {
t = p + 1;
n = n + 1;
}
}
}
if (f == 0 and flag == 0)
cout << min(abs((n - t) - t), abs((t - 1) - (n - t)));
else if (f == 0 and flag == 1)
cout << 1 + min(abs((n - t) - t), abs((t - 1) - (n - t)));
return 0;
}
| 9 | CPP |
n=input()
count=len(set(n))
if(count%2==0):
print("CHAT WITH HER!")
else:
print("IGNORE HIM!") | 7 | PYTHON3 |
#!/usr/bin/python3
d1,d2,d3 = [int(x) for x in input().strip().split()]
print(min(d1+d2+d3,2*d1+2*d2,2*(d1+d3),2*(d2+d3)))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int q, n, m;
pair<int, int> row[50001], col[50001];
set<int> row_white[50001];
char c;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> q;
for (int st = 1; st <= q; st++) {
cin >> n >> m;
for (int i = 1; i <= n; i++) row[i] = {0, i};
for (int i = 1; i <= m; i++) col[i] = {0, i};
for (int i = 1; i <= n; i++) {
row_white[i].clear();
for (int j = 1; j <= m; j++) {
cin >> c;
if (c == '*') {
row[i].first++;
col[j].first++;
} else
row_white[i].insert(j);
}
}
sort(row + 1, row + n + 1);
sort(col + 1, col + m + 1);
int ans = m - row[n].first + n - col[m].first;
if (row[n].first == m || col[m].first == n) {
cout << ans << endl;
continue;
}
bool found = false;
for (int i = n; i >= 1; i--) {
if (row[i].first != row[n].first) break;
for (int j = m; j >= 1; j--) {
if (col[j].first != col[m].first) break;
if (row_white[row[i].second].find(col[j].second) !=
row_white[row[i].second].end()) {
ans--;
found = true;
break;
}
}
if (found) break;
}
cout << ans << endl;
}
}
| 8 | CPP |
dico = {"R":(1,0),"L":(-1,0),"U":(0,1),"D":(0,-1)}
rdico = {"R":(-1,0),"L":(1,0),"U":(0,-1),"D":(0,1)}
def make_move(x,y,m,fn = False):
if not fn:
return (x+dico[m][0],y+dico[m][1])
return (x+rdico[m][0],y+rdico[m][1])
def main():
q = int(input())
for _ in range(q):
n = int(input())
s = input()
dico = {"0:0":0}
x,y = 0,0
sols = []
for xi in range(n):
x,y = make_move(x,y,s[xi])
o = str(x) + ":" + str(y)
if o in dico:
sols.append((xi-dico[o]+1,dico[o],xi))
dico[o] = xi+1
sols.sort(key = lambda x: x[0])
if len(sols) == 0:
print(-1)
continue
print(sols[0][1]+1,sols[0][2]+1)
main()
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long double epsilon = 1e-9;
void func(double n, double mu) {
map<double, int> m;
for (double i = 1.0; i < n + epsilon; i++)
for (double j = 1.0; j < mu + epsilon; j++) {
if (i * i - j > -epsilon) {
m[-i - sqrt(i * i - j)]++;
m[-i + sqrt(i * i - j)]++;
}
}
cout << "Size: " << +m.size() << endl;
for (map<double, int>::iterator itr = m.begin(); itr != m.end(); ++itr) {
if (itr->second > 1) {
cout << itr->first << ": " << itr->second << endl;
}
}
}
int main() {
long long b, c;
cin >> b >> c;
long long lim = min(2 * b - 1, c);
long long ans = 0;
long long t;
for (long long a = 1; a <= b; a++) {
ans += min(a * a, c) * 2;
}
long long p;
bool bu;
int odd;
for (long long a = 1; a <= lim; a++) {
odd = (a % 2 == 1);
bu = false;
if (a * a <= c && (a + a) <= 2 * b) {
bu = true;
ans -= 1;
}
p = min((2 * b - a + odd) / 2, (c / a + odd) / 2);
if (p > 0) {
ans -= p;
bu = true;
}
if (bu) ans += 1;
}
cout << ans << endl;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a[50], b, max(0), count(1);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
cin >> m;
for (int i = 0; i < m; ++i) {
cin >> b;
for (int j = 0; j < n; ++j) {
if (b % a[j] == 0) {
int x = b / a[j];
if (x > max) {
max = x;
count = 1;
} else if (x == max) {
count += 1;
}
break;
}
}
}
cout << count << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 9;
int dx[9] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
int dy[9] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
char mp[N][N];
int dfs(int x, int y, int dep) {
int i;
if (dep == 9) return 1;
for (i = 0; i < 9; i++) {
int xx = x + dx[i];
int yy = y + dy[i];
if (xx < 1 || xx > 8 || yy < 1 || yy > 8 ||
xx >= dep && mp[xx - dep + 1][yy] == 'S' ||
xx >= dep - 1 && mp[xx - dep][yy] == 'S')
continue;
if (dfs(xx, yy, dep + 1)) return 1;
}
return 0;
}
int main() {
int i, j;
for (i = 1; i <= 8; i++) scanf("%s", mp[i] + 1);
if (dfs(8, 1, 1))
printf("WIN\n");
else
printf("LOSE\n");
}
| 7 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.