solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
import math, sys
def mp():
return list(map(int, input().split()))
def main():
n = int(input())
for i in range(n):
x = int(input())
print(x // 2)
deb = 0
if deb:
file = open('input.txt', 'w')
else:
input = sys.stdin.readline
main() | 7 | PYTHON3 |
n = int(input())
tower = {}
ans = 0
for x in input().split():
x = int(x)
if x not in tower:
tower[x] = 1
else:
tower[x] += 1
ans = max(ans, tower[int(x)])
print('{} {}'.format(ans, len(tower)))
| 7 | PYTHON3 |
for s in[*open(0)][2::2]:
l=[*map(int,s.split())]
q=l[::2];qn=len(q)
w=l[1::2];wn=len(w)
n=len(l)
c=[]
s=[0,0]
m=[1e15,1e15]
p=[n,n]
for i in range(n):
x=i&1
m[x]=min(m[x],l[i])
s[x]+=l[i]
p[x]-=1
c+=[s[x]+p[x]*m[x]]
print(min(x+y for x,y in zip(c,c[1:]))) | 9 | PYTHON3 |
*l,=eval("list(input()),"*3);x=0
while l[x]:x=ord(l[x].pop(0))-97
print("ABC"[x]) | 0 | PYTHON3 |
from math import *
from random import *
for t in range(int(input())):
a, b = map(int, input().split())
if a < b:
a, b = b, a
otv = 0
if a > b:
if (a - b) >= b:
print(b)
continue
else:
p = (a - b)
a -= p * 2
b -= p
otv += p
otv += (a // 3) * 2
a %= 3
b %= 3
if (a == 2 and b == 1) or (a == 1 and b == 2) or (a == 2 and b == 2):
otv += 1
print(otv) | 7 | PYTHON3 |
import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
ai, bi = map(int, input().split())
if 2*bi-ai>=0 and 2*ai-bi>=0 and (2*bi-ai)%3==0 and (2*ai-bi)%3==0:
print('YES')
else:
print('NO') | 8 | PYTHON3 |
#include <stdio.h>
#define inf 999999999
int main(){
int h,w,cost[50][50],cnt;
char s[50][50];
scanf("%d%d",&h,&w);
for(int i=0;i<h;i++) scanf("%s",s[i]);
for(int i=0;i<h;i++) for(int j=0;j<w;j++) cost[i][j]=inf;
cost[0][0]=1;
for(int k=1;cost[h-1][w-1]==inf;k++){
cnt=0;
for(int i=0;i<h;i++) for(int j=0;j<w;j++){
if(cost[i][j]==k){
cnt++;
if(i>0&&s[i-1][j]=='.'&&cost[i-1][j]>k)cost[i-1][j]=k+1;
if(j>0&&s[i][j-1]=='.'&&cost[i][j-1]>k)cost[i][j-1]=k+1;
if(i<49&&s[i+1][j]=='.'&&cost[i+1][j]>k)cost[i+1][j]=k+1;
if(j<49&&s[i][j+1]=='.'&&cost[i][j+1]>k)cost[i][j+1]=k+1;
}
}
if(cnt==0){
printf("-1\n");
return 0;
}
}
cnt=0;
for(int i=0;i<h;i++) for(int j=0;j<w;j++) if(s[i][j]=='.') cnt++;
printf("%d\n",cnt-cost[h-1][w-1]);
} | 0 | CPP |
def solve():
# put code here
n=int(input())
arr=[int(v) for v in input().split()]
distmp={}
lastidx={}
inf=n*10
ans=[inf] + [inf]*n
for i in range(n):
if arr[i] in lastidx:
distmp[arr[i]] = max(distmp[arr[i]], i-lastidx[arr[i]])
else:
distmp[arr[i]] = i+1
lastidx[arr[i]]=i
for k in lastidx.keys():
distmp[k] = max(distmp[k], n-lastidx[k])
#print(distmp)
for i in range(1,n+1):
if i in distmp:
ans[distmp[i]] = min(i, ans[distmp[i]])
for i in range(1, n+1):
ans[i]=min(ans[i-1], ans[i])
for i in range(n+1):
if ans[i]==inf:
ans[i]=-1
print(*ans[1:])
t = int(input())
for _ in range(t):
solve()
| 7 | PYTHON3 |
w = int(input());
if(w <= 2):
print ("No")
elif w % 2 == 0:
print("Yes")
else:
print("No") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
template <typename T>
void print(T v) {
for (auto i = v.begin(); i != v.end(); i++) cout << setw(2) << *i << " ";
cout << endl;
}
template <typename T>
void print_vv(T v, bool same_line = true) {
for (auto i = 0; i < v.size(); i++) {
cout << "{";
for (auto j = 0; j != v[i].size(); j++) {
cout << setw(3) << v[i][j] << ",";
}
cout << "},";
if (same_line) cout << endl;
}
cout << endl;
}
int main() {
long long n;
while (cin >> n) {
long long five =
(n + 4) / 1 * (n + 3) / 2 * (n + 2) / 3 * (n + 1) / 4 * n / 5;
long long three = (n + 2) / 1 * (n + 1) / 2 * n / 3;
cout << five * three << endl;
}
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, ans = 0; cin >> A >> B >> C;
while (C > 0) {
ans++;
if (ans % 7 != 0) {
C -= A;
} else {
C -= (A+B);
}
}
cout << ans << endl;
}
| 0 | CPP |
def f(x):
if x % 10 == 0:
return x // 10
return x-1
l, k = input().split()
l, k = int(l), int(k)
for i in range(k):
l = f(l)
print(l) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100006;
int lab[MAXN];
map<int, vector<int> > v[MAXN];
set<int> s[MAXN];
vector<int> cc[MAXN], allV[MAXN];
int getRoot(int a) {
while (lab[a] >= 0) a = lab[a];
return a;
}
void dsu(int a, int b) {
int x = lab[a] + lab[b];
if (lab[a] < lab[b]) {
lab[a] = x;
lab[b] = a;
for (auto i : cc[b]) {
for (auto j : allV[i]) {
s[j].erase(b);
s[j].insert(a);
}
}
for (auto i : cc[b]) cc[a].push_back(i);
cc[b].clear();
} else {
lab[b] = x;
lab[a] = b;
for (auto i : cc[a]) {
for (auto j : allV[i]) {
s[j].erase(a);
s[j].insert(b);
}
}
for (auto i : cc[a]) cc[b].push_back(i);
cc[a].clear();
}
}
void addEdge2(int x, int y) {
int m = getRoot(x);
int n = getRoot(y);
if (m == n) {
return;
}
dsu(m, n);
}
void addEdge(int x, int y, int c) {
if (v[y][c].size()) {
addEdge2(x, v[y][c][0]);
}
if (v[x][c].size()) {
addEdge2(y, v[x][c][0]);
}
v[x][c].push_back(y);
v[y][c].push_back(x);
allV[x].push_back(y);
allV[y].push_back(x);
s[x].insert(getRoot(y));
s[y].insert(getRoot(x));
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int n, m, c, q;
cin >> n >> m >> c >> q;
for (int i = 1; i <= n; i++) {
lab[i] = -1;
cc[i].push_back(i);
}
for (int i = 1; i <= m; i++) {
int x, y, c;
cin >> x >> y >> c;
addEdge(x, y, c);
}
for (int i = 1; i <= q; i++) {
char c;
cin >> c;
if (c == '+') {
int x, y, c;
cin >> x >> y >> c;
addEdge(x, y, c);
} else {
int x, y;
cin >> x >> y;
int u = getRoot(x);
if (s[y].find(u) != s[y].end() || u == getRoot(y)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
return 0;
}
| 12 | CPP |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5;
int t;
ll n;
ll d[N];
ll sum, ans;
int main() {
cin >> t;
while (t--) {
cin >> n;
sum = 0;
ans = 0;
for (int i = 1; i <= n; i++) {
cin >> d[i];
}
sort(d + 1, d + n + 1);
for (int i = 3; i <= n; i++) {
ans += d[i] * (i - 2);
}
for (int i = 2; i <= n - 2; i++) {
ans -= d[i] * (n - i - 1);
}
//for (int i = 2; i <= n; i++) {
// for (int j = 1; j <= n - i; j++) {
// ans += d[j + i] - d[j];
// }
//}
cout << -ans << endl;
}
return 0;
}
| 7 | CPP |
import sys
input = sys.stdin.readline
from collections import deque, defaultdict
N, M = map(int, input().split())
ins = [0]*N
outs = defaultdict(list)
for _ in range(N+M-1):
Ai, Bi = map(int, input().split())
ins[Bi-1] += 1
outs[Ai-1].append(Bi-1)
ans = [-1]*N
q = deque([i for i in range(N) if ins[i]==0])
while q:
v = q.popleft()
for nv in outs[v]:
ins[nv] -= 1
if ins[nv]==0:
ans[nv] = v
q.append(nv)
for ans_i in ans:
print(ans_i+1) | 0 | PYTHON3 |
# ========== //\\ //|| ||====//||
# || // \\ || || // ||
# || //====\\ || || // ||
# || // \\ || || // ||
# ========== // \\ ======== ||//====||
# code
def solve():
n, k = map(int, input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
return
diff = 1
ans = 1
for i, v in enumerate(a):
if i > 0:
if v == a[i - 1]:
continue
else:
diff += 1
if diff > k:
ans += 1
diff = 2
if diff > k:
print(-1)
else:
print(ans)
return
def main():
t = 1
t = int(input())
for _ in range(t):
solve()
if __name__ == "__main__":
main() | 8 | PYTHON3 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
char_list = list(map(chr,range(ord('a'),ord('z')+1)))
char_list += list(map(chr,range(ord('A'),ord('Z')+1)))
while True:
n = int(input())
if n == 0:
break
keys = list(map(int,input().split(" ")))
sentence = input()
for i in range(len(sentence)):
if sentence[i].isupper():
j = ord(sentence[i]) - ord('A') + 26
else:
j = ord(sentence[i]) - ord('a')
print(char_list[j-keys[i%len(keys)]],end="")
print() | 0 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
suma=0
for i in a:
suma+=i
sumb=0
for i in b:
sumb+=i
sumc=0
for i in c:
sumc+=i
print(suma-sumb)
print(sumb-sumc)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, x, b[100];
cin >> n;
for (i = 0; i < n; i++) {
cin >> x;
b[x] = i + 1;
}
for (i = 1; i <= n; i++) cout << b[i] << " ";
}
| 7 | CPP |
n = int(input())
ls = input()
ls = ls.split()
for i in range(len(ls)):
flag = 0
for j in range(i+1,len(ls)):
if ls[j] == ls[i]:
flag = 1
break
if flag == 1:
continue
if flag == 0:
break
print(i+1)
| 7 | PYTHON3 |
// JOI 2012-2013 予選2
#include<iostream>
#include<string>
int main()
{
int N;
std::string shop;
int ans = 0;
std::cin >> N >> shop;
for( int i = 0; i != N; ++i )
{
std::string s;
std::cin >> s;
std::string::size_type p;
while( ( p = s.find( shop[0] ) ) != std::string::npos )
{
for( int j = 0; p + j * ( shop.size() - 1 ) < s.size(); ++j )
{
bool f = true;
int c = 0;
for( int k = p; k < s.size() && c < shop.size(); k += j + 1 )
f &= s[k] == shop[c++];
if( f && c == shop.size() )
{
++ans;
goto end;
}
}
s = s.substr( p + 1 );
}
end:;
}
std::cout << ans << std::endl;
return 0;
} | 0 | CPP |
from fractions import Fraction
(a,b)=[int(i) for i in input().split()]
c=7-max(a,b)
f=Fraction(c,6)
if f==1:
print("1/1")
else: print(f)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int t[200003];
int req[200003];
deque<int> idx[200003];
int train[200003];
set<int> mi;
void del(int k) {
int e = idx[k].front();
idx[k].pop_front();
mi.erase(mi.find(e));
}
void add(int k, int v) {
idx[k].push_back(v);
mi.insert(v);
}
int small() { return *mi.begin(); }
int best = 2147483647;
int desire = 0, curr = 0;
bool met = false;
void calc(int r) {
int l = small();
best = min(best, r - l + 1 - desire);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 1; i < (n + 1); i++) cin >> t[i];
int r = 0;
for (int i = 1; i < (m + 1); i++) {
int h;
cin >> h;
req[i] = h;
desire += h;
if (h != 0) r++;
}
for (int i = 1; i < (n + 1); i++) {
int k = t[i];
train[k]++;
if (train[k] == req[k]) curr++;
add(k, i);
if (train[k] > req[k]) {
train[k] = req[k];
del(k);
}
if (curr == r) {
calc(i);
met = true;
}
}
if (curr != r)
cout << -1;
else
cout << best;
}
| 12 | CPP |
n = int(input())
if n == 1:
print(-1)
exit(0)
print(n, n+1, n*(n+1))
| 9 | PYTHON3 |
#include <iostream>
using namespace std;
#define INF 1000000007LL
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<n;i++)
int n,r,p[55],c[55];
int main(){
while(cin>>n>>r && n){
rep(i,r)cin>>p[i]>>c[i];
int x=1;
for(int i=r-1;i>=0;i--){
if(x<=c[i])x+=p[i]-1;
else if(x<=c[i]+p[i]-1)x-=c[i];
}
cout<<n+1-x<<endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10, inf = 0x3f3f3f3f, mod = 1e9 + 7;
int hd[N][10], ne, n, m, dp[N], tot;
struct E {
int v, nxt;
} e[N << 1];
void addedge(int u, int v, int c) { e[ne] = {v, hd[u][c]}, hd[u][c] = ne++; }
queue<int> q;
vector<int> vec;
int upd(int u, int x) {
if (!~dp[u]) {
dp[u] = x, q.push(u);
return 1;
}
return 0;
}
void bfs() {
memset(dp, -1, sizeof dp);
while (q.size()) q.pop();
upd(1, 0), q.push(-1);
while (q.size()) {
vec.clear();
for (; q.front() != -1; q.pop()) vec.push_back(q.front());
q.pop();
for (int c = 0; c <= 9; ++c) {
int f = 0;
for (int u : vec)
for (int i = hd[u][c]; ~i; i = e[i].nxt)
if (upd(e[i].v, ((long long)dp[u] * 10 + c) % mod)) f = 1;
if (f) q.push(-1);
}
}
}
int main() {
memset(hd, -1, sizeof hd), ne = 0;
scanf("%d%d", &n, &m);
tot = n;
for (int i = 1; i <= m; ++i) {
int u, v;
scanf("%d%d", &u, &v);
int c = i;
if (c / 10) {
addedge(++tot, u, c % 10), addedge(++tot, v, c % 10), c /= 10;
for (; c / 10; c /= 10)
++tot, addedge(tot, tot - 2, c % 10), ++tot,
addedge(tot, tot - 2, c % 10);
addedge(v, tot - 1, c), addedge(u, tot, c);
} else
addedge(u, v, c), addedge(v, u, c);
}
bfs();
for (int i = 2; i <= n; ++i) printf("%d\n", dp[i]);
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int fav[1111], app[1111], a[1111][1111], poss[1111][1111];
int ans[1111], n;
void init() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
scanf("%d", &a[i][j]);
poss[i][a[i][j]] = j;
}
}
for (int i = 1; i <= n; ++i) {
int x;
scanf("%d", &x);
fav[x] = i;
}
}
int vis[1111];
void solve() {
for (int i = 1; i <= n; ++i) {
for (int p = 1; p <= n; ++p) {
int t = -1;
for (int j = 1; j <= i; ++j)
if (j != p) {
if (t == -1) t = j;
if (fav[j] < fav[t]) t = j;
}
if (t != -1) {
if (ans[p] == 0) ans[p] = t;
if (poss[p][t] < poss[p][ans[p]]) ans[p] = t;
}
}
}
}
void print() {
for (int i = 1; i <= n; ++i) printf("%d%c", ans[i], i == n ? '\n' : ' ');
}
int main() {
init();
solve();
print();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair <int,int>
#define F first
#define S second
#define ever (;;)
int T,n,a[100100];
map <int,int> mp;
void _clear()
{
mp.clear();
}
int main()
{
scanf("%d",&T);
while(T--)
{
_clear();
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
mp[a[i]]++;
}
for(int i=1;i<=n;i++)
if( mp[a[i]] == 1 )
cout<<i<<endl;
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, X, Y;
int dx[200005] = {0}, dy[200005] = {0};
bool Check(int len) {
for (int i = 1; i + len - 1 <= n; i++) {
int tx = X - dx[i - 1] - (dx[n] - dx[i + len - 1]),
ty = Y - dy[i - 1] - (dy[n] - dy[i + len - 1]);
if (len >= abs(tx) + abs(ty) && ((len - abs(tx) - abs(ty)) % 2 == 0))
return 1;
}
return 0;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
char s;
cin >> s;
if (s == 'U') dy[i]++;
if (s == 'D') dy[i]--;
if (s == 'L') dx[i]--;
if (s == 'R') dx[i]++;
}
scanf("%d%d", &X, &Y);
for (int i = 1; i <= n; i++) {
dx[i] += dx[i - 1];
dy[i] += dy[i - 1];
}
int L = 0, R = n, mid;
while (L < R) {
mid = (L + R) / 2;
if (Check(mid))
R = mid;
else
L = mid + 1;
}
if (!Check(L))
cout << -1;
else
cout << L;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n,s,dp[3300],mol=998244353,ans;
int main()
{
cin>>n>>s;
for(int i=1;i<=n;i++)
{
int x; cin>>x;
dp[0]=i;
for(int j=s;j>=x;j--) dp[j]=(dp[j]+dp[j-x])%mol;
ans=(ans+dp[s])%mol;
}
cout<<ans<<endl;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, sz[N], a[N], c, ret, dp[N];
pair<int, int> m[N][2];
vector<int> adj[N];
void dfs(int x, int p) {
int f = 0, u, i, d;
dp[x] = 0;
if (!sz[x]) f = 1, ++sz[x];
d = a[x] >= c ? 1 : 0;
for (i = 0; i < adj[x].size(); ++i) {
u = adj[x][i];
if (u != p) {
dfs(u, x);
if (f) sz[x] += sz[u];
if (dp[u] == sz[u])
dp[x] += dp[u];
else {
if (m[x][0].first <= dp[u])
m[x][1] = m[x][0], m[x][0] = make_pair(dp[u], u);
else if (m[x][1].first < dp[u])
m[x][1] = make_pair(dp[u], u);
}
}
}
dp[x] += d + m[x][0].first;
if (d == 0) dp[x] = 0;
}
int ar[3];
void dfs2(int x, int p, int d) {
int v = 0, u, i, t = d, nd;
if (a[x] >= c) {
if (d == n - sz[x]) v = d, t = 0;
ar[0] = m[x][0].first, ar[1] = m[x][1].first, ar[2] = t;
sort(ar, ar + 3);
ret = max(ret, dp[x] + ar[2] + ar[1] + v - m[x][0].first);
}
for (i = 0; i < adj[x].size(); ++i) {
u = adj[x][i];
if (u != p) {
nd = dp[x] - m[x][0].first + max(m[x][0].first, t) + v;
if (u == m[x][0].second)
nd = dp[x] - m[x][0].first + max(m[x][1].first, t) + v;
else if (sz[u] == dp[u])
nd -= sz[u];
if (a[x] < c) nd = 0;
dfs2(u, x, nd);
}
}
}
int main() {
int i, x, y, q, l, r, k, mid;
cin >> n >> k;
for (i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (i = 0; i < n - 1; ++i)
scanf("%d%d", &x, &y), adj[x].push_back(y), adj[y].push_back(x);
dfs(1, 0);
l = 1, r = 1e6;
while (l < r) {
mid = (l + r + 1) / 2;
c = mid;
memset(m, 0, sizeof(m));
ret = 0;
dfs(1, 0);
dfs2(1, 0, 0);
if (ret >= k)
l = mid;
else
r = mid - 1;
}
printf("%d\n", l);
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k1, k2, k, possible = 1, sum = 0;
cin >> n >> k1 >> k2;
long long int a[n], b[n], i, j, diff[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
if (a[i] > b[i])
diff[i] = a[i] - b[i];
else
diff[i] = b[i] - a[i];
}
sort(diff, diff + n, greater<int>());
k = k1 + k2;
i = 0;
while (k > 0 && i < n) {
if (diff[0] != 0) {
diff[0]--;
k--;
}
sort(diff, diff + n, greater<int>());
if (diff[0] == 0) break;
}
if (k > 0) {
if (k % 2 == 0)
sum = 0;
else
sum = 1;
} else {
for (i = 0; i < n; i++) {
sum += diff[i] * diff[i];
}
}
cout << sum;
return 0;
}
| 8 | CPP |
#include <iostream>
using namespace std;
int main(){
int N;
while(cin >> N && N>0){
int pt,total,max,min;
total=0;
max=0;
min=1000;
for(int i=0;i<N;i++){
cin >> pt;
if(pt>max) max=pt;
if(pt<min) min=pt;
total+=pt;
}
cout << (total-min-max)/(N-2) << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long s = 0, m = 0, a;
vector<long long> v(14), u(14);
for (int i = 0; i < 14; i++) {
cin >> v[i];
u[i] = v[i];
}
for (int i = 0; i < 14; i++) {
a = v[i];
v[i] = 0;
int k = a / 14;
int h = a % 14;
for (int j = 1; j <= h; j++) {
v[(i + j) % 14]++;
}
for (int j = 0; j < 14; j++) {
if ((v[j] + k) % 2 == 0) s += v[j] + k;
v[j] = u[j];
}
m = max(s, m);
s = 0;
}
cout << m;
return 0;
}
| 8 | CPP |
n=input()
from math import ceil
stroka=ceil(len(n)/20)
if len(n)%stroka> 0:
stolb=(len(n)//stroka)+1
zvezda=stroka-len(n)%stroka
else:
stolb=(len(n)//stroka)
zvezda=0
p=0
for i in range(zvezda):
n=n[0:i*stolb]+'*'+n[i*stolb:]
print(stroka,stolb)
for i in range(stroka):
for j in range(stolb):
print(n[j+p],end='')
p+=stolb
print()
| 8 | PYTHON3 |
n=input()
a=[]
cnt=0
for _ in n:
a.append(_)
for i in a:
if int(i)%10==4 or int(i)%10==7:
cnt+=1
if cnt==4 or cnt==7:
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[105], b[105];
void get(int x, int *q) {
if (x == 1) {
q[1] = 1;
} else if (x == 2) {
q[1] = 3;
q[2] = 4;
} else {
for (int i = 1; i < x; i++) q[i] = 2;
q[x] = x - 2;
}
}
int main() {
scanf("%d%d", &n, &m);
get(n, a);
get(m, b);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) printf("%d ", a[i] * b[j]);
puts("");
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
string toString(long long num) {
stringstream ss;
ss << num;
string str = ss.str();
return str;
}
long long toLong(string str) {
long long res;
istringstream ss(str);
ss >> res;
return res;
}
int main() {
long long n, k, current = 1, step = 1, cycle = 0, res = 1;
cin >> n >> k;
k = min(k, n - k);
for (int i = 1; i <= n; i++) {
current += k;
step = cycle * 2 + 1;
if (current > n) {
current -= n;
cycle++;
step++;
}
res += step;
if (i == n) res--;
cout << res << endl;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
const int MOD = 998244353;
vector<int> G[MAXN];
long long dp[MAXN][3];
long long mul(int x, int y) { return 1LL * x * y % MOD; }
long long add(int x, int y) {
x += y;
if (x >= MOD) x -= MOD;
return x;
}
long long add(int x, int y, int z) { return add(x, add(y, z)); }
long long sub(int x, int y) {
x -= y;
if (x < 0) x += MOD;
return x;
}
long long pow_mod(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) res = mul(res, a);
a = mul(a, a);
b >>= 1;
}
return res;
}
void dfs(int u) {
if (G[u].size() == 0) {
dp[u][0] = 0;
dp[u][1] = 0;
dp[u][2] = 1;
return;
}
dp[u][0] = 1;
dp[u][1] = 0;
dp[u][2] = 0;
for (auto v : G[u]) {
dfs(v);
dp[u][2] = mul(dp[u][2], add(dp[v][0], dp[v][1], mul(2, dp[v][2])));
dp[u][2] = add(dp[u][2], mul(dp[u][1], add(dp[v][1], dp[v][2])));
dp[u][1] = mul(dp[u][1], add(dp[v][0], dp[v][2]));
dp[u][1] = add(dp[u][1], mul(dp[u][0], add(dp[v][1], dp[v][2])));
dp[u][0] = mul(dp[u][0], add(dp[v][0], dp[v][2]));
}
}
int main() {
int n;
scanf("%d", &n);
for (int i = 2; i <= n; i++) {
int x;
scanf("%d", &x);
G[x].push_back(i);
}
dfs(1);
printf("%lld", add(dp[1][0], dp[1][2]));
return 0;
}
| 12 | CPP |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl;}
#define SHOW2d(v,WW,HH) {REP(W_,WW){REP(H_,HH)cerr << v[W_][H_] << ' ';cerr << endl;}}
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,ll> P;
struct UF
{
vector<int> par; // 親のインデックスを記憶する配列
vector<int> sz; // サイズを記憶する。
vector<int> rank;
vector<int> val;
// 初期化
UF(int n):par(n),sz(n),val(n),rank(n){
for(int i = 0; i < n; i++){
par[i] = i;sz[i] = 1;rank[i] = 0;
}
}
// 親を求める
int find(int x) {
if (par[x] == x) return x;
else return par[x] = find(par[x]);
}
// xとyの属する集合を併合
void unite(int x, int y) {
x = find(x); y = find(y);
if (x == y) return;
if(rank[x] < rank[y]){
par[x] = y;
sz[y] += sz[x];
val[y] += val[x];
}
else{
par[y] = x;
sz[x] += sz[y];
val[x] += val[y];
if(rank[x] == rank[y])rank[x]++;
}
}
// xとyが同じ集合ならtrue
bool same(int x, int y) { return find(x) == find(y); }
// 素の集合のサイズを求める
int size(int n){return sz[find(n)];}
int value(int n){return val[find(n)];}
};
const ll N = 5005;
ll dp[N][N];
ll kaijo[N];
ll kake[N];
void mod_add(ll &a, ll b){
a += b;
a %= MOD;
}
int main(){
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
ll n;cin >> n;
kaijo[0] = 1;
for(ll i = 1;i < N;i++)kaijo[i] = kaijo[i-1] * i % MOD;
kake[0] = 1;
REP(i, N - 1)kake[i+1] = kake[i] * (n-1) % MOD;
ll k = 0;
UF uf(n);
vector<ll> v(n);REP(i, n)cin >> v[i];
REP(i, n){
if(v[i] != -1)continue;
uf.val[i] = 1;
k++;
}
REP(i, n){
if(v[i] == -1)continue;
v[i]--;
uf.unite(i, v[i]);
}
ll ans = 0;
ll base = n;
vector<ll> ki;
REP(i, n){
if(uf.find(i) != i)continue;
if(uf.value(i) == 0){
base--;
continue;
}
ki.PB(uf.size(i));
}
mod_add(ans, base * kake[k]);
dp[0][0] = 1;
REP(i, ki.size()){
REP(j, i+1){
mod_add(dp[i+1][j+1], dp[i][j] * ki[i]);
mod_add(dp[i+1][j], dp[i][j]);
}
}
ll mai = 0;
REP(i, ki.size()){
mod_add(mai, (ki[i] - 1) * kake[k-1]);
}
REP(i, k+1){
if(i < 2)continue;
mod_add(mai, ((dp[ki.size()][i] * kaijo[i-1]) % MOD) * kake[k - i]);
}
mod_add(ans, MOD - mai);
cout << ans << endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 200001;
vector<int> G[maxN];
int in[maxN], inctr;
struct Three {
int a, b, c;
Three(int e = 0, int f = 0, int g = 0) : a(e), b(f), c(g) {}
};
vector<Three> res;
void f(int& dep, int newv, int v) {
if (dep == 0)
dep = newv;
else
res.push_back(Three(dep, v, newv)), dep = 0;
}
bool dfs(int v, int father) {
in[v] = ++inctr;
int dep = 0;
for (int u : G[v]) {
if (u == father or in[u] > in[v]) continue;
if (in[u] != 0) {
f(dep, u, v);
continue;
}
if (dfs(u, v)) f(dep, u, v);
}
if (father != 0) f(dep, father, v);
return dep != 0;
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
while (m--) {
int a, b;
scanf("%d%d", &a, &b);
G[a].push_back(b);
G[b].push_back(a);
}
for (int i = 1; i <= n; i++)
if (in[i] == 0) dfs(i, 0);
printf("%d\n", (int)res.size());
for (Three t : res) printf("%d %d %d\n", t.a, t.b, t.c);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
const long long inf = 0x3f3f3f3f3f3f3f3LL;
const long long mod = (long long)1e9 + 7;
using namespace std;
template <class T>
void smin(T& a, T val) {
if (a > val) a = val;
}
template <class T>
void smax(T& a, T val) {
if (a < val) a = val;
}
const long long N = 2 * (long long)1e5 + 10;
long long n, a[N], T, p[N];
vector<pair<long long, long long> > v;
bool cp(long long L, long long R) { return v[L].first < v[R].first; }
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> T;
v.resize(n);
for (long long i = 0; i < n; ++i) {
cin >> v[i].second >> v[i].first;
p[i] = i;
}
sort(p, p + n, cp);
long long low = 0, high = n, ans = -1;
while (low <= high) {
long long score = (low + high) >> 1;
long long vals = T, problems = 0;
for (long long i = 0; i < n; ++i) {
if (problems < score and vals >= v[p[i]].first and
score <= v[p[i]].second) {
vals -= v[p[i]].first;
++problems;
}
if (problems == score) break;
}
if (problems == score) {
ans = score;
low = score + 1;
} else {
high = score - 1;
}
}
cout << ans << '\n';
cout << ans << '\n';
long long vals = T, problems = 0, score = ans;
for (long long i = 0; i < n; ++i) {
if (problems < ans and vals >= v[p[i]].first and score <= v[p[i]].second) {
cout << p[i] + 1 << ' ';
vals -= v[p[i]].first;
++problems;
}
if (problems == ans) break;
}
return 0;
}
| 10 | CPP |
n, x = map(int, input().split())
a = list(map(int, input().split()))
idx = x % n
for j in range(x, x+n):
if a[j % n] <= a[idx]:
idx = j % n
temp = a[idx]
a[idx] += n * temp
a = [i - temp for i in a]
j = idx + 1
while j % n != x % n:
a[j % n] -= 1
j += 1
a[idx] += 1
print(*a)
| 9 | PYTHON3 |
T = int(input())
ans = [ ]
for i in range(T):
n = int(input())
mas = list(map(int,input().split()))
m = [ ]
for i in range(0, n - 1, +2):
a = mas[i]
b = mas[i+1]
if (b < 0 and a < 0) or (b > 0 and a > 0):
m.append( -b )
m.append( a )
else:
if a < 0:
m.append( -b )
m.append( a )
else:
m.append( b )
m.append( -a )
ans.append(m)
for i in range(T):
for j in range(len(ans[i])):
print(ans[i][j], end=" ")
print()
| 7 | PYTHON3 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <queue>
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const int MOD = 1e9 + 7;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(8);
int n;
cin >> n;
int A[n + 1];
for(int i = 0; i < n; i++) cin >> A[i];
sort(A, A + n);
double ans = -1;
for(int i = 0; i < n; i++)
{
for(int j = i + 1; j < n; j++)
{
int last = n - 1;
while(last == i || last == j) last--;
int a = A[last];
last--;
while(last == i || last == j) last--;
int b = A[last];
double x = (a + b) / (double)(A[j] - A[i]);
ans = max(x, ans);
}
}
cout << ans << endl;
return 0;
}
| 0 | CPP |
S=input();print("YNEOS"[S.count("o")<len(S)-7::2]) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 20;
long long a[MAXN];
int main() {
int n, k;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%I64d", &a[i]);
}
long long ans = 0;
long long orl = 0, nor = 0;
for (int i = 0, j = n - 1; i <= j; ++i) {
orl += a[i];
while (i < j && nor < orl) {
nor += a[j];
--j;
}
if (orl == nor) ans = orl;
}
printf("%I64d\n", ans);
return 0;
}
| 9 | CPP |
from sys import stdin, stdout
# string input
n, m = (stdin.readline().split())
n, m = int(n), int(m)
arr = []
for x in range(n):
a, b = stdin.readline().split()
arr.append((int(a), int(b)))
arr = sorted(arr, key=lambda x: x[0])
x = 1
i = 0
count = 0
ans = []
while(x <= m and i < n):
if(x >= arr[i][0] and x <= arr[i][1]):
x+=1
elif( x > arr[i][1]):
i+=1
else:
count += 1
ans.append(x)
x+=1
for x in range(x, m+1):
count +=1
ans.append(x)
print(count)
for i in range(len(ans)):
print(ans[i], end=' ') | 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main(){
map<string,int> day;
day["SUN"] = 7;
day["MON"] = 6;
day["TUE"] = 5;
day["WED"] = 4;
day["THU"] = 3;
day["FRI"] = 2;
day["SAT"] = 1;
string s; cin >> s;
cout << day[s];
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define ll long long int
void input() {return;}
template<typename T1, typename... T2>
void input(T1 & x, T2&... args){((cin >> x), input(args...));}
void wrt() { cout << endl; return;}
template<typename T1, typename... T2>
void wrt(T1 x, T2... args){((cout << x << ' '), wrt(args...));}
template<typename T> void inputlst(T & lst, int x, int y)
{ for(int i = x ; i < y; i++ ) cin >> lst[i]; }
template<typename T> void printlst(T & lst, int x, int y)
{ for(int i = x ; i < y; i++ ) cout << lst[i] << " "; cout << endl; }
#define sortlst(lst) sort(lst.begin(), lst.end())
#define setbits(n) __builtin_popcount(n)
#define sortarr(x, n) sort(x, x + n)
#define fora(i, x, y) for (ll i = x; i < y; ++i)
#define ford(i, x, y) for (ll i = x; i >= y; --i)
#define readArr(v) for(auto i : v)cin>>i;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vl> vovl;
typedef vector<vi> vovi;
typedef vector<string> vs;
typedef set<ll> sl;
typedef unordered_map<ll, ll> uml;
typedef map<ll, ll> ml;
typedef map<int, int> mi;
//------------------------------------------------------------------------------
int ceil(int a, int b) { int c=a/b; if(a%b != 0)c++; return c; }
//-------------------------------------------------------------------------------
// whole debugging process
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x<<" "; _print(x); cerr << endl;
#else
#define debug(x);
#endif
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(long long int t) { cerr << t;}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
// ############################# CODE IS HERE ##############################
int n, k;
int cur[26];
vector<ll> path;
void dfs(int v) {
while (cur[v] < k) {
int u = cur[v]++;
// cout<<"U: "<<u<<endl;
// cout<<"cur: ";for(auto i : cur)cout<<i<<" ";
// cout<<"\n";
dfs(u);
path.push_back(u);
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
boost;
ll test=1;
// cin >> test;
while(test--)
{
input(n,k);
dfs(0);
// cout<<" ";for(auto i : path)cout<<(char)(i + 'a');
// cout<<"\n";
cout<<'a';
for (int i = 0; i < n - 1; ++i)
cout<<((char)(path[i % path.size()] + 'a'));
}
return 0;
} | 10 | CPP |
x,y=input().split()
c=0
while int(x)<=int(y):
x=int(x) *3
y=int(y) *2
c+=1
while False:
c=1
print(c)
| 7 | PYTHON3 |
from sys import stdin
import math
a = int(stdin.readline())
for b in range(0,a):
A=stdin.readline().split()
N=int(A[0])
K=int(A[1])
MIN=N
for l in range(1,int(math.floor(math.sqrt(N)))+1):
if N%l==0:
if int(l)<=K:
MIN=min(MIN,int(N/l))
if int(N/l)<=K:
MIN=min(MIN,l)
print(MIN) | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3601, mod = 998244353;
long long ans = 0;
int h, w, n;
int dim[2];
long long tot[2];
long long dp[2][maxn][maxn];
bool taken[2][maxn];
long long fact[maxn], invfact[maxn];
long long binexp(long long b, long long e) {
b %= mod;
long long ret = 1;
while (e) {
if (e & 1) {
ret = (ret * b) % mod;
}
e >>= 1;
b = (b * b) % mod;
}
return ret;
}
long long choose(int n, int k) {
if (k > n) {
return 0;
}
return (fact[n] * invfact[k] % mod) * invfact[n - k] % mod;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
fact[0] = 1;
for (int i = 1; i < maxn; i++) {
fact[i] = fact[i - 1] * i % mod;
}
invfact[maxn - 1] = binexp(fact[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; i--) {
invfact[i] = invfact[i + 1] * (i + 1) % mod;
}
cin >> h >> w >> n;
dim[0] = h;
dim[1] = w;
for (int i = 0; i < n; i++) {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
taken[0][r1] = taken[0][r2] = taken[1][c1] = taken[1][c2] = 1;
}
for (int k = 0; k < 2; k++) {
for (int i = 1; i <= dim[k]; i++) {
tot[k] += not taken[k][i];
}
}
for (int k = 0; k < 2; k++) {
for (int i = 0; i <= dim[k]; i++) {
dp[k][i][0] = 1;
}
for (int i = 2; i <= dim[k]; i++) {
for (int j = 1; 2 * j <= i; j++) {
dp[k][i][j] = (dp[k][i - 1][j] +
(taken[k][i] == taken[k][i - 1] and taken[k][i] == 0) *
dp[k][i - 2][j - 1]) %
mod;
}
}
}
for (int v_dominos = 0; 2 * v_dominos <= tot[0]; v_dominos++) {
for (int h_dominos = 0; 2 * h_dominos <= tot[1]; h_dominos++) {
long long choose_rows = dp[0][dim[0]][v_dominos] *
choose(tot[0] - 2 * v_dominos, h_dominos) % mod;
long long choose_cols = dp[1][dim[1]][h_dominos] *
choose(tot[1] - 2 * h_dominos, v_dominos) % mod;
ans += ((choose_rows * choose_cols % mod) * fact[v_dominos] % mod) *
fact[h_dominos] % mod;
}
}
cout << ans % mod;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, tempS, s2;
while (getline(cin, tempS)) s += tempS;
for (int i = 0; i < s.size(); ++i) {
int j = i + 1;
while (s[j] != '>') ++j;
tempS = s.substr(i + 1, j - i - 1);
if (tempS == "table")
s2 += 't';
else if (tempS == "/table")
s2 += 'T';
else if (tempS == "td")
s2 += 'c';
i = j;
}
stack<int> S;
vector<int> res;
for (int i = 0; i < s2.size(); ++i) {
if (s2[i] == 't')
S.push(0);
else if (s2[i] == 'T') {
res.push_back(S.top());
S.pop();
} else if (s2[i] == 'c')
++S.top();
}
sort(res.begin(), res.end());
for (int i = 0; i < res.size(); ++i) cout << res[i] << " ";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int MOD = 1e9 + 7;
const int N = 5e5 + 100;
const double PI = 3.14159265359;
void solve() {
int n;
cin >> n;
vector<int> d[1000], t(10000);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
for (int j = 0; j < a; j++) {
int b;
cin >> b;
d[i].push_back(b);
}
}
for (int i = 0; i < n; i++) {
int l = 0;
for (int j = 0; j < n; j++) t[j] = 0;
for (int j = 0; j < d[i].size(); j++) {
for (int x = 0; x < n; x++) {
for (int k = 0; k < d[x].size(); k++) {
if (i != x) {
if (d[i][j] == d[x][k]) t[x]++;
}
}
if (t[x] == d[x].size()) {
l = 3;
break;
}
}
}
if (l != 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int TTT = 1;
while (TTT--) {
solve();
cout << endl;
}
}
| 8 | CPP |
import sys, re
ls = [l.rstrip() for l in sys.stdin.readlines()]
n, m = map(int, ls[0].split(" "))
res = re.findall(r"\w", " ".join(ls[1:]))
if len({'C', 'M', 'Y'}.intersection(res)) > 0:
print("#Color")
else:
print("#Black&White")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e6 + 7;
struct Data {
long long min, max, resl, resr;
};
struct TNode {
long long L, R;
TNode *left, *right;
Data d;
long long val;
};
TNode *new_node(long long L, long long R) {
return new TNode({L, R, nullptr, nullptr, {INF, -1, -1, -1}, 0});
}
Data safe(TNode *root) {
if (!root) {
return {INF, -1, -1, -1};
}
return root->d;
}
Data upd(Data a, Data b) {
Data c;
c.min = min(a.min, b.min);
c.max = max(a.max, b.max);
c.resl = max({a.resl, b.resl, a.max - 2 * b.min});
c.resr = max({a.resr, b.resr, b.max - 2 * a.min});
return c;
}
void relax(TNode *root) {
if (!root) return;
root->d = upd(safe(root->left), safe(root->right));
}
void add_val(TNode *root, long long val) {
if (!root) return;
root->val += val;
(root->d).min += val;
(root->d).max += val;
(root->d).resl -= val;
(root->d).resr -= val;
}
void push(TNode *root) {
if (!root) return;
add_val(root->left, root->val);
add_val(root->right, root->val);
root->val = 0;
}
vector<long long> pref;
TNode *build_tree(long long L, long long R) {
TNode *root = new_node(L, R);
if (R - L == 1) {
root->d = {pref[L], pref[L], -pref[L], -pref[L]};
} else {
long long M = (L + R) / 2;
root->left = build_tree(L, M);
root->right = build_tree(M, R);
relax(root);
}
return root;
}
void add_seg(TNode *root, long long L, long long R, long long val) {
if (L >= root->R || root->L >= R) {
return;
}
if (L <= root->L && root->R <= R) {
add_val(root, val);
return;
}
push(root);
add_seg(root->left, L, R, val);
add_seg(root->right, L, R, val);
relax(root);
}
Data get_res(TNode *root, long long L, long long R) {
if (L >= root->R || root->L >= R) {
return {INF, -1, -1, -1};
}
if (L <= root->L && root->R <= R) {
return root->d;
}
push(root);
Data res = upd(get_res(root->left, L, R), get_res(root->right, L, R));
relax(root);
return res;
}
long long m;
pair<long long, long long> get_max(TNode *root) {
if (root->R - root->L == 1) {
return {(root->d).max, root->L};
}
push(root);
pair<long long, long long> ret;
if (safe(root->left).max > safe(root->right).max) {
ret = get_max(root->left);
} else {
ret = get_max(root->right);
}
relax(root);
return ret;
}
void print(TNode *root) {
if (root->R - root->L == 1) {
cout << (root->d).max << " ";
return;
}
push(root);
print(root->left);
print(root->right);
relax(root);
}
long long query(TNode *root) {
auto t = get_max(root);
long long pos = t.second, val = t.first;
Data a = get_res(root, 0, pos);
Data b = get_res(root, pos + 1, m);
return max(max(a.resl, b.resr) + val, 0LL);
}
int main() {
ios_base::sync_with_stdio(false);
long long n, q;
cin >> n >> q;
string s;
cin >> s;
pref.push_back(0);
for (long long i = 0; i < 2 * (n - 1); i++) {
pref.push_back(pref.back() + (s[i] == '(' ? 1 : -1));
}
m = 2 * n - 1;
TNode *root = build_tree(0, m);
cout << query(root) << "\n";
for (long long i = 0; i < q; i++) {
long long a, b;
cin >> a >> b;
a--, b--;
if (a > b) swap(a, b);
if (s[a] != s[b]) {
if (s[a] == '(') {
add_seg(root, a + 1, b + 1, -2);
} else {
add_seg(root, a + 1, b + 1, 2);
}
swap(s[a], s[b]);
}
cout << query(root) << "\n";
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int last[maxn];
int main() {
int t;
scanf("%d", &t);
for (int _ = 1; _ <= t; _++) {
int x, y;
scanf("%d%d", &x, &y);
int ans = 0;
for (int i = 1; i * i <= x; i++) {
if (x % i) continue;
if (last[i] < _ - y) ans++;
if (i != x / i && last[x / i] < _ - y) ans++;
last[i] = last[x / i] = _;
}
printf("%d\n", ans);
}
return 0;
}
| 8 | CPP |
n,m = map(int,input().split())
s1,s2,s3 = "#"*m,"."*(m-1)+"#","#"+"."*(m-1)
for i in range(n):
if not i%2:print(s1)
else:
if (i+1)%4==0:print(s3)
else:print(s2) | 7 | PYTHON3 |
t=int(input())
for i in range(t):
n=int(input())
a=[6,2,5,5,4,5,6,3,7,6]
if(n==2):
print("1")
elif(n==3):
print("7")
elif(n%2==0):
x=n//2
print("1"*x)
else:
x=n//2-1
print("7"+(x*"1"))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
long long int n, i, j, count = 0, a, b = 0;
scanf("%lld", &n);
long long int ara[n];
long long int str[n];
for (i = 0; i < n; i++) {
scanf("%lld", &ara[i]);
}
for (i = 0; i < n; i++) {
if (ara[i] == 1) {
str[count] = i;
count++;
}
}
for (j = 0; j < count - 1; j++) {
a = str[j + 1] - str[j];
if (a <= 2)
b += a;
else
b += 2;
}
if (count > 0)
printf("%lld", b + 1);
else
printf("0");
}
| 8 | CPP |
#include <bits/stdc++.h>
char Input[500020];
using namespace std;
struct Edge {
int to, next;
} E[500020 << 1];
int In[500020], qaq;
int T, N, head[500020], A, qwq, B, i, j, ans, cnt;
inline void Add(int u, int v) {
E[++cnt].to = v, In[v]++;
E[cnt].next = head[u], head[u] = cnt;
E[++cnt].to = u, In[u]++;
E[cnt].next = head[v], head[v] = cnt;
}
int main() {
cin >> T;
while (T--) {
scanf("%d", &N), ++qwq;
fill(In, In + N + 4, 0);
fill(head, head + N + 4, 0), ans = 0, qaq = 0;
for (i = 1; i < N; ++i) scanf("%d%d", &A, &B), Add(A, B);
scanf("%s", Input);
if (N < 3)
puts("Draw");
else if (N == 3) {
for (i = 0; i < N; ++i) ans += Input[i] == 'W';
puts(ans >= 2 ? "White" : "Draw");
} else {
int Linshi = 0;
for (i = 0; i < N; ++i)
if (Input[i] == 'W') {
head[++N] = 0, Add(i + 1, N), In[N] = 3;
}
for (i = 1; i <= N && ans <= 0; ++i) {
if (In[i] > 3)
ans++;
else if (In[i] == 3) {
Linshi = 0;
for (j = head[i]; j; j = E[j].next) Linshi += (In[E[j].to] >= 2);
ans += Linshi > 1, qaq++;
}
}
if (qaq == 2 && (N % 2)) ans++;
puts(ans ? "White" : "Draw");
}
}
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, b = 0, c = 0, d = 0, q = 0, au = 0;
scanf("%d:%d", &a, &b);
scanf("%d:%d", &c, &d);
int r = (a * 60) + b;
int r2 = (c * 60) + d;
if (r2 >= r)
q = 1440 - (r2 - r);
else
q = ((a * 60) + b) - ((c * 60) + d);
au = q % 60;
q /= 60;
if (q == 24) q = 0;
if (q < 10 && au < 10)
printf("0%d:0%d\n", q, au);
else if (q > 9 && au > 9)
printf("%d:%d\n", q, au);
else if (q < 10 && au > 9)
printf("0%d:%d\n", q, au);
else
printf("%d:0%d\n", q, au);
return 0;
}
| 7 | CPP |
h, w = map(int, input().split())
S = ["."*(w+2)] + [ "."+input()+"." for _ in range(h) ] + ["."*(w+2)]
for i in range(h+2):
for j in range(w+2):
if S[i][j] == "#":
if S[i+1][j] != "#" and S[i][j+1] != "#" and S[i-1][j] != "#" and S[i][j-1] != "#":
print("No")
exit()
print("Yes")
| 0 | PYTHON3 |
for i in range(int(input())):
num=int(input())
x=input()
sum = 0
cnt=0
for i in range(num):
sum += int(x[i])
for i in range(num):
if (x[i] != '0'):
cnt += 1
if(x[num-1]!='0'):
xo=cnt-1
else:
xo=cnt
ans=sum+xo
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
if (n == 1)
cout << "1\n";
else
cout << n / 2 + 1 << "\n";
}
return 0;
}
| 7 | CPP |
n,m = map(int,input().split())
v = list(map(float,input().split()))
v = sorted(v)
if v[0]!=0:
maxs = v[0]
indice = 2
else:
maxs = -1
indice = 1
if v[n-1]!=m:
if m-v[n-1]>maxs:
maxs=m-v[n-1]
while indice <= n-1:
if (v[indice]-v[indice-1])/2>maxs:
maxs=(v[indice]-v[indice-1])/2
indice+=1
print("%.10f" %maxs)
| 8 | PYTHON3 |
import math
n = int(input())
m = int(input())
R = []
for i in range(n):
R.append(int(input()))
p = math.ceil((sum(R)+m)/n)
if p < max(R):
p = max(R)
print(p,max(R)+m) | 7 | PYTHON3 |
import sys
from math import factorial, gcd
#from math import comb, perm
from collections import Counter, deque, defaultdict
from bisect import bisect_left, bisect_right
from heapq import heappop, heappush, heapify, nlargest, nsmallest
from itertools import groupby, accumulate, permutations
from copy import deepcopy
INF = float('inf')
# MOD = 10**9+7
# sys.setrecursionlimit(10**6)
# import io,os
# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
# input = sys.stdin.buffer.readline
input = sys.stdin.readline
rl = lambda : list(map(int, input().split()))
rs = lambda : sys.stdin.readline().strip()
def check(x):
B = A[:]
for i in range(n-1, 1, -1):
if B[i] < x:
return False
maxMove = A[i] // 3
move = max(0, min((B[i] - x) // 3, maxMove))
B[i] -= 3 * move
B[i-1] += move
B[i-2] += 2 * move
return B[0] >= x and B[1] >= x
for _ in range(int(input())):
n = int(input())
A = rl()
l, r = min(A), max(A)
while l < r:
mid = r - (r - l ) // 2
if check(mid):
l = mid
else:
r = mid - 1
print(l) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int P = 1000000007;
int f[2][(1 << 16) + 1][2];
int n, m, msk, ans;
char str[255][255];
inline void upd(int &x, int y) {
x += y;
if (x >= P) x -= P;
}
int main() {
scanf("%d%d", &n, &m);
int i, j, d = 0, S, T, p, q, x, y, v0, v1;
for (i = 0; i < n; i++) scanf("%s", str[i]);
if (n < m) {
for (i = 0; i < n; i++)
for (j = i; j < m; j++) swap(str[i][j], str[j][i]);
swap(n, m);
}
msk = (1 << (m + 1)) - 1, f[0][0][0] = 1;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
d ^= 1, memset(f[d], 0, sizeof(f[d]));
for (S = 0; S <= msk; S++) {
x = j, y = j + 1, p = (S >> x) & 1, q = (S >> y) & 1,
T = S ^ (p << x) ^ (q << y), v0 = f[d ^ 1][S][0], v1 = f[d ^ 1][S][1];
if (!v0 && !v1) continue;
if (str[i][j] == 'x') {
upd(f[d][T][0], v0), upd(f[d][T][1], v1);
continue;
}
upd(f[d][T | (1 << x) | (1 << y)][0], v0),
upd(f[d][T | (1 << x) | (1 << y)][1], v1);
if (p || q)
upd(f[d][T | (q << x) | (p << y)][0], v0),
upd(f[d][T | (q << x) | (p << y)][1], v1);
else
upd(f[d][T][1], v0);
}
}
d ^= 1, memset(f[d], 0, sizeof(f[d]));
for (S = 0; S <= msk; S++)
upd(f[d][(S << 1) & msk][0], f[d ^ 1][S][0]),
upd(f[d][(S << 1) & msk][1], f[d ^ 1][S][1]);
}
for (S = 0; S <= msk; S++) upd(ans, f[d][S][0]), upd(ans, f[d][S][1]);
printf("%d", ans);
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, cnt = 0, remain;
cin >> n;
// the number of 25 cents
cnt += n / 25;
remain = n % 25;
// the number of 10 cents
cnt += remain / 10;
remain = remain % 10;
// the number of 5 cents
cnt += remain / 5;
// the number of 1 cents
cnt += remain % 5;
cout << cnt << endl;
}
| 0 | CPP |
a, b, c, n = map(int, input().split())
if c > a or c > b or (a + b) - c + 1 > n:
print(-1)
else:
print(n - (a + b - c)) | 7 | PYTHON3 |
tc = int(input())
for i in range(tc):
n = int(input())
suma, sumb, cnta, cntb = 0, 1,0, 0
x = [i for i in range(1,n+1)]
for i in range((n//2)):
if(cnta <= n/2):
if(suma < sumb):
suma += 2**x[-1]
x.pop(-1)
cnta += 1
else:
suma += 2**x[0]
x.pop(0)
cnta += 1
if(cntb <= n/2):
if(sumb < suma):
sumb += 2**x[-1]
x.pop(-1)
cntb += 1
else:
sumb += 2**x[0]
x.pop(0)
cntb += 1
print(abs(suma-sumb+1))
| 7 | PYTHON3 |
h,w=map(int, input().split( ))
s=[input().split( ) for _ in range(h)]
for i in range(h):
for j in range(w):
if s[i][j]=="snuke":
print(chr(ord("A")+j)+str(i+1))
exit()
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, u, v;
int father[2000000];
int ud[2000000];
int p[2000000][21];
int CurD;
int lca(int, int);
int dis(int, int);
void AddTo(int);
int main() {
n = 4;
father[2] = father[3] = father[4] = 1;
ud[1] = 0;
ud[2] = ud[3] = ud[4] = 1;
p[2][0] = p[3][0] = p[4][0] = 1;
int q;
cin >> q;
u = 2;
v = 3;
CurD = 2;
int ret;
for (int i = 0; i < q; i++) {
int x;
fscanf(stdin, "%d", &x);
AddTo(x);
AddTo(x);
fprintf(stdout, "%d\n", CurD);
}
return 0;
}
unsigned int getBit(unsigned int x, int i) { return ((x & (1 << i)) != 0); }
int lca(int i, int j) {
if (ud[i] < ud[j]) swap(i, j);
int t = ud[i] - ud[j];
for (int bit = 0; (1 << bit) <= t; bit++)
if (getBit(t, bit) == 1) {
i = p[i][bit];
}
if (i == j) return i;
int log = 0;
while ((1 << log) <= ud[i]) log++;
log--;
for (int bit = log; bit >= 0; bit--)
if (p[i][bit] != 0 && p[i][bit] != p[j][bit]) {
i = p[i][bit];
j = p[j][bit];
}
return father[i];
}
void AddTo(int x) {
n++;
father[n] = x;
p[n][0] = x;
ud[n] = ud[x] + 1;
for (int j = 1; (1 << j) < n; j++) {
p[n][j] = p[p[n][j - 1]][j - 1];
}
int ret = dis(n, u);
if (CurD < ret) {
CurD = ret;
v = n;
}
ret = dis(n, v);
if (CurD < ret) {
CurD = ret;
u = n;
}
}
int dis(int i, int j) {
int k = lca(i, j);
return (ud[i] + ud[j] - 2 * ud[k]);
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
double p;
cin >> n >> k;
p = ceil((double)n / 2);
if (k <= p) {
cout << 2 * k - 1 << endl;
} else {
p = k - p;
cout << 2 * (long long)p << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[105];
int n;
int i;
while (cin >> n) {
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (i = 0; i < n; i++) cout << a[i] << " ";
cout << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s; int l = s.size();
int res = 1000000;
for(char c = 'a'; c <= 'z'; ++c) {
int n = 0; int k = l;
for(int i = l - 1; i >= 0; --i) {
if(s[i] == c) k = i;
n = max(n, k - i);
}
res = min(res, n);
}
printf("%d\n", res);
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
using namespace std;
int a, b, c, d, e, f, p = 1000000007, base = 157, mi = 1e9, id = 0, q, pos;
int ind[300000], ans[300000], si[300000], si2[300000];
pair<int, int> reb_price[300000];
string s, s2;
vector<int> vec[300000];
vector<pair<int, int>> rebra[300000];
void dfs(int v, int pred) {
int ma = 0, ma2 = 0;
si[v] = 1;
for (auto i : rebra[v]) {
if (i.first == pred) {
continue;
}
dfs(i.first, v);
b += (si[i.first] + i.second - 1) / id;
si[i.first] = (si[i.first] + i.second - 1) % id;
if (si[i.first] > ma) {
ma2 = ma;
ma = si[i.first];
} else if (si[i.first] > ma2) {
ma2 = si[i.first];
}
}
si[v] = ma + 1;
if (si[v] + ma2 >= id) {
si[v] = 0;
b++;
}
}
pair<int, int> dfs2(int v, int pred, int pred2) {
if (rebra[v].size() == 1 && v != 1) {
rebra[v][0] = {pred2, 0};
return {v, 1};
}
if (rebra[v].size() == 2 && v != 1) {
if (rebra[v][0].first == pred) {
auto pa = dfs2(rebra[v][1].first, v, pred2);
return {pa.first, pa.second + 1};
} else {
auto pa = dfs2(rebra[v][0].first, v, pred2);
return {pa.first, pa.second + 1};
}
}
int j = 0;
for (auto i : rebra[v]) {
if (i.first == pred) {
rebra[v][j] = {pred2, 0};
j++;
continue;
}
rebra[v][j] = dfs2(i.first, v, v);
j++;
}
return {v, 1};
}
signed main() {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
cin >> a;
for (int i = 0; i < a - 1; i++) {
cin >> b >> c;
rebra[b].push_back({c, 1});
rebra[c].push_back({b, 1});
}
dfs2(1, -1, -1);
for (int i = 0; i < a; i = i) {
if (i == 0 || (b > 100 && i < 100)) {
b = 0;
id = i + 1;
dfs(1, -1);
cout << b << '\n';
;
i++;
} else {
b = 0;
id = i + 1;
dfs(1, -1);
c = b;
int l = i + 1, r = a / max(b, 1) + 1;
b = 0;
while (r - l > 1) {
int res = (r + l) / 2;
b = 0;
id = res;
dfs(1, -1);
if (b == c) {
l = res;
} else {
r = res;
}
}
for (int j = i; j < l; j++) {
cout << c << '\n';
;
}
i = l;
}
}
cin >> a;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
using ll = long long int;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, K;
cin >> N >> K;
vector<int> v(N);
for (auto& x : v) cin >> x;
sort(v.begin(), v.end());
int sum = 0;
for (int i = 0; i < K; i++) sum += v[i];
cout << sum << endl;
}
| 20 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int M = 305;
int read() {
int x = 0, y = 1;
char ch = getchar();
while (ch < '0' || ch > '9') y = (ch == '-') ? -1 : 1, ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
return x * y;
}
int n, a[M], ls[M], rs[M], sz[M], dp[M][3][3];
bool vis[M][3][3];
void dfs(int u) {
if (a[u] != -1) return sz[u] = 0, void();
dfs(ls[u]), dfs(rs[u]), sz[u] = sz[ls[u]] + sz[rs[u]] + 1;
if (sz[rs[u]] & 1) swap(ls[u], rs[u]);
}
int get(int a, int b, int typ) { return typ ? min(a, b) : max(a, b); }
int dfs(int u, int typ, int fl) {
if (a[u] != -1) return a[u];
if (sz[u] == 1) return get(a[ls[u]], a[rs[u]], typ ^ (fl == 2));
if (vis[u][typ][fl]) return dp[u][typ][fl];
vis[u][typ][fl] = 1;
int res;
if (!fl) {
if (sz[u] & 1) {
int sth = sz[ls[u]] & 1;
res = get(dfs(ls[u], typ, sth), dfs(rs[u], typ, sth), typ);
} else
res = get(get(dfs(ls[u], typ, 0), dfs(rs[u], !typ, 0), !typ),
get(dfs(rs[u], typ, 1), dfs(ls[u], !typ, 1), !typ), typ);
} else {
if (sz[u] & 1) {
res = dfs(u, !typ, 0);
int sth = sz[ls[u]] & 1;
if (sth || sz[rs[u]])
res =
get(res,
get(dfs(ls[u], 1 ^ typ ^ sth, 0),
dfs(rs[u], typ ^ sth, sz[ls[u]] == sth && fl == 1 ? 2 : 1),
!typ),
typ);
if (sth || sz[ls[u]])
res =
get(res,
get(dfs(rs[u], 1 ^ typ ^ sth, 0),
dfs(ls[u], typ ^ sth, sz[rs[u]] == sth && fl == 1 ? 2 : 1),
!typ),
typ);
} else
res = get(dfs(rs[u], typ, 0),
dfs(ls[u], typ, !sz[rs[u]] && fl == 1 ? 2 : 1), typ);
}
return dp[u][typ][fl] = res;
}
void solve() {
memset(vis, 0, sizeof(vis));
n = read();
for (int i = 1; i <= n; i++) {
a[i] = read();
if (a[i] == -1) ls[i] = read() + 1, rs[i] = read() + 1;
}
dfs(1);
printf("%d\n", dfs(1, 0, 0));
}
signed main() {
int T = read();
while (T--) solve();
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, h, l, r, a[2003], dp[2003][2003];
long long solve(long long idx, long long lw) {
if (idx == n) return 0;
if (dp[idx][lw] != -1)
return dp[idx][lw];
else {
long long ad = 0, s = 0;
ad = lw + a[idx] - 1;
ad %= h;
if (ad >= l && ad <= r) s = 1;
long long ans1 = s + solve(idx + 1, ad);
s = 0;
ad = lw + a[idx];
ad %= h;
if (ad >= l && ad <= r) s = 1;
long long ans2 = s + solve(idx + 1, ad);
return dp[idx][lw] = max(ans1, ans2);
}
}
int main(int argc, char const *argv[]) {
memset(dp, -1, sizeof(dp));
cin >> n >> h >> l >> r;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
cout << solve(0, 0);
return 0;
}
| 11 | CPP |
n,a,b,k=(int(i) for i in input().split())
h=list(map(int,input().split()))
ans=0
hh=[]
for i in range(n):
t=h[i]
if(t==0):
ans+=1
continue
t=t%(a+b)
if (t==0):
t=t+b
else:
t=t-a
if(t>0):
h[i]=t//a
if(t%a)!=0:
h[i]+=1
hh.append(h[i])
else:
h[i]=0
ans+=1
if ans==n:
print(ans)
else:
c=0
hh.sort()
for i in hh:
if c==k:
break
c=c+i
if c<=k:
ans+=1
else:
break
print(ans) | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int LG = 20;
int N, A[100001], DP[100001][20][2];
vector<int> adj[100001];
long long res = 0;
void DFS(int u, int p) {
for (int i = 0; i < LG; i++) DP[u][i][(A[u] >> i) & 1]++;
for (auto &v : adj[u]) {
if (v != p) {
DFS(v, u);
for (int i = 0; i < LG; i++) {
DP[u][i][0] += DP[v][i][(A[u] >> i) & 1];
DP[u][i][1] += DP[v][i][!((A[u] >> i) & 1)];
}
}
}
for (auto &v : adj[u]) {
if (v != p) {
for (int i = 0; i < LG; i++) {
res += (1LL << i) * DP[v][i][0] *
(DP[u][i][1] - DP[v][i][!((A[u] >> i) & 1)]);
res += (1LL << i) * DP[v][i][1] *
(DP[u][i][0] - DP[v][i][(A[u] >> i) & 1]);
}
}
}
for (int i = 0; i < LG; i++) {
res += (1LL << i) * (DP[u][i][1] - ((A[u] >> i) & 1));
}
}
int main() {
ios ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
res += 2 * A[i];
}
for (int i = 1; i < N; i++) {
int U, V;
cin >> U >> V;
adj[U - 1].push_back(V - 1);
adj[V - 1].push_back(U - 1);
}
DFS(0, -1);
cout << (res >> 1) << "\n";
return 0;
}
| 11 | CPP |
t = int(input())
for i in range(t):
n = int(input())
data = list(map(int,input().split()))
pos = n-1
while(pos>0 and data[pos]<=data[pos-1]): pos -= 1
while(pos>0 and data[pos]>= data[pos-1]): pos -= 1
print(pos)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, i, j;
string s1[1001], s2[1001];
int main() {
cin >> n >> m;
if (n > m) {
cout << "YES";
return 0;
}
if (m > n) {
cout << "NO";
return 0;
}
for (i = 0; i < n; i++) cin >> s1[i];
for (j = 0; j < m; j++) cin >> s2[j];
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
if (s1[i] == s2[j]) {
k++;
break;
}
if (k % 2 == 0)
cout << "NO";
else
cout << "YES";
}
| 8 | CPP |
n = int(input())
d = {}
for _ in range(n):
t = int(input())
if t not in d:
d[t] = 0
d[t] += 1
if len(d) != 2:
print("NO")
exit(0)
k = list(d.keys())
if d[k[0]] != d[k[1]]:
print("NO")
else:
print("YES")
print(str(k[0]) + " " + str(k[1]))
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
const double pi=acos(-1.0);
double ans1,ans2,nn;
int n,L,T[3010];
int main()
{
scanf("%d%d",&n,&L),ans1=ans2=0,nn=(1ll*n*(n-1)*(n-2)/6);
for (int i=1; i<=n; i++) scanf("%d",&T[i]);
for (int i=1; i<=n; i++)
for (int j=i+1; j<=n; j++)
{
double x=cos((pi*(T[i]+T[j]))/L),y=sin((pi*(T[i]+T[j]))/L);
ans1-=x*(j-i-1),ans2-=y*(j-i-1),ans1+=x*(n-j+i-1),ans2+=y*(n-j+i-1);
}
ans1/=nn,ans2/=nn;
printf("%.10lf %.10lf\n",ans1,ans2);
return 0;
} | 0 | CPP |
a=input()
b=0
c='([{<'
d=')]}>'
e=[]
f=False
for i in a:
if i in c:e+=[i]
else:
if not e:
print('Impossible')
f=True
break
if d.index(i)!=c.index(e[-1]):b+=1
e.pop()
if e:print('Impossible')
elif not f:print(b)
| 9 | PYTHON3 |
noInputs = int(input())
for i in range(noInputs):
lenStr = int(input())
str1 = input()
str2 = input()
notSame = []
for i in range(lenStr):
if str1[i] != str2[i]:
notSame.append(i)
if len(notSame) == 0:
print("Yes")
else:
if len(notSame) == 2:
if str1[notSame[0]] == str1[notSame[1]] and str2[notSame[0]] == str2[notSame[1]]:
print("Yes")
else:
print("No")
else:
print("No") | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int Max = 3e5 + 10;
int allowmin;
int A[Max];
vector<int> one;
vector<int> two;
vector<int> three;
vector<pair<int, int> > res;
int main() {
int n;
cin >> n;
allowmin = 1;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
A[i] = a;
if (a == 3)
three.push_back(i);
else if (a == 2)
two.push_back(i);
else if (a == 1)
one.push_back(i);
}
bool ok = true;
if (three.size()) {
for (int i = 0; i < three.size() - 1; i++) {
res.push_back(make_pair(allowmin, three[i]));
res.push_back(make_pair(allowmin, three[i + 1]));
allowmin++;
}
if (two.size() && two.back() > three.back()) {
if (!one.size() || one.back() < two.back()) {
ok = false;
cout << -1 << '\n';
return 0;
}
res.push_back(make_pair(allowmin, three.back()));
res.push_back(make_pair(allowmin, two.back()));
allowmin++;
res.push_back(make_pair(allowmin, two.back()));
res.push_back(make_pair(allowmin, one.back()));
allowmin++;
one.pop_back();
two.pop_back();
} else {
if (!one.size() || one.back() < three.back()) {
ok = false;
cout << -1 << '\n';
return 0;
}
res.push_back(make_pair(allowmin, three.back()));
res.push_back(make_pair(allowmin, one.back()));
allowmin++;
res.push_back(make_pair(allowmin, one.back()));
allowmin++;
one.pop_back();
}
}
while (two.size()) {
if (!one.size() || one.back() < two.back()) {
ok = false;
break;
}
res.push_back(make_pair(allowmin, two.back()));
res.push_back(make_pair(allowmin, one.back()));
allowmin++;
two.pop_back();
one.pop_back();
}
while (one.size()) {
res.push_back(make_pair(allowmin, one.back()));
allowmin++;
one.pop_back();
}
if (ok) {
cout << res.size() << '\n';
for (auto a : res) cout << a.first << " " << a.second << '\n';
} else
cout << -1 << '\n';
}
| 10 | CPP |
[n, m] = list(map(int, input().split()))
d = {}
for i in range(m):
[a, b] = input().split()
la = len(a)
lb = len(b)
if la <= lb:
d[a] = a
d[b] = a
else:
d[a] = b
d[b] = b
c = input().split()
os = ''
for word in c:
os += d[word] + ' '
print(os.strip()) | 8 | PYTHON3 |
s = input()
bf = s[len(s)-4:]
eindex = len(s)-(4-bf.index('e'))
b = int(bf[bf.index('e')+1:])
x = eindex-(2+b)
dlen = eindex-2
print(s[0], end = '')
if (dlen == 1) and s[2] == '0' and b == 0:
pass
elif (dlen > b):
print(s[2:2+b], end = '')
print('.', end = '')
print(s[2+b:eindex])
elif (dlen == b):
print(s[2:2+b], end = '')
elif (dlen < b):
print(s[2:eindex], end = '')
print('0'*(b-dlen), end = '')
| 8 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
a.sort()
b=[]
d=0
c=a[0]
j=0
for i in range(n):
if abs(a[i]-c)<=5:
d+=1
else:
b.append(d)
j+=1
c=a[j]
b.append(d)
print(max(b)) | 9 | PYTHON3 |
def min_moves(mat, n, m):
ans = 0
for i in range(n-1):
if mat[i][m-1] != 'D':
ans += 1
for j in range(m-1):
if mat[n-1][j] != 'R':
ans += 1
return ans
t = int(input())
while t:
n,m = map(int, input().split())
mat = []
for i in range(n):
mat.append(list(input()))
print(min_moves(mat, n, m))
t -= 1
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int num[120][30];
int num2[120][30];
int num3[120][30];
int num4[120][30];
char ans[120];
char str[((20000) + 10)];
int sum, len;
int main() {
int n, c;
scanf("%d", &n);
if (n == 1) {
printf("? 1 1\n");
fflush(stdout);
scanf("%s", ans);
printf("! %s\n", ans);
fflush(stdout);
return 0;
} else if (n == 2) {
printf("? 1 1\n");
fflush(stdout);
scanf("%s", ans);
printf("? 2 2\n");
fflush(stdout);
scanf("%s", &ans[1]);
printf("! %s\n", ans);
fflush(stdout);
return 0;
}
c = n;
n = n / 2;
printf("? 1 %d\n", n);
fflush(stdout);
sum = n * (n + 1) / 2;
while (sum--) {
scanf("%s", str);
len = (int)strlen(str);
for (int i = 0; i < len; ++i) ++num[len][str[i] - 'a'];
}
if (n != 1) {
printf("? 2 %d\n", n);
fflush(stdout);
sum = n * (n - 1) / 2;
while (sum--) {
scanf("%s", str);
len = (int)strlen(str);
for (int i = 0; i < len; ++i) ++num2[len][str[i] - 'a'];
}
for (int i = 1; i <= n; ++i) {
for (int j = 0; j < 26; ++j)
if (num[i][j] != num2[i][j]) ans[i - 1] = 'a' + j;
for (int j = 0; j < i; ++j) ++num2[i + 1][ans[j] - 'a'];
}
} else
ans[0] = str[0];
n = c;
printf("? 1 %d\n", n);
fflush(stdout);
sum = n * (n + 1) / 2;
while (sum--) {
scanf("%s", str);
len = (int)strlen(str);
for (int i = 0; i < len; ++i) ++num3[len][str[i] - 'a'];
}
c = (n - 1) / 2;
for (int i = 1; i <= c; ++i) {
for (int j = 0; j < 26; ++j) num4[i][j] = num3[i + 1][j] - num3[i][j];
}
for (int i = 1; i <= c; ++i) {
int x = -1, y = -1;
for (int j = 0; j < 26; ++j) {
if (num3[i][j] - i * num4[i][j] != 0) {
if (x == -1)
x = j;
else
y = j;
}
}
if (y == -1) y = x;
if (ans[i - 1] == x + 'a')
ans[n - i] = y + 'a';
else
ans[n - i] = x + 'a';
for (int j = i + 1; j <= c; ++j) {
num3[j][x] -= i;
num3[j][y] -= i;
}
}
if (n & 1) {
for (int i = 1; i <= c; ++i)
--num3[1][ans[i - 1] - 'a'], --num3[1][ans[n - i] - 'a'];
for (int i = 0; i < 26; ++i) {
if (num3[1][i] == 1) ans[c] = 'a' + i;
}
} else {
int x = -1, y = -1;
for (int i = 1; i <= c; ++i)
--num3[1][ans[i - 1] - 'a'], --num3[1][ans[n - i] - 'a'];
for (int i = 0; i < 26; ++i) {
if (num3[1][i] == 2)
x = y = i;
else if (num3[1][i] == 1) {
if (x == -1)
x = i;
else
y = i;
}
}
if (ans[c] == x + 'a')
ans[c + 1] = y + 'a';
else
ans[c + 1] = x + 'a';
}
printf("! %s\n", ans);
fflush(stdout);
return 0;
}
| 9 | CPP |
R, G = int(input()), int(input())
print(G * 2 - R) | 0 | PYTHON3 |
i,o,t,j,l,s,z=[int(i) for i in input().split()]
ans=o*2+4*(i//2)+4*(l//2)+4*(j//2)
if i*l*j>0:ans=max(ans,o*2+4*((~-i)//2)+4*((~-l)//2)+4*((~-j)//2)+6)
print(ans//2)
| 0 | PYTHON3 |
t=int(input())
for T in range(t):
n=int(input())
if(n<=3):
print(-1)
else:
f=[y for y in range(2,n+1,4)]
m=[z for z in range(4,n+1,4)]
s=[x for x in range(1,n+1,2)]
ans=f+m[: :-1]+s
print(*ans) | 13 | PYTHON3 |
q = int(input())
for i in range(q):
n, k = input().split()
n = int(n) #num of prods
k = int(k) #max abs difference bw old and new price
inp = input().split()
a = []
for i in inp:
a.append(int(i))
max_pos = min(a) + k
flag = 0
for i in a:
if abs(i - max_pos) > k:
print(-1)
flag = 1
break
if(flag == 0):
print(max_pos) | 8 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.