solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int t, i, j, n, k, c;
cin >> t;
while (t--) {
cin >> n >> k;
long long int a[n + 5], b[n + 5], cnt = 0;
c = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == k / 2) c++;
}
for (i = 0; i < n; i++) {
if (a[i] > k / 2)
b[i] = 1;
else if (k % 2 == 0 && a[i] == k / 2 && cnt < c / 2) {
b[i] = 1;
cnt++;
} else
b[i] = 0;
}
for (i = 0; i < n; i++) cout << b[i] << " ";
cout << '\n';
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
std::string Name = "<stdin>";
std::string iput = Name.substr(0, Name.length() - 4) + ".in";
std::string oput = Name.substr(0, Name.length() - 4) + ".out";
template <class T>
inline bool chkmin(T &x, T y) {
return x > y ? x = y, true : false;
}
template <class T>
inline bool chkmax(T &x, T y) {
return x < y ? x = y, true : false;
}
template <class T>
inline T &read(T &x) {
static int f;
static char c;
for (f = 1; !isdigit(c = getchar_unlocked());) {
if (c == '-') f = -1;
}
for (x = 0; isdigit(c); c = getchar_unlocked()) {
x = x * 10 + c - 48;
}
return x *= f;
}
template <class T>
inline void write(T x, const char p = '\n') {
static int top;
static int s[30];
if (x < 0) {
x = -x;
putchar_unlocked('-');
}
do s[++top] = x % 10 + 48;
while (x /= 10);
while (top) putchar_unlocked(s[top--]);
putchar_unlocked(p);
}
const int maxn = 1e5 + 5;
int n, m, q;
int cnt, fa[maxn * 11];
int num[11][maxn];
inline int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
struct node {
int L[11], R[11], l, r, cnt;
node() { cnt = -1; }
node operator+(const node &a) const {
if (cnt == -1) return a;
if (a.cnt == -1) return *this;
for (int i = 1; i <= n; ++i) {
fa[L[i]] = L[i];
fa[R[i]] = R[i];
fa[a.L[i]] = a.L[i];
fa[a.R[i]] = a.R[i];
}
node ret;
ret.l = l;
ret.r = a.r;
ret.cnt = cnt + a.cnt;
for (int i = 1; i <= n; ++i) {
if (num[i][r] == num[i][a.l]) {
int p = find(R[i]);
int q = find(a.L[i]);
if (p != q) --ret.cnt, fa[q] = p;
}
}
for (int i = 1; i <= n; ++i) {
ret.L[i] = find(L[i]);
ret.R[i] = find(a.R[i]);
}
return ret;
}
} s[maxn << 2];
void build(int x, int l, int r) {
if (l == r) {
s[x].cnt = 0;
s[x].l = s[x].r = l;
for (int i = 1; i <= n; ++i) {
if (num[i][l] == num[i - 1][l]) {
s[x].L[i] = s[x].R[i] = s[x].L[i - 1];
} else {
s[x].L[i] = s[x].R[i] = ++cnt;
++s[x].cnt;
}
}
return;
}
int mid = l + r >> 1;
build((x << 1), l, mid);
build((x << 1 | 1), mid + 1, r);
s[x] = s[(x << 1)] + s[(x << 1 | 1)];
}
node query(int x, int l, int r, int p, int q) {
if (p <= l && r <= q) return s[x];
int mid = l + r >> 1;
if (q <= mid) return query((x << 1), l, mid, p, q);
if (p > mid) return query((x << 1 | 1), mid + 1, r, p, q);
return query((x << 1), l, mid, p, q) + query((x << 1 | 1), mid + 1, r, p, q);
}
void exec() {
read(n), read(m), read(q);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) read(num[i][j]);
build(1, 1, m);
while (q--) {
int l, r;
read(l), read(r);
write(query(1, 1, m, l, r).cnt);
}
}
int main() {
if (fopen(iput.c_str(), "r") != NULL) {
freopen(iput.c_str(), "r", stdin);
freopen(oput.c_str(), "w", stdout);
}
exec();
fclose(stdin);
fclose(stdout);
return 0;
}
| 11 | CPP |
N = int(input())
if N==2:
print(1)
exit()
ans = 2 # N and N-1
for K in range(2, N):
if K*K>N: break
n = N
if n%K!=0: continue
while n%K==0: n//=K
if n%K==1: ans +=1
y = 0
N_ = N-1
for K in range(2, N):
if K*K>=N_: break
if N_%K==0: y +=2
if K*K==N_: y += 1
print(ans+y) | 0 | PYTHON3 |
#include <iostream>
#include <vector>
#include <complex>
#include <string>
#include <sstream>
#include <cstdio>
#define EPS 1e-10
#define EQ(a,b) (abs(a - b) < EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
using namespace std;
typedef complex<double> P;
double dot (P a, P b) {
return (a.real() * b.real() + a.imag() * b.imag());
}
P crossNormalVector (P a, P b, P p) {
double t = dot(b-a, p-a) / (abs(b-a) * abs(b - a));
return a + t * (b - a);
}
P rot_pi (P x, P p) {
return P(((p.real() - x.real()) * -1) + x.real(), ((p.imag() - x.imag()) * -1) + x.imag());
}
int main ()
{
string str;
while (cin >> str) {
double x1, y1, x2, y2, py, px;
stringstream ss;
for (int i = 0; i < str.size(); i++)
if (str[i] == ',') str[i] = ' ';
ss << str;
ss >> x1 >> y1 >> x2 >> y2 >> px >> py;
P a = P(x1, y1), b = P(x2, y2), p = P(px, py);
P x = crossNormalVector (a, b, p);
P res = rot_pi (x, p);
printf("%.6f %.6f\n", res.real(),res.imag());
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool check_board(char *board, int n);
bool check_number(char *board, int n, bool *fast_exit, int &nr);
bool check_corners(char *board, int n);
bool check_edges(char *board, int n);
bool check_lone(char *board, int n);
bool delete_cross(char *board, int n, int index);
bool crossing_out(char *board, int n);
void display_board(char *board, int n);
int main(void) {
int n;
cin >> n;
char board[n * n];
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) cin >> board[n * j + i];
if (check_board(&board[0], n)) {
cout << "YES";
return 0;
}
cout << "NO";
return 0;
}
bool check_board(char *board, int n) {
bool fast_exit = false;
int number;
if (!check_number(board, n, &fast_exit, number)) {
return false;
}
if (fast_exit) {
return true;
}
if (!check_corners(board, n)) {
return false;
}
if (!check_lone(board, n)) {
return false;
}
if (!check_edges(board, n)) {
return false;
}
if (!crossing_out(board, n)) {
return false;
}
return true;
}
bool check_number(char *board, int n, bool *fast_exit, int &nr) {
nr = 0;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
if (board[j * n + i] == '#') nr++;
if (nr == 0) {
*fast_exit = true;
return true;
}
if (!(nr % 5)) return true;
return false;
}
bool check_corners(char *board, int n) {
if (board[0] == '#') return false;
if (board[n - 1] == '#') return false;
if (board[(n - 1) * n] == '#') return false;
if (board[n * n - 1] == '#') return false;
return true;
}
bool check_edges(char *board, int n) {
int temp = 0;
for (int i = 0; i < n; i += n - 1)
for (int j = 1; j < n - 1; j++, temp = 0) {
if (board[j * n + i] == '#')
temp++;
else
temp = 0;
if (temp > 1) {
return false;
}
}
temp = 0;
for (int j = 0; j < n; j += n - 1)
for (int i = 1; i < n - 1; i++, temp = 0) {
if (board[j * n + i] == '#')
temp++;
else
temp = 0;
if (temp > 1) return false;
}
for (int j = 1; j < n - 1; j++)
if ((board[j * n] == '#') && !(board[j * n + 1] == '#')) return false;
for (int j = 1; j < n - 1; j++)
if ((board[j * n + (n - 1)] == '#') && !(board[j * n + (n - 2)] == '#'))
return false;
for (int i = 1; i < n - 1; i++)
if ((board[i] == '#') && !(board[n + i] == '#')) return false;
for (int i = 1; i < n - 1; i++)
if ((board[(n - 1) * n + i] == '#') && !(board[(n - 2) * n + i] == '#'))
return false;
return true;
}
bool check_lone(char *board, int n) {
for (int i = 1; i < n - 1; ++i)
for (int j = 1; j < n - 1; ++j) {
if (board[j * n + i] == '#') {
if (!(board[(j - 1) * n + i] == '#') &&
!(board[(j + 1) * n + i] == '#') &&
!(board[j * n + (i - 1)] == '#') &&
!(board[j * n + (i + 1)] == '#'))
return false;
}
}
return true;
}
bool delete_cross(char *board, int n, int idx) {
if (board[idx] == '#' && board[idx + 1] == '#' && board[idx - 1] == '#' &&
board[idx - n] == '#' && board[idx + n] == '#') {
board[idx] = '.';
board[idx + 1] = '.';
board[idx - 1] = '.';
board[idx - n] = '.';
board[idx + n] = '.';
return true;
}
for (int i = 0; i < n * n; i++) {
if (board[i] != '.') return false;
return true;
}
return false;
}
bool crossing_out(char *board, int n) {
for (int i = 0; i < n * n; i++) {
if (board[i] == '#') {
if (!delete_cross(board, n, i + n)) return false;
}
}
return true;
}
void display_board(char *board, int n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cout << board[n * j + i];
}
cout << endl;
}
return;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 111;
long long hang[maxn], lie[maxn], G[maxn][maxn], N;
int main() {
char c;
scanf("%I64d", &N);
memset(hang, 0, sizeof(hang));
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
c = getchar();
while (c != '.' && c != 'c' && c != 'C') c = getchar();
if (c == '.')
G[i][j] = 0;
else
G[i][j] = 1;
hang[i] += G[i][j];
lie[j] += G[i][j];
}
}
long long sum = 0;
for (int i = 1; i <= N; ++i) {
if (hang[i] > 0) sum += hang[i] * (hang[i] - 1);
if (lie[i] > 0) sum += lie[i] * (lie[i] - 1);
}
printf("%I64d\n", sum / 2);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long dp[2200][2200];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, k;
cin >> n >> k;
dp[0][1] = 1;
for (long long i = 0; i < k; i++) {
for (long long j = 1; j <= n; j++) {
for (long long f = j; f <= n; f += j) {
dp[i + 1][f] += (dp[i][j] % 1000000007);
dp[i + 1][f] %= 1000000007;
}
}
}
long long ans = 0;
for (long long i = 1; i <= n; i++) {
ans += dp[k][i];
ans %= 1000000007;
}
cout << ans;
}
| 10 | CPP |
#include<bits/stdc++.h>
using namespace std;
int r,c,n;
vector<pair<int,int> > a;
stack<int> q;
int read(){
int x=0,f=1;char ch=getchar();
for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-f;
for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
return x*f;
}
int main(){
r=read();c=read();n=read();
for (int i=1;i<=n;i++){
int x=read(),y=read();
if (y==0) a.push_back(make_pair(x,i));
else if (x==r) a.push_back(make_pair(r+y,i));
else if (y==c) a.push_back(make_pair(r+c+r-x,i));
else if (x==0) a.push_back(make_pair(r+c+r+c-y,i));
x=read(),y=read();
if (y==0) a.push_back(make_pair(x,i));
else if (x==r) a.push_back(make_pair(r+y,i));
else if (y==c) a.push_back(make_pair(r+c+r-x,i));
else if (x==0) a.push_back(make_pair(r+c+r+c-y,i));
if (a.size()&1) a.pop_back();
}
sort(a.begin(),a.end());
for (int i=0;i<(int)a.size();i++)
if (!q.empty()&&q.top()==a[i].second) q.pop();
else q.push(a[i].second);
printf(q.empty()?"YES\n":"NO\n");
return 0;
} | 0 | CPP |
n = int(input())
a = map(int,input().split())
sushi = list(a)
typ = sushi[0]
l1 = 1
l2 = 0
length = list()
for i in range(1,n):
if (sushi[i]==typ):
l1 += 1
else:
length.append(l1)
l1 = 1
typ = sushi[i]
length.append(l1)
MAX = 0
for i in range(len(length)-1):
m = min(length[i],length[i+1])
if (m>MAX):
MAX = m
print(MAX*2)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MAX = 100;
char s[MAX][MAX];
int n;
void clear() {}
void No() { printf("No\n"); }
void solve() {
for (int i = 0; i < n; i++) scanf("%s", s[i]);
int minx = INT_MAX, miny = INT_MAX;
int maxx = INT_MIN, maxy = INT_MIN;
for (int x = 0; x < n; x++)
for (int y = 0; y < n; y++)
if (s[x][y] == '4')
minx = min(minx, x), maxx = max(maxx, x), miny = min(miny, y),
maxy = max(maxy, y);
if (minx == INT_MAX) return No();
for (int x = minx; x <= maxx; x++)
for (int y = miny; y <= maxy; y++)
if (s[x][y] != '4') return No();
for (int x = 0; x < n; x++)
for (int y = 0; y < n; y++) {
int expected = 0;
if (x >= minx && x <= maxx && y >= miny && y <= maxy)
expected = 4;
else if (x >= minx - 1 && x <= maxx + 1 && y >= miny - 1 &&
y <= maxy + 1) {
if ((x == minx - 1 || x == maxx + 1) &&
(y == miny - 1 || y == maxy + 1))
expected = 1;
else
expected = 2;
} else
expected = 0;
if (expected + '0' != s[x][y]) return No();
}
printf("Yes\n");
}
int main() {
while (scanf("%d", &n) == 1) {
clear();
solve();
return 0;
}
return 0;
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
const int mod=1000000007;
struct UnionFindTree{
vector<int>par,sz;
UnionFindTree(int n){
par.resize(n);
sz.resize(n);
for(int i=0;i<n;i++){
par[i]=i;
sz[i]=1;
}
}
int find(int x){
return x==par[x]?x:par[x]=find(par[x]);
}
void unite(int x,int y){
x=find(x);y=find(y);
if(x==y)return;
if(sz[x]<sz[y])swap(x,y);
sz[x]+=sz[y];
par[y]=x;
}
bool areSame(int x,int y){
return find(x)==find(y);
}
int size(int x){
return sz[find(x)];
}
};
int solve(vector<vint>bm){
if(bm.size()==0||bm[0].size()==0)return 1;
int h=bm.size();
int w=bm[0].size();
UnionFindTree uf(h+w);
rep(i,h)rep(j,w)if(bm[i][j])uf.unite(i,h+j);
int cnt=h+w;
rep(i,h+w)if(uf.find(i)==i)cnt--;
int ret=1;
rep(i,cnt)ret=ret*2%mod;
return ret;
}
signed main(){
int H,W;
cin>>H>>W;
vector<string>fld(H);
rep(i,H)cin>>fld[i];
int ans=1;
if(H&1){
bool flag=false;
rep(j,W)if(fld[H/2][j]!=fld[H/2][W-1-j])flag=true;
if(flag)ans=ans*2;
fld.erase(fld.begin()+H/2);
H--;
}
if(W&1){
bool flag=false;
rep(i,H)if(fld[i][W/2]!=fld[H-1-i][W/2])flag=true;
if(flag)ans=ans*2;
rep(i,H)fld[i]=fld[i].substr(0,W/2)+fld[i].substr(W/2+1,W/2);
W--;
}
vector<vint>bm(H/2,vint(W/2));
rep(i,H/2)rep(j,W/2){
int cnt[26]={};
cnt[fld[i][j]-'a']++;
cnt[fld[i][W-1-j]-'a']++;
cnt[fld[H-1-i][W-1-j]-'a']++;
cnt[fld[H-1-i][j]-'a']++;
int w=24;
rep(k,26){
for(int l=1;l<=cnt[k];l++)w/=l;
}
if(w==24){
ans=ans*12%mod;
bm[i][j]=1;
}
else{
ans=ans*w%mod;
}
}
ans=ans*solve(bm)%mod;
cout<<ans<<endl;
return 0;
}
| 0 | CPP |
t = int(input())
for i in range(t):
temp = input().split(" ")
n = int(temp[0])
x = int(temp[1])
if n-2 <= 0:
print(1)
else:
print(int((n-3)/x+2)) | 7 | PYTHON3 |
n = int(input())
a = []
b = []
ans = 1000000
for i in range(4):
a.append([]*n)
for j in range(n):
a[i].append([0]*n)
for i in range(4):
for j in range(n):
s = input()
for k in range(len(s)):
a[i][j][k] = int(s[k])
if i < 3:
input()
for i in range(16):
c = [0]*4
y = 3
ans1 = 0
while i > 0:
c[y] = i % 2
y-=1
i //= 2
c.reverse()
if sum(c) == 2:
for k in range(4):
if c[k] == 1:
for i in range(n):
for j in range(n):
if i % 2 == j % 2:
ans1+=min(1,1 - a[k][i][j])
else:
ans1+=max(0,a[k][i][j])
else:
for i in range(n):
for j in range(n):
if i % 2 != j % 2:
ans1+=min(1,1 - a[k][i][j])
else:
ans1+=max(0,a[k][i][j])
ans = min(ans,ans1)
print(ans)
| 9 | PYTHON3 |
t = input().split(' ')
n, k = int(t[0]), int(t[1])
T = input().split(' ')
for i in range(n):
T[i] = int(T[i])
T.sort()
d = 0
l = 0
j = 0
for i in range(k):
while d < len(T) and T[d] <= j:
d+=1
if d < len(T):
print(T[d]-j)
j=T[d]
else:
print(0)
| 8 | PYTHON3 |
a, b = map(int, input().split())
fas = min(a, b)
a -= fas
b -= fas
same = max(a, b) // 2
print(fas, same)
| 7 | PYTHON3 |
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n, m, a[1024][1024], b[1024][1024], x[1024], y[1024];
inline int f(int i, int j) { return (a[i][j]+b[i][j]+x[i]+y[j]) % 2; }
int main() {
scanf("%d%d", &n, &m);
rep (i, n) rep (j, m) scanf("%d", a[i]+j);
rep (k, n-1) {
int c = 0;
rep (i, m) c += f(k, i) != f(k+1, i);
if (c%2) {
rep (i, m) if (f(k, i) == f(k+1, i)) b[k+1][i]++, y[i]++;
}
else {
rep (i, m) if (f(k, i) != f(k+1, i)) b[k+1][i]++, y[i]++;
}
x[k+1] = c;
}
int s = 0;
rep (i, m) if (f(0, i)) s++;
if (s%2) {
rep (i, m) if (f(0, i)) rep (k, n) b[k][i]++;
}
else {
rep (i, m) if (!f(0, i)) rep (k, n) b[k][i]++;
}
rep (i, n) rep (j, m) printf("%d%c", b[i][j]%2, "\n "[j+1<m]);
return 0;
} | 0 | CPP |
n=int(input())
s=[0]+list(map(int,input().split()))
r=[0 for i in range(n+1)]
r[0]=1
if s[1]==0:
r[1]=2
else:
r[1]=1
for i in range(2,n+1):
if s[i]==0:
r[i]=r[i-1]+1
if s[i]==3:
r[i]=r[i-1]
if s[i]==2:
if s[i-1]==2:
r[i]=r[i-2]+1
if s[i-1]==1 or s[i-1]==0:
r[i]=r[i-1]
if s[i-1]==3:
temp=i-1
c=0
while s[temp]==3:
c+=1
temp-=1
num=s[temp]
if num==0:
r[i]=r[temp]
if num==1:
r[i]=r[temp-c%2]+c%2
if num==2:
r[i]=r[temp-(c+1)%2]+(c+1)%2
if s[i]==1:
if s[i-1]==1:
r[i]=r[i-2]+1
if s[i-1]==2 or s[i-1]==0:
r[i]=r[i-1]
if s[i-1]==3:
temp=i-1
c=0
while s[temp]==3:
c+=1
temp-=1
num=s[temp]
if num==0:
r[i]=r[temp]
if num==2:
r[i]=r[temp-c%2]+c%2
if num==1:
r[i]=r[temp-(c+1)%2]+(c+1)%2
print(max(r)-1)
| 7 | PYTHON3 |
class Node:
def __init__(self, id):
self.id = id
self.parent = -1
self.right = -1
self.left = -1
self.sibling = -1
def getDegree(self):
count=0
if self.right is not -1:
count += 1
if self.left is not -1:
count += 1
return count
def getDepth(self):
count = 0
parent= self.parent
while parent is not -1:
count += 1
parent = parent.parent
return count
def getType(self):
if self.parent == -1:
return 'root'
elif self.left is -1 and self.right is -1:
return 'leaf'
else:
return 'internal node'
def getHeight(self, node, count =0):
if node == -1:
return -1
if (node.left == -1 and node.right == -1):
return 0
else:
return max(self.getHeight(node.left, count+1)+1, self.getHeight(node.right,count+1)+1)
n = int(input())
nodes = [Node(i) for i in range(n)]
for i in range(n):
id, left, right = map(int, input().split())
if left != -1:
nodes[id].left = nodes[left]
nodes[left].parent = nodes[id]
if right != -1:
nodes[id].right = nodes[right]
nodes[right].parent = nodes[id]
if left != -1 and right != -1:
nodes[left].sibling = nodes[right]
nodes[right].sibling = nodes[left]
for i in nodes:
output = ""
output +=f'node {i.id}: '
output +=f'parent = {i.parent if i.parent == -1 else i.parent.id}, '
output +=f'sibling = {i.sibling if i.sibling == -1 else i.sibling.id}, '
output +=f'degree = {i.getDegree()}, '
output +=f'depth = {i.getDepth()}, '
output +=f'height = {i.getHeight(i)}, '
output +=f'{i.getType()}'
print(output)
| 0 | PYTHON3 |
T = int(input())
for t in range(T):
N = int(input())
A = list(map(int, input().split()))
max_difference = 0
j = 1
i = 0
max_difference = 0
for j in range(1, N):
if A[j] < A[i]:
max_difference = max(max_difference, A[i] - A[j])
if A[j] > A[i]:
i = j
time = 0
x = 1
while max_difference > 0:
max_difference -= x
x *= 2
time += 1
print(time)
| 9 | PYTHON3 |
for _ in range(int(input())):
n, m = map(int, input().split())
a = list(map(int,input().strip().split()))[:n]
b = list(map(int,input().strip().split()))[:m]
ans = 0
found = False
for e in b:
if e in a:
ans = e
found = True
break
if not found:
for e in a:
if e in b:
ans = e
found = True
break
if not found:
print('NO')
else:
print('YES')
print('1 ', ans) | 7 | PYTHON3 |
[n,l,r] = [int(x) for x in input().split()]
diff_3 = (r - l)//3
ways = [diff_3,diff_3,diff_3]
for i in range(l,r-diff_3*3+1):
# print(i)
ways[i%3] += 1
# print(ways)
# print(sum(ways), r-l + 1)
curr = [ways[0],ways[1],ways[2]]
# print(curr)
for i in range(n-1):
new = [0,0,0]
for j in range(0,3):
for k in range(0,3):
new[(j+k)%3] += (ways[j]*curr[k])
for j in range(0,3):
new[j] %= (10**9+7)
curr = new
# print(curr)
print(curr[0]) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> h;
int main() {
int t;
string s;
cin >> t;
for (int i = 0; i < t; i++) {
cin >> s;
string ans = "";
int count = 0;
for (int a = 1; a <= 12; a++) {
if (12 % a == 0) {
int b = 12 / a;
bool found;
for (int i = 0; i < b; i++) {
found = false;
for (int j = 1; j <= a; j++) {
if (s[(j - 1) * b + i] == 'O') {
found = true;
break;
}
}
if (!found) break;
}
if (!found) {
count++;
string A, B;
char aa = char('0' + a), bb = char('0' + b);
if (aa == '<')
A = "12";
else
A = aa;
if (bb == '<')
B = "12";
else
B = bb;
ans += A + "x" + B + " ";
}
}
}
cout << count << " " << ans << '\n';
}
return 0;
}
| 7 | CPP |
n , k = input().split()
for i in range(int(k)):
n = int(n)
n = n-1 if n % 10 else n//10
print(n) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int lz[N << 2][10], n, q, op, l, r, x, y;
long long sum[N << 2][10], tr[10];
void Up(int K) {
for (int i = 0; i < 10; ++i) sum[K][i] = 0;
for (int i = 0; i < 10; ++i) sum[K][lz[(K << 1)][i]] += sum[(K << 1)][i];
for (int i = 0; i < 10; ++i)
sum[K][lz[(K << 1 | 1)][i]] += sum[(K << 1 | 1)][i];
}
void build(int K, int l, int r) {
for (int i = 0; i < 10; ++i) lz[K][i] = i, sum[K][i] = 0;
if (l == r) {
int t, tr = 1;
scanf("%d", &t);
while (t) sum[K][t % 10] += tr, tr *= 10, t /= 10;
return;
}
int m = (l + r) >> 1;
build((K << 1), l, m);
build((K << 1 | 1), m + 1, r);
for (int i = 0; i < 10; ++i)
sum[K][i] = sum[(K << 1)][i] + sum[(K << 1 | 1)][i];
Up(K);
}
void Down(int K) {
for (int i = 0; i < 10; ++i) lz[(K << 1)][i] = lz[K][lz[(K << 1)][i]];
for (int i = 0; i < 10; ++i) lz[(K << 1 | 1)][i] = lz[K][lz[(K << 1 | 1)][i]];
memset(tr, 0, sizeof(tr));
for (int i = 0; i < 10; ++i) tr[lz[K][i]] += sum[K][i];
for (int i = 0; i < 10; ++i) sum[K][i] = tr[i];
for (int i = 0; i < 10; ++i) lz[K][i] = i;
}
void mdf(int K, int l, int r, int ql, int qr, int x, int y) {
if (ql <= l && qr >= r) {
for (int i = 0; i < 10; ++i)
if (lz[K][i] == x) lz[K][i] = y;
return;
}
Down(K);
int m = (l + r) >> 1;
if (ql <= m) mdf((K << 1), l, m, ql, qr, x, y);
if (qr > m) mdf((K << 1 | 1), m + 1, r, ql, qr, x, y);
Up(K);
}
long long Ask(int K, int l, int r, int ql, int qr) {
long long re = 0;
if (ql <= l && qr >= r) {
for (int i = 0; i < 10; ++i) re += sum[K][i] * lz[K][i];
return re;
}
Down(K);
int m = (l + r) >> 1;
if (ql <= m) re += Ask((K << 1), l, m, ql, qr);
if (qr > m) re += Ask((K << 1 | 1), m + 1, r, ql, qr);
return re;
}
int main() {
scanf("%d%d", &n, &q);
build(1, 1, n);
while (q--) {
scanf("%d%d%d", &op, &l, &r);
if (op == 1) {
scanf("%d%d", &x, &y);
mdf(1, 1, n, l, r, x, y);
} else
printf("%lld\n", Ask(1, 1, n, l, r));
}
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, t;
long long func(int *A) {
long long z = 0;
for (int i = 0; i < k; ++i) {
z += A[i];
}
return z;
}
int main() {
cin >> n >> k;
int temp = n - k + 1;
int A[k];
long long z = 0;
for (int i = 0; i < k; ++i) scanf("%d", &A[i]);
long long z1 = func(A);
z = z1;
for (int i = 0; i < n - k; ++i) {
z1 -= A[i % k];
scanf("%d", &A[i % k]);
z1 += A[i % k];
z += z1;
}
double a = double(z) / double(n - k + 1);
printf("%.6f\n", a);
}
| 8 | CPP |
class DisjointSet:
def __init__(self, size):
self.p = [i for i in range(size)]
self.rank = [0] * size
def same(self, x, y):
return self.find_set(x) == self.find_set(y)
def unite(self, x, y):
self.link(self.find_set(x), self.find_set(y))
def link(self, x, y):
if self.rank[y] < self.rank[x]:
self.p[y] = x
else:
self.p[x] = y
if self.rank[x] == self.rank[y]:
self.rank[y] += 1
def find_set(self, x):
if x != self.p[x]:
self.p[x] = self.find_set(self.p[x])
return self.p[x]
n, q = map(int, input().split())
ds = DisjointSet(n)
for _ in range(q):
com, x, y = map(int, input().split())
if com == 0:
ds.unite(x, y)
if com == 1:
print(1 if ds.same(x, y) else 0)
| 0 | PYTHON3 |
n = int(input())
x, y, z = list("a")*n, list("b")*n, list("c")*n
for i in range(n):
x[i], y[i], z[i] = map(int, input().split())
if sum(x) == sum(y) == sum(z) == 0:
print("YES")
else:
print("NO") | 7 | PYTHON3 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int a=0, b=0;
int aa, bb;
for (int i = 0; i < n; i++) {
cin >> aa >> bb;
if (aa > bb) a += aa+bb;
else if (bb > aa) b += aa+bb;
else a += aa, b += bb;
}
cout << a << " " << b << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, ct = -1;
string str[55];
int res[55];
string s[100] = {"A", "B", "C", "D", "E", "F", "G", "H", "I",
"J", "K", "L", "M", "N", "O", "P", "Q", "R",
"S", "T", "U", "V", "W", "X", "Y", "Z", "Aa",
"Ab", "Ac", "Ad", "Ae", "Af", "Ag", "Ah", "Ai", "Aj",
"Ak", "Al", "Am", "An", "Ao", "Ap", "Aq", "Ar", "As",
"At", "Au", "Av", "Aw", "Ax", "Ay", "Az"};
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n - k + 1; i++) cin >> str[i];
res[1] = ++ct;
int now = 2;
for (int i = 1; i <= n - k; i++) {
if (str[i][0] == 'N') {
res[now] = res[i];
now++;
} else {
int j = now;
for (j = now; j <= i + k - 1; j++) res[j] = ++ct;
now = j;
}
}
if (str[n - k + 1][0] == 'Y')
for (int i = now; i <= n; i++) res[i] = ++ct;
else
for (int i = now; i <= n; i++) res[i] = ct;
for (int i = 1; i <= n; i++) {
cout << s[res[i]] << ' ';
}
return 0;
}
| 9 | CPP |
t=int(input())
for h in range(t):
s=input().split(":")
l=len(s)
if(l==8):
p=""
for i in range(8):
k=len(s[i])
s[i]="0"*(4-k)+s[i]
p=p+s[i]
if(i!=7):
p=p+":"
else:
if(s[0]==""):
p=""
m=10-l
for i in range(m):
p+="0000:"
for i in range(2,l):
k=len(s[i])
s[i]="0"*(4-k)+s[i]
p=p+s[i]
if(i!=l-1):
p=p+":"
elif(s[-1]==""):
m=10-l
p=""
for i in range(l-2):
k=len(s[i])
s[i]="0"*(4-k)+s[i]+":"
p=p+s[i]
for i in range(m):
if(i!=m-1):
p+="0000:"
else:
p+="0000"
else:
p=""
m=9-l
for i in range(l):
k=len(s[i])
if(k==0):
for i in range(m):
p+="0000:"
else:
s[i]="0"*(4-k)+s[i]
p=p+s[i]
if(i!=l-1):
p=p+":"
print(p) | 8 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:36777216")
using namespace std;
long long mod = 998244353;
long long inf = 1e9;
long double eps = 1e-7;
long double pi = acosl(-1);
ifstream in("input.txt");
ofstream out("output.txt");
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int sum = 0;
int he = 0;
int hz = 0;
string s;
cin >> s;
for (auto i : s) {
sum += i - '0';
if ((i - '0') == 0) {
if (hz)
he = 1;
else
hz = 1;
continue;
}
if ((i - '0') % 2 == 0) {
he = 1;
}
}
if (he && hz && sum % 3 == 0) {
cout << "red\n";
} else {
cout << "cyan\n";
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
const long long mod = 1000000000 + 7;
using namespace std;
const int N = 505;
long long dp[N], f[N];
int n;
int main() {
cin >> n;
dp[0] = 1;
for (int i = 1; i <= n; i++) {
memset(f, 0, sizeof(f));
for (int j = 0; j <= n; j++)
for (int k = 0; k + j <= n; k++)
f[j + k] = (f[j + k] + dp[j] * dp[k]) % mod;
memset(dp, 0, sizeof(dp));
for (int j = 0; j <= n; j++)
dp[j] = (f[j - 1] + f[j + 1] * (j + 1) * j + f[j] * (2ll * j + 1)) % mod;
}
cout << dp[1] << endl;
return 0;
}
| 10 | CPP |
n=int(input())
a=input()
s=a[0]
c=0
t=0
for i in range(1,n):
if s==a[i]:
pass
else:
if a[i]=="S":
t +=1
s=a[i]
else:
c +=1
s=a[i]
if t>=c:
print("NO")
else:
print("YES")
| 7 | PYTHON3 |
def solve(n, x, a):
if sum(a) % x != 0:
print(n)
elif len(list(filter(lambda z: z % x != 0, a))) == 0:
print(-1)
else:
s, e = (0, 0)
while a[s] % x == 0:
s += 1
while a[n-1-e] % x == 0:
e += 1
print(n-1-min(s, e))
t = int(input())
for i in range(t):
n, x = map(int, input().split(" "))
a = list(map(int, input().split(" ")))
solve(n,x,a)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, k, m = 1000010, p[1010000], a[1010000], c[1000000];
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) scanf("%d", &c[i]);
if (k == 1) {
printf("Yes");
return 0;
}
for (int i = 2; i < m; i++) {
if (p[i] == 0) {
for (int j = i; j < m; j += i) p[j] = i;
}
}
fill(a, a + m, 0);
vector<pair<int, int> > t, tk;
for (int i = 0; i < n; i++) {
if (c[i] == 1) continue;
int s = c[i];
t.clear();
t.push_back(make_pair(p[s], 1));
s /= p[s];
while (s > 1) {
bool nn = 0;
for (int j = 0; j < t.size(); j++) {
if (p[s] == t[j].first) {
t[j].second++;
nn = 1;
}
}
if (nn == 0) t.push_back(make_pair(p[s], 1));
s /= p[s];
}
for (int j = 0; j < t.size(); j++) {
int f = t[j].first;
a[f] = max(a[f], t[j].second);
}
}
tk.push_back(make_pair(p[k], 1));
k /= p[k];
while (k > 1) {
bool nn = 0;
for (int j = 0; j < tk.size(); j++) {
if (p[k] == tk[j].first) {
tk[j].second++;
nn = 1;
}
}
if (nn == 0) tk.push_back(make_pair(p[k], 1));
k /= p[k];
}
for (int i = 0; i < tk.size(); i++) {
int r = tk[i].first;
if (tk[i].second > a[r]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
public:
void Solve() {
string T; cin >> T;
ULL N = T.size();
T.push_back('0');
ULL L = 0;
ULL R = N;
ULL ans = 0;
rep(i, N ) {
if (L & 1) {
if (T[i] == '1' && T[i + 1] == '0') {
ans += (N - R + 1) / 2; R--;
}
else if (T[i] == '1') {
ans += (N - R + 1) / 2; L++;
}
else {
L++;
}
}
else {
if (T[i] == '0') {
R--;
}
else {
ans += (N - R) / 2;
ans += R - L;
L++;
}
}
}
cout << ans << endl;
}
};
int main() {
unique_ptr<Problem> p(new Problem());
p->Solve();
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N=82,M=N*N;
bool f[N][N][N*N*2];
int a[N][N];
int n,m,ans=1<<30;
void dfs(int x,int y,int v){
if (f[x][y][v+M]) return;f[x][y][v+M]=true;
if (x==n&&y==m) {
ans=min(ans,abs(v-a[x][y]));
ans=min(ans,abs(v+a[x][y]));
return;
}
if (x!=n) dfs(x+1,y,v+a[x][y]),dfs(x+1,y,v-a[x][y]);
if (y!=m) dfs(x,y+1,v+a[x][y]),dfs(x,y+1,v-a[x][y]);
}
int main (){
scanf ("%d%d",&n,&m);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
scanf ("%d",&a[i][j]);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++){
int x;scanf ("%d",&x);
a[i][j]=abs(a[i][j]-x);
}
dfs(1,1,0);
printf ("%d",ans);
return 0;
} | 0 | CPP |
a,b = map(int,input().split())
d ={}
for _ in range(b):
a = list(map(int,input().split()))
r=-1
for i in range(len(a)):
if a[i]>r:w =i;r = a[i]
if w in d:d[w]+=1
else:d[w]=1
k = max(d.values())
z = float("inf")
for i in d:
if d[i]==k:z = min(z,i)
print(z+1) | 7 | PYTHON3 |
#include<iostream>
using namespace std;
int main()
{
int x;
cin>>x;
if(x%2==0)
cout<<x;
else
cout<<x*2;
return 0;
} | 0 | CPP |
ar = [['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'OUT'], ['OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT'], ['OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT'], ['OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT'], ['OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT'], ['IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN'], ['IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN'], ['IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN'], ['IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN'], ['IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN'], ['IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN'], ['IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN'], ['IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN'], ['IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN'], ['IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN'], ['IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN'], ['IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN'], ['OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT'], ['OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT'], ['OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT'], ['OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT'], ['OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT'], ['OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'IN', 'OUT', 'IN', 'IN', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT'], ['OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'IN', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT', 'OUT']]
row, col = map(int, input().split())
print(ar[row][col]) | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long m;
scanf("%I64d", &m);
long long l = 0, r = 1000000000000000000, mid;
long long res = -1;
while (l <= r) {
mid = (l + r) / 2;
long long carry = 0;
for (long long k = 2; k < 1000000 && k * k * k <= mid; k++) {
long long b = k * k * k;
carry += (mid / b);
}
if (carry > m) {
r = mid - 1;
} else if (carry < m) {
l = mid + 1;
} else {
res = mid;
r = mid - 1;
}
}
printf("%I64d\n", res);
}
| 9 | CPP |
#include <bits/stdc++.h>
const int maxn = 120;
const int maxlen = 2010000;
int flow[maxn + 1][maxn + 1], capa[maxn + 1][maxn + 1],
cost[maxn + 1][maxn + 1];
int xl[maxn + 1];
int dist[maxn + 1];
int head, tail, xlge, n, len;
int S, T;
char s_cipher[maxlen + 1], s_answer[maxlen + 1];
int result;
int pre[maxn + 1];
bool inxl[maxn + 1];
void init() {
int i, j, cc, ca;
scanf("%d%d", &len, &n);
scanf("%s%s", s_cipher, s_answer);
T = n + n + 2;
S = n + n + 1;
for (i = 1; i <= T; ++i)
for (j = 1; j <= T; ++j) flow[i][j] = cost[i][j] = capa[i][j] = 0;
for (i = 1; i <= n; ++i) capa[S][i] = capa[i + n][T] = 1;
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j) capa[i][j + n] = 1;
for (i = 1; i <= len; ++i) {
if ((s_cipher[i - 1] >= 'a') && (s_cipher[i - 1] <= 'z'))
cc = s_cipher[i - 1] - 'a' + 1;
else
cc = s_cipher[i - 1] - 'A' + 1 + 26;
if ((s_answer[i - 1] >= 'a') && (s_answer[i - 1] <= 'z'))
ca = s_answer[i - 1] - 'a' + 1;
else
ca = s_answer[i - 1] - 'A' + 1 + 26;
ca += n;
--cost[cc][ca];
}
}
bool zhao() {
int i, j, k;
for (i = 1; i <= T; ++i) {
dist[i] = 1000000;
inxl[i] = false;
}
xlge = 1;
head = 0;
tail = 1;
xl[1] = S;
dist[S] = 0;
inxl[S] = true;
while (xlge) {
--xlge;
++head;
if (head > T) head = 1;
i = xl[head];
inxl[i] = false;
for (j = 1; j <= T; ++j) {
if ((flow[i][j] < capa[i][j]) && (dist[i] + cost[i][j] < dist[j])) {
dist[j] = dist[i] + cost[i][j];
pre[j] = i;
if (!inxl[j]) {
inxl[j] = true;
++xlge;
++tail;
if (tail > T) tail = 1;
xl[tail] = j;
}
}
}
for (j = 1; j <= T; ++j) {
if ((flow[j][i]) && (dist[i] - cost[j][i] < dist[j])) {
dist[j] = dist[i] - cost[j][i];
pre[j] = -i;
if (!inxl[j]) {
inxl[j] = true;
++xlge;
++tail;
if (tail > T) tail = 1;
xl[tail] = j;
}
}
}
}
return (dist[T] < 1000000);
}
void change() {
int j, k;
j = T;
while (j != S) {
k = pre[j];
if (k < 0) k = -k;
if (pre[j] < 0) {
--flow[j][k];
result -= cost[j][k];
} else {
++flow[k][j];
result += cost[k][j];
}
j = k;
}
}
void work() {
int result = 0;
while (zhao()) change();
}
char num2char(int p) {
if (p <= 26)
return 'a' + p - 1;
else
return 'A' + (p - 26) - 1;
}
void output() {
int i, j;
printf("%d\n", -result);
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
if (flow[i][j + n] == 1) {
printf("%c", num2char(j));
break;
}
printf("\n");
}
int main() {
init();
work();
output();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << 1 << '\n';
return;
}
n--;
string s = to_string(n);
string ans;
for (int i = s.size() - 1; i >= 0; i--) {
int dig = s[i] - '0';
for (int j = dig + 1; j <= 9; j++) {
set<int> gg;
gg.insert(j);
for (int x = 0; x < i; x++) gg.insert(s[x] - '0');
if (gg.size() > k) continue;
if ((int)gg.size() < k) {
cout << s.substr(0, i) + (char)('0' + j) + string(s.size() - 1 - i, '0')
<< '\n';
return;
} else {
int min_dig = 9;
min_dig = min(min_dig, j);
for (int p = 0; p < i; p++) min_dig = min(min_dig, s[p] - '0');
cout << s.substr(0, i) + (char)('0' + j) +
string(s.size() - 1 - i, min_dig + '0')
<< '\n';
return;
}
}
}
if (k == 1) {
cout << string(s.size() + 1, '1') << '\n';
} else {
cout << '1' + string(s.size(), '0') << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int tst;
cin >> tst;
while (tst--) {
solve();
}
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
map<int, int> pphav;
int p2(int a) { return 1 << a; }
void fac(int a) {
for (int i = 2; i * i <= a; ++i) {
if (a % i == 0) {
int cp = i;
int pw = 0;
while (a % i == 0) {
a /= i;
++pw;
}
pphav[cp] |= p2(pw);
}
}
if (a != 1) pphav[a] |= p2(1);
}
map<int, int> g;
const int mpw = 29;
int allbit = p2(mpw + 1) - 1;
int grund(int msk) {
if (msk & 1) msk ^= 1;
if (g.find(msk) != g.end()) return g[msk];
vector<int> sn(33);
for (int i = 1; (msk & (allbit ^ (p2(i) - 1))) != 0; ++i) {
sn[grund((msk & (p2(i) - 1)) | (msk >> i))] = 1;
}
int r = 0;
while (sn[r]) ++r;
return g[msk] = r;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int z = 0; z < (n); ++z) {
int a;
cin >> a;
fac(a);
}
int totgrund = 0;
for (auto i = (pphav).begin(); i != (pphav).end(); ++i)
totgrund ^= grund(i->second);
if (totgrund)
cout << "Mojtaba" << endl;
else
cout << "Arpa" << endl;
return 0;
}
| 9 | CPP |
import re
n = int(input())
s = input()
xl = re.findall(r'B+',s)
x = len(xl)
r=[]
for i in xl:
r.append(len(i))
print(x)
if x!=0:
print(*r) | 7 | PYTHON3 |
# @author
import sys
class AFillingShapes:
def solve(self):
n = int(input())
if n & 1:
print(0)
else:
print(2 ** (n // 2))
solver = AFillingShapes()
input = sys.stdin.readline
solver.solve()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> p( n + 1 );
for( int i = 1; i < n + 1; i++ ) {
cin >> p[i - 1] >> p[i];
}
vector<vector<int>> m( n + 1, vector<int>( n + 1 ) );
for( int l = 2; l < n + 1; l++ ) {
for( int i = 1; i < n - l + 1 + 1; i++ ) {
int j = i + l - 1;
m[i][j] = INT32_MAX / 4;
for( int k = i; k < j; k++ ) {
m[i][j] = min( m[i][j], m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j] );
}
}
}
cout << m[1][n] << endl;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int n, m, deg[MAXN];
vector<int> E[MAXN], sol;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int tmp = 0; tmp < n; ++tmp) {
vector<pair<int, int> > v;
for (int j = 0; j < m; ++j) {
int x;
cin >> x;
if (x != -1)
v.push_back(pair<int, int>(x, j));
else if (x == -1 && n == 1)
v.push_back(pair<int, int>(x, j));
}
sort(v.begin(), v.end());
if (n == 1) {
for (int z = 0; z < m; ++z) cout << v[z].second + 1 << " ";
return 0;
}
for (int i = 0; i < ((int)v.size()); ++i) {
int start =
lower_bound(v.begin(), v.end(), pair<int, int>(v[i].first + 1, -1)) -
v.begin();
for (int j = start; j < ((int)v.size()); ++j) {
if (v[j].first != v[start].first) break;
E[v[i].second].push_back(v[j].second);
deg[v[j].second]++;
}
}
}
queue<int> Q;
for (int i = 0; i < m; ++i)
if (deg[i] == 0) {
Q.push(i);
}
while (!Q.empty()) {
int x = Q.front();
Q.pop();
sol.push_back(x);
for (auto e : E[x]) {
deg[e]--;
if (deg[e] == 0) Q.push(e);
}
}
if (((int)sol.size()) == m)
for (auto it : sol) cout << it + 1 << " ";
else
cout << -1;
}
| 10 | CPP |
a = [int(i) for i in input().split()]
x = 0
n = 0
for i in range(len(a)-1):
if i<len(a)-1:
if a[i]==a[i+1]:
x+=1
elif a[i] == a[len(a)-1]:
x+=1
if x == len(a)-1:
x-=1
elif i+2<=len(a)-1:
if a[i]==a[i+2]:
x+=1
elif i+2<=len(a)-1:
if a[i]==a[i+2]:
x+=1
print(x) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100, inF = N;
int n, DIS[N];
bool mark[N];
struct tree {
int dex, root, dis[N], par[N];
vector<int> nei[N];
tree() {
fill(par, par + N, -1);
fill(dis, dis + N, inF);
}
void input() {
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
nei[--u].push_back(--v);
nei[v].push_back(u);
}
}
void dfs(int v, bool b = false) {
dis[root] = 0;
if (dis[v] >= DIS[v] && b)
return;
for (int u: nei[v])
if (u ^ par[v]) {
dis[u] = dis[v] + 1;
par[u] = v;
dfs(u, b);
}
}
bool far(int u, int v) {
if (u == v || u == par[v] || v == par[u] || par[u] == par[v])
return false;
if (par[u] != -1 && par[par[u]] == v)
return false;
if (par[v] != -1 && par[par[v]] == u)
return false;
return true;
}
} R, B;
void INPUT() {
cin >> n >> R.root >> B.root;
R.root--;
B.root--;
R.input();
B.input();
B.dfs(B.root);
copy(B.dis, B.dis + n, DIS);
R.dfs(R.root, true);
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
INPUT();
for (int v = 0; v < n; v++)
for (int u: R.nei[v])
if (B.far(u, v))
mark[u] = mark[v] = true;
for (int v = 0; v < n; v++)
if (R.dis[v] < B.dis[v] && mark[v]) {
cout << -1;
return 0;
}
int a = -1, b = inF;
for (int v = 0; v < n; v++) {
if (R.dis[v] < B.dis[v])
a = max(a, B.dis[v]);
if (R.dis[v] <= B.dis[v])
b = min(b, B.dis[v]);
}
cout << max(a, b) * 2;
}
| 0 | CPP |
n = int(input())
l = list(map(int,input().split()))
for i in range(n):
s = input()
s = s.replace("a","e").replace("i","e").replace("o","e").replace("u","e").replace("y","e").split("e")
#print(s)
if len(s)-1 != l[i]:
print("NO")
exit()
print("YES")
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int isP(long int hj) {
long int op;
for (op = 2; op <= sqrt(hj); op++) {
if (hj % op == 0) return 0;
}
return 1;
}
void swap(long long int *p, long long int *q) {
long long int tmp = *p;
*p = *q;
*q = tmp;
}
void tog(int *p) {
if (*p == 1)
*p = 0;
else
*p = 1;
}
string fdi(int hi) {
switch (hi) {
case 0:
return "zero";
case 1:
return "one";
case 2:
return "two";
case 3:
return "three";
case 4:
return "four";
case 5:
return "five";
case 6:
return "six";
case 7:
return "seven";
case 8:
return "eight";
case 9:
return "nine";
}
}
string rdx(int hi) {
switch (hi) {
case 2:
return "twenty";
case 3:
return "thirty";
case 4:
return "forty";
case 5:
return "fifty";
case 6:
return "sixty";
case 7:
return "seventy";
case 8:
return "eighty";
case 9:
return "ninety";
}
}
long long int bd(long long int mk) {
long long int hb;
for (hb = (mk / 2); hb >= 1; hb--) {
if (mk % hb == 0) return hb;
}
}
int dsm(long long int pkk) {
if (pkk < 0) pkk *= -1;
while (pkk > 0) {
if (pkk % 10 == 8) return 1;
pkk /= 10;
}
return 0;
}
int main() {
long long int m1, m2, prev, prc, cost, min, ind, ans, g, p, max, inc, cap, sm,
d, nxt, mn, t, up, a, b, lc, la, c, e, preI, t1, t2, brk, clbp, clb, et,
jmp, u, l1, l2, sq, nd, maxi, li, ri, tr, mp, og, lt1, lt2, n1, n2, c1,
c2, minI, min1, dp, p2, p3, ze, fst, lst, min2, s, sm1, sm2, sm3, sr, sl,
l, ln, rz, rn, car, eq, r, shr, ng, v, curr, spl, fl, z, ev, od, m, ct, j,
q, k, maxI, max1, max2, lt, md, f, n, xP, xN, w, h, d2, d1, u1, u2, i, x,
y;
string s1, s2, kk;
kk = "";
cin >> s1 >> s2;
lt = s1.size();
int A[lt];
for (i = 0; i < lt; i++) {
A[i] = s1[i] - 48;
}
sort(A, A + lt);
for (i = 0; i < lt; i++) {
if (A[i] != 0) break;
}
if (i == lt) {
if (s2 == "0")
cout << "OK";
else
cout << "WRONG_ANSWER";
} else {
kk += (A[i] + 48);
p = i;
for (i = 0; i < lt; i++) {
if (i != p) kk += (A[i] + 48);
}
if (kk == s2)
cout << "OK";
else
cout << "WRONG_ANSWER";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005, M = 1000000007, BIG = 0x3f3f3f3f;
int n;
int a[N];
bool vis[N];
bool Read() {
cin >> n;
if (cin.eof()) return 0;
for (int i = 1; i <= n; i++) cin >> a[i];
return 1;
}
void Process() {
vector<long long> clusters;
memset(vis, 0, sizeof vis);
for (int i = 1; i <= n; i++) {
if (vis[i]) continue;
vis[i] = 1;
long long sum = 1;
int p = a[i];
while (!vis[p]) {
vis[p] = 1;
sum++;
p = a[p];
}
clusters.push_back(sum);
}
sort(begin(clusters), end(clusters));
long long big = clusters.back();
clusters.pop_back();
if (!clusters.empty()) {
big += clusters.back();
clusters.pop_back();
}
long long ans = 0;
for (long long x : clusters) ans += x * x;
ans += big * big;
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
while (Read()) Process();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
char str1[200002], str2[200002];
const int K = 1024;
unsigned int aw[200002];
unsigned int bw[200002];
int bit[1 << 16];
int cnt[200002 / K + 1][200002];
int main() {
gets(str1);
gets(str2);
int l1 = strlen(str1), l2 = strlen(str2);
for (int i = 0; i < l1; ++i) {
unsigned int one = 1;
for (int j = 0; j < 32 && i + j < l1; ++j) {
if (str1[i + j] == '1') aw[i] |= one;
one <<= 1;
}
}
for (int i = 0; i < l2; ++i) {
unsigned int one = 1;
for (int j = 0; j < 32 && i + j < l2; ++j) {
if (str2[i + j] == '1') bw[i] |= one;
one <<= 1;
}
}
bit[0] = 0;
for (int i = 1; i < (1 << 16); ++i) {
bit[i] = (i & 1) + bit[i >> 1];
}
int IT = K >> 5, MASK = (1 << 16) - 1;
for (int i = 0; i + K <= l1; i += K) {
int ind = i / K;
for (int j = 0; j + K <= l2; ++j) {
int p1 = i, p2 = j;
for (int t = 0; t < IT; ++t) {
unsigned int mask = aw[p1] ^ bw[p2];
cnt[ind][j] += bit[mask & MASK] + bit[mask >> 16];
p1 += 32;
p2 += 32;
}
}
}
int q, p1, p2, len;
scanf("%d", &q);
while (q--) {
scanf("%d%d%d", &p1, &p2, &len);
int ans = 0;
int pos = (p1 / K) * K, r = p1 + len - 1;
while (pos < p1) pos += K;
for (int i = p1; i < pos && i <= r; ++i) {
ans += str1[i] != str2[p2];
++p2;
}
if (pos <= r) {
while (pos + K - 1 <= r) {
ans += cnt[pos / K][p2];
pos += K;
p2 += K;
}
for (int i = pos; i <= r; ++i) {
ans += str1[i] != str2[p2];
++p2;
}
}
printf("%d\n", ans);
}
return 0;
}
| 13 | CPP |
n=int(input())
l=[]
for i in range (n):
a=int(input())
l.append(a)
for a in l:
o=[]
i=10
while a>0:
if a%i!=0:
o.append(a%i)
a=(a//i)*i
else:
i=i*10
print(len(o))
for i in range(len(o)-1): print(o[i], end = " ")
print (o[len(o)-1])
| 7 | PYTHON3 |
m,n=map(int,input().split())
for i in range(m):
if i%2==0:
for j in range(n-1):
print("#",end="")
print("#")
elif i%2!=0 and i%4==1:
for k in range(n-1):
print(".",end="")
print("#")
elif i%2!=0 and i%4!=1:
print("#",end="")
for j in range(1,n-1):
print(".",end="")
print('.')
| 7 | PYTHON3 |
n = int(input())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
# arr2 = arr2*2
seg = []
dic = {}
for i in range(n):
dic[arr1[i]] = [i]
for j in range(n):
if (dic[arr2[j]][0]>j):
dic[arr2[j]].append(n+j)
else:
dic[arr2[j]].append(j)
dic2 = {}
for key in dic:
if (dic[key][1]-dic[key][0] not in dic2):
dic2[dic[key][1]-dic[key][0]]=1
else:
dic2[dic[key][1]-dic[key][0]]+=1
print(dic2[max(dic2.keys(), key=(lambda k: dic2[k]))])
| 9 | PYTHON3 |
#include <bits/stdc++.h>
template <typename T>
void amax(T& a, T b) {
a = a > b ? a : b;
}
template <typename T>
void amin(T& a, T b) {
a = a < b ? a : b;
}
template <typename T>
void sadd(T& a, T b) {
a = (a + b) % 1000000007;
}
template <typename T>
void ssub(T& a, T b) {
a = ((a - b) % 1000000007 + 1000000007) % 1000000007;
}
using namespace std;
const int mxN = 1e5 + 1;
int n;
long long ax, ay, bx, by, tx, ty;
double bottles[mxN][2];
double adists[mxN];
double bdists[mxN];
double dists[mxN];
double getdist(long long a, long long b, long long c, long long d) {
return sqrt((a - c) * (a - c) + (b - d) * (b - d));
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> ax >> ay >> bx >> by >> tx >> ty;
cin >> n;
double sumdists = 0;
for (int i = 0; i < n; ++i) {
cin >> bottles[i][0] >> bottles[i][1];
dists[i] = getdist(bottles[i][0], bottles[i][1], tx, ty);
sumdists += dists[i];
}
double mina = 1e18;
double second_mina = 1e18;
int bottlea = 0;
int second_bottlea = 0;
double minb = 1e18;
double second_minb = 1e18;
int bottleb = 0;
int second_bottleb = 0;
for (int i = 0; i < n; ++i) {
adists[i] = getdist(ax, ay, bottles[i][0], bottles[i][1]);
bdists[i] = getdist(bx, by, bottles[i][0], bottles[i][1]);
if (adists[i] + dists[i] - 2 * dists[i] < mina - 2 * dists[bottlea]) {
second_mina = mina, second_bottlea = bottlea;
mina = adists[i] + dists[i], bottlea = i;
} else if (adists[i] + dists[i] - 2 * dists[i] <
second_mina - 2 * dists[second_bottlea])
second_mina = adists[i] + dists[i], second_bottlea = i;
if (bdists[i] + dists[i] - 2 * dists[i] < minb - 2 * dists[bottleb]) {
second_minb = minb, second_bottleb = bottleb;
minb = bdists[i] + dists[i], bottleb = i;
} else if (bdists[i] + dists[i] - 2 * dists[i] <
second_minb - 2 * dists[second_bottleb])
second_minb = bdists[i] + dists[i], second_bottleb = i;
}
double min_total = 1e18;
amin(min_total, mina + 2 * sumdists - 2 * dists[bottlea]);
amin(min_total, minb + 2 * sumdists - 2 * dists[bottleb]);
if (bottlea == bottleb) {
if (mina + second_minb < minb + second_mina)
minb = second_minb, bottleb = second_bottleb;
else
mina = second_mina, bottlea = second_bottlea;
}
amin(min_total,
mina + minb + 2 * sumdists - 2 * (dists[bottlea] + dists[bottleb]));
printf("%.12lf\n", min_total);
return 0;
}
| 7 | CPP |
p, q, l ,r = [int(i) for i in input().split()]
ans = 0
mark_z = set()
mark_x = set()
for i in range(p):
tmp = [int(j) for j in input().split()]
for i in range(tmp[0],tmp[1]+1):
mark_z.add(i)
for i in range(q):
tmp = [int(j) for j in input().split()]
for i in range(tmp[0],tmp[1]+1):
mark_x.add(i)
for i in range(l,r+1):
for j in mark_x:
if j+i in mark_z:
ans += 1
break
print(ans)
| 8 | PYTHON3 |
def main():
digits = input()
li = list(digits)
digits = list(map(int, li))
first = digits[:3]
second = digits[3:]
first.sort()
second.sort()
sumf = sum(first)
sums = sum(second)
if sumf == sums:
print('0')
return
elif sumf < sums:
small = 1
else:
small = 2
if small == 1:
diff = sums - sumf
cnt1 = 0
for i in range(0, 3):
diff = diff + first[i]
if diff<=9:
cnt1 = cnt1+1
break
else:
diff = diff - 9
cnt1 = cnt1+1
cnt2 = 0
diff = sums - sumf
for i in range(2, -1, -1):
diff = diff - second[i]
#print(diff)
if diff <= 0:
cnt2 = cnt2 + 1
break
else:
cnt2 = cnt2 + 1
#print(cnt1)
#print(cnt2)
result = min(cnt1, cnt2)
else:
cnt1 = 0
diff = sumf - sums
for i in range(0, 3):
diff = diff + second[i]
if diff<=9:
cnt1 = cnt1 +1
break
else:
diff = diff - 9
cnt1 = cnt1 + 1
cnt2 = 0
diff = sumf - sums
for i in range(2, -1, -1):
diff = diff - first[i]
if diff <= 0:
cnt2 = cnt2 + 1
break
else:
cnt2 = cnt2 + 1
result = min(cnt1, cnt2)
temp = 9
if small == 1:
for i in range(0, 3):
for j in range(0, 3):
diff = sums - sumf
diff = diff + first[i]-9
diff = diff - second[j]
if diff <= 0:
temp = 2
break
else:
for i in range(0, 3):
for j in range(0, 3):
diff = sumf - sums
diff = diff + second[i] - 9
diff = diff - first[j]
if diff <= 0:
temp = 2
break
result = min(result, temp)
print(result)
if __name__ == "__main__":
main()
| 8 | PYTHON3 |
t = input()
t = int(t)
l = [input() for i in range(3*t)]
for i in range(0,3*t,3):
l[i] = int(l[i])
l[i+1] = l[i+1].split()
l[i+2] = l[i+2].split()
for j in range(l[i]):
l[i+1][j] = int(l[i+1][j])
l[i+2][j] = int(l[i+2][j])
for i in range(0,3*t,3):
x = min(l[i+1])
y = min(l[i+2])
a = 0
j = 0
while j<l[i]:
a += max((l[i+1][j] - x), (l[i+2][j] - y))
j += 1
print(a) | 8 | PYTHON3 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string s[300];
int dx[8] = {0,0,1,-1,-1,-1,1,1};
int dy[8] = {1,-1,0,0,-1,1,-1,1};
int dfs( int i , int j , int n ){
int cnt = 0;
for( int k = 0 ; k < 8 ; k++ ){
int cnt2 = 0;
int x = i;
int y = j;
while( 0 <= x && x < n && 0 <= y && y < n ){
if( s[x][y] == '1' ){
x += dx[k];
y += dy[k];
cnt2++;
}
else break;
}
cnt = max( cnt , cnt2 );
//８方向動かして、カウント
}
return cnt;
}
int main(void){
while(1){
int n;
cin >> n;
if( n == 0 ) break;
for( int i = 0 ; i < n ; i++ ){
cin >> s[i];
}
int ans = 0;
for( int i = 0 ; i < n ; i++ ){
for( int j = 0 ; j < n ; j++ ){
if( s[i][j] == '1' ){
ans = max( ans , dfs(i,j,n) );
}
}
}
cout << ans << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, b, c;
int main() {
cin >> n;
int a[n][n];
for (int a = 1; a <= n; a++) {
for (int b = 1; b <= n; b++) {
if (a % b == 0 && a * b > n && a / b < n) {
cout << a << ' ' << b << endl;
return 0;
}
}
}
cout << -1;
}
| 7 | CPP |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int l[10], v1, v2, cnt;
double n, d, t;
char ch;
while (cin>>l[0]>>ch){
n = l[0];
for (int i = 1; i < 10; i++)
{
cin >> l[i] >> ch;
n += l[i];
}
cin >> v1 >> ch >> v2;
t=n/(v1+v2);
d=v1*t; //列車1の動く距離
cnt=0;
while(d>0){
d -= l[cnt];
cnt++;
}
cout << cnt << endl;
}
return 0;
} | 0 | CPP |
#include<stdio.h>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <map>
#include <functional>
#include <stdio.h>
#include <array>
#include <algorithm>
#include <string>
#include <string.h>
#include <assert.h>
#include <stdio.h>
#include <queue>
#include<iomanip>
#include<bitset>
#include<stack>
#include<set>
#include<limits>
#include <complex>
#include<cstdlib>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
pair<long long int,int> getans(long long int a) {
if (a == 0) {
return make_pair(0, 0);
}
else if (a == 1) {
return make_pair(1, 0);
}
}
int main() {
while (1) {
int n; cin >> n;
if (!n)break;
vector<int>ls;
for (int i = 0; i < n; ++i) {
int l; cin >> l;
ls.push_back(l);
}
long double maxH =999999999;
int anss, ansa, ansc;
for (int s = 0; s < 16; ++s) {
for (int a = 0; a < 16; ++a) {
for (int c = 0; c < 16; ++c) {
vector<int>rs(n+1);
rs[0] = s;
for (int i = 0; i < n; ++i) {
rs[i + 1] = (rs[i] * a + c) % 256;
}
long double H = 0;
vector<int>os(256);
for (int i = 0; i < n; ++i) {
os[(ls[i] + rs[i+1]) % 256]+=1 ;
}
for (int i = 0; i < 256; ++i) {
if (os[i])
H -= os[i] / static_cast<long double>(n) * log(os[i] / static_cast<long double>(n));
}
if (H < maxH-0.00000001) {
maxH = H;
anss = s;
ansa = a;
ansc = c;
}
}
}
}
cout << anss << " " << ansa << " " << ansc << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long Max = 1e5 + 1;
void nos() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
long long n, m, k;
void read() { cin >> n >> m >> k; }
void solve() {
long long highcnt = n - (m * (n / m));
highcnt *= n / m + 1;
long long plusonetotal = highcnt * k;
long long small, smallcnt, big, bigcnt;
small = plusonetotal / n;
big = small + 1;
bigcnt = plusonetotal - small * n;
smallcnt = n - bigcnt;
vector<pair<long long, long long> > mp;
long long i;
for (i = 1; i <= n; i++) {
if (bigcnt) {
bigcnt--;
mp.push_back({i, big});
} else
mp.push_back({i, small});
}
while (k--) {
long long attable = n / m + 1;
std::vector<long long> mult;
long long luat = 0;
vector<pair<long long, long long> > newmp;
for (auto &it : mp) {
if (luat < highcnt) {
luat++;
mult.push_back(it.first);
it.second--;
}
if (it.second != 0) newmp.push_back(it);
}
sort(newmp.begin(), newmp.end(),
[](pair<long long, long long> p1, pair<long long, long long> p2) {
return p1.second > p2.second;
});
mp = newmp;
long long bigline = mult.size() / attable;
long long it = 0;
vector<long long> fq(n + 1);
while (bigline--) {
cout << attable << ' ';
long long end = it + attable;
for (; it < end; it++) {
fq[mult[it]] = 1;
cout << mult[it] << ' ';
}
cout << '\n';
}
vector<long long> less;
for (i = 1; i <= n; i++)
if (!fq[i]) less.push_back(i);
attable--;
long long smallline = less.size() / attable;
it = 0;
while (smallline--) {
cout << attable << ' ';
long long end = it + attable;
for (; it < end; it++) {
cout << less[it] << ' ';
}
cout << '\n';
}
}
cout << '\n';
}
void restart() {}
int32_t main() {
nos();
long long teste;
cin >> teste;
while (teste--) {
read();
solve();
restart();
}
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> v(n, vector<int>(m));
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
cin >> v[i][j];
}
}
int g = -1, df = 0;
for(int i = 1; i < n; i++) {
int d = 0;
for(int j = 0; j < m; j++) {
if(v[i][j] != v[0][j]) d++;
}
if(d > 4) {
cout << "No";
exit(0);
}
if(d > 2) {
g = i;
df = d;
break;
}
}
if(g == -1) {
cout << "Yes\n";
for(int i = 0; i < m; i++) cout << v[0][i] << " ";
exit(0);
}
if(df == 3) {
vector<int> cols;
for(int i = 0; i < m; i++) {
if(v[0][i] != v[g][i]) cols.push_back(i);
}
for(int i = 0; i < 3; i++) {
for(int j = 0; j < 3; j++) {
if(i == j) continue;
vector<int> cur(m);
int other = 0;
if(other == i || other == j) other++;
if(other == i || other == j) other++;
int important = -1;
bool f = true;
for(int k = 0; k < m; k++) {
if(k == cols[i]) cur[k] = v[0][k];
else if(k == cols[j]) cur[k] = v[g][k];
else if (k == cols[other]) {
cur[k] = -1;
important = k;
}
else cur[k] = v[0][k];
}
for(int t = 1; t < n; t++) {
if(t == g) continue;
int d = 0;
for(int k = 0; k < m; k++) {
if(v[t][k] != cur[k]) d++;
}
if(d <= 2) continue;
if(d >= 4) {
f = false;
break;
}
if(d == 3 && cur[important] == -1) {
cur[important] = v[t][important];
}
else {
f = false;
break;
}
}
if(f) {
cout << "Yes\n";
if(cur[important] == -1) cur[important] = v[0][important];
for(int x : cur) cout << x << " ";
exit(0);
}
}
}
cout << "No";
}
if(df == 4) {
vector<int> cols;
for(int i = 0; i < m; i++) {
if(v[0][i] != v[g][i]) cols.push_back(i);
}
assert(cols.size() == 4);
for(int i = 0; i < (1 << 4); i++) {
int c = 0;
for(int j = 0; j < 4; j++) {
if(i >> j & 1) c++;
}
if(c != 2) continue;
vector<int> cur(m, -1);
bool f = true;
for(int j = 0; j < 4; j++) {
int pos = cols[j];
if(i >> j & 1) cur[pos] = v[0][pos];
else cur[pos] = v[g][pos];
}
for(int j = 0; j < m; j++) {
if(cur[j] == -1) cur[j] = v[0][j];
}
for(int t = 0; t < n; t++) {
int d = 0;
for(int k = 0; k < m; k++) {
if(cur[k] != v[t][k]) d++;
}
if(d > 2) f = false;
}
if(f) {
cout << "Yes\n";
for(int j = 0; j < m; j++) {
cout << cur[j] << " ";
}
exit(0);
}
}
cout << "No";
}
return 0;
} | 11 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans=0;string s;
cin>>n>>s;
int l=0,r=1;
while(r<=n){
string tmp=s.substr(l,r-l);
if(s.find(tmp,r)<n)ans=max(ans,r-l),r++;
else l++,r++;
}
cout<<ans;
return 0;
} | 0 | CPP |
for i in range(int(input())):
n=int(input())
l=[int(x) for x in input().split()]
m=[int(x) for x in input().split()]
count=0
j=0
for j in range(n):
count+=max(l[j]-min(l),m[j]-min(m))
print(count) | 8 | PYTHON3 |
def countBits(n):
a =0
while n>0:
n = n & n-1
a+=1
return a
t=int(input())
for i in range(t):
n = int(input())
bits = countBits(n)
for j in range(2,n):
s = pow(2,j)
if n%(s-1)==0:
a = s-1
break
x = int(n/a)
print(x)
| 7 | PYTHON3 |
t = int(input())
for i in range(t):
n = int(input())
max_l = 0
min_r = 10**10
for i in range(n):
l, r = map(int, input().split())
max_l = max(max_l, l)
min_r = min(min_r, r)
print(max(0, max_l - min_r))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char A[200023];
cin >> A;
int l = 0;
int f = 0;
bool first = 0;
for (int i = 0; i < n; i++) {
if (A[i] == '>' && A[i + 1] == '<' && i < n) {
l = i + 1;
if (first == 0) {
first = 1;
f = i;
}
}
}
if (f != 0 || l != 0) {
for (int j = f; j >= 0; j--) {
if (A[j] == '>')
f = j;
else
break;
}
for (int j = l; j < n; j++) {
if (A[j] == '<')
l = j;
else
break;
}
}
int ans = f + n - 1 - l;
if (f == 0 && l == 0) {
ans = n;
}
cout << ans << endl;
return 0;
}
| 7 | CPP |
n=str(input())
m=str(input())
dn={}
dm={}
for i in n:
if i not in dn:
dn[i]=1
else:
dn[i]+=1
for i in m:
if i not in dm:
dm[i]=1
else:
dm[i]+=1
f=ans=0
for i in dm:
if i not in dn:
f=1
break
else:
if dm[i]>dn[i]:
ans+=dn[i]
else:
ans+=dm[i]
if f==1:
print(-1)
else:
print(ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long read() {
long long x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
long long t, a, b, h;
long long f[60];
long long pow(long long x, int y) {
long long t = 1;
for (int i = 1; i <= y; i++) t *= x;
return t;
}
void solve(long long t, long long a) {
for (int i = h; i; i--) {
long long base = pow(t, i);
f[i] = a / base;
a %= base;
}
f[0] = a;
}
int main() {
t = read();
a = read();
b = read();
if (a == b && b == t) {
if (a == 1)
puts("inf");
else
puts("2");
} else if (a == b)
puts("1");
else {
if (t == 1) {
h = log(b) / log(a);
for (int i = 1; i <= h; i++)
if (pow(a, i) == b) {
puts("1");
return 0;
}
}
h = log(b) / log(a);
solve(a, b);
long long sum = 0;
for (int i = 0; i <= h; i++) sum += f[i] * pow(t, i);
if (sum != a)
puts("0");
else
puts("1");
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, i = 1, s, a[1111111];
priority_queue<long long> q;
int main() {
scanf("%lld", &n);
for (; i <= n; i++) {
scanf("%lld", a + i);
q.push(-a[i]);
q.push(-a[i]);
s += a[i] + q.top();
q.pop();
}
printf("%lld", s);
}
| 10 | CPP |
a=list((input()))
a=sorted(a)
a=a[::-1]
b=input()
if len(b)>len(a):
print("".join(a))
def highless(n):
temp="0"
lesser=False
for i in a:
if i<n and i>=temp:
temp=i
lesser=True
if lesser:
return temp
else:
return -1
c=[]
if len(a)==len(b):
for i in range(len(a)):
if b[i] in a:
c.append(b[i])
a.remove(b[i])
else:
val= highless(b[i])
if val!=-1:
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
else:
while val==-1:
last=c.pop()
a.append(last)
val=highless(last)
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
print("".join(c))
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PI = pair<LL, vector<int>>;
using PLI = pair<LL, int>;
double F[55][55][55];
bool D[55][55][55];
int main() {
int n;
vector<LL> A(55);
vector<int> B(55);
vector<int> P(55);
scanf("%d", &n);
for (int i = (1); i <= (n); ++i) scanf("%lld", &A[i]);
for (int i = (1); i <= (n); ++i) scanf("%d", &B[i]);
iota(P.begin(), P.end(), 0);
sort(P.begin() + 1, P.begin() + 1 + n,
[&](int i, int j) { return A[i] < A[j]; });
double l = 0.0, r = 1e8;
for (int run = (1); run <= (100); ++run) {
double m = (l + r) / 2;
vector<double> C(55);
for (int i = (1); i <= (n); ++i) C[i] = A[i] - B[i] * m;
memset(D, 0, sizeof D);
function<double(int, int, int)> dfs = [&](int p, int big, int same) {
double ans = 1e10;
if (p == 0) return 0.0;
int idx = P[p];
if (A[idx] != A[P[p + 1]]) big += same, same = 0;
if (D[p][big][same]) return F[p][big][same];
if (big) {
ans = min(ans, dfs(p - 1, big - 1, same));
}
ans = min(ans, dfs(p - 1, big, same + 1) + C[idx]);
D[p][big][same] = true;
return F[p][big][same] = ans;
};
double ans = dfs(n, 0, 0);
if (ans <= 0)
r = m;
else
l = m;
}
cout << LL(ceil(l * 1000)) << endl;
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long x, y, a, b;
cin >> x >> y >> a >> b;
if ((y - x) % (a + b) == 0)
cout << (y - x) / (a + b) << "\n";
else
cout << "-1\n";
}
return 0;
}
| 7 | CPP |
import math
for i in range(int(input())):
a,b,c,d=map(int,input().split())
if b>=a:
print(b)
elif d>=c:
print(-1)
else:
print(b+ math.ceil((a-b)/(c-d))*c) | 7 | PYTHON3 |
n=int(input())
x=[0]*(4*10**6+1)
bi=[*map(int,input().split())]
for i in range(n):
x[bi[i]-i]+=bi[i]
print(max(x)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char str[22][100100];
int M[22][100100];
int v[100100];
int n, m;
bool cmp(int a, int b) {
for (int i = 0; i < n; i++)
if (str[i][a] != str[i][b]) return str[i][a] < str[i][b];
return 0;
}
int qlast[1 << 22];
int mask[100100];
int coisa[100100][20];
int add[100100][20];
int pref[100100];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf(" %s", str[i]);
for (int i = 0; i < m; i++) v[i] = i;
sort(v, v + m, cmp);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
M[i][j] = (str[i][v[j]] == '1') ? 1 : 0;
;
};
}
int up = n / 2;
int down = n - up;
for (int j = 0; j < (1 << n); j++)
for (int i = up; i < n; i++)
if (j & (1 << i)) qlast[j]++;
for (int j = 0; j < m; j++)
for (int i = 0; i < n; i++) mask[j] += M[i][j] * (1 << i);
for (int i = 0; i < m; i++)
;
int filter = (1 << up) - 1;
int ans = (int)n * m;
for (int i = 0; i < (1 << down); i++) {
int qnt = 0;
int last = 0;
for (int j = 0; j < m; j++)
if (j == m - 1 || (mask[j] & filter) != (mask[j + 1] & filter)) {
;
pref[qnt] = (mask[j] & filter);
for (int k = 0; k < 20; k++) coisa[qnt][k] = 0;
for (int k = last; k <= j; k++) {
coisa[qnt][__builtin_popcount(((mask[k] >> up) ^ i))]++;
}
for (int k = 0; k <= up; k++) {
add[qnt][k] = 0;
for (int l = 0; l <= down; l++)
add[qnt][k] += (long long)coisa[qnt][l] * min(l + k, n - l - k);
;
}
last = j + 1;
qnt++;
}
for (int ii = 0; ii < (1 << up); ii++) {
int cur = 0;
for (int j = 0; j < qnt; j++)
cur += add[j][__builtin_popcount(pref[j] ^ ii)];
ans = min(ans, cur);
}
}
cout << ans << endl;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool dp[110][10010 * 2];
bool flag;
int ans[110];
int n, d, l;
void dfs(int nth, int val) {
int i;
if (flag == true) return;
if (dp[nth][val + 10010] == true) return;
if (dp[nth][val + 10010] == false) dp[nth][val + 10010] = true;
if (nth == 0) {
if (val == d) {
flag = true;
for (i = 0; i < n; i++) printf("%d ", ans[i]);
puts("");
}
return;
}
for (i = 1; i <= l; i++) {
ans[nth - 1] = i;
dfs(nth - 1, i - val);
}
}
int main() {
while (scanf("%d%d%d", &n, &d, &l) != EOF) {
flag = false;
memset(dp, 0, sizeof(dp));
dfs(n, 0);
if (flag == false) puts("-1");
}
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N, l, inf=100000000;
cin >> N >> l;
for(int i=1; i<=N; i++){
if(abs(inf)>abs(l+i-1)) inf = l+i-1;
}
cout << N*(l-1) + N*(N+1)/2 -inf << endl;
return 0;
} | 0 | CPP |
n, m = (int(i) for i in input().split())
S = list(input())
for _ in range(m):
l, r, c1, c2 = input().split()
l = int(l)-1
r = int(r)-1
for i in range(l, r+1):
if S[i] == c1:
S[i] = c2
print("".join(S))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int MOD = 1000000007;
bool lucky(int a) {
while (a > 0) {
if (a % 10 != 4 && a % 10 != 7) return false;
a /= 10;
}
return true;
}
long long D[5][1100];
long long F[100047], I[100047];
long long umocni(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b % 2 == 1) res = (res * a) % MOD;
a *= a;
a %= MOD;
b /= 2;
}
return res;
}
void precompute() {
F[0] = 1;
for (int i = 1; i < 100042; i++) F[i] = (F[i - 1] * i) % MOD;
for (int i = 0; i < (100042); i++) I[i] = umocni(F[i], MOD - 2);
}
long long comb(int n, int k) {
if (k > n) return 0;
long long res = F[n] * I[k];
res %= MOD;
res *= I[n - k];
return res % MOD;
}
int main() {
precompute();
int n, k;
scanf("%d %d", &n, &k);
int un = 0;
map<int, int> M;
for (int i = 0; i < (n); i++) {
int x;
scanf(" %d", &x);
if (lucky(x))
M[x]++;
else
un++;
}
vector<int> A;
for (map<int, int>::iterator it = M.begin(); it != M.end(); it++)
A.push_back((*it).second);
D[0][0] = D[1][0] = 1;
for (int i = 1; i <= A.size(); i++)
for (int j = 1; j <= i; j++) {
D[i % 2][j] = D[(i + 1) % 2][j];
D[i % 2][j] += D[(i + 1) % 2][j - 1] * (long long)A[i - 1];
D[i % 2][j] %= MOD;
}
long long res = 0;
for (int i = 0; i < (min((int)A.size() + 1, k + 1)); i++) {
res += D[A.size() % 2][i] * comb(un, k - i);
res %= MOD;
}
cout << res << endl;
return 0;
}
| 9 | CPP |
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
s = sum(a)
if s%n == 0:
print(int(s/n))
else:
print(int((s/n)+1))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int cnt[3 * 100000];
void push(int &id_max) {
while (!cnt[id_max]) --id_max;
}
int main() {
int n, s;
cin >> n >> s;
int id_max = 0;
int ans = 0;
int cnt_mstk = 0;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
if (i != s - 1) {
if (x == 0) {
++cnt_mstk;
++ans;
} else {
cnt[x]++;
id_max = max(id_max, x);
}
} else {
cnt[0]++;
if (x != 0) {
++ans;
}
}
}
for (int i = 1; i < id_max; ++i) {
if (!cnt[i]) {
if (cnt_mstk) {
cnt[i] = 1;
--cnt_mstk;
} else {
cnt[id_max]--;
cnt[i] = 1;
++ans;
push(id_max);
}
}
}
cout << ans << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b;
int i = 2;
while (i <= n) {
a.push_back(i);
i += 2;
}
i = 1;
while (i <= n) {
a.push_back(i);
i += 2;
}
i = 2;
while (i <= n) {
a.push_back(i);
i += 2;
}
i = 1;
while (i <= n) {
b.push_back(i);
i += 2;
}
i = 2;
while (i <= n) {
b.push_back(i);
i += 2;
}
i = 1;
while (i <= n) {
b.push_back(i);
i += 2;
}
if (a.size() < b.size()) {
cout << a.size() << "\n";
for (int i = 0; i < a.size(); i++) cout << a[i] << " ";
cout << "\n";
} else {
cout << b.size() << "\n";
for (int i = 0; i < b.size(); i++) cout << b[i] << " ";
cout << "\n";
}
cout << "\n";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
template <class T>
ostream& operator<<(ostream& os, vector<T> V) {
os << "[ ";
for (auto v : V) os << v << " ";
return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> P) {
return os << "(" << P.first << "," << P.second << ")";
}
template <typename T, typename U>
pair<T, U> operator+(const pair<T, U>& l, const std::pair<T, U>& r) {
return {l.first + r.first, l.second + r.second};
}
const long long int mod = 1e9 + 7;
const int maxn = 3005;
long long int a[maxn];
long long int dp[maxn][maxn];
vector<long long int> f[maxn];
long long int n;
long long int solve(long long int l, long long int r) {
if (l == r) return 0;
if (l == r - 1) return (a[l] != a[r]);
long long int& res = dp[l][r];
if (res != -1) return res;
res = r - l;
res = min(res, 1 + solve(l + 1, r));
res = min(res, 1 + solve(l, r - 1));
for (auto v : f[a[l]]) {
if (v > l and v <= r) {
res = min(res, solve(l, v - 1) + solve(v, r));
}
}
return res;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t;
cin >> t;
while (t--) {
cin >> n;
for (long long int i = 0; i <= n; i++) f[i].clear();
for (long long int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
f[a[i]].push_back(i);
for (long long int j = i; j < n; j++) dp[i][j] = -1;
}
cout << solve(0, n - 1) << '\n';
}
}
| 9 | CPP |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 200000
using namespace std;
int seq[MAXN+5],cnt[MAXN+5],N,M;
int A[MAXN+5];
int main()
{
scanf("%d %d",&N,&M);
for(int i=1;i<=N;i++)
scanf("%d",&seq[i]),cnt[seq[i]]++;
for(int i=1;i<=N;i++)
for(int j=max(1,i-cnt[i]+1);j<=i;j++)
A[j]++;
int ans=0;
for(int i=1;i<=N;i++)
if(A[i]==0)
ans++;
int X,Y;
for(int i=1;i<=M;i++)
{
scanf("%d %d",&X,&Y);
if(seq[X]-cnt[seq[X]]+1>=1)
{
A[seq[X]-cnt[seq[X]]+1]--;
if(A[seq[X]-cnt[seq[X]]+1]==0)
ans++;
}
cnt[seq[X]]--;
seq[X]=Y;
cnt[seq[X]]++;
if(seq[X]-cnt[seq[X]]+1>=1)
{
if(A[seq[X]-cnt[seq[X]]+1]==0)
ans--;
A[seq[X]-cnt[seq[X]]+1]++;
}
printf("%d\n",ans);
}
return 0;
} | 0 | CPP |
#include<iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if((y&1) || (2*x > y) || (y > x*4)) cout << "No\n";
else cout << "Yes\n";
return 0;
} | 0 | CPP |
"""
Solution using dictionary
"""
""" t = int(input())
for case in range(t):
n = int(input())
arr = list(map(int, input().split()))
right_pairs = dict()
result = 0
for i in range(n-1, -1, -1):
for j in range(i+2, n):
if (arr[i+1], arr[j]) in right_pairs:
right_pairs[(arr[i+1], arr[j])] += 1
else:
right_pairs[(arr[i+1], arr[j])] = 1
for j in range(0, i):
if (arr[j], arr[i]) in right_pairs:
result += right_pairs[(arr[j], arr[i])]
print(result) """
"""
Solution using array
"""
def compress(arr):
arr2 = sorted(arr)
order = dict()
length = len(arr)
for i in range(length):
order[arr2[i]] = i
arr3 = [0] * length
for i in range(length):
arr3[i] = order[arr[i]]
return arr3
t = int(input())
for case in range(t):
n = int(input())
arr = list(map(int, input().split()))
arr = compress(arr)
right_pairs = [0]*((n+1)*(n+1))
result = 0
for i in range(n-1, -1, -1):
for j in range(i+2, n):
right_pairs[arr[i+1]*n + arr[j]] += 1
for j in range(0, i):
result += right_pairs[arr[j]*n + arr[i]]
print(result) | 10 | PYTHON3 |
from sys import stdin
A = int(stdin.readline())
for t in range(0,A):
B = int(stdin.readline())
C = list(map(int,stdin.readline().split()))
S = list()
if B==1:
print('YES')
continue
else:
for t in range(1,B):
S.append(C[t]-C[t-1])
S.append(C[0]-C[B-1])
T=set(S)
TT=list(T)
TT.sort()
if len(T)!=2:
print('NO')
else:
if TT[0]==-1 and (TT[1]==B-1 and S.count(-1)==B-1):
print('YES')
elif TT[0]==-(B-1) and (TT[1]==1 and S.count(1)==B-1):
print('YES')
else:
print('NO') | 7 | PYTHON3 |
I = lambda: map(int, input().split())
n, k = I()
fs = []
sc = []
Min = 1e9
for i in range(n):
c, t = I()
Min = min(c, Min)
if t == 1 :
fs += [(c, i+1)]
else:
sc += [(c, i+1)]
fs = sorted(fs, reverse = True)
z = [[] for i in range(k)]
sz = 0
ans = 0
for c, i in fs:
z[sz] += [i]
if sz < k-1:
ans += c
sz += 1
else:
ans += 2*c
for c, i in sc:
z[sz] += [i]
ans += 2*c
if sz < k-1:
sz += 1
if len(fs) >= k:
ans -= Min
print("%.1f"%(1.0*ans/2.0))
for i in z:
print(len(i), end = ' ')
for j in range(len(i)):
if j==len(i)-1:
print(i[j])
else:
print(i[j], end = ' ') | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void chmin(T &a, const T &val) {
if (a > val) a = val;
}
template <class T>
inline void chmax(T &a, const T &val) {
if (a < val) a = val;
}
template <class T>
long long sqr(T a) {
return 1ll * a * a;
}
template <class T>
void compress(T &a) {
sort(a.begin(), a.end());
a.resize(unique(a.begin(), a.end()) - a.begin());
}
const double pi = acos(-1.00);
const double eps = 1e-6;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int dx[4] = {0, 0, -1, 1};
const int dy[4] = {-1, 1, 0, 0};
int m, cnt[71], s[71];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> m;
for (int i = 1; i <= m; i++) {
int x;
cin >> x;
cnt[x]++;
}
vector<int> p;
auto isPrime = [&](int x) {
for (int i = 2; i * i <= x; i++)
if (x % i == 0) return false;
return true;
};
for (int i = 2; i <= 70; i++) {
if (isPrime(i)) p.push_back(i);
}
for (int i = 1; i <= 70; i++) {
int mask = 0;
int x = i;
for (int j = 0; j < p.size(); j++) {
int y = p[j];
while (x % y == 0) {
x /= y;
mask ^= (1 << j);
}
}
s[i] = mask;
}
vector<int> P2(m + 1, 1);
for (int i = 1; i <= m; i++) P2[i] = P2[i - 1] * 2 % MOD;
int n = p.size();
vector<vector<int>> dp(71, vector<int>(1 << n, 0));
dp[0][0] = 1;
for (int i = 1; i <= 70; i++) {
for (int mask = 0; mask < (1 << n); mask++) {
if (cnt[i] == 0) {
dp[i][mask] += dp[i - 1][mask];
dp[i][mask] %= MOD;
} else {
dp[i][mask] += 1ll * dp[i - 1][mask] * P2[cnt[i] - 1] % MOD;
dp[i][mask] %= MOD;
dp[i][mask] += 1ll * dp[i - 1][mask ^ s[i]] * P2[cnt[i] - 1] % MOD;
dp[i][mask] %= MOD;
}
}
}
cout << (dp[70][0] - 1 + MOD) % MOD;
return 0;
}
| 9 | CPP |
n=int(input())
s=input()
st={}
m=0
ma=''
for i in range(n-1):
a=s[i]+s[i+1]
if a in st:
st[a]+=1
else:
st[a]=1
if st[a]>m:
m=st[a]
ma=a
print(ma)
| 8 | PYTHON3 |
d = int(input())
a = sorted([int(_) for _ in input().split()])
print(max(d-a.count(max(a))-a.count(min(a)),0))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = (int)1e17;
int main() {
cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
cout.setf(std::ios_base::fixed);
cout.precision(20);
int n;
cin >> n;
vector<int> dp(n + 1);
dp[1] = 1;
dp[2] = 2;
for (int i = 3; i <= n; i++) {
dp[i] = i + dp[i - 2];
}
cout << dp[n];
return 0;
}
| 8 | CPP |
n,k=map(int,input().split())
if(k<int(n/2) or (n==1 and k>0)):
print(-1)
elif(n==1):
print(1)
else:
v=[]
v.append(k-int(n/2)+1)
v.append(2*(k-int(n/2)+1))
i=1
while(len(v)<n):
if(i!=v[0] and i!=v[1]):
v.append(i)
i=i+1
f=0
for i in v:
if(i>1000000000):
f=1
print(-1)
if(f==0):
for i in v:
print(i,end=" ")
| 7 | PYTHON3 |
n, d, h = map(int, input().split())
if (d-h > h) or (h == 1 and n >= 4 and d != 2) or (h == 1 and n == 3 and d == 1):
print(-1)
exit()
c = 1
for i in range(h):
print(c, c+1)
c += 1
if (c < n and d-h != 0):
print(1, c+1)
c += 1
for i in range(d-h-1):
print(c, c+1)
c += 1
while (c < n):
if h == 1 and (d-h != 0):
print(1, c+1)
else:
print(2, c+1)
c += 1
| 9 | PYTHON3 |
Subsets and Splits