solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
test = int(input())
while test:
test-=1
n = int(input())
arr = input().split()
arr = [int(i) for i in arr]
even = 0
odd = 0
i = 0
while(i<n):
if arr[i]%2==0:
even+=1
else:
odd+=1
i+=1
if even%2==0 and odd%2==0:
print('YES')
else:
arr = sorted(arr)
i = 0
consecutives = 0
while(i<(n-1)):
if (arr[i+1]-arr[i])==1:
i+=1
consecutives+=1
break
i+=1
if consecutives!=0:
print('YES')
else:
print('NO')
| 9 | PYTHON3 |
#include <bits/stdc++.h>
const int mod = 1e9 + 7;
const int maxn = 1e5 + 6;
const double eps = 1e-6;
using namespace std;
bool eq(const double &a, const double &b) { return fabs(a - b) < eps; }
bool ls(const double &a, const double &b) { return a + eps < b; }
bool le(const double &a, const double &b) { return eq(a, b) || ls(a, b); }
long long gcd(long long a, long long b) { return a == 0 ? b : gcd(b % a, a); };
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long kpow(long long a, long long b) {
long long res = 1;
if (b < 0) return 1;
for (; b; b >>= 1) {
if (b & 1) res = res * a;
a = a * a;
}
return res;
}
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;
}
int n, m, k, s;
int a[maxn];
int in[maxn] = {0};
int dis[maxn][110];
vector<int> G[maxn];
void bfs() {
memset(dis, 0x3f, sizeof(dis));
queue<int> q;
for (int i = 1; i < (n + 1); ++i) q.push(i), dis[i][a[i]] = 0, in[i] = 1;
while ((int)q.size()) {
int u = q.front();
q.pop();
in[u] = 0;
for (int i = 0; i < ((int)G[u].size()); ++i) {
int v = G[u][i];
for (int j = 1; j < (k + 1); ++j) {
if (dis[v][j] > dis[u][j] + 1) {
dis[v][j] = dis[u][j] + 1;
if (!in[v]) q.push(v), in[v] = 1;
}
}
}
}
}
int main() {
int u, v;
scanf("%d%d%d%d", &n, &m, &k, &s);
for (int i = 1; i < (n + 1); ++i) scanf("%d", &a[i]);
for (int i = 0; i < (m); ++i)
scanf("%d%d", &u, &v), G[u].push_back(v), G[v].push_back(u);
bfs();
for (int i = 1; i < (n + 1); ++i) {
sort(dis[i] + 1, dis[i] + k + 1);
int sum = 0;
for (int j = 1; j < (s + 1); ++j) sum += dis[i][j];
printf("%d%c", sum, " \n"[i == n]);
}
return 0;
}
| 7 | CPP |
n = int(input())
d = [0 for i in range(5555)]
ans = 0
for i in range(n):
s=input().split()
x=int(s[1])
if s[0] == "win":
d[x] = ans+2**x
else:
ans=max(d[x],ans)
print(ans)
| 10 | PYTHON3 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"
using namespace std;
const long long int MOD = 1000000007;
int N;
bool num[100000];
vector<int>l;
int ans;
int main() {
ios::sync_with_stdio(false);
cin >> N;
for (int i = 0; i < N; i++)cin >> num[i];
l.push_back(-1);
for (int i = 0; i < N - 1; i++) {
if (num[i] == num[i + 1])l.push_back(i);
}
l.push_back(N-1);
int box = -1;
for (int i = 1; i < l.size() - 2; i++) {
ans = max(ans, l[i + 2] - l[i - 1]);
}
if (!ans)ans = N;
cout << ans << endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int x = 0, s, y, z;
string str, str1, str2;
cin >> str;
if (str.size() == 1) {
cout << 1 << "\n";
return 0;
}
str1 = "";
if (str[1] == '0') {
str1 += str[0];
s = 1;
while (str[s] == '0' && s < str.size()) {
str1 += str[s];
s++;
}
x = 1;
for (int i = s; i < str.size(); i++) {
if (i < (str.size() - 1)) {
if (str[i + 1] == '0') {
str2 = "";
str2 += str[i];
for (y = i + 1; str[y] == '0' && y < str.size(); y++) str2 += str[y];
z = y;
if (str2.size() > str1.size())
x = 1;
else if (str2.size() == str1.size()) {
y = 0;
for (int i = 0; i < str2.size() && !y; i++)
if (str2[i] > str1[i]) y = 1;
if (y)
x = 1;
else
x++;
} else
x++;
str1 += str2;
i = z - 1;
} else {
str1 += str[i];
x++;
}
} else {
if (str1.size() > 1) {
str1 += str[i];
x++;
} else {
if (str1[0] < str[1])
x = 1;
else {
str1 += str[i];
x++;
}
}
}
}
} else {
x = 1;
str1 += str[0];
for (int i = 1; i < str.size(); i++) {
if (i < (str.size() - 1)) {
if (str[i + 1] == '0') {
str2 = "";
str2 += str[i];
for (y = i + 1; str[y] == '0' && y < str.size(); y++) str2 += str[y];
z = y;
if (str2.size() > str1.size())
x = 1;
else if (str2.size() == str1.size()) {
y = 0;
for (int i = 0; i < str1.size() && !y; i++)
if (str2[i] > str1[i]) y = 1;
if (y)
x = 1;
else
x++;
} else
x++;
str1 += str2;
i = z - 1;
} else {
if (i != 1) {
str1 += str[i];
x++;
} else {
if (str1[0] < str[1])
x = 1;
else
x = 2;
str1 += str[i];
}
}
} else {
if (str1.size() > 1) {
str1 += str[i];
x++;
} else {
if (str1[0] < str[1])
x = 1;
else {
str1 += str[i];
x++;
}
}
}
}
}
cout << x << "\n";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);++i)
#define rep(i,n) REP(i, 0, n)
int K;
int dfs(const vector<int>& a, int d, int pos) {
if(pos == K) return d;
if(a[pos] == 0) return dfs(a, d, pos + 1);
int res = INF;
vector<int> temp = a;
REP(i, pos, K) {
temp[i] -= a[pos];
if(temp[i] < 0) temp[i] += 10;
res = min(res, dfs(temp, d + 1, pos + 1));
}
return res;
}
int main() {
cin.tie(0); ios::sync_with_stdio(false);
while(cin >> K && K) {
string s1, s2; cin >> s1 >> s2;
vector<int> a(K);
rep(i, K) a[i] = (int)(s2[i] - s1[i]);
for(int& k : a) if(k < 0) k += 10;
cout << dfs(a, 0, 0) << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
const int INF = 0x3f3f3f3f;
int n, a, b;
string s, pref = "";
int z[N];
int dp[N];
void calc(string s) {
reverse(s.begin(), s.end());
int n = s.size();
fill(z, z + n, 0);
int l = 0, r = 0;
for (int i = 1; i < n; i++) {
if (i <= r) {
z[i] = min(z[i - l], r - i + 1);
}
while (i + z[i] < n && s[i + z[i]] == s[z[i]]) {
z[i]++;
}
if (i + z[i] - 1 > r) {
l = i, r = i + z[i] - 1;
}
}
}
int main() {
memset(dp, INF, sizeof dp);
cin >> n >> a >> b;
cin >> s;
dp[0] = a;
pref += s[0];
for (int i = 1; i < n; i++) {
dp[i] = min(dp[i], dp[i - 1] + a);
pref.push_back(s[i]);
calc(pref);
reverse(z, z + (int)pref.size());
for (int pos = 0; pos < n; pos++) {
int len = z[pos];
if (i - len >= pos) {
dp[i] = min(dp[i], dp[i - len] + b);
} else {
dp[i] = min(dp[i], dp[pos] + b);
}
}
}
cout << dp[n - 1];
}
| 12 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}
int N;
vint vec;
void dfs(int n,int d){
if(d>100000000000ll)return;
if(n){
vec.pb(d);
}
dfs(n+1,d*10+2);
dfs(n+1,d*10+8);
}
bool C(int d){
if(d==1)return true;
stringstream ss;ss<<d;
string s=ss.str();
rep(i,s.size())if(s[i]!='2'&&s[i]!='8')return false;
return true;
}
signed main(){
cin>>N;
if(N==1){
puts("-1");
return 0;
}
dfs(0,0);
sort(all(vec));
reverse(all(vec));
map<int,int>prev;prev[N]=0;
for(int i=0;i<vec.size();i++){
map<int,int>next;
each(it,prev){
chmax(next[it->fi],it->se);
int tmp=it->fi,hoge=0;
while(tmp%vec[i]==0){
tmp/=vec[i];hoge++;
chmax(next[tmp],it->se+hoge);
}
}
prev=next;
}
int ans=-1;
each(it,prev){
if(C(it->fi))chmax(ans,it->se+(it->fi!=1));
}
cout<<ans<<endl;
return 0;
} | 0 | CPP |
import sys
def main():
n = int(sys.stdin.readline())
s = list(map(int, sys.stdin.readline().split()))
ans=1
cur = 1
for i in range(1,n):
if s[i]>s[i-1]:
cur+=1
else:
if cur>ans:
ans=cur
cur=1
if cur>ans:
ans=cur
print(ans)
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int n, c, t, ans = 0;
int a[maxn];
int main() {
int i, j, ui;
pair<int, int> u;
priority_queue<pair<int, int> > pq;
ios::sync_with_stdio(0);
cin >> n >> t >> c;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = 1; i < c; i++) {
pq.push(make_pair(a[i], i));
}
for (i = c; i <= n; i++) {
pq.push(make_pair(a[i], i));
u = pq.top();
ui = u.second;
while (ui < i - c + 1) {
pq.pop();
u = pq.top();
ui = u.second;
}
if (a[ui] <= t) {
ans++;
}
}
cout << ans;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long A,B,C;
cin>>A>>B>>C;
long counter=0;
while(counter<1000000&&A%2==0&&B%2==0&&C%2==0)
{int copyA,copyB,copyC;
copyA=(B+C)/2;
copyB=(A+C)/2;
copyC=(A+B)/2;
A=copyA;
B=copyB;
C=copyC;
counter++;
}
if(counter==1000000){cout<<-1<<endl;}
else{cout<<counter<<endl;}
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int nn;
struct mat {
long long a[85][85];
};
mat mul(mat a, mat b, long long mod) {
mat tt;
int i, j, k;
memset(tt.a, 0, sizeof(tt.a));
for (i = 0; i < nn; i++)
for (j = 0; j < nn; j++)
for (k = 0; k < nn; k++)
tt.a[i][j] = (tt.a[i][j] + a.a[i][k] * b.a[k][j] + mod) % mod;
return tt;
}
mat matpow(mat a, long long b, long long mod) {
mat s;
memset(s.a, 0, sizeof(s.a));
for (int i = 0; i < nn; i++) s.a[i][i] = 1;
while (b) {
if (b & 1LL) s = mul(s, a, mod);
a = mul(a, a, mod);
b = b >> 1;
}
return s;
}
void output(mat tt) {
for (int i = 0; i < nn; i++) {
for (int j = 0; j < nn; j++) printf("%lld ", tt.a[i][j]);
printf("\n");
}
}
int main() {
int m, tt, i, j, k, s, t;
long long q = 1000000007LL;
long long f[105][105], ans, n;
mat a, b, c, d;
memset(f, 0, sizeof(f));
for (i = 0; i <= 100; i++) {
f[i][0] = 1;
f[i][i] = 1;
for (j = 1; j < i; j++) f[i][j] = f[i - 1][j - 1] + f[i - 1][j];
}
while (scanf("%I64d%d", &n, &k) != EOF) {
memset(a.a, 0, sizeof(a.a));
a.a[2 * k + 2][k] = 1;
a.a[2 * k + 2][2 * k + 2] = 1;
for (i = 0; i <= k; i++)
for (j = 0; j <= i; j++) {
a.a[i][j] = f[i][j];
a.a[i + k + 1][j] = f[i][j];
a.a[i][j + k + 1] = f[i][j];
}
nn = 2 * k + 3;
b = matpow(a, n, q);
ans = 0;
for (i = 0; i <= 2 * k + 1; i++) ans = (ans + b.a[2 * k + 2][i] + q) % q;
printf("%I64d\n", ans);
}
return 0;
}
| 9 | CPP |
import sys
from decimal import *
input = sys.stdin.readline
def main():
t = int(input())
for _ in range(t):
H, C, T = [int(x) for x in input().split()]
if H == T:
print(1)
continue
if (H + C) / 2 == T:
print(2)
continue
if (H + C) / 2 > T:
print(2)
continue
def isOK(mid):
if ((H + C) * mid + H) / (2 * mid + 1) > T:
return True
else:
return False
ok = 0
ng = 10 ** 20
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if isOK(mid):
ok = mid
else:
ng = mid
if abs(Decimal(str(T)) - Decimal(str((H + C) * ok + H)) / Decimal(str(2 * ok + 1))) > abs(Decimal(str(T)) - Decimal(str((H + C) * ng + H)) / Decimal(str(2 * ng + 1))):
print(ng * 2 + 1)
else:
print(ok * 2 + 1)
if __name__ == '__main__':
main()
| 9 | PYTHON3 |
t = int(input())
for u in range(t):
n = int(input())
print((n*(n+1)*(n-1))//3) | 9 | PYTHON3 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
using namespace std;
int main(){
string s;
int k;
cin>>s>>k;
for(int i=0;i<s.size();++i){
int x='z'-s[i]+1;
if(s[i]=='a')
continue;
if(k>=x){
s[i]='a';
k-=x;
}
}
k%=26;
s[s.size()-1]+=k;
cout<<s<<endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int t;
cin >> t;
while (t--) {
int n, p;
cin >> n >> p;
set<pair<int, int>> e;
[&]() {
for (int l = 1; l < n; ++l)
for (int i = 0; i < n; ++i) {
int u = i, v = (i + l) % n;
if (u > v) swap(u, v);
e.insert({u, v});
if (e.size() == 2 * n + p) return;
}
}();
for (auto i : e) cout << i.first + 1 << " " << i.second + 1 << "\n";
}
return 0;
}
| 7 | CPP |
n=int(input())
a=[int(i) for i in input().split()]
a.sort()
a.reverse()
lst =a[0]+2
ans=0
for i in a:
cur=-1
for j in range (1,-2,-1):
if i+j>0 and i+j<lst:
cur=i+j
break
if cur==-1:
continue
ans+=1
lst=cur
print(ans)
| 11 | PYTHON3 |
from fractions import gcd
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
m = {}
z = 0
for i in range(n):
if b[i] != 0 and a[i] != 0 or (b[i] == 0 and a[i] != 0):
g = gcd(b[i], a[i])
el = (b[i] // g, a[i] // g)
if el in m:
m[el] += 1
else:
m[el] = 1
elif b[i] == a[i] == 0:
z += 1
print(max(m.values()) + z if m else z if z else 0)
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n <= 3)
cout << "NO\n";
else {
cout << "YES\n";
if (n == 4) {
cout << "1 + 3 = 4\n";
cout << "2 + 4 = 6\n";
cout << "4 * 6 = 24\n";
} else if (n % 2 == 0) {
cout << "1 + 5 = 6\n";
cout << "6 - 3 = 3\n";
cout << "3 - 2 = 1\n";
cout << "1 * 6 = 6\n";
for (int i = 7; i < n; i += 2) {
cout << i + 1 << " - " << i << " = "
<< "1\n";
cout << 1 << " * " << 6 << " = "
<< "6\n";
}
cout << "4 * 6 = 24\n";
} else {
cout << "1 + 5 = 6\n";
cout << "3 - 2 = 1\n";
cout << "1 * 6 = 6\n";
for (int i = 6; i < n; i += 2) {
cout << i + 1 << " - " << i << " = "
<< "1\n";
cout << 1 << " * " << 6 << " = "
<< "6\n";
}
cout << "4 * 6 = 24\n";
}
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename A>
inline std::istream& IN(A& a) {
return std::cin >> a;
}
template <typename A, typename... Args>
inline std::istream& IN(A& a, Args&... rest) {
std::cin >> a;
return IN(rest...);
}
inline std::ostream& OUT() { return std::cout << std::endl; }
template <typename A>
inline std::ostream& _OUT(const A& a) {
return std::cout << a;
}
template <typename A, typename... Args>
inline std::ostream& _OUT(const A& a, const Args&... rest) {
std::cout << a << " ";
return _OUT(rest...);
}
template <typename... Args>
inline std::ostream& OUT_(const Args&... args) {
_OUT(args...);
return std::cout << " ";
}
template <typename... Args>
inline std::ostream& OUT(const Args&... args) {
_OUT(args...);
return std::cout << std::endl;
}
template <typename T, typename U>
inline bool cmax(T& a, const U& b) {
return b > a ? a = b, true : false;
}
template <typename T, typename U>
inline bool cmin(T& a, const U& b) {
return b < a ? a = b, true : false;
}
long long mpow(long long x, long long n, long long mod = 1000000007) {
long long ret = 1;
for (x %= mod; n; x = x * x % mod, n >>= 1)
if (n & 1) ret = ret * x % mod;
return ret;
}
const int MOD = 1000000007;
const int _ = 1e5 + 10;
const int __ = 1e6 + 10;
long long n, m;
long long solve(long long n, long long m) {
if (n > m) swap(n, m);
if (n == 1) {
long long r = m % 6;
return m / 6 * 6 + r / 4 * 2 + r / 5 * 2;
}
if (n == 2) {
if (m <= 2) return 0;
if (m == 3) return 4;
if (m == 7) return 12;
return 2 * m;
}
if (n == 3) {
return 3 * m - (m & 1);
}
if (~m & 1) {
return n * m;
}
if (~n & 1) {
return n * m;
}
return n * m - 1;
long long ret = 0;
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
IN(n, m);
long long ret = solve(n, m);
OUT(ret);
return 0;
}
| 10 | CPP |
a = int(input())
for _ in range(a):
i =0
x = int(input())
li =list(map(int, input().split()))
while i<x and li[i]==1:
i +=1
print('Second' if (i==x)^(i%2) else 'First') | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define INF 0x7fffffffffff
typedef long long int LLI;
int N;
int M;
LLI ts[1145];
LLI ss[1145];
LLI vs[3145];
LLI hs[3145];
LLI dp[1145][3145];
int main() {
scanf("%d%d", &N, &M);
for (int i=1; i<=N; i++) {
scanf("%lld%lld", &vs[i], &hs[i]);
}
for (int i=1; i<=M; i++) {
scanf("%lld%lld", &ts[i], &ss[i]);
}
for (int i=0; i<=M; i++) {
for (int j=0; j<=N; j++) {
dp[i][j] = -INF;
}
}
dp[0][0] = 0;
for (int i=1; i<=M; i++) {
LLI accv = 0;
for (int j=0; j<=N; j++) {
accv += vs[j];
if (accv > ts[i]) break;
if (j >= 1) dp[i][j] = max(dp[i][j], dp[i-1][j-1]);
if (j >= 2) dp[i][j] = max(dp[i][j], dp[i][j-1] + llabs(hs[j-1]-hs[j]));
}
LLI acch = 0;
for (int j=0; j<=N; j++) {
dp[i][j] = max(dp[i][j], dp[i-1][j]);
acch += hs[j];
if (acch+dp[i][j] < ss[i]) dp[i][j] = -INF;
}
}
for (int i=0; i<=N; i++) {
if (dp[M][i] >= 0) {
LLI ans = ts[M];
for (int j=1; j<=i; j++) ans -= vs[j];
assert (ans >= 0);
printf("%lld\n", ans);
return 0;
}
}
puts("-1");
} | 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
int cnt=0;
int g[101];
int gn[101];
int x=1;
gn[0]=x;
int l=1;
while(1){
x*=2;
if(n<x)break;
gn[l]=x;
l++;
}
int m=l;
for(int i=m-1,j=0;i>=0;i--,j++){
g[j]=gn[i];
}
for(int i=0;i<m;i++){
//insert
for(int j=g[i];j<n;j++){
int v=a[j];
int k=j-g[i];
while(k>=0&&a[k]>v){
a[k+g[i]]=a[k];
k-=g[i];
cnt++;
}
a[k+g[i]]=v;
}
}
cout << m << endl;
for(int i=0;i<m;i++){
cout << g[i];
if(i+1!=m)cout << " ";
}
cout << endl;
cout << cnt<<endl;
for(int i=0;i<n;i++){
cout << a[i] << endl;
}
return 0;
} | 0 | CPP |
from collections import deque
from itertools import product
def bfs(x, y):
dist = [[10 ** 9] * w for _ in range(h)]
dist[y][x] = 0
que = deque([(x, y)])
while len(que) > 0:
x, y = que.popleft()
if (x, y) == (Dw - 1, Dh - 1):
return dist[y][x]
for i, j in product(range(-2, 3), repeat=2):
cnt = (abs(i) + abs(j) >= 2)
i, j = x + i, y + j
if (0 <= i < w and 0 <= j < h and
dist[j][i] > dist[y][x] + cnt and s[j][i] == '.'):
dist[j][i] = dist[y][x] + cnt
if cnt == 0:
que.appendleft((i, j))
elif cnt == 1:
que.append((i, j))
return -1
h, w = map(int, input().split())
Ch, Cw = map(int, input().split())
Dh, Dw = map(int, input().split())
s = [input() for _ in range(h)]
print(bfs(Cw - 1, Ch - 1))
| 0 | PYTHON3 |
t = int(input())
list = []
for i in range(t) :
h , m = [int(x) for x in input().split()]
list.append(h*60 + m)
list.sort()
c = 1
m = 1
for i in range(len(list) - 1) :
if list[i] == list[i + 1]:
c += 1
else :
m = max(m,c)
c = 1
print(max(m,c))
| 7 | PYTHON3 |
I=input
for _ in[0]*int(I()):
_,k,x=map(int,I().split());x-=1;p='a';a=[0];r=[0]
for y in I():
if y!=p:p=y;a+=0,
a[-1]+=1
for y in a[1::2][::-1]:m=k*y+1;r=[x%m]+r;x//=m
print(''.join(x*'a'+y*'b'for x,y in zip(a[::2],r))) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC diagnostic ignored "-Wmissing-declarations"
inline int safe_mul(const int x, const int y)
__attribute__((warn_unused_result));
int const mod = 998244353;
inline int safe_mul(const int x, const int y) {
return x * static_cast<long long>(y) % mod;
}
inline void safe_add(int& x, const int y) {
x += y;
if (x >= mod) x -= mod;
}
inline int safe_pow(int x, int y) {
int res = 1;
for (; y > 0; y >>= 1) {
if (y & 1) res = safe_mul(x, res);
x = safe_mul(x, x);
}
return res;
}
const int root_pw = 1 << 21;
int root;
int root_1;
void fft(vector<int>& a, bool invert) {
int n = (int)a.size();
for (int i = 1, j = 0; i < n; ++i) {
int bit = n >> 1;
for (; j >= bit; bit >>= 1) j -= bit;
j += bit;
if (i < j) swap(a[i], a[j]);
}
for (int len = 2; len <= n; len <<= 1) {
int wlen = invert ? root_1 : root;
for (int i = len; i < root_pw; i <<= 1) wlen = safe_mul(wlen, wlen);
for (int i = 0; i < n; i += len) {
int w = 1;
for (int j = 0; j < len / 2; ++j) {
int u = a[i + j], v = safe_mul(a[i + j + len / 2], w);
a[i + j] = u + v < mod ? u + v : u + v - mod;
a[i + j + len / 2] = u - v >= 0 ? u - v : u - v + mod;
w = safe_mul(w, wlen);
}
}
}
if (invert) {
int nrev = safe_pow(n, mod - 2);
for (int i = 0; i < n; ++i) a[i] = safe_mul(a[i], nrev);
}
}
int need;
vector<int> multiply(vector<int> a, vector<int> b) {
size_t n = 1;
while (n < max(a.size(), b.size())) n <<= 1;
n <<= 1;
a.resize(n, 0), b.resize(n, 0);
fft(a, false), fft(b, false);
for (size_t i = 0; i < n; ++i) a[i] = safe_mul(a[i], b[i]);
fft(a, true);
while (!a.empty() && (a.back() == 0 || a.size() > need + 1)) a.pop_back();
return a;
}
int solve(map<int, int> primes) {
vector<vector<int>> polys;
for (auto pa : primes) polys.emplace_back(pa.second + 1, 1);
while (polys.size() > 1) {
sort(begin(polys), end(polys),
[](const vector<int>& l, const vector<int>& r) {
return l.size() < r.size();
});
vector<vector<int>> npol;
for (size_t i = 1; i < polys.size(); i += 2) {
npol.emplace_back(multiply(polys[i - 1], polys[i]));
}
if (polys.size() & 1) npol.emplace_back(polys.back());
npol.swap(polys);
}
return polys.back()[need];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
for (int i = 1; i < mod; ++i) {
if (safe_pow(i, root_pw) == 1 && safe_pow(i, root_pw >> 1) != 1) {
root = i;
root_1 = safe_pow(root, mod - 2);
break;
}
}
int n;
cin >> n;
need = n / 2;
map<int, int> cnt;
while (n--) {
int p;
cin >> p;
++cnt[p];
}
cout << solve(cnt) << endl;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<long long> a;
vector<long long> b;
int main() {
std::ios_base::sync_with_stdio(false);
cin >> n >> m;
a.resize(n);
b.resize(m);
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < m; ++i) cin >> b[i];
sort(a.begin(), a.end());
sort(b.begin(), b.end());
long long ans = numeric_limits<long long>::min();
for (int forbidden = 0; forbidden < n; ++forbidden) {
long long tmp = numeric_limits<long long>::min();
for (int chosen_a = 0; chosen_a < n; ++chosen_a)
for (int chosen_b = 0; chosen_b < m; ++chosen_b)
if (chosen_a != forbidden) tmp = max(tmp, a[chosen_a] * b[chosen_b]);
if (ans == numeric_limits<long long>::min())
ans = tmp;
else
ans = min(ans, tmp);
}
cout << ans << endl;
return 0;
}
| 7 | CPP |
a = input()
p = a.rfind('a')
if p==-1:
q = len(a)
if q%2: print(":(")
else:
r = q//2
m = a[:r]
n = a[r:]
if m==n: print(n)
else: print(":(")
elif p==0:
q = len(a)
if q%2:
r = (q-1)//2
r += 1
m = a[1:r]
n = a[r:]
if m==n: print(a[:r])
else: print(":(")
else: print(":(")
else:
q = a[:p+1]
r = a[p+1:]
x = q.replace("a","")
c = r.find(x)
#print(c)
if c==-1: print(":(")
else:
d = r[:c]
e = r[c+len(x):]
#print(d)
#print(e)
if d==e: print(q+d)
else: print(":(")
| 8 | PYTHON3 |
for _ in range(int(input())):
n,x=map(int,input().split())
l=list(map(int,input().split()))
oc=len(list(filter(lambda x:(x%2!=0),l)))
ec=len(list(filter(lambda x:(x%2==0),l)))
if oc<x:
if oc>=1 and oc%2!=0 and x==n:
print("yes")
elif x<n and oc>=1:
print("yes")
else:
print("no")
if oc==x:
if ec>=1 and oc %2==0:
print('yes')
elif oc%2!=0:
print('yes')
else:
print('no')
if oc>x:
if x%2!=0:
print('yes')
elif ec>=1:
print('yes')
else:
print('no')
| 7 | PYTHON3 |
na=int(input())
a = list(map(int, input().strip().split(' ')))
nb=int(input())
b = list(map(int, input().strip().split(' ')))
check=False
for i in range (na):
for j in range (nb):
if check!=2:
check=False
x=a[i] + b[j]
for i1 in range (na):
if x==a[i1]:
check=True
break
if check!=True:
for j1 in range (nb):
if x==b[j1]:
check=True
break
if check==False:
print(a[i],b[j])
check=2
| 7 | PYTHON3 |
n = int(input())
set_ = set(list(map(int, input().split())))
setLen = len(set_)
minElement = min(set_)
for i in set_:
if i % minElement != 0:
print(-1)
exit()
print(minElement)
| 7 | PYTHON3 |
a=input()
t=a.index('^')
l,r=0,0
for k in range(t):
if 49<=ord(a[k])<=57:
l+=int(a[k])*(t-k)
for w in range(t,len(a)):
if 49<=ord(a[w])<=57:
r+=int(a[w])*(w-t)
if l>r:
print('left')
elif r>l:
print('right')
else:
print('balance')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r, c;
cin >> r >> c;
vector<string> s(r);
vector<vector<int> > a(r, vector<int>(c));
vector<vector<bool> > visited(r, vector<bool>(c));
pair<int, int> start, end;
for (int i = 0; i < r; i++) {
cin >> s[i];
for (int j = 0; j < c; j++) {
if (s[i][j] == 'S') {
start = make_pair(i, j);
} else if (s[i][j] == 'E')
end = make_pair(i, j);
else if (s[i][j] == 'T')
a[i][j] = -1;
}
}
visited[end.first][end.second] = true;
queue<pair<int, int> > q;
q.push(end);
a[end.first][end.second] = 0;
while (!q.empty()) {
pair<int, int> top = q.front();
q.pop();
int x = top.first;
int y = top.second;
if (x > 0 && !visited[x - 1][y] && a[x - 1][y] != -1) {
visited[x - 1][y] = true;
a[x - 1][y] = 1 + a[x][y];
q.push(make_pair(x - 1, y));
}
if (y > 0 && !visited[x][y - 1] && a[x][y - 1] != -1) {
visited[x][y - 1] = true;
a[x][y - 1] = 1 + a[x][y];
q.push(make_pair(x, y - 1));
}
if (x < r - 1 && !visited[x + 1][y] && a[x + 1][y] != -1) {
visited[x + 1][y] = true;
q.push(make_pair(x + 1, y));
a[x + 1][y] = 1 + a[x][y];
}
if (y < c - 1 && !visited[x][y + 1] && a[x][y + 1] != -1) {
visited[x][y + 1] = true;
q.push(make_pair(x, y + 1));
a[x][y + 1] = 1 + a[x][y];
}
}
int value = a[start.first][start.second];
int count = 0;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
if (a[i][j] != -1 && a[i][j] <= value && a[i][j] != 0) {
if (s[i][j] == 'E' || s[i][j] == 'S') continue;
int num = s[i][j] - '0';
count += num;
}
}
}
cout << count << endl;
}
| 10 | CPP |
#include<iostream>
#include<string>
int main(){
int n;
std::cin >> n;
int sum = 0, sum2 = 0;
for (int i = 0; i < n; i++){
std::string str, str2;
std::cin >> str >> str2;
if (str>str2)sum += 3;
else if (str < str2)sum2 += 3;
else sum++, sum2++;
}
std::cout << sum << " " << sum2 << std::endl;
return 0;
} | 0 | CPP |
import sys
numbers = [int(i) for i in sys.stdin.readline().split()]
M = numbers[0]
N = numbers[1]
if 1<=M<=N<=16:
b = M*N/2
print(int(b)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long OO = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
const double pi = 3.14159265359;
void skrrrt() { ios_base::sync_with_stdio(0), cin.tie(0); }
long long n, a[300009], b[300009];
int main() {
skrrrt();
int t;
cin >> t;
while (t--) {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += max(0ll, a[i] - (b[(i - 1 + n) % n]));
}
long long ans = 1e18;
for (int i = 0; i < n; i++) {
ans = min(ans, sum + (a[i] - max(0ll, a[i] - b[(i - 1 + n) % n])));
}
cout << ans << "\n";
}
}
| 9 | CPP |
import sys
nq = int(input())
lines = sys.stdin.readlines()
vector = []
for i in range(nq):
query, *arg = lines[i].split()
if query == '0': # pushback
vector.append(arg[0])
elif query == '1': # randaccess
print(vector[int(arg[0])])
elif query == '2': # pop
vector.pop()
else:
raise AssertionError
| 0 | PYTHON3 |
for i in range(int(input())):
w = input()
if (len(w)>10):
print(w[0] + str(len(w) - 2) + w[len(w)-1])
else:
print(w) | 7 | PYTHON3 |
n = int(input())
cur = 0
tar = list()
field = list()
for i in range(n):
line = list(map(int, input().split()))
field.append(line)
if 0 in line:
cur = sum(line)
else:
tar.append(sum(line))
if n == 1:
print(1)
else:
if len(set(tar)) > 1:
print(-1)
else:
candi = tar[0] - cur
if candi <= 0:
print(-1)
else:
flag = True
for i in range(n):
line = [field[j][i] for j in range(n)]
temp = sum(line)
if 0 in line:
temp += candi
if not temp == tar[0]:
flag = False
break
line = [field[i][i] for i in range(n)]
temp = sum(line)
if 0 in line:
temp += candi
if not temp == tar[0]:
flag = False
line = [field[i][n - 1 - i] for i in range(n)]
temp = sum(line)
if 0 in line:
temp += candi
if not temp == tar[0]:
flag = False
if flag:
print(candi)
else:
print(-1)
| 8 | PYTHON3 |
n,l,r,x = map(int,input().split(" "))
c = list(map(int, input().split()))
count =0
for num in range(1<<n):
v = [ c[i] for i in range(n) if num & (1<<i) >0]
if sum(v)<=r and sum(v)>=l:
if max(v)-min(v) >= x:
count=count+1
print(count)
| 8 | PYTHON3 |
from sys import stdin, stdout
cin = stdin.readline
cout = stdout.write
mp = lambda: list(map(int, cin().split()))
t, = mp()
for _ in range(t):
x, y, z = mp()
if z == y and y >= x:
cout('YES\n' + str(x) + ' ' + str(x) + ' ' + str(y) + '\n')
elif x == z and z >= y:
cout('YES\n' + str(x) + ' ' + str(y) + ' ' + str(y) + '\n')
elif x == y and x >= z:
cout('YES\n' + str(x) + ' ' + str(z) + ' ' + str(z) + '\n')
else:
cout('NO\n') | 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define N 100010
typedef long long ll;
inline ll read(){
ll x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n,f[N],dep[N],mx,cnt[N],x,lc[N];
vector<int> G[N];
bitset<N> dp[1333];
int s[N],vis[N],tot;
vector<int> z[N];
void dfs(int u){
dep[u]=dep[f[u]]+1;
++cnt[dep[u]],mx=max(mx,dep[u]);
if(G[u].empty())++lc[dep[u]];
for(auto v:G[u]){
dfs(v);
}
}
int ok[N];
void Find(int u,int t){
if(!u)return;
int o=0;
for(;o<(int)z[u].size();++o){
if(s[u]>t||dp[u-1][t])break;
t-=s[u],ok[z[u][o]]=1;
}
Find(u-1,t);
}
int main(){
n=read(),x=read();
for(int i=2;i<=n;++i){
f[i]=read();
G[f[i]].push_back(i);
}
dfs(1);
for(int i=1;i<=mx;++i){
if(vis[cnt[i]]){
z[vis[cnt[i]]].push_back(i);
}
else{
vis[cnt[i]]=++tot;
s[tot]=cnt[i];
z[tot].push_back(i);
}
}
dp[0][0]=1;
for(int i=1;i<=tot;++i){
dp[i]=dp[i-1];
int sz=z[i].size();
for(int g=1;g<=sz;g<<=1){
sz-=g;
dp[i]|=(dp[i]<<(g*s[i]));
}
if(sz)dp[i]|=dp[i]<<(sz*s[i]);
}
if(dp[tot][x]){
printf("%d\n",mx);
Find(tot,x);
for(int i=1;i<=n;++i){
putchar(ok[dep[i]]?'a':'b');
}
}
else{
int res=23333333;
for(int i=x;i>=0;--i){
if(dp[tot][i]){
res=i;
break;
}
}
Find(tot,res);
int pos=-1;
for(int i=1;i<=mx;++i){
if(!ok[i]&&lc[i]>=x-res){
pos=i;break;
}
}
printf("%d\n",mx+1);
for(int i=1;i<=n;++i){
if(dep[i]==pos&&G[i].empty()){
if(res==x){
putchar('b');
}
else putchar('a'),++res;
}
else putchar(ok[dep[i]]?'a':'b');
}
}
return 0;
}
| 12 | CPP |
#include<stdio.h>
int main()
{
double max,n,R,min;
//int n;
//long R,min;
max=0;min=0;
scanf("%lf",&n);
for(int i=0;i<n;i++)
{
scanf("%lf",&R);
if(i==0){min=R;}
if(i==1){max=R-min;}
if(max<R-min&&i>0)max=R-min;
if(min>R)min=R;
}
printf("%.0lf\n",max);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 40030;
int cnt[2];
long long X[maxn], Y[maxn];
vector<int> a[2], pos;
int main() {
for (int i = 0; i < 2; i++) scanf("%d", &cnt[i]);
for (int i = 0; i < 2; i++) {
for (int j = 0, x; j < cnt[i]; j++)
scanf("%d", &x), a[i].push_back((x + 10000) * 2);
}
for (int i = 0; i < cnt[0]; i++)
for (int j = 0; j < cnt[1]; j++) pos.push_back(a[0][i] + a[1][j] >> 1);
sort(pos.begin(), pos.end());
pos.erase(unique(pos.begin(), pos.end()), pos.end());
for (int i = 0; i < pos.size(); i++) {
int cur = 0;
long long x = 0, y = 0;
for (int j = 0; j < cnt[0]; j++) {
for (int k = 0; k < cnt[1]; k++) {
if ((a[0][j] + a[1][k] >> 1) == pos[i])
x |= (1LL << j), y |= (1LL << k);
}
}
X[i] = x, Y[i] = y;
}
int ans = 0;
for (int i = 0; i < pos.size(); i++) {
for (int j = 0; j < pos.size(); j++) {
ans = max(ans, __builtin_popcountll(X[i] | X[j]) +
__builtin_popcountll(Y[i] | Y[j]));
}
}
return !printf("%d\n", ans);
}
| 11 | CPP |
#include <iostream>
#include <cmath>
using namespace std;
int main(void){
int i,j,n;
double d,c[2][3];
cin>>n;
while(n--){
for(i=0;i<2;i++) for(j=0;j<3;j++) cin>>c[i][j];
d = sqrt( pow( c[1][0] - c[0][0], 2 ) + pow( c[1][1] - c[0][1], 2 ) );
if(c[0][2] <= c[1][2] && d + c[0][2] < c[1][2]){
cout<<"-2\n";
}
else if(c[0][2] >= c[1][2] && d + c[1][2] < c[0][2]){
cout<<"2\n";
}
else if(d > c[0][2] + c[1][2]){
cout<<"0\n";
}
else{
cout<<"1\n";
}
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &x) {
int f = 0;
x = 0;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) f |= (ch == '-');
for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
if (f) x = -x;
}
const long long mx = 10004205361450474ll;
const long long lim = 10000ll;
long long dp[6];
long long dfs(int k, long long l) {
if (k == 5) return l + min(lim, l) - 1;
int T = min(lim, l);
if (T == lim && dp[k]) return l + dp[k];
long long las = l, p = 0;
for (int t = (1); t <= (T + 1); t++) {
p = dfs(k + 1, las);
las = p + 2;
}
if (T == lim) dp[k] = p - l;
return p;
}
void solve(int k, long long l) {
int T = min(lim, l);
if (k == 5) {
printf("%d ", T);
for (int i = (1); i <= (T); i++) printf("%lld ", l - 1 + i);
fflush(stdout);
return;
}
vector<long long> pos;
long long las = l, p = 0;
for (int t = (1); t <= (T + 1); t++) {
p = dfs(k + 1, las);
if (t <= T) pos.push_back(p + 1);
las = p + 2;
}
printf("%d ", T);
for (auto x : pos) printf("%lld ", x);
fflush(stdout);
int ret;
read(ret);
if (ret == -1) exit(0);
if (ret == 0)
solve(k + 1, l);
else
solve(k + 1, pos[ret - 1] + 1);
}
int main() {
solve(1, 1);
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
long long x;
cin >> x;
while (x--) {
long long n, m;
cin >> n >> m;
vector<long long> a(m);
vector<long long> b(m);
for (long long i = 0; i < m; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b.begin(), b.end());
map<long long, set<long long>> realp;
for (long long i = 0; i < m; i++) {
realp[b[i]].insert(i);
}
vector<long long> taken(m, 0);
long long ans = 0;
for (long long i = 0; i < m; i++) {
auto it = realp[a[i]].end();
it--;
long long pos = *it;
realp[a[i]].erase(it);
for (long long j = 0; j < pos; j++) {
if (taken[j]) ans++;
}
taken[pos] = 1;
}
cout << ans << endl;
}
return 0;
}
| 10 | CPP |
for _ in range(int(input())):
n,w=map(int,input().split())
l=list(map(int,input().split()))
ans=[]
for a,b in enumerate(l):
ans.append([b,a+1])
ans.sort(reverse=True)
a=0
res=[]
for i in ans:
if a+i[0]<=w:
a+=i[0]
res.append(i[1])
if a>=(w+1)//2:
print(len(res))
print(*res)
else:
print(-1)
| 9 | PYTHON3 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;
const int Maxn = 200005;
int n, dep[Maxn];
vector <int> g[Maxn];
void dfs(int u, int par = 0) {
dep[u] = dep[par] + 1;
for (auto &v: g[u])
if (v != par) dfs(v, u);
}
int main(int argc, const char *argv[]) {
ios_base :: sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(12);
cin >> n, dep[0] = -1;
for (int i = 1; i < n; ++ i) {
int u, v; cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
dfs(1);
dfs(max_element(dep + 1, dep + n + 1) - dep);
int cnt = *max_element(dep + 1, dep + n + 1);
if (cnt % 3 == 1) cout << "Second\n";
else cout << "First\n";
} | 0 | CPP |
n,m=map(int,input().split())
a=[]
c=[]
d=[10000]*(n)
for i in range(m):
b=list(map(int,input().split()))
a.append(b)
k=0
for i in a:
if i[0]==1:
for j in range(i[1]-1,i[2]-1):
if j not in c:
c.append(j)
for i in a:
if i[0]==0:
if i[1]-1 in c and i[2]-2 in c:
t=0
for p in range(i[1]-1,i[2]-1):
if p not in c:
t=1
break
if t==0:
k=1
if k==1:
print("NO")
else:
for j in range(n-1):
if j in c:
d[j+1]=d[j]+1
else:
d[j+1]=d[j]-1
print("YES")
print(*d)
| 9 | PYTHON3 |
for _ in range(int(input())):
a, b = map(int, input().split())
c = a
a = max(a, b)
b = min(c, b)
x = max (a, b * 2)
print(x * x)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mxN=131071;
int n, lb, rb=1e7;
vector<array<int, 2>> c[mxN];
vector<array<ll, 2>> dp[mxN];
void dfs(int x, int u=0) {
if(!c[u].size()) {
dp[u]={{0, 0}};
return;
}
dfs(x, c[u][0][0]);
dfs(x, c[u][1][0]);
if(dp[c[u][0][0]].size()>dp[c[u][1][0]].size())
swap(c[u][0], c[u][1]);
vector<array<ll, 2>> v1, v2;
for(array<ll, 2> a : dp[c[u][0][0]]) {
int p=lower_bound(dp[c[u][1][0]].begin(), dp[c[u][1][0]].end(), array<ll, 2>{x-a[1]-c[u][0][1]-c[u][1][1]+1})-dp[c[u][1][0]].begin()-1;
if(~p) {
v1.push_back({a[0]+c[u][0][1], dp[c[u][1][0]][p][1]+c[u][1][1]});
if(!v2.size()||v2.back()[0]>dp[c[u][1][0]][p][1]+c[u][1][1])
v2.push_back({dp[c[u][1][0]][p][1]+c[u][1][1], a[0]+c[u][0][1]});
}
}
dp[u].clear();
for(int i=0, j=v2.size(); i<v1.size()||j; ) {
array<ll, 2> a;
if(!j||(i<v1.size()&&v1[i]<v2[j-1]))
a=v1[i++];
else
a=v2[--j];
if(!dp[u].size()||dp[u].back()[1]>a[1])
dp[u].push_back(a);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i=1, a, v; i<n; ++i) {
cin >> a >> v, --a;
c[a].push_back({i, v});
}
while(lb<rb) {
int mb=(lb+rb)/2;
dfs(mb);
if(dp[0].size())
rb=mb;
else
lb=mb+1;
}
cout << lb;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[3005][3005];
int b[3005][3005];
int s[3005][3005];
pair<int, int> q[9000000];
int sum(int x1, int y1, int x2, int y2) {
return s[y2][x2] - s[y2][x1 - 1] - s[y1 - 1][x2] + s[y1 - 1][x1 - 1];
}
int sum(int x, int y) {
return sum(x - 4, y - 4, x + 4, y + 4) - sum(x - 4, y - 4, x - 3, y - 3) -
sum(x - 4, y + 3, x - 3, y + 4) - sum(x + 3, y - 4, x + 4, y - 3) -
sum(x + 3, y + 3, x + 4, y + 4) - a[x - 4][y - 2] - a[x - 4][y + 2] -
a[x - 2][y - 4] - a[x - 2][y + 4] - a[x + 2][y - 4] - a[x + 2][y + 4] -
a[x + 4][y - 2] - a[x + 4][y + 2];
}
int look(int x, int y) {
int td = 0;
int sz = 1;
int cx, cy;
long long sx = 0, sy = 0;
int max2 = 0;
q[0].first = x;
q[0].second = y;
b[y][x] = 0;
while (td < sz) {
x = q[td].first;
y = q[td].second;
if (b[y - 1][x] == 1) {
b[y - 1][x] = 0;
q[sz].first = x;
q[sz].second = y - 1;
sz++;
}
if (b[y + 1][x] == 1) {
b[y + 1][x] = 0;
q[sz].first = x;
q[sz].second = y + 1;
sz++;
}
if (b[y][x - 1] == 1) {
b[y][x - 1] = 0;
q[sz].first = x - 1;
q[sz].second = y;
sz++;
}
if (b[y][x + 1] == 1) {
b[y][x + 1] = 0;
q[sz].first = x + 1;
q[sz].second = y;
sz++;
}
td++;
}
for (int i = 0; i < sz; i++) {
sx += q[i].first;
sy += q[i].second;
}
cx = sx / sz;
cy = sy / sz;
for (int i = 0; i < sz; i++) {
max2 = max(max2, (q[i].first - cx) * (q[i].first - cx) +
(q[i].second - cy) * (q[i].second - cy));
}
if (sz > max2 * 3) return 1;
return 2;
}
int main() {
int circles = 0, squares = 0;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &a[i + 500][j + 500]);
}
}
for (int i = 1; i < 3000; i++) {
for (int j = 1; j < 3000; j++) {
s[i][j] = s[i][j - 1] + a[i][j];
}
}
for (int i = 100; i < 2900; i++) {
for (int j = 100; j < 2900; j++) {
int t = 33 * a[i][j];
if (t >= 30) {
b[i][j] = 1;
}
}
}
for (int i = 100; i < 2900; i++) {
for (int j = 100; j < 2900; j++) {
if (b[i][j] == 1) {
int t = look(j, i);
if (t == 1) {
circles++;
} else {
squares++;
}
}
}
}
cout << circles << " " << squares;
return 0;
}
| 11 | CPP |
# https://codeforces.com/problemset/problem/69/A
n = int(input())
X = 0
Y = 0
Z = 0
for i in range(n):
x, y, z = [int(t) for t in input().split(" ")]
X += x
Y += y
Z += z
if X == Y == Z == 0:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
test_cases = int(input())
for case in range(test_cases):
n = int(input())
word = list(input())
sorted_word = sorted(word)
diff = 0
for elem1,elem2 in zip(word,sorted_word):
if elem1!=elem2:
diff += 1
print(diff) | 7 | PYTHON3 |
x=int(input())
for i in range(x):
n,m=map(int,input().split())
a=set(map(int,input().split()))
j=list(a)
j.sort()
max=0
for t in range(len(j)):
if j[t]-1-t>m:
break
else:
q=j[t]-1-t
s=j[t]+(m-q)
if s>max:
max=s
if j[0]-1-t>m:
print(m)
else:
print(max) | 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
vector<int> g[100000];
int c[100000],n;
void dfs(int r,int a){
stack<int> s;
s.push(r);
c[r]=a;
while(!s.empty()){
int u=s.top();
s.pop();
for(int i=0;i<g[u].size();i++){
int v=g[u][i];
if(c[v]==-1){
c[v]=a;
s.push(v);
}
}
}
}
void color(){
int id=1;
for(int i=0;i<n;i++) c[i]=-1;
for(int i=0;i<n;i++){
if(c[i]==-1) dfs(i,id++);
}
}
int main(){
int s,t,m,q;
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>s>>t;
g[s].push_back(t);
g[t].push_back(s);
}
color();
cin>>q;
for(int i=0;i<q;i++){
cin>>s>>t;
if(c[s]==c[t]) cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
return 0;
}
| 0 | CPP |
#include <iostream>
#include <string>
using namespace std;
string f[10] = {
"* = ****",
"* =* ***",
"* =** **",
"* =*** *",
"* =**** ",
" *= ****",
" *=* ***",
" *=** **",
" *=*** *",
" *=**** "
};
int main(){
string s;
bool flag = false;
while( cin >> s ){
string ans[10];
if( flag ){
cout << endl;
}else{
flag = true;
}
while( s.size() < 5 ){
s = "0" + s;
}
for(int i=0 ; i < s.size() ; i++ ){
ans[i] = f[s[i]-'0'];
}
for(int x=0 ; x < 8 ; x++ ){
for(int y=0 ; y < s.size() ; y++ ){
cout << ans[y][x];
}
cout << endl;
}
}
} | 0 | CPP |
n = int(input())
if (n == 2) or (n % 2 != 0):
print("NO")
elif n % 2 == 0:
print("YES")
| 7 | PYTHON3 |
# 1 2 5 4 3 6 7
for _ in range(int(input())):
n, q = map(int,input().split())
a = list(map(int,input().split()))
a.append(0)
count = 0
Pokemon = []
for i in range(n):
if a[i] > a[i+1] and count % 2 == 0:
Pokemon.append(a[i])
count += 1
if a[i] < a[i+1] and count % 2 == 1:
Pokemon.append(-a[i])
count += 1
Pokemon.append(a[-1])
if len(Pokemon) % 2 == 0:
Pokemon.pop()
print(sum(Pokemon))
| 9 | PYTHON3 |
a=int(input())
if a%2==0 :
print(0);
else:
print(1); | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
int ar[n + 1];
memset(ar, 0, sizeof(ar));
int m;
cin >> m;
for (long long int(i) = (0); (i) < (m); (i)++) {
int z;
cin >> z;
ar[z]++;
}
int k;
cin >> k;
for (long long int(i) = (0); (i) < (k); (i)++) {
int x;
cin >> x;
ar[x]++;
}
int flag = 0;
for (long long int(i) = (1); (i) < (n + 1); (i)++) {
if (ar[i] == 0) {
cout << "Oh, my keyboard!\n";
flag = 1;
break;
}
}
if (flag == 0) cout << "I become the guy.\n";
}
| 7 | CPP |
a,b = map(int, input().split())
ans = max(a+a-1,a+b,b+b-1)
print(ans) | 0 | PYTHON3 |
n = int(input())
sum = 0
for i in range(n) :
s = input()
if "++" in s :
sum += 1
else :
sum -= 1
print(sum)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
priority_queue<long long, vector<long long>, greater<long long>> pq;
pair<long long, long long> building[100005];
long long a[100005];
int n, m;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> building[i].first;
for (int i = 0; i < m; i++) cin >> building[i].second;
sort(building, building + m);
int ptr = 0, pos = 0;
int ans = 0;
for (int i = n - 1; i >= 0; i = pos) {
pos = i;
long long tot = 0;
for (; pos >= 0 && a[pos] <= a[i]; pos--) {
tot += a[pos];
}
for (; ptr < m && building[ptr].first <= a[i]; ptr++)
pq.push(building[ptr].second);
while (pq.size()) {
if (tot >= pq.top()) {
ans++;
tot -= pq.top();
pq.pop();
} else {
auto cur = pq.top();
pq.pop();
cur -= tot;
pq.push(cur);
break;
}
}
}
cout << ans << '\n';
}
| 16 | CPP |
#include <bits/stdc++.h>
using namespace std;
string s;
map<char, int> a;
int main() {
cin >> s;
for (int i = 0; i < (int)s.size(); i++) a[s[i]]++;
if (a['n'] == 0) {
cout << 0 << endl;
return 0;
} else
a['n']--;
cout << min(min(a['n'] / 2, a['i']), min(a['e'] / 3, a['t'])) << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v;
int x;
int n;
int i;
cin >> n;
int k;
int l = 0;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
for (i = 0; i < n; i++) {
x = v[i];
k = 1;
for (int j = i - 1; j >= 0; j--) {
if (x < v[j]) {
break;
}
x = v[j];
k++;
}
x = v[i];
for (int j = i + 1; j < n; j++) {
if (x < v[j]) {
break;
}
x = v[j];
k++;
}
if (k > l) l = k;
}
cout << l << endl;
return 0;
}
| 8 | CPP |
#include <iostream>
#include <math.h>
int main(void) {
long int in;
long int i = 2;
std::cin >> in;
std::cout << in << ":";
while (in != 1) {
if (i > sqrt(in)) {
std::cout << " " << in;
break;
} else if (in % i != 0) {
i += 1;
} else {
in = in / i;
std::cout << " " << i;
i = 2;
}
}
std::cout << std::endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool ispr[1010];
vector<int> pr;
void sieve() {
memset(ispr, 1, sizeof ispr);
ispr[0] = ispr[1] = 0;
for (int i = 2; i < 1010; i++) {
if (ispr[i]) {
pr.push_back(i);
for (int j = 2 * i; j < 1010; j += i) ispr[j] = 0;
}
}
}
vector<vector<int> > g;
int in[100010], out[100010], tmp;
void go(int i, int par = -1) {
in[i] = ++tmp;
for (int j = 0; j < g[i].size(); j++) {
if (g[i][j] != par) go(g[i][j], i);
}
out[i] = tmp;
}
int n, m;
int lazy[1 << 20];
bitset<1000> tr[1 << 20], emp, full;
void modify(int i, int v) {
v %= m;
tr[i] = ((tr[i] << v) & full) | (tr[i] >> (m - v));
}
void update(int i, int l, int r, int a, int b, int v) {
if (lazy[i]) {
modify(i, lazy[i]);
if (l != r) {
lazy[i * 2] = (lazy[i * 2] + lazy[i]) % m;
lazy[i * 2 + 1] = (lazy[i * 2 + 1] + lazy[i]) % m;
}
lazy[i] = 0;
}
if (l > b || r < a) return;
if (l >= a && r <= b) {
modify(i, v);
if (l != r) {
lazy[i * 2] = (lazy[i * 2] + v) % m;
lazy[i * 2 + 1] = (lazy[i * 2 + 1] + v) % m;
}
return;
}
update(i * 2, l, (l + r) / 2, a, b, v);
update(i * 2 + 1, (l + r) / 2 + 1, r, a, b, v);
tr[i] = tr[i * 2] | tr[i * 2 + 1];
}
void build(vector<int> &a) {
memset(lazy, 0, sizeof lazy);
for (int i = 0; i < (1 << 20); i++) tr[i].set(0);
for (int i = 0; i < n; i++) update(1, 0, (1 << 18), in[i], in[i], a[i]);
}
bitset<1000> get(int i, int l, int r, int a, int b) {
if (lazy[i]) {
modify(i, lazy[i]);
if (l != r) {
lazy[i * 2] = (lazy[i * 2] + lazy[i]) % m;
lazy[i * 2 + 1] = (lazy[i * 2 + 1] + lazy[i]) % m;
}
lazy[i] = 0;
}
if (l > b || r < a) return emp;
if (l >= a && r <= b) return tr[i];
return get(i * 2, l, (l + r) / 2, a, b) |
get(i * 2 + 1, (l + r) / 2 + 1, r, a, b);
}
int main() {
sieve();
scanf("%d %d", &n, &m);
;
emp.reset();
for (int i = 0; i < m; i++) full.set(i);
bitset<1000> prm;
for (int i = 0; i < pr.size() && pr[i] < m; i++) prm.set(pr[i]);
vector<int> a(n);
for (int i = 0; i < n; scanf("%d", &a[i++]))
;
g.clear();
g.resize(n);
for (int i = 0; i < n - 1; i++) {
int u, v;
scanf("%d %d", &u, &v);
;
g[u - 1].push_back(v - 1);
g[v - 1].push_back(u - 1);
}
tmp = -1;
go(0);
build(a);
int q;
scanf("%d", &q);
;
while (q--) {
int t;
scanf("%d", &t);
;
if (t == 1) {
int v, x;
scanf("%d %d", &v, &x);
;
update(1, 0, (1 << 18), in[v - 1], out[v - 1], x);
} else {
int v;
scanf("%d", &v);
;
bitset<1000> ret = get(1, 0, (1 << 18), in[v - 1], out[v - 1]) & prm;
printf("%d\n", ret.count());
}
}
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
double PI = 3.141592653589793238462643383279;
const double EPS = 1e-9;
const long long MOD = 1000000007;
const int inf = 1 << 30;
const long long linf = 1LL << 60;
long long n;
vector<pair<long long, long long> > x[2];
vector<long long> topr, topl, botr, botl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (long long i = 3; i <= n; i++) {
cout << 2 << " " << 1 << " " << 2 << " " << i << endl;
cout.flush();
long long v1;
cin >> v1;
cout << 1 << " " << 1 << " " << 2 << " " << i << endl;
cout.flush();
long long v2;
cin >> v2;
if (v1 > 0)
x[0].push_back(pair<long long, long long>(v2, i));
else
x[1].push_back(pair<long long, long long>(v2, i));
}
sort(x[0].begin(), x[0].end());
sort(x[1].begin(), x[1].end());
long long las = (long long)x[0].size() - 1;
for (int i = 0; i < (int)(long long)x[0].size() - 1; i++) {
cout << 2 << " " << 1 << " " << x[0][las].second << " " << x[0][i].second
<< endl;
cout.flush();
long long v;
cin >> v;
if (v < 0)
topr.push_back(x[0][i].second);
else
topl.push_back(x[0][i].second);
}
las = (long long)x[1].size() - 1;
for (int i = 0; i < (int)(long long)x[1].size() - 1; i++) {
cout << 2 << " " << 1 << " " << x[1][las].second << " " << x[1][i].second
<< endl;
cout.flush();
long long v;
cin >> v;
if (v < 0)
botl.push_back(x[1][i].second);
else
botr.push_back(x[1][i].second);
}
cout << 0 << " " << 1;
for (int i = 0; i < (int)botl.size(); i++) cout << " " << botl[i];
if (x[1].size()) cout << " " << x[1][(int)x[1].size() - 1].second;
for (int j = (int)botr.size() - 1; j >= 0; j--) cout << " " << botr[j];
cout << " " << 2;
for (int i = 0; i < (int)topr.size(); i++) cout << " " << topr[i];
if (x[0].size()) cout << " " << x[0][(int)x[0].size() - 1].second;
for (int j = (int)topl.size() - 1; j >= 0; j--) cout << " " << topl[j];
cout << endl;
cout.flush();
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int T, n;
long long a, b, c, lim[5][3];
bool flag;
struct Point {
long long x;
long long y;
long long z;
} OP, P;
long long low(long long x) {
if (x % 2 == 0) return x / 2;
return (x - 1) / 2;
}
bool test(long long rr) {
long long a[6], le[6], ri[6], k;
for (long long l = 0; l < 2; l++) {
flag = 0;
for (int i = 0; i < 4; i++) {
le[i] = low(lim[i][1] - l - rr + 1);
ri[i] = low(lim[i][0] - l + rr);
if (le[i] > ri[i]) flag = 1;
}
le[0] -= l;
ri[0] -= l;
if (flag) continue;
flag = 0;
if (le[1] + le[2] + le[3] > ri[0]) flag = 1;
if (ri[1] + ri[2] + ri[3] < le[0]) flag = 1;
if (!flag) {
if (le[1] + le[2] + le[3] <= le[0]) {
k = 0;
for (int i = 1; i < 4; i++) {
a[i] = le[i];
k += a[i];
}
for (int i = 1; i < 4; i++) {
if (k - a[i] + ri[i] >= le[0]) {
a[i] += le[0] - k;
break;
} else {
k = k - a[i] + ri[i];
a[i] = ri[i];
}
}
OP.x = a[2] + a[3] + l, OP.y = a[1] + a[3] + l, OP.z = a[1] + a[2] + l;
} else {
OP.x = le[2] + le[3] + l, OP.y = le[1] + le[3] + l,
OP.z = le[1] + le[2] + l;
}
return 1;
}
}
return 0;
}
long long calc(long long le, long long ri) {
if (le == ri) return le;
long long mid = le + (ri - le) / 2;
if (!test(mid))
return calc(mid + 1, ri);
else
return calc(le, mid);
}
int main() {
scanf("%d", &T);
while (T--) {
for (int i = 0; i < 4; i++) {
lim[i][0] = ((1LL << 62) - 1 << 1) + 1;
lim[i][1] = -((1LL << 62) - 1 << 1) + 1;
}
scanf("%d", &n);
while (n--) {
scanf("%I64d %I64d %I64d", &a, &b, &c);
if (lim[0][0] > a + b + c) lim[0][0] = a + b + c;
if (lim[0][1] < a + b + c) lim[0][1] = a + b + c;
if (lim[1][0] > -a + b + c) lim[1][0] = -a + b + c;
if (lim[1][1] < -a + b + c) lim[1][1] = -a + b + c;
if (lim[2][0] > a - b + c) lim[2][0] = a - b + c;
if (lim[2][1] < a - b + c) lim[2][1] = a - b + c;
if (lim[3][0] > a + b - c) lim[3][0] = a + b - c;
if (lim[3][1] < a + b - c) lim[3][1] = a + b - c;
}
test(calc(0, 3000000000000000005));
printf("%I64d %I64d %I64d\n", OP.x, OP.y, OP.z);
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct fastusualread {
inline int readint() {
char c;
while (c = getchar(), (c < '0' || c > '9') && c != '-')
;
bool flag = (c == '-');
if (flag) {
c = getchar();
}
int x = 0;
while (c >= '0' && c <= '9') {
x = x * 10 + c - 48;
c = getchar();
}
return flag ? -x : x;
}
inline long long readllint() {
char c;
while (c = getchar(), (c < '0' || c > '9') && c != '-')
;
bool flag = (c == '-');
if (flag) {
c = getchar();
}
long long x = 0;
while (c >= '0' && c <= '9') {
x = (long long)x * 10 + c - 48;
c = getchar();
}
return flag ? -x : x;
}
inline string readstring() {
char c;
while (c = getchar(), (c == ' ' || c == '\n'))
;
string s = "";
while (c != ' ' && c != '\n') {
s += c;
c = getchar();
}
return s;
}
inline string readlinestring() {
char c;
while (c = getchar(), (c == '\n'))
;
string s = "";
while (c != '\n') {
s += c;
c = getchar();
}
return s;
}
} fastread;
struct fastusualprint {
inline void printnum(int x) {
if (x < 0) {
putchar('-'), x = -x;
}
register short a[10] = {}, sz = 0;
while (x) {
a[sz++] = x % 10;
x /= 10;
}
if (sz == 0) {
putchar('0');
}
for (int i = sz - 1; i >= 0; i--) {
putchar('0' + a[i]);
}
}
inline void printnum(long long x) {
if (x < 0LL) {
putchar('-'), x = -x;
}
register short a[20] = {}, sz = 0;
while (x) {
a[sz++] = x % 10;
x /= 10;
}
if (sz == 0) {
putchar('0');
}
for (int i = sz - 1; i >= 0; i--) {
putchar('0' + a[i]);
}
}
inline void printstring(string s) {
for (auto x : s) {
putchar(x);
}
}
inline void printnumln(int x) {
if (x < 0) {
putchar('-'), x = -x;
}
register short a[10] = {}, sz = 0;
while (x) {
a[sz++] = x % 10;
x /= 10;
}
if (sz == 0) {
putchar('0');
}
for (int i = sz - 1; i >= 0; i--) {
putchar('0' + a[i]);
}
putchar('\n');
}
inline void printnumln(long long x) {
if (x < 0LL) {
putchar('-'), x = -x;
}
register short a[20] = {}, sz = 0;
while (x) {
a[sz++] = x % 10;
x /= 10;
}
if (sz == 0) {
putchar('0');
}
for (int i = sz - 1; i >= 0; i--) {
putchar('0' + a[i]);
}
putchar('\n');
}
inline void printstringln(string s) {
for (auto x : s) {
putchar(x);
}
putchar('\n');
}
} fastprint;
struct Team {
string name;
int a, b, c;
};
int n;
Team T[55];
void Add(const string &s, int a, int b) {
for (int i = 0; i < n; ++i) {
if (T[i].name == s) {
if (a > b)
T[i].a += 3;
else if (a == b)
T[i].a += 1;
T[i].b += a;
T[i].c += b;
break;
}
}
}
bool les1(const Team &a, const Team &b) {
if (a.a != b.a)
return a.a > b.a;
else if (a.b - a.c != b.b - b.c)
return a.b - a.c > b.b - b.c;
else
return a.b > b.b;
}
bool les2(const Team &a, const Team &b) { return a.name < b.name; }
int main() {
string a, b;
int c, d;
cin >> n;
for (int i = 0; i < n; ++i) cin >> T[i].name;
cin.ignore();
for (int i = 0; i < n * (n - 1) / 2; ++i) {
getline(cin, a, '-');
getline(cin, b, ' ');
scanf("%d:%d", &c, &d);
cin.ignore();
Add(a, c, d);
Add(b, d, c);
}
sort(T, T + n, les1);
sort(T, T + n / 2, les2);
for (int i = 0; i < n / 2; ++i) cout << T[i].name << endl;
fprintf(stderr, "\n\nSystem Time : %d ms", clock()), fflush(stderr);
return 0;
}
| 7 | CPP |
n = int(input())
for i in range (n):
k = int(input())
g = 0
s = 0
b = 0
gcount = 0
scount = 0
bcount = 0
bb = 0
m=list(map(int,input().split()))
for j in range(k):
if g == 0:
g += 1
gcount = m[j]
elif gcount == m[j]:
g += 1
elif s<=g:
scount = m[j]
s += 1
elif scount == m[j]:
s += 1
elif b<=g:
bcount = m[j]
b += 1
elif bcount == m[j]:
b += 1
else:
if bcount != m[j]:
bb = b
bcount = m[j]
b+=1
if (g+s+b)*2>k:
break
if bb == 0:
print(0,0,0)
else:
print(g,s,bb)
| 9 | PYTHON3 |
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
int main(){
ll n,sum=0,ans;
cin >> n;
ll a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
if(n%2==0){
sort(a,a+n);
for(int i=0;i<n/2-1;i++){
sum += a[n-1-i]*2;
}
sum += a[n-1-(n/2-1)];
for(int i=0;i<n/2-1;i++){
sum -=a[i]*2;
}
sum -=a[n/2-1];
ans = sum;
}else{
sort(a,a+n);
for(int i=0;i<n/2-1;i++){
sum += a[n-1-i]*2;
}
sum += a[n-1-(n/2-1)];
sum += a[n-2-(n/2-1)];
for(int i=0;i<n/2;i++){
sum -= 2*a[i];
}
ans = sum;
sum=0;
for(int i=0;i<n/2;i++){
sum += a[n-1-i]*2;
}
for(int i=0;i<n/2-1;i++){
sum -= 2*a[i];
}
sum -= a[n/2]+a[n/2-1];
ans = max(ans,sum);
}
cout <<ans<<endl;
}
| 0 | CPP |
#include "bits/stdc++.h"
#define ll long long
using namespace std;
void calc(int n,int r, vector<int>& ans) {
int digit = 1;
for (int i = 0; i <= r; i++) {
int temp = digit / n;
temp %= 10;
ans[i] += temp;
digit %= n;
digit *= 10;
}
}
int main() {
int n, k, m, r;
while (true) {
cin >> n >> k >> m >> r;
if (n == 0 && k == 0 && m == 0 && r == 0) break;
vector<int> ans(10055, 0);
calc(n,10050,ans);
if (m == 1) {
for (int i = 1; i < n;i++) {
calc(i*n, 10050, ans);
}
}
for (int i = 10050; i > 0;i--) {
ans[i - 1] += (ans[i] / 10);
ans[i] %= 10;
}
cout << ans[0] << ".";
for (int i = 1; i <= r;i++) cout << ans[i];
cout << endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class t, class u>
void chmax(t& first, u second) {
if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
if (second < first) first = second;
}
const int N = 1e3 + 3;
int mat[N][N], m[N];
int n, q, sm = 0;
void preprocess() {
for (int i = 0; i < n; i++) {
m[i] = mat[i][i];
sm += (m[i] == 1);
}
}
void flip_row(int i) {
m[i] = 1 - m[i];
if (m[i] == 0)
sm -= 1;
else
sm += 1;
}
void flip_col(int i) {
m[i] = 1 - m[i];
if (m[i] == 0)
sm -= 1;
else
sm += 1;
}
int main() {
scanf("%d", &n);
for (int row = int(0); row < int(n); row++)
for (int col = int(0); col < int(n); col++) scanf("%d", &mat[col][row]);
preprocess();
scanf("%d", &q);
for (int tc = int(0); tc < int(q); tc++) {
int type, index;
scanf("%d", &type);
if (type == 3) {
if (sm & 1)
printf("1");
else
printf("0");
}
if (type == 2) {
scanf("%d", &index);
--index;
flip_col(index);
}
if (type == 1) {
scanf("%d", &index);
--index;
flip_row(index);
}
}
return 0;
}
| 7 | CPP |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n,x1,y1,z1,w1,x2,y2,z2,w2;
while (cin>>n, n) {
for (int i=0; i<n; ++i) {
cin>>x1>>y1>>z1>>w1>>x2>>y2>>z2>>w2;
cout << (x1 * x2) - (y1 * y2) - (z1 * z2) - (w1 * w2) << " "
<< (x1 * y2) + (x2 * y1) + (z1 * w2) - (w1 * z2) << " "
<< (x1 * z2) + (z1 * x2) + (w1 * y2) - (y1 * w2) << " "
<< (x1 * w2) + (w1 * x2) + (y1 * z2) - (z1 * y2) << endl;
}
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
map<pair<long long int, long long int>, long long int> indexes;
vector<long long int> nb_below;
bool can_remove(const pair<long long int, long long int> c) {
auto it = indexes.find(make_pair(c.first, c.second + 1));
if (it != indexes.end() && nb_below[it->second] == 1) return false;
it = indexes.find(make_pair(c.first - 1, c.second + 1));
if (it != indexes.end() && nb_below[it->second] == 1) return false;
it = indexes.find(make_pair(c.first + 1, c.second + 1));
if (it != indexes.end() && nb_below[it->second] == 1) return false;
return true;
}
int main(int argc, char *argv[]) {
std::ios::sync_with_stdio(false);
vector<pair<long long int, long long int> > cubes;
long long int m;
cin >> m;
for (long long int i = 0; i < m; ++i) {
long long int x, y;
cin >> x >> y;
cubes.push_back(make_pair(x, y));
indexes[make_pair(x, y)] = i;
}
vector<vector<long long int> > below;
set<long long int> to_remove;
for (long long int i = 0; i < m; ++i) {
auto &c = cubes[i];
auto it = indexes.find(make_pair(c.first, c.second - 1));
vector<long long int> tmp_below;
if (it != indexes.end()) tmp_below.push_back(it->second);
it = indexes.find(make_pair(c.first - 1, c.second - 1));
if (it != indexes.end()) tmp_below.push_back(it->second);
it = indexes.find(make_pair(c.first + 1, c.second - 1));
if (it != indexes.end()) tmp_below.push_back(it->second);
below.push_back(tmp_below);
nb_below.push_back(tmp_below.size());
}
for (long long int i = 0; i < m; ++i) {
if (can_remove(cubes[i])) {
to_remove.insert(i);
}
}
long long int res = 0;
bool take_max = true;
while (to_remove.size()) {
long long int index = -1;
if (take_max)
index = *(to_remove.rbegin());
else
index = *(to_remove.begin());
auto &c = cubes[index];
res = (res * m + index) % 1000000009;
take_max = !take_max;
to_remove.erase(index);
indexes.erase(cubes[index]);
for (int i = -1; i <= 1; ++i) {
auto it = indexes.find(make_pair(c.first + i, c.second + 1));
if (it != indexes.end()) --nb_below[it->second];
}
for (int i = -2; i <= 2; ++i)
for (int j = 0; j <= 1; ++j) {
auto it = indexes.find(make_pair(c.first + i, c.second - j));
if (it != indexes.end()) {
if (can_remove(it->first))
to_remove.insert(it->second);
else
to_remove.erase(it->second);
}
}
}
cout << res << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 200005;
const int Maxk = 21;
int n, m, N;
vector<int> seq[Maxn];
int mx[Maxn];
vector<int> has[Maxn];
vector<vector<pair<long long, long long> > > dp[Maxn];
long long gcd(long long x, long long y) { return x ? gcd(y % x, x) : y; }
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
void Euclid(long long a, long long &x, long long b, long long &y,
long long &g) {
if (a == 0) {
x = 0;
y = 1;
g = b;
} else {
long long xx, yy;
Euclid(b % a, xx, a, yy, g);
x = yy - b / a * xx;
y = xx;
}
}
long long Mult(long long a, long long b, long long c) {
if (b == 0) return 0;
long long res = b % 2 ? a : 0;
long long got = Mult(a, b / 2, c);
res = (res + got + got) % c;
return res;
}
bool Solve(long long a, long long c, long long b, long long d, long long L,
long long &res) {
long long x, y, g;
Euclid(c, x, d, y, g);
if ((b - a) % g != 0) return false;
res = (b - a) / g % L;
if (res < 0) res += L;
res = Mult(res, abs(x), L);
if (x < 0) res = (L - res) % L;
res = Mult(c, res, L);
res = (res + a) % L;
return true;
}
pair<long long, long long> Join(const pair<long long, long long> &p1,
const pair<long long, long long> &p2) {
if (p1.first < 0 || p2.first < 0) return pair<long long, long long>(-1, 0);
long long L = lcm(p1.second, p2.second);
long long res;
if (Solve(p1.first, p1.second, p2.first, p2.second, L, res))
return pair<long long, long long>(res, L);
else
return pair<long long, long long>(-1, 0);
}
int Solve(int el) {
int ind = has[el].size() - 1, cand = dp[el].back().size() - 1;
int tk = 0;
pair<long long, long long> cur = pair<long long, long long>(1, 1);
while (cand >= 0 && ind >= 0 && has[el][ind] == has[el].back() - tk) {
if (cand >= dp[el][ind].size()) cand = dp[el][ind].size() - 1;
pair<long long, long long> nw = Join(cur, dp[el][ind][cand]);
if (nw.first >= 0) {
cur = nw;
tk += 1 << cand;
ind -= 1 << cand;
}
cand--;
}
return tk;
}
int main() {
scanf("%d %d", &n, &m);
N = 2 * n;
for (int i = 0; i < n; i++) {
int k;
scanf("%d", &k);
seq[i].resize(k);
for (int j = 0; j < k; j++) scanf("%d", &seq[i][j]);
seq[n + i].resize(k);
for (int j = 0; j < k; j++) seq[n + i][j] = seq[i][(j + 1) % k];
}
for (int i = 0; i < n; i++)
for (int j = 0; j < seq[i].size(); j++) {
int el = seq[i][j];
vector<pair<long long, long long> > V;
V.push_back(pair<long long, long long>(j, seq[i].size()));
for (int l = 1; (1 << l) - 1 <= dp[el].size() &&
has[el][dp[el].size() - (1 << l) + 1] == i - (1 << l) + 1;
l++)
V.push_back(
Join(V[l - 1], dp[el][dp[el].size() - (1 << l - 1)][l - 1]));
dp[el].push_back(V);
has[el].push_back(i);
mx[el] = max(mx[el], Solve(el));
}
for (int i = 1; i <= m; i++) printf("%d\n", min(mx[i], n));
return 0;
}
| 12 | CPP |
from collections import Counter
n=int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
lst = [-1]*n
cf = Counter(a)
cs = Counter(b)
miss1=0
miss2=0
for i in range(1,n+1):
if cf[i]==0:miss1=i
if cs[i]==0:miss2=i
s = 0
cnt=0
for i in range(n):
if a[i] == b[i]:
lst[i] = a[i]
s+=a[i]
else:
cnt+=1
if cnt == 1:
for i in range(n):
if lst[i]==-1:
print(((n*(n+1))//2)-s,end=" ")
else:
print(lst[i],end=" ")
elif cnt == 0:
for i in range(n):
if cf[a[i]]!=2:
print(a[i],end=" ")
else:
print(miss1,end="")
else:
pp = []
f = 0
qq = []
l = [miss1,miss2]
for i in range(n):
if lst[i]!=-1:
pp.append(lst[i])
qq.append(lst[i])
else:
if f == 0:
pp.append(miss1)
qq.append(miss2)
f=1
else:
pp.append(miss2)
qq.append(miss1)
first = 0
second = 0
for i in range(n):
if pp[i] not in [a[i],b[i]]:first =1
if qq[i] not in [a[i],b[i]]:second=1
if first == 0:
print(*pp)
else:
print(*qq)
| 8 | PYTHON3 |
t = int(input())
cases = []
for i in range(t):
cases.append(int(input()))
for n in cases:
arr = []
if n == 2:
print("1 6")
else:
for i in range(n-1):
arr.append("1")
arr.append(str(n))
print(" ".join(arr)) | 7 | PYTHON3 |
import math
t = int(input())
for a in range(t):
n = int(input())
pa = (n*(1 + n))//2
v = int(math.log(n,2)) + 1
pg = 2**(v) - 1
soma = pa - 2*pg
print(int(soma))
| 7 | PYTHON3 |
# import sys
# sys.stdin = open('in.txt', 'r')
a, b, p, x = map(int, input().split())
# A = [0, 1, 2, .. p-2, p-1] .. length = p
# B = [1, a, a^2, .. a^(p-2)] .. length = p - 1
# x * inv(x) * b = b
# a^x -> inv(a*x) * b
# 4 6 7 13
# [0, 1, 2, 3, 4, 5, 6]
# [0, 1, 2, 3, 4, 5]
# 2 3 5 8
# [0, 1, 2, 3]
# [0, 1, 2]
x += 1
res = 0
res += x//(p*(p-1)) * (p-1)
x -= x//(p*(p-1)) * (p*(p-1))
for i in range(p-1):
ap = (pow(a, (i)*(p-2)%(p-1), p) * b) % p
l = (x // (p-1)) + (1 if i < x%(p-1) else 0)
if i >= ap and i-ap < l:
res += 1
elif i < ap and i+p-ap < l:
res += 1
# print(ap, l, res)
print(res)
# for i in range(1, x+1):
# print(i*pow(a,i,p)%p, end=' ')
# if i % (p-1) == 0:
# print()
# print()
| 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, cntN[2][400010], cntM[2][400010];
char op[5], le[100010], ri[100010], up[100010], dn[100010];
bool revN[2][400010], revM[2][400010], revmarkN[2][400010], revmarkM[2][400010];
struct Matrix {
int a[2][2];
Matrix(int t = 0) { a[0][0] = a[0][1] = a[1][0] = a[1][1] = t; }
void operator+=(int t) {
a[0][0] += t;
a[0][1] += t;
a[1][0] += t;
a[1][1] += t;
}
Matrix operator*(Matrix t) const {
Matrix ans(1e9);
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
for (int k = 0; k < 2; k++)
ans.a[i][j] = min(ans.a[i][j], a[i][k] + t.a[k][j]);
return ans;
}
} sN[2][2][400010], sM[2][2][400010];
namespace Seg1 {
void pushupN(int rt) {
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
sN[i][j][rt] = sN[i][j][rt * 2 + 1] * sN[i][j][rt * 2];
}
void pushupM(int rt) {
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
sM[i][j][rt] = sM[i][j][rt * 2 + 1] * sM[i][j][rt * 2];
}
void pushdownN(int rt) {
if (revN[0][rt]) {
revN[0][rt * 2] ^= 1;
revN[0][rt * 2 + 1] ^= 1;
for (int i = 0; i < 2; i++) {
swap(sN[0][i][rt * 2], sN[1][i][rt * 2]);
swap(sN[0][i][rt * 2 + 1], sN[1][i][rt * 2 + 1]);
}
revN[0][rt] = 0;
}
if (revN[1][rt]) {
revN[1][rt * 2] ^= 1;
revN[1][rt * 2 + 1] ^= 1;
for (int i = 0; i < 2; i++) {
swap(sN[i][0][rt * 2], sN[i][1][rt * 2]);
swap(sN[i][0][rt * 2 + 1], sN[i][1][rt * 2 + 1]);
}
revN[1][rt] = 0;
}
}
void pushdownM(int rt) {
if (revM[0][rt]) {
revM[0][rt * 2] ^= 1;
revM[0][rt * 2 + 1] ^= 1;
for (int i = 0; i < 2; i++) {
swap(sM[0][i][rt * 2], sM[1][i][rt * 2]);
swap(sM[0][i][rt * 2 + 1], sM[1][i][rt * 2 + 1]);
}
revM[0][rt] = 0;
}
if (revM[1][rt]) {
revM[1][rt * 2] ^= 1;
revM[1][rt * 2 + 1] ^= 1;
for (int i = 0; i < 2; i++) {
swap(sM[i][0][rt * 2], sM[i][1][rt * 2]);
swap(sM[i][0][rt * 2 + 1], sM[i][1][rt * 2 + 1]);
}
revM[1][rt] = 0;
}
}
void buildN(int rt, int l, int r) {
if (l > r) return;
if (l == r) {
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++) {
sN[i][j][rt].a[0][1] = sN[i][j][rt].a[1][0] = m;
for (int k = 0; k < 2; k++) {
sN[i][j][rt].a[k][0] += (i ^ k ? le[l] == 'B' : le[l] == 'R') +
(j ^ k ? ri[l] == 'B' : ri[l] == 'R');
sN[i][j][rt].a[k][1] += (i ^ k ? le[l] == 'B' : le[l] == 'R') +
(j ^ k ? ri[l] == 'B' : ri[l] == 'R');
}
}
return;
}
int mid = (l + r) / 2;
buildN(rt * 2, l, mid);
buildN(rt * 2 + 1, mid + 1, r);
pushupN(rt);
}
void buildM(int rt, int l, int r) {
if (l > r) return;
if (l == r) {
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++) {
sM[i][j][rt].a[0][1] = sM[i][j][rt].a[1][0] = n;
for (int k = 0; k < 2; k++) {
sM[i][j][rt].a[k][0] += (i ^ k ? up[l] == 'B' : up[l] == 'R') +
(j ^ k ? dn[l] == 'B' : dn[l] == 'R');
sM[i][j][rt].a[k][1] += (i ^ k ? up[l] == 'B' : up[l] == 'R') +
(j ^ k ? dn[l] == 'B' : dn[l] == 'R');
}
}
return;
}
int mid = (l + r) / 2;
buildM(rt * 2, l, mid);
buildM(rt * 2 + 1, mid + 1, r);
pushupM(rt);
}
void updateN(int rt, int l, int r, int x, int y, int z) {
if (l > r || l > y || r < x) return;
if (l >= x && r <= y) {
revN[z][rt] ^= 1;
for (int i = 0; i < 2; i++)
if (z)
swap(sN[i][0][rt], sN[i][1][rt]);
else
swap(sN[0][i][rt], sN[1][i][rt]);
return;
}
pushdownN(rt);
int mid = (l + r) / 2;
updateN(rt * 2, l, mid, x, y, z);
updateN(rt * 2 + 1, mid + 1, r, x, y, z);
pushupN(rt);
}
void updateM(int rt, int l, int r, int x, int y, int z) {
if (l > r || l > y || r < x) return;
if (l >= x && r <= y) {
revM[z][rt] ^= 1;
for (int i = 0; i < 2; i++)
if (z)
swap(sM[i][0][rt], sM[i][1][rt]);
else
swap(sM[0][i][rt], sM[1][i][rt]);
return;
}
pushdownM(rt);
int mid = (l + r) / 2;
updateM(rt * 2, l, mid, x, y, z);
updateM(rt * 2 + 1, mid + 1, r, x, y, z);
pushupM(rt);
}
} // namespace Seg1
namespace Seg2 {
void pushupN(int rt) {
cntN[0][rt] = cntN[0][rt * 2] + cntN[0][rt * 2 + 1];
cntN[1][rt] = cntN[1][rt * 2] + cntN[1][rt * 2 + 1];
}
void pushupM(int rt) {
cntM[0][rt] = cntM[0][rt * 2] + cntM[0][rt * 2 + 1];
cntM[1][rt] = cntM[1][rt * 2] + cntM[1][rt * 2 + 1];
}
void pushdownN(int rt, int l, int r) {
int mid = (l + r) / 2;
if (revmarkN[0][rt]) {
revmarkN[0][rt * 2] ^= 1;
revmarkN[0][rt * 2 + 1] ^= 1;
cntN[0][rt * 2] = mid - l + 1 - cntN[0][rt * 2];
cntN[0][rt * 2 + 1] = r - mid - cntN[0][rt * 2 + 1];
revmarkN[0][rt] = 0;
}
if (revmarkN[1][rt]) {
revmarkN[1][rt * 2] ^= 1;
revmarkN[1][rt * 2 + 1] ^= 1;
cntN[1][rt * 2] = mid - l + 1 - cntN[1][rt * 2];
cntN[1][rt * 2 + 1] = r - mid - cntN[1][rt * 2 + 1];
revmarkN[1][rt] = 0;
}
}
void pushdownM(int rt, int l, int r) {
int mid = (l + r) / 2;
if (revmarkM[0][rt]) {
revmarkM[0][rt * 2] ^= 1;
revmarkM[0][rt * 2 + 1] ^= 1;
cntM[0][rt * 2] = mid - l + 1 - cntM[0][rt * 2];
cntM[0][rt * 2 + 1] = r - mid - cntM[0][rt * 2 + 1];
revmarkM[0][rt] = 0;
}
if (revmarkM[1][rt]) {
revmarkM[1][rt * 2] ^= 1;
revmarkM[1][rt * 2 + 1] ^= 1;
cntM[1][rt * 2] = mid - l + 1 - cntM[1][rt * 2];
cntM[1][rt * 2 + 1] = r - mid - cntM[1][rt * 2 + 1];
revmarkM[1][rt] = 0;
}
}
void buildN(int rt, int l, int r) {
if (l == r)
return cntN[0][rt] = (le[l] == 'B'), cntN[1][rt] = (ri[l] == 'B'), void();
int mid = (l + r) / 2;
buildN(rt * 2, l, mid);
buildN(rt * 2 + 1, mid + 1, r);
pushupN(rt);
}
void buildM(int rt, int l, int r) {
if (l == r)
return cntM[0][rt] = (up[l] == 'B'), cntM[1][rt] = (dn[l] == 'B'), void();
int mid = (l + r) / 2;
buildM(rt * 2, l, mid);
buildM(rt * 2 + 1, mid + 1, r);
pushupM(rt);
}
void updateN(int rt, int l, int r, int x, int y, int z) {
if (l > y || r < x) return;
if (l >= x && r <= y)
return revmarkN[z][rt] ^= 1, cntN[z][rt] = r - l + 1 - cntN[z][rt], void();
pushdownN(rt, l, r);
int mid = (l + r) / 2;
updateN(rt * 2, l, mid, x, y, z);
updateN(rt * 2 + 1, mid + 1, r, x, y, z);
pushupN(rt);
}
void updateM(int rt, int l, int r, int x, int y, int z) {
if (l > y || r < x) return;
if (l >= x && r <= y)
return revmarkM[z][rt] ^= 1, cntM[z][rt] = r - l + 1 - cntM[z][rt], void();
pushdownM(rt, l, r);
int mid = (l + r) / 2;
updateM(rt * 2, l, mid, x, y, z);
updateM(rt * 2 + 1, mid + 1, r, x, y, z);
pushupM(rt);
}
int queryN(int rt, int l, int r, int x, int y) {
if (l == r) return cntN[y][rt];
pushdownN(rt, l, r);
int mid = (l + r) / 2;
if (x <= mid)
return queryN(rt * 2, l, mid, x, y);
else
return queryN(rt * 2 + 1, mid + 1, r, x, y);
}
int queryM(int rt, int l, int r, int x, int y) {
if (l == r) return cntM[y][rt];
pushdownM(rt, l, r);
int mid = (l + r) / 2;
if (x <= mid)
return queryM(rt * 2, l, mid, x, y);
else
return queryM(rt * 2 + 1, mid + 1, r, x, y);
}
} // namespace Seg2
int solve() {
int l1 = Seg2::queryN(1, 1, n, 1, 0), r1 = Seg2::queryN(1, 1, n, 1, 1),
u1 = Seg2::queryM(1, 1, m, 1, 0), d1 = Seg2::queryM(1, 1, m, 1, 1),
f0 = m - cntM[0][1] + !l1 + !r1, f1 = cntM[0][1] + l1 + r1,
g0 = n - cntN[0][1] + !u1 + !d1, g1 = cntN[0][1] + u1 + d1, ans = 1e9;
Matrix sn = sN[0][0][1], sm = sM[0][0][1];
if (n == 1)
ans = min(ans, min(f0 + m - cntM[1][1], f1 + cntM[1][1]));
else {
int tf0 = min(f0 + sn.a[0][0], f1 + sn.a[0][1]),
tf1 = min(f0 + sn.a[1][0], f1 + sn.a[1][1]);
ans = min(ans, min(tf0 + m - cntM[1][1], tf1 + cntM[1][1]));
}
if (m == 1)
ans = min(ans, min(g0 + n - cntN[1][1], g1 + cntN[1][1]));
else {
int tg0 = min(g0 + sm.a[0][0], g1 + sm.a[0][1]),
tg1 = min(g0 + sm.a[1][0], g1 + sm.a[1][1]);
ans = min(ans, min(tg0 + n - cntN[1][1], tg1 + cntN[1][1]));
}
return ans;
}
int main() {
int q, x, y;
scanf("%d%d%d%s%s%s%s", &n, &m, &q, le + 1, ri + 1, up + 1, dn + 1);
Seg1::buildN(1, 2, n);
Seg1::buildM(1, 2, m);
Seg2::buildN(1, 1, n);
Seg2::buildM(1, 1, m);
cout << solve() << endl;
while (q--) {
scanf("%s%d%d", op, &x, &y);
if (op[0] == 'L')
Seg1::updateN(1, 2, n, x, y, 0), Seg2::updateN(1, 1, n, x, y, 0);
else if (op[0] == 'R')
Seg1::updateN(1, 2, n, x, y, 1), Seg2::updateN(1, 1, n, x, y, 1);
else if (op[0] == 'U')
Seg1::updateM(1, 2, m, x, y, 0), Seg2::updateM(1, 1, m, x, y, 0);
else
Seg1::updateM(1, 2, m, x, y, 1), Seg2::updateM(1, 1, m, x, y, 1);
printf("%d\n", solve());
}
return 0;
}
| 14 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int tc, n, a[N];
double mul(double x, double y) { return (x - y) * (x - y); }
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
double r, x1, x2, y1, y2;
cin >> r >> x1 >> y1 >> x2 >> y2;
double dis = mul(x1, x2) + mul(y2, y1);
dis = sqrt(dis);
int Ans = ceil(dis / (2 * r));
cout << Ans << "\n";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
string ans = "Yes";
if( S.find( "AC" ) == string::npos ) ans = "No";
cout << ans << endl;
}
| 0 | CPP |
def p(l):
n=len(l)
for i in range(n):
print(l[i],end="")
q=int(input())
for z in range(q):
n,m=map(int,input().split())
l=input()
ar=[]
for i in range(n):
ar=ar+[int(l[i])]
i=0
while(i<n and ar[i]==0):
i+=1
j=i+1
if(i>=n):
p(ar)
elif(i>m-1):
ar1=[0]*(i-m)+[1]*(m+1)
p(ar1)
else:
ar1=[1]*(i+1)
p(ar1)
while(True):
while(j<n and ar[j]==0):
j+=1
if(j<n):
if((j-i-1)>=(2*m)):
ar1=[1]*m+[0]*(j-i-2*m-1)+[1]*(m+1)
p(ar1)
else:
k=j-i-1
ar1=[1]*(k//2)
p(ar1)
if(k%2==1):
p([0])
ar1=[1]*(k//2+1)
p(ar1)
else:
break
i=j
j+=1
if(i>=n):
pass
elif((n-i-1)>=m):
ar1=[1]*m+[0]*(n-i-m-1)
p(ar1)
else:
ar1=[1]*(n-i-1)
p(ar1)
print() | 7 | PYTHON3 |
n=int(input())
s=str(input())
count1=s.count('0')
count2=s.count('1')
if(count1==count2):
print(2)
print(s[:-1],s[-1])
else:
print(1)
print(s)
| 7 | PYTHON3 |
c=0
f=0
n=int(input())
while n!=0:
d=n%10
n=n//10
if d==7 or d==4:
c=c+1
if c==0:
print("NO")
else:
while c!=0:
d1=c%10
c=c//10
if d1!=4 and d1!=7:
f=1
else:
f=0
if f==1:
print("NO")
else:
print("YES") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
valarray<int> x(n);
for (auto&& e : x) cin >> e;
int m = round(double(x.sum()) / n);
cout << pow(x - m, 2).sum() << endl;
}
| 0 | CPP |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
long long x, k, d;
cin >> x >> k >> d;
x = abs(x);
long long n = x / d, r = x % d;
if (n > k) cout << (x - k * d);
else if ((k - n) % 2) cout << abs(d - r);
else cout << r;
return 0;
} | 0 | CPP |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#define REP(i,n) for (int i=1;i<=(n);++i)
#define FOR(i,a,b) for (int i=(a);i<=(b);++i)
#define ROF(i,a,b) for (int i=(a);i>=(b);--i)
#define FEC(p,u) for (edge*p=head[u];p;p=p->nxt)
using namespace std;
typedef long long LL;
int n, m, q, a[110000];
int cur[110000], pre[110000], pr[110000], nx[110000];
bool vst[110000], ans = true;
int main(){
scanf("%d%d%d", &n, &m, &q);
REP(i,m) cur[i] = -i;
REP(i,q) {
scanf("%d", a+i);
pre[i] = cur[a[i]];
cur[a[i]] = i;
}
REP(i,m) cur[i] = q+1;
REP(i,m) pr[i] = i-1, nx[i] = i+1;
int step(0);
ROF(i,q,1) if (!vst[a[i]]) {
vst[a[i]] = true;
nx[pr[a[i]]] = nx[a[i]], pr[nx[a[i]]] = pr[a[i]];
++step;
int k = 1, j = i;
while (k <= n) {
while (j > 0 && j > cur[k]) j = pre[j];
if (cur[k] < 0 && j != -nx[-cur[k]]) ans = false;
if (cur[k] < 0) { cur[k] = j; break; }
else cur[k] = j;
++k; if (j > 0) j = pre[j];
}
}
REP(i,m) if (cur[i]<-step) ans = false;
if (ans) printf("Yes\n"); else printf("No\n");
return 0;
}
| 0 | CPP |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <bitset>
#include <string>
#include <cmath>
#include <set>
#include <map>
#define Rep(i, x, y) for (int i = x; i <= y; i ++)
#define Dwn(i, x, y) for (int i = x; i >= y; i --)
#define RepE(i, x) for (int i = pos[x]; i; i = g[i].nex)
#define ev g[i].y
#define eps 1e-10
using namespace std;
typedef long long ll;
typedef double db;
const int N = 20005, mod = 998244353;
char A[N], B[N];
int n, m, len;
ll fac[N], inv[N], f[2][N], ans;
ll mypow(ll x, int y) {
ll z = 1;
while (y) {
if (y & 1) (z *= x) %= mod;
y >>= 1; (x *= x) %= mod;
}
return z;
}
ll sqr(ll x) { return x * x % mod; }
ll C(int x, int y) { return fac[x] * inv[y] % mod * inv[x - y] % mod; }
int main()
{
scanf ("%s%s", A + 1, B + 1);
len = strlen(A + 1);
fac[0] = 1;
Rep(i, 1, len) fac[i] = fac[i - 1] * i % mod;
inv[len] = mypow(fac[len], mod - 2);
Dwn(i, len, 1) inv[i - 1] = inv[i] * i % mod;
Rep(i, 1, len) if (A[i] == '1') {
if (B[i] == '1') n ++;
else m ++;
}
// f[0][0] = 1;
Rep(i, 0, n) {
bool u = i & 1;
if (i) {
Rep(j, 0, m) f[u][j] = f[u ^ 1][j] * i * j % mod;
} else f[u][0] = 1;
Rep(j, 1, m) (f[u][j] += f[u][j - 1] * j * j) %= mod;
// cout << i<<" "<<f[u][m]<<endl;
(ans += f[u][m] * C(n, i) % mod * C(n + m, i + m) % mod * sqr(fac[n - i])) %= mod;
}
printf("%lld\n", ans);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
const int max_n = 1e6 + 1;
string G[max_n];
int sx, sy;
pair<int, int> mov[4] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
int possible_route(int x, int y) {
int cnt = 0;
for (int i = 0; i < 4; i++) {
int xn = x + mov[i].first, yn = y + mov[i].second;
if (0 <= xn && xn < n && 0 <= yn && yn < m && G[xn][yn] == '.') cnt++;
}
return cnt;
}
void dfs(int x, int y) {
for (int i = 0; i < 4; i++) {
int xn = x + mov[i].first, yn = y + mov[i].second;
if (xn < 0 || xn >= n || yn < 0 || yn >= m) continue;
if (G[xn][yn] == '.' && possible_route(xn, yn) <= 1) {
G[xn][yn] = '+';
dfs(xn, yn);
}
}
}
void solve() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> G[i];
int j = G[i].find('L');
if (j != -1) sx = i, sy = j;
}
dfs(sx, sy);
for (int i = 0; i < n; i++) cout << G[i] << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int t;
cin >> t;
while (t--) solve();
}
| 11 | CPP |
import sys
import math
import collections
input=sys.stdin.readline
n=int(input())
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
s=0
for i in range(n):
s+=a[i]*b[i]
m=s
k=s
for i in range(n-1):
s=k
l=i
r=i+1
while(l>-1 and r<n):
s+=(a[l]-a[r])*(b[r]-b[l])
m=max(m,s)
l-=1
r+=1
for i in range(n):
s=k
l=i
r=i
while(l>-1 and r<n):
s+=(a[l]-a[r])*(b[r]-b[l])
m=max(m,s)
l-=1
r+=1
print(m) | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template <typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
double startTime;
double getCurrentTime() {
return ((double)clock() - startTime) / CLOCKS_PER_SEC;
}
const int N = 2020;
const ll INF = (ll)1e18;
bool p[N];
ll query(ll x) {
printf("? %lld\n", x);
cerr << "? " << x << endl;
fflush(stdout);
scanf("%lld", &x);
cerr << "gcd " << x << endl;
return x;
}
void solve() {
ll C = (ll)1e9 / 2 / 2;
vector<ll> hv;
vector<ll> cur;
ll curProd = 1;
for (int i = 2; i < N; i++) {
if (!p[i]) continue;
ll cc = C;
for (int j = 0; j < 3; j++) cc /= i;
if (cc == 0) break;
if (INF / i < curProd) {
ll g = query(curProd);
while (!cur.empty()) {
if (g % cur.back() == 0) {
hv.push_back(cur.back());
if ((int)hv.size() <= 2) C *= 2;
C /= hv.back();
}
cur.pop_back();
}
curProd = 1;
}
cur.push_back((ll)i);
curProd *= i;
}
if (!cur.empty()) {
ll g = query(curProd);
while (!cur.empty()) {
if (g % cur.back() == 0) hv.push_back(cur.back());
cur.pop_back();
}
}
if ((int)hv.size() & 1) {
for (int i = 2; i < N; i++) {
if (!p[i]) continue;
bool fnd = false;
for (ll x : hv) fnd |= i == x;
if (!fnd) {
hv.push_back(i);
break;
}
}
}
ll ans = 2;
for (int i = 0; i < (int)hv.size(); i += 2) {
ll p1 = hv[i], p2 = hv[i + 1];
ll x1 = 1, x2 = 1;
while (x1 * p1 <= (ll)1e9) x1 *= p1;
while (x2 * p2 <= (ll)1e9) x2 *= p2;
ll g = query(x1 * x2);
int t1 = 1, t2 = 1;
while (g % p1 == 0) {
g /= p1;
t1++;
}
while (g % p2 == 0) {
g /= p2;
t2++;
}
ans *= t1 * t2;
}
printf("! %lld\n", max(8LL, ans));
cerr << "ans " << ans << endl;
fflush(stdout);
}
int main() {
startTime = (double)clock();
for (int i = 2; i < N; i++) p[i] = 1;
for (int i = 2; i < N; i++) {
if (!p[i]) continue;
for (int j = 2 * i; j < N; j += i) p[j] = 0;
}
int t;
scanf("%d", &t);
cerr << "tests = " << t << endl;
while (t--) solve();
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
long long ret = 0;
map<long long, int> M;
for (int i = 0; i < N; i++)
{
long long A;
cin >> A;
ret += M[i - A];
M[i + A]++;
}
cout << ret << endl;
return 0;
} | 0 | CPP |
for x in range(int(input())):
f = input()
print(f[0] + str(len(f) - 2) + f[-1] if len(f) > 10 else f) | 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int s,y,m;
int main(){
cin>>s;
y=s/100,m=s%100;
if(1<=m && m<=12){
if(1<=y && y<=12) cout<<"AMBIGUOUS";
else cout<<"YYMM";
} else{
if(1<=y && y<=12) cout<<"MMYY";
else cout<<"NA";
}
return 0;
}
| 0 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.