solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
struct T {
int x, y, r;
T(int X = 0, int Y = 0, int R = 0) : x(X), y(Y), r(R * R) {}
int dist(T p) { return (x - p.x) * (x - p.x) + (y - p.y) * (y - p.y); }
bool operator<(const T& p) const {
if (x == p.x)
return y < p.y;
else
return x < p.x;
}
};
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
int s, t, f;
cin >> s >> f >> t;
--s;
--f;
if (s == f) {
cout << t << endl;
continue;
}
int d = t / (2 * m - 2);
t %= (2 * m - 2);
int ans = d * 2 * (m - 1);
if (s <= f) {
ans += f;
if (t > s) ans += 2 * (m - 1);
} else {
s += 2 * (m - 1 - s);
f += 2 * (m - 1 - f);
ans += f;
if (t > s) ans += 2 * (m - 1);
}
cout << ans << endl;
}
return 0;
}
| 7 | CPP |
#include <iostream>
#include <vector>
#include <cctype>
using namespace std;
int main(){
string s,type;
while(cin>> s >> type, type!="X" ){
int st=0;
vector<string> v;
for( int i=0;i<(int)s.length();i++ ){
if( isupper(s[i]) ){
s[i] = tolower(s[i]);
if( i>0 )
v.push_back( s.substr(st,i-st) );
st = i;
}
if( s[i]=='_' ){
v.push_back( s.substr(st, i-st) );
st = i+1;
}
if( i==s.length()-1 ){
v.push_back( s.substr(st) ); break;
}
}
//#define DEBUG
#ifdef DEBUG
cout << endl;
cout << s << " => " << type << endl;
for( int i=0;i<v.size();i++ )
cout << " [" << v[i] << "]";
cout << endl;
cout << "[";
#endif
for( int i=0;i<v.size();i++ ){
if( (type=="L"&&i>0) || type=="U" ){
v[i][0] = toupper(v[i][0]);
}
if( type=="D" && i>0 )
cout << "_";
cout << v[i];
}
cout
#ifdef DEBUG
<< "]"
#endif
<< endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long int n, sum = 0, temp, mino = pow(10, 9) + 1, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> temp;
sum += temp;
if (temp % 2 && temp < mino) mino = temp;
}
if (sum % 2) sum -= mino;
cout << sum;
return 0;
}
| 7 | CPP |
t = int(input())
for _ in range(t):
a, b = list(map(int, input().split()))
tmp = abs(b - a)
val = 0
val += tmp//5
tmp = tmp%5
val += tmp//2
tmp = tmp%2
val += (tmp)
print(val) | 7 | PYTHON3 |
n=int(input())
s=str(input())
arr={}
for i in range(len(s)-1):
if s[i:i+2] in arr.keys():
arr[s[i:i+2]]+=1
else:
arr[s[i:i+2]]=1
a=list(arr.values())
x=max(a)
for i in arr.keys():
if arr[i]==x:
ans=i
break;
print(ans)
| 8 | PYTHON3 |
for i in range(int(input())):
n , k = map(int, input().split(' '))
print(n * ( (k + n - 2)//(n-1) -1) + (n-1 if not k % (n-1) else k % (n-1)) )
| 9 | PYTHON3 |
x1,y1=map(int,input( ).split(" "))
x2,y2=map(int,input( ).split(" "))
x3,y3=map(int,input( ).split(" "))
print(3)
print(str(x1+x2-x3)+" "+str(y1+y2-y3))
print(str(x1+x3-x2)+" "+str(y1+y3-y2))
print(str(x2+x3-x1)+" "+str(y2+y3-y1))
| 8 | PYTHON3 |
t = int(input())
output = []
for _ in range(t):
n = int(input())
list_numbers = list(map(int,input().split()))
final_list = sorted((i for i in list_numbers if i<=2048),reverse=True)
sum_val = 0
flag = 0
for val in final_list:
sum_val += val
if sum_val == 2048:
flag = 1
break
else:
continue
if flag == 0:
output.append('NO')
else:
output.append('YES')
for x in output:
print(x) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long angle;
cin >> angle;
angle = (angle % 360 + 360) % 360;
angle = (angle + 44) % 360;
long long ans = (angle % 359) / 90;
cout << ans;
return 0;
}
| 20 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n1, n2, k1, k2;
scanf("%d %d %d %d", &n1, &n2, &k1, &k2);
if (n1 - n2 > 0)
printf("First");
else
printf("Second");
return 0;
}
| 7 | CPP |
#include<bits/stdc++.h>
using namespace std ;
#define Next( i, x ) for( register int i = head[x]; i; i = e[i].next )
#define rep( i, s, t ) for( register int i = (s); i <= (t); ++ i )
#define drep( i, s, t ) for( register int i = (t); i >= (s); -- i )
#define re register
#define int long long
int gi() {
char cc = getchar() ; int cn = 0, flus = 1 ;
while( cc < '0' || cc > '9' ) { if( cc == '-' ) flus = - flus ; cc = getchar() ; }
while( cc >= '0' && cc <= '9' ) cn = cn * 10 + cc - '0', cc = getchar() ;
return cn * flus ;
}
const int N = 100 + 5 ;
const int P = 1e9 + 7 ;
int n, a[N], dp[N][N][N] ;
signed main()
{
n = gi() ; int m = 2 * n ;
for( re int i = 1; i < m; ++ i ) a[i] = gi() ;
sort( a + 1, a + m ) ;
dp[n][0][0] = 1 ;
for( re int i = n - 1; i >= 1; -- i ) {
int dl = ( a[i] != a[i + 1] ), dr = ( a[m - i] != a[m - i - 1] ) ;
rep( l, 0, m ) {
rep( r, 0, m ) {
dp[i][l + dl][r + dr] = ( dp[i][l + dl][r + dr] + dp[i + 1][l][r] ) % P ;
for( re int k = 0; k < l + dl; ++ k )
dp[i][k][r + 1 + dr] = ( dp[i][k][r + 1 + dr] + dp[i + 1][l][r] ) % P ;
for( re int k = 0; k < r + dr; ++ k )
dp[i][l + 1 + dl][k] = ( dp[i][l + dl + 1][k] + dp[i + 1][l][r] ) % P ;
}
}
}
int Ans = 0 ;
rep( l, 0, m ) rep( r, 0, m ) Ans = ( Ans + dp[1][l][r] ) % P ;
cout << Ans << endl ;
return 0 ;
} | 0 | CPP |
n = int(input())
a = [0] + list(map(int, input().split()))
dp = [0] * (n + 1)
s = [0] * (n + 1)
for i in range(1, n + 1):
s[i] = s[i - 1] + a[i]
dp[n] = 0
cur = s[n]
for i in range(n - 1, 0, -1):
dp[i] = cur
cur = max(cur, s[i] - dp[i])
print(dp[1])
| 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
int min(int a, int b) {
if (a <= b)
return a;
else
return b;
}
bool primecheck(int n) {
if (n == 1) return false;
if (n == 2 || n == 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 6; i <= sqrt(n); i += 6) {
if (n % (i - 1) == 0) return false;
if (n % (i + 1) == 0) return false;
}
return true;
}
long long mod = 1e9 + 7;
vector<long long> sequonce(vector<int> a) {
int n = a.size(), i = 0, j;
vector<long long> r(n + 1);
while (i < n) {
if (a[i] == 0) {
i++;
continue;
}
j = i;
while (j < n && a[j] == 1) j++;
for (int len = 1; len <= j - i; len++) r[len] += j - i - len + 1;
i = j;
}
return r;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
long long k, ans = 0;
cin >> n >> m >> k;
vector<int> a(n);
vector<int> b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
auto ga = sequonce(a);
auto gb = sequonce(b);
for (int i = 1; i < ga.size(); i++)
if (k % i == 0 && k / i <= m) ans += ga[i] * gb[k / i];
cout << ans;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000 + 10;
const int inf = 522133279;
const int mod = 1000000007;
const int s = 1000000;
int x[s + 100], y[s + 100];
int n;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
x[tmp] = 1;
}
int cnt = 0;
for (int i = 1; i <= s; i++) {
if (x[i] && !x[s - i + 1]) y[s - i + 1] = 1, cnt++;
}
for (int i = 1; i <= s && cnt < n; i++) {
if (!x[i] && !x[s - i + 1]) y[i] = y[s - i + 1] = 1, cnt += 2;
}
cout << cnt << endl;
for (int i = 1; i <= s; i++)
if (y[i]) cout << i << ' ';
cout << endl;
return 0;
}
| 8 | CPP |
n = int(input())
x,y,z = 0,0,0
for _ in range(n):
data = list(map(int, input().split()))
x += data[0]
y += data[1]
z += data[2]
if x==0 and y==0 and z==0:
print('YES')
else:
print('NO') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int32_t main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long t;
t = 1;
for (long long tc = 0; tc < t; tc++) {
long long n, x, y;
cin >> n >> x >> y;
string str;
cin >> str;
vector<long long> v;
v.push_back(-1);
for (long long i = 0; i < n; i++) {
if (str[i] == '1') v.push_back(i);
}
v.push_back(n);
long long cntz = 0;
for (long long i = 1; i < v.size(); i++) {
cntz += (v[i] - 1 - (v[i - 1] + 1) + 1 > 0);
}
if (cntz == 0) {
cout << 0 << "\n";
continue;
}
if (x < y) {
long long s = -1, e = n;
long long i = 0;
while (i < n && str[i] == '1') i++;
s = i - 1;
i = n - 1;
while (i >= 0 && str[i] == '1') i--;
e = i + 1;
long long cnt1 = 0;
for (long long i = s + 1; i < e;) {
if (str[i] == '1') {
long long j = i;
while (j < e && str[j] == '1') j++;
i = j;
cnt1++;
} else {
i++;
}
}
long long ans = cnt1 * x + y;
ans = min(ans, cntz * y);
cout << ans << "\n";
} else {
long long ans = cntz * y;
cout << ans << "\n";
}
}
return 0;
}
| 7 | CPP |
x,y=map(int,input().split(" "))
z=list(map(int,input().split(" ")))
count=0
for i in range(0,x):
if z[y-1]==0 and z[i]==z[y-1]:
count=count+0
elif z[y-1]<=z[i]:
count=count+1
else:
count=count+0
print(count) | 7 | PYTHON3 |
N, M = [int(x) for x in input().split()]
strs = set(input() for _ in range(N))
has_pal = {}
is_pal = {}
for s in strs:
is_pal[s] = s[::-1] == s
has_pal[s] = not is_pal[s] and s[::-1] in strs
mid = ""
for s in is_pal:
if is_pal[s]:
mid = s
break
pals = []
for s in strs:
if has_pal[s] and s[::-1] not in pals:
pals.append(s)
#print(pals, mid)
left = ''.join(pals)
right = left[::-1]
res = left + mid + right
print(len(res))
print(res)
| 8 | PYTHON3 |
def findSequence(N, arrayF, M, arrayB):
positions = [-2]*N
amb = False
for i in range(N):
val = arrayF[i]
if val < 1 or val > N:
return ("Impossible",[])
pos = positions[val-1]
if pos >= -1:
positions[val-1] = -1
else:
positions[val-1] = i + 1
output = [0]*M
for j in range(M):
key = arrayB[j]
if key < 1 or key > N:
return ("Impossible",[])
pos = positions[key - 1]
if pos == -1:
amb = True
elif pos == -2:
return ("Impossible",[])
else:
output[j] = pos
if amb:
return ("Ambiguity",[])
return ("Possible", output)
if __name__=="__main__":
n, m = input().split()
n, m = int(n), int(m)
arrayF = input().split()
arrayF = [ int(x) for x in arrayF ]
arrayB = input().split()
arrayB = [ int(x) for x in arrayB ]
status, output = findSequence(n, arrayF, m, arrayB)
print(status)
if status == "Possible":
print(' '.join([ str(x) for x in output ]))
| 8 | PYTHON3 |
#include<bits/stdc++.h>
//#include<string>
using namespace std;
int n,k,q,y,a[2001],b[2001],t,ll,s[2001],ss,ans=2e9;
bool cmp(int a,int b){
return a<b;
}
int main(){
scanf("%d %d %d",&n,&k,&q);
for(register int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(register int j=1;j<=n;j++){
y=a[j];//枚举能被删除的最小元素y
memset(s,0,sizeof(s));
ss=0;
t=0;
for(register int i=1;i<=n+1;i++){
if(i==n+1||a[i]<y){//如果a[i]为一段的边界
sort(b+1,b+t+1,cmp);
ll=t-k+1;//当前这段能删的数的个数
for(register int l=1;l<=ll;l++)
s[++ss]=b[l];//把能删的数存在s数组里
memset(b,0,sizeof(b));
t=0;//清空b数组
}
else{
b[++t]=a[i];//不是边界就加入到当前这段
}
}
if(ss<q){//如果能被删的数不足q个，就直接枚举下个y
continue;
}
sort(s+1,s+ss+1,cmp);
//printf("%d %d\n",s[q],y);
ans=min(ans,s[q]-y);//s[q]就是x,这里是更新ans
}
printf("%d\n",ans);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long int nax = 1e6;
int m, n;
std::vector<int> v[nax];
std::vector<bool> vis(nax);
std::vector<int> cats(nax);
int ans = 0;
void dfs(int i, int k) {
if (vis[i]) return;
vis[i] = true;
if (cats[i]) k++;
if (k > m) return;
if (cats[i] == 0) k = 0;
for (auto x : v[i]) dfs(x, k);
if (v[i].size() == 1 && i != 1) ans++;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> cats[i];
for (int i = 1; i < n; i++) {
int x, y;
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1, 0);
cout << ans;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 2000000000;
const long long BIG = 1446803456761533460LL;
const int maxn = 200010;
const int maxnlg = 20;
int n;
int B[maxn];
pair<int, int> A[maxn];
int poww(int a, int b) {
int r = 1;
while (b) {
if (b & 1) r = (1LL * (r) * (a)) % MOD;
a = (1LL * (a) * (a)) % MOD;
b >>= 1;
}
return r;
}
pair<int, int> inter(pair<int, int> &a, pair<int, int> &b) {
return {max(a.first, b.first), min(a.second, b.second)};
}
int length(pair<int, int> a) { return max(0, a.second - a.first + 1); }
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].first;
for (int i = 0; i < n; ++i) cin >> A[i].second;
int ps = 0;
int f = 0, f2 = 0;
for (int i = 0; i < n - 1; ++i) {
int a = length(inter(A[i], A[i + 1]));
int b = poww(1LL * length(A[i]) * length(A[i + 1]) % MOD, MOD - 2);
B[i] = 1 - 1LL * a * b % MOD + MOD;
f = ((f) + (B[i])) % MOD;
if (i >= 2) {
ps = ((ps) + (B[i - 2])) % MOD;
f2 = ((f2) + (1LL * B[i] * ps % MOD)) % MOD;
}
}
for (int i = 0; i < n - 2; ++i) {
pair<int, int> a = inter(A[i], A[i + 1]);
pair<int, int> b = inter(A[i + 1], A[i + 2]);
pair<int, int> c = inter(a, b);
int s = (1LL * length(a) * length(A[i + 2]) +
1LL * length(b) * length(A[i]) - length(c)) %
MOD;
int t = poww(
1LL * length(A[i]) * length(A[i + 1]) % MOD * length(A[i + 2]) % MOD,
MOD - 2);
f2 = ((f2) + (1 - 1LL * s * t % MOD + MOD)) % MOD;
}
int ans = (1LL * f2 * 2 + 1LL * f * 3 + 1) % MOD;
cout << ans << '\n';
}
| 12 | CPP |
q = int(input())
for _ in range(q):
word = input()
l = len(word)
if l > 10:
word = word[0] + str(l-2) + word[-1]
print(word) | 7 | PYTHON3 |
import math
n,m=[int(x) for x in input().split()]
if(n==m):
print(n)
else:
print('1')
| 7 | PYTHON3 |
#include <iostream>
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <math.h>
using namespace std;
int main() {
int w,h,x,y,d,n;
string c;
while(1){
cin>>w>>h;
if(w==0&&h==0)return 0;
x=1;
y=1;
d=0;
while(1){
cin>>c;
if(c=="FORWARD"||c=="BACKWARD"){
cin>>n;
if(c=="BACKWARD")n=n*-1;
if(d==0)y+=n;
if(d==1)x-=n;
if(d==2)y-=n;
if(d==3)x+=n;
if(x<1)x=1;
if(x>w)x=w;
if(y<1)y=1;
if(y>h)y=h;
}
if(c=="RIGHT"){
d--;
if(d==-1)d=3;
}
if(c=="LEFT"){
d++;
if(d==4)d=0;
}
if(c=="STOP"){
cout<<x<<" "<<y<<endl;
break;
}
}
}
} | 0 | CPP |
import sys
def fastio():
from io import StringIO
from atexit import register
global input
sys.stdin = StringIO(sys.stdin.read())
input = lambda : sys.stdin.readline().rstrip('\r\n')
sys.stdout = StringIO()
register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()
def debug(*var, sep = ' ', end = '\n'):
print(*var, file=sys.stderr, end = end, sep = sep)
INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
from math import gcd
from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br
n, m = I()
ans = []
for i in range(1, m + 1):
ans.append([1, i])
for i in range(2, n + 1):
ans.append([i, 1])
print(len(ans))
for i in ans:
print(*i) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
import sys
n=int(input())
a=0
for i in range(n):
say=input()
if(say=='A'):
a+=1
else:
a-=1
if(a<0):
print("NO")
sys.exit()
if a:
print("NO")
else:
print("YES") | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int x, t, a, b, da, db;
int main() {
cin >> x >> t >> a >> b >> da >> db;
bool bingo = false;
for (int i = 0; i < t; i++) {
for (int j = 0; j < t; j++) {
int tmp = a - i * da + b - j * db;
if (tmp == x) {
bingo = true;
}
}
}
for (int i = 0; i < t; i++) {
if (a - i * da == x) bingo = true;
if (b - i * db == x) bingo = true;
}
if (x == 0) {
bingo = true;
}
if (bingo) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int x, y, z;
int p = 0;
cin >> x >> y;
while (1) {
if (x >= 2 && y >= 2) {
x -= 2;
y -= 2;
} else if (x >= 1 && y >= 12) {
--x;
y -= 12;
} else if (y >= 22) {
y -= 22;
} else {
break;
}
p = !p;
if (y >= 22) {
y -= 22;
} else if (y >= 12 && x >= 1) {
y -= 12;
--x;
} else if (y >= 2 && x >= 2) {
y -= 2;
x -= 2;
} else {
break;
}
p = !p;
}
puts(p ? "Ciel" : "Hanako");
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
long long int gcd(long long int a, long long int b) {
long long int ret = 1;
while (ret) {
ret = a % b;
a = b;
b = ret;
}
return a;
}
long long int min(long long int a, long long int b) {
if (a < b) return a;
return b;
}
long long int max(long long int a, long long int b) { return -min(-a, -b); }
int main() {
long long int n, k;
long long int a, b;
scanf("%lld %lld", &n, &k);
scanf("%lld %lld", &a, &b);
long long int i1 = a;
long long int i2 = (-a + n * k) % (n * k);
long long int x = 1000000000000000ll;
long long int y = -x;
for (int i = 1; i <= n; i++) {
long long int l1 = (k * i - b - i1 + k * n) % (k * n);
long long int l2 = (k * i + b - i1 + k * n) % (k * n);
if (l1 == 0) l1 = n * k;
x = min(x, k * n / gcd(k * n, l1));
y = max(y, k * n / gcd(k * n, l1));
if (l2 == 0) l2 = n * k;
x = min(x, k * n / gcd(k * n, l2));
y = max(y, k * n / gcd(k * n, l2));
l1 = (k * i - b - i2 + k * n) % (k * n);
l2 = (k * i + b - i2 + k * n) % (k * n);
if (l1 == 0) l1 = n * k;
x = min(x, k * n / gcd(k * n, l1));
y = max(y, k * n / gcd(k * n, l1));
if (l2 == 0) l2 = n * k;
x = min(x, k * n / gcd(k * n, l2));
y = max(y, k * n / gcd(k * n, l2));
}
printf("%lld %lld\n", x, y);
return 0;
}
| 7 | CPP |
n=list(str(input()))
m=list(str(input()))
l=[]
for i in range(len(n)):
if int(n[i])==int(m[i]):
l.append('0')
else:
l.append('1')
x=''.join(l)
print(x)
| 7 | PYTHON3 |
t = int(input())
while t > 0:
n, m = map(int, input().split())
memo = n
odd = "BW" * (m // 2)
even = "WB" * (m // 2)
if (m % 2 == 1):
odd += "B"
even += "W"
if n % 2 == 0 and m % 2 == 0:
even, odd = odd, even
while n > 2:
print(odd)
print(even)
n -= 2
if n == 2:
print(odd)
if (memo % 2) + (m % 2) == 0:
print(odd[:-2] + "BB")
else:
print(even[:-2] + "BB")
t -= 1 | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T modpow(T base, T exp) {
T result = 1;
while (exp > 0) {
if (exp & 1) result = (result * base);
base = (base * base);
exp >>= 1;
}
return result;
}
pair<int, int> p[500005];
bool comp(const pair<int, int> &p1, const pair<int, int> &p2) {
return p1.second < p2.second;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
{
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int l, r;
cin >> l >> r;
p[i] = make_pair(l, r);
}
sort(p, p + n, comp);
int ct = 1;
int curr = p[0].second;
for (int i = 1; i < n; i++) {
if (p[i].first > curr) {
ct++;
curr = p[i].second;
}
}
cout << ct << '\n';
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int ST_MAX = 1 << 20;
struct SegTree {
int start;
long long arr[ST_MAX], lazy[ST_MAX];
SegTree() {
start = ST_MAX / 2;
fill(arr, arr + ST_MAX, 0);
fill(lazy, lazy + ST_MAX, 0);
}
void construct() {
for (int i = start - 1; i > 0; i--)
arr[i] = min(arr[i << 1], arr[i << 1 | 1]);
}
void propagate(int node, int ns, int ne) {
if (lazy[node] != 0) {
if (node < start) {
lazy[node << 1] += lazy[node];
lazy[node << 1 | 1] += lazy[node];
}
arr[node] += lazy[node];
lazy[node] = 0;
}
}
void add(int s, int e, long long k, int node = 1, int ns = 0,
int ne = ST_MAX / 2) {
propagate(node, ns, ne);
if (e <= ns || ne <= s) return;
if (s <= ns && ne <= e) {
lazy[node] += k;
propagate(node, ns, ne);
return;
}
int mid = (ns + ne) >> 1;
add(s, e, k, node << 1, ns, mid);
add(s, e, k, node << 1 | 1, mid, ne);
arr[node] = min(arr[node << 1], arr[node << 1 | 1]);
}
long long query(int s, int e, int node = 1, int ns = 0, int ne = ST_MAX / 2) {
propagate(node, ns, ne);
if (e <= ns || ne <= s) return 1e18;
if (s <= ns && ne <= e) return arr[node];
int mid = (ns + ne) >> 1;
return min(query(s, e, node << 1, ns, mid),
query(s, e, node << 1 | 1, mid, ne));
}
};
bool b[550000];
SegTree st;
void print(int n) {
for (int i = 0; i < n; i++) {
long long a = st.query(i, i + 1);
if (a >= 1e9)
cout << "INF ";
else
cout << a << ' ';
}
cout << '\n';
}
void solve(int tc) {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
v[i] = v[i] - i;
}
for (int i = 0; i < k; i++) {
int a;
cin >> a;
b[a] = 1;
}
vector<int> tmp = v;
sort(tmp.begin(), tmp.end());
tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
for (int i = 0; i < n; i++)
v[i] = lower_bound(tmp.begin(), tmp.end(), v[i]) - tmp.begin();
for (int i = 0; i < n; i++) {
long long tmp = st.query(0, v[i] + 1);
st.add(0, n, 1);
long long tmp2 = st.query(v[i], v[i] + 1);
st.add(v[i], v[i] + 1, -tmp2 + tmp);
if (b[i + 1]) {
if (v[i] != 0) st.add(0, v[i], 1e9);
if (v[i] + 1 != n) st.add(v[i] + 1, n, 1e9);
}
}
long long ans = st.query(0, n);
if (ans < 1e9)
cout << ans << '\n';
else
cout << -1 << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
if (0) {
int T;
cin >> T;
for (int i = 1; i <= T; i++) solve(i);
} else {
solve(0);
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n / 2 + 1) * (n - n / 2);
}
| 8 | CPP |
// Problem: G. Maximize the Remaining String
// Contest: Codeforces - Codeforces Round #710 (Div. 3)
// URL: https://codeforces.com/contest/1506/problem/G
// Memory Limit: 256 MB
// Time Limit: 2500 ms
/*Love coding and thinking!*/
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#include <vector>
#define pb push_back
#define mem(f, x) memset(f,x,sizeof(f))
#define fo(i,a,n) for(int i=(a);i<=(n);++i)
#define fo2(i,a,n) for(int i=(a);i<(n);++i)
#define debug(x) cout<<#x<<":"<<x<<endl;
#define endl '\n'
using namespace std;
typedef pair<int,int>PII;
typedef pair<long,long>PLL;
typedef long long ll;
const int N=2e5+10;
int n,m,_;
char s[N];
char ans[N];//答案数组
map<char,bool>st;
map<char,int>mp;//
int main()
{
cin>>_;
while(_--)
{
mp.clear();
st.clear();//统计某个字符是否在答案中出现
scanf("%s",s+1);
// cout<<s+1<<endl;
int len=strlen(s+1);
for(int i=1;i<=len;i++)
mp[s[i]]++;
int num=0;
// for(auto c:mp)
// cout<<c.first<<" "<<c.second<<endl;
for(int i=1;i<=len;i++)
{
if(num==0)
{
ans[++num]=s[i];
st[s[i]]=1;
mp[s[i]]--;
continue;//第一个字符特殊处理
}
else if(!st[s[i]])
{
while(s[i]>=ans[num]&&mp[ans[num]]&&num>0)//删除前一个
{
st[ans[num]]=0;//把前边的这个字符给他删去
// mp[s[i]]++;
num--;
}
//添加新的字符
ans[++num]=s[i];
st[s[i]]=1;
}
mp[s[i]]--;
// debug(num);
// for(int i=1;i<=num;i++)
// printf("%c",ans[i]);
// puts("");
}
for(int i=1;i<=num;i++)
printf("%c",ans[i]);
puts("");
}
return 0;
}
| 13 | CPP |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <math.h>
#include <stack>
using namespace std;
typedef long long ll;
void solve(int i,int d,vector<pair<string,vector<int>>>v){
for(int i=0;i<d;i++){
cout << ".";
}
cout << v[i].first << endl;
for(int t:v[i].second){
solve(t,d+1,v);
}
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<pair<string,vector<int>>> v(n);
for(int i=0;i<n;i++){
int k; cin >> k;
cin >> v[i].first;
if(k){
v[k-1].second.push_back(i);
}
}
solve(0,0,v);
}
| 0 | CPP |
s = input()
k = 'AHIMOTUVWXY'
r = True
for c in s:
r &= c in k
if not r: break
if r and s == s[::-1]:
print('YES')
else:
print('NO')
| 8 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
long long int invmod(long long int x, long long int n, long long int mod) {
if (n == 0) return 1 % mod;
long long int half = invmod(x, n / 2, mod);
half = (half * half) % mod;
if (n % 2 == 1) half = (half * (x % mod)) % mod;
return half;
}
long long int bin(long long int a[], long long int l, long long int r,
long long int x) {
if (l <= r) {
long long int m = l + (r - l) / 2;
if (a[m] == x)
return m;
else if (a[m] > x)
return bin(a, l, m - 1, x);
else
return bin(a, m + 1, r, x);
} else
return -1;
}
long long int power(long long int b, long long int e, long long int m) {
if (e == 0) return 1;
if (e % 2)
return b * power(b * b % m, (e - 1) / 2, m) % m;
else
return power(b * b % m, e / 2, m);
}
long long int power(long long int b, long long int e) {
if (e == 0) return 1;
if (e % 2)
return b * power(b * b, (e - 1) / 2);
else
return power(b * b, e / 2);
}
long long int ncr(long long int n, long long int r, long long int x) {
if (r == 0) return 1;
long long int fac[n + 1];
fac[0] = 1;
for (long long int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % x;
return (fac[n] * power(fac[r], x - 2, x) % x * power(fac[n - r], x - 2, x) %
x) %
x;
}
long long int ncr(long long int n, long long int p) {
long long int r = min(p, n - p), rf = 1, ln = 1;
for (long long int i = 1; i <= r; i++) rf = rf * i;
for (long long int i = 0; i < r; i++) ln = ln * (n - i);
return ln / rf;
}
bool sbs(pair<long long int, long long int> &a,
pair<long long int, long long int> &b) {
return (a.second < b.second);
}
bool sbds(pair<long long int, long long int> &a,
pair<long long int, long long int> &b) {
return (a.second > b.second);
}
bool sdf(pair<long long int, long long int> &a,
pair<long long int, long long int> &b) {
return (a.first > b.first);
}
long long int SUM(long long int a[], long long int n) {
long long int sum = 0;
for (long long int i = 0; i < n; i++) sum += a[i];
return sum;
}
long long int chkprm(long long int n) {
long long int x = 5, s = sqrt(n);
if (n < 2) return 0;
if (n < 4) return 1;
if ((n & 1) == 0) return 0;
if (n % 3 == 0) return 0;
while (x <= s) {
if (n % x == 0) return 0;
x += 2;
if (n % x == 0) return 0;
x += 4;
}
return 1;
}
long long int search(long long int mx, long long int i, long long int n) {
if (i == n) return i;
long long int x = (n - i + 1) / 2, m;
cout << "? " << x << " ";
for (long long int j = i; j <= i + x - 1; j++) cout << j << " ";
cout << "\n";
cout.flush();
cin >> m;
if (m == mx)
return search(mx, i, i + x - 1);
else
return search(mx, i + x, n);
}
void myth() {
long long int n;
cin >> n;
long long int k;
cin >> k;
set<long long int> a[k];
for (long long int i = 0; i < k; i++) {
long long int x;
cin >> x;
for (long long int j = 0; j < x; j++) {
long long int y;
cin >> y;
a[i].insert(y);
}
}
cout << "? " << n << " ";
for (long long int i = 0; i < n; i++) cout << i + 1 << " ";
cout << "\n";
cout.flush();
long long int mx1, mx2;
cin >> mx1;
long long int ind = search(mx1, 1, n);
vector<long long int> ans;
for (long long int i = 0; i < k; i++) {
if (a[i].find(ind) != a[i].end()) {
cout << "? " << n - a[i].size() << " ";
for (long long int j = 1; j <= n; j++)
if (a[i].find(j) == a[i].end()) cout << j << " ";
cout << "\n";
cout.flush();
cin >> mx2;
ans.push_back(mx2);
} else
ans.push_back(mx1);
}
cout << "! ";
for (auto i : ans) cout << i << " ";
cout << "\n";
cout.flush();
string s;
cin >> s;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int test_case = 1;
cin >> test_case;
while (test_case--) {
myth();
cout << "\n";
}
cerr << "\n"
<< "Time Elasped : " << 1.0 * clock() / CLOCKS_PER_SEC << "\n";
return 0;
}
| 10 | CPP |
n, a = map(int, input().split())
t = list(map(int, input().split()))
a -= 1
d = [0] * n
for i in range(n):
if t[i] == 1:
d[abs(i - a)] += 1
res = 0
i1 = i2 = a
for i in range(n):
if d[i] == 2:
res += 2
elif d[i] == 1 and (i1 < 0 or i2 >= n or i1 == i2):
res += 1
i1 -= 1
i2 += 1
print(res) | 8 | PYTHON3 |
#include <cstdio>
int main()
{
char c = getchar();
putchar(c >= 'a' ? 'a' : 'A');
return 0;
} | 0 | CPP |
a = input()
b = input()
xd = a.split(":")
xd2 = b.split(":")
numofmina = 60*int(xd[0]) + int(xd[1])
numofminb = 60*int(xd2[0]) + int(xd2[1])
hi = int((numofminb - numofmina)/2 + numofmina)
if hi//60 < 10 and hi%60 < 10:
print("0" + str(hi//60) + ":"+ "0" + str(hi%60))
elif hi//60 >= 10 and hi%60 < 10:
print(str(hi//60) + ":"+ "0" + str(hi%60))
elif hi//60 < 10 and hi%60 >= 10:
print("0" + str(hi//60) + ":" + str(hi%60))
else:
print(str(hi//60) + ":" + str(hi%60))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, Map[100 + 5][100 + 5], X[100 + 5][100 + 5], _X[100 + 5][100 + 5],
Y[100 + 5];
int Power(int u, int v) {
int res = 1;
for (; v; v >>= 1) {
if (v & 1) res = 1LL * res * u % 1000000007;
u = 1LL * u * u % 1000000007;
}
return res;
}
void Gauss(int st, int x) {
int k = st - 1;
for (int i = st; i <= x; i++) {
int j = k + 1;
for (; j <= x; j++)
if (X[j][i]) break;
if (j > x) continue;
k++;
if (k != j) {
for (int l = st; l <= x; l++) swap(X[k][l], X[j][l]);
if (!st) swap(Y[k], Y[j]);
}
int inv = Power(X[k][i], 1000000007 - 2);
for (j = k + 1; j <= x; j++) {
int del = 1LL * inv * X[j][i] % 1000000007;
for (int l = st; l <= x; l++)
X[j][l] = (X[j][l] + 1000000007 - 1LL * del * X[k][l] % 1000000007) %
1000000007;
if (!st)
Y[j] = (Y[j] + 1000000007 - 1LL * del * Y[k] % 1000000007) % 1000000007;
}
}
}
int MatrixTree(int w) {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
X[i][j] = (i == j ? 0
: (Map[i][j] ? (1000000007 - w) % 1000000007
: 1000000007 - 1));
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = 1; j <= n; j++)
if (j != i) sum = (sum + 1000000007 - X[i][j]) % 1000000007;
X[i][i] = sum;
}
Gauss(1, n - 1);
int res = 1;
for (int i = 1; i < n; i++) res = 1LL * res * X[i][i] % 1000000007;
return res;
}
void Solve() {
for (int i = n - 1; ~i; i--) {
int pre = 0;
for (int j = i + 1; j < n; j++)
pre = (pre + 1LL * X[i][j] * Y[j] % 1000000007) % 1000000007;
Y[i] = 1LL * (Y[i] + 1000000007 - pre) * Power(X[i][i], 1000000007 - 2) %
1000000007;
}
}
int main() {
scanf("%d", &n);
for (int i = 1, u, v; i < n; i++) {
scanf("%d%d", &u, &v);
Map[u][v] = Map[v][u] = 1;
}
for (int w = 0; w < n; w++)
for (int i = 0, x = 1; i < n; i++, x = 1LL * x * w % 1000000007)
_X[w][i] = x;
for (int i = 0; i < n; i++) Y[i] = MatrixTree(i);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) X[i][j] = _X[i][j];
Gauss(0, n - 1);
Solve();
for (int i = 0; i < n; i++) printf("%d%c", Y[i], i == n ? '\n' : ' ');
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1500;
int a[10], b[10];
bool check() {
for (int i = 0; i < 4; ++i) b[i] = a[i];
sort(b, b + 4);
if (b[0] + b[3] == b[1] + b[2] && 3 * b[0] == b[3]) return true;
return false;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
if (n == 0) {
puts("YES");
printf("1\n1\n3\n3\n");
} else if (n == 1) {
puts("YES");
printf("%d\n%d\n%d\n", 2 * a[0], 2 * a[0], 3 * a[0]);
} else if (n == 2) {
bool flag = false;
for (int i = 1; i <= INF; ++i) {
for (int j = i; j <= INF; ++j) {
a[2] = i;
a[3] = j;
if (check()) {
puts("YES");
printf("%d\n%d\n", i, j);
flag = true;
break;
}
}
if (flag) break;
}
if (!flag) puts("NO");
} else if (n == 3) {
bool flag = false;
for (int i = 1; i <= INF; ++i) {
a[3] = i;
if (check()) {
puts("YES");
printf("%d\n", i);
flag = true;
break;
}
}
if (!flag) puts("NO");
} else {
if (check())
puts("YES");
else
puts("NO");
}
return 0;
}
| 8 | CPP |
n = int(input())
if (n - 2) % 3 != 0:
print(1, 1, n - 2)
elif (n - 4) % 3 != 0:
print(2, 2, n - 4)
elif (n - 3) % 3 != 0:
print(1, 2, n - 3)
| 7 | PYTHON3 |
n, k = list(input().split(" "))
n_int = int(n)
k_int = int(k)
numbs_c = [0]*10
flag = 0
for i in range(n_int, k_int+1):
b = str(i)
a = list(b)
for j in range(0, len(a)):
numbs_c[int(a[j])] += 1
for l in range(0,10):
if numbs_c[l] > 1:
flag = 1
if flag == 0:
print(int(''.join(a)))
break
else:
flag = 0
numbs_c = [0]*10
if i == k_int:
print(-1)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char buf[1 << 21], *p1 = buf, *p2 = buf;
int read() {
int res, f = 1;
char ch;
while ((ch = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin),
p1 == p2)
? EOF
: *p1++)) > '9' ||
ch < '0')
(ch == '-') && (f = -1);
for (res = ch - '0';
(ch = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin),
p1 == p2)
? EOF
: *p1++)) >= '0' &&
ch <= '9';
res = res * 10 + ch - '0')
;
return res * f;
}
const int N = 5e5 + 5;
struct node {
int v, id;
node() {}
node(int v, int id) : v(v), id(id) {}
};
vector<node> a[N];
int ans[N], val[N], vis[N], n, m, sum;
void dfs(int u, int fa, int id) {
vis[u] = 1;
for (int i = 0, s = a[u].size(); i < s; ++i)
if (!vis[a[u][i].v]) dfs(a[u][i].v, u, a[u][i].id);
if (val[u] != 0) {
id < 0 ? ans[-id] -= val[u] : ans[id] += val[u];
}
val[fa] += val[u], val[u] = 0;
}
int main() {
n = read();
for (int i = 1; i <= n; ++i) val[i] = read(), sum += val[i];
if (sum != 0) return puts("Impossible"), 0;
puts("Possible");
m = read();
for (int i = 1; i <= m; ++i) {
int u = read(), v = read();
a[u].push_back(node(v, i)), a[v].push_back(node(u, -i));
}
dfs(1, 0, 0);
for (int i = 1; i <= m; ++i) printf("%d\n", ans[i]);
return 0;
}
| 12 | CPP |
for t in range(int(input())):
n = int(input())
a = [int(s) for s in input().split()]
count = 0
x = []
x1 = set()
i = 0
while count < n:
if not(a[i] in x1):
count += 1
x.append(a[i])
x1.add(a[i])
i += 1
print(' '.join([str(i) for i in x]))
| 8 | PYTHON3 |
#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
struct Point{
double x,y;
};
int main(){
int n, ans, count;
Point seal[100];
while(cin >> n){
if(n == 0) break;
for(int i = 0; i < n; i++){
scanf("%lf,%lf",&seal[i].x,&seal[i].y);
}
ans = -1;
for(double i = 0; i <= 10; i += 0.1){
for(double j = 0; j <= 10; j +=0.1){
count = 0;
for(int s = 0; s < n; s++){
if(sqrt((i-seal[s].x)*(i-seal[s].x)+(j-seal[s].y)*(j-seal[s].y)) < 1 ||
fabs(sqrt((i-seal[s].x)*(i-seal[s].x)+(j-seal[s].y)*(j-seal[s].y)) - 1) < 0.00000001){
count++;
}
}
if(ans < count) ans = count;
}
}
cout << ans << endl;
}
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n;
cin >> n;
long long int v[n];
for (int i = 0; i < n; i++) cin >> v[i];
bool sw = false;
int idx1, idx2;
for (int i = 0; i < n - 1; i++) {
if (v[i] > v[i + 1]) {
sw = true;
int j = idx1 = i;
while (j + 1 < n && v[j] > v[j + 1]) {
++j;
}
idx2 = j;
break;
}
}
if (!sw) {
cout << "yes\n";
cout << "1 1\n";
return 0;
}
sort(v + idx1, v + idx2 + 1);
bool sol = true;
for (int i = 0; i < n - 1 && sol; i++) {
if (v[i] > v[i + 1]) sol = false;
}
if (sol) {
cout << "yes\n";
cout << idx1 + 1 << " " << idx2 + 1 << "\n";
} else
cout << "no\n";
return 0;
}
| 8 | CPP |
k = int(input())
a = list(map(int,input().split()))
a.sort(reverse = True)
count = 0
summ = 0
for i in range (12):
if summ < k:
summ += a[i]
count += 1
if summ >= k:
count = count
break
if i == 11:
if summ == k:
count = count
else:
count = -1
# print (a)
print (count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = (1 << 20) + 121, M = 25;
long long inv[M], num[M], a[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int m, n;
cin >> m;
n = (1ll << m);
m++;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++)
num[i] = (1ll << (m - 1 - i)) * (1ll << (i - 1)) * (1ll << (i - 1));
for (int i = 1; i < m; i++) {
for (int j = 0; j < n; j += (1 << i)) {
int l = j + (1 << (i - 1)), r = j + (1 << i);
for (int k = 0; k < (1 << (i - 1)); k++) {
inv[i] += lower_bound(a + l, a + r, a[j + k]) - (a + l);
num[i] -= upper_bound(a + l, a + r, a[j + k]) -
lower_bound(a + l, a + r, a[j + k]);
}
sort(a + j, a + r);
}
}
long long ans = 0;
for (int i = 0; i < m; i++) ans += inv[i];
int q;
cin >> q;
while (q--) {
int x;
cin >> x;
x++;
for (int i = 1; i < x; i++) {
inv[i] = num[i] - inv[i];
}
ans = 0;
for (int i = 0; i < m; i++) ans += inv[i];
cout << ans << "\n";
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
set<int> buy, sell, unknown;
int n;
inline int add(int a, int b) {
a += b;
if (a >= MOD) {
a -= MOD;
}
return a;
}
inline int mult(int a, int b) { return (1LL * a * b) % MOD; }
void die() {
puts("0");
exit(0);
}
int main() {
scanf("%d", &n);
static char buffer[10];
int p = 1;
for (int i = int(0); i < int(n); i++) {
int value;
scanf("%s %d", buffer, &value);
if (buffer[1] == 'D') {
if (!buy.empty() && value < *buy.rbegin()) {
buy.insert(value);
} else if (!sell.empty() && value > *sell.begin()) {
sell.insert(value);
} else {
unknown.insert(value);
}
} else {
if (buy.count(value)) {
if (value < *buy.rbegin()) {
die();
}
buy.erase(prev(buy.end()));
} else if (sell.count(value)) {
if (value > *sell.begin()) {
die();
}
sell.erase(sell.begin());
} else {
p = mult(p, 2);
}
for (auto &each : unknown) {
if (each < value) {
buy.insert(each);
} else if (each > value) {
sell.insert(each);
}
}
unknown.clear();
}
}
int ans = mult(p, add((int)unknown.size(), 1));
printf("%d\n", ans);
return 0;
}
| 10 | CPP |
n, k = map(int, input().split())
s = list(input())
count = i = 0
if n == 1:
print('0' if k else s[0])
else:
while count < k and i < n:
if i == 0:
if s[i] != '1':
s[i] = '1'
count += 1
else:
if s[i] != '0':
s[i] = '0'
count += 1
i += 1
print(''.join(s))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9+7;
int main(){
long long Q,H,S,D,N;
cin >> Q >> H >> S >> D >> N;
long long one=min({Q*4,H*2,S});
cout << min(one*N,D*(N/2)+one*(N%2)) << endl;
return 0;
}
| 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
struct FastIO{
FastIO(){
cin.tie(0);
ios::sync_with_stdio(0);
}
}fastio_beet;
//INSERT ABOVE HERE
signed main(){
int n;
cin>>n;
for(int b=0;b<(1<<n);b++){
cout<<b<<":";
for(int i=0;i<n;i++)
if((b>>i)&1) cout<<" "<<i;
cout<<"\n";
}
cout<<flush;
return 0;
}
| 0 | CPP |
n=int(input())
a=list(map(int,input().split()))
c=1
cmax=1
for i in range(n-1):
if a[i] <= a[i+1]:
c += 1
if c > cmax:
cmax = c
else:
c = 1
print(cmax) | 7 | PYTHON3 |
x,y,z=map(int,input().split())
ans=0
ans+=2*z+2*min(y,x)
f=min(y,x)
y=y-f
x=x-f
print(ans+min(1,max(y,x))) | 7 | PYTHON3 |
t=int(input())
for _ in range(t):
n=int(input())
A=list(map(int,input().split()))
p=A.index(1)
c1=1
c2=1
for i in range(1,n):
if(A[(p-i+n)%n]!=i+1):
c1=0
if(A[(p+i+n)%n]!=i+1):
c2=0
if(c1==1 or c2==1):
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int n_max = 5013;
int n, s1, s2, s3, a[n_max], s;
int main() {
cin >> n;
cout << "? 1 2" << endl;
fflush(stdout);
cin >> s1;
cout << "? 1 3" << endl;
fflush(stdout);
cin >> s2;
cout << "? 2 3" << endl;
fflush(stdout);
cin >> s3;
a[1] = (s1 + s2 - s3) / 2;
a[2] = s1 - a[1];
a[3] = s2 - a[1];
for (int i = 4; i <= n; i++) {
cout << "? 1 " << i << endl;
fflush(stdout);
cin >> s;
a[i] = s - a[1];
}
cout << "! ";
for (int i = 1; i <= n; i++) {
cout << a[i] << " ";
}
return 0;
}
| 9 | CPP |
n = int(input())
arr = []
for i in range(n):
x = input()
arr.append(x)
result = []
for i in arr:
if len(i) > 10:
q = i[0] + str(len(i)-2) + i[-1]
result.append(q)
else:
q = i
result.append(q)
for i in result:
print(i, end="\n")
| 7 | PYTHON3 |
n=input()
n=int(n)
c=0
for i in range(0,n):
s=input()
for j in s:
if j =='+':
c+=1
break
elif j=='-':
c-=1
break
print(c)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
void sync_stdio() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
}
struct Sync_stdio {
Sync_stdio() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
}
} _sync_stdio;
struct FAIL {
FAIL() {
cout << "CHANGE!!!"
<< "\n";
}
};
int go(vector<int> &v) {
int j = v.size() - 1;
v[j] += 500;
while (j > 0 && v[j] == 3500) {
v[j] = 500;
--j;
v[j] += 500;
}
if (v[0] == 3500) {
return 0;
}
return 1;
}
long long calc(const vector<int> &minutes, const vector<int> &cost) {
long long res = 0;
for (int i = (0); i < (5); ++i) {
if (minutes[i] == -1) {
continue;
}
res += cost[i] - (long long)minutes[i] * cost[i] / 250;
}
return res;
}
int get_score(int solved, int all) {
if (solved * 32 <= all) {
return 3000;
}
if (solved * 16 <= all) {
return 2500;
}
if (solved * 8 <= all) {
return 2000;
}
if (solved * 4 <= all) {
return 1500;
}
if (solved * 2 <= all) {
return 1000;
}
return 500;
}
vector<int> percent = {0, 1, 2, 4, 8, 16, 32, 0};
int check(int solved, int all, int i_solve, int cost, int all_n) {
if (get_score(solved, all) == cost) {
return 1;
}
if (i_solve == 0) {
return 0;
}
int to_low = get_score(solved, all) > cost;
if (!to_low) {
return 0;
}
for (int i = (solved); i < (solved + all_n); ++i) {
if (get_score(i, all) == cost) {
return 1;
}
}
return 0;
}
int main() {
int n;
cin >> n;
vector<vector<int>> v(n, vector<int>(5));
vector<int> sum(5);
for (int __i = 0; __i < (n); ++__i)
for (int __j = 0; __j < 5; ++__j) cin >> v[__i][__j];
;
for (int i = (0); i < (n); ++i) {
for (int j = (0); j < (5); ++j) {
sum[j] += v[i][j] != -1;
}
}
int best = INT_MAX;
vector<int> cost(5);
for (int i = (0); i < (5); ++i) {
cost[i] = 500;
}
int arr[5][128 * 32 + 100][7];
for (int cost_i = (1); cost_i < (7); ++cost_i) {
for (int i = (0); i < (5); ++i) {
for (int all = n; all < 128 * 32 + 100; ++all) {
arr[i][all][cost_i] =
check(sum[i], all, v[0][i] != -1, cost_i * 500, all - n);
}
}
}
do {
long long vasya = calc(v[0], cost);
long long petya = calc(v[1], cost);
if (petya >= vasya) {
continue;
}
for (int all = n; all < 128 * 32 + 100; ++all) {
int tans = 1;
for (int i = (0); i < (5); ++i) {
tans &= arr[i][all][cost[i] / 500];
}
if (tans == 1) {
best = min(best, all - n);
}
}
} while (go(cost));
cout << (best == INT_MAX ? -1 : best);
return 0;
}
| 8 | CPP |
for s in range(int(input())):
string=input()
store=[0 for i in range(10)]
add=0
for i in string:
add+=1
store[int(i)]+=1
store.sort()
maxi,plus,flag=9999999999,add,1
a=store[-1]
for i in range(10):
for j in range(10):
add, flag = 0, 1
for k in range(plus):
if(int(string[k])==i and flag==1):
add+=1
flag=0
elif(int(string[k])==j and flag==0):
add+=1
flag=1
if(add%2==1):
add-=1
maxi=min(maxi,plus-add)
maxi=min(maxi,plus-a)
print(maxi) | 9 | PYTHON3 |
t=int(input())
for i in range(t):
n=int(input())
ls=[int(a) for a in input().split()]
pos=[int(a) for a in input().split()]
srtls=sorted(ls)
if 1 in pos and 0 in pos:
print('Yes')
else:
if ls==srtls:
print('Yes')
else:
print('No')
| 8 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Mon Apr 6 15:40:42 2020
@author: Omkar Chavan
"""
n= int(input())
ml=[]
ol=[]
for i in range(n):
input_l=list(map(int,input().split(" ")))
ml.append(input_l)
for x in ml:
l=len(x)
count=0
for k in range(l):
if x[k]==1:
count+=1
if count>1:
ol.append(count)
print(len(ol))
| 7 | PYTHON3 |
#include<bits/stdc++.h>
#define N 100005
#define LL long long
using namespace std;
int n,m,q; LL a[N],b[N],ans[N];
int main()
{
int i,l,r,mid; LL x;
scanf("%d %d",&n,&q),a[m=1]=n;
for(i=1;i<=q;i++){
scanf("%lld",&x);
while(m&&a[m]>=x) m--;
a[++m]=x;
}
b[m]=1;
for(i=m;i>=2;i--){
for(x=a[i];;){
l=0,r=i;
while(r-l>1){
mid=(l+r)>>1;
if(x>=a[mid]) l=mid;
else r=mid;
}
if(!l){ ans[x]+=b[i]; break;}
b[l]+=b[i]*(x/a[l]),x%=a[l];
}
b[i]=0;
}
ans[a[1]]+=b[1];
for(i=n;i>=1;i--) ans[i]+=ans[i+1];
for(i=1;i<=n;i++) printf("%lld\n",ans[i]);
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, a[1005], x, y;
long long ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", a + i);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &x, &y);
ans += min(a[x], a[y]);
}
printf("%lld", ans);
return 0;
}
| 9 | CPP |
def solve():
a,b,x,y,n=map(int,input().split())
p=a
q=b
tm=n
res=0
#a re khawano
j=max(a-tm,x)
tm-=(a-j)
k=max(b-tm,y)
res=j*k
#b re khawano
j=max(b-n,y)
n-=(b-j)
k=max(a-n,x)
res=min(res,j*k)
print(res)
for _ in range(int(input())):
solve()
| 8 | PYTHON3 |
n = int(input())
for i in range(n):
S = str(input())
if len(S) > 10:
print(S[0], len(S) - 2, S[len(S) - 1], sep = '')
else:
print(S) | 7 | PYTHON3 |
name = input()
i = 0
letters = {}
for character in name:
letters[character] = letters.get(character,0) + 1
if len(letters)%2 == 0:
print("CHAT WITH HER!")
else:
print("IGNORE HIM!") | 7 | PYTHON3 |
for t in range(int(input())):
n, k = map(int, input().split())
print((n // k) * k + (min(n % k, k // 2)))
| 8 | PYTHON3 |
import sys
input=sys.stdin.readline
n=int(input())
#print(n,end=' n')
data=[0]*(2*n)
def upd(i,x):
i+=n
data[i]=x
while i>1:
data[i>>1]=data[i]|data[i^1]
i>>=1
def qry(l,r):
l+=n
r+=n
res=0
while l<r:
if l&1:
res|=data[l]
l+=1
if r&1:
r-=1
res|=data[r]
l>>=1
r>>=1
return bin(res).count('1')
for i,c in enumerate(input()[:-1],n):
data[i]=1<<(ord(c)-ord('a'))
for i in range(n-1,0,-1):
data[i]=data[i<<1]|data[i<<1|1]
ans=[]
for _ in range(int(input())):
q,a,b=input().split()
if int(q)==1:
upd(int(a)-1,1<<(ord(b)-ord('a')))
else:
ans.append(qry(int(a)-1,int(b)))
print('\n'.join(map(str,ans)))
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int _max = 1e5 + 10;
char s1[_max], s2[_max];
int dif[_max];
int cnt;
int main() {
scanf("%s%s", s1, s2);
int i, j;
for (i = j = 0; s1[i] || s2[j];) {
if (s1[i] != s2[j]) dif[cnt++] = i;
if (s1[i]) i++;
if (s2[j]) j++;
}
if (i == j && cnt == 2 && s1[dif[1]] == s2[dif[0]] &&
s1[dif[0]] == s2[dif[1]])
printf("YES");
else
printf("NO");
return 0;
}
| 7 | CPP |
n=int(input())
if(n%2):
print('Ehab')
else:
print('Mahmoud')
| 7 | PYTHON3 |
c,d=map(int,input().split())
n,m=map(int,input().split())
k=int(input())
tot=n*m
if(k>=tot):
print("0")
else:
rem=tot-k
x=n/c
y=1/d
ans=0
if(x>=y):
temp=rem//n
bacha=rem%n
if(bacha*d<=c):
ans=temp*c+bacha*d
else:
ans=(temp+1)*c
else:
ans=rem*d
print(ans) | 7 | PYTHON3 |
from collections import deque
for tt in range(int(input())):
n= int(input())
res =deque()
if n == 1 :
res.append(0)
else:
cnt = 0
while n != 1 :
if n % 2 == 0 :
n //= 2
cnt +=1
elif n % 3 == 0 :
n = (2 * n) //3
cnt +=1
elif n % 5 == 0 :
n = (4*n) // 5
cnt +=1
else:
break
if n == 1 :
res.append(cnt)
else:
res.append(-1)
for i in res:
print(i)
| 7 | PYTHON3 |
t = int(input())
from collections import Counter
for _ in range(t):
n, k, d = map(int, input().split())
a = list(map(int, input().split()))
s = Counter(a[:d])
res = len(s)
for i in range(d, len(a)):
s[a[i - d]] -= 1
s[a[i]] += 1
if s[a[i-d]] == 0: del s[a[i-d]]
res = min(res, len(s))
print(res) | 8 | PYTHON3 |
line = input().split()
n = int(line[0])
m = int(line[1])
data = []
for i in range(n):
data.append(input())
x = [1 for i in range(n)]
delete = 0
for i in range(m):
dum = [1 for j in range(n)]
status = 1
for j in range(1,n):
if data[j][i] > data[j-1][i]:
dum[j] = 0
elif data[j][i] == data[j-1][i]:
dum[j] = 1
else:
if x[j] == 1:
delete += 1
status = 0
break
if status == 1:
for j in range(len(dum)):
if dum[j] == 0:
x[j] = 0
print(delete)
| 9 | PYTHON3 |
def get(m, s):
lis_1 = ['0' for i in range(m )]
lis_2 = ['0' for i in range(m )]
s_1 = s
for i in range(m):
if s >= 9:
lis_1[i] = '9'
s -= 9
else:
lis_1[i] = str(s)
break
s = s_1
if s > (m-1)*9:
lis_2 = [str(s - (m - 1) * 9)] + ['9' for j in range(m - 1)]
else:
lis_2[0] = '1'
b = s-1
for i in range(1, m):
if b >= 9:
lis_2[-i] = '9'
b -= 9
else:
lis_2[-i] = str(b)
break
result_1 = ''.join(lis_1)
result_2 = ''.join(lis_2)
return result_2, result_1
m, s = map(int, input().split())
if m == 1 and s == 0:
print(0, 0)
else:
if s == 0 or s > m*9:
print(-1, -1)
else:
a, b = get(m, s)
print(a, b) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
char s[23][100013];
int dp[21][1 << 20];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf(" %s", &s[i]);
for (int j = 0; j < m; j++) {
int x = 0;
for (int i = 0; i < n; i++)
if (s[i][j] == '1') {
x |= (1 << i);
}
dp[0][x] += 1;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j >= 1; j--) {
for (int k = 0; k < (1 << n); k++) {
dp[j][k] += dp[j - 1][k ^ (1 << i)];
}
}
}
int ans = 1e9;
for (int i = 0; i < (1 << n); i++) {
int cur = 0;
for (int j = 0; j <= n; j++) {
cur += dp[j][i] * min(j, n - j);
}
ans = min(ans, cur);
}
printf("%d\n", ans);
return 0;
}
| 11 | CPP |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<30;
struct hoge {
int w, l;
char c;
hoge(char c, int w, int l) : c(c), w(w), l(l) {}
};
bool operator<(const hoge &a, const hoge &b) {
return a.w != b.w ? a.w > b.w : a.l < b.l;
}
int main() {
int n;
while(cin >> n, n) {
vector<hoge> v;
REP(j,n) {
char c;
cin >> c;
int a = 0, b = 0;
REP(i,n-1) {
int r;
cin >> r;
if (r == 0)
a++;
else if (r == 1)
b++;
}
v.push_back(hoge(c,a,b));
}
sort(ALL(v));
FOR(it,v)
cout << it->c << endl;
}
} | 0 | CPP |
t = int(input())
for _ in range(t):
a, b, c, n = map(int, input().split())
x = (a + b + c + n) / 3
diff_a = (x - a)
diff_b = (x - b)
diff_c = (x - c)
if not x.is_integer() or (diff_a < 0) or (diff_b < 0) or (diff_c < 0):
print("NO")
else:
print("YES") | 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct BIT{
int t[5000];
void init(){
for(int i=0;i<5000;i++){
t[i]=0;
}
}
void add(int i,int x){
i+=10;
while( i<5000 ){
t[i]+=x;
i+=(i&-i);
}
}
int sum(int i){
i+=10;
int res=0;
while(i>0){
res+=t[i];
i-=(i&-i);
}
return res;
}
};
BIT T;
int H,W,L,P;
short t[4000][4000];
short A[4000][4000];
short B[4000][4000];
short C[4000][4000];
short D[4000][4000];
vector< short > G[5000];
ll solve(int y,int x){
for(int i=0;i<5000;i++)G[i].clear();
T.init();
ll res=0;
for(int i=0;i<5000;i++){
int py=y+i;
int px=x+i;
if(py>=H || px>=W)break;
if(i-L+1>=0){
int ay=py-L+1;
int ax=px-L+1;
int len = min( C[ay][ax], D[ay][ax]) - 1;
if(i-L+1+len>=i){
T.add( i-L+1 , 1 );
G[ i-L+1 + len ].push_back( i-L+1 );
}
}
int fr=min(A[py][px],B[py][px]);
if(fr>=3){
ll v = T.sum(4500) - T.sum(i-fr);
res+=v;
}
for(int j=0;j<(int)G[i].size();j++){
T.add( G[i][j], -1 );
}
}
return res;
}
int main(){
scanf("%d %d %d %d",&H,&W,&L,&P);
for(int i=0;i<P;i++){
int y,x;
scanf("%d %d",&y,&x);
y--,x--;
t[y][x]=1;
}
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(t[i][j]==1){
A[i][j]=0;
continue;
}
A[i][j]=1;
if(j>0){
A[i][j]+=A[i][j-1];
}
}
}
for(int j=0;j<W;j++){
for(int i=0;i<H;i++){
if(t[i][j]==1){
B[i][j]=0;
continue;
}
B[i][j]=1;
if(i>0){
B[i][j]+=B[i-1][j];
}
}
}
for(int i=0;i<H;i++){
for(int j=W-1;j>=0;j--){
if(t[i][j]==1){
C[i][j]=0;
continue;
}
C[i][j]=1;
if(j+1<W){
C[i][j]+=C[i][j+1];
}
}
}
for(int j=0;j<W;j++){
for(int i=H-1;i>=0;i--){
if(t[i][j]==1){
D[i][j]=0;
continue;
}
D[i][j]=1;
if(i+1<H){
D[i][j]+=D[i+1][j];
}
}
}
ll ans=0;
for(int i=0;i<H;i++){
ans+= solve(i,0);
}
for(int i=1;i<W;i++){
ans+= solve(0,i);
}
printf("%lld\n",ans);
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, k, x, s;
cin >> n >> m >> k >> x >> s;
vector<long long> fst;
vector<long long> fstCost;
vector<long long> snd;
vector<long long> sndCost;
long long tmp;
for (long long i = 0; i < m; i++) {
cin >> tmp;
fst.emplace_back(tmp);
}
for (long long i = 0; i < m; i++) {
cin >> tmp;
fstCost.emplace_back(tmp);
}
for (long long i = 0; i < k; i++) {
cin >> tmp;
snd.emplace_back(tmp);
}
for (long long i = 0; i < k; i++) {
cin >> tmp;
sndCost.emplace_back(tmp);
}
long long res = n * x;
for (int i = 0; i < snd.size(); i++) {
if (sndCost[i] <= s) {
res = min(res, x * max(0LL, (n - snd[i])));
} else {
break;
}
}
for (long long i = 0; i < m; i++) {
if (fstCost[i] > s) continue;
res = min(res, n * fst[i]);
long long lo = 0;
long long hi = k - 1;
while (lo <= hi) {
long long mid = lo + (hi - lo) / 2;
if (fstCost[i] + sndCost[mid] > s) {
hi = mid - 1;
} else {
long long instant = snd[mid];
res = min(res, fst[i] * (max(n - instant, 0LL)));
lo = mid + 1;
}
}
}
cout << res;
}
| 9 | CPP |
#include "bits/stdc++.h"
using namespace std;
int main() {
int X;
cin >> X;
for (int a = -118;a<=119;++a) {
for (int b = -119; b <= 118;++b) {
if (X == (pow(a,5)-pow(b,5))) {
cout << a << " "<<b << endl;
return 0;
}
}
}
return 0;
} | 0 | CPP |
# Author : -pratyay-
import sys
inp=sys.stdin.buffer.readline
inar=lambda: list(map(int,inp().split()))
inin=lambda: int(inp())
inst=lambda: inp().decode().strip()
_T_=1
for _t_ in range(_T_):
n=inin()
a=inar()
if n==1:
print(1,1); print(-a[0]); print(1,1); print(0); print(1,1); print(0); break
print(n,n)
print(-a[-1])
a[-1]-=a[-1]
print(1,n-1)
for i in range(n-1):
print(a[i]*(n-1),end=' ')
a[i]+=a[i]*(n-1)
print()
print(1,n)
for i in range(n):
print(-a[i],end=' ')
a[i]-=a[i]
print() | 7 | PYTHON3 |
#include<iostream>
using namespace std;
static const int MAX_H = 100;
static const int MAX_W = 100;
static const int MOD = 100000;
int w, h;
int memo[3][3][MAX_H + 1][MAX_W + 1];
int main(){
for(;;){
cin >> w >> h;
if(w == 0 && h == 0) break;
w++; h++;
fill(memo[0][0][0], memo[3][0][0], 0);
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(i == 0 && j == 0) memo[2][2][i][j] = 1;
else if(i == 1 && j == 0) memo[2][0][i][j] = 1;
else if(i == 0 && j == 1) memo[2][1][i][j] = 1;
else if(j == 0){
memo[0][0][i][j] += memo[0][0][i - 1][j];
}else if(i == 0){
memo[1][1][i][j] += memo[1][1][i][j - 1];
}else{
for(int k = 0; k < 3; k++){
for(int l = 0; l < 2; l++){
if(k != 0 || l != 1){
memo[l][0][i][j] += memo[k][l][i - 1][j];
memo[l][0][i][j] %= MOD;
}
if(k != 1 || l != 0){
memo[l][1][i][j] += memo[k][l][i][j - 1];
memo[l][1][i][j] %= MOD;
}
}
}
}
}
}
int res = 0;
for(int i = 0; i < 2; i++){
for(int j = 0; j < 2; j++){
res += memo[i][j][h - 1][w - 1];
res %= MOD;
}
}
cout << res << endl;
}
return 0;
}
| 0 | CPP |
n = int(input())
import math
for _ in range(n):
ax,ay,bx,by,cx,cy = [float(i) for i in input().split()]
ab = math.sqrt((ax-bx)**2+(ay-by)**2)
bc = math.sqrt((bx-cx)**2+(by-cy)**2)
ca = math.sqrt((cx-ax)**2+(cy-ay)**2)
cos_a = (ab**2+ca**2-bc**2)/(2*ab*ca)
sin_a = math.sqrt(1-cos_a**2)
r = bc/(2*sin_a)
px = ((ay-cy)*(ay**2 -by**2 +ax**2 -bx**2) -(ay-by)*(ay**2 -cy**2 +ax**2 -cx**2)) / (2*(ay-cy)*(ax-bx)-2*(ay-by)*(ax-cx))
py = ((ax-cx)*(ax**2 -bx**2 +ay**2 -by**2) -(ax-bx)*(ax**2 -cx**2 +ay**2 -cy**2)) / (2*(ax-cx)*(ay-by)-2*(ax-bx)*(ay-cy))
def round3(x):
x_ = x*10**3
if x_%1 < 0.5:
x_ = math.floor(x_)
else:
x_ = math.ceil(x_)
return x_*10**(-3)
print("{:.3f} {:.3f} {:.3f}".format(round3(px),round3(py),round3(r)))
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll q;
cin >> q;
for (ll _ = 0; _ < q; _++) {
ll n, k;
cin >> n >> k;
ll grundy;
if (k % 3 == 0) {
if (n % (k + 1) == k) {
grundy = 3;
} else {
n %= k + 1;
grundy = n % 3;
}
} else {
grundy = n % 3;
}
cout << (grundy != 0 ? "Alice" : "Bob") << endl;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
char readCharacter;
bool remaining = false;
template <typename T>
bool readInt(T &x);
template <typename T>
bool readString(T &x);
template <typename T>
bool readChar(T &x);
bool readCharArray(char *&x);
template <typename T>
bool readFloat(T &x);
template <typename T>
bool readDouble(T &x);
bool readVar(bool &x);
bool readVar(short int &x);
bool readVar(int &x);
bool readVar(long int &x);
bool readVar(long long int &x);
bool readVar(unsigned short int &x);
bool readVar(unsigned int &x);
bool readVar(unsigned long &x);
bool readVar(unsigned long long &x);
bool readVar(std::string &x);
bool readVar(char &x);
bool readVar(char *&x);
bool readVar(float &x);
bool readVar(double &x);
bool readVar(long double &x);
template <typename T>
void writeInt(T x);
void writeString(std::string x);
void writeChar(char x);
void writeCharArray(char *x);
void writeFloat(float x);
template <typename T>
void writeDouble(T x);
void writeVar(bool x);
void writeVar(short int x);
void writeVar(int x);
void writeVar(long int x);
void writeVar(long long int x);
void writeVar(unsigned short int x);
void writeVar(unsigned int x);
void writeVar(unsigned long x);
void writeVar(unsigned long long x);
void writeVar(char x);
void writeVar(char *x);
void writeVar(std::string x);
void writeVar(float x);
void writeVar(double x);
void writeVar(long double x);
using namespace std;
int x, l, r, k, u[30], res, t;
string s, a, b;
vector<int> g, e;
int main() {
readVar(t);
while (t--) {
readVar(k), readVar(s), readVar(a), readVar(b);
int n = int(s.size());
g.clear();
for (int i = 0; i < k; ++i) {
u[i] = -1;
g.push_back(i);
}
bool ok = 0, ok1 = 0, ok2 = 0;
for (int i = 0; i < n; ++i) {
x = s[i] - 'a';
l = a[i] - 'a';
r = b[i] - 'a';
res = -1;
if (ok1) l = -1;
if (ok2) r = k;
if (u[x] != -1) {
if (u[x] < l || u[x] > r) {
ok = 1;
break;
}
if (u[x] > l) ok1 = 1;
if (u[x] < r) ok2 = 1;
continue;
}
e.clear();
for (int j = 0; j < int(g.size()); ++j) {
if (l > g[j] || r < g[j]) continue;
e.push_back(j);
if (int(e.size()) == 3) break;
}
if (!int(e.size())) {
ok = 1;
break;
}
if (int(e.size()) == 1) {
res = e[0];
}
if (res == -1)
for (auto to : e) {
if (l < g[to] && g[to] < r) {
res = to;
break;
}
}
if (res == -1) {
if (g[e[0]] == l) res = e[0];
if (g[e[1]] == l) res = e[1];
if (res == -1) {
res = e[0];
}
}
u[x] = g[res];
if (g[res] > l) ok1 = 1;
if (g[res] < r) ok2 = 1;
swap(g[res], g[int(g.size()) - 1]);
g.pop_back();
}
if (!ok) {
writeVar("YES\n");
for (int i = 0; i < k; ++i) {
if (u[i] == -1) {
u[i] = g[int(g.size()) - 1];
g.pop_back();
}
writeVar(char(u[i] + 'a'));
}
writeVar('\n');
continue;
}
g.clear();
for (int i = 0; i < k; ++i) {
u[i] = -1;
g.push_back(i);
}
ok = 0;
ok1 = 0;
ok2 = 0;
for (int i = 0; i < n; ++i) {
x = s[i] - 'a';
l = a[i] - 'a';
r = b[i] - 'a';
res = -1;
if (ok1) l = -1;
if (ok2) r = k;
if (u[x] != -1) {
if (u[x] < l || u[x] > r) {
ok = 1;
break;
}
if (u[x] > l) ok1 = 1;
if (u[x] < r) ok2 = 1;
continue;
}
e.clear();
for (int j = 0; j < int(g.size()); ++j) {
if (l > g[j] || r < g[j]) continue;
e.push_back(j);
if (int(e.size()) == 3) break;
}
if (!int(e.size())) {
ok = 1;
break;
}
if (int(e.size()) == 1) {
res = e[0];
}
if (res == -1)
for (auto to : e) {
if (l < g[to] && g[to] < r) {
res = to;
break;
}
}
if (res == -1) {
if (g[e[0]] == r) res = e[0];
if (g[e[1]] == r) res = e[1];
if (res == -1) {
res = e[0];
}
}
u[x] = g[res];
if (g[res] > l) ok1 = 1;
if (g[res] < r) ok2 = 1;
swap(g[res], g[int(g.size()) - 1]);
g.pop_back();
}
if (!ok) {
writeVar("YES\n");
for (int i = 0; i < k; ++i) {
if (u[i] == -1) {
u[i] = g[int(g.size()) - 1];
g.pop_back();
}
writeVar(char(u[i] + 'a'));
}
writeVar('\n');
continue;
}
writeVar("NO\n");
}
return 0;
}
template <typename T>
bool readInt(T &x) {
x = 0;
T sig = 1;
if (!remaining)
readCharacter = getchar(), remaining = true;
else
remaining = false;
while (!isdigit(readCharacter) && readCharacter != EOF)
sig = (readCharacter == '-' ? -sig : sig), readCharacter = getchar();
if (readCharacter == EOF) return remaining = false, false;
while (isdigit(readCharacter) && readCharacter != EOF)
x = x * 10 + readCharacter - '0', readCharacter = getchar();
x *= sig;
return true;
}
template <typename T>
bool readString(T &x) {
x = "";
if (!remaining)
readCharacter = getchar(), remaining = true;
else
remaining = false;
while (
(readCharacter == '\n' || readCharacter == '\t' || readCharacter == ' '))
readCharacter = getchar();
if (readCharacter == EOF) return remaining = false, false;
while ((readCharacter != '\n' && readCharacter != '\t' &&
readCharacter != ' ' && readCharacter != EOF))
x += readCharacter, readCharacter = getchar();
return true;
}
template <typename T>
bool readChar(T &x) {
if (!remaining)
readCharacter = getchar();
else
remaining = false;
if (readCharacter == EOF) return remaining = false, false;
while (
(readCharacter == '\n' || readCharacter == '\t' || readCharacter == ' '))
readCharacter = getchar();
remaining = false;
x = readCharacter;
return true;
}
bool readCharArray(char *&x) {
std::string y;
if (readString(y) == false) return false;
x = new char[(int)y.size() + 1];
strcpy(x, y.c_str());
return true;
}
template <typename T>
bool readFloat(T &x) {
return (scanf("%f", &x) != EOF);
}
template <typename T>
bool readDouble(T &x) {
double y;
if (scanf("%lf", &y) == EOF) return false;
x = y;
return true;
}
bool readVar(bool &x) {
int aux;
bool ret = readInt(aux);
x = (aux != 0);
return ret;
}
bool readVar(short int &x) { return readInt(x); }
bool readVar(int &x) { return readInt(x); }
bool readVar(long int &x) { return readInt(x); }
bool readVar(long long int &x) { return readInt(x); }
bool readVar(unsigned short int &x) { return readInt(x); }
bool readVar(unsigned int &x) { return readInt(x); }
bool readVar(unsigned long &x) { return readInt(x); }
bool readVar(unsigned long long &x) { return readInt(x); }
bool readVar(std::string &x) { return readString(x); }
bool readVar(char &x) { return readChar(x); }
bool readVar(char *&x) { return readCharArray(x); }
bool readVar(float &x) { return readFloat(x); }
bool readVar(double &x) { return readDouble(x); }
bool readVar(long double &x) { return readDouble(x); }
template <typename T>
void writeInt(T x) {
if (x < 0) {
putchar('-');
x = -x;
}
char writeBuffer[20], *writePtr = writeBuffer;
do {
*writePtr++ = '0' + x % 10;
x /= 10;
} while (x);
do {
putchar(*--writePtr);
} while (writePtr > writeBuffer);
}
void writeChar(char x) { putchar(x); }
void writeCharArray(char *x) {
while (*x != '\0') putchar(*x++);
}
void writeString(std::string x) {
for (char c : x) putchar(c);
}
void writeFloat(float x) { printf("%f", x); }
template <typename T>
void writeDouble(T x) {
printf("%lf", (double)x);
}
void writeVar(bool x) { writeInt(x); }
void writeVar(short int x) { writeInt(x); }
void writeVar(int x) { writeInt(x); }
void writeVar(long int x) { writeInt(x); }
void writeVar(long long int x) { writeInt(x); }
void writeVar(unsigned short int x) { writeInt(x); }
void writeVar(unsigned int x) { writeInt(x); }
void writeVar(unsigned long x) { writeInt(x); }
void writeVar(unsigned long long x) { writeInt(x); }
void writeVar(std::string x) { writeString(x); }
void writeVar(char x) { writeChar(x); }
void writeVar(char *x) { writeCharArray(x); }
void writeVar(float x) { writeFloat(x); }
void writeVar(double x) { writeDouble(x); }
void writeVar(long double x) { writeDouble(x); }
| 11 | CPP |
n=int(input())
x=list(map(int,input().split()))[:n]
t=0
a=0
b=0
c=0
for i in range(n):
if x[i]==4:
t+=1
elif x[i]==1:
a+=1
elif x[i]==2:
b+=2
elif x[i]==3:
c+=1
if c>=a:
if b%4==0:
t=t+c+(b//4)
else:
t=t+c+(b//4+1)
elif a>c and b%4==0:
a=a-c
if a%4==0:
t+=c+(b//4)+(a//4)
else:
t+=c+(b//4)+(a//4+1)
elif a>c and b%4!=0:
a=a-c
if (a+2)%4==0:
t+=c+(b//4)+((a+2)//4)
else:
t+=c+(b//4)+((a+2)//4+1)
print(t)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int u, v;
int next;
int len;
} edge[3050 * 2];
int n;
int cnt;
int head[3050];
int ans1, ans2;
int dp[3050 * 2][2];
int ans;
int res;
void addedge(int u, int v, int w) {
edge[cnt].u = u;
edge[cnt].v = v;
edge[cnt].next = head[u];
edge[cnt].len = w;
head[u] = cnt++;
}
void dfs1(int root, int fa, int adj) {
int i, j, k;
int y;
dp[root][0] = 0;
for (i = head[root]; i != -1; i = edge[i].next) {
y = edge[i].v;
if (y == fa || y == adj) continue;
dfs1(y, root, adj);
dp[root][0] += dp[y][0] + edge[i].len;
}
}
void dfs2(int root, int fa, int id, int adj) {
int i, j, k;
int y;
if (fa != -1) {
if (edge[id].len) {
dp[root][1] = dp[fa][1] - 1;
} else {
dp[root][1] = dp[fa][1] + 1;
}
}
ans = min(ans, dp[root][1]);
for (i = head[root]; i != -1; i = edge[i].next) {
y = edge[i].v;
if (y == fa || y == adj) continue;
dfs2(y, root, i, adj);
}
}
int main() {
int i, j;
cnt = 0;
scanf("%d", &n);
memset(head, -1, sizeof(head));
for (i = 1; i < n; i++) {
int a, b;
scanf("%d %d", &a, &b);
addedge(a, b, 0);
addedge(b, a, 1);
}
if (n == 1) {
puts("0");
return 0;
}
res = 1 << 25;
for (i = 0; i < cnt; i = i + 2) {
int u, v;
u = edge[i].u;
v = edge[i].v;
dfs1(u, -1, v);
dp[u][1] = dp[u][0];
ans = 1 << 25;
dfs2(u, -1, -1, v);
ans1 = ans;
dfs1(v, -1, u);
dp[v][1] = dp[v][0];
ans = 1 << 25;
dfs2(v, -1, -1, u);
ans2 = ans;
res = min(ans1 + ans2, res);
}
printf("%d\n", res);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long i,n,a,b;
int main()
{
cin>>n>>a>>b;
cout<<min(n*a,b);
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int m, n;
struct sched {
vector<pair<pair<int, int>, pair<int, int> > > plan;
int g[64][64];
pair<int, int> cur[64];
enum direction { LEFT, RIGHT, UP, DOWN };
void move(int id, direction dir) {
int ix, iy, x, y;
tie(ix, iy) = tie(x, y) = cur[id];
switch (dir) {
case LEFT:
x--;
break;
case RIGHT:
x++;
break;
case UP:
y++;
break;
case DOWN:
y--;
break;
}
cur[id] = {x, y};
if (g[x][y]) move(g[x][y], dir);
g[ix][iy] = 0;
g[x][y] = id;
plan.push_back({{ix, iy}, {x, y}});
}
void movex(int id, int dest) {
int x, y;
tie(x, y) = cur[id];
while (x < dest) {
move(id, RIGHT);
x++;
}
while (x > dest) {
move(id, LEFT);
x--;
}
}
void movey(int id, int dest) {
int x, y;
tie(x, y) = cur[id];
while (y < dest) {
move(id, UP);
y++;
}
while (y > dest) {
move(id, DOWN);
y--;
}
}
void work() {
vector<int> ids;
for (int i = 1; i <= (m); i++) ids.push_back(i);
sort((ids).begin(), (ids).end(),
[&](int x, int y) { return cur[x].first < cur[y].first; });
for (int i = 0; i < (m); i++) movex(ids[i], i + 1);
for (int i = 1; i <= (m); i++) movey(i, i);
for (int i = 1; i <= (m); i++) movex(i, i);
}
void rev() {
reverse((plan).begin(), (plan).end());
for (auto& p : plan) swap(p.first, p.second);
}
void print() {
for (auto& p : plan) {
int x, y, z, w;
tie(x, y) = p.first;
tie(z, w) = p.second;
cout << x << ' ' << y << ' ' << z << ' ' << w << endl;
}
}
template <typename T>
sched(T init) {
for (int i = 1; i <= (m); i++) {
cur[i] = init[i];
g[init[i].first][init[i].second] = i;
}
work();
}
};
pair<int, int> init[64], fin[64];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= (m); i++) scanf("%d%d", &init[i].first, &init[i].second);
for (int i = 1; i <= (m); i++) scanf("%d%d", &fin[i].first, &fin[i].second);
sched s1(init), s2(fin);
cout << s1.plan.size() + s2.plan.size() << endl;
s1.print();
s2.rev();
s2.print();
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxm = 1e5 + 10;
const int inf = 0x3f3f3f3f;
template <typename T>
inline bool read(T &x) {
x = 0;
bool neg = 0;
char c = getchar();
for (; c < '0' || c > '9'; c = getchar())
if (c == '-')
neg = 1;
else if (c == EOF)
return 0;
for (; '0' <= c && c <= '9'; c = getchar()) x = x * 10 + (c ^ 48);
neg ? (x = -x) : 0;
return c != EOF;
}
template <typename A, typename... B>
inline bool read(A &x, B &...y) {
return read(x) && read(y...);
}
queue<int> pos[maxm];
vector<int> v;
int b[maxm], flag[maxm], num[maxm], app[maxm], ans[maxm], rk[maxm];
struct node {
int col, num;
friend bool operator<(node a, node b) { return a.num < b.num; }
};
priority_queue<node> pq;
void init(int n) {
while (!pq.empty()) pq.pop();
for (int i = 0; i <= n + 3; i++) {
while (!pos[i].empty()) pos[i].pop();
flag[i] = 0;
num[i] = 0;
app[i] = 0;
}
v.clear();
}
bool cmp(int a, int b) { return num[a] > num[b]; }
int main() {
int T;
read(T);
while (T--) {
int n, x, y;
read(n, x, y);
init(n);
for (int i = 1; i <= n; i++) {
read(b[i]);
pos[b[i]].push(i);
app[b[i]] = 1;
num[b[i]]++;
}
for (int i = 1; i <= n + 1; i++)
if (num[i]) pq.push({i, num[i]});
for (int i = 1; i <= x; i++) {
node nd = pq.top();
while (nd.num != num[nd.col]) {
pq.pop();
nd = pq.top();
}
int j = pos[nd.col].front();
pos[nd.col].pop();
ans[j] = nd.col;
flag[j] = 1;
nd.num--;
num[nd.col]--;
pq.pop();
if (nd.num) pq.push(nd);
}
for (int i = 1; i <= n + 1; i++) rk[i] = i;
sort(rk + 1, rk + n + 2, cmp);
rk[n + 2] = rk[1];
int cnt = 0;
int pt = 1;
for (int i = 1; i <= n + 1; i++) {
if (cnt >= y - x) break;
int col1 = rk[i];
if (num[col1] == 0) continue;
for (int j = max(pt, i) + 1; j <= n + 2; j++) {
int col2 = rk[j];
if (col1 == col2) continue;
if (pos[col2].empty()) {
pt = j;
continue;
}
while (!pos[col2].empty()) {
int k = pos[col2].front();
pos[col2].pop();
ans[k] = col1;
flag[k] = 1;
num[col1]--;
cnt++;
if (num[col1] == 0 || cnt >= y - x) break;
}
if (pos[col2].empty()) pt = j;
if (num[col1] == 0 || cnt >= y - x) break;
}
}
if (cnt < y - x) {
printf("NO\n");
continue;
}
int noapp = 0;
for (int i = 1; i <= n + 1; i++) {
if (!app[i]) {
noapp = i;
break;
}
}
for (int i = 1; i <= n; i++) {
if (!flag[i]) {
ans[i] = noapp;
}
}
printf("YES\n");
for (int i = 1; i <= n; i++) {
printf("%d%c", ans[i], i == n ? '\n' : ' ');
}
}
return 0;
}
| 11 | CPP |
s = input()
if 'C' in s and 'F' in s[s.index('C')+1:]:
print('Yes')
exit()
else:
print('No') | 0 | PYTHON3 |
import sys
lines = sys.stdin.readlines()
n, k = map(int, lines[0].split())
s = list(map(int, lines[1].split()))
if k == 1:
if n == 1: print(s[0])
else: print(s[0]+s[1])
sys.exit(0)
scene1 = s[-1]
left_boxes = k-1
left_numbers = n-1
small = 0
end = n-2
while small <= end:
is_double = 2*left_boxes <= left_numbers
if s[small]+s[end] <= scene1:
small += 1
end -= 1
left_boxes -= 1; left_numbers -= 2;
else:
if is_double:
scene1 = max(scene1, s[small]+s[end])
small += 1
end -= 1
else:
end -= 1
left_boxes -= 1; left_numbers -= 1
if 2*k == n: scene1 = float('inf')
scene2 = s[0]+s[-1]
left_boxes = k-1
left_numbers = n-2
small = 1
end = n-2
while small <= end:
is_double = 2*left_boxes <= left_numbers
if s[small]+s[end] <= scene2:
small += 1
end -= 1
left_boxes -= 1; left_numbers -= 2;
else:
if is_double:
scene2 = max(scene2, s[small]+s[end])
small += 1
end -= 1
else:
end -= 1
left_boxes -= 1; left_numbers -= 1
print(min(scene1, scene2))
| 8 | PYTHON3 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
while True:
x,y,s = map(int,input().split(" "))
if x == 0 and y == 0 and s == 0:
break
cost = 0
for i in range(s*100//(100+x),s+1):
for j in range(1,i//2+1):
if (j*(100+x)//100) + ((i-j)*(100+x)//100) == s:
cost = max(cost,(j*(100+y)//100 + (i-j)*(100+y)//100))
else:
continue
print(cost) | 0 | PYTHON3 |
n = int(input())
d = list(map(int,input().split()))
d = [0]+d
a,b = list(map(int,input().split()))
dc = [sum(d[:i]) for i in range(1, n+1)]
print(dc[b-1]-dc[a-1])
| 7 | PYTHON3 |
Subsets and Splits