solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x) {
x = 0;
char c;
for (c = getchar(); !isdigit(c); c = getchar())
;
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
}
const int N = 1e6 + 60, P = 1e9 + 7;
int mul(int a, int b) { return 1ll * a * b % P; }
int add(int a, int b) {
a += b;
return a >= P ? a - P : a;
}
int sub(int a, int b) {
a -= b;
return a < 0 ? a + P : a;
}
int nn, n = 50, m = 50, a[5];
int main(int argc, char *argv[]) {
for (int i = 1; i <= (4); ++i) scanf("%d", a + i);
;
printf("%d %d\n", n, m);
--a[3], --a[4];
while (a[1] || a[2] || a[3]) {
for (int i = 1; i <= (n); ++i) printf("D");
puts("");
printf("D");
int prv = 0;
for (int i = 2; i <= (n); ++i) {
if (!a[1] && !a[2] && !a[3])
printf("D"), prv = 0;
else {
int z = prv % 3 + 1;
while (!a[z]) z = z % 3 + 1;
if (z == prv) {
printf("D");
prv = 0;
} else {
printf("%c", 'A' - 1 + z);
--a[z];
prv = z;
}
}
}
puts("");
for (int i = 1; i <= (n); ++i) printf("D");
puts("");
nn += 3;
}
while (a[4]) {
for (int i = 1; i <= (n); ++i) printf("C");
puts("");
printf("C");
for (int i = 2; i <= (m); ++i) {
if (i % 2 == 1 || !a[4])
printf("C");
else
printf("D"), --a[4];
}
puts("");
for (int i = 1; i <= (n); ++i) printf("C");
puts("");
nn += 3;
}
for (int i = nn + 1; i <= (n); ++i) {
for (int i = 1; i <= (m); ++i) printf("C");
puts("");
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)1e18;
const long long mod = (long long)1e9 + 7;
const double eps = (double)1e-9;
const double pi = acos(-1.0);
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
const int N = 100500;
int q;
string name;
struct node {
int sum;
node *l, *r;
node(){};
node(int x) {
sum = x;
l = r = NULL;
}
};
node *root[N];
struct bor {
int id;
bor *nxt[26];
bor(){};
bor(int x) {
id = x;
for (int i = 0; i < 26; i++) nxt[i] = NULL;
}
};
bor *rtbor[N];
inline void clone(node *&nw, node *&pr) {
if (!nw) nw = new node(0);
if (!pr) pr = new node(0);
nw->sum = pr->sum;
nw->l = pr->l;
nw->r = pr->r;
}
inline int getsum(node *&v) { return (v ? v->sum : 0); }
inline void upd(node *&v) {
if (v) v->sum = getsum(v->l) + getsum(v->r);
}
node *upd(node *&v, int l, int r, int pos, int add) {
if (!v) v = new node(0);
node *u = new node(0);
clone(u, v);
if (l == r) {
u->sum += add;
return u;
}
int mid = (l + r) >> 1;
if (pos <= mid)
u->l = upd(v->l, l, mid, pos, add);
else
u->r = upd(v->r, mid + 1, r, pos, add);
upd(u);
return u;
}
int get(node *&v, int l, int r, int lx, int rx) {
if (!v || rx < l || r < lx) return 0;
if (lx <= l && r <= rx) return v->sum;
int mid = (l + r) >> 1;
return get(v->l, l, mid, lx, rx) + get(v->r, mid + 1, r, lx, rx);
}
inline int getid(bor *v) {
if (!v) return -1;
for (int i = 0; i < (int)name.size(); i++) {
v = v->nxt[name[i] - 'a'];
if (!v) return -1;
}
return v->id;
}
inline void clone1(bor *&nw, bor *&pr) {
if (!nw) nw = new bor(-1);
if (!pr) pr = new bor(-1);
nw->id = pr->id;
for (int i = 0; i < 26; i++) nw->nxt[i] = pr->nxt[i];
}
bor *upd(bor *&v, int val, int pos) {
if (!v) v = new bor(-1);
bor *u = new bor(-1);
clone1(u, v);
if (pos == (int)name.size()) {
u->id = val;
return u;
}
u->nxt[name[pos] - 'a'] = upd(v->nxt[name[pos] - 'a'], val, pos + 1);
return u;
}
inline string getstr() {
char c[20];
scanf("%s", c);
int len = (int)strlen(c);
string res = "";
for (int i = 0; i < len; i++) res += c[i];
return res;
}
int main() {
scanf("%d", &q);
for (int i = 0; i <= q; i++) {
root[i] = NULL;
rtbor[i] = NULL;
}
for (int i = 1; i <= q; i++) {
string tp = getstr();
clone(root[i], root[i - 1]);
clone1(rtbor[i], rtbor[i - 1]);
if (tp == "set") {
name = getstr();
int was = getid(rtbor[i]);
if (was != -1) root[i] = upd(root[i], 1, (int)1e9, was, -1);
int nw;
scanf("%d", &nw);
root[i] = upd(root[i], 1, (int)1e9, nw, 1);
rtbor[i] = upd(rtbor[i], nw, 0);
} else if (tp == "remove") {
name = getstr();
int curid = getid(rtbor[i]);
if (curid != -1) {
root[i] = upd(root[i], 1, (int)1e9, curid, -1);
rtbor[i] = upd(rtbor[i], -1, 0);
}
} else if (tp == "query") {
name = getstr();
int curid = getid(rtbor[i]);
int ans = -1;
if (curid != -1) {
ans = 0;
if (curid > 1) ans = get(root[i], 1, (int)1e9, 1, curid - 1);
}
printf("%d\n", ans);
fflush(stdout);
} else {
int dif;
scanf("%d", &dif);
clone(root[i], root[i - dif - 1]);
clone1(rtbor[i], rtbor[i - dif - 1]);
}
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
void CF() {
int t;
cin >> t;
while (t--) {
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
int Aa[a], Bb[b];
for (int i = 0; i < (a); ++i) cin >> Aa[i];
for (int i = 0; i < (b); ++i) cin >> Bb[i];
int Nn[n];
for (int i = 0; i < (n); ++i) Nn[i] = 0;
for (int i = 0; i < (a); ++i) {
Nn[Aa[i] - 1] = 1;
}
for (int i = 0; i < (b); ++i) {
if (Nn[Bb[i] - 1] == 0) {
Nn[Bb[i] - 1] = 2;
}
}
for (int i = 0; i < (n); ++i) cout << Nn[i] << " ";
return 0;
}
| 7 | CPP |
def r1(t):
return t(input())
def r2(t):
return [t(i) for i in input().split()]
for _ in range(int(input())):
n = r1(int)
a = r2(int)
o = []
e = []
for i in range(2*n):
if a[i] % 2 == 0:
e.append(i + 1)
else:
o.append(i + 1)
co = 0
ce = 0
if len(o) % 2 == 1:
co += 1
ce += 1
else:
if len(e) > 1:
ce += 2
else:
co += 2
for i in range(n - 1):
if ce < len(e):
print(e[ce], e[ce + 1])
ce += 2
else:
print(o[co], o[co + 1])
co += 2
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
const T INF = (is_same<T, int>::value ? 1e9 : 1e18);
template <typename T>
inline T mod(T n, T mod) {
T res = n % mod;
if (res < 0) res += mod;
return res;
}
const int N = 1e6 + 5;
vector<int> adj[N], g[N], stk;
int tin[N], low[N], comp[N], tempo, idComp, degree[N];
void tarjan(int v) {
tin[v] = low[v] = ++tempo;
stk.emplace_back(v);
for (int u : adj[v]) {
if (!tin[u]) tarjan(u);
if (comp[u] == -1) {
low[v] = min(low[v], low[u]);
}
}
if (tin[v] == low[v]) {
idComp++;
while (1) {
int u = stk.back();
stk.pop_back();
comp[u] = idComp;
if (u == v) break;
}
}
}
void init(int n) {
tempo = 0, idComp = 0;
for (int i = 1; i <= n; i++) {
adj[i].clear();
tin[i] = low[i] = degree[i] = 0;
comp[i] = -1;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
init(n);
vector<int> a(m), b(m);
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
adj[a[i]].push_back(b[i]);
}
for (int i = 1; i <= n; i++) {
if (!tin[i]) {
tarjan(i);
}
}
if (idComp == 1) {
cout << "No\n";
continue;
}
for (int i = 0; i < m; i++) {
if (comp[a[i]] != comp[b[i]]) {
degree[comp[b[i]]]++;
}
}
int idxPlayers = 0;
for (int i = 1; i <= idComp; i++) {
if (!degree[i]) {
idxPlayers = i;
break;
}
}
vector<int> p, jud;
for (int i = 1; i <= n; i++) {
if (comp[i] == idxPlayers)
p.push_back(i);
else
jud.push_back(i);
}
if (!((int)(p).size()) or !((int)(jud).size())) {
cout << "No\n";
continue;
}
cout << "Yes\n";
cout << ((int)(jud).size()) << ' ' << ((int)(p).size()) << '\n';
for (int x : jud) {
cout << x << ' ';
}
cout << '\n';
for (int x : p) {
cout << x << ' ';
}
cout << '\n';
}
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
void isort(int a[], int n) {
int i, j, t;
for (i = 0; i < n; i++) {
for (j = i; j < n; j++) {
if (a[i] < a[j]) {
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
}
int main() {
int n, a[100], i, sum;
while (scanf("%d", &n) == 1) {
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
isort(a, n);
while (a[0] != a[n - 1]) {
i = 1;
while (a[0] == a[i]) {
i++;
}
a[0] = a[0] - a[i];
isort(a, n);
}
sum = 0;
for (i = 0; i < n; i++) {
sum += a[i];
}
printf("%d\n", sum);
}
return 0;
}
| 7 | CPP |
b = int(input())
boys = list(map(int, input().split()))
g = int(input())
girls = list(map(int, input().split()))
boys.sort()
girls.sort()
cnt = 0
for y in boys:
for x in girls:
if abs(y - x) < 2:
cnt += 1
girls.remove(x)
break
print(cnt) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
long long res = 0LL, rep[9];
int i, j;
cin >> N;
for (i = 0; i < 9; i++) rep[i] = 0LL;
for (i = 0; i < 9; i++) rep[i] = N / 9LL;
for (i = N % 9; i; i--) rep[i]++;
;
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++) res += rep[i] * rep[j] * rep[(i * j) % 9];
for (i = 1; i <= N; i++) {
res -= N / i;
}
cout << res << endl;
return 0;
}
| 9 | CPP |
t = int(input())
for i in range(t):
hh, mm = map(int, input().split())
print(24 * 60 - mm - hh * 60) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, l, r;
cin >> n;
cin >> l;
cin >> r;
long long minx = pow(2, l) - 1;
minx += (n - l);
long long maxx = 1;
int i = 1, k = 2;
while (i < r) {
maxx += k;
k = k * 2;
i++;
}
maxx += (n - r) * k / 2;
cout << minx << " " << maxx;
return 0;
}
| 8 | CPP |
# import collections
# import random
# import math
# import itertools
# import math
# import math
#import bisect
# from collections import defaultdict
# import itertools
# from sys import stdin, stdout
# import math
# import math
# import bisect
# import bisect
# import collections
# import itertools
# import math
# import collections
# import itertools
# import math
import bisect
import collections
import math
import sys
# import operator
# from decimal import Decimal
# sys.setrecursionlimit(10**6)
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
def li(): return [int(i) for i in input().split()]
def lli(rows): return [li() for _ in range(rows)]
def si(): return input()
def ii(): return int(input())
def ins(): return input().split()
# mod = 10**9+7
# fval = [1]
# for i in range(1,200001):
# x = (fval[-1]*i)%mod
# fval.append(x)
#
# ifac = [1]*(200001)
# ifac[200000] = pow(fval[200000], -1, mod)
# for i in range(200000-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%mod
# _________________ For taking Input from the Text Files __________________
# import os.path
#
# if (os.path.exists('input.txt')):
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
# sys.stderr = open("error.txt", "w")
def drank(d, processing, da, rank):
tmp = 10 ** 9
if len(d[da]) == 1:
return 1
for di in d[da]:
if processing[di - 1] == 0:
processing[di - 1] = 1
tmp = min(tmp, drank(d, processing, di, rank))
processing[di - 1] = 0
rank[da - 1] = tmp + 1
return tmp + 1
def binary_search(n, a):
l = len(a)
low = 0
high = l-1
while high>=low:
mid = (high+low)//2
if a[mid] == n:
return mid
elif a[mid]>n:
high = mid-1
else:
low = mid+1
return -1
is_prime = [True]*(10**6+1)
def primeseive(n):
is_prime[0] = is_prime[1] = False
i = 2
while i*i<=n:
if is_prime[i] == True:
for j in range(i*i,n+1,i):
is_prime[j] = False
i+=1
#
# m ,n = li()
# p = [li() for i in range(m)]
# print(p)
# a = []
# if m<n:
# for i in range(n):
# z = [p[j][i] for j in range(m)]
# a.append(max(z))
# return min(a)
# else:
# x = 0
def solve():
n= II()
a = SI()
b = SI()
similar = 0
onesimilar = 0
onedisimilar = 0
for i in range(n):
if a[i]==b[i]:
similar+=1
if a[i]== '1':
onesimilar += 1
else:
if a[i] == '1':
onedisimilar+=1
disimilar = n - similar
zerosimilar = similar - onesimilar
zerodisimilar = disimilar - onedisimilar
x = n*100
y = n*100
if onesimilar-zerosimilar == 1:
x = similar
if onedisimilar == zerodisimilar:
y = disimilar
if x == y == n*100:
return -1
else:
return min(x,y)
def main():
#primeseive(10**6)
#print(is_prime)
for _ in range(II()):
#si()
#print(solve(), flush=True)
sys.stdout.write(str(solve()) + "\n")
#print(solve())
# z += str(ans) + '\n'
# print(len(ans), ' '.join(map(str, ans)), sep='\n')
# stdout.write(z)
# for interactive problems
# print("? {} {}".format(l,m), flush=True)
# or print this after each print statement
# sys.stdout.flush()
if __name__ == "__main__":
main() | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, m;
long long arr[55];
long long arr1[55];
int32_t main() {
scanf("%lld", &n);
scanf("%lld", &m);
for (long long i = 1; i <= n; i++) {
scanf("%lld", &arr[i]);
}
for (long long i = 1; i <= m; i++) {
scanf("%lld", &arr1[i]);
}
long long mx = -1000000000000000009;
long long p;
for (long long i = 1; i <= m; i++) {
for (long long j = 1; j <= n; j++) {
long long t = arr1[i] * arr[j];
if (t > mx) {
mx = t;
p = j;
}
}
}
arr[p] = 1000000009;
mx = -1000000000000000009;
for (long long i = 1; i <= m; i++) {
for (long long j = 1; j <= n; j++) {
if (arr[j] != 1000000009) {
long long t = arr1[i] * arr[j];
if (t > mx) {
mx = t;
}
}
}
}
printf("%lld", mx), printf("\n");
return 0;
}
| 7 | CPP |
# Author: S Mahesh Raju
# Username: maheshraju2020
# Date: 03/07/2020
from sys import stdin,stdout
from math import gcd, ceil, sqrt
from collections import Counter
ii1 = lambda: int(stdin.readline().strip())
is1 = lambda: stdin.readline().strip()
iia = lambda: list(map(int, stdin.readline().strip().split()))
isa = lambda: stdin.readline().strip().split()
mod = 1000000007
a, n, m = iia()
rain = []
for _ in range(n):
l, r = iia()
for i in range(l, r):
rain.append(i)
umb = []
for _ in range(m):
umb.append(iia())
rain.sort()
umb.sort()
dp = [0] * (a + 1)
for i in range(a + 1):
if i not in rain:
if i != 0:
dp[i] = dp[i - 1]
else:
for j in umb:
if j[0] <= i:
temp = (i + 1 - j[0]) * j[1]
if j[0] - 1 >= 0:
temp += dp[j[0] - 1]
if dp[i] > 0:
dp[i] = min(dp[i], temp)
else:
dp[i] = temp
else:
break
# print(dp)
if umb[0][0] > rain[0]:
print(-1)
else:
print(dp[-1])
| 12 | PYTHON3 |
n=int(input())
arr1=list(map(int,input().split()))
arr2=list(map(int,input().split()))
arr2.sort(reverse=True)
for i in range(1,n+1):
arr1[i-1]=arr1[i-1]*i*(n-i+1)
arr1.sort()
#print(arr1,arr2)
sum=arr1[0]*arr2[0]
for i in range(1,n):
sum+=arr1[i]*arr2[i]
print(sum%998244353) | 11 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
while(cin>>s){
int joi=0,ioi=0;
for(int i=0;i<s.size()-2;i++){
if(s.substr(i,3)=="JOI")
joi++;
if(s.substr(i,3)=="IOI")
ioi++;
}
cout<<joi<<endl<<ioi<<endl;
}
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
bool vowel(char x) {
return x == 'A' || x == 'E' || x == 'I' || x == 'O' || x == 'U' || x == 'Y';
}
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> a(s.size() + 1);
for (int i = 0; i < s.size(); ++i) {
a[i + 1] = vowel(s[i]) + a[i];
}
ll sum = a[n];
double ans = 0;
for (int len = 1; len <= n; ++len) {
ans += sum / (double)len;
if (len * 2 < n) {
int l = len + 1, r = n - len;
sum += a[r] - a[l - 1];
} else {
int l = n - len + 1, r = len;
sum -= a[r] - a[l - 1];
}
}
cout.precision(10);
cout << fixed << ans;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, h;
cin >> n >> h;
vector<pair<long long, long long> > a;
long long t1, t2;
vector<pair<long long, long long> > loss(n);
vector<long long> pref(n, 0);
std::vector<pair<long long, long long> >::iterator it;
long long tl = 0;
loss[0].first = 0;
loss[0].second = 0;
for (int i = 0; i < n; i++) {
cin >> t1 >> t2;
a.push_back({t1, t2});
if (i > 0) {
loss[i].first = loss[i - 1].first + a[i].first - a[i - 1].second;
loss[i].second = i;
pref[i] = pref[i - 1] + a[i].second - a[i].first;
} else {
pref[i] = a[i].second - a[i].first;
}
}
long long cl = 0, answer = 0, dd = 0;
for (int i = 0; i < n; i++) {
if (i != 0) {
cl += a[i].first - a[i - 1].second;
}
pair<long long, long long> xx = {cl + h - 1, dd};
it = lower_bound(loss.begin(), loss.end(), xx);
if (cl + h > loss[n - 1].first) {
long long tt = h + pref[n - 1];
if (i > 0) tt -= pref[i - 1];
answer = max(answer, tt);
} else {
pair<long long, long long> d1 = *it;
int d = d1.second;
if (loss[d1.second].first > cl + h - 1) {
d--;
}
long long tt = h + pref[d];
if (i > 0) tt -= pref[i - 1];
answer = max(answer, tt);
}
}
cout << answer << endl;
return 0;
}
| 10 | CPP |
n=int(input())
if(n%2==0 and n!=2 and n>0):
print("YES")
else:
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int K = 30000000 - 1;
const ll M = ll(1e9) + 7;
int n, s[K + 1];
ll ans;
ll pw(ll n, ll k){
if(k == 1) return n;
return pw(n * n % M, k / 2) * (k % 2 ? n : 1) % M;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin >> n;
for(int i = 1, j = 0, k = 1, t = 0; i <= K; i++){
for(; k <= i; ){ k *= 10; j++; }
s[i] = s[i - 1] + j;
for(; s[i] - s[t + 1] >= n; ) t++;
if(t >= 9999999) break;
if(s[i] - s[t] == n) ans++;
}
ll t = ll(9e7);
for(int i = 8; i <= n / 100; i++, t = t * 10 % M){
if(n % i) continue;
ans = (ans + t - (n / i) + 1 + M) % M;
}
for(int i = 1; i <= 99; i++){
if(n % i) continue;
if(n / i < 8) continue;
ans = (ans + 9 * pw(10, n / i - 1) - i + 1 + M) % M;
}
for(int i = 8; i <= n / 2; i++){
int q = n / i, r = n % i;
if(q > r){
ans = (ans + (q - r - 1) / (i + 1) + 1) % M;
if(!r) ans = (ans + M - 1) % M;
}
}
cout << ans << endl;
} | 0 | CPP |
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]
for _ in range(inp()):
n = inp()
x = ip()
dp = [0]*n
for i in range(n):
if x[i] != i+1:
dp[i] = 1
ct = 0
prev = -1
#print(dp)
for i in range(n):
if dp[i] == 1 and prev != 1:
ct += 1
prev = dp[i]
if ct in [0,1]:
print(ct)
else:
print(2)
| 9 | PYTHON3 |
s = list(input())
set_ = set(s)
if not((("N" in set_) ^ ("S" in set_))) and not((("W" in set_) ^ ("E" in set_))):
print("Yes")
else:
print("No") | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
if (n < 5 || n % 2 == 0)
cout << "NO" << endl;
else {
cout << 1 << " " << (n - 3) / 2 << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
int temp = ceil(n / 2.0);
if (n % 2 == 0) temp++;
cout << (k / temp) << endl;
}
}
| 7 | CPP |
#include <stdio.h>
int main(){
int n,i,f[10000],now=2;
bool flag;
f[0]=2;
f[1]=3;
for(i=5;i<60000;i+=2){
flag=true;
for(int j=1;f[j]*f[j]<=i&&flag;j++){
if(i%f[j]==0)flag=false;
}
if(flag){
f[now]=i;
now++;
}
}
while(scanf("%d",&n)!=EOF){
for(i=0;f[i]<n;i++);
if(f[i]==n)printf("%d %d\n",f[i-1],f[i+1]);
else printf("%d %d\n",f[i-1],f[i]);
}
} | 0 | CPP |
H,W = map(int, input().split())
fields = [list(input()) for i in range(H)]
# print(fields)
# seen = [False] * (H*W+1)
seen = [[False] * W for i in range(H)]
mv = [(0,1),(0,-1),(1,0),(-1,0)]
from collections import deque
from collections import defaultdict
ans = 0
for i in range(H):
for j in range(W):
if seen[i][j]: continue
# print("i,j",i,j)
d = defaultdict(int)
q = deque()
q.append((i,j))
# d[fields[i][j]] += 1
while len(q) > 0:
h,w = q.popleft()
s = fields[h][w] #そこの文字列
for dh, dw in mv:
if 0 <= h + dh < H and 0 <= w + dw < W:
if seen[h+dh][w+dw]:continue
t = fields[h+dh][w+dw] #隣接セルの文字
if t == s:continue #同じ場合は加算せず
# print(s,t,h,w,h+dh,w+dw,"debug")
d[s] += 1
q.append((h+dh,w+dw))
seen[h+dh][w+dw] = True
ans += d["#"]*d["."]
# print(seen)
print(ans) | 0 | PYTHON3 |
s=[int(i) for i in input().split(" ")]
a=s[0]
b=s[1]
print((a*b)//2)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int row[111], col[111];
int ans[111][111];
int main() {
memset(ans, 0, sizeof(ans));
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf("%d", &row[i]);
for (int i = 0; i < m; i++) scanf("%d", &col[i]);
for (int i = 0; i < m; i++) ans[n - 1][i] = col[i];
for (int i = n - 1; i > 0; i--) {
int tmp[32], temp = 0;
memset(tmp, 0, sizeof(tmp));
for (int j = 0; j < 32; j++) {
for (int k = 0; k < m; k++) {
if ((1 << j) & ans[i][k]) tmp[j] = (tmp[j] + 1) % 2;
}
if (tmp[j]) temp |= (1 << j);
}
temp ^= row[i];
for (int j = 0; j < 32; j++) {
if (((1 << j) & temp) == 0) continue;
ans[i][0] ^= (1 << j);
ans[i - 1][0] ^= (1 << j);
}
}
if (ans[0][0] == row[0]) {
puts("YES");
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) printf("%d ", ans[i][j]);
puts("");
}
} else
puts("NO");
return 0;
}
| 10 | CPP |
from math import factorial
from operator import mul
from functools import reduce
def comb2(n,r):
r = min(n - r, r)
if r == 0: return 1
over = reduce(mul, range(n, n - r, -1))
under = reduce(mul, range(1, r + 1))
return over // under
def pff(m):
pf = {}
for i in range(2, int(m ** 0.5) + 1):
while m % i == 0:
pf[i] = pf.get(i, 0) + 1
m //= i
if m > 1: pf[m] = 1
return pf
N, M = map(int, input().split())
L = pff(M)
anst = int(1)
for i in L.values():
anst *= comb2(i+N-1, i)
anst = anst%1000000007
ans = anst
print(ans) | 0 | PYTHON3 |
# @oj: codeforces
# @id: hitwanyang
# @email: [email protected]
# @date: 2020-10-31 15:51
# @url:https://codeforc.es/contest/1165/problem/E
import sys,os
from io import BytesIO, IOBase
import collections,itertools,bisect,heapq,math,string
from decimal import *
# region fastio
BUFSIZE = 8192
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# ------------------------------
## 注意嵌套括号!!!!!!
## 先有思路,再写代码,别着急!!!
## 先有朴素解法,不要有思维定式,试着换思路解决
## 精度 print("%.10f" % ans)
## sqrt:int(math.sqrt(n))+1
## 字符串拼接不要用+操作，会超时
## 二进制转换:bin(1)[2:].rjust(32,'0')
## array copy:cur=array[::]
## oeis:example 1, 3, _, 1260, _, _, _, _, _, 12164510040883200
def main():
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
sb=sorted(b,reverse=True)
val=[]
for i in range(n):
val.append((i+1)*(n-i)*a[i])
sv=sorted(val)
for i in range(n):
ans+=sv[i]*sb[i]
print (ans%998244353)
if __name__ == "__main__":
main() | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, s, q;
cin >> t >> s >> q;
int count = 0;
while (s < t) {
s *= q;
count++;
}
cout << count;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool chmin(T &a, const T &b) {
return a > b ? a = b, true : false;
}
template <typename T>
bool chmax(T &a, const T &b) {
return a < b ? a = b, true : false;
}
const long long P = 998244353;
const int maxK = 5000 + 5;
long long qpow(long long a, long long b) {
long long r = 1;
while (b) {
if (b & 1) (r *= a) %= P;
(a *= a) %= P;
b >>= 1;
}
return r;
}
long long n, m;
int k;
long long fac[maxK], ifac[maxK];
long long C(int n, int k) {
if (k < 0 || k > n)
return 0;
else
return fac[n] * ifac[k] % P * ifac[n - k] % P;
}
long long falling(long long n, int k) {
long long r = 1;
while (k--) r = r * n % P, n--;
return r;
}
long long S[2][maxK];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> k;
long long im = qpow(m, P - 2);
long long im1 = qpow(m - 1, P - 2);
if (m == 1) {
cout << qpow(n, k) << endl;
return 0;
}
fac[0] = 1;
for (int i = 1; i <= k; ++i) fac[i] = fac[i - 1] * i % P;
ifac[k] = qpow(fac[k], P - 2);
for (int i = k - 1; i >= 0; --i) ifac[i] = ifac[i + 1] * (i + 1) % P;
memset(S, 0, sizeof(S));
{
for (int n = 1; n <= k; ++n) {
S[n & 1][1] = 1;
for (int i = 2; i <= n; ++i) {
S[n & 1][i] = (S[(n - 1) & 1][i - 1] + S[(n - 1) & 1][i] * i) % P;
}
}
}
long long ans = 0;
long long falling = 1;
for (int j = 1; j <= k && j <= n; ++j) {
falling = falling * (n - j + 1) % P;
(ans += S[k & 1][j] * falling % P * qpow(1 - im, n) % P * qpow(im1, j) % P *
qpow(im1 + 1, n - j)) %= P;
}
cout << ((ans % P + P) % P) << endl;
return 0;
}
| 12 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
string s,t;
cin>>s;cin>>t;
for(int i=0;i<n;i++)
cout<<s[i]<<t[i];
}
| 0 | CPP |
import sys
l,r,k=[int(n) for n in input().split()]
#print(l,r,k)
ans=k
count=0
if l==1:
print(1,end =' ')
count+=1
elif (k>r):
print(-1)
sys.exit()
#count=0
while ans<l:
ans*=k
while ans<=r:
print(ans,end=' ')
ans*=k
count+=1
if count==0:
print(-1, end=' ')
print() | 7 | PYTHON3 |
n = int(input())
xyh = [list(map(int, input().split())) for i in range(n)]
if xyh[0][2]:
x,y,h = xyh[0]
if xyh[1][2]:
x,y,h = xyh[1]
if xyh[-1][2]:
x,y,h = xyh[-1]
for i in range(101):
for j in range(101):
k = h + abs(i - x) + abs(j - y)
if all(h == max(k - abs(i - x) - abs(j - y), 0) for x, y, h in xyh):
print(i, j, k) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int sta[200001];
int main() {
int n, a, sp = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
scanf("%d", &a);
sta[sp++] = a % 2;
if (sp > 1 && sta[sp - 1] == sta[sp - 2]) {
sp -= 2;
}
}
puts(sp <= 1 ? "YES" : "NO");
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
struct Pt {
int l, r, val, ct;
Pt *leftpt, *rightpt;
Pt(int _l, int _r, int _val, int _ct)
: l(_l), r(_r), val(_val), ct(_ct), leftpt(0), rightpt(0) {}
};
bool operator<(Pt p1, Pt p2) {
return p1.ct < p2.ct || (p1.ct == p2.ct && p1.l > p2.l);
}
struct Compare {
bool operator()(const Pt* p1, const Pt* p2) const { return *p1 < *p2; }
};
struct SegmentTreeLPMax {
int n, h;
vector<int> t, d;
SegmentTreeLPMax(vector<int> v) {
n = v.size();
h = sizeof(int) * 8 - __builtin_clz(n);
t.resize(2 * n);
d.resize(n);
for (int i = 0; i < n; i++) {
t[i + n] = v[i];
}
for (int i = n - 1; i > 0; i--) {
t[i] = max(t[i << 1], t[i << 1 | 1]);
}
}
void apply(int p, int value) {
t[p] += value;
if (p < n) d[p] += value;
}
void build(int p) {
while (p > 1) p >>= 1, t[p] = max(t[p << 1], t[p << 1 | 1]) + d[p];
}
void push(int p) {
for (int s = h; s > 0; --s) {
int i = p >> s;
if (d[i] != 0) {
apply(i << 1, d[i]);
apply(i << 1 | 1, d[i]);
d[i] = 0;
}
}
}
void inc(int l, int r, int value) {
l += n, r += n;
int l0 = l, r0 = r;
for (; l < r; l >>= 1, r >>= 1) {
if (l & 1) apply(l++, value);
if (r & 1) apply(--r, value);
}
build(l0);
build(r0 - 1);
}
int query(int l, int r) {
l += n, r += n;
push(l);
push(r - 1);
int res = -2e9;
for (; l < r; l >>= 1, r >>= 1) {
if (l & 1) res = max(res, t[l++]);
if (r & 1) res = max(t[--r], res);
}
return res;
}
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> v(n);
for (int& i : v) cin >> i;
priority_queue<Pt*, vector<Pt*>, Compare> pq;
vector<Pt> vp;
for (int l = 0, r = 0; l < n; l = r) {
while (r < n && v[l] == v[r]) r++;
vp.push_back(Pt(l, r - 1, v[l], r - l));
}
for (int i = 0; i < vp.size(); i++) {
if (i) vp[i].leftpt = &vp[i - 1];
if (i + 1 != vp.size()) vp[i].rightpt = &vp[i + 1];
pq.push(&vp[i]);
}
SegmentTreeLPMax stm(vector<int>(n, 1));
int ans = 0;
while (pq.size()) {
auto cur = pq.top();
pq.pop();
if (stm.query(cur->l, cur->r + 1) < 1) continue;
stm.inc(cur->l, cur->r + 1, -1);
Pt *lpt = cur->leftpt, *rpt = cur->rightpt;
if (lpt != 0) {
lpt->rightpt = rpt;
}
if (rpt != 0) {
rpt->leftpt = lpt;
}
if (lpt != 0 && rpt != 0 && lpt->val == rpt->val) {
Pt* p = new Pt(lpt->l, rpt->r, lpt->val, lpt->ct + rpt->ct);
p->leftpt = lpt->leftpt;
p->rightpt = rpt->rightpt;
if (rpt->rightpt != 0) rpt->rightpt->leftpt = p;
if (lpt->leftpt != 0) lpt->leftpt->rightpt = p;
pq.push(p);
}
ans++;
}
cout << ans;
return 0;
}
| 11 | CPP |
n = int(input())
d = 'ACTG'
s = input()
mini = 10**18
for j in range(len(s)):
k = s[j:j+4]
yo = 0
if len(k) == 4:
for i in range(len(d)):
z1 = abs(ord(d[i])-ord(k[i]))
z2 = abs(ord(d[i])-ord('A')) + abs(ord('Z')-ord(k[i]))+1
z3 = abs(ord(d[i])-ord('Z')) + abs(ord('A')-ord(k[i]))+1
yo+=min(z1,z2,z3)
if yo<mini:
mini = yo
print(mini) | 7 | PYTHON3 |
C=input()+input()
print("YNEOS"[1 in[1 for i in range(3)if C[i]!=C[-i-1]]::2]) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rang(
chrono::high_resolution_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
long long int n, x;
cin >> n >> x;
long long int curr_time = 1, watch = 0;
for (int i = 1; i <= n; i++) {
long long int a, b;
cin >> a >> b;
while (curr_time < a && curr_time < b) curr_time += x;
if (curr_time == a) {
watch += (b - curr_time) + 1;
curr_time = b + 1;
} else {
watch += b - (curr_time - x) + 1;
curr_time = b + 1;
}
}
cout << watch << "\n";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const int n_ = 1e5 + 1000;
long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); }
long long power(long long a, long long n) {
long long p = 1;
while (n > 0) {
if (n % 2) {
p = p * a;
}
n >>= 1;
a *= a;
}
return p;
}
long long power(long long a, long long n, long long mod) {
long long p = 1;
while (n > 0) {
if (n % 2) {
p = p * a;
p %= mod;
}
n >>= 1;
a *= a;
a %= mod;
}
return p % mod;
}
int n, a[n_], ans, f[n_];
stack<int> st;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
while ((int)(st).size() && a[st.top()] < a[i]) {
f[i] = max(f[i], f[st.top()]);
st.pop();
}
f[i]++;
if ((int)(st).size())
ans = max(ans, f[i]);
else
f[i] = INF;
st.push(i);
}
cout << ans << "\n";
return 0;
}
| 8 | CPP |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
string s;
cin >> s;
int n;
cin >> n;
int ncal = s[0] -'0';
for(int i = 2;i < s.size();i+=2){
if(s[i-1] == '+'){
ncal += s[i] - '0';
}else{
ncal *= s[i] - '0';
}
}
int rcal = 0;
int tmulti = 1;
for(int i = 0;i < s.size()-1;i+=2){
if(s[i+1] == '+'){
rcal += tmulti * (s[i] - '0');
tmulti = 1;
}else{
tmulti *= s[i] - '0';
}
}
rcal += tmulti * (s[s.size()-1] - '0');
if(n == rcal && n != ncal){
cout << "M" << endl;
}else if(n != rcal && n == ncal){
cout << "L" << endl;
}else if(n == rcal && n == ncal){
cout << "U" << endl;
}else{
cout << "I" << endl;
}
return 0;
}
| 0 | CPP |
import sys
w = int(input())
if w == 2:
print('NO')
sys.exit()
if w % 2 == 0:
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
letters = [x for x in input().replace(",", "").replace("{", "").replace("}", "").split()]
count = 0
for letter in "abcdefghijklmnopqrstuvwxyz":
if letters.count(letter) > 0:
count += 1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int in[1000005];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &in[i]);
int q, a;
scanf("%d", &q);
for (int i = 1; i <= q; i++) {
scanf("%d", &a);
in[a] *= -1;
}
stack<int> S;
for (int i = n; i >= 1; i--) {
if (S.empty()) {
if (in[i] > 0) in[i] *= -1;
S.push(in[i]);
} else {
if (in[i] < 0) {
S.push(in[i]);
} else {
if (S.top() == -in[i]) {
S.pop();
} else {
in[i] *= -1;
S.push(in[i]);
}
}
}
}
if (S.empty()) {
printf("YES\n");
for (int i = 1; i <= n; i++) printf("%d ", in[i]);
printf("\n");
} else {
printf("NO\n");
}
return 0;
}
| 9 | CPP |
q = int(input())
input_data = input()
list_we_use = input_data.split(' ')
final_list = []
a = 0
for i in list_we_use:
final_list.append(int(i))
for i in final_list:
if i == 1:
a +=1
if a > 0:
print("HARD")
else:
print("EASY")
| 7 | PYTHON3 |
def Bad_sequence(string):
# ls = [string[0]]
# counter = 0
# for s in string[1:]:
# if len(ls) > 0:
# if ('()' in ls[0]+s):
# ls.pop()
# elif (')(' in ls[0]+s) and counter == 0:
# ls.pop()
# counter+=1
# else :
# ls.append(s)
# else:
# ls.append(s)
# print(ls)
ls = []
for s in string:
if s == ')':
if len(ls) == 0:
ls.append(s)
elif ls[-1] == ')':
ls.append(s)
else:
ls.pop()
else:
ls.append(s)
if len(ls) == 0 or (len(ls)==2 and ls[0]==')' and ls[1]=='('):
print("Yes")
else:
print("No")
# print(ls)
if __name__ == '__main__':
int_ = input()
brack_string = input()
Bad_sequence(brack_string) | 9 | PYTHON3 |
#include <bits/stdc++.h>
const int base = 2000005;
std::vector<char> prime(base + 1, true);
std::set<int> s;
void update(int x) {
prime[x] = false;
if (x * 1ll * x <= base) {
for (int y = x * x; y <= base; y += x) prime[y] = false;
}
}
int search(int x) {
while (!prime[x]) x += 1;
return x;
}
void factor(int x) {
for (int j = 2; j <= std::floor(std::sqrt(x)); j++) {
if (x % j == 0) {
s.insert(j);
update(j);
while (x % j == 0) x /= j;
}
}
if (x != 1) {
s.insert(x);
update(x);
}
}
int main() {
prime[1] = false;
int n;
std::cin >> n;
std::vector<int> lst(n);
for (auto& x : lst) std::cin >> x;
char flag = false;
for (int i = 0; i < n; i++) {
if (flag) break;
int x = lst[i];
std::vector<int> p;
for (int j = 2; j <= std::floor(std::sqrt(x)); j++) {
if (x % j == 0) {
if (std::count(s.begin(), s.end(), j) == 1) {
flag = true;
lst[i] = search(lst[i] + 1);
update(lst[i]);
factor(lst[i]);
if (i + 1 < n) {
lst[i + 1] = search(1);
update(lst[i + 1]);
}
for (int o = i + 2; o < n; o++) {
lst[o] = search(lst[o - 1] + 1);
update(lst[o]);
}
break;
} else {
p.push_back(j);
while (x % j == 0) x /= j;
}
}
}
if (x != 1) {
if (std::count(s.begin(), s.end(), x) == 1) {
flag = true;
lst[i] = search(lst[i] + 1);
update(lst[i]);
factor(lst[i]);
if (i + 1 < n) {
lst[i + 1] = search(1);
update(lst[i + 1]);
}
for (int o = i + 2; o < n; o++) {
lst[o] = search(lst[o - 1] + 1);
update(lst[o]);
}
break;
} else
p.push_back(x);
}
for (int a = 0; a < p.size(); a++) {
update(p[a]);
s.insert(p[a]);
}
}
for (int i = 0; i < n; i++) std::cout << lst[i] << ' ';
}
| 10 | CPP |
n = int(input())
a = [list(map(int, input().split())) for i in range(n)]
res = []
for i in range(n):
j = 0
while j < n and 3 != a[i][j] != 1:
j += 1
if j == n: res.append(i + 1)
print(len(res))
print(' '.join(map(str, res)))
| 7 | PYTHON3 |
[M,N] = [int(i) for i in input().split()]
t = 0
t = (M * N)//2
print((t))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline void chkmin(T1 &x, T2 y) {
if (x > y) x = y;
}
template <typename T1, typename T2>
inline void chkmax(T1 &x, T2 y) {
if (x < y) x = y;
}
using ll = long long;
using ld = long double;
const string FILENAME = "input";
const int MAXN = 200228;
int n, q;
int a[MAXN];
int ss = 1;
int lastl[MAXN];
int lastr[MAXN];
vector<int> res[MAXN];
int nxt[MAXN];
int b[MAXN], c[MAXN], t[MAXN], sum[MAXN];
int st1[MAXN], st2[MAXN];
int ans[MAXN][4];
set<int> s;
bool comp1(int u, int v) { return a[u] < a[v]; }
bool comp2(int u, int v) { return a[u] > a[v]; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
while (ss < n) {
ss <<= 1;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ps = -1, ps1 = -1;
for (int i = n - 2; i >= 0; i--) {
if (a[i] > a[i + 1]) {
ps = i;
} else if (a[i] < a[i + 1]) {
ps1 = i;
}
lastl[i] = ps;
lastr[i] = ps1;
}
int p1 = 0, p2 = 0;
int r1 = 0, r2 = 0;
s.insert(n);
for (int i = n - 1; i >= 0; i--) {
while (p1) {
int u = st1[p1];
if (a[u] > a[i]) {
t[u]--;
if (!t[u]) {
s.insert(u);
}
p1--;
r1 = 0;
} else {
break;
}
}
while (p2) {
int u = st2[p2];
if (a[u] < a[i]) {
t[u]--;
if (!t[u]) {
s.insert(u);
}
p2--;
r2 = 0;
} else {
break;
}
}
int s1 = lower_bound(st1 + 1, st1 + p1 + 1, i, comp1) - st1 - 1;
int s2 = lower_bound(st2 + 1, st2 + p2 + 1, i, comp2) - st2 - 1;
if (s1 && s2) {
c[i] = *s.lower_bound(max(st1[s1], st2[s2]));
if (c[i] < n) {
int u = lower_bound(st1 + 1, st1 + p1 + 1, c[i], greater<int>()) - st1;
int v = lower_bound(st2 + 1, st2 + p2 + 1, c[i], greater<int>()) - st2;
ans[i][0] = i;
ans[i][1] = min(st1[u], st2[v]);
ans[i][2] = max(st1[u], st2[v]);
ans[i][3] = c[i];
}
} else {
c[i] = n;
}
st1[++p1] = i;
st2[++p2] = i;
r1++;
r2++;
t[i] += 2;
if (i + 1 < n && c[i] > c[i + 1]) {
c[i] = c[i + 1];
for (int j = 0; j < 4; j++) {
ans[i][j] = ans[i + 1][j];
}
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
l--, r--;
if (lastl[l] == -1 || lastr[l] == -1) {
cout << 0 << '\n';
continue;
}
if (max(lastl[l], lastr[l]) > r - 1) {
cout << 0 << '\n';
continue;
}
if (r >= c[l]) {
cout << 4 << '\n';
for (int j = 0; j < 4; j++) {
cout << ans[l][j] + 1 << ' ';
}
cout << '\n';
continue;
}
if (lastl[l] <= lastr[l]) {
res[i].push_back(lastl[l]);
res[i].push_back(
(a[lastl[l] + 1] < a[lastr[l]] ? lastl[l] + 1 : lastr[l]));
res[i].push_back(lastr[l] + 1);
} else {
res[i].push_back(lastr[l]);
res[i].push_back(
(a[lastr[l] + 1] > a[lastl[l]] ? lastr[l] + 1 : lastl[l]));
res[i].push_back(lastl[l] + 1);
}
cout << 3 << '\n';
for (auto x : res[i]) {
cout << x + 1 << ' ';
}
cout << '\n';
}
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
char a[100005];
int a2[100005];
bool flag[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> a2[i];
}
int t = 1;
while (1) {
if (a[t] == '<') {
t = t - a2[t];
} else if (a[t] == '>') {
t = t + a2[t];
}
if (t > n || t < 1) {
cout << "FINITE";
break;
}
if (flag[t] == 1) {
cout << "INFINITE";
break;
}
flag[t] = 1;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
bool il[101010];
cin >> n;
for (int i = 0; i < n; i++){
cin >> il[i];
}
for (int i = 0; i < n; i++){
il[i] = il[i] ^ (1 & i);
}
int ans = 0;
int l = 0, r = 0;
while (il[r] && r < n) r++;
while (r < n){
while (!il[r] && r < n) r++;
int nl = r;
while ( il[r] && r < n) r++;
ans = max(ans, r - l);
l = nl;
}
l = r = 0;
while (!il[r] && r < n) r++;
while (r < n){
while ( il[r] && r < n) r++;
int nl = r;
while (!il[r] && r < n) r++;
ans = max(ans, r - l);
l = nl;
}
cout << ans << endl;
} | 0 | CPP |
a=int(input())
b=int(input())
c=int(input())
lst=[a*b*c,(a+b)*c,a+b*c,a*(b+c),a*b+c,a+b+c]
print(max(lst)) | 7 | PYTHON3 |
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<vector>
#define MN 200000
#define mod 1000000007
using namespace std;
inline 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;
}
vector<int> v[MN+5];
pair<int,int> q[MN+5];
int n,X,Y,c[MN+5],w[MN+5],mn=2e9,from,mn2=2e9,s[MN+5],top=0,size[MN+5],ans=1,inv[MN+5],p[MN+5];
bool cmp(int x,int y){return w[x]<w[y];}
inline int getfa(int x){return s[x]?s[x]=getfa(s[x]):x;}
void Merge(int x,int y){if((x=getfa(x))!=(y=getfa(y)))size[y]+=size[x],s[x]=y;}
int main()
{
n=read();X=read();Y=read();p[0]=inv[0]=inv[1]=p[1]=1;
for(int i=2;i<=n;++i) p[i]=1LL*p[i-1]*i%mod,inv[i]=1LL*(mod-mod/i)*inv[mod%i]%mod;
for(int i=2;i<=n;++i) inv[i]=1LL*inv[i-1]*inv[i]%mod;
for(int i=1;i<=n;++i) size[i]=1,c[i]=read(),w[i]=read(),v[c[i]].push_back(i);
for(int i=1;i<=n;++i) if(v[i].size())
{
if(v[i].size()==n) return 0*puts("1");
sort(v[i].begin(),v[i].end(),cmp);
int V=w[v[i][0]];
if(V<mn) mn2=mn,mn=V,from=i;
else if(V<mn2) mn2=V;
}
for(int i=1;i<=n;++i) if(v[i].size())
{
int mx=max(X-w[v[i][0]],Y-(from==i?mn2:mn));
for(int j=1;j<v[i].size();++j)
if(w[v[i][j]]<=mx) Merge(v[i][j],v[i][0]);
q[++top]=make_pair(w[v[i][0]],v[i][0]);
}
sort(q+1,q+top+1);int val=Y-q[1].first;
ans=inv[size[getfa(q[1].second)]];
for(int j=2;j<=top;++j) if(q[j].first<=val)
ans=1LL*ans*inv[size[getfa(q[j].second)]]%mod,Merge(q[j].second,q[1].second);
ans=1LL*ans*p[size[getfa(q[1].second)]]%mod;
cout<<ans;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
long long ok(long long x) {
long long res = 0;
x--;
for (int i = 1; i <= n; i++) res += min(m, x / i);
return res;
}
int main() {
scanf("%I64d %I64d %I64d", &n, &m, &k);
long long l = 0, r = 1e18;
while (r - l > 1) {
long long mid = (l + r) >> 1;
if (ok(mid) < k)
l = mid;
else
r = mid;
}
printf("%I64d", l);
return 0;
}
| 10 | CPP |
t=int(input())
while(t):
n=int(input())
ans=0
for x in range(1,50):
u=(2**x)-1
s=(u*(u+1))//2
if n>=s :
n-=s
ans+=1
else:
break
print(ans)
t-=1 | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, m, k, len, tot, ans;
struct node {
int x, l, r, op;
bool operator<(const node &b) const { return x < b.x; }
} p[N];
struct segtree {
int ls, rs, sg, val, sum;
} t[N * 30];
int calc(int l, int r) {
--l;
int res = 0;
for (int i = 0; i <= len; ++i) {
int t = (r >> i) - (l >> i);
if (i < len) t -= (r >> i + 1) - (l >> i + 1);
res |= (t & 1) << i;
}
return res;
}
void up(int x) {
if (t[x].val)
t[x].sum = t[x].sg;
else
t[x].sum = t[t[x].ls].sum ^ t[t[x].rs].sum;
}
void modify(int &x, int l, int r, int ql, int qr, int op) {
if (!x) t[x = ++tot].sg = calc(l, r);
if (l >= ql && r <= qr) {
t[x].val += op;
up(x);
return;
}
int mid = l + r >> 1;
if (ql <= mid) modify(t[x].ls, l, mid, ql, qr, op);
if (qr > mid) modify(t[x].rs, mid + 1, r, ql, qr, op);
up(x);
}
int main() {
scanf("%d%d%d", &n, &m, &k);
while (1 << len <= k) ++len;
--len;
for (int i = 1, a, b, c, d; i <= m; ++i) {
scanf("%d%d%d%d", &a, &b, &c, &d);
p[i] = (node){a, b, d, 1};
p[i + m] = (node){c + 1, b, d, -1};
}
sort(p + 1, p + m + m + 1);
for (int i = 1, rt = 0; i <= m + m; ++i) {
modify(rt, 1, n, p[i].l, p[i].r, p[i].op);
if (i < m + m && p[i].x < p[i + 1].x) {
int foo = calc(p[i].x, p[i + 1].x - 1), bar = t[rt].sum, x = 0, y = 0,
lst = 0;
for (int j = len; ~j; --j) {
x += foo >> j & 1;
y += bar >> j & 1;
ans ^= (x * y - lst & 1) << j;
lst = x * y;
}
}
}
puts(ans ? "Hamed" : "Malek");
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 2005;
const int INF = 1e9;
vector<int> v[N], w[N];
bool vis1[N], vis2[N], vis3[N];
vector<int> v2;
int c = 0;
bool f;
void dfs2(int u) {
vis2[u] = 1;
for (auto x : w[u]) {
if ((!vis2[x]) && (vis3[x])) {
f = 0;
break;
}
}
return;
}
void dfs1(int u) {
vis1[u] = 1;
v2.push_back(u);
vis3[u] = 1;
++c;
for (auto x : v[u]) {
if (!vis1[x]) {
dfs1(x);
}
}
return;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k, m, a, b;
cin >> n;
cin >> k;
for (int i = 0; i < k; ++i) {
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
cin >> m;
for (int i = 0; i < m; ++i) {
cin >> a >> b;
w[a].push_back(b);
w[b].push_back(a);
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
if (!vis1[i]) {
v2.clear();
memset(vis3, 0, sizeof vis3);
memset(vis2, 0, sizeof vis2);
c = 0;
dfs1(i);
f = 1;
for (auto x : v2) {
if (!vis2[x]) {
dfs2(x);
if (!f) break;
}
}
if (f) ans = max(ans, c);
}
}
cout << ans;
}
| 9 | CPP |
from sys import stdin
from math import sqrt
def sm(s):
return sum([int(ch) for ch in s])
n = int(stdin.readline())
fn = 4*n
possx = list()
for i in range(1, 163):
w = int(sqrt(fn + i*i))
if w*w == fn + i*i:
k = w
#print(k, i, k-i)
if (k - i > 0 and (k - i)%2 == 0):
ak = (k-i)//2
if (sm(str(ak)) == i): possx.append(ak)
possx.sort()
if (len(possx) == 0): print(-1)
else: print(possx[0]) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
const double eps = 1e-9;
const int mod = 1e9 + 7;
int n, k, a[17][17], fq[100005];
bool mark[1 << 17], memo[1 << 17][17][17], can[1 << 17];
char s[100005];
void f(int m, int a, int b) {
if (memo[m][a][b]) return;
memo[m][a][b] = true;
mark[m] = true;
for (int i = 0; i < k; i++)
if ((m & (1 << i)) && i != a && i != b) f(m ^ (1 << i), a, b);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k >> s;
for (int i = 0; i < n; i++) fq[s[i] - 'a']++;
for (int i = 0; i < k; i++)
for (int j = 0; j < k; j++) cin >> a[i][j];
for (int i = 0; i < k; i++)
for (int j = 0; j < k; j++) {
if (i == j || a[i][j]) continue;
bool is = false;
int mask;
for (int l = 0; l < n; l++) {
if (!is && s[l] - 'a' != i) continue;
if (s[l] - 'a' == i) {
is = true;
mask = 0;
} else if (s[l] - 'a' == j) {
f(((1 << k) - 1) ^ mask, i, j);
is = false;
} else
mask |= (1 << (s[l] - 'a'));
}
}
for (int i = 0; i < k; i++) {
if (a[i][i]) continue;
int mask;
bool is = false;
for (int j = 0; j < n; j++) {
if (!is && s[j] - 'a' != i) continue;
if (s[j] - 'a' == i) {
if (is) f(((1 << k) - 1) ^ mask, i, i);
mask = 0;
is = true;
} else
mask |= (1 << (s[j] - 'a'));
}
}
int sol = 1 << 30;
can[(1 << k) - 1] = true;
for (int i = (1 << k) - 1; i >= 0; i--) {
if (mark[i] || !can[i]) continue;
int tmp = 0;
for (int j = 0; j < k; j++) {
if (i & (1 << j)) {
tmp += fq[j];
can[i ^ (1 << j)] = true;
}
}
sol = min(sol, tmp);
}
cout << sol << '\n';
return 0;
}
| 12 | CPP |
# cook your dish here
s=input()
s=int(s)
t=1
amt=0
while s>0 :
amt=amt+t/s
s=s-t
print(amt)
| 8 | PYTHON3 |
for i in range(int(input())):
a,b = map(int,input().split())
rem = a%b
if rem == 0:
print(0)
else:
print(b-rem) | 10 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Fri Apr 3 14:15:46 2020
@author: USER
"""
def solve(l):
for i in range(l):
a=input()
l=""
b=[int(n) for n in input().split()]
b.sort(reverse=True)
for i in range(int(a)):
l=l+str(b[i])+" "
print(l)
solve(int(input())) | 8 | PYTHON3 |
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define inf 0x7f7f7f7f
using namespace std;
const int maxn=2e5;
int n,tot,cnt;
int pre[maxn+8],now[maxn+8],son[maxn+8];
bool vis[maxn+8],cir[maxn+8],inq[maxn+8];
int v[maxn+8],fa[maxn+8];
int read()
{
int x=0,f=1;char ch=getchar();
for (;ch<'0'||ch>'9';ch=getchar()) if (ch=='-') f=-1;
for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
return x*f;
}
void add(int u,int v)
{
pre[++tot]=now[u];
now[u]=tot;
son[tot]=v;
}
void get(int x)
{
for (int p=now[x];p;p=pre[p])
{
int child=son[p];
if (cir[child]) continue;
get(child);
}
for (int p=now[x];p;p=pre[p])
{
int child=son[p];
if (cir[child]) continue;
inq[v[child]]=1;
}
while(inq[v[x]]) v[x]++;
for (int p=now[x];p;p=pre[p])
{
int child=son[p];
if (cir[child]) continue;
inq[v[child]]=0;
}
}
int main()
{
n=read();
for (int i=1;i<=n;i++)
{
fa[i]=read();
add(fa[i],i);
}
int x=1,mx=-inf,mn=inf;
while(!vis[x]) vis[x]=1,x=fa[x];
while(!cir[x]) cir[x]=1,x=fa[x];
for (int i=1;i<=n;i++)
if (cir[i])
{
get(i),cnt++;
mx=max(mx,v[i]);
mn=min(mn,v[i]);
}
mx==mn&&(cnt&1)?puts("IMPOSSIBLE"):puts("POSSIBLE");
return 0;
}
| 0 | CPP |
# A
l = set(map(int, input().split()))
print(len(l)) | 0 | PYTHON3 |
def f(x):
m1,m2=11,0
while(x>0):
y=x%10
m1=min(m1,y)
m2=max(m2,y)
x//=10
return m1*m2
t=int(input())
while t:
t-=1
n,m=map(int,input().split(' '))
m-=1
while(m):
m-=1
va=f(n)
if va==0:
break
n+=va
print(n) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, k;
string s;
vector<int> ans;
int32_t main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b >> k;
cin >> s;
int cnt = 0;
int pos = 0;
for (auto ch : s) {
++pos;
if (ch == '1')
cnt = 0;
else {
++cnt;
if (cnt == b) {
ans.push_back(pos);
cnt = 0;
}
}
}
cout << (int)ans.size() - (a - 1) << endl;
for (int i = 0; i < (int)ans.size() - (a - 1); ++i) {
cout << ans[i] << " ";
}
return 0;
}
| 8 | CPP |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
int N;
char c[202];
ll dp[202][202];
void add(ll &a,ll b){
a=(a+b)%MOD;
}
int main(){
cin>>N;
rep(i,N) cin>>c[i];
dp[0][0]=1;
for(int i=0;i<N;i++){
for(int j=0;j<=i;j++){
if(c[i]=='-') add(dp[i+1][j],dp[i][j]);
else if(c[i]=='D'){
add(dp[i+1][j],dp[i][j]*j);
if(j>=1) add(dp[i+1][j-1],dp[i][j]*j*j);
}else{
add(dp[i+1][j+1],dp[i][j]);
if(j>=1) add(dp[i+1][j],dp[i][j]*j);
}
}
}
cout<<dp[N][0]<<endl;
return 0;
}
| 0 | CPP |
#include "bits/stdc++.h"
#define MOD 1000000007
#define INF 11234567890
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
int N;
std::string S[112345], T;
int l, r;
int main()
{
in >> N;
rep(i, N) { in >> S[i]; }
in >> T;
rep(i, N)
{
std::string a, z;
a = z = S[i];
rep(j, S[i].length())
{
if (S[i][j] == '?')
{
a[j] = 'a';
z[j] = 'z';
}
}
if (T < a) { ++r; }
else if (z < T) { ++l; }
}
for (int i = l + 1; i <= N - r; ++i) { out << i << " "; }
out << N - r + 1 << std::endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 1000;
const long long INF64 = 1e18 + 1000;
const int N = 1000 + 10;
const int M = 1000;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
long long gcd(long long a, long long b) { return a == 0 ? b : gcd(b % a, a); }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
for (int i = 0; i < int(s.size()); ++i) {
if (s[i] == '0') {
s.erase(s.begin() + i);
cout << s << '\n';
return 0;
}
}
s.erase(s.end() - 1);
cout << s << '\n';
}
| 7 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
template <typename X>
inline X abs(const X& a) {
return a < 0 ? -a : a;
}
template <typename X>
inline X sqr(const X& a) {
return a * a;
}
const int size = 1e5 + 5;
const double eps = 0.0001;
const long double PI = 3.1415926535897932384626433832795;
const long long MOD = 1000000007;
const long long INF = 1LL << 62;
const long long MAX5 = 100001;
const long long MAX6 = 1000001;
const long long MAX17 = 99999999999999999;
const double DMAX = 2e18 + 5;
const int P = 239017;
void solution();
void include_file();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solution();
return 0;
}
inline void include_file() {
ios_base::sync_with_stdio(true);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
inline bool isPrime(long long n) {
for (int i = 2; i * i <= n; ++i)
if (n % i == 0) return false;
return true;
}
inline string ekv(string a) {
if (a.size() & 1) return a;
string x = ekv(a.substr(0, a.size() / 2));
string y = ekv(a.substr(a.size() / 2));
return min(x + y, y + x);
}
inline long long cubic_root(long long x) {
long long l = 0, r = MAX6;
while (l != r) {
long long m = (l + r + 1) / 2;
if (m * m * m > x)
r = m - 1;
else
l = m;
}
return l;
}
inline float FastInvSqrt(float x) {
float xhalf = 0.5f * x;
int i = *(int*)&x;
i = 0x5f3759df - (i >> 1);
x = *(float*)&i;
x = x * (1.5f - (xhalf * x * x));
return x;
}
inline long long gcd(long long a, long long b) {
while (b ^= a ^= b ^= a = a % b)
;
return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
unsigned long long NCR(unsigned long long n, unsigned long long r) {
if (r == 0) return 1;
if (r > n >> 1) return NCR(n, n - r);
unsigned long long res = 1;
for (long long k = 1; k <= r; ++k) {
res *= (unsigned long long)(n - k + 1);
res /= k;
}
return res;
}
constexpr uint64_t mod = (1ull << 61) - 1;
inline uint64_t modmul(uint64_t a, uint64_t b) {
uint64_t l1 = (uint32_t)a, h1 = a >> 32, l2 = (uint32_t)b, h2 = b >> 32;
uint64_t l = l1 * l2, m = l1 * h2 + l2 * h1, h = h1 * h2;
uint64_t ret =
(l & mod) + (l >> 61) + (h << 3) + (m >> 29) + (m << 35 >> 3) + 1;
ret = (ret & mod) + (ret >> 61);
ret = (ret & mod) + (ret >> 61);
return ret - 1;
}
void yes() { cout << "YES"; }
void no() { cout << "NO"; }
void yes(bool res, bool small = false) {
if (!small) {
if (res)
cout << "YES";
else
cout << "NO";
} else {
if (res)
cout << "Yes";
else
cout << "No";
}
}
void dabl(double x) { printf("%.10lf", x); }
namespace bits {
template <typename X>
inline X MAX(const X& a, const X& b) {
return b & ((a - b) >> 31) | a & (~(a - b) >> 31);
}
template <typename X>
inline X MIN(const X& a, const X& b) {
return a & ((a - b) >> 31) | b & (~(a - b) >> 31);
}
inline bool check2(const long long n) { return n > 0 && (n & (n - 1)); }
inline long long ostatok2(const long long n, const long long m) {
return m & (n - 1);
}
template <typename X>
inline void SWAP(X& a, X& b) {
a ^= b;
b ^= a;
a ^= b;
}
inline size_t count_1_in_LL(unsigned long long n) {
std::size_t i(0);
for (; n; ++i) n &= n - 1;
return i;
}
} // namespace bits
void debug() { cout << endl; }
template <typename H, typename... T>
void debug(H p, T... t) {
std::cout << p << " ";
debug(t...);
}
vector<vector<int> > g;
inline void solution() {
int n;
cin >> n;
int a[n];
for (long long i = 0; i < n; ++i) cin >> a[i];
;
map<int, set<int> > q;
int ideal = 0, k = 0;
for (long long i = 0; i < n; ++i) {
q[a[i]].insert(i);
if (q[a[i]].size() > k) {
k = q[a[i]].size();
ideal = a[i];
}
}
set<int> pos = q[ideal];
vector<pair<int, pair<int, int> > > res;
int cur;
while (pos.size() > 0) {
cur = *pos.begin();
for (int i = cur - 1; i >= 0; --i) {
if (a[i] == ideal)
break;
else {
if (a[i + 1] > a[i])
res.push_back({1, {i + 1, i + 2}});
else
res.push_back({2, {i + 1, i + 2}});
a[i] = ideal;
}
}
pos.erase(cur);
}
if (cur != n - 1) {
for (int i = cur + 1; i < n; ++i) {
if (a[i - 1] > a[i])
res.push_back({1, {i + 1, i}});
else
res.push_back({2, {i + 1, i}});
a[i] = ideal;
}
}
cout << res.size() << endl;
for (auto x : res) {
cout << x.first << " " << x.second.first << " " << x.second.second << endl;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, m, u, v, w;
scanf("%d%d%d%d%d%d", &a, &b, &m, &u, &v, &w);
double t = -(double)m / v;
double dx = a * 0.5 + t * u;
while (dx < 0 || dx > a) {
if (dx > a) dx = 2 * a - dx;
if (dx < 0) dx = -dx;
}
double dz = t * w;
while (dz < 0 || dz > b) {
if (dz > b) dz = 2 * b - dz;
if (dz < 0) dz = -dz;
}
printf("%.12lf %.12lf", dx, dz);
}
| 10 | CPP |
n=list(input())
t=['a','e','i','o','u']
count=0
for i in range(len(n)):
if n[i] in t and n[i].isdigit()==False:
count+=1
if n[i].isdigit() and int(n[i])%2!=0:
count+=1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int judge(int y) {
if (y % 400 == 0 || (y % 4 == 0 && y % 100 != 0))
return 2;
else
return 1;
}
int main() {
long long int y, x = 0;
cin >> y;
int temp = y;
while (1) {
temp++;
x += judge(temp);
if (x % 7 == 0 && judge(temp) == judge(y)) {
cout << temp;
return 0;
}
}
return 0;
}
| 8 | CPP |
n, k = map(int, input().split())
a = list(map(int, input().split()))
h = [0 for i in range(max(a)+1)]
for ai in a:
h[ai] += 1
for i in range(1, len(h)):
h[i] += h[i-1]
tp = len(h)-1
bp = 0
while h[bp] == 0:
bp += 1
cuts = 0
while tp != bp:
c = 0
while tp != bp and c+h[-1]-h[tp-1] <= k:
c += h[-1]-h[tp-1]
tp -= 1
cuts += 1
print(cuts) | 9 | PYTHON3 |
for _ in range(int(input())):
n = int(input())
arr = list(map(int,input().split()))
if arr == sorted(arr):
print('YES')
else:
minn = min(arr)
t = []
ind = []
v = []
for i in range(n):
if arr[i]%minn==0:
t += [arr[i]]
ind += [i]
else:
v += [[arr[i],i]]
t.sort()
temp = [0]*n
for i in range(len(ind)):
temp[ind[i]] = t[i]
for i in v:
temp[i[1]] = i[0]
if temp==sorted(arr):
print('YES')
else:
print("NO") | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> odds, evens;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, tmp;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> tmp;
if (tmp % 2)
odds.push_back(tmp);
else
evens.push_back(tmp);
}
int len = odds.size() - evens.size();
if (abs(len) < 1) {
cout << 0 << endl;
return 0;
}
sort(odds.begin(), odds.end());
sort(evens.begin(), evens.end());
long long ans = 0;
if (len > 0) {
for (int i = 0; i < len - 1; ++i) ans += odds[i];
} else {
for (int i = 0; i < len * (-1) - 1; ++i) ans += evens[i];
}
cout << ans << endl;
return 0;
}
| 8 | CPP |
/**
* Sergey Kopeliovich ([email protected])
*/
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int h, w, d;
scanf("%d%d%d", &h, &w, &d);
const char *s = "RYGB";
int res[h][w];
forn(i, h) {
forn(j, w) {
int a = i + j, b = i - j + w, D = d;
a /= D, b /= D;
res[i][j] = (a & 1) * 2 + (b & 1);
putchar(s[res[i][j]]);
}
puts("");
}
// forn(i, h)
// forn(j, w)
// forn(i1, h)
// forn(j1, w)
// if (abs(i - i1) + abs(j - j1) == d)
// assert(res[i][j] != res[i1][j1]);
} | 0 | CPP |
n = int(input())
for i in range(n):
d = {}
pos = (0,0)
s = input()
total = 0
for char in s:
if char == 'N':
new_pos = (pos[0]+1, pos[1])
if char == 'S':
new_pos = (pos[0]-1, pos[1])
if char == 'E':
new_pos = (pos[0], pos[1] + 1)
if char == 'W':
new_pos = (pos[0], pos[1] - 1)
if (pos, new_pos) in d or (new_pos, pos) in d:
total += 1
else:
total += 5
d[(pos, new_pos)] = 'x'
d[(new_pos, pos)] = 'x'
pos = new_pos
#print(d)
print(total) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int read() {
char c = getchar();
while (c < '0' || c > '9') c = getchar();
int x = 0;
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x;
}
const int maxn = (1 << 21) + 3;
const int INF = 0x3f3f3f3f;
struct segtree {
int n;
int tag[maxn], mmin[maxn];
int ul, ur, uv;
void update(int o, int l, int r) {
if (ul <= l && ur >= r) {
tag[o] = max(tag[o], uv);
mmin[o] = max(mmin[o], uv);
return;
}
int mid = (l + r) / 2;
if (ul <= mid) update(o * 2, l, mid);
if (ur > mid) update(o * 2 + 1, mid + 1, r);
mmin[o] = max(min(mmin[o * 2], mmin[o * 2 + 1]), tag[o]);
}
void modify(int l, int r, int v) {
if (l > r) return;
ul = l, ur = r, uv = v;
update(1, 1, n);
}
int p, x;
int query2(int o, int l, int r) {
if (max(tag[o], mmin[o]) >= x) return n + 1;
if (l == r) return l;
int mid = (l + r) / 2;
if (mmin[o * 2] < x)
return query2(o * 2, l, mid);
else
return query2(o * 2 + 1, mid + 1, r);
}
int query(int o, int l, int r) {
if (max(tag[o], mmin[o]) >= x) return n + 1;
if (l == r) return l;
int mid = (l + r) / 2;
if (p > mid)
return query(o * 2 + 1, mid + 1, r);
else {
int ans = query(o * 2, l, mid);
if (ans != n + 1)
return ans;
else
return query2(o * 2 + 1, mid + 1, r);
}
}
int query(int p, int x) {
if (p > n) return n + 1;
this->p = p, this->x = x;
return query(1, 1, n);
}
} t;
struct edge {
int l, r;
bool operator<(const edge& rhs) const { return r < rhs.r; }
} e[maxn];
struct query {
int id, x, y;
bool operator<(const query& rhs) const { return y < rhs.y; }
} q[maxn];
int ans[maxn];
void write(int x) {
if (x >= 10) write(x / 10);
putchar(x % 10 + '0');
}
void writeln(int x) {
write(x);
putchar('\n');
}
int main() {
int n = t.n = read(), k = read();
for (int i = 1; i <= k; i++) e[i].l = read(), e[i].r = read();
sort(e + 1, e + k + 1);
int m = read();
for (int i = 1; i <= m; i++) q[i].id = i, q[i].x = read(), q[i].y = read();
sort(q + 1, q + m + 1);
int now = 1;
for (int i = 1; i <= m; i++) {
while (now <= k && e[now].r <= q[i].y) {
t.modify(e[now].l + 1, e[now].r, e[now].l);
now++;
}
ans[q[i].id] = t.query(q[i].x + 1, q[i].x) - 1;
}
for (int i = 1; i <= m; i++) writeln(ans[i]);
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
int a[N], ans[N], l[N], r[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
stack<int> st;
for (int i = 1; i <= n; i++) {
while (!st.empty() && a[st.top()] > a[i]) {
r[st.top()] = i - 1;
st.pop();
}
st.push(i);
}
while (!st.empty()) {
r[st.top()] = n;
st.pop();
}
for (int i = n; i >= 1; i--) {
while (!st.empty() && a[st.top()] > a[i]) {
l[st.top()] = i + 1;
st.pop();
}
st.push(i);
}
while (!st.empty()) {
l[st.top()] = 1;
st.pop();
}
for (int i = 1; i <= n; i++) {
int len = r[i] - l[i] + 1;
ans[len] = max(ans[len], a[i]);
}
for (int i = n; i >= 1; i--) {
ans[i] = max(ans[i + 1], ans[i]);
}
for (int i = 1; i <= n; i++) {
cout << ans[i] << " ";
}
}
| 8 | CPP |
n,k=map(int, input().split())
l=list(input().split())
c = 0
for i in l:
if i.count('7') + i.count('4') <= k:
c += 1
print(c) | 7 | PYTHON3 |
t=int(input())
li = []
def palindrome(s):
return s == s[::-1]
def dsort(s):
return ''.join(sorted(s))
i=0
while i<t:
i+=1
j= input()
li = li +[j]
for n in li:
n=dsort(n)
if palindrome(n):
print('-1')
else:
print(n)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
long long p, q, b, d;
long long NWD(long long a, long long b) {
while (b != 0) {
a = a % b;
swap(a, b);
}
return a;
}
bool finite(long long q, long long b) {
if (b % q == 0) return true;
long long d = NWD(q, b);
while (d != 1) {
while (q % d == 0) q = q / d;
d = NWD(b, q);
}
return (q == 1);
}
int main() {
std::ios_base::sync_with_stdio(0);
cin >> n;
while (n-- > 0) {
cin >> p >> q >> b;
d = NWD(p, q);
p = p / d;
q = q / d;
if (finite(q, b))
cout << "Finite\n";
else
cout << "Infinite\n";
}
}
| 7 | CPP |
n = int(input())
a = []
for i in range(1, n + 1):
s, p = input().split()
a.append((s, -int(p), i))
a.sort()
for i in a:
print(i[2])
| 0 | PYTHON3 |
N = int(input()) -1
out = 0
for i in range(N):
out += N // (i+1)
print(out)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
while (scanf("%d", &n) == 1) {
int high, maxH = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &high);
if (maxH < high) maxH = high;
}
printf("%d\n", maxH);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int w[n];
for(int i=0;i<n;i++){
cin >> w[i];
}
int dist=32768;
int sum=0;
for(int i=0;i<n;i++){
sum+=w[i];
}
int sone=0;
for(int i=0;i<n;i++){
sone+=w[i];
dist=min(dist,abs(2*sone-sum));
}
cout << dist;
}
| 0 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:536870912")
const int MOD = 1000000007;
const long long INF = 1000000000000000001;
const int MAXN = 100010;
const long double EPS = 1e-6;
const int HASH_POW = 29;
const long double PI = acos(-1.0);
using namespace std;
void my_return(int code) { exit(code); }
int n, d[100010];
char s[100010], u[100010];
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
mt19937 mt_rand(time(0));
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < n; ++i) scanf("%d", &d[i]);
int ptr = 0;
while (true) {
u[ptr] = 1;
if (s[ptr] == '<')
ptr -= d[ptr];
else
ptr += d[ptr];
if (ptr < 0 || ptr >= n) {
printf("FINITE\n");
my_return(0);
} else if (u[ptr]) {
printf("INFINITE\n");
my_return(0);
}
}
my_return(0);
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0;
bool flag = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-') flag = 0;
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
return flag ? x : -x;
}
const int N = 1e3 + 10;
int f[N * N][2];
int n, a[N];
int tot;
bool endd[N * N];
int id[N], ans[N][N];
bool flg = 0;
bool bo;
inline void work(int k, int tt, int step, int p) {
if (bo) return;
if (step > k) {
endd[p] = 1;
bo = 1;
return;
}
if (endd[f[p][0]] == 0) {
if (f[p][0] == 0) f[p][0] = ++tot;
ans[tt][step] = 0;
work(k, tt, step + 1, f[p][0]);
}
if (bo) return;
if (endd[f[p][1]] == 0) {
if (f[p][1] == 0) f[p][1] = ++tot;
ans[tt][step] = 1;
work(k, tt, step + 1, f[p][1]);
}
}
inline bool cmp(int x, int y) { return a[x] < a[y]; }
int main() {
n = read();
tot = 1;
for (register int i = 1; i <= n; i++) a[i] = read(), id[i] = i;
sort(id + 1, id + 1 + n, cmp);
for (register int i = 1; i <= n; i++) {
bo = 0;
work(a[id[i]], id[i], 1, 1);
if (bo == 0) {
printf("NO\n");
return 0;
}
}
printf("YES\n");
for (register int i = 1; i <= n; i++) {
for (register int j = 1; j <= a[i]; j++) printf("%d", ans[i][j]);
cout << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, arr1[N], arr2[N], mx[4 * N], mn[4 * N];
long long out;
void bld(int p, int s, int e) {
if (s == e) {
mx[p] = arr1[s], mn[p] = arr2[s];
return;
}
int m = (s + e) >> 1, l = p << 1, r = p << 1 | 1;
bld(l, s, m);
bld(r, m + 1, e);
mx[p] = max(mx[l], mx[r]);
mn[p] = min(mn[l], mn[r]);
}
pair<int, int> qry(int p, int s, int e, int l, int r) {
if (s > r || e < l) return {INT_MIN, INT_MAX};
if (s >= l && e <= r) return {mx[p], mn[p]};
int m = (s + e) >> 1;
pair<int, int> a = qry(p << 1, s, m, l, r),
b = qry(p << 1 | 1, m + 1, e, l, r);
return {max(a.first, b.first), min(a.second, b.second)};
}
void bs(int idx) {
int s = idx, e = n - 1, mid, ans1 = -1, ans2 = -1;
while (s <= e) {
mid = (s + e) >> 1;
pair<int, int> t = qry(1, 0, n - 1, idx, mid);
if (t.first > t.second)
e = mid - 1;
else if (t.first < t.second)
s = mid + 1;
else
e = mid - 1, ans1 = mid;
}
s = idx, e = n - 1;
while (s <= e) {
mid = (s + e) >> 1;
pair<int, int> t = qry(1, 0, n - 1, idx, mid);
if (t.first > t.second)
e = mid - 1;
else if (t.first < t.second)
s = mid + 1;
else
s = mid + 1, ans2 = mid;
}
if (~ans1 && ~ans2) out += ans2 - ans1 + 1;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++i) cin >> arr1[i];
for (int i = 0; i < n; ++i) cin >> arr2[i];
bld(1, 0, n - 1);
for (int i = 0; i < n; ++i) bs(i);
cout << out;
return 0;
}
| 10 | CPP |
q = int(input())
while q:
a, b = map(int, input().split())
if a == b:
print(0)
elif a % 2 == b % 2:
if a < b:
print(2)
else:
print(1)
else:
if a < b:
print(1)
else:
print(2)
q -= 1 | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool debug = 1;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
long long ln, lk, lm;
int d[200105], h[200105];
long long sd[200105];
int M;
pair<long long, int> T[2][530000];
void update(int id, int l, long long v) {
l += M;
if (id == 0)
T[id][l] = {v, -(l - M)};
else
T[id][l] = {v, l - M};
while (l > 1) {
T[id][l >> 1] = max(T[id][l], T[id][l ^ 1]);
l >>= 1;
}
}
pair<long long, int> qy(int id, int l, int r) {
assert(l <= r);
pair<long long, int> ans = {-(1LL << 60), 0};
for (l = l + M - 1, r = r + M + 1; l ^ r ^ 1; l >>= 1, r >>= 1) {
if (~l & 1) {
if (T[id][l ^ 1] > ans) {
ans = T[id][l ^ 1];
}
}
if (r & 1 && T[id][r ^ 1] > ans) {
ans = T[id][r ^ 1];
}
}
return ans;
}
void init() {
for (int(i) = 1; (i) <= (int)(n + n); (i)++) sd[i] = d[i] + sd[i - 1];
for (M = 1; n + n + 2 > M; M <<= 1)
;
for (int(i) = 1; (i) <= (int)(n + n); (i)++) {
long long val = sd[i - 1] + h[i] * 2;
update(1, i, val);
val = h[i] * 2 - sd[i - 1];
update(0, i, val);
}
}
void cal(int x, int y) {
assert(x + 1 <= y);
vector<pair<long long, int>> ls, rs;
ls.push_back(qy(0, x, y));
rs.push_back(qy(1, x, y));
if (-ls[0].second > x) {
ls.push_back(qy(0, x, -ls[0].second - 1));
}
if (-ls[0].second < y) {
ls.push_back(qy(0, -ls[0].second + 1, y));
}
if (rs[0].second > x) {
rs.push_back(qy(1, x, rs[0].second - 1));
}
if (rs[0].second < y) {
rs.push_back(qy(1, rs[0].second + 1, y));
}
long long ans = -(1LL << 60);
for (int(i) = 0; (i) < (int)(ls.size()); (i)++)
for (int(j) = 0; (j) < (int)(rs.size()); (j)++) {
if (-ls[i].second < rs[j].second) {
ans = max(ans, ls[i].first + rs[j].first);
}
}
printf("%lld\n", ans);
}
int main() {
scanf("%d%d", &n, &m);
for (int(i) = 1; (i) <= (int)(n); (i)++) {
scanf("%d", d + i);
d[i + n] = d[i];
}
for (int(i) = 1; (i) <= (int)(n); (i)++) {
scanf("%d", h + i);
h[i + n] = h[i];
}
init();
for (int a, b, i = 0, x, y; i < m; i++) {
scanf("%d%d", &a, &b);
if (a <= b) {
x = b + 1;
y = a + n - 1;
} else {
x = b + 1;
y = a - 1;
}
cal(x, y);
}
return 0;
}
| 11 | CPP |
n,y=map(int,input().split())
for i in range(n+1):
for j in range(n+1-i):
x=n-i-j
if 1000*i+5000*j+10000*x==y:
print(x,j,i)
exit()
print(-1,-1,-1)
| 0 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int a[200010],b[200010];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++) {scanf("%d",a+i);b[i]=a[i];}
sort(b,b+n);
for(int i=0;i<n;i++) if(a[i]==b[n-1]) cout<<b[n-2]<<endl; else cout<<b[n-1]<<endl;
return 0;
} | 0 | CPP |
def main():
n, m = (int(x) for x in input().split())
lst = [int(x) for x in input().split()]
lst.sort()
c_min = lst[m - 1]
for it in range(0, m - n + 1):
c_min = min(c_min, lst[it + n - 1] - lst[it])
print(c_min)
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
#if 0
2020.03.21
考虑一个暴力的贪心做法，从大到小枚举 S = x + y + z ，
然后对于所有 (x, y, z) ，如果之前没有与之连边的点被选，那么这个点一定要出现在最优解中。
可以给边定向，边从小连到大，那么整个图就是 DAG ，在 DAG 中抽象这个贪心：
每次选择一个点满足其到的点都没有被选，然后删掉选择它加入最优解集合。
那么一个点被选当且仅当其到的点都没被选，一个点没被选当且仅当其到的点存在被选的点（或没有出度）。
这可以对应到博弈中的必胜必败态，这个 DAG 可以看做博弈转移图，答案就是求所有必败态的权值和。
然而点数很大。
考虑对于一个 (x, y, z) ，如何快速求出其必胜必败态，
每次移动只能移动一维，这个博弈三维独立，就相当于每个维度有一个子游戏。
对于每一维求出 SG 值 f[x], g[y], h[z] ，三者异或和就是这个的 SG 值。
考虑计数，FWT 做异或卷积即可（事实上也可以三维暴力枚举 SG 值，SG 值的上界是 O(sqrt(M)) 的）。
#endif
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
struct {
inline operator int () { int x; return scanf("%d", &x), x; }
} read;
const int maxn = 200005, mod = 998244353;
std::vector<int> G[maxn];
int sg[3][maxn];
ll f[3][maxn], g[maxn];
ll po[maxn * 3];
void FWT (ll *a, int n) {
for (int m = 1; m < n; m <<= 1)
for (int i = 0; i < n; i += m << 1)
for (int k = i; k < i + m; k ++) {
ll x = a[k], y = a[k + m];
(a[k] = x + y) %= mod;
(a[k + m] = x + mod - y) %= mod;
}
}
void iFWT (ll *a, int n) {
FWT(a, n);
ll inv = mod - (mod - 1) / n;
for (int i = 0; i < n; i ++)
(a[i] *= inv) %= mod;
}
int main () {
int n = read, len = 1;
while (len < n)
len <<= 1;
po[0] = 1;
ll bs = 1000000000000000000ll % mod;
for (int i = 1; i <= n * 3; i ++)
po[i] = po[i - 1] * bs % mod;
for (int o = 0; o < 3; o ++) {
int m = read;
for (int i = 1; i <= n; i ++)
G[i].clear();
for (int i = 1; i <= m; i ++) {
int u = read, v = read;
if (u < v) G[u].push_back(v);
if (v < u) G[v].push_back(u);
}
for (int i = n; i; i --) {
std::set<int> mex;
for (int j : G[i])
mex.insert(sg[o][j]);
while (mex.count(sg[o][i]))
++ sg[o][i];
}
for (int i = 1; i <= n; i ++)
(f[o][sg[o][i]] += po[i]) %= mod;
/* FWT(f[o], len); */
}
ll ans = 0;
for (int i = 0; i < 500; i ++)
for (int j = 0; j < 500; j ++)
(ans += f[0][i] * f[1][j] % mod * f[2][i ^ j]) %= mod;
printf("%lld\n", ans);
/* for (int i = 0; i < len; i ++) */
/* g[i] = f[0][i] * f[1][i] % mod * f[2][i] % mod; */
/* iFWT(g, len); */
/* printf("%lld\n", g[0]); */
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef map<string, int> msi;
typedef vector<pair<int, int> > vii;
typedef priority_queue<pair<int, int>, vector<pair<int, int> >,
greater<pair<int, int> > >
pq;
list<int>::iterator it;
list<int>::iterator it1;
vector<int>::iterator it2;
vector<int>::iterator it3;
set<int>::iterator it4;
map<string, int>::iterator it5;
vector<pair<int, int> >::iterator iter;
int main(int argc, char* argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k, x;
cin >> n >> k;
queue<int> q;
set<int> s;
for (int i = 0; i < n; i++) {
cin >> x;
if (!s.count(x)) {
if (int(q.size()) >= k) {
int cur = q.front();
q.pop();
s.erase(cur);
}
s.insert(x);
q.push(x);
}
}
vector<int> v;
while (!q.empty()) {
v.push_back(q.front());
q.pop();
}
reverse(v.begin(), v.end());
cout << v.size() << endl;
for (auto ite : v) cout << ite << " ";
cout << endl;
return 0;
}
| 8 | CPP |
d={}
for i in range(int(input())+1):
for j in d:
while i>1 and i%j<1:
d[j]+=1
i//=j
if i>1:
d[i]=2
a=1
for v in d.values():
a=a*v%(10**9+7)
print(a) | 0 | PYTHON3 |
#include<iostream>
using namespace std;
long long gcd(long long x,long long y){
if(y==0)return x;
return gcd(y,x%y);
}
int main(){
ios::sync_with_stdio(0);
long long n,a,b,c,d;
cin>>n;
for(int i=0;i<n;++i){
cin>>a>>b>>c>>d;
if(a<b||b>d){
cout<<"No\n";
continue;
}
if(b<=c+1){
cout<<"Yes\n";
continue;
}
long long g=gcd(b,d);
if((a%g)+b-g>c)cout<<"No\n";
else cout<<"Yes\n";
}
return 0;
} | 0 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.