solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
string days[] = {"monday", "tuesday", "wednesday", "thursday", "friday",
"saturday", "sunday", "monday", "tuesday", "wednesday"};
int k = 0, m = -1, month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
string a, b;
cin >> a >> b;
if (a == b) return cout << "YES", 0;
for (int i = 0; i < 7; i++)
if (days[i] == a) k = i;
if (days[k + 2] == b || days[k + 3] == b) return cout << "YES", 0;
cout << "NO";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int p[100000];
int from[100000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
from[p[i] - 1] = i;
}
int maxSeq = 1;
int curSeq = 1;
for (int i = 1; i < n; i++) {
if (from[i] > from[i - 1]) {
curSeq++;
} else {
if (maxSeq < curSeq) maxSeq = curSeq;
curSeq = 1;
}
}
if (maxSeq < curSeq) maxSeq = curSeq;
if (maxSeq < curSeq) maxSeq = curSeq;
cout << n - maxSeq;
return 0;
}
| 9 | CPP |
n = int(input())
answer = 0
i = 1
while(i*i < n):
if(n%i == 0):
answer += 2
i += 1
if(i*i == n):
answer += 1
print(answer) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 1) {
cout << 1 << " " << 1 << endl;
cout << -a[0] << endl;
int k = 2;
while (k--) {
cout << 1 << " " << 1 << endl;
cout << 0 << endl;
}
} else {
cout << 1 << " " << 1 << endl;
cout << (n - 1) * a[0] << endl;
a[0] = n * a[0];
cout << 2 << " " << n << endl;
for (int i = 1; i < n; i++) {
cout << a[i] * (n - 1) << " ";
a[i] += a[i] * (n - 1);
}
cout << endl;
cout << 1 << " " << n << endl;
for (int i = 0; i < n; i++) {
cout << -a[i] << " ";
}
cout << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
}
| 9 | CPP |
from sys import stdin, stdout, setrecursionlimit
input = stdin.readline
# setrecursionlimit(int(1e6))
inf = float('inf')
from functools import cmp_to_key
from collections import defaultdict as dd
from collections import Counter, deque
from heapq import *
import math
from math import floor, ceil, sqrt
def geti(): return map(int, input().strip().split())
def getl(): return list(map(int, input().strip().split()))
def getis(): return map(str, input().strip().split())
def getls(): return list(map(str, input().strip().split()))
def gets(): return input().strip()
def geta(): return int(input())
def print_s(s): stdout.write(s+'\n')
from itertools import permutations as perm
def calc(a):
cost = 0
index = dd(list)
n = len(a)
for i in range(n):
index[a[i]].append(i)
# for i in sorted(index):
# print(i, index[i])
n //= 2
for i in range(1, n+1):
# print(i)
d = index[i][1] - index[i][0]
cost += (n - i)*abs(d + i - n)
return cost
def solve():
n = geta()
diff = n - 1
ans = [0]*(2*n)
index = 0
for i in range(1, n, 2):
# print(ans)
ans[index] = i
ans[index + diff] = i
diff -= 2
while index < 2*n and ans[index]:
index += 1
if index == 2*n:
break
# print(ans)
index = n
diff = n - 2
for i in range(2, n, 2):
ans[index] = i
ans[index + diff] = i
diff -= 2
while index < 2*n and ans[index]:
index += 1
for i in range(2*n):
if not ans[i]:
ans[i] = n
# for _ in range(20):
# temp = getl()
# print(*temp)
print(*ans)
# print(calc(ans))
if __name__=='__main__':
solve()
| 10 | PYTHON3 |
from fractions import gcd
n=int(input())
c=list(map(int,input().split()))
a=[c[0]]
b=[c[-1]]
for i in c[1:]:
a.append(gcd(a[-1],i))
for i in c[:-1][::-1]:
b.append(gcd(b[-1],i))
b=b[::-1]+[a[-2]]
a=[b[1]]+a
k=1
for i in range(n):
k=max(k,gcd(a[i],b[i+1]))
print(k) | 0 | PYTHON3 |
n = int(input())
if n >= 0:
print(n)
exit()
n = list(str(n))
if n[-1] > n[-2]:
n.pop()
else:
n.pop(-2)
print(int(''.join(map(str, n))))
| 7 | PYTHON3 |
n=int(input())
m=input().split()
t=0
t2=0
t3=0
for i in range(len(m)):
m[i]=int(m[i])
m=sorted(m)
#print(m)
for i in range(n):
t=t+m[i]
#print(t)
i=0
if i<=n:
while t2<=(t/2):
t2=t2+m[n-(i+1)]
#print(t2)
t3=t3+1
#print(t3)
i=i+1
print(t3)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
long long dp[31][31][51];
long long solve(long long n, long long m, long long k) {
if (n * m == k || !k) return 0;
if (dp[n][m][k] != -1) return dp[n][m][k];
long long &res = dp[n][m][k];
res = inf;
for (long long i = 1; i < n; i++) {
if ((n - i) * m >= k) res = min(res, m * m + solve(n - i, m, k));
if (i * m <= k && (n - i) * m >= k - i * m)
res = min(res, m * m + solve(n - i, m, k - ((i)*m)));
}
for (long long i = 1; i < m; i++) {
if ((m - i) * n >= k) res = min(res, n * n + solve(n, m - i, k));
if (i * n <= k && (m - i) * n >= k - i * n)
res = min(res, n * n + solve(n, m - i, k - ((i)*n)));
}
return res;
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
memset(dp, -1, sizeof(dp));
long long t;
cin >> t;
while (t--) {
long long n, m, k;
cin >> n >> m >> k;
cout << solve(n, m, k) << '\n';
}
}
| 11 | CPP |
NumberOfForces = int(input())
sum1=0
sum2=0
sum3=0
for i in range(0,NumberOfForces):
temp=input().split()
sum1 += int(temp[0])
sum2 += int(temp[1])
sum3 += int(temp[2])
if(sum1==0 & sum2==0 & sum3==0):
print("YES")
else:
print("NO") | 7 | PYTHON3 |
n = int(input())
x = list(map(int,input().split()))
even = []
odd = []
for i in range (len(x)):
if x[i] % 2 == 0:
even.append(x[i])
else:
odd.append(x[i])
if len(odd) == 1:
for i in range(len(x)):
if odd[0] == x[i]:
print(i+1)
if len(even) == 1:
for i in range(len(x)):
if even[0] == x[i]:
print(i+1) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long ara[1000][1000];
vector<long long> v;
long long room(long long f, long long i, long long j) {
if (ara[i][j] == -1) {
return 0;
}
char bin[5] = "0000";
long long c, d, k = 3, l, x = 0;
c = ara[i][j];
do {
bin[k] = (c % 2) + '0';
c /= 2;
k--;
} while (c != 0);
if (f != -1) {
if (bin[f] == '1') {
ara[i][j] = -1;
return 0;
}
}
ara[i][j] = -1;
for (k = 0; k < 4; k++) {
if (k != f) {
if (bin[k] == '0') {
if (k == 0) {
x += room(2, i - 1, j);
} else if (k == 1) {
x += room(3, i, j + 1);
} else if ((k == 2)) {
x += room(0, i + 1, j);
} else if ((k == 3)) {
x += room(1, i, j - 1);
}
}
}
}
return x + 1;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n, m, i, j, c, d, s = 0;
cin >> n >> m;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> ara[i][j];
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (ara[i][j] != -1) {
v.push_back(room(-1, i, j));
}
}
}
sort(v.begin(), v.end(), greater<long long>());
d = v.size();
for (i = 0; i < d; i++) {
cout << v[i] << " ";
}
cout << '\n';
return 0;
}
| 16 | CPP |
word = list(input())
test = [i.upper() for i in word[1:]]
check = sum(x == y for x,y in zip(word[1:], test))
if check == len(test):
print(''.join(word).swapcase())
else:
print(''.join(word)) | 7 | PYTHON3 |
t=int(input())
for tt in range(t):
n=int(input())
a=list(map(int,input().split()))
s=set()
ans=False
for i in range(n-1):
if(a[i]==n):
s.add(n)
else:
if(a[i]+1 not in s and a[i+1]!=a[i]+1):
ans=True
break
else:
s.add(a[i])
if(ans==True):
print("No")
else:
print("Yes")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, a[100001], b[100001], c[100001];
long long ans;
int main() {
cin >> n >> m >> k;
for (int i = 0; i < m; ++i) {
scanf("%d%d%d", &a[i], &b[i], &c[i]);
}
ans = 0;
int x;
for (int i = 0; i < k; ++i) {
cin >> x;
for (int j = 0; j < m; ++j) {
if (a[j] <= x && x <= b[j]) {
ans += c[j] + x - a[j];
}
}
}
cout << ans;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int small;
int biga = 0;
int bigb = 0;
if (a == 1000) {
biga = 1;
} else if (a >= 100) {
biga = a / 100;
if (biga < (a / 10) % 10) biga = (a / 10) % 10;
if (biga < a % 10) biga = a % 10;
} else if (a >= 10) {
biga = a / 10;
if (biga < a % 10) biga = a % 10;
} else if (a >= 1)
biga = a;
if (b == 1000) {
bigb = 1;
} else if (b >= 100) {
bigb = b / 100;
if (bigb < (b / 10) % 10) bigb = (b / 10) % 10;
if (bigb < b % 10) bigb = b % 10;
} else if (b >= 10) {
bigb = b / 10;
if (bigb < b % 10) bigb = b % 10;
} else if (b >= 1)
bigb = b;
if (biga > bigb)
small = biga;
else
small = bigb;
int basis = small + 1;
int sum = a + b;
int length;
string s;
s[0] = 0;
if (sum >= 1000) {
s[1] = sum / 1000;
s[2] = (sum / 100) % 10;
s[3] = (sum / 10) % 10;
s[4] = sum % 10;
length = 4;
} else if (sum >= 100) {
s[1] = (sum / 100) % 10;
s[2] = (sum / 10) % 10;
s[3] = sum % 10;
length = 3;
} else if (sum >= 10) {
s[1] = (sum / 10) % 10;
s[2] = sum % 10;
length = 2;
} else if (sum >= 1) {
s[1] = sum;
length = 1;
}
for (int i = length; i >= 1; i--) {
if (s[i] >= basis) s[i - 1]++;
}
if (s[0] == 1) length++;
cout << length << '\n';
return 0;
}
| 8 | CPP |
#include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
typedef pair<int,int> ii;
struct Data{
int id,stamp;
bool operator < ( const Data& data ) const {
if( stamp != data.stamp ) return stamp > data.stamp;
return id > data.id;
}
};
vector<ii> cycle[110];
int n,m,run_time[110],indices[110],charger,charge_id;
bool inQueue[110];
//char debug[110][1000000];
int simulate(){
//rep(i,110) rep(j,1000000) debug[i][j] = '?';
rep(i,n) run_time[i] = cycle[i][0].first, indices[i] = 0, inQueue[i] = false;
charger = 0, charge_id = -1;
priority_queue<Data> Q;
int ret = 0;
rep(_,m){
rep(i,n) {
if( run_time[i] <= 0 && !inQueue[i] ) {
Q.push((Data){i,_});
inQueue[i] = true;
}
run_time[i]--;
}
if( charger == 0 && !Q.empty() ) {
charge_id = Q.top().id; Q.pop();
charger = cycle[charge_id][indices[charge_id]].second;
}
if( charger ) {
--charger;
if( charger <= 0 ) {
inQueue[charge_id] = false;
( indices[charge_id] += 1 ) %= (int)cycle[charge_id].size();
run_time[charge_id] = cycle[charge_id][indices[charge_id]].first;
charge_id = -1;
}
}
/*
rep(i,n) if( inQueue[i] ) {
debug[i][_] = '-';
if( i == charge_id ) debug[i][_] = '.';
} else debug[i][_] = '*';
*/
ret += (int)Q.size();
}
/*
rep(i,n){
rep(j,m){
cout << debug[i][j];
}
cout << endl;
}
*/
return ret;
}
int main(){
while( cin >> n >> m, n | m ){
rep(i,n) {
int a,b;
cycle[i].clear();
while( cin >> a , a ){
cin >> b;
cycle[i].push_back(ii(a,b));
}
}
cout << simulate() << endl;
}
return 0;
} | 0 | CPP |
def get_user_name(user_name):
if user_name in reg_users.keys():
reg_users[user_name] += 1
return user_name + str(reg_users[user_name])
else:
reg_users[user_name] = 0
return 'OK'
num_of_users = int(input())
reg_users = {}
users = []
for _ in range(num_of_users):
users.append(input())
for user in users:
print(get_user_name(user)) | 9 | PYTHON3 |
n=int(input())
l=[0 for i in range(n)]
for _ in range(n):
a=[int(i) for i in input().split()]
l[_]=a
count=0
for i in range(n):
a=0;b=0;c=0;d=0
for j in range(n):
if l[i][0]>l[j][0] and l[i][1]==l[j][1]:
a=1
elif l[i][0]<l[j][0] and l[i][1]==l[j][1]:
b=1
elif l[i][0]==l[j][0] and l[i][1]<l[j][1]:
c=1
elif l[i][0]==l[j][0] and l[i][1]>l[j][1]:
d=1
if a==1 and b==1 and c==1 and d==1:
count+=1
break
print(count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 1007681537;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-6;
pair<int, int> drag[1002];
bool cmpr(pair<int, int> a, pair<int, int> b) {
if (a.first == b.first) return a.second > b.second;
return a.first < b.first;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int s, n;
cin >> s >> n;
for (int i = (0); i < (n); ++i) cin >> drag[i].first >> drag[i].second;
sort(drag, drag + n, cmpr);
for (int i = (0); i < (n); ++i) {
if (s <= drag[i].first) {
cout << "NO" << '\n';
return 0;
}
s += drag[i].second;
}
cout << "YES" << '\n';
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
int n;
vector<int> graf[MAXN + 3];
bool odw[MAXN + 3];
int st[MAXN + 3], color[MAXN + 3];
int wyn[MAXN + 3], ind;
void wczytaj() {
scanf("%d", &n);
for (int i = 0; i < 2 * n; i++) {
int a, b;
scanf("%d %d", &a, &b);
graf[a].push_back(b);
graf[b].push_back(a);
st[a]++;
st[b]++;
}
}
bool check_st() {
for (int i = 1; i <= n; i++)
if (st[i] != 4) return false;
return true;
}
inline bool check_neighbours(int v, int u) {
int licznik = 0;
for (int i = 0; i < 4; i++)
if (color[graf[u][i]] == v) licznik++;
if (licznik == 2) return true;
return false;
}
void dfs(int v) {
odw[v] = true;
wyn[ind++] = v;
for (int i = 0; i < 4; i++) color[graf[v][i]] = v;
for (int i = 0; i < 4; i++) {
int u = graf[v][i];
if (!odw[u] && check_neighbours(v, u)) dfs(u);
}
}
inline bool check_connect(int v, int x, int y) {
bool spr = false;
for (int i = 0; i < 4; i++)
if (graf[v][i] == x) {
spr = true;
break;
}
if (!spr) return false;
spr = false;
for (int i = 0; i < 4; i++)
if (graf[v][i] == y) {
spr = true;
break;
}
return spr;
}
inline bool check_connect(int v, int x) {
bool spr = false;
for (int i = 0; i < 4; i++)
if (graf[v][i] == x) {
spr = true;
break;
}
return spr;
}
void brut() {
int t[10];
for (int i = 1; i <= n; i++) t[i] = i;
do {
bool spr = true;
spr = check_connect(t[1], t[n]);
for (int i = 2; i <= n && spr; i++) spr = check_connect(t[i], t[i - 1]);
for (int i = 1; i <= n && spr; i++) {
int p = (i - 2 >= 1) ? i - 2 : i + n - 2;
int k = (i + 2 <= n) ? i + 2 : i - n + 2;
spr = check_connect(t[i], t[p], t[k]);
}
if (spr) {
for (int i = 1; i <= n; i++) printf("%d ", t[i]);
puts("");
return;
}
} while (next_permutation(t + 1, t + n + 1));
}
int main() {
wczytaj();
if (!check_st()) {
puts("-1");
return 0;
}
if (n > 6) {
dfs(1);
if (ind != n)
puts("-1");
else {
for (int i = 0; i < n; i++) printf("%d ", wyn[i]);
puts("");
}
} else
brut();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct node {
double x, y;
bool operator<(const node& a) const {
if (x == a.x) return y < a.y;
return x < a.x;
}
};
node num[100005];
node zd(node a, node b) {
node tmp;
tmp.x = (a.x + b.x) / 2;
tmp.y = (a.y + b.y) / 2;
return tmp;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) scanf("%lf%lf", &num[i].x, &num[i].y);
sort(num, num + n);
if (n % 2 == 1) {
cout << "NO";
return 0;
}
node t = zd(num[0], num[n - 1]);
for (int i = 1; i < n / 2; i++) {
node tmp = zd(num[i], num[n - 1 - i]);
if (tmp.x != t.x || tmp.y != t.y) {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool isPowerOfTwo(int x) { return (x && !(x & (x - 1))); }
bool is_prime(int n) {
if (n == 1) return false;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
void solve() {
int n;
cin >> n;
long long int a, b;
cin >> a >> b;
set<long long int> st;
st.insert(a);
st.insert(b);
for (int i = 2; i * i <= a; i++) {
if (a % i == 0) {
st.insert(i);
st.insert(a / i);
}
}
for (int i = 2; i * i <= b; i++) {
if (b % i == 0) {
st.insert(i);
st.insert(b / i);
}
}
map<pair<long long int, long long int>, long long int> ch;
ch[{a, b}]++;
for (int i = 1; i < n; i++) {
cin >> a >> b;
if (ch[{a, b}] >= 1) continue;
ch[{a, b}]++;
for (auto it = st.begin(); it != st.end();) {
long long int k = *it;
if (a % k == 0 || b % k == 0) {
it++;
} else {
it = st.erase(it++);
}
}
}
if (st.empty())
cout << "-1";
else
cout << (*st.begin());
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
while (t--) {
solve();
}
return 0;
}
| 8 | CPP |
n = int(input())
l = []
for i in range(n):
l.append([int(x) for x in input().split()])
l.sort(key = lambda x: (-x[1], -x[0]))
a = 0
b = 1
ptr = 0
while b and ptr < n:
b -= 1
a += l[ptr][0]
b += l[ptr][1]
ptr += 1
print(a) | 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int n,k;
int a[200002];
long long ans=0;
int main(){
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
sort(a+1,a+n+1);
for(int i=1;i<=n-k;i++) ans+=a[i];
printf("%lld\n",ans);
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
long long x0, y0, x, y;
cin >> a >> b >> c >> x0 >> y0 >> x >> y;
c += a * x0;
c += b * y0;
c = -c;
x -= x0;
y -= y0;
if (x < 0) a = -a, x = -x;
if (y < 0) b = -b, y = -y;
if (c < 0) a = -a, b = -b, c = -c;
if (!x || !y || a * b >= 0)
printf("%.12f\n", 1.0 * (x + y));
else {
double u = min(1.0 * x, max(0., 1.0 * c / a)),
v = max(0., min(1.0 * x, 1.0 * (c - b * y) / a)),
uu = 1.0 * (c - a * u) / b, vv = 1.0 * (c - a * v) / b;
printf("%.12f\n", u + uu + sqrt((v - u) * (v - u) + (vv - uu) * (vv - uu)) +
x + y - v - vv);
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3;
long long bit[N][N], gar[N][N];
vector<pair<int, pair<int, int>>> light[N];
vector<int> req;
int n, m, k, on[N];
struct Query {
int x1, y1, s;
int x2, y2;
} query[1000000];
long long sum(int x, int y) {
long long ret = 0;
for (int i = x; i >= 0; i = (i & (i + 1)) - 1)
for (int j = y; j >= 0; j = (j & (j + 1)) - 1) ret += bit[i][j];
return ret;
}
void update(int x, int y, int delta) {
for (int i = x; i < n; i = i | (i + 1))
for (int j = y; j < m; j = j | (j + 1)) bit[i][j] += delta;
}
int main() {
int q;
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < k; ++i) {
int len;
scanf("%d", &len);
on[i] = 1;
for (int j = 0; j < len; ++j) {
int x, y, w;
scanf("%d%d%d", &x, &y, &w);
light[i].push_back({x - 1, {y - 1, w}});
}
}
scanf("%d", &q);
for (int i = 0; i < q; ++i) {
char str[7];
scanf("%s", str);
if (strcmp(str, "SWITCH") == 0) {
int g;
scanf("%d", &g);
query[i].s = g - 1;
} else {
int x1, y1, x2, y2;
scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
query[i].s = -1;
query[i].x1 = x1 - 1;
query[i].x2 = x2 - 1;
query[i].y1 = y1 - 1;
query[i].y2 = y2 - 1;
req.push_back(i);
}
}
for (int i = 0; i < k; ++i) {
for (auto it : light[i])
update(it.first, it.second.first, it.second.second);
int j = 0;
for (int it : req) {
int x1 = query[it].x1;
int x2 = query[it].x2;
int y1 = query[it].y1;
int y2 = query[it].y2;
long long Sum =
sum(x2, y2) - sum(x2, y1 - 1) - sum(x1 - 1, y2) + sum(x1 - 1, y1 - 1);
gar[i][j++] = Sum;
}
for (auto it : light[i])
update(it.first, it.second.first, -it.second.second);
}
int j = 0;
for (int i = 0; i < q; ++i) {
if (query[i].s != -1)
on[query[i].s] = 1 - on[query[i].s];
else {
long long ans = 0;
for (int r = 0; r < k; ++r)
if (on[r]) ans += gar[r][j];
j++;
printf("%lld\n", ans);
}
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long llINF = 9223372036854775807;
const int INF = 2147483647;
const int maxn = 2e5 + 7;
const int maxm = 1e6 + 7;
const long long mod = 998244353;
const double pi = acos(-1.0);
const double eps = 1e-9;
long long n, m;
long long p[maxn];
long long fac[maxn];
long long tree[maxn];
long long lowbit(long long k) { return k & -k; }
void add(long long x, long long k) {
while (x <= n) {
tree[x] += k;
x += lowbit(x);
}
}
long long sum(long long x) {
long long ans = 0;
while (x != 0) {
ans += tree[x];
x -= lowbit(x);
}
return ans;
}
bool vis[maxn];
vector<long long> v;
long long poww(long long a, long long b) {
long long ans = 1, base = a;
while (b != 0) {
if (b & 1 != 0) ans = (ans * base) % mod;
base = (base * base) % mod;
b >>= 1;
}
return ans;
}
long long ans;
int main(int argc, char const *argv[]) {
fac[0] = 1;
for (long long i = 1; i < maxn; i++) fac[i] = (fac[i - 1] * i) % mod;
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &p[i]);
if (p[i] != -1) vis[p[i]] = 1;
}
for (long long i = 1; i <= n; i++)
if (!vis[i]) v.push_back(i);
m = v.size();
sort(v.begin(), v.end());
long long cnt = 0;
for (int i = 1; i <= n; i++) {
if (p[i] != -1) {
long long rk = n - p[i] + 1;
cnt = (cnt + sum(rk)) % mod;
add(rk, 1);
}
}
ans = (ans + (cnt * fac[m]) % mod) % mod;
long long tmp =
(((m * (m - 1)) % mod * fac[m]) % mod * poww(4, mod - 2)) % mod;
ans = (ans + tmp) % mod;
long long k = 0;
for (int i = n; i >= 1; i--) {
if (p[i] != -1) {
long long s = lower_bound(v.begin(), v.end(), p[i]) - v.begin();
ans = (ans + ((k * s) % mod * fac[m - 1]) % mod) % mod;
} else
k++;
}
k = 0;
for (int i = 1; i <= n; i++) {
if (p[i] != -1) {
long long s = v.end() - upper_bound(v.begin(), v.end(), p[i]);
ans = (ans + ((k * s) % mod * fac[m - 1]) % mod) % mod;
} else
k++;
}
ans = (ans * poww(fac[m], mod - 2)) % mod;
printf("%lld\n", ans);
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
struct Data {
ll a, b;
bool operator< (const Data &other) const {
if(a == other.a)
return (b < other.b);
return ((a * (other.b + 1)) > (other.a * (b + 1)));
}
};
int main() {
//freopen("a.in", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
ll t;
cin >> n >> t;
vector<Data> v(n + 1, {0, 0});
for(int i = 1; i <= n; i ++)
cin >> v[i].a >> v[i].b;
sort(v.begin() + 1, v.end());
int m = n;
n = 1;
while(n <= m && v[n].a != 0)
n ++;
n --;
int lim = 5;
if(t > 0)
lim = (int)log2(t) + 5;
vector<vector<ll>> dp(n + 1, vector<ll> (lim + 1, t + 5));
dp[0][0] = 0;
for(int i = 1; i <= n; i ++) {
dp[i][0] = 0;
for(int j = 1; j <= min(lim, i); j ++)
dp[i][j] = min(dp[i - 1][j], (dp[i - 1][j - 1] + 1) * (v[i].a + 1) + v[i].b);
}
int ans = 0;
for(int i = 0; i <= lim; i ++) {
int j = n + 1;
while(j <= m && dp[n][i] + 1 + v[j].b <= t) {
dp[n][i] += (1 + v[j].b);
j ++;
}
if(dp[n][i] <= t)
ans = max(ans, i + j - n - 1);
}
cout << ans;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int w = 1, s = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') w = 0;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
s = (s << 1) + (s << 3) + ch - '0';
ch = getchar();
}
return w ? s : -s;
}
const int N = 1001;
struct point {
int x, y, num;
} p[N];
struct square {
int x, y, r;
} s[N];
int opp[N], bel[N];
bool num[N];
int n, m, k, ans;
vector<int> f[N];
bool cmp1(point a, point b) { return a.x < b.x; }
bool cmp2(square a, square b) { return a.x - a.r < b.x - b.r; }
bool solve(int x) {
if (x == 0) return 1;
return 0;
}
void content() {
n = read(), m = read(), k = read();
for (int i = 1; i <= n; i++) p[i].x = read(), p[i].y = read(), p[i].num = i;
sort(p + 1, p + n + 1, cmp1);
for (int i = 1; i <= n; i++) opp[p[i].num] = i;
for (int i = 1; i <= m; i++) {
s[i].r = read();
s[i].x = read(), s[i].y = read();
}
sort(s + 1, s + m + 1, cmp2);
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (p[j].x < s[i].x - s[i].r) continue;
if (p[j].x > s[i].x + s[i].r) break;
int a = p[j].x, b = p[j].y, c = s[i].x, d = s[i].y;
double lc = sqrt(pow((a - c), 2) + pow((b - d), 2));
if (lc < s[i].r) f[p[j].num].push_back(i);
}
}
for (int i = 1; i <= k; i++) {
int x = read(), y = read();
for (int j = 0; j < f[x].size(); j++) num[f[x][j]] = solve(num[f[x][j]]);
for (int j = 0; j < f[y].size(); j++) num[f[y][j]] = solve(num[f[y][j]]);
for (int j = 1; j <= m; j++)
if (num[j]) ans++;
printf("%d\n", ans);
ans = 0;
memset(num, 0, sizeof(num));
}
}
int main() {
content();
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, r, c, k;
const int N = 11;
int g[N][N];
void input() {
memset(g, 0, sizeof g);
scanf("%d %d %d %d", &r, &c, &n, &k);
for (int i = 0; i < n; i++) {
int u, v;
scanf("%d %d", &u, &v);
u--;
v--;
g[u][v] = 1;
}
}
void bruteforce() {
int ans = 0;
for (int i1 = 0; i1 < r; i1++)
for (int j1 = 0; j1 < c; j1++) {
for (int i2 = i1; i2 < r; i2++) {
for (int j2 = j1; j2 < c; j2++) {
int hcn = 0;
for (int i = i1; i <= i2; i++) {
for (int j = j1; j <= j2; j++) hcn += g[i][j];
}
if (hcn >= k) ans++;
}
}
}
cout << ans << endl;
}
int main() {
input();
bruteforce();
}
| 12 | CPP |
n, t = map(int, input().split())
l = []
for i in range(n):
a, b = map(int, input().split())
l.append((a, b))
l.sort()
ans = 0
dp = [[0]*t for _ in range(n+1)]
for i in range(n):
cur = dp[i][t-1] + l[i][1]
ans = max(ans, cur)
for j in range(t):
dp[i+1][j] = max(dp[i+1][j], dp[i][j])
nj = j+l[i][0]
if nj < t:
dp[i+1][nj] = max(dp[i+1][nj], dp[i][j]+l[i][1])
print(ans) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3fffffff;
const int SINF = 0x7fffffff;
const long long LINF = 0x3fffffffffffffff;
const long long SLINF = 0x7fffffffffffffff;
const int MAXN = 300007;
int n;
int a[MAXN];
void init();
void input();
void work();
int main() {
init();
input();
work();
}
void init() { ios::sync_with_stdio(false); }
void input() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
}
void work() {
long long ans = 0;
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; ++i)
ans += static_cast<long long>((((i + 1) < (n)) ? (i + 1) : (n))) * a[i];
cout << ans << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
char c, sg = 0;
while (c = getchar(), (c > '9' || c < '0') && c != '-')
;
for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
c = getchar())
first = (first << 1) + (first << 3) + c - '0';
if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
gn(x1), gn(x2);
}
int power(int a, int b, int m, int ans = 1) {
for (; b; b >>= 1, a = 1LL * a * a % m)
if (b & 1) ans = 1LL * ans * a % m;
return ans;
}
struct E {
int v, l, r;
E(int v = 0, int l = 0, int r = 0) : v(v), l(l), r(r) {}
bool operator<(const E &e) const {
if (l != e.l) return l < e.l;
return r < e.r;
}
};
vector<E> adj[1000100];
int cur[1000100];
priority_queue<pair<pair<int, int>, int>, vector<pair<pair<int, int>, int> >,
greater<pair<pair<int, int>, int> > >
q;
void zou(int u, int tl, int tr) {
if (cur[u] == adj[u].size()) return;
E &e = adj[u][cur[u]];
if (e.l > tr) return;
cur[u]++;
if (tl <= e.r)
q.push(pair<pair<int, int>, int>(pair<int, int>(max(tl, e.l) + 1, e.r + 1),
e.v));
zou(u, tl, tr);
}
int main() {
int n, m;
gn(n, m);
for (int i = 0; i < m; i++) {
int u, v, l, r;
gn(u, v);
gn(l, r);
r--;
if (!(l == r && l % 2 == 1)) {
adj[u].push_back(E(n + v, l + (l & 1), r - (r & 1)));
adj[v].push_back(E(n + u, l + (l & 1), r - (r & 1)));
}
if (!(l == r && l % 2 == 0)) {
adj[n + u].push_back(E(v, l + (~l & 1), r - (~r & 1)));
adj[n + v].push_back(E(u, l + (~l & 1), r - (~r & 1)));
}
}
for (int i = 1; i <= n << 1; i++) sort(adj[i].begin(), adj[i].end());
int ans = -1;
q.push(pair<pair<int, int>, int>(pair<int, int>(0, 0), 1));
while (!q.empty()) {
pair<pair<int, int>, int> now = q.top();
q.pop();
if ((now.second == n || now.second == n << 1) &&
(ans == -1 || ans > now.first.first))
ans = now.first.first;
zou(now.second, now.first.first, now.first.second);
}
printf("%d\n", ans);
return 0;
}
| 12 | CPP |
t=int(input())
while (t>0):
arr=input().split()
arr=[int(i) for i in arr]
if (arr.count(max(arr))>=2):
print("YES")
temp=[min(arr),min(arr),max(arr)]
print(*temp,sep=" ")
else:
print("NO")
t-=1 | 7 | PYTHON3 |
n=int(input())
s=input()
l=[0]*10
for i in s:
try:
k=int(i)
l[k]=0
except ValueError:
if i=='L':
l[l.index(0)]=1
else:
l.reverse()
l[l.index(0)]=1
l.reverse()
for i in l:
print(i,end="") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define INF INT_MAX/2
int main()
{
while (1)
{
int a, b, d;
cin >> a >> b >> d;
if (a == 0) return 0;
rep(sum, 1, 100000)
{
int _min = INF;
int _x, _y;
rep(x, 0, sum + 1)
{
int y = sum - x;
if ((a*x + d == b*y || a*x == b*y + d) || a*x+b*y == d)
{
if (a*x + b*y < _min)
{
_min = a*x + b*y;
_x = x;
_y = y;
}
}
}
if (_min != INF)
{
cout << _x << " " << _y << endl;
break;
}
}
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct People {
int x, y, d;
} p[200001];
int n, m, ans;
int fa[200001], dis[200001];
inline bool cmp(People a, People b) { return a.d > b.d; }
int find(int x) {
if (x == fa[x])
return fa[x];
else
return fa[x] = find(fa[x]);
}
int main() {
cin >> n >> m;
for (int i = 1, x, y, d; i <= m; i++)
cin >> x >> y >> d, p[i].x = x, p[i].y = y, p[i].d = d;
sort(p + 1, p + m + 1, cmp);
for (int i = 1; i <= n; i++) fa[i] = i, dis[i] = 1;
for (int i = 1; i <= m; i++) {
int x = find(p[i].x);
int y = find(p[i].y);
if (x != y && (dis[x] != 0 || dis[y] != 0))
fa[y] = x, ans += p[i].d, dis[x] = dis[x] & dis[y];
else if (x == y && dis[x])
dis[x] = 0, ans += p[i].d;
}
cout << ans;
}
| 12 | CPP |
import math
# import sys
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
for _ in range(int(input())):
n = int(input())
p = math.log2(n)
if (p==int(p)):
print(n-1)
else:
p = int(p)
p = 2**p
print(p-1) | 7 | PYTHON3 |
n, base_x = input().split(" ")
n = int(n)
base_x = int(base_x)
X = input().split(" ")
for i,x in enumerate(X):
X[i] = int(x)
n, base_y = input().split(" ")
n = int(n)
base_y = int(base_y)
Y = input().split(" ")
for i,y in enumerate(Y):
Y[i] = int(y)
x_sum = 0
pow_x = 0
for i in range(len(X)-1, -1, -1):
x_sum += X[i] * (base_x ** pow_x)
pow_x += 1
y_sum = 0
pow_y = 0
for i in range(len(Y)-1, -1, -1):
y_sum += Y[i] * (base_y ** pow_y)
pow_y += 1
if x_sum > y_sum:
print(">")
elif y_sum > x_sum:
print("<")
else:
print("=")
# print(base_x)
# print(base_y) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int dp[55][55];
bool dp2[55][55];
long long int books[55];
long long int cumulative[55];
int k, n;
void solve(int n2, int k2, long long int looking, int shift) {
if (k2 == 1) {
if (((dp[n2][k2] >> shift) & looking) == looking) {
dp2[n2][k2] = true;
} else {
dp2[n2][k2] = false;
}
return;
}
long long int maxsum = 0;
long long int sumay = books[n2];
for (int i = n2 - 1; i >= k2 - 1; i--) {
if (dp[i][k2 - 1] == -1) {
solve(i, k2 - 1, looking, shift);
}
if (((dp[i][k2 - 1] >> shift) & looking) == looking &&
((sumay >> shift) & looking) == looking) {
dp2[n2][k2] = true;
maxsum = dp[i][k2 - 1] & sumay;
}
sumay += books[i];
}
dp[n2][k2] = maxsum;
}
int main() {
for (int i = 0; i < 55; i++) {
for (int j = 0; j < 55; j++) {
dp[i][j] = -1;
}
}
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> books[i + 1];
if (i == 0) {
cumulative[i + 1] = books[i + 1];
} else {
cumulative[i + 1] = cumulative[i] + books[i + 1];
}
dp[i + 1][1] = cumulative[i + 1];
}
long long int ans = 0;
for (int i = 60; i >= 0; i--) {
ans = ans * 2 + 1;
solve(n, k, ans, i);
if (!dp2[n][k]) {
ans--;
}
for (int j = 0; j < 55; j++) {
for (int l = 2; l < 55; l++) {
dp[j][l] = -1;
dp2[j][l] = 0;
}
}
}
cout << ans;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, tot, tg[19], s[109];
char ch[109];
struct node {
int l, r, sl[19], sr[19];
bool bo[140009];
void init() {
scanf("%s", ch + 1);
int i, j, x, n = strlen(ch + 1);
for (i = 1; i <= n; i++) s[i] = ch[i] - '0';
for (i = 1; i <= n; i++) {
for (j = x = 0; j < 16 && i + j <= n; j++) {
x = x << 1 | s[i + j];
bo[tg[j + 1] | x] = 1;
}
}
l = r = min(n, 16);
for (i = 1; i <= l; i++) sl[i] = s[i];
for (i = 1; i <= r; i++) sr[i] = s[n - i + 1];
}
void mrg(node u, node v) {
l = u.l;
memcpy(sl, u.sl, sizeof(u.sl));
r = v.r;
memcpy(sr, v.sr, sizeof(v.sr));
int i, j, x, y;
for (i = 1; i <= v.l && l < 16; i++) {
l++;
sl[l] = v.sl[i];
}
for (i = 1; i <= u.r && r < 16; i++) {
r++;
sr[r] = u.sr[i];
}
for (i = 0; i < tot; i++) bo[i] = u.bo[i] | v.bo[i];
for (i = 1, x = 0; i <= u.r; i++) {
x |= u.sr[i] << i - 1;
for (j = 1, y = x; j <= v.l; j++) {
y = y << 1 | v.sl[j];
if (i + j <= 16) bo[tg[i + j] | y] = 1;
}
}
}
int calc() {
int i, j, k, x;
for (i = 1;; i++) {
x = 1 << i;
for (j = 0; j < x; j++)
if (!bo[tg[i] | j]) break;
if (j < x) break;
}
return i - 1;
}
} a[209];
int main() {
scanf("%d", &n);
tot = 1 << 17;
int i;
tg[16] = 0;
for (i = 15; i; i--) tg[i] = tg[i + 1] | 1 << i + 1;
for (i = 1; i <= n; i++) a[i].init();
scanf("%d", &m);
for (i = 1; i <= m; i++) {
int x, y;
scanf("%d%d", &x, &y);
a[n + i].mrg(a[x], a[y]);
printf("%d\n", a[n + i].calc());
}
return 0;
}
| 10 | CPP |
n,a,b=map(int,input().split());k=10**9+7;c=(1<<n)%k-1;X=Y=1
for i in range(b):
X=X*(n-i)%k;Y=Y*(i+1)%k
if i+1 in(a,b):c-=X*pow(Y,k-2,k)
print(c%k) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
scanf("%d", &k);
if (k < 10)
printf("%d\n", k);
else if (k < 190) {
k -= 10;
if (k % 2 == 1)
printf("%d\n", (k >> 1) % 10);
else
printf("%d\n", (k >> 1) / 10 + 1);
} else if (k < 2890) {
k -= 190;
if (k % 3 == 0)
printf("%d\n", k / 3 / 100 + 1);
else if (k % 3 == 1)
printf("%d\n", k / 3 % 100 / 10);
else
printf("%d\n", k / 3 % 10);
} else {
k -= 2890;
if (k % 4 == 0)
printf("%d\n", (k >> 2) / 1000 + 1);
else if (k % 4 == 1)
printf("%d\n", (k >> 2) % 1000 / 100);
else if (k % 4 == 2)
printf("%d\n", (k >> 2) % 100 / 10);
else
printf("%d\n", (k >> 2) % 10);
}
return 0;
}
| 7 | CPP |
#include<iostream>
#include<cmath>
#include<string.h>
using namespace std;
int main(){
int N,K,ans;
cin >> N >> K;
ans = (N+K-3)/(K-1);
cout << ans << "\n";
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int mat[110][110];
int n, m, q;
void cr(int k) {
int t = mat[k][m];
for (int i = m; i >= 2; i--) mat[k][i] = mat[k][i - 1];
mat[k][1] = t;
}
void cc(int k) {
int t = mat[n][k];
for (int i = n; i >= 2; i--) mat[i][k] = mat[i - 1][k];
mat[1][k] = t;
}
void print() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) cout << mat[i][j] << " ";
cout << endl;
}
}
struct com {
int t;
int r, c;
int x;
} Q[(int)1e4 + 5];
int main() {
while (cin >> n >> m >> q) {
memset(mat, 0, sizeof(mat));
for (int i = 0; i < q; i++) {
int t;
cin >> t;
Q[i].t = t;
if (t == 1)
cin >> Q[i].r;
else if (t == 2)
cin >> Q[i].c;
else
cin >> Q[i].r >> Q[i].c >> Q[i].x;
}
for (int i = q - 1; i >= 0; i--) {
int t = Q[i].t;
if (t == 1)
cr(Q[i].r);
else if (t == 2)
cc(Q[i].c);
else
mat[Q[i].r][Q[i].c] = Q[i].x;
}
print();
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
char s[5005];
char p[5005];
int v[5005];
int dp[5005][5005];
int main() {
scanf(" %s %s", s, p);
int n = strlen(s);
int m = strlen(p);
for (int i = 0; i < n; i++) {
int cur = 0;
int j;
v[i] = -1;
for (j = i; j < n && cur < m; j++)
if (s[j] == p[cur]) {
cur++;
if (cur == m) {
v[i] = j;
break;
}
}
}
for (int i = 0; i < n; i++)
for (int j = 0; j <= n; j++) dp[i][j] = -1e9;
dp[0][0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= n; j++) {
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j]);
if (v[i] != -1)
dp[v[i] + 1][j + (v[i] - i + 1 - m)] =
max(dp[v[i] + 1][j + (v[i] - i + 1 - m)], dp[i][j] + 1);
}
}
for (int i = 0; i <= n; i++) printf("%d ", dp[n][i]);
printf("\n");
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> m, m1;
vector<pair<int, int> > v;
long long a[1000005], b[1000005];
deque<long long> dq;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
a[0] = 0;
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
long long sum = 0;
int res = 0;
for (int i = 1; i <= n; i++) {
if (sum > a[i])
res++;
else
sum += a[i];
}
cout << n - res << endl;
return 0;
}
| 10 | CPP |
#include<iostream>
#include<algorithm>
#include<cassert>
#include<map>
#include<vector>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int D=2;
const ll inf = 1LL<<60;
inline ll myabs(ll a,ll b){
return max(a,b)-min(a,b);
}
inline ll mymin(ll a, ll b){
return a < b?a:b;
}
inline ll mymax(ll a, ll b){
return a > b?a:b;
}
inline int mymin(int a, int b){
return a < b?a:b;
}
inline int mymax(int a, int b){
return a > b?a:b;
}
//inline void precalc(const vector<pair<ll,ll> > in,vector<pli> & ret){
inline vector<pll> precalc(const vector<pair<ll,ll> > in,bool flag){
vector<pll> ret;
int n = in.size();
//y座æ¨ã®å§ç¸®ãæå°å¤æ±ãã¦ãã
map<ll,int> M;
vector<ll> all;
rep(i,(int)in.size()){
if (flag){
M[in[i].first]++;
all.push_back(in[i].first);
}else {
M[in[i].second]++;
all.push_back(in[i].second);
}
}
sort(all.begin(),all.end());
all.erase(unique(all.begin(),all.end()),all.end());
//åæå¤ãè¨ç®
int num = M[all[0]];
ll pos = 2*num;
ll neg = 2*(n-num);
ll prev = all[0];
ll cur=0;
rep(i,(int)in.size()){
if (flag)cur = cur + 2*((ll)in[i].first-(ll)all[0]);
else cur = cur + 2*((ll)in[i].second-(ll)all[0]);
}
ret.push_back(make_pair(cur,all[0]));
REP(i,1,all.size()){
ll fir = all[i];
int sec=M[all[i]];
ll diff = fir - prev;
cur = cur + (pos * diff);
cur = cur - (neg * diff);
neg=neg-(sec*2);
pos=pos+(sec*2);
assert(neg+pos == 2*n);
prev = fir;
ret.push_back(make_pair(cur,fir));
}
return ret;
}
void bf(vector<pair<ll,ll> > &in,ll tans,ll tansx,ll tansy){
vector<ll> x,y;
rep(i,in.size()){
swap(in[i].second,in[i].first);
x.push_back(in[i].second);
y.push_back(in[i].first);
}
sort(x.begin(),x.end());x.erase(unique(x.begin(),x.end()),x.end());
sort(y.begin(),y.end());y.erase(unique(y.begin(),y.end()),y.end());
ll ans = inf;
ll ansx,ansy;
rep(i,y.size()){
rep(j,x.size()){
vector<ll> dist;
rep(k,in.size()){
dist.push_back(myabs(in[k].second,x[j])+myabs(in[k].first,y[i]));
}
sort(dist.begin(),dist.end());
ll tmp = 0;
rep(k,dist.size()){
tmp += dist[k]*2;
}
tmp -= dist[dist.size()-1];
if (tmp < ans){
ans = tmp;
ansy = x[j];
ansx = y[i];
}else if (tmp == ans && x[j] < ansx){
ans = tmp;
ansx = x[j];
ansy = y[i];
}else if (tmp == ans && x[j] == ansx && y[i] < ansy){
ans = tmp;
ansx = x[j];
ansy = y[i];
}
}
}
//cout << "brute force " << endl;
//cout << ans <<endl << ansy <<" " << ansx << endl;
//assert(ans == tans);
//assert(ansx == tansy);
//assert(ansy == tansx);
}
int main(){
ll w,h;
int n;
while(cin>>w>>h){
cin>>n;
vector<pair<ll,ll> > in(n);
//input is x,y
rep(i,n){
cin>>in[i].first>>in[i].second;
}
vector<pll> y,x;//ã¹ã³ã¢ã座æ¨ã®ãã¢
map<ll,int> X,Y;
x = precalc(in,false);
y = precalc(in,true);
//解ã
int mx = 0,my=0;
vector<int> mxs,mys;
rep(i,(int)x.size()){
X[x[i].second]=i;
if (x[i].first < x[mx].first)mx = i;
else if (x[i].first == x[mx].first && x[i].second < x[mx].second)mx = i;
}
rep(i,x.size())if (x[i].first == x[mx].first)mxs.push_back(i);
rep(i,(int)y.size()){
Y[y[i].second]=i;
if (y[i].first < y[my].first)my = i;
else if (y[i].first == y[my].first && y[i].second < y[my].second)my = i;
}
rep(i,y.size())if (y[i].first == y[my].first)mys.push_back(i);
ll ansx=-1,ansy=-1;
ll ans = inf;
rep(k,(int)in.size()){
rep(ii,mys.size()){
rep(jj,mxs.size()){
REP(i,mymax(0,mys[ii]-D),mymin(mys[ii]+D,(int)y.size())){
REP(j,mymax(0,mxs[jj]-D),mymin(mxs[jj]+D,(int)x.size())){
ll tmp = y[i].first;
tmp = tmp + x[j].first;
tmp = tmp - myabs(y[i].second,in[k].first);
tmp = tmp - myabs(x[j].second,in[k].second);
ll ty=y[i].second;
ll tx=x[j].second;
if (tmp < ans || (tmp == ans && ty < ansy) || (tmp == ans && ty == ansy && tx < ansx) ){
ans = tmp;
ansx = tx;
ansy = ty;
}
}
}
}
}
/*
//åãé¤ãy座æ¨ã®ã¤ã³ããã¯ã¹,åãé¤ã座æ¨å°éã¯in[k].first,in[k].second
//assert(X.find(in[k].second) != X.end() && Y.find(in[k].first) != Y.end());
int xind = X[in[k].second];
int yind = Y[in[k].first ];
//çãã®å ´æã決ããã(i,j)
REP(i,mymax(0,yind-5),mymin(yind+5,(int)Y.size())){
REP(j,mymax(0,xind-5),mymin(xind+5,(int)X.size())){
//çãã®å ´æã®ãå¾å¾©ãåãé¤ããªãã£ãå¤ãæ±ãã
ll tmp = (ll)y[i].first + (ll)x[j].first;
tmp = tmp - myabs((ll)y[i].second,(ll)in[k].first);
tmp = tmp - myabs((ll)x[j].second,(ll)in[k].second);
ll ty=y[i].second,tx=x[j].second;
if (tmp < ans || (tmp == ans && ty < ansy) || (tmp == ans && ty == ansy && tx < ansx) ){
ans = tmp;
ansx = tx;
ansy = ty;
}
}
}*/
}
assert(ansx != -1);
cout << ans << endl;
cout << ansy <<" " << ansx << endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll llinf = (1ll << 61) - 1;
const double eps = 1e-6, ldeps = 1e-9;
struct Dbg {
static constexpr auto &os = cout;
template <class C>
static auto dud(C *x) -> decltype(os << *x, 0);
template <class C>
static char dud(...);
template <class C>
typename enable_if<sizeof dud<C>(0) != 1, Dbg &>::type operator<<(
const C &x) {
os << x;
return *this;
}
template <class C>
Dbg &dump(C b, C e) {
*this << "\n[";
int cur = 0;
for (C i = b; i != e and cur < 26; i++, cur++)
*this << ", " + 2 * (i == b) << *i;
return *this << ']';
}
template <class C>
typename enable_if<sizeof dud<C>(0) == 1, Dbg &>::type operator<<(
const C &x) {
return dump(begin(x), end(x));
}
template <class C, size_t X>
typename enable_if<!is_same<C, const char>::value, Dbg &>::type operator<<(
C (&x)[X]) {
return dump(begin(x), end(x));
}
template <class B, class C>
Dbg &operator<<(const pair<B, C> &x) {
return *this << '{' << x.first << ", " << x.second << '}';
}
template <class C, size_t Y>
struct TP {
void operator()(Dbg &os, const C &t) {
TP<C, Y - 1>()(os, t);
os << ", " << get<Y - 1>(t);
}
};
template <class C>
struct TP<C, 1> {
void operator()(Dbg &os, const C &t) { os << get<0>(t); }
};
template <class... C>
Dbg &operator<<(const tuple<C...> &t) {
os << '{', TP<decltype(t), sizeof...(C)>()(*this, t);
return *this << '}';
}
Dbg &operator<<(ostream &(*x)(std::ostream &)) {
os << x;
return *this;
}
} dbg;
void err(istringstream *iss) { delete iss; }
template <class C, class... Args>
void err(istringstream *iss, const C &val, const Args &...args) {
string name;
*iss >> name;
if (name.back() == ',') name.pop_back();
dbg << name << " = " << val << "; ", err(iss, args...);
}
int T, Q, cn;
const int inf = 1000000007, mxn = 405;
char s[mxn], t[mxn];
int n, m, dp[mxn][mxn];
signed main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.precision(11);
cin >> T;
while (cn++ != T) {
cin >> s >> t;
n = int(strlen(s)), m = int(strlen(t));
for (int i = 1; i <= m; i++) {
for (int j = 0; j <= n; j++) {
for (int k = 0; k <= i; k++) {
dp[j][k] = 0;
}
}
dp[0][0] = i;
for (int j = 0; j < n; j++) {
for (int k = 0; k <= i; k++) {
if (dp[j][k] < i) break;
if (s[j] == t[k]) dp[j + 1][k + 1] = max(dp[j + 1][k + 1], dp[j][k]);
dp[j + 1][k] = max(dp[j + 1][k], (s[j] == t[dp[j][k]]) + dp[j][k]);
}
}
if (dp[n][i] == m) {
cout << "YES\n";
goto eot;
}
}
cout << "NO\n";
eot:;
}
}
| 11 | CPP |
print(int(''.join(bin('><+-.,[]'.index(i)+8)[2:].rjust(3,'0')for i in input()),2)%1000003) | 8 | PYTHON3 |
x=input()
for i in range(0,int(x)) :
word=input()
if (len(word) >10) :
print(word[0] + str(len(word)-2) + word[-1])
else :
print(word) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int b = s[s.size() - 1] - '0';
int pare = 0;
for (int i = 0; i < s.size(); i++) {
if ((s[i] - '0') % 2 == 0) {
pare++;
}
}
for (int i = 0; i < s.size(); i++) {
int a = s[i] - '0';
if (a % 2 == 0 && (a < b || pare == 1)) {
swap(s[i], s[s.size() - 1]);
break;
}
if (a % 2 == 0) {
pare--;
}
}
if ((s[s.size() - 1] - '0') % 2 == 1) {
cout << -1;
return 0;
}
cout << s;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1010;
int n;
string s[MAX];
int cnt[MAX];
int main() {
ios::sync_with_stdio(false);
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
cin >> s[i] >> cnt[i];
mp[s[i]] += cnt[i];
}
int ma = 0;
for (auto it = mp.begin(); it != mp.end(); it++) {
ma = max(ma, it->second);
}
map<string, int> mp2;
for (int i = 0; i < n; i++) {
mp2[s[i]] += cnt[i];
if (mp[s[i]] == ma && mp2[s[i]] >= ma) {
cout << s[i] << endl;
break;
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, bit[4][11][10][100010];
void add(int a, int b, int c, int idx, int val) {
while (idx <= n) {
bit[a][b][c][idx] += val;
idx += (idx & -idx);
}
}
int get(int a, int b, int c, int idx) {
int ret = 0;
while (idx > 0) {
ret += bit[a][b][c][idx];
idx -= (idx & -idx);
}
return ret;
}
int mp[300];
int main() {
string s, e;
int i, j, q, type, idx, l, r, ret;
mp['A'] = 0, mp['T'] = 1, mp['G'] = 2, mp['C'] = 3;
cin >> s;
n = s.size();
for (i = 0; i < n; i++) {
for (j = 1; j <= 10; j++) {
add(mp[s[i]], j, (i + 1) % j, (i + 1), 1);
}
}
cout << endl;
cin >> q;
while (q--) {
cin >> type;
if (type == 1) {
cin >> idx >> e;
for (j = 1; j <= 10; j++) add(mp[s[idx - 1]], j, idx % j, idx, -1);
s[idx - 1] = e[0];
for (j = 1; j <= 10; j++) add(mp[s[idx - 1]], j, idx % j, idx, 1);
} else {
cin >> l >> r >> e;
int len = e.size();
int ret = 0;
for (i = 0; i < len; i++) {
ret += (get(mp[e[i]], len, (l + i) % len, r) -
get(mp[e[i]], len, (l + i) % len, l - 1));
}
cout << ret << endl;
}
}
}
| 9 | CPP |
#!/usr/bin/python
n, k, f = int(input()), 0, False
for i in range(1,n+1):
for j in range(1,n+1):
if i+j == n :
if i % 2 == 0:
if j % 2 == 0:
print("YES")
f = True
k += 1
break
if k > 0:
break
if not f:
print("NO");
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
long long n, l, r;
for (int i = 1; i <= t; i++) {
cin >> n >> l >> r;
long long kol = n / l;
if (r * kol >= n)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| 8 | CPP |
t = int(input())
for i in range(0, t):
n = int(input())
s = input()
start = str.find(s, '1')
fin = str.find(s[::-1], '1')
if (start == -1):
print(n)
else:
ans = n*2 - min(start, fin)*2
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100008;
struct Node {
int first, second, t;
Node(int _x = 0, int _y = 0, int _t = 0) : first(_x), second(_y), t(_t) {}
} point[maxn];
bool vis[1007];
int n, now = 0;
vector<pair<int, int> > ans[107];
vector<int> G[107];
void solve() {
for (int i = 1; i <= n; ++i) {
ans[i].push_back(make_pair(i, ++now));
for (int j = 0; j < G[i].size(); ++j) {
ans[i].push_back(make_pair(i, ++now));
ans[G[i][j]].push_back(make_pair(G[i][j], now));
}
}
}
int main() {
int m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int u, v;
scanf("%d%d", &u, &v);
G[min(u, v)].push_back(max(u, v));
}
solve();
for (int i = 1; i <= n; ++i) {
cout << ans[i].size() << endl;
for (int j = 0; j < ans[i].size(); ++j)
printf("%d %d\n", ans[i][j].first, ans[i][j].second);
}
}
| 9 | CPP |
rows = [[1 for x in range(3)] for y in range(3)]
def change(x, y):
a = rows[x][y]
if a == 0:
rows[x][y] = 1
else:
rows[x][y] = 0
for x in range(3):
string = input()
presses = list(map(int, string.split()))
for y in range(3):
if presses[y] % 2 == 1:
change(x, y)
if y < 2:
change(x, y + 1)
if y > 0:
change(x, y - 1)
if x < 2:
change(x + 1, y)
if x > 0:
change(x - 1, y)
for x in rows:
print("".join(map(str, x))) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
long long a[n + 2];
a[0] = 0;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] > a[i - 1])
sum += (a[i] - a[i - 1]) * (n - a[i] + 1);
else if (a[i] < a[i - 1])
sum += a[i] * (a[i - 1] - a[i]);
}
cout << sum << endl;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T ii() {
T a;
cin >> a;
return a;
}
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> ar(n), br(n, -1);
for (auto &it : ar) cin >> it;
for (int i = (1); i <= (n - 1); i++)
if (ar[i] != ar[i - 1]) br[i] = ar[i - 1];
unordered_set<int, custom_hash> valuesInA(ar.begin(), ar.end());
vector<int> availableValues;
for (int i = (0); i <= (1000000); i++)
if (!valuesInA.count(i)) availableValues.push_back(i);
reverse(availableValues.begin(), availableValues.end());
for (auto &it : br) {
if (it > -1) {
if (availableValues.back() < it - 1) {
cout << (-1) << endl;
return 0;
}
continue;
}
it = availableValues.back();
availableValues.pop_back();
}
for (auto var : br) cout << var << " ";
cout << endl;
return 0;
}
| 9 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
ll gcd(ll a,ll b)
{
return a%b==0?b:gcd(b,a%b);
}
vector<ll> ans;
int main()
{
ans.clear();
int n,sum=1;
cin>>n;
if(n==2)
{
cout<<1<<endl<<1<<endl;
return 0;
}
for(ll i=1;i<n-1;++i)
{
if(gcd(i,n)==1) ans.push_back(i),sum=sum*i%n;
}
if(sum!=1) ans.push_back(n-1),sum=sum*(n-1)%n;
cout<<ans.size()<<endl;
for(int v:ans) cout<<v<<" ";
//cout<<endl<<" "<<sum<<endl;
return 0;
} | 9 | CPP |
n,k = [int(x) for x in input().split()]
for i in range(k):
i+=1
if n%10==0:
n = n/10
else:
n = n-1
print(int(n))
| 7 | PYTHON3 |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <cassert>
using namespace std;
typedef long long ll;
#define REP(i,n) for (int i=0;i<(int)(n);++i)
#define FOR(i,k,n) for (int i=(k);i<(int)(n);++i)
#define FOREQ(i,k,n) for (int i=(k);i<=(int)(n);++i)
#define FORIT(i,c) for (__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define SZ(v) (int)((v).size())
#define MEMSET(v,h) memset((v),(h),sizeof(v))
typedef vector<int> Array;
typedef vector<Array> Matrix;
int n, m;
Matrix mainG[2];
map<int, map<int, Matrix> > hMatrix[2];
int height[100];
int fee[100];
int order[100];
map<int, int> heightCnt;
map<int, int> mapto;
map<int, map<int, int> > mapfrom;
int dp[60][60];
void PushHeight(int index, int h) {
mapto[index] = heightCnt[h];
mapfrom[h][heightCnt[h]] = index;
heightCnt[h]++;
}
void PushEdge(int from, int to, int c) {
if (height[from] < height[to]) {
mainG[0][from][to] = c;
}
if (height[from] > height[to]) {
mainG[1][to][from] = c;
}
if (height[from] == height[to]) {
int h = height[from];
int l = mapto[from];
int r = mapto[to];
REP(i, 1 << heightCnt[h]) {
if (!((i >> l) & 1)) { continue; }
if (!((i >> r) & 1)) { continue; }
hMatrix[0][h][i][l][r] = c;
hMatrix[1][h][i][r][l] = c;
}
}
}
void CalcMatrix(Matrix &m) {
int n = m.size();
REP(k, n) REP(i, n) REP(j, n) {
m[i][j] = min(m[i][j], m[i][k] + m[k][j]);
}
}
int CalcFee(int h, int use) {
int ret = 0;
REP(i, heightCnt[h]) {
if ((use >> i) & 1) {
ret += fee[mapfrom[h][i]];
}
}
return ret;
}
int main() {
while (scanf("%d %d", &n, &m), n|m) {
MEMSET(fee, 0);
mainG[0] = Matrix(n, Array(n, 1 << 27));
mainG[1] = Matrix(n, Array(n, 1 << 27));
hMatrix[0].clear();
hMatrix[1].clear();
heightCnt.clear();
mapto.clear();
mapfrom.clear();
FOR(i, 1, n - 1) {
scanf("%d %d", &fee[i], &height[i]);
PushHeight(i, height[i]);
}
height[0] = -1;
height[n - 1] = 10000;
PushHeight(0, -1);
PushHeight(n - 1, 10000);
{
int cnt = 0;
FORIT(it1, mapfrom) {
FORIT(it2, it1->second) {
order[cnt++] = it2->second;
}
}
}
FORIT(it, heightCnt) {
int h = it->first;
REP(i, 1 << it->second) {
int c = it->second;
hMatrix[0][h][i] = Matrix(c, Array(c, 1 << 27));
hMatrix[1][h][i] = Matrix(c, Array(c, 1 << 27));
REP(j, it->second) {
if (!((i >> j) & 1)) { continue; }
hMatrix[0][h][i][j][j] = 0;
hMatrix[1][h][i][j][j] = 0;
}
}
}
REP(i, m) {
int from, to, c;
scanf("%d %d %d", &from, &to, &c);
from--; to--;
PushEdge(from, to, c);
}
REP(iter, 2) {
FORIT(it1, hMatrix[iter]) {
FORIT(it2, it1->second) {
Matrix &m = it2->second;
CalcMatrix(m);
}
}
}
MEMSET(dp, 0x0f);
dp[0][0] = 0;
// process
REP(i, n) REP(j, n) {
int l = order[i];
int r = order[j];
if (height[l] < height[r]) {
int h = height[l];
FOR(use, 1, 1 << heightCnt[h]) {
if (!((use >> mapto[l]) & 1)) { continue; }
const Matrix &mat0 = hMatrix[0][h][use];
int f = CalcFee(h, use) - fee[l];
//cout << l << " " << r << " " << f << endl;
assert(f >= 0);
REP(k, heightCnt[h]) {
int ncost = mat0[mapto[l]][k] + f + dp[l][r];
int nl = mapfrom[h][k];
dp[nl][r] = min(dp[nl][r], ncost);
REP(to, n) {
int nc = dp[nl][r] + fee[to] + mainG[0][nl][to];
if (to == r) { nc -= fee[to]; }
dp[to][r] = min(dp[to][r], nc);
}
}
}
} else if (height[l] > height[r]) {
int h = height[r];
FOR(use, 1, 1 << heightCnt[h]) {
if (!((use >> mapto[r]) & 1)) { continue; }
const Matrix &mat1 = hMatrix[1][h][use];
int f = CalcFee(h, use) - fee[r];
assert(f >= 0);
REP(k, heightCnt[h]) {
int ncost = mat1[mapto[r]][k] + f + dp[l][r];
int nr = mapfrom[h][k];
dp[l][nr] = min(dp[l][nr], ncost);
REP(to, n) {
int nc = dp[l][nr] + fee[to] + mainG[1][nr][to];
if (to == l) { nc -= fee[to]; }
dp[l][to] = min(dp[l][to], nc);
}
}
}
} else {
int h = height[l];
FOR(use, 1, 1 << heightCnt[h]) {
if (!((use >> mapto[l]) & 1)) { continue; }
if (!((use >> mapto[r]) & 1)) { continue; }
const Matrix &mat0 = hMatrix[0][h][use];
const Matrix &mat1 = hMatrix[1][h][use];
int f = CalcFee(h, use) - fee[l] - fee[r];
if (l == r) { f += fee[l]; }
assert(f >= 0);
REP(s, heightCnt[h]) {
int nr = mapfrom[h][s];
REP(k, heightCnt[h]) {
int ncost = mat0[mapto[l]][k] + mat1[mapto[r]][s] + f + dp[l][r];
int nl = mapfrom[h][k];
dp[nl][nr] = min(dp[nl][nr], ncost);
}
REP(to, n) {
int nc = dp[l][nr] + fee[to] + mainG[1][nr][to];
if (to == l) { nc -= fee[to]; }
dp[l][to] = min(dp[l][to], nc);
}
}
}
}
}
if (dp[n - 1][n - 1] > (1 << 24)) {
puts("-1");
} else {
printf("%d\n", dp[n - 1][n - 1]);
}
}
} | 0 | CPP |
X = list(map(int, input().split()))
N = 7 - max(X)
if N == 6:
print('1/1')
exit()
if N == 3:
print('1/2')
exit()
if N % 2 == 0:
print(str(int(N / 2)) + '/' + '3')
exit()
print(str(N) + '/' + '6')
| 7 | PYTHON3 |
n = int(input())
s = map(int, input().split())
cnt1, cnt2, cnt3, cnt4 = 0, 0, 0, 0
for x in s:
if x == 1: cnt1 += 1
elif x == 2: cnt2 += 1
elif x == 3: cnt3 += 1
else: cnt4 += 1
ans = cnt4
ans += cnt2 // 2
cnt2 = cnt2 % 2
if cnt1 <= cnt3:
ans += cnt1
ans += cnt2
ans += cnt3 - cnt1
else:
ans += cnt3
cnt1 -= cnt3
ans += cnt1 // 4
cnt1 %= 4
rem = cnt1 + cnt2 * 2
if rem > 0:
ans += 1 if rem <= 4 else 2
print(ans) | 8 | PYTHON3 |
#http://codeforces.com/problemset/problem/318/B
#solved
string = input()
h = string.count("heavy")
m = string.count("metal")
out = h * m
lmh = 0
lmm = 0
for i in range(len(string)):
mb = lmm
if string[i] == "h":
if string[i: i + 5] == "heavy":
lmh += 1
elif string[i] == "m":
if string[i: i + 5] == "metal":
lmm += 1
if lmm > mb:
out -= (h - lmh)
print(out)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = acos(-1.0);
int main() {
int n, m;
scanf("%d%d", &n, &m);
long long a = n - m + 1, b = n / m, c = n % m;
long long maxn = a * (a - 1) / 2;
long long minn = c * b * (b + 1) / 2 + (m - c) * b * (b - 1) / 2;
printf("%lld %lld\n", minn, maxn);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using std::max;
using std::swap;
int main() {
int n, k;
scanf("%d%d", &n, &k);
long long *mt = new long long[k]();
long long s, m;
for (auto i = 0; i < n; ++i) {
scanf("%I64d%I64d", &s, &m);
long long t = max(s, mt[0]) + m;
mt[0] = t;
int pos = 0;
for (;;) {
int ind = -1;
int left = 2 * pos + 1, right = 2 * pos + 2;
if (left < k && mt[left] < mt[pos]) {
ind = left;
}
if (right < k && mt[right] < mt[pos]) {
ind = mt[right] < mt[ind] ? (right) : ind;
}
if (ind == -1) {
break;
}
swap(mt[pos], mt[ind]);
pos = ind;
}
printf("%I64d\n", t);
}
}
| 10 | CPP |
import math
import sys
from sys import stdin
input=sys.stdin.readline
for _ in range(int(input())):
n,m,k=[int(j) for j in input().split()]
if m==0:
print(0)
elif n/k>=m:
print(m)
else:
arr=[0]*(k-1)
winner=n/k
m=m-winner
for i in range(int(m)):
arr[i%(k-1)]+=1
print(int(winner-max(arr)))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
const int N = 1e3+5;
const char S4[4][4] = {{'a','b','c','c'}, {'a','b','d','d'}, {'e','e','f','g'}, {'h','h','f','g'}};
const char S5[5][5] = {{'.','.','a','b','c'}, {'.','.','a','b','c'}, {'d','d','e','f','f'}, {'g','g','e','.','h'}, {'i','i','j','j','h'}};
const char S6[6][6] = {{'.','.','.','a','b','c'}, {'.','.','.','a','b','c'}, {'d','.','e','e','.','f'}, {'d','g','g','.','.','f'}, {'h','h','i','.','j','j'}, {'k','k','i','l','l','.'}};
const char S7[7][7] = {{'.','.','.','.','a','b','c'}, {'.','.','.','.','a','b','c'}, {'.','.','.','.','d','e','f'}, {'.','.','.','.','d','e','f'}, {'g','g','h','h','.','.','i'}, {'j','j','k','k','.','.','i'}, {'l','l','m','m','n','n','.'}};
int n, m, c[N*N]; char s[N][N];
void sol(int &n, int x)
{
for(int i = 0; i < x; ++i) for(int j = 0; j < x; ++j)
if(x == 4) s[n+i][n+j] = S4[i][j];
else if(x == 5) s[n+i][n+j] = S5[i][j];
else if(x == 6) s[n+i][n+j] = S6[i][j];
else s[n+i][n+j] = S7[i][j];
n += x;
}
int main()
{
scanf("%d", &n); if(n <= 2) return puts("-1"), 0;
if(n == 3) return puts("a..\na..\n.aa"), 0;
for(int i = 0; i < n; ++i) for(int j = 0; j < n; ++j) s[i][j] = '.';
sol(m, 4+(n&3)); while(m+4 <= n) sol(m, 4);
for(int i = 0; i < n; ++i) puts(s[i]);
return 0;
}
| 0 | CPP |
n = int(input())
for i in range(n):
A =list(map(int,input().split()))
A.sort()
a=A[0]
b=A[1]
c=A[2]
if c*c == a*a + b*b:
print("YES")
else:
print("NO")
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long fastpower(long long b, long long p) {
long long ans = 1;
while (p) {
if (p % 2) {
ans = (ans * b);
}
b = (b * b);
p /= 2;
}
return ans;
}
string makeitstring(long long n) {
string ans;
while (n) {
long long mod = n % 10;
mod += 48;
char m = mod;
ans = m + ans;
n /= 10;
}
return ans;
}
long long makeitnumber(string s) {
long long ans = 0;
for (long long i = 0; i < s.size(); i++) {
long long num = s[i] - '0';
ans += (num * fastpower(10, (long long)s.size() - i - 1));
}
return ans;
}
int arr[(int)1e3];
int main() {
int n;
scanf("%d", &n);
n *= 2;
vector<int> save;
multiset<int> f, s;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
arr[x]++;
save.push_back(x);
}
int cnt1 = 0;
for (int i = 0; i < 1000; i++) {
if (arr[i] > 1) {
for (int j = 0; j < arr[i]; j++) {
if (cnt1 % 2) {
f.insert(i);
} else {
s.insert(i);
}
cnt1++;
}
arr[i] = 0;
}
}
for (int i = 0; i < 1000; i++) {
if (arr[i] == 1) {
if (cnt1 % 2) {
f.insert(i);
} else {
s.insert(i);
}
cnt1++;
}
}
set<string> ans;
for (auto it : f) {
for (auto it2 : s) {
string f = makeitstring(it);
string s = makeitstring(it2);
string h = s + f;
ans.insert(h);
}
}
printf("%d\n", ans.size());
for (auto it : save) {
if (f.count(it)) {
printf("1 ");
f.erase(f.find(it));
} else {
printf("2 ");
s.erase(s.find(it));
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int ans=0;
for(int i=0;i<S.size()-1;i++)if(S[i]!=S[i+1])ans++;
cout << ans << endl;
return 0;
} | 0 | CPP |
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
import math
for ad in range(int(input())):
n=int(input())
t=0
ans=0
while n>0:
if t==0:
if n%2==0:
if n==4:
ans+=2
n=2
elif (n//2)%2==0:
ans+=1
n-=1
else:
ans+=n//2
n=n//2
else:
n-=1
ans+=1
t=1
else:
if n%2==0:
if n==4:
n=2
elif (n//2)%2==0:
n-=1
else:
n=n//2
else:
n-=1
t=0
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5;
const int INF = (int)1e9 + 7;
int main(int argc, char *argv[]) {
int n;
scanf("%d", &n);
char s[n + 7];
scanf("%s", s);
int x = 0, y = 0;
int a[n + 7];
int b[n + 7];
a[0] = b[n + 1] = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '(') {
++x;
} else {
if (x < 1)
++y;
else
--x;
}
a[i + 1] = x;
}
x = y = 0;
for (int i = n - 1; i >= 0; --i) {
if (s[i] == ')') {
++x;
} else {
if (x < 1)
++y;
else
--x;
}
b[i + 1] = x;
}
if (n < 2 || (x > 0 && y > 0) || abs(x - y) != 2) {
puts("0");
} else {
int ans = 0;
if (x > y) {
for (int i = n; i >= 0; --i) {
if (s[i - 1] == ')') {
if (b[i] - 1 - (a[i - 1] + 1) == 0) ++ans;
}
}
} else {
for (int i = 1; i <= n; ++i) {
if (s[i - 1] == '(') {
if (a[i] - 1 - (b[i + 1] + 1) == 0) ++ans;
}
}
}
printf("%d\n", ans);
}
return 0;
}
| 11 | CPP |
import sys
input=sys.stdin.readline
print=sys.stdout.write
n=int(input())
a=[0]*(10**6)
b=[0]*(10**6)
sm=0
for x in range(n):
el=input().split()
a[x]=int(el[0])
b[x]=int(el[1])
sm+=a[x]
ma=max(b)
ma2=0
flag=0
flag2=0
for i in range(n):
if(b[i]==ma):
flag+=1
flag2=i
if flag==1:
for i in range(n):
if b[i]!=ma:
ma2=max(ma2,b[i])
if flag==1:
for i in range(n):
if i==flag2:
print(str(ma2*(sm-a[i]))+" ")
else:
print(str(ma*(sm-a[i]))+" ")
else:
for i in range(n):
print(str(ma*(sm-a[i]))+" ") | 8 | PYTHON3 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n,m;
vector<int> t;
int u[20000];
void make_table(){
for(int i=0;i*i<=20000;i++){
t.push_back(i*i);
}
for(int i=0;i<(int)t.size();i++){
int I=t[i];
for(int j=i;j<(int)t.size();j++){
int J=t[j];
if(I+J>=20000)break;
u[I+J]++;
}
}
}
int main(){
make_table();
int Tc;
cin>>Tc;
while(Tc--){
cin>>n>>m;
int d=n*n+m*m;
int ans=0,flg=0;
for(int i=1;i<=d;i++){
if(d%i!=0)continue;
ans+=u[i]*u[d/i];
if(ans>=3){
flg=1;break;
}
}
if(flg){
cout<<'C'<<endl;
}else cout<<'P'<<endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
const int MAXN = 200005;
char S1[MAXN], S2[MAXN];
int pref[MAXN];
int get_sum(int i, int j) {
if (i == 0) return pref[j];
return pref[j] - pref[i - 1];
}
int get_ones(int i, int j) { return get_sum(i, j); }
int get_zeros(int i, int j) { return j - i + 1 - get_sum(i, j); }
int main() {
scanf("%s%s", S1, S2);
int n = strlen(S1), m = strlen(S2);
for (int i = 0; i < n; i++)
pref[i] = (i - 1 >= 0 ? pref[i - 1] : 0) + (S1[i] == '1');
long long int res = 0;
for (int i = 0; i < m; i++) {
int begin = std::max(i - (m - n), 0);
int end = std::min(n - 1, i);
res += S2[i] == '1' ? get_zeros(begin, end) : get_ones(begin, end);
}
std::cout << res << "\n";
}
| 8 | CPP |
#include <bits/stdc++.h>
const int MOD = 1e9 + 7;
const int v1 = 1e5 + 5;
const int N = 3e5 + 6;
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
long long t = 0;
cin >> t;
while (t--) {
long long n = 0;
long long k = 0;
cin >> n >> k;
vector<long long> a(n);
for (long long i = 0; i < n; i++) cin >> a[i];
sort((a).begin(), (a).end(), greater<int>());
long long count = 0;
long long ans = 0;
for (long long i = 0; i < n; i++) {
if (a[i] >= k) {
a[i] = 0;
ans++;
} else {
long long m = k / a[i];
if (k % a[i]) m++;
a[i] = m;
if (count >= m) {
count = 0;
ans++;
} else {
count++;
if (count == m) {
count = 0;
ans++;
}
}
}
}
cout << ans << "\n";
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, m;
cin >> n >> m;
vector<long long> a, b;
for (__typeof((n)) i = (0); i < (n); i++) a.push_back(1);
for (__typeof((n)) i = (0); i < (n); i++) b.push_back(8);
b[n - 1]++;
for (__typeof(((int)a.size())) i = (0); i < ((int)a.size()); i++)
cout << a[i];
cout << "" << endl;
for (__typeof(((int)b.size())) i = (0); i < ((int)b.size()); i++)
cout << b[i];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) solve();
return 0;
}
| 8 | CPP |
def sda(d,c):
"""special dict add"""
d.setdefault(c,0)
d[c]+=1
dt={}
n=int(input())
for c in range(n):
vt=input().split()
for d in vt[1:]:
sda(dt,d)
vk=[k for k,v in dt.items() if v==n]
print(' '.join(vk)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, a[105][105], cnt;
bool u[105][105];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
cin >> a[i][j];
if (i == j) {
u[i][j] = 1;
}
if ((n - 1) / 2 + 1 == j || (n - 1) / 2 + 1 == i) {
u[i][j] = 1;
}
if (i + j == n + 1) {
u[i][j] = 1;
}
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (u[i][j]) {
cnt += a[i][j];
}
}
}
cout << cnt;
}
| 7 | CPP |
#include <bits/stdc++.h>
int remain[50000];
int main(void) {
int n, i, flagYes = 1;
int check[1000];
scanf("%d", &n);
remain[0] = 0;
for (i = 1; i < 50000; i++) remain[i] = remain[i - 1] + i;
for (i = 0; i < 50000; i++) remain[i] %= n;
for (i = 0; i < 50000; i++) check[remain[i]] = 1;
for (i = 0; i < n; i++)
if (check[i] != 1) {
flagYes = 0;
break;
}
if (flagYes == 1)
printf("YES\n");
else
printf("NO\n");
return 0;
}
| 7 | CPP |
t = int(input())
for case in range(t):
print(*([1] * int(input())))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, b, a[500005], l = 1, r, cnt[500005];
bool in[500005];
vector<int> s;
struct query {
int l, r, ans, id;
} q[500005];
bool cmp(const query &x, const query &y) {
if (x.l / b < y.l / b) return 1;
if (x.l / b > y.l / b) return 0;
return ((x.l / b) & 1) ? x.r < y.r : x.r > y.r;
}
bool cmp2(const query &x, const query &y) { return x.id < y.id; }
inline void inc(int x) {
cnt[x]++;
if (cnt[x] == 1 && !in[x]) {
in[x] = 1;
s.push_back(x);
}
}
inline void dec(int x) {
cnt[x]--;
if (cnt[x] == 1 && !in[x]) {
in[x] = 1;
s.push_back(x);
}
}
int main() {
scanf("%d", &n);
b = sqrt(n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
scanf("%d", &m);
for (int i = 1; i <= m; i++) {
scanf("%d", &q[i].l);
scanf("%d", &q[i].r);
q[i].id = i;
}
sort(q + 1, q + m + 1, cmp);
for (int i = 1; i <= m; i++) {
while (r < q[i].r) {
r++;
inc(a[r]);
}
while (l > q[i].l) {
l--;
inc(a[l]);
}
while (r > q[i].r) {
dec(a[r]);
r--;
}
while (l < q[i].l) {
dec(a[l]);
l++;
}
while (!s.empty() && cnt[s.back()] != 1) {
in[s.back()] = 0;
s.pop_back();
}
if (!s.empty()) q[i].ans = s.back();
}
sort(q + 1, q + m + 1, cmp2);
for (int i = 1; i <= m; i++) printf("%d\n", q[i].ans);
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxk = 1050, maxn = 105, inf = 1e5 + 20;
int n, m, k, dp[maxk][maxn], ans = inf, a[maxn][maxn];
int mask_dif(int mask, int e) {
int t = 0;
for (int i = 0; i < n; i++) {
int x = ((mask & (1 << i)) > 0);
int y = a[i][e];
t += (x != y);
}
return t;
}
int row_dif(int x, int y) {
int t = 0;
for (int i = 0; i < m; i++) t += (a[x][i] != a[y][i]);
return t;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> k;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> a[i][j];
if (n <= 10) {
for (int mask = 0; mask < (1 << n); mask++) {
dp[mask][0] = 0;
for (int j = 1; j <= m; j++) {
int x = mask_dif(mask, j - 1);
dp[mask][j] = dp[mask][j - 1] + min(x, n - x);
}
ans = min(ans, dp[mask][m]);
}
return cout << (ans <= k ? ans : -1) << endl, 0;
}
for (int i = 0; i < n; i++) {
int x = 0;
for (int j = 0; j < n; j++) {
int w = row_dif(i, j);
x += (min(w, m - w));
}
ans = min(ans, x);
}
cout << (ans <= k ? ans : -1) << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-9;
const long double PI = acos(-1);
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
struct edge {
int u, v;
long long wt;
};
int n, m;
int vis[N], par[N], sz[N];
long long x[N], dsx[N];
int find(int p) {
if (par[p] == p)
return p;
else {
int pp = find(par[p]);
dsx[p] = dsx[p] ^ dsx[par[p]];
par[p] = pp;
return pp;
}
}
bool unite(int u, int v, long long wt) {
long long du = dsx[u], dv = dsx[v];
u = find(u), v = find(v);
if (u == v) return false;
if (sz[u] > sz[v]) swap(u, v);
par[u] = v;
dsx[u] = du ^ dv ^ wt;
sz[v] += sz[u];
return true;
}
vector<bitset<60>> num, base;
int gauss() {
int sz = (int)num.size();
int bs = 0;
for (int i = 0; i < 60; i++) {
bool found = false;
for (int j = bs; j < sz; j++)
if (num[j][i]) {
found = true;
swap(num[j], num[bs]);
}
for (int j = bs + 1; j < sz; j++)
if (num[j][i]) {
num[j] ^= num[bs];
}
if (found) base.push_back(num[bs]), bs++;
}
return base.size();
}
vector<edge> adj[N];
vector<edge> ed;
void dfs(int u, long long p, int pr) {
if (vis[u]) return;
vis[u] = 1;
x[u] = p;
for (auto e : adj[u])
if (e.v != pr) {
ed.push_back(e);
dfs(e.v, p ^ e.wt, u);
}
}
void res(int u) {
par[u] = u;
sz[u] = 1;
dsx[u] = 0;
}
long long solve(vector<edge> ed) {
vector<int> vtx;
for (auto e : ed) {
res(e.u), res(e.v);
vtx.push_back(e.u);
vtx.push_back(e.v);
}
sort(vtx.begin(), vtx.end());
long long n = unique(vtx.begin(), vtx.end()) - vtx.begin();
vtx.resize(n);
for (auto e : ed) {
int u = e.u, v = e.v;
long long wt = e.wt;
if (!unite(u, v, wt)) {
num.push_back(wt ^ dsx[u] ^ dsx[v]);
}
}
int b = gauss();
long long sum = 0;
for (int i = 0; i < 60; i++) {
bool has = false;
for (auto j : base)
if (j[i]) has = true;
long long one = 0, zero = 0;
for (int j : vtx) {
if (x[j] & (1ll << i))
one++;
else
zero++;
}
if (has) {
long long term1 = (1ll << i) % MOD;
long long term2 = (1ll << (b - 1)) % MOD;
long long term3 = (n * (n - 1)) / 2;
term1 = (term1 * term2) % MOD;
term1 = (term1 * term3) % MOD;
sum = (sum + term1) % MOD;
} else {
long long term1 = (1ll << i) % MOD;
long long term2 = (1ll << b) % MOD;
term1 = (term1 * term2) % MOD;
term1 = (term1 * one) % MOD;
term1 = (term1 * zero) % MOD;
sum = (sum + term1) % MOD;
}
}
return sum;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
int u, v;
long long t;
scanf("%d %d %lld", &u, &v, &t);
edge eu = {u, v, t};
edge ev = {v, u, t};
adj[u].push_back(eu);
adj[v].push_back(ev);
}
long long ans = 0;
for (int i = 1; i <= n; i++)
if (!vis[i]) {
ed.clear();
num.clear();
base.clear();
dfs(i, 0, 0);
ans = (ans + solve(ed)) % MOD;
}
printf("%lld\n", ans);
return 0;
}
| 13 | CPP |
import sys, math
str = input()
s = float(str)
if s < 4:
print('NO')
elif s % 2 == 0:
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
from math import ceil
for _ in range(int(input())):
n,x,y,d=map(int,input().split())
f=0
cand=[]
if (y-x)%d==0:
cand.append((y-x)//d)
f=1
if (y-1)%d==0:
cand.append(ceil((x-1)/d)+ceil((y-1)/d))
f=1
if (n-y)%d==0:
cand.append(ceil((n-x)/d)+ceil((n-y)/d))
f=1
if f==0:
print(-1)
else:
cand=[abs(i) for i in cand]
print(min(cand)) | 7 | PYTHON3 |
n=int(input())
m=int(input())
a=[]
for _ in range(n):
a.append(int(input()))
a.sort()
cnt=sum([a[-1]-a[i] for i in range(n)])
s1,s2=a[-1],a[-1]+m
if m>cnt:
m-=cnt
s1+=m//n
if m%n>0:
s1+=1
print(str(s1)+' '+str(s2))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200200;
int N;
vector<int> adj[MAXN];
int dist[MAXN];
vector<int> byDist[2];
bool wv[MAXN];
bool wa[MAXN];
int ans[MAXN];
void dfs(int v, int p) {
byDist[dist[v] & 1].emplace_back(v);
for (int u : adj[v]) {
if (u != p) {
dist[u] = dist[v] + 1;
dfs(u, v);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin >> N;
for (int i = 0; i < N - 1; ++i) {
int v, u;
cin >> v >> u;
adj[v].emplace_back(u);
adj[u].emplace_back(v);
}
dfs(1, -1);
if (byDist[0].size() > byDist[1].size()) {
swap(byDist[0], byDist[1]);
}
if (byDist[0].size() <= (N / 3)) {
int start = 3;
for (int v : byDist[0]) {
ans[v] = start;
wv[v] = true;
wa[start] = true;
start += 3;
}
} else {
int start = 2;
for (int v : byDist[0]) {
if (start <= N) {
ans[v] = start;
wv[v] = true;
wa[start] = true;
start += 3;
}
}
start = 1;
for (int v : byDist[1]) {
if (start <= N) {
ans[v] = start;
wv[v] = true;
wa[start] = true;
start += 3;
}
}
}
int ptr = 1;
for (int i = 1; i <= N; ++i) {
if (!wv[i]) {
while (wa[ptr]) ptr++;
ans[i] = ptr++;
}
cout << ans[i] << " ";
}
}
| 0 | CPP |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
const int mod = 1000000007;
const int inf = 2012345678;
const long long infl = 9012345678901234567;
const double pi = 3.1415926535897932384626433832795;
const int N = 20;
const int M = 100010;
char buf[M];
int a[M];
int dp[1 << N][N + 1];
int main() {
freopen("input.txt", "r", stdin);
int n, m;
scanf("%d%d", &(n), &(m));
for (int i = 0; i < (n); i++) {
scanf("%s", buf);
for (int j = 0; j < (m); j++) a[j] = 2 * a[j] + buf[j] - '0';
}
for (int i = 0; i < (m); i++) dp[a[i]][0]++;
for (int i = 0; i < (m); i++)
for (int j = 0; j < (n); j++) dp[a[i] ^ (1 << j)][1]++;
for (int k = 2; k <= n; k++) {
for (int i = 0; i < ((1 << n)); i++) {
int sum = 0;
for (int j = 0; j < (n); j++) {
sum += dp[i ^ (1 << j)][k - 1];
}
sum -= (n - k + 2) * dp[i][k - 2];
dp[i][k] = sum / k;
}
}
int ans = inf;
for (int i = 0; i < ((1 << n)); i++) {
int s = 0;
for (int k = 0; k <= (n); k++) {
s += min(k, n - k) * dp[i][k];
}
ans = min(ans, s);
}
printf("%d\n", ans);
return 0;
}
| 11 | CPP |
n = int(input())
stones = input()
ans = 0
for i in range(1, n):
ans += (1 if stones[i] == stones[i - 1] else 0)
print(ans) | 7 | PYTHON3 |
li = list(map(int, input().strip().split()))
li.sort()
c = li[3] - li[0]
b = li[2] - c
a = li[1] - c
print("%d %d %d"%(a, b, c)) | 7 | PYTHON3 |
N = input()
print(N + "".join(list(N)[::-1]))
| 8 | PYTHON3 |
def main():
n = int(input())
l = list(map(int,input().split()))
index_1 = []
for i in range(n):
if(l[i]==1):
index_1.append(i)
if(len(index_1)==0):
return 0
if(len(index_1)==1):
return 1
else:
result = 1
temp = index_1[0]
for i in range(1,len(index_1)):
result*=index_1[i]-temp
temp = index_1[i]
return result
if __name__=="__main__":
print(main()) | 8 | PYTHON3 |
n,m=map(int,input().split())
f,f1,f2=0,0,0
for i in range(n):
l=list(input().split())
f=f+l.count('C')
f1=f1+l.count('M')
f2=f2+l.count('Y')
if f1+f+f2>0:
print('#Color')
else:
print('#Black&White')
| 7 | PYTHON3 |
w=int(input())
j=1
m=list(map(int,input().split()))
n=[1]*w
for i in range(w-1):
if m[i+1]>=m[i]:
n[i+1]=n[i]+1
print(max(n))
| 7 | PYTHON3 |
Subsets and Splits