solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
inline int read() {
int x = 0;
char ch = getchar();
while (ch < '0' || ch > '9') ch = getchar();
while ('0' <= ch && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return x;
}
int n, dp[N][N][2], ans;
struct line {
int x, p;
} l[N];
bool operator<(line a, line b) {
if (a.x != b.x) return a.x < b.x;
return a.p < b.p;
}
int main() {
n = read();
for (register int i = 1; i <= n; i++) l[i].x = read(), l[i].p = read();
sort(l + 1, l + n + 1), l[0].x = -1e9;
for (register int i = 0; i <= n; i++) {
for (register int j = 0; j <= i; j++) {
for (register int s = 0; s <= 1; s++) {
ans = max(ans, dp[i][j][s]);
int r = l[j].x + s * l[j].p, x, y, mx = -1e9;
for (register int k = i + 1; k <= n; k++) {
for (register int t = 0; t <= 1; t++) {
int tmp = l[k].x + t * l[k].p;
if (tmp > mx) mx = tmp, x = k, y = t;
dp[k][x][y] =
max(dp[k][x][y], dp[i][j][s] + min(l[k].p, tmp - r) + mx - tmp);
}
}
}
}
}
printf("%d", ans);
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,cnt=1,sum=0;
cin >> n;
long long a[n],ans=n;
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a,a+n);
for(int i=0;i<n-1;i++){
sum+=a[i];
if(a[i+1]/sum<2 or (a[i+1]/sum==2 and a[i+1]%sum==0)){
cnt++;
}else{
ans-=cnt;
cnt=1;
}
}
cout << ans << endl;
return 0;
} | 0 | CPP |
n, m = map(int,input().split())
s = input().split()
t = input().split()
q = int(input())
for p in range(q):
y = int(input())
i = y % n
if i == 0: i == n
j = y % m
if j == 0: j == m
print(s[i-1]+t[j-1]) | 7 | PYTHON3 |
n = input()
q = []
k = 0
for i in range(len(n)):
if n[i] == "Q":
q.append(i)
m = len(q)
for i in range(m-1):
for j in range(i+1,m):
k+=n[q[i]+1:q[j]].count('A')
print(k) | 7 | PYTHON3 |
import sys
try:
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
except:
pass
t = int(input())
for _ in range(t):
n = int(input())
prev_a = 0
prev_b = 0
flag = True
l = []
for i in range(n):
a,b = map(int,input().split())
l.append([a,b])
# print(l)
for a,b in l:
if a<prev_b or b<prev_b:
# print(prev_a,prev_b,a,b,"*")
flag = False
break
if (a-prev_a) < (b-prev_b):
# print(prev_a,prev_b,a,b)
flag = False
break
prev_a = a; prev_b = b
if flag:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int T = 1;
ll N;
int main(){
cin >> T;
while(T--){
cin >> N;
string s;
cin >> s;
sort(s.begin(),s.end());
cout << s <<"\n";
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
void insert(vector<long long> &req, long long ele) {
req.push_back(ele);
long long temp = ele, i = ((long long)req.size()) - 2;
while (req[i] > ele and i >= 0) {
req[i + 1] = req[i];
i--;
}
req[i + 1] = ele;
}
void solve() {
long long n;
cin >> n;
;
long long h;
cin >> h;
;
vector<long long> arr(n);
for (long long i = 0; i < (long long)n; i++) {
cin >> arr[i];
};
vector<long long> req;
long long sum = arr[0], i;
req.push_back(arr[0]);
for (i = 1; i < n; i++) {
insert(req, arr[i]);
long long j = ((long long)req.size()) - 1, temp = 0;
while (j >= 0) {
temp += req[j];
j -= 2;
}
if (temp > h) break;
}
cout << i;
cout << '\n';
;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
solve();
return 0;
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
int cnt = 0;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
char a;
cin >> a;
if(a == '#') cnt++;
}
}
cout << (cnt == h + w - 1 ? "Possible" : "Impossible") << endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
void chkmin(T1 &x, T2 y) {
if (x > y) x = y;
}
template <typename T1, typename T2>
void chkmax(T1 &x, T2 y) {
if (x < y) x = y;
}
inline void debug(int x) { fprintf(stderr, "ycx has aked ioi %d times\n", x); }
namespace fastio {
char rbuf[1 << 23], *p1 = rbuf, *p2 = rbuf, wbuf[1 << 23], *p3 = wbuf;
inline char getc() {
return p1 == p2 &&
(p2 = (p1 = rbuf) + fread(rbuf, 1, 1 << 23, stdin), p1 == p2)
? -1
: *p1++;
}
inline void putc(char x) { (*p3++ = x); }
template <typename T>
void read(T &x) {
x = 0;
char c = getchar();
T neg = 0;
while (!isdigit(c)) neg |= !(c ^ '-'), c = getchar();
while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
if (neg) x = (~x) + 1;
}
template <typename T>
void recursive_print(T x) {
if (!x) return;
recursive_print(x / 10);
putc(x % 10 ^ 48);
}
template <typename T>
void print(T x) {
if (!x) putc('0');
if (x < 0) putc('-'), x = ~x + 1;
recursive_print(x);
}
template <typename T>
void print(T x, char c) {
if (!x) putc('0');
if (x < 0) putc('-'), x = ~x + 1;
recursive_print(x);
putc(c);
}
void print_final() { fwrite(wbuf, 1, p3 - wbuf, stdout); }
} // namespace fastio
const int MAXN = 1e5;
const int INF = 0x3f3f3f3f;
int n, m, a[MAXN + 5], b[MAXN + 5], dp[MAXN + 5], mn[MAXN + 5], pre[MAXN + 5],
ps[MAXN + 5];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n + 1; i++) mn[i] = INF + 1;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
a[++n] = INF;
scanf("%d", &m);
for (int i = 1; i <= m; i++) scanf("%d", &b[i]);
sort(b + 1, b + m + 1);
for (int i = 1; i <= n; i++) {
if (~a[i]) {
int t = lower_bound(mn + 1, mn + n + 1, a[i]) - mn;
dp[i] = t;
pre[i] = ps[t - 1];
mn[t] = a[i];
ps[t] = i;
} else {
for (int j = m, k = n; j; j--) {
while (mn[k] >= b[j]) k--;
mn[k + 1] = b[j];
ps[k + 1] = i;
}
}
}
int x = n, val = a[n], is = 0, clen = dp[n] + 1;
while (clen--) {
if (!is) {
if (!~a[pre[x]]) {
is = 1;
for (int j = m; j; j--)
if (~b[j] && b[j] < a[x]) {
a[pre[x]] = b[j];
b[j] = -1;
break;
}
}
x = pre[x];
} else {
bool flg = 0;
for (int j = x - 1; ~j; j--)
if (~a[j] && a[j] < a[x] && dp[j] + 1 == clen) {
x = j;
is = 0;
flg = 1;
break;
}
if (!flg) {
int val = 0, pos = 0;
for (int j = 1; j <= m; j++)
if (~b[j] && b[j] < a[x]) val = b[j], pos = j;
b[pos] = -1;
is = 1;
for (int j = x - 1; j; j--)
if (!~a[j]) {
a[j] = val;
x = j;
break;
}
}
}
}
for (int i = 1; i <= n; i++)
if (!~a[i]) {
for (int j = 1; j <= m; j++)
if (~b[j]) {
a[i] = b[j], b[j] = -1;
break;
}
}
for (int i = 1; i < n; i++) printf("%d ", a[i]);
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long com(long long n, long long r) {
if (n - r < r) r = n - r;
long long i, j, s = 1;
for (i = 0, j = 1; i < r; ++i) {
s *= (n - i);
for (; j <= r && s % j == 0; ++j) s /= j;
}
return s;
}
int main() {
long long n, m, t, res = 0;
cin >> n >> m >> t;
for (int i = 4; t - i >= 1; i++)
if (i > n || t - i > m)
continue;
else
res += com(n, i) * com(m, (t - i));
cout << res << endl;
return 0;
}
| 9 | CPP |
l = []
for t in range(int(input())):
l.append(input())
print(len(set(l)))
| 7 | PYTHON3 |
import fractions
a, b, x, y = map(int, input().split())
d = fractions.gcd(x, y)
x //= d
y //= d
ans = min(a // x, b // y)
print(ans)
| 8 | PYTHON3 |
def fact(n):
if n==1:
return 1
else:
return n*fact(n-1)
a,b=map(int,input().split())
if a<=b:
ans=fact(a)
else:
ans=fact(b)
print(ans) | 7 | PYTHON3 |
import math
n = int(input())
s = list(map(int, input().split()))
eins, zwei, drei, vier, taxis = 0, 0, 0, 0, 0
for i in range(n):
if s[i] == 1:
eins += 1
elif s[i] == 2:
zwei += 1
elif s[i] == 3:
drei += 1
else:
vier += 1
taxis += vier
if drei > 0:
if eins > drei:
taxis += drei
eins -= drei
drei = 0
else:
taxis += drei
eins, drei = 0, 0
taxis += math.ceil((zwei * 2 + eins) / 4)
print(int(taxis))
| 8 | PYTHON3 |
n,m,a = map(int,input().split())
i = n // a + bool(n % a)
j = m // a + bool(m % a)
print(i * j) | 7 | PYTHON3 |
#include <iostream>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
if (a > b){
cout << a-b << endl;
}
else if(a < b){
cout << b-a << endl;
}
else if(a==b){
cout << a-b << endl;
}
}
| 0 | CPP |
#include <bits/stdc++.h>
int main() {
int n, i, j, k, tmp, count = 0;
int a[10001];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
a[n + 1] = 0;
for (i = 1; i <= n; i++) {
if (a[i] == i) {
tmp = a[1];
for (k = 1; k < i; k++) {
if (tmp < a[k + 1]) {
tmp = a[k + 1];
}
}
if (tmp <= a[i]) {
count++;
} else {
count = count;
}
}
}
printf("%d", count);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
long long t, n, m, ans;
int g[103][103];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> t;
while (t--) {
cin >> n >> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < m; j++) {
if (s[j] == 'D') g[i][j] = 1;
if (s[j] == 'R') g[i][j] = 2;
if (s[j] == 'C') g[i][j] = 3;
}
}
for (int i = 0; i < m - 1; i++) {
if (g[n - 1][i] == 1) ans++;
}
for (int i = 0; i < n - 1; i++) {
if (g[i][m - 1] == 2) ans++;
}
cout << ans << '\n';
ans = 0;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, C, degree[2000000];
int tot, t[2000000];
bool vis[2000000];
int read() {
int x = 0, k = 1;
char c;
c = getchar();
while (c < '0' || c > '9') {
if (c == '-') k = -1;
c = getchar();
}
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x * k;
}
struct edge {
int cnp, fr[2000000], to[2000000], col[2000000], head[2000000], last[2000000];
bool mark[2000000];
edge() { cnp = 2; }
void add(int u, int v) {
fr[cnp] = u, to[cnp] = v, last[cnp] = head[u], head[u] = cnp++;
fr[cnp] = v, to[cnp] = u, last[cnp] = head[v], head[v] = cnp++;
}
} E1;
void dfs(int u) {
vis[u] = 1;
for (int i = E1.head[u]; i; i = E1.head[u]) {
E1.head[u] = E1.last[i];
if (E1.mark[i]) continue;
int v = E1.to[i];
E1.mark[i] = E1.mark[i ^ 1] = 1;
dfs(v);
E1.col[i] = (C ^= 1);
}
}
int main() {
n = read(), m = read();
for (int i = 1; i <= m; i++) {
int u = read(), v = read();
E1.add(u, v);
degree[u]++, degree[v]++;
}
for (int i = 1; i <= n; i++)
if (degree[i] & 1) t[++tot] = i;
for (int i = 1; i <= tot; i += 2) E1.add(t[i], t[i + 1]);
m = m + (tot >> 1);
memset(E1.col, -1, sizeof(E1.col));
if (m & 1) m += 1, E1.add(1, 1);
for (int i = 1; i <= n; i++)
if (!vis[i]) dfs(i);
printf("%d\n", m);
for (int i = 1; i <= m; i++) {
int p = i * 2;
if (E1.col[p] == -1) p += 1;
if (E1.col[p])
printf("%d %d\n", E1.fr[p], E1.to[p]);
else
printf("%d %d\n", E1.to[p], E1.fr[p]);
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e4 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a.begin(), a.end());
ll ans = 0;
for (int i = 0; i < n; ++i) {
ans = (ans + a[i] * a[n - i - 1]) % MOD;
}
cout << ans << "\n";
}
| 9 | CPP |
t=int(input())
while(t):
n=int(input())
if(n>30):
print("YES")
if(n==36 or n==44 or n==40):
if(n==36):
print("5 6 10 15")
elif(n==44):
print("6 7 10 21")
elif(n==40):
print("6 10 21 3")
else:
print("6 10 14 %d"%(n-30))
else:
print("NO")
t-=1 | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void debug(T a, T b) {
;
}
template <class T>
void chmin(T& a, const T& b) {
if (a > b) a = b;
}
template <class T>
void chmax(T& a, const T& b) {
if (a < b) a = b;
}
namespace std {
template <class S, class T>
ostream& operator<<(ostream& out, const pair<S, T>& a) {
out << '(' << a.first << ',' << a.second << ')';
return out;
}
} // namespace std
long long int readL() {
long long int res;
scanf("%I64d", &res);
return res;
}
void printL(long long int res) { printf("%I64d", res); }
int n, N;
int ar[100005];
int cnt[100005];
int C;
bool check(int* ar, int k, int n) {
memset((cnt), 0, sizeof(cnt));
if (n & 1) {
int mid = n / 2;
if (k <= mid) {
for (int i = 1; mid - i >= k; ++i)
if (ar[mid - i] != ar[mid + i]) return false;
for (int i = 0; i < (k); ++i) {
cnt[ar[i]]++;
cnt[ar[n - 1 - i]]--;
}
for (int i = 0; i < (N); ++i)
if (cnt[i] != 0) return false;
return true;
} else {
for (int i = 0; i < (n); ++i) ++cnt[ar[i]];
int odd = -1;
for (int i = 0; i < (N); ++i)
if (cnt[i] & 1) {
if (odd == -1)
odd = i;
else
odd = -2;
}
if (odd < 0) return false;
--cnt[odd];
for (int i = (k); i < (n); ++i) cnt[ar[i]] -= 2;
for (int i = 0; i < (N); ++i)
if (cnt[i] < 0) return false;
return true;
}
} else {
int half = n / 2;
if (k <= half) {
for (int i = 0; half - i - 1 >= k; ++i)
if (ar[half - 1 - i] != ar[half + i]) return false;
for (int i = 0; i < (k); ++i) {
cnt[ar[i]]++;
cnt[ar[n - 1 - i]]--;
}
for (int i = 0; i < (N); ++i)
if (cnt[i] != 0) return false;
return true;
} else {
for (int i = 0; i < (n); ++i) ++cnt[ar[i]];
for (int i = 0; i < (N); ++i)
if (cnt[i] & 1) return false;
for (int i = (k); i < (n); ++i) cnt[ar[i]] -= 2;
for (int i = 0; i < (N); ++i)
if (cnt[i] < 0) return false;
return true;
}
}
}
long long int solve(int* ar, int n) {
int lb = 0, ub = n;
while (ub - lb > 1) {
int md = (lb + ub) >> 1;
if (check(ar, md, n))
ub = md;
else
lb = md;
}
return n - ub;
}
int main() {
cin >> n;
N = n;
for (int i = 0; i < (n); ++i) scanf("%d", &ar[i]), --ar[i];
while (C < n && ar[C] == ar[n - 1 - C]) ++C;
long long int res = 0;
;
;
if (C == n)
res = n * (long long int)(n + 1) / 2;
else {
if (!check(ar + C, n - C * 2, n - C * 2))
;
else {
res += (C + 1) * (long long int)(C + 1);
res += solve(ar + C, n - C * 2) * (long long int)(C + 1);
reverse(ar + C, ar + n - C);
res += solve(ar + C, n - C * 2) * (long long int)(C + 1);
}
}
cout << res << endl;
return 0;
}
| 9 | CPP |
n,k=map(int,input().split())
li=list(map(int,input().split()))
num=[]
ans=[]
for i in range(n):
if li[i] not in num:
ans.append(i+1)
num.append(li[i])
if(len(ans)>=k):
print("YES")
for i in range(k):
print(ans[i],end=" ")
else:
print("NO") | 7 | PYTHON3 |
a, b = map(int, input().split())
print(-(-a//b)-a//b) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
vector<char> v1;
int n1 = s1.length();
int n2 = s2.length();
int n3 = s3.length();
vector<char> v2;
for (int i = 0; i < n1; i++) {
v1.push_back(s1[i]);
}
for (int i = 0; i < n2; i++) {
v1.push_back(s2[i]);
}
for (int i = 0; i < n3; i++) {
v2.push_back(s3[i]);
}
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
n1 = v1.size();
n2 = v2.size();
if (n1 != n2) {
cout << "NO" << endl;
return 0;
}
for (int i = 0; i < n1; i++) {
if (v1[i] != v2[i]) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| 7 | CPP |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
void dfs(vector<string>& m,int i,int j,int w,int h,bool isb){
int di[]={1,0,-1,0};
int dj[]={0,1,0,-1};
for(int k=0;k<4;++k){
int ni=i+di[k];
int nj=j+dj[k];
if(ni<0||ni>=h||nj<0||nj>=w)continue;
if(m[ni][nj] == '.'){
if(isb){
m[ni][nj] = 'b';
}else{
m[ni][nj] = 'w';
}
dfs(m,ni,nj,w,h,isb);
}else if(isb && m[ni][nj] == 'w'){
m[ni][nj] = '*';
dfs(m,ni,nj,w,h,isb);
}else if(!isb && m[ni][nj] == 'b'){
m[ni][nj] = '*';
dfs(m,ni,nj,w,h,isb);
}
}
}
int main() {
while(1){
int w,h;
cin>>w>>h;
if(w==0)break;
vector<string> m(h);
for(int i=0;i<h;++i)
cin>>m[i];
for(int i=0;i<h;++i)
for(int j=0;j<w;++j)
if(m[i][j]=='W' || m[i][j]=='B')
dfs(m,i,j,w,h,m[i][j]=='B');
int bn=0,wn=0;
for(int i=0;i<h;++i)
for(int j=0;j<w;++j){
if(m[i][j]=='b')
++bn;
else if(m[i][j]=='w')
++wn;
}
cout<<bn<<' '<<wn<<endl;
}
return 0;
} | 0 | CPP |
def arr(A,k):
n=len(A)
pre=[0]*n
l=0
r=0
while r<n:
if abs(A[r]-A[l])<=k:
r+=1
else:
while l<r and abs(A[r]-A[l])>k:
l+=1
r+=1
pre[r-1]=r-l
return pre
def answer(n,k,A):
if n==1:
return 1
A.sort()
pre=arr(A,k)
suff=arr(A[::-1],k)
suff=suff[::-1]
maxip=[0]*n
maxi=0
maxis=[0]*n
for i in range(n):
maxi=max(maxi,pre[i])
maxip[i]=maxi
maxi=0
for i in range(n-1,-1,-1):
maxi=max(maxi,suff[i])
maxis[i]=maxi
maxi=0
for i in range(n-1):
maxi=max(maxi,maxip[i]+maxis[i+1])
return maxi
t=int(input())
for i in range(t):
n,k=map(int,input().split())
arr1=list(map(int,input().split()))
arr2=list(map(int,input().split()))
print(answer(n,k,arr1)) | 11 | PYTHON3 |
from sys import stdin
input=stdin.readline
n=int(input())
a=list(map(int,input().split()))
input()
t=[True]*n
x=0
for inn in stdin.readlines()[::-1]:
l=list(map(int,inn.split()))
i=l[1]-1
if len(l)==3 and t[i]:
a[i]=max(l[2],x)
t[i]=False
elif len(l)==2:
x=max(x,l[1])
for i in range(n):
if t[i]:
a[i]=max(a[i],x)
print(*a) | 8 | PYTHON3 |
s = int(input())
for i in range(s):
t = input()
f = 0
while t.find("01") >= 0 or t.find("10") >= 0:
if ((t.find("01") < t.find("10")) and (t.find("01") != -1)) or t.find("10") == -1:
t = t[:t.find("01")] + t[t.find("01")+2:]
f += 1
elif ((t.find("10") < t.find("01")) and (t.find("10") != -1)) or t.find("01") == -1:
t = t[:t.find("10")] + t[t.find("10")+2:]
f += 1
if f % 2 == 1:
print("DA")
else:
print("NET") | 8 | PYTHON3 |
#include <bits/stdc++.h>
struct op {
int u, v;
long double c;
};
using namespace std;
const int M = 200005, N = 305;
const long double pi = 3.1415926535;
int i, j, n, k, a[N][2], so, bc, l, r, mid, ot;
long long f[N][N][6], ans;
int bh[N][N];
op lk[M];
long double ch;
int read() {
int ef = 1, x = 0;
char s = getchar();
while ((s < '0') || (s > '9')) {
if (s == '-') ef = -1;
s = getchar();
}
while ((s >= '0') && (s <= '9')) x = x * 10 + (s - '0'), s = getchar();
return ef * x;
}
void swap(int x, int y) {
lk[0].u = lk[x].u;
lk[x].u = lk[y].u;
lk[y].u = lk[0].u;
lk[0].v = lk[x].v;
lk[x].v = lk[y].v;
lk[y].v = lk[0].v;
lk[0].c = lk[x].c;
lk[x].c = lk[y].c;
lk[y].c = lk[0].c;
}
void kp(int l, int r) {
int x = l, y = r;
long double mid = lk[(x + y) / 2].c;
while (x <= y) {
while (mid > lk[x].c) x++;
while (lk[y].c > mid) y--;
if (x <= y) {
swap(x, y);
x++;
y--;
}
}
if (l < y) kp(l, y);
if (x < r) kp(x, r);
}
long double js(int x, int y) {
return atan2(a[y][1] - a[x][1], a[y][0] - a[x][0]) / pi * 180;
}
int main() {
n = read();
for (i = 1; i <= n; i++) {
a[i][0] = read(), a[i][1] = read();
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (i != j) {
so++;
lk[so].u = i;
lk[so].v = j;
lk[so].c = js(i, j);
atan2(a[j][1] - a[i][1], a[j][0] - a[i][0]);
bh[i][j] = so;
}
}
}
kp(1, so);
for (i = 1; i <= so; i++) {
f[lk[i].u][lk[i].v][1] = 1;
for (k = 1; k <= 4; k++) {
for (j = 1; j <= n; j++) {
f[j][lk[i].v][k + 1] += f[j][lk[i].u][k];
}
}
}
for (i = 1; i <= n; i++) {
ans += f[i][i][5];
}
printf("%lld\n", ans);
fclose(stdin);
fclose(stdout);
}
| 14 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool prime(int n) {
if (n == 2) return true;
if (n % 2 == 0) return false;
for (int i = 3; i * i <= n; i += 2) {
if (n % i == 0) return false;
}
return true;
}
int n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin >> n;
for (int i = 1; i <= 1000; i++) {
if (!prime(n * i + 1)) {
cout << i << endl;
return 0;
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
char arr[1000000 + 10];
int del[10000000 + 10];
int main() {
int i = 0;
int c = 0;
int counter = 0;
for (i = 0; i == 0 || arr[i - 1] != '\n'; i++) {
scanf("%c", &arr[i]);
if (arr[i] == 'F') counter++;
}
int temp = i;
i = 0;
int lastF = -1;
int place = 0;
for (c = 0; c < temp; c++) {
if (arr[c] == 'F' && place == c) {
place++;
del[c] = 0;
lastF = c;
} else if (arr[c] == 'F' && arr[c - 1] == 'M') {
if (lastF == -1) {
del[c] = 0;
lastF = c;
i = c - place;
place++;
} else {
if (del[lastF] != 0 && del[lastF] >= (c - lastF - 1)) {
del[c] = del[lastF] - (c - lastF - 1) + 1;
i = c - place;
i += del[lastF] - (c - lastF - 1) + 1;
} else
i = c - place;
lastF = c;
place++;
}
} else if (arr[c] == 'F' && arr[c - 1] == 'F') {
del[c] = del[c - 1] + 1;
i = c - place;
i += del[c];
place++;
lastF = c;
}
}
printf("%d", i);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
long long x[2][maxn];
int main() {
long long n, i, j, k, ans = 0, s, s1;
cin >> n;
for (i = 0; i < n; i++) cin >> x[0][i] >> x[1][i];
for (j = 0; j < 2; j++) sort(x[j], x[j] + n);
for (j = 0; j < 2; j++) {
s = 0;
s1 = 0;
for (i = 0; i < n; i++) {
s += x[j][i] * x[j][i];
s1 += x[j][i];
}
ans += s * (n - 1);
s1 *= s1;
s1 -= s;
ans -= s1;
}
cout << ans;
}
| 11 | CPP |
print(((2 * int(input()) + 1) ** 2 - 1) // 8 - sum(map(int, input().split())))
| 7 | PYTHON3 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pi;
typedef pair<pi, int> pii;
typedef pair<ll,ll> pl;
typedef pair<db,db> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
template<class T> using V = vector<T>;
template<class T, size_t SZ> using AR = array<T,SZ>;
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define For(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define Rof(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
template<class T> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; }
constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x))
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }
template<class T, class U> T fstTrue(T lo, T hi, U f) {
// note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi
hi ++; assert(lo <= hi); // assuming f is increasing
while (lo < hi) { // find first index such that f is true
T mid = half(lo+hi);
f(mid) ? hi = mid : lo = mid+1;
}
return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
lo --; assert(lo <= hi); // assuming f is decreasing
while (lo < hi) { // find first index such that f is true
T mid = half(lo+hi+1);
f(mid) ? lo = mid : hi = mid-1;
}
return lo;
}
template<class T> void remDup(vector<T>& v) {
sort(all(v)); v.erase(unique(all(v)),end(v)); }
// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) {
#ifdef LOCAL
return b ? "true" : "false";
#else
return ts((int)b);
#endif
}
template<class A> str ts(complex<A> c) {
stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
str res = ""; F0R(i,SZ) res += char('0'+b[i]);
return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
#ifdef LOCAL
bool fst = 1; str res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += ts(x);
}
res += "}"; return res;
#else
bool fst = 1; str res = "";
for (const auto& x: v) {
if (!fst) res += " ";
fst = 0; res += ts(x);
}
return res;
#endif
}
template<class A, class B> str ts(pair<A,B> p) {
#ifdef LOCAL
return "("+ts(p.f)+", "+ts(p.s)+")";
#else
return ts(p.f)+" "+ts(p.s);
#endif
}
// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) {
pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) {
pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << ts(h); if (sizeof...(t)) cerr << ", ";
DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
<< __FUNCTION__ << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
#define dbg(...) 0
#define chk(...) 0
#endif
int gcd(int a, int b) {if (b == 0)return a;return gcd(b, a % b);}
int max(int a,int b, int c){return max(a,max(b,c));}
int min(int a,int b, int c){return min(a,min(b,c));}
ll max(ll a,ll b, ll c){return max(a,max(b,c));}
ll min(ll a,ll b, ll c){return min(a,min(b,c));}
void dbga(int arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}
void dbga(ll arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}
// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
unsyncIO();
// cin.exceptions(cin.failbit);
// throws exception when do smth illegal
// ex. try to read letter into int
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
// 576743 29995400689069LL
const int MOD = 1e9+7; // 998244353;
const int MX = 3e5+5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
/*
close had to look at editorial
dp[i][j]=min number of removes so far last used is i and cannot use any from i to j
note the cumulative cnt++ bkwards to store number need to del
and the ckmin(dp[i][j],dp[i][j-1]) bc dp[i][j] should be lower
that way i can do dp[j][i-1] since i-1 covers dp[j][(j,i-1)] range
*/
void solve(){
int n;re(n);
int a[n], dp[n+1][n+1];
For(i,n)re(a[i]);
For(i,n)FOR(j,i,n)dp[i][j]=MOD;
For(i,n)dp[0][i]=0;
FOR(i,1,n){
int cnt=0;
Rof(j,i)
if(j+a[j]>=i)
ckmin(dp[i][j+a[j]],dp[j][i-1] + cnt++);
FOR(j,i+1,n)
ckmin(dp[i][j],dp[i][j-1]);
}
ps(dp[n-1][n-1]);
}
int main() {
setIO();
int t=1;
re(t);
while(t--)solve();
// you should actually read the stuff at the bottom
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/ | 12 | CPP |
import sys
def input():
return sys.stdin.readline().strip()
def iinput():
return int(input())
def tinput():
return input().split()
def rinput():
return map(int, tinput())
def rlinput():
return list(rinput())
mod = int(1e9)+7
n=iinput()
a=rlinput()
m=iinput()
b=rlinput()
a.sort()
b.sort()
i=n-1
j=m-1
ans=0
while i>=0 and j>=0:
if abs(a[i]-b[j])<=1:
ans+=1
i-=1
j-=1
else:
if a[i]>=b[j]:i-=1
else:j-=1
print(ans) | 8 | PYTHON3 |
n=int(input())
s=input()
t=input()
if(n==1):
one=["ab","bc"]
two=["ac","cb"]
three=["ba","ac"]
four=["bc","ca"]
five=["ca","ab"]
six=["cb","ba"]
main=[one,two,three,four,five,six]
ans=0
for i in range(0,6):
temp=1
for j in range(0,2):
if(main[i][j]==s or main[i][j]==t):
temp=0
break
if(temp==1):
print("YES")
if(i==0):
print("abc"*n)
elif(i==1):
print("acb"*n)
elif(i==2):
print("bac"*n)
elif(i==3):
print("bca"*n)
elif(i==4):
print("cab"*n)
else:
print("cba"*n)
ans=1
break
else:
one=["ab","bc","ca"]
two=["ac","cb","ba"]
three=["ba","ac","cb"]
four=["bc","ca","ab"]
five=["ca","ab","bc"]
six=["cb","ba","ac"]
main=[one,two,three,four,five,six]
ans=0
for i in range(0,6):
temp=1
for j in range(0,3):
if(main[i][j]==s or main[i][j]==t):
temp=0
break
if(temp==1):
print("YES")
if(i==0):
print("abc"*n)
elif(i==1):
print("acb"*n)
elif(i==2):
print("bac"*n)
elif(i==3):
print("bca"*n)
elif(i==4):
print("cab"*n)
else:
print("cba"*n)
ans=1
break
if(ans==0):
print("YES")
if(set(s)==set(t)):
if("a"!=s[0] and "a"!=s[1]):
print("b"*n+"a"*n+"c"*n)
elif("b"!=s[0] and "b"!=s[1]):
print("a"*n+"b"*n+"c"*n)
else:
print("a"*n+"c"*n+"b"*n)
elif(s[1]=="a" and t[1]=="a"):
print("a"*n+"b"*n+"c"*n)
elif(s[1]=="b" and t[1]=="b"):
print("b"*n+"a"*n+"c"*n)
elif(s[1]=="c" and t[1]=="c"):
print("c"*n+"b"*n+"a"*n)
elif(s[0]=="a"):
print("b"*n+"c"*n+"a"*n)
elif(s[0]=="b"):
print("a"*n+"c"*n+"b"*n)
else:
print("b"*n+"a"*n+"c"*n)
| 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> S;
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
++S[x];
}
if (N % 2) {
cout << "NO";
return 0;
}
while (S.size() > 0) {
int x = S.begin()->first;
if (S[x] == 0) {
S.erase(x);
continue;
}
if (S[x + 1] < 2 - (N == 2)) {
cout << "NO";
return 0;
}
--S[x];
--S[x + 1];
N -= 2;
}
cout << "YES";
}
| 10 | CPP |
def main():
l, p, q = int(input()), int(input()), int(input())
print(l * p / (p + q))
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
int S[100][100];
for(int i=0; i<H; i++){
string s;
cin >> s;
for(int j=0; j<W; j++) S[i][j] = (s[j] == '#' ? -1 : s[j]-'0');
}
auto inside = [&](int i, int j){ return i>=0 && i<H && j>=0 && j<W && S[i][j] != -1; };
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
auto bottom = [](int i, int j){
if(i%4 == 0){
vector<int> v = {6, 3, 1, 4};
return v[j%4];
}
if(i%4 == 2){
vector<int> v = {1, 3, 6, 4};
return v[j%4];
}
if(j%4 == 0){
vector<int> v = {6, 2, 1, 5};
return v[i%4];
}
if(j%4 == 2){
vector<int> v = {1, 2, 6, 5};
return v[i%4];
}
exit(-1);
};
bool exist[100][100] = {0};
exist[0][0] = 1;
queue<vector<int>> que;
que.push({0, 0});
while(que.size()){
auto v = que.front(); que.pop();
int i = v[0], j = v[1];
for(int k=0; k<4; k++){
int x = i+dx[k], y = j+dy[k];
if(!inside(x, y)) continue;
if(exist[x][y]) continue;
if(S[x][y] == bottom(x, y)){
exist[x][y] = 1;
que.push({x, y});
}
}
}
cout << (exist[H-1][W-1] ? "YES" : "NO") << endl;
return 0;
}
| 0 | CPP |
import math
l=list(map(int,input().split()))
a=math.ceil(l[0]/l[2])*math.ceil(l[1]/l[2])
print(a) | 7 | PYTHON3 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
return (ll)min(2e18l + 10, a / gcd(a, b) *1.0l* b);
}
ll a[20];
double p[20];
double dp[1 << 20];
int main() {
int n;
ll m;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
cin >> p[i];
p[i] /= 100;
}
for (int bit = 1; bit < (1 << n); bit++) {
ll mul = 1;
for (int i = 0; i < n; i++) if (bit&(1 << i)) mul = lcm(mul, a[i]);
dp[bit] = m / mul;
}
for (int i = 0; i < n; i++) for (int bit = 0; bit < (1 << n); bit++) {
if (bit&(1 << i)) dp[bit] -= dp[bit ^ (1 << i)];
}
double ans = 0;
for (int bit = 0; bit < (1 << n); bit++) {
double prob = 1.0;
for (int i = 0; i < n; i++) if (bit&(1 << i)) prob *= p[i]; else prob *= 1 - p[i];
ans += prob * abs(dp[bit]);
}
printf("%.15lf\n", ans);
}
| 0 | CPP |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <fstream>
using namespace std;
typedef long long ll;
int dy[201];
int dx[201];
ll dp[1010][1<<12];
char field[101][101];
int dmg[201];
int stepDmg[2001];
int portions[101];
int inithp;
int maxhp;
int r,c;
int step;
int S,P,T;
const ll INF=100000000000000LL;
//// S[©çßÄX^[gÖü©¤
//ll dfs(int pos,int s){
// if(pos==-1){
// ll sum=0;
// // ܾgpµÄ¢È¢àÌð·×Äg¤
// for(int i=0;i<P;i++)if(!((s>>i)&1))sum+=portions[i];
// return min(maxhp*1LL,sum+inithp);
// }
// else if(dp[pos][s]!=-1)return dp[pos][s];
// ll res=-INF;
// // ܾgpµÄ¢È¢portionðgp
// for(int k=0;k<P;k++)
// if(!((s>>k)&1))if(dfs(pos,s|(1<<k))>0)res=max(res,min(dfs(pos,s|(1<<k))+portions[k],maxhp*1LL));
// // ÌêÖ
// res=max(res,dfs(pos-1,s)-stepDmg[pos]);
// if(res<0)res=-INF;
// return dp[pos][s]=res;
//}
void input(){
cin>>r>>c;
for(int i=0;i<r;i++)for(int j=0;j<c;j++)cin>>field[i][j];
cin>>T;
for(int i=0;i<T;i++){
char ch;
int m;
cin>>ch>>m;
dmg[ch]=m;
}
cin>>S;
int cx=0;
int cy=0;
for(int i=0;i<S;i++){
char ch;
int quan;
cin>>ch>>quan;
for(int j=0;j<quan;j++){
int ny=cy+dy[ch];
int nx=cx+dx[ch];
stepDmg[step]=dmg[field[ny][nx]];
step++;
cx=nx;
cy=ny;
}
}
cin>>P;
for(int i=0;i<P;i++)cin>>portions[i];
}
int main(){
dy['U']=-1;
dx['U']=0;
dy['R']=0;
dx['R']=1;
dy['D']=1;
dx['D']=0;
dy['L']=0;
dx['L']=-1;
while(cin>>inithp>>maxhp&&(inithp|maxhp)){
step=0;
input();
//memset(dp,-1,sizeof(dp));
//for(int i=0;i<1010;i++)for(int j=0;j<(1<<12);j++)dp[i][j]=-1;
//if(dfs(step-1,0)>0)cout<<"YES"<<endl;
//else cout<<"NO"<<endl;
// startn_ÅÍ,cÁ½¨ð·×Äg¤
for(int j=0;j<(1<<P);j++){
ll sum=0;
for(int i=0;i<P;i++)if(!((j>>i)&1))sum+=portions[i];
dp[0][j]=min(1LL*maxhp,sum+inithp);
}
for(int i=0;i<step;i++){
for(int j=(1<<P)-1;j>=0;j--){
ll res=-INF;
int s=j;
int pos=i;
// ܾgpµÄ¢È¢portionðgp
for(int k=0;k<P;k++)
if(!((s>>k)&1)&&dp[pos+1][s|(1<<k)]>0){
res=max(res,min(dp[pos+1][s|(1<<k)]+portions[k],maxhp*1LL));
}
// ÌêÖ
res=max(res*1LL,dp[pos][s]-stepDmg[pos]);
if(res<0)res=-INF;
dp[pos+1][s]=min(maxhp*1LL,res);
}
}
bool ok=false;
for(int j=0;j<(1<<P);j++)if(dp[step][j]>0)ok=true;
if(ok)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c; cin >> a >> b >> c;
cout << min({a+b,b+c,c+a});
} | 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define inf 100000000000
#define mod 1000000007
double power(double x,ll n)
{
if(n==0)
return 1;
else if(n%2 == 0) //n is even
return power((x*x),n/2);
else //n is odd
return (x*power((x*x),(n-1)/2));
}
ll C(ll n, ll r) {
if(r > n - r) r = n - r; // because C(n, r) == C(n, n - r)
long long ans = 1;
int i;
for(i = 1; i <= r; i++) {
ans =((ans) * (n - r + i));
ans =(ans)/i;
}
return ans;
}
ll modularExponentiation(ll x,ll n,ll M)
{
if(n==0)
return 1;
else if(n%2 == 0) //n is even
return modularExponentiation((x*x)%M,n/2,M);
else //n is odd
return (x%M*modularExponentiation((x*x)%M,(n-1)/2,M)%M)%M;
}
ll modInverse(ll A,ll M)
{
return modularExponentiation(A,M-2,M);
}
void solve()
{
ll n,i,temp,temp1,diff;
map<ll,ll> m1;
queue<ll> q1;
cin>>n;
for(i=0;i<n;i++)
{
cin>>temp;
m1[temp]++;
q1.push(temp);
}
while(q1.size()!=0)
{
temp=q1.front();
q1.pop();
for(auto x:m1)
{
temp1=x.first;
if(temp>temp1)
{
diff=temp-temp1;
if(m1[diff]==0)
{
m1[diff]=1;
q1.push(diff);
}
}
else if(temp<temp1)
{
diff=temp1-temp;
if(m1[diff]==0)
{
m1[diff]=1;
q1.push(diff);
}
}
if(m1.size()>300)
{
cout<<"NO"<<endl;
return ;
}
}
}
cout<<"YES"<<endl;
cout<<m1.size()<<endl;
for(auto x:m1)
cout<<x.first<<" ";
cout<<endl;
}
int main()
{
ll t;
cin>>t;
while(t--)
solve();
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long a, b, ans;
int main() {
cin >> a;
b = 9;
while (a > 0) {
ans = ans + a;
a = a - b;
b = b * 10;
}
cout << ans;
}
| 8 | CPP |
a,t,d=int(input()),0,1
for i in range(a):t+=d*(a-i)-i;d+=1
print(t) | 8 | PYTHON3 |
import sys
import math
n = int(sys.stdin.readline())
a = list(map(lambda x: int(x), sys.stdin.readline().split()))
a.sort(reverse=True)
max_odd = None
acc = 0
for i in range(n):
if(a[i] % 2 != 0):
if(max_odd is None):
max_odd = a[i]
else:
acc += max_odd + a[i]
max_odd = None
else:
acc += a[i]
print(acc)
| 7 | PYTHON3 |
//??：4s 空?：256MB
//?意:在一?无?深的二叉?上挂牌子,?定n个操作,表示在深度?di
//的子?点?挂牌子,如果符合到根的路径上只有1个牌子,那?就挂上去
//如果可以挂一定要挂,根?点深度?0
//算法:直接模?挂牌操作,??当前挂牌的情况,??当前允?挂牌上界
//和最深的位置,如果某个的位置出?了??牌子,通?移?可以将他?
//移?至同一?子?,然后将其向上?点,更新最深点
//?于最浅的点,可以将牌子按照深度,从左挂到右?,可以??如果
//当前最浅深度的一个子?点挂牌,那就将挂牌上界往下移?
//因?只有?外一个子?点可以挂牌子了,如果?外一个子?点的一个
//儿子又有牌子,那就??将上界下移?
//?个子?点都被挂牌,相当于自己被挂牌子
//如果根?点被挂上牌子,就直接No,如果在最浅位置上方,那也不能挂
//当然如果上界和最深?不相等,上界?个深度明?是不能挂牌的
//?于?目的数据,是不可能?下整个??数?的,所以?于明?可行的
//操作直接跳?就可以了(在根没有挂牌子的情况下)但是需要更新一下
//最深的深度
#include<cstdio>
#include<algorithm>
using namespace std;
int d[1000005];
int main(){
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
int n;
scanf("%d",&n);
int top=0,down=0;
while(n--){
int x;
scanf("%d",&x);
if(d[0]||x<top){printf("No\n");continue;}
if(x==top&&top!=down){printf("No\n");continue;}
if(x>=1000000){printf("Yes\n");down=max(down,x);continue;}
d[x]++;down=max(down,x);
while(d[x]>=2){
d[x-1]++;
d[x]=0;
if(x==down)down--;
x--;
}
for(int i=top+1;d[i]==1;i++)
top=i;
printf("Yes\n");
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long m, ans, ansn;
void dfs(long long m, int cur, long long sum) {
if (m <= 7) {
if (cur + m > ans || cur + m == ans && sum + m > ansn)
ans = cur + m, ansn = sum + m;
return;
}
long long x;
for (x = 1; x * x * x <= m; ++x)
;
--x;
dfs(m - x * x * x, cur + 1, sum + x * x * x);
dfs(x * x * x - (x - 1) * (x - 1) * (x - 1) - 1, cur + 1,
sum + (x - 1) * (x - 1) * (x - 1));
}
int main() {
scanf("%I64d", &m);
dfs(m, 0, 0ll);
printf("%I64d %I64d\n", ans, ansn);
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, a, b, t, n, ct = 0;
cin >> x >> y >> a >> b;
stringstream ss;
for (int i = a; i <= x; i++) {
for (int j = b; j < i && j <= y; j++) {
ss << i << " " << j << "\n";
ct++;
}
}
cout << ct << endl;
cout << ss.str();
return 0;
}
| 7 | CPP |
n,pos,l,r = map(int,input().split())
if l == 1 and r == n:
k = 0
else:
if l == 1:
k = abs(pos - r)+1
elif r == n:
k = abs(pos - l)+1
else:
k = min(abs(pos - l) , abs(pos - r))
k+= 2 + r - l
print(k) | 8 | PYTHON3 |
s=input()
print('YNEOS'[len(set(str(s.count('4')+s.count('7')))-set('47'))>0::2]) | 7 | PYTHON3 |
nbParticipants, nbFood = map(int, input().split())
food = [int(i) for i in input().split()]
food.sort()
nb = [0 for i in range(100)]
for i in food:
nb[i-1] += 1
for nbJours in range(1, 101):
if sum([nb[i]//nbJours for i in range(100)]) < nbParticipants:
maximum = nbJours-1
break
maximum = nbJours
print(maximum) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, l, x, y;
int a[100005];
set<int> b;
int found1(int k) {
for (int i = 1; i <= n; i++)
if (b.count(a[i] - k)) return 1;
return 0;
}
int found2() {
for (int i = 1; i <= n; i++) {
if (a[i] + x <= l && (b.count(a[i] + x + y) || b.count(a[i] + x - y)))
return a[i] + x;
if (a[i] - x >= 0 && (b.count(a[i] - x + y) || b.count(a[i] - x - y)))
return a[i] - x;
}
return -1;
}
int main() {
cin >> n >> l >> x >> y;
for (int i = 1; i <= n; i++) {
cin >> a[i];
b.insert(a[i]);
}
int a1 = 0;
int a2 = 0;
a1 = found1(x);
a2 = found1(y);
if (a1 && a2)
cout << "0" << endl;
else if (a1 && !a2)
cout << "1" << endl << y << endl;
else if (!a1 && a2)
cout << "1" << endl << x << endl;
else {
int te = found2();
if (te == -1)
cout << "2" << endl << x << ' ' << y << endl;
else
cout << "1" << endl << te << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void _R(T &x) {
cin >> x;
}
void _R(int &x) { scanf("%d", &x); }
void _R(long long &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U>
void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T>
void _W(const T &x) {
cout << x;
}
void _W(const int &x) { printf("%d", x); }
void _W(const long long &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U>
void _W(const pair<T, U> &x) {
_W(x.first);
putchar(' ');
_W(x.second);
}
template <class T>
void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin()) putchar(' ');
}
void W() {}
template <class T, class... U>
void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
int MOD = 1e9 + 7;
void ADD(long long &x, long long v) {
x = (x + v) % MOD;
if (x < 0) x += MOD;
}
const int SIZE = 1e6 + 10;
vector<pair<int, int> > AA;
struct BIT {
int _n;
pair<long long, long long> _d[SIZE];
void update(pair<long long, long long> &x, pair<long long, long long> v) {
if (x.first > v.first)
x = v;
else if (x.first == v.first)
ADD(x.second, v.second);
}
void init(int __n) {
_n = __n;
for (int i = (1); i <= (_n); ++i) _d[i] = {MOD, 0};
}
void ins(int x, pair<long long, long long> v) {
for (; x <= _n; x += x & -x) {
update(_d[x], v);
}
}
pair<long long, long long> qq(int x) {
pair<long long, long long> res = {MOD, 0};
for (; x; x -= x & -x) {
update(res, _d[x]);
}
return res;
}
} bit;
int main() {
int n;
R(n);
vector<int> d{-1, 0};
for (int i = 0; i < (n); ++i) {
int x, y;
R(x, y);
AA.push_back({y, x});
d.push_back(x);
d.push_back(y);
}
(sort(d.begin(), d.end()),
d.resize(distance(d.begin(), unique(d.begin(), d.end()))));
sort((AA).begin(), (AA).end());
pair<long long, long long> an = {MOD, 0};
bit.init(((int)(d).size()));
bit.ins(1, {0, 1});
for (int i = 0; i < (((int)(AA).size())); ++i) {
int x = (lower_bound(d.begin(), d.end(), AA[i].first) - d.begin());
int y = (lower_bound(d.begin(), d.end(), AA[i].second) - d.begin());
pair<long long, long long> ret = bit.qq(x);
if (AA[i].second > AA.back().first)
bit.update(an, make_pair(ret.first + AA[i].first, ret.second));
else {
bit.ins(y, make_pair(AA[i].first + ret.first - AA[i].second, ret.second));
}
}
W(an.second);
return 0;
}
| 11 | CPP |
# from functools import lru_cache
from sys import stdin, stdout
import sys
from math import *
# from collections import deque
# sys.setrecursionlimit(3*int(1e5))
# input = stdin.buffer.readline
# print = stdout.write
# @lru_cache()
for __ in range(int(input())):
n,m=map(int,input().split())
if(m<n):
print((m*(m+1))//2)
else:
print((n*(n-1))//2 + 1) | 8 | PYTHON3 |
n=int(input())
a=[]
for i in range(n):
a.append(list(map(int,input().split())))
for i in range(n):
for j in range(n):
c=0
if a[i][j]==1:
continue
for k in range(n):
for l in range(n):
if a[i][j]==a[i][k]+a[l][j]:
c=1
break
if c:
break
if not c:
print('No')
exit(0)
print('Yes')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
const long long INF = (long long)1e18 + 123;
const int inf = (int)2e9 + 123;
const int mod = 1e9 + 7;
using namespace std;
int n, T;
pair<int, long long> a[200011];
int ans = 0;
multiset<pair<long long, int> > s;
bool check(int k) {
s.clear();
for (int i = 1; i <= n; i++) {
if (a[i].first >= k) {
s.insert(make_pair(a[i].second, a[i].first));
}
}
if ((int)s.size() < k) return 0;
long long sum = 0;
while (k--) {
pair<long long, int> x = *s.begin();
sum += x.first;
s.erase(s.find(x));
}
return sum <= T;
}
void out(int k) {
s.clear();
for (int i = 1; i <= n; i++) {
if (a[i].first >= k) {
s.insert(make_pair(a[i].second, i));
}
}
while (k--) {
pair<long long, int> x = *s.begin();
cout << x.second << " ";
s.erase(s.find(x));
}
}
int main() {
unsigned int FOR;
asm("rdtsc" : "=A"(FOR));
srand(FOR);
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> T;
for (int i = 1; i <= n; i++) {
cin >> a[i].first >> a[i].second;
}
int l = 1, r = n;
while (l <= r) {
int tm = (l + r) / 2;
if (check(tm)) {
ans = max(ans, tm);
l = tm + 1;
} else
r = tm - 1;
}
cout << ans << endl << ans << endl;
out(ans);
return 0;
}
| 10 | CPP |
"""
Author: Q.E.D
Time: 2020-04-12 10:37:49
"""
T = int(input())
for _ in range(T):
n = int(input())
a = list(map(int, input().split()))
a = sorted(a)
i = n // 2
d = 0
sgn = 1
cnt = 0
ans = []
while cnt < n:
# print(i)
ans.append(a[i])
cnt += 1
d = (abs(d) + 1)
sgn *= -1
i += (sgn * d)
diff = ans[1] - ans[0]
# b = []
# for i in range(1, n):
# assert abs(ans[i] - ans[i - 1]) >= diff
# diff = abs(ans[i] - ans[i - 1])
# b.append(diff)
# print(b)
print(' '.join(map(str, ans)))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int y[maxn];
int main() {
int n,m,k;
scanf("%d%d%d",&n,&m,&k);
memset(y, 127, sizeof(y));
for(int i=0;i<k;i++)
{
int tx, ty;
scanf("%d%d",&tx,&ty);
y[tx]=min(y[tx], ty);
}
int ans=n;
int now=1;
for(int i=2;i<=n;i++)
{
if(y[i]<=now){
ans=i-1;break;
}
else if(y[i]==now+1){
continue;
}
else{
now++;
}
}
printf("%d\n",ans);
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long tc;
void solve() {
long long n, x, a[100005];
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
x = 1;
while (x <= n && a[x] == 1) x++;
if (x > n) x--;
if (x & 1)
cout << "First" << endl;
else
cout << "Second" << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
cin >> tc;
while (tc--) solve();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
int i, flag = 2;
for (i = 0; i < n; i++) {
cin >> v[i];
if (v[i] != 1) {
flag = 1;
}
}
int l = v.size();
if (flag == 2) {
v.pop_back();
}
v.push_back(flag);
sort(v.begin(), v.end());
for (i = 0; i < l; i++) {
cout << v[i] << " ";
}
cout << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
void pairsort(long long a[], long long b[], long long n) {
pair<long long, long long> pairt[n];
for (long long i = 0; i < n; i++) {
pairt[i].first = a[i];
pairt[i].second = b[i];
}
sort(pairt, pairt + n);
for (long long i = 0; i < n; i++) {
a[i] = pairt[i].first;
b[i] = pairt[i].second;
}
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long isPrime(long long n) {
if (n < 2) return 0;
if (n < 4) return 1;
if (n % 2 == 0 or n % 3 == 0) return 0;
for (long long i = 5; i * i <= n; i += 6)
if (n % i == 0 or n % (i + 2) == 0) return 0;
return 1;
}
long long C(long long n, long long r) {
if (r > n - r) r = n - r;
long long ans = 1;
for (long long i = 1; i <= r; i++) {
ans *= n - r + i;
ans /= i;
}
return ans;
}
long long mod = 1e9 + 7;
long long modexpo(long long x, long long p) {
long long res = 1;
x = x % mod;
while (p) {
if (p % 2) res = res * x;
p >>= 1;
x = x * x % mod;
res %= mod;
}
return res;
}
long long n, p, q, a[100005], k1, k2, ff, ss;
vector<long long> v[100005];
set<pair<long long, long long>> s;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n;
for (long long i = 1; i < n; i++) {
cin >> p >> q;
v[p].push_back(q), v[q].push_back(p);
}
for (long long i = 1; i <= n; i++) cin >> a[i];
for (long long i = 1; i <= n; i++)
for (long long j = 0; j < v[i].size(); j++)
if (a[i] != a[v[i][j]])
s.insert(make_pair((i < v[i][j] ? i : v[i][j]),
(i > v[i][j] ? i : v[i][j])));
auto it = s.begin();
pair<long long, long long> pp = *it;
ff = pp.first, ss = pp.second;
for (auto it = s.begin(); it != s.end(); it++) {
pair<long long, long long> pq = *it;
if (ff != pq.first && ff != pq.second) k1 = 1;
if (ss != pq.first && ss != pq.second) k2 = 1;
}
if (!k1) {
cout << "YES"
<< "\n"
<< (ff > 1 ? ff : 1);
return 0;
}
if (!k2) {
cout << "YES"
<< "\n"
<< (ss > 1 ? ss : 1);
return 0;
}
cout << "NO";
return 0;
}
| 7 | CPP |
#include <iostream>
using namespace std;
int main() {
int n;
string a, b;
cin >> n >> a >> b;
for (int i = 0; i < n; ++i) {
cout << a[i] << b[i];
}
} | 0 | CPP |
for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
i=n-2
incele=1
while i>=0:
if a[i]<=a[i+1]:
incele+=1
else:
break
i-=1
decele=1
i=n-2
while(i>=0):
if a[i]>=a[i+1]:
decele+=1
else:
break
i-=1
hillcnt=1
j=n-2
while j>=0:
if a[j]>=a[j+1]:
hillcnt+=1
else:
break
j-=1
while j>=0:
if a[j]<=a[j+1]:
hillcnt+=1
else:
break
j-=1
print(n-max(1,decele,incele,hillcnt))
| 9 | PYTHON3 |
#Bhargey Mehta (Junior)
#DA-IICT, Gandhinagar
import sys, math
MOD = 10**9+7
#sys.stdin = open('input.txt', 'r')
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
s = set()
for ai in a:
while ai%2 == 0:
s.add(ai)
ai = ai//2
print(len(s)) | 8 | PYTHON3 |
from bisect import bisect_right
N, A, B, *h = map(int, open(0).read().split())
h.sort()
d = A - B
ng = (h[-1] + (A - 1)) // A - 1
ok = (h[-1] + (B - 1)) // B
while ok - ng > 1:
m = (ok + ng) // 2
b = B * m
if m >= sum((h[i] - b + (d - 1)) // d for i in range(bisect_right(h, b), N)):
ok = m
else:
ng = m
print(ok)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 6e18;
const int N = 2e5 + 10;
int need, cost, bud, n, m;
int a[N][2];
int w[N], c[N];
long long solve() {
long long ans = inf;
for (int i = 0; i <= n; i++)
if (a[i][1] <= bud) {
int use = w[upper_bound(c + 1, c + m + 1, bud - a[i][1]) - c - 1];
ans = min(ans, 1LL * max(0, need - use) * a[i][0]);
}
return ans;
}
int main() {
scanf("%d%d%d%d%d", &need, &n, &m, a[0], &bud);
for (int i = 1; i <= n; i++) scanf("%d", a[i]);
for (int i = 1; i <= n; i++) scanf("%d", a[i] + 1);
for (int i = 1; i <= m; i++) scanf("%d", w + i);
for (int i = 1; i <= m; i++) scanf("%d", c + i);
printf("%lld", solve());
}
| 9 | CPP |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll solve(ll a1, ll a2, ll X, ll res = 0) {
if ((a1 ^ a2) == X) return res;
for (int i = 50; i > 0; --i) {
if ((a1 ^ a2 ^ X) & (1LL << i)) {
ll tmp1 = (a1 & ((1LL << i) - 1)) + 1;
ll tmp2 = (1LL << i) - (a2 & ((1LL << i) - 1));
ll rem = min(tmp1, tmp2);
if (a1 - rem <= 0) return -1;
return solve(a1 - rem, a2 + rem, X, res + rem);
}
}
return -1;
}
int main(void) {
int N; cin >> N;
ll A1, A2, xor_else = 0;
cin >> A1 >> A2;
for (int i = 2; i < N; ++i) {
ll Ai; cin >> Ai;
xor_else ^= Ai;
}
cout << solve(A1, A2, xor_else) << endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, m;
long long a[200];
long long b[200];
priority_queue<long long> pq;
long long cur;
int main() {
cin >> n >> m;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
cur += a[i];
}
for (long long i = 1; i <= m; i++) {
cin >> b[i];
cur -= a[b[i]];
pq.push(a[b[i]]);
}
while (pq.empty() == false) {
long long u = pq.top();
pq.pop();
if (u >= cur) {
cur += u;
} else {
cur += cur;
}
}
cout << cur << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
const int MAXM = 4e5 + 5;
struct Edge {
int to, nxt;
Edge() = default;
Edge(int a, int b) : to(a), nxt(b) {}
} e[MAXM];
int head[MAXN], edge_cnt = 1;
int n, k, dis[MAXN], rt, s, t, st[MAXN], top, f[MAXN], col[MAXN], vis[MAXN];
inline int read() {
int x = 0;
char ch = getchar();
while (!isdigit(ch)) ch = getchar();
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x;
}
inline void Max(int &x, int y) {
if (x < y) x = y;
}
inline void Min(int &x, int y) {
if (x > y) x = y;
}
inline void add_edge(int x, int y) {
e[++edge_cnt] = Edge{y, head[x]};
head[x] = edge_cnt;
}
inline int add(int x, int y) {
int z = x + y;
z >= k && (z -= k);
z < 0 && (z += k);
return z;
}
inline void Fail() { puts("No"), exit(0); }
void dfs1(int x, int fa) {
dis[x] = dis[fa] + 1;
if (dis[x] > dis[s]) s = x;
for (int i = head[x]; i; i = e[i].nxt)
if (e[i].to != fa) dfs1(e[i].to, x);
}
void dfs2(int x, int fa) {
dis[x] = dis[fa] + 1;
if (dis[x] > dis[t]) t = x;
for (int i = head[x]; i; i = e[i].nxt)
if (e[i].to != fa) dfs2(e[i].to, x);
}
void dfs_rt(int x, int fa) {
st[++top] = x;
if (x == t) rt = st[(top + 1) >> 1];
if (x == t)
for (int i = 1; i <= top; i++) vis[st[i]] = 1;
for (int i = head[x]; i; i = e[i].nxt)
if (e[i].to != fa) dfs_rt(e[i].to, x);
top--;
}
void dfs_check(int x, int fa) {
for (int i = head[x]; i; i = e[i].nxt) {
int y = e[i].to;
if (y == fa || !vis[y]) continue;
dfs_check(y, x);
f[x] ? Min(f[x], f[y] + 1), 1 : f[x] = f[y] + 1;
}
Max(f[x], 1);
for (int i = head[x]; i; i = e[i].nxt) {
int y = e[i].to;
if (y == fa) continue;
if (vis[y]) continue;
dfs_check(y, x);
if (f[y] + f[x] >= k) return Fail();
Max(f[x], f[y] + 1);
}
}
void dfs_print(int x, int fa, int opt) {
col[x] = add(col[fa], opt);
for (int i = head[x]; i; i = e[i].nxt)
if (e[i].to != fa) dfs_print(e[i].to, x, opt);
}
inline void Success() {
puts("Yes");
if (dis[t] & 1) {
int opt = 1;
for (int i = head[rt]; i; i = e[i].nxt)
dfs_print(e[i].to, rt, opt), vis[e[i].to] && (opt = -1);
} else {
for (int i = head[rt]; i; i = e[i].nxt)
if (f[e[i].to] < f[rt])
dfs_print(e[i].to, rt, 1);
else
dfs_print(e[i].to, rt, -1);
}
for (int i = 1; i <= n; i++) printf("%d%c", col[i] + 1, " \n"[i == n]);
exit(0);
}
int main() {
n = read(), k = read(), rt = 1;
for (int i = 2; i <= n; i++) {
int x = read(), y = read();
add_edge(x, y), add_edge(y, x);
}
if (k == 2) Success();
dfs1(1, 0), dfs2(s, 0);
dfs_rt(s, 0), dfs_check(rt, 0);
return Success(), 0;
}
| 14 | CPP |
t = input()
f = ''
if len(t) % 2 == 0:
for i in range(len(t)//2):
f += t[-i-1]
f += t[i]
else:
for i in range(len(t)//2):
f += t[i]
f += t[-i-1]
if len(t) % 2 == 1:
f += t[len(t) // 2]
print(''.join(list(map(str, list(reversed(f)))))) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
import math as m
def flist(k):
d=[1]
i=2
while i<=m.sqrt(k):
if k%i==0:
d.append(i)
i+=1
d.append(k)
return d
a.sort()
s=sum(a)
c=[]
for i in range(1,n):
f=flist(a[i])
for j in f:
b=(a[0]*j+(a[i]//j))
c.append(s-(a[0]+a[i])+b)
print(min(min(c),s)) | 8 | PYTHON3 |
n = int(input().split()[0])
s = [input() for i in [0]*n]
s.sort()
print("".join(s)) | 0 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
double a,b;
cin>>a>>b;
for(double i=1;i<=100000;i++)
{
int s=i*0.08;
int t=i*0.1;
if(s==a && t==b)
{
cout<<i;
return 0;
}
}
cout<<"-1";
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
char a[][100] = {
"Washington", "Adams", "Jefferson", "Madison", "Monroe",
"Adams", "Jackson", "Van Buren", "Harrison", "Tyler",
"Polk", "Taylor", "Fillmore", "Pierce", "Buchanan",
"Lincoln", "Johnson", "Grant", "Hayes", "Garfield",
"Arthur", "Cleveland", "Harrison", "Cleveland", "McKinley",
"Roosevelt", "Taft", "Wilson", "Harding", "Coolidge",
"Hoover", "Roosevelt", "Truman", "Eisenhower", "Kennedy",
"Johnson", "Nixon", "Ford", "Carter", "Reagan",
"Bush", "Clinton", "Bush", "Obama"};
int main() {
int t, i, j, k, n, m;
scanf("%d", &n);
if (n <= 40 && n >= 1) printf("%s\n", &a[n - 1][0]);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
void prepare() {}
const int MAXN = 100100;
void dfs1(int n, vector<int>* e, bool* was) {
if (was[n]) return;
was[n] = true;
for (int i = 0; i < (int)e[n].size(); i++) dfs1(e[n][i], e, was);
return;
}
void dfs2(int n, vector<int>* e, bool* was, bool* starts) {
if (was[n]) return;
was[n] = true;
if (starts[n]) return;
for (int i = 0; i < (int)e[n].size(); i++) dfs2(e[n][i], e, was, starts);
return;
}
vector<int> e1[MAXN];
vector<int> e2[MAXN];
bool use[MAXN];
bool start[MAXN];
bool was1[MAXN];
bool was2[MAXN];
bool solve() {
memset(use, 0, sizeof(use));
memset(start, 0, sizeof(start));
memset(was1, 0, sizeof(was1));
memset(was2, 0, sizeof(was2));
int n, m;
int i, k, x, y;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (x == 2) use[i] = true;
if (x == 1) start[i] = true;
}
for (i = 0; i < m; i++) {
scanf("%d%d", &x, &y);
x--;
y--;
e1[x].push_back(y);
e2[y].push_back(x);
}
for (i = 0; i < n; i++) {
if (start[i]) dfs1(i, e1, was1);
if (use[i]) dfs2(i, e2, was2, start);
}
for (i = 0; i < n; i++)
printf("%d%c", was1[i] && was2[i] ? 1 : 0, i + 1 == n ? '\n' : ' ');
return true;
}
int main() {
prepare();
solve();
return 0;
}
| 7 | CPP |
a = int(input())
print(('Yes','No')[a%2 or a<3]) | 7 | PYTHON3 |
from math import gcd
t = int(input())
for tt in range(0, t):
a, b = [int(x) for x in input().split()]
if a == 1 or b == 1:
print("Finite")
elif abs(a-b) == 0:
print("Infinite")
elif gcd(a, b) != 1:
print("Infinite")
else:
print("Finite") | 7 | PYTHON3 |
#include <bits/stdc++.h>
long long h, i, j, k, l, n, m, x;
long long d[10001], e[10001];
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> m;
vector<int> def, atk, v;
for (i = 1; i <= n; i++) {
string s;
cin >> s >> k;
if (s == "ATK")
atk.push_back(k);
else
def.push_back(k);
}
for (i = 1; i <= m; i++) cin >> k, v.push_back(k);
k = 0;
while (true) {
sort(v.begin(), v.end(), greater<int>());
sort(atk.begin(), atk.end(), greater<int>());
if (!atk.size()) break;
for (i = 0; i < min(v.size(), atk.size()); i++)
if (v[i] < atk[i]) break;
if (i != min(v.size(), atk.size())) {
atk.erase(atk.begin());
} else {
d[0] = 0, e[0] = 0;
sort(atk.begin(), atk.end());
for (i = 1; i <= min(v.size(), atk.size()); i++) {
d[i] = v[i - 1] + d[i - 1], e[i] = atk[i - 1] + e[i - 1];
k = max(k, d[i] - e[i]);
}
x = true;
break;
}
}
if (!x && def.size() < n) {
cout << 0;
return 0;
}
if (x && def.size() + atk.size() < n) {
cout << k;
return 0;
}
while (true) {
if (!def.size() && v.size()) break;
if (!v.size()) {
cout << k;
return 0;
}
sort(v.begin(), v.end());
sort(def.begin(), def.end());
for (i = 0; i < v.size(); i++) {
for (j = 0; j < def.size(); j++)
if (v[i] > def[j]) {
v.erase(v.begin() + i);
def.erase(def.begin() + j);
goto f;
}
}
f:;
if (i == v.size()) v.clear();
}
while (true) {
if (!atk.size() && !v.size()) {
cout << max(l, k);
return 0;
}
if (!v.size()) {
cout << k;
return 0;
}
if (!atk.size()) break;
sort(v.begin(), v.end());
sort(atk.begin(), atk.end());
for (i = 0; i < v.size(); i++) {
for (j = 0; j < atk.size(); j++)
if (v[i] >= atk[j]) {
l += v[i] - atk[j];
v.erase(v.begin() + i);
atk.erase(atk.begin() + j);
goto c;
}
}
c:;
if (i == v.size()) v.clear();
}
for (i = 0; i < v.size(); i++) l += v[i];
cout << max(l, k);
return 0;
}
| 10 | CPP |
s=input()
h=list(map(str,input().split()))
ok=False
for i in range(len(h)):
if (h[i][0]==s[0] or h[i][1]==s[1]):
ok=True
break
if ok==True:
print('YES')
else:
print('NO') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, d[600][600];
vector<int> g[600];
pair<int, int> p[600][600];
vector<pair<int, int> > ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
queue<pair<int, int> > q;
q.push({1, n});
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) d[i][j] = 0;
d[1][n] = 1;
p[1][n] = {-1, -1};
while (!q.empty() && !d[n][1]) {
int u = q.front().first;
int v = q.front().second;
q.pop();
for (auto i : g[u])
for (auto j : g[v])
if (!d[i][j] && i != j) {
p[i][j] = {u, v};
d[i][j] = d[u][v] + 1;
q.push({i, j});
}
}
if (d[n][1] == 0)
cout << -1;
else {
int u = n, v = 1;
while (u != -1) {
ans.push_back({u, v});
auto x = p[u][v];
u = x.first;
v = x.second;
}
reverse(ans.begin(), ans.end());
cout << ans.size() - 1 << endl;
for (auto i : ans) cout << i.first << " ";
cout << endl;
for (auto i : ans) cout << i.second << " ";
}
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MAX = 1e9 + 1;
const long long int Pinf = INT_MAX, Ninf = INT_MIN;
const long int mod = 1e9 + 7;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char* x) { cerr << '\"' << x << '\"'; }
void __print(const string& x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V>& x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T& x) {
int f = 0;
cerr << '{';
for (auto& i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
template <typename T>
void print(vector<T> v) {
for (T i : v) cout << i << " ";
cout << '\n';
}
template <typename T>
void print(vector<vector<T>>& v) {
for (vector<T>& vv : v) {
for (T& i : vv) cout << i << " ";
cout << '\n';
}
}
template <typename T>
void read(vector<T>& v) {
for (T& i : v) cin >> i;
}
template <typename T>
void read(T&& t) {
cin >> t;
}
template <typename T, typename... Args>
void read(T&& t, Args&&... args) {
cin >> t;
read(forward<Args>(args)...);
}
template <typename T>
void print(T&& t) {
cout << t << '\n';
}
template <typename T, typename... Args>
void print(T&& t, Args&&... args) {
cout << t << " ";
print(forward<Args>(args)...);
}
bool isPrime(ll n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
ll binpow(ll a, ll b, ll m) {
a %= m;
ll res = 1;
while (b > 0) {
if (b & 1) res = (res * a) % m;
a = (a * a) % m;
b >>= 1;
}
return res;
}
ll to_int(string str) {
ll n = str.size(), num = 0;
for (int i = 0; i < n; i++) {
num = num * 10 + (str[i] - '0');
}
return num;
}
ll gcd(ll a, ll b) {
if (b % a == 0) return a;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b) * b); }
map<ll, ll> primeFactors(ll n) {
map<ll, ll> m;
while (n % 2 == 0) {
m[2]++;
n = n / 2;
}
for (ll i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
m[i]++;
n = n / i;
}
}
if (n > 2) m[n]++;
return m;
}
vector<ll> allFactors(ll n) {
vector<ll> arr;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) arr.push_back(i), arr.push_back(n / i);
}
return arr;
}
ll sod(ll n) {
ll sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string str;
cin >> str;
int flag = 0;
string tmp = "";
for (int i = 0; i < n; i++) {
int j = i;
if (str[j] == '0') {
tmp += str[j];
while (str[j] == '0' and j < n and flag) {
j++;
}
if (flag) i = j - 1;
} else {
flag = 1;
tmp += str[j];
}
}
flag = 0;
string x = "";
for (int i = tmp.size() - 1; i >= 0; i--) {
int j = i;
if (tmp[j] == '1') {
x += tmp[j];
while (tmp[j] == '1' and j < n and flag) {
j--;
}
if (flag) i = j + 1;
} else {
x += tmp[j];
flag = 1;
}
}
reverse(x.begin(), x.end());
string zeros = "", ones = "";
int start = 0, i = 0;
while (x[i] == '0' and i < x.size()) {
zeros += x[i];
i++;
start++;
}
int end = x.size() - 1;
i = x.size() - 1;
while (x[i] == '1' and i >= 0) {
ones += x[i];
i--;
end--;
}
if (start < end) {
zeros.push_back('0');
};
print(zeros + ones);
}
}
| 8 | CPP |
#include <cstdio>
#include <algorithm>
#include <cctype>
#include <cstring>
using namespace std;
typedef long long i64;
inline int read(int f = 1, int x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();
return f*x;
}
const int N = 1e3+5;
int k, n, a[N][N];
int main()
{
n = read(); if((n&-n) == n) return puts("No"), 0;
puts("Yes");
printf("1 2\n2 3\n3 %d\n%d %d\n%d %d\n", n+1, n+1, n+2, n+2, n+3);
for(int i = 2; i*2+1 <= n; ++i)
printf("1 %d\n1 %d\n%d %d\n%d %d\n", 2*i, 2*i+1, 2*i, n+2*i+1, 2*i+1, n+2*i);
if(~n&1)
for(int x = 2; x <= n; ++x)
{
int y = n^x^1; if(x == 3||y == 3||y > n) continue;
printf("%d %d\n%d %d\n", n, x, n*2, y); break;
}
return 0;
} | 0 | CPP |
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int CC[310][310];
char p[310];
int M[310][310], w[310], vis[310][310], D[310][310][310], Mod = 998244353;
int n;
long long res;
void UDT(int i, int a, int b){
if(M[i][a]<b)M[i][a]=b;
}
void Do(int L){
int i, j, k;
for(i=0;i<=n;i++){
for(j=0;j<=n;j++){
M[i][j]=-1;
}
}
M[0][0]=0;
for(i=0;i<L;i++){
for(j=0;j<=L;j++){
int a = j, b = M[i][j];
if(b==-1)continue;
UDT(i+1,a,b);
if(i+2<=L){
if(w[i+1]==0||w[i+2]==0)UDT(i+2, a+1,b);
if(w[i+1]==1||w[i+2]==1)UDT(i+2, a,b+1);
}
if(w[i+1]==0 && b){
UDT(i+1,a+1,b-1);
}
if(w[i+1]==1 && a){
UDT(i+1,a-1,b+1);
}
}
}
int cc[2]={0};
for(i=L+1;i<=n;i++){
cc[w[i]]++;
}
for(i=0;i<=L;i++){
for(j=0;j<=M[L][i];j++){
if(!i&&!j)continue;
int x = cc[0]+i,y = cc[1]+j;
if(!vis[x][y]){
vis[x][y]=1;
for(k=n-L;k<=n;k++){
res+=D[x][y][k];
}
}
}
}
}
int main(){
int i, j, k, l;
scanf("%s",p);
for(i=0;p[i];i++);
n=i;
for(i=1;i<=n;i++)w[i]=p[i-1]-'0';
D[0][0][0]=1;
for(i=0;i<=n;i++){
for(j=0;i+j<=n;j++){
for(k=0;k<=n;k++){
if(!D[i][j][k])continue;
int t = D[i][j][k];
if(k+1<=n && w[n-(k+1)+1]==0){
D[i+1][j][k+1]=(D[i+1][j][k+1]+t)%Mod;
}
else{
D[i+1][j][k]=(D[i+1][j][k]+t)%Mod;
}
if(k+1<=n && w[n-(k+1)+1]==1){
D[i][j+1][k+1]=(D[i][j+1][k+1]+t)%Mod;
}
else{
D[i][j+1][k]=(D[i][j+1][k]+t)%Mod;
}
}
}
}
for(i=n;i>=2;i--){
Do(i);
}
res++;
printf("%lld\n",res%Mod);
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int arr[110];
vector<pair<long long, long long> > v;
vector<long long> c;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int res = 0;
for (int i = 0; i < n; i += 2) {
res += arr[i + 1] - arr[i];
}
cout << res << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int MAXN = 1000007;
long long int inv[MAXN];
long long int fact[MAXN];
long long int invfact[MAXN];
long long int mod_pow(long long int a, long long int n) {
long long int ans = 1;
while (n) {
if (n & 1) ans = (ans * a) % mod;
a = (a * a) % mod;
n >>= 1;
}
return ans;
}
void calc(int m) {
inv[0] = inv[1] = 1;
fact[0] = fact[1] = 1;
invfact[0] = invfact[1] = 1;
for (int i = 2; i <= m; ++i) {
inv[i] = (inv[mod % i] * (mod - (mod / i))) % mod;
fact[i] = (fact[i - 1] * i) % mod;
invfact[i] = (invfact[i - 1] * inv[i]) % mod;
}
}
long long int binom(int n, int k) {
return (1ll * fact[n] * ((invfact[k] * invfact[n - k]) % mod)) % mod;
}
long long int permuta(int n, int k) {
return (1ll * fact[n] * invfact[n - k]) % mod;
}
long long int cayley(int n, int k) {
if (n - k - 1 < 0) return (1ll * k * mod_pow(n, mod - 2)) % mod;
return (1ll * k * mod_pow(n, n - k - 1)) % mod;
}
int main() {
int n, m, a, b;
cin >> n >> m >> a >> b;
long long int ans = 0;
calc(max(n, m));
for (int i = 1; i < n; i++) {
if (i > m) break;
long long int cur = 1, cur2 = 1;
long long int vertex_in_path = permuta(n - 2, i - 1);
long long int ways_to_form_m = binom(m - 1, i - 1);
cur = (vertex_in_path * ways_to_form_m) % mod;
long long int Other_edges = mod_pow(m, n - i - 1);
long long int Other_trees = cayley(n, i + 1);
cur2 = (Other_edges * Other_trees) % mod;
ans = (ans + ((cur * cur2) % mod)) % mod;
}
cout << ans << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, ans;
bool pr[100003];
bool mark[100003];
vector<int> v;
vector<int> e;
vector<pair<int, int> > res;
int main() {
scanf("%d", &n);
for (int i = 2; i <= n; i++)
if (!pr[i]) {
v.push_back(i);
for (int j = 2 * i; j <= n; j += i) pr[j] = true;
}
int sz = v.size();
for (int i = 1; i < sz && v[i] <= n / 2; i++) {
vector<int> tmp;
for (int j = v[i]; j <= n; j += v[i])
if (!mark[j]) tmp.push_back(j);
int cnt = tmp.size();
if (cnt % 2 == 0) {
for (int j = 0; j < cnt; j += 2) {
res.push_back(pair<int, int>(tmp[j], tmp[j + 1]));
mark[tmp[j]] = mark[tmp[j + 1]] = true;
}
} else if (cnt >= 3) {
res.push_back(pair<int, int>(tmp[0], tmp[2]));
mark[tmp[0]] = mark[tmp[2]] = true;
for (int j = 3; j < cnt; j += 2) {
res.push_back(pair<int, int>(tmp[j], tmp[j + 1]));
mark[tmp[j]] = mark[tmp[j + 1]] = true;
}
}
}
for (int i = 2; i <= n; i += 2)
if (!mark[i]) e.push_back(i);
int cnt = e.size();
for (int i = 0; i + 1 < cnt; i += 2)
res.push_back(pair<int, int>(e[i], e[i + 1]));
ans = res.size();
printf("%d\n", ans);
for (int i = 0; i < ans; i++) printf("%d %d\n", res[i].first, res[i].second);
return 0;
}
| 9 | CPP |
def compress(string):
string.append("#")
n = len(string)
begin, end, cnt = 0, 1, 1
ans = []
while end < n:
if string[begin] == string[end]:
end, cnt = end + 1, cnt + 1
else:
ans.append((string[begin], cnt))
begin, end, cnt = end, end + 1, 1
return ans
def solve(num):
if num <= init:
return num
num -= init
tmp = init
tmp += (num // diff) * res[2][1]
num = num - (num // diff) * diff
tmp += max(num - res[1][1], 0)
return tmp
t = int(input())
for _ in range(t):
a, b, q = map(int, input().split())
tmp = [False] * (10 ** 5)
for i in range(1, 10 ** 5 + 1):
tmp[i - 1] = (((i) % a) % b == ((i) % b) % a)
res = compress(tmp)
if len(res) == 1:
ans = []
for _ in range(q):
l, r = map(int, input().split())
ans.append(0)
print(*ans)
continue
init = res[0][1]
diff = res[1][1] + res[2][1]
ans = []
# print(init, diff)
# print(res)
for _ in range(q):
l, r = map(int, input().split())
ans.append((r - solve(r)) - (l - 1 - solve(l - 1)))
print(*ans) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
class Edge {
public:
int to, next;
long long cost;
Edge(int t, int n, long long c) : to(t), next(n), cost(c) {}
Edge() : to(-1), next(-1), cost(0) {}
};
void add_edge(int u, int v, long long w);
void add_edge_DAG(int u, int v, long long w);
long long get_limit(long long w);
long long get_sum(long long w);
void get_scc();
void tarjan(int u, stack<int> &s);
long long solve(int s);
const long long NAGINF = 0xbfbfbfbf;
const int MAXN = 1e6 + 5, MAXM = 1e6 + 5;
Edge edges[MAXM];
int head[MAXN];
int esize;
Edge edges_DAG[MAXM];
int head_DAG[MAXN];
int esize_DAG;
int dfn[MAXN], low[MAXN], belong[MAXN], dfcnt, scc;
int degree[2][MAXN];
long long sum[MAXN], dist[MAXN];
int n;
int main() {
int m, s;
while (scanf("%d %d", &n, &m) != EOF) {
memset(head, -1, sizeof(head));
esize = 0;
memset(dfn, -1, sizeof(dfn));
memset(low, -1, sizeof(low));
memset(belong, -1, sizeof(belong));
dfcnt = 0;
memset(head_DAG, -1, sizeof(head_DAG));
esize_DAG = 0;
memset(degree, 0, sizeof(degree));
memset(sum, 0, sizeof(sum));
int x, y;
long long w;
while (m--) {
scanf("%d %d %lld", &x, &y, &w);
add_edge(x, y, w);
}
scanf("%d", &s);
get_scc();
for (int u = 1; u <= n; u++)
for (int i = head[u]; i != -1; i = edges[i].next) {
int v = edges[i].to;
if (belong[u] == belong[v]) {
sum[belong[u]] += get_limit(edges[i].cost);
}
}
for (int u = 1; u <= n; u++)
for (int i = head[u]; i != -1; i = edges[i].next) {
int v = edges[i].to;
if (belong[u] != belong[v]) {
add_edge_DAG(belong[u], belong[v], edges[i].cost + sum[belong[v]]);
}
}
long long res = solve(belong[s]);
printf("%lld\n", res);
}
return 0;
}
void add_edge(int u, int v, long long w) {
edges[esize].to = v;
edges[esize].next = head[u];
edges[esize].cost = w;
head[u] = esize;
esize++;
}
void add_edge_DAG(int u, int v, long long w) {
edges_DAG[esize_DAG].to = v;
edges_DAG[esize_DAG].next = head_DAG[u];
edges_DAG[esize_DAG].cost = w;
head_DAG[u] = esize_DAG;
esize_DAG++;
}
long long get_limit(long long cost) {
long long left = 1, right = 1e5;
long long ans = 0;
while (left <= right) {
long long mid = (left + right) / 2;
long long sum = (1 + mid) * mid / 2;
if (sum < cost) {
ans = mid;
left = mid + 1;
} else {
right = mid - 1;
}
}
return (cost + ans * cost - get_sum(ans));
}
inline long long get_sum(long long n) {
long long sum = n * (n + 1) * (n + 2) / 6;
return sum;
}
void get_scc() {
scc = 0;
stack<int> s;
for (int i = 1; i <= n; i++) {
if (dfn[i] == -1) {
tarjan(i, s);
}
}
for (int u = 1; u <= n; u++)
for (int i = head[u]; i != -1; i = edges[i].next) {
int v = edges[i].to;
if (belong[u] != belong[v]) {
degree[0][belong[v]]++;
degree[1][belong[u]]++;
}
}
}
void tarjan(int u, stack<int> &s) {
dfn[u] = low[u] = ++dfcnt;
s.push(u);
for (int i = head[u]; i != -1; i = edges[i].next) {
int v = edges[i].to;
if (dfn[v] == -1) {
tarjan(v, s);
low[u] = min(low[u], low[v]);
} else if (belong[v] == -1) {
low[u] = min(low[u], dfn[v]);
}
}
if (dfn[u] == low[u]) {
scc++;
while (!s.empty()) {
int v = s.top();
s.pop();
belong[v] = scc;
if (u == v) break;
}
}
}
long long solve(int s) {
memset(dist, NAGINF, sizeof(dist));
dist[s] = sum[s];
queue<int> q;
for (int i = 1; i <= scc; i++) {
if (degree[0][i] == 0) q.push(i);
}
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = head_DAG[u]; i != -1; i = edges_DAG[i].next) {
int v = edges_DAG[i].to;
if (dist[u] != NAGINF) {
dist[v] = max(dist[v], dist[u] + edges_DAG[i].cost);
}
if (--degree[0][v] == 0) q.push(v);
}
}
long long res = 0;
for (int i = 1; i <= scc; i++) {
res = max(res, dist[i]);
}
return res;
}
| 11 | CPP |
n = int(input())
x =[int(x) for x in input().split()]
y = [int(x) for x in input().split()]
z = [int(x) for x in input().split()]
print(sum(x)-sum(y))
print(sum(y)-sum(z))
| 8 | PYTHON3 |
for t in range(int(input())):
x = int(input())
s = 1
ans = [1]
k = 1
S = 1
tt = [1]
while S <= x:
k = k * 2
p = tt[-1] + k
tt.append(p)
ans.append((p + 1) * p // 2)
S += ans[-1]
if S > x:
print(len(ans) - 1)
else:
print(len(ans))
| 8 | PYTHON3 |
a=input()
c=1
a=list(a)
a.sort()
a=''.join(a)
for i in range(len(a)-1):
if(a[i]<a[i+1]):
c+=1
if(c%2):
print("IGNORE HIM!")
else:
print("CHAT WITH HER!") | 7 | PYTHON3 |
s=input()
u=0
l=0
for i in s:
if i.islower():
l=l+1
else:
u=u+1
if l>u:
print(s.lower())
if u>l:
print(s.upper())
elif l==u:
print(s.lower()) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char toUpper(const char &c) { return isupper(c) ? c : c - 'a' + 'A'; }
char toLower(const char &c) { return islower(c) ? c : c + 'a' - 'A'; }
bool isvowel(char c) {
c = toLower(c);
return (c == 'a' or c == 'e' or c == 'i' or c == 'i' or c == 'o' or
c == 'u' || c == 'y');
}
void toLowerCase(string &s) {
for (long long i = 0; i < s.size(); i++) {
if (!islower(s[i])) {
s[i] = tolower(s[i]);
}
}
}
void toUpperCase(string &s) {
for (long long i = 0; i < s.size(); i++) {
s[i] = toupper(s[i]);
}
}
bool ispal(string s) {
long long lo, hi;
lo = 0;
hi = s.length() - 1;
while (lo <= hi) {
if (s[lo] != s[hi]) {
return 0;
}
lo++;
--hi;
}
return 1;
}
template <class T>
string toString(T n) {
string v = "";
while (n) {
v.push_back(n % 10 + '0');
n /= 10;
}
reverse(v.begin(), v.end());
return v;
}
template <typename t>
t gcd(t a, t b) {
a = abs(a), b = abs(b);
return ((b == 0) ? a : gcd(b, a % b));
}
template <typename t>
t lcm(t a, t b) {
return (a * (b / gcd(a, b)));
}
template <typename T>
T modpow(T base, T exp, T modulus) {
base %= modulus;
T result = 1;
while (exp > 0) {
if (exp & 1) result = (result * base) % modulus;
base = (base * base) % modulus;
exp >>= 1;
}
return result;
}
template <typename T>
void cumulative(T *a, T *b, T n) {
for (long long i = 0; i < n; i++) {
i ? b[i] = b[i - 1] + a[i] : b[i] = a[i];
}
}
const int inf = 1e9 + 7;
const double eps = 1e-6;
const double pi = 1.00 * acos(-1.00);
long long n, m;
const int N = 250010;
long long fact[N];
void solve() {
cin >> n >> m;
fact[0] = fact[1] = 1;
for (int i = 2; i <= n; i++) {
fact[i] = (fact[i - 1] * i) % m;
}
long long ans = 0;
for (int i = 0; i < n; i++) {
long long k = ((n - i) * fact[n - i]) % m;
k = (k * fact[i + 1]) % m;
ans = (ans + k) % m;
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 502;
char s[maxN];
int f[maxN][maxN], n, k, pre[maxN][maxN];
void trace(int i, int j) {
if (i == 0) return;
for (int h = 1; h <= i; h++)
if (f[i][j] == f[h - 1][j - 1] + pre[h - 1][i - 1]) {
trace(h - 1, j - 1);
for (int th = h, ti = i; th <= ti; th++, ti--) s[th - 1] = s[ti - 1];
for (int t = h; t <= i; t++) printf("%c", s[t - 1]);
if (i != n) printf("+");
return;
}
}
int main() {
scanf("%s%i", s, &k);
n = strlen(s);
f[0][0] = 0;
for (int i = 1; i <= k; i++) f[0][i] = 1000;
for (int i = 0; i < n; i++)
for (int j = i; j < n; j++)
for (int ti = i, tj = j; ti <= tj; ti++, tj--)
if (s[ti] != s[tj]) ++pre[i][j];
for (int i = 1; i <= n; i++) {
f[i][0] = 1000;
for (int j = 1; j <= k; j++) {
f[i][j] = 1000;
for (int h = 1; h <= i; h++)
f[i][j] = min(f[i][j], f[h - 1][j - 1] + pre[h - 1][i - 1]);
}
}
int res = 1;
for (int i = 1; i <= k; i++)
if (f[n][res] > f[n][i]) res = i;
cout << f[n][res] << endl;
trace(n, res);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int ci[N], cj[N];
long long x[N], y[N];
int main() {
int n, m;
scanf("%d %d", &n, &m);
int a;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &a);
ci[i] += a;
cj[j] += a;
}
}
int ansi, ansj;
long long mini = 8e18, minj = 8e18;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
x[i] += 1ll * (2 * i - 2 * j - 1) * (2 * i - 2 * j - 1) * ci[j];
}
if (x[i] < mini) {
mini = x[i];
ansi = i;
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
y[i] += 1ll * (2 * i - 2 * j - 1) * (2 * i - 2 * j - 1) * cj[j];
}
if (y[i] < minj) {
minj = y[i];
ansj = i;
}
}
printf("%I64d\n%d %d", 4 * (mini + minj), ansi, ansj);
}
| 8 | CPP |
import sys
import itertools
import math
import collections
from collections import Counter
#########################
# imgur.com/Pkt7iIf.png #
#########################
def sieve(n):
prime = [True for i in range(n + 1)]
p = 2
while (p * p <= n):
if (prime[p] == True):
for i in range(p * 2, n + 1, p):
prime[i] = False
p += 1
prime[0] = prime[1] = False
r = [p for p in range(n + 1) if prime[p]]
return r
def divs(n, start=1):
r = []
for i in range(start, int(math.sqrt(n) + 1)):
if (n % i == 0):
if (n / i == i):
r.append(i)
else:
r.extend([i, n // i])
return r
def ceil(n, k): return n // k + (n % k != 0)
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(map(int, input().split()))
def lcm(a, b): return abs(a * b) // math.gcd(a, b)
def prr(a, sep=' '): print(sep.join(map(str, a)))
def dd(): return collections.defaultdict(int)
t = ii()
for _ in range(t):
n = ii()
o = z = 0
d = []
for i in range(n):
s = input()
if len(s) % 2 == 0:
d.append(len(s))
t = s.count('1')
o += t
z += (len(s) - t)
print(n) if z - (z % 2) + o - (o % 2) >= sum(d) else print(n - 1) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int p = 1e9 + 7;
const int lim = 11;
long long dp[2 * lim][lim][lim][lim][lim];
int n, t;
void pre_io() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
memset(dp, -1, sizeof(dp));
}
long long fun(int idx, int pk, int val, int prev, int last) {
if (pk < 0 || val < 0) return 0;
if (dp[idx][pk][val][prev][last] != -1) return dp[idx][pk][val][prev][last];
if (idx == n) {
if (pk > 0 || val > 0) return dp[idx][pk][val][prev][last] = 0;
return dp[idx][pk][val][prev][last] = 1;
}
dp[idx][pk][val][prev][last] = 0;
for (int i = 1; i <= 4; i++) {
if (i == last) continue;
if ((idx != 1 && prev < last) && last > i) {
dp[idx][pk][val][prev][last] += fun(idx + 1, pk - 1, val, last, i);
} else if ((idx != 1 && prev > last) && last < i) {
dp[idx][pk][val][prev][last] += fun(idx + 1, pk, val - 1, last, i);
} else {
dp[idx][pk][val][prev][last] += fun(idx + 1, pk, val, last, i);
}
}
return dp[idx][pk][val][prev][last];
}
int32_t main() {
pre_io();
cin >> n >> t;
long long res = 0;
for (int i = 1; i <= 4; i++) res += fun(1, t, t - 1, 1, i);
cout << res;
}
| 11 | CPP |
Subsets and Splits