solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define erev(i, m, n) for(int i=n; i>=m; i--)
typedef long long int ll;
const ll MOD = 1000000007LL;
int N;
ll W;
ll w[222];
ll dp[11111];
ll v[222];
int main(int argc, char *argv[])
{
cin >> N >> W;
rep(i, N) cin >> w[i];
sort(w, w + N, greater<int>());
dp[0] = 1LL;
ll res = 0LL;
rep(i, N) v[N - i - 1] = v[N - i] + w[N - i - 1];
reverse(v, v + N + 1);
rep(i, N){
erev(j, 0, W){
if(W - w[i] < v[N - i - 1] + j && v[N - i - 1] + j <= W) res = (res + dp[j]) % MOD;
if(j - w[i] >= 0) dp[j] = (dp[j] + dp[j - w[i]]) % MOD;
}
}
cout << max(1LL, res) << endl;
return 0;
} | 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long x,p=100,step=0;
cin>>x;
while(p<x)
{
p+=p/100;
step++;
}
cout<<step<<endl;
}
| 0 | CPP |
t=int(input())
for i in range(t):
n,m=map(int,input().split())
emt=n*m
edg=(n*(m-1))+(m*(n-1))
if edg>emt:
print("NO")
else:
print("YES") | 7 | PYTHON3 |
n, m = map(int, input().split())
a = list(map(int, input().split()))
cnt = a[0] - 1
b = a[0]
for i in range(m - 1):
if a[i + 1] < b:
cnt += n - b + 1 + abs(a[i + 1] - 1)
elif a[i + 1] > b:
cnt += a[i + 1] - b
b = a[i + 1]
print(cnt)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000000;
const int MOD = 1000000007;
double r1[5005], p1[5005], p2[5005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) cin >> r1[i];
sort(r1 + 1, r1 + n + 1);
int m;
cin >> m;
for (int i = 1; i <= m; ++i) cin >> p1[i];
sort(p1 + 1, p1 + m + 1);
int k;
cin >> k;
for (int i = 1; i <= k; ++i) cin >> p2[i];
sort(p2 + 1, p2 + k + 1);
double A, B;
cin >> A >> B;
double ans = 0.0, P2 = p2[1];
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) {
double cur = sqrt((r1[i] * r1[i] * p1[j] * B) / (A * P2 + B * p1[j]));
if (cur < r1[i]) ans = max(ans, cur);
}
printf("%.6f\n", ans);
}
| 8 | CPP |
import sys
import math
from collections import defaultdict as dd
from sys import stdin
input=stdin.readline
m=10**9+7
sys.setrecursionlimit(10**5)
T=int(input())
for _ in range(T):
n=int(input())
arr=list(map(int,input().split()))
t1=0
f=0
for i in range(n-1):
t1^=arr[i]
t2=-1
c=0
for j in range(i+1,n):
if t1==t2:
t2=arr[j]
c+=1
continue
if t2==-1:
t2=arr[j]
else:
t2^=arr[j]
if t1==t2 or (c and t2==0):
f=1
break
if f:
print('YES')
else:
print('NO')
| 8 | PYTHON3 |
import math
n, k = map(int, input().split())
s = list(input())
alphabet = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']
ltrs = alphabet[:k]
if k == 2:
s1 = ("AB" * math.ceil(n/2))[:n]
s2 = ("BA" * math.ceil(n/2))[:n]
diff1, diff2 = 0, 0
for i in range(n):
if s1[i] != s[i]:
diff1 += 1
if s2[i] != s[i]:
diff2 += 1
if diff1 < diff2:
print(diff1)
print(s1)
else:
print(diff2)
print(s2)
exit()
c = 0
for i in range(1, n-1):
if s[i] == s[i-1]:
oneneed = 0
c += 1
for l in ltrs:
if l != s[i-1] and l != s[i+1]:
s[i] = l
oneneed = 1
break
if oneneed == 0:
for l in ltrs:
if l != s[i-1]:
s[i] = l
break
if n > 1:
if s[-1] == s[-2]:
for l in ltrs:
if l != s[-2]:
s[-1] = l
c += 1
break
print(c)
print(''.join(s))
| 9 | PYTHON3 |
def main():
a=input()
if a.find('1111111')>-1 or a.find('0000000')>-1:
print('YES')
else:
print('NO')
if __name__=='__main__':
main()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string to_string(bool b) { return b ? "TRUE" : "FALSE"; }
string to_string(char c) { return string(1, c); }
string to_string(string s) { return s; }
string yesno(bool b) { return b ? "YES" : "NO"; }
template <class T>
string dbg(T x) {
return to_string(x);
}
template <class K, class V>
string dbg(pair<K, V> p) {
return "(" + dbg(p.first) + "," + dbg(p.second) + ")";
}
template <class It>
string dbg(It it, It end) {
string _dbg_s = "[ ";
while (it != end) _dbg_s += dbg(*(it++)) + " ";
return _dbg_s + "]";
}
template <class T>
string dbg(vector<T> v) {
return dbg((v).begin(), (v).end());
}
template <class K, class V>
string dbg(map<K, V> m) {
return dbg((m).begin(), (m).end());
}
template <class K, class V>
string dbg(unordered_map<K, V> m) {
return dbg((m).begin(), (m).end());
}
template <class T>
void read(T &x) {
cin >> x;
}
template <class A>
void read(vector<A> &x) {
for (auto &a : x) read(a);
}
template <class A>
void print(vector<A> a) {
for (auto &x : a) cout << to_string(x) << " ";
}
void solve() {
int n;
cin >> n;
vector<int> a(n);
read(a);
unordered_map<int, int> last, maxDist;
for (int i = 0; i < n; i++) {
if (last.count(a[i])) {
maxDist[a[i]] = max(maxDist[a[i]], i - last[a[i]]);
} else {
maxDist[a[i]] = i + 1;
}
last[a[i]] = i;
}
for (auto &e : maxDist) maxDist[e.first] = max(e.second, n - last[e.first]);
vector<int> zs(n, INT_MAX);
for (auto &e : maxDist) {
if (e.second <= n) {
zs[e.second - 1] = min(zs[e.second - 1], e.first);
}
}
for (int i = 1; i < n; i++) zs[i] = min(zs[i], zs[i - 1]);
for (int i = 0; i < n; i++) {
if (zs[i] == INT_MAX) zs[i] = -1;
}
print(zs);
}
int main() {
ios::sync_with_stdio(false);
int t;
read(t);
for (int i = 0; i < t; i++) {
solve();
cout << "\n";
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[101][101];
int mid[101];
int d[101][101];
char prev_[101][101];
int main() {
int n;
scanf("%d", &n);
int i;
int sum = 0;
for (i = 0; i < n - 1; i++) {
scanf("%d", &a[0][i]);
}
for (i = 0; i < n - 1; i++) {
scanf("%d", &a[1][i]);
}
int min_ = 100000000, index_min = -1;
for (i = 0; i < n; i++) {
scanf("%d", &mid[i]);
}
for (i = 0; i < 2; i++) {
int j;
for (j = 0; j < n; j++) {
d[i][j] = 100000000;
prev_[i][j] = -1;
}
}
d[0][0] = 0;
for (i = 0; i < 2; i++) {
int j;
for (j = 0; j < n; j++) {
if ((i == 0) && (j == 0)) {
continue;
}
if (j - 1 >= 0) {
if (j != 0) {
if (d[i][j] > d[i][j - 1] + a[i][j - 1]) {
d[i][j] = d[i][j - 1] + a[i][j - 1];
prev_[i][j] = 'L';
}
}
}
if (i - 1 >= 0) {
if (d[i][j] > d[i - 1][j] + mid[j]) {
d[i][j] = d[i - 1][j] + mid[j];
prev_[i][j] = 'U';
}
}
}
}
sum += d[1][n - 1];
i = 1;
int j = n - 1;
while (prev_[i][j] != -1) {
if (prev_[i][j] == 'L') {
j--;
} else {
if (prev_[i][j] == 'U') {
i--;
index_min = j;
break;
}
}
}
mid[index_min] = 100000000;
for (i = 0; i < 2; i++) {
int j;
for (j = 0; j < n; j++) {
d[i][j] = 100000000;
}
}
d[0][0] = 0;
for (i = 0; i < 2; i++) {
int j;
for (j = 0; j < n; j++) {
if ((i == 0) && (j == 0)) {
continue;
}
if (j - 1 >= 0) {
if (j != 0) {
d[i][j] = min(d[i][j], d[i][j - 1] + a[i][j - 1]);
}
}
if (i - 1 >= 0) {
d[i][j] = min(d[i][j], d[i - 1][j] + mid[j]);
}
}
}
sum += d[1][n - 1];
printf("%d", sum);
return 0;
}
| 8 | CPP |
cntA, cntB, cntC = 0, 0, 0
for x in input():
if x == 'B':
cntA += 1
elif x == 'S':
cntB += 1
else:
cntC += 1
a, b, c = map(int, input().split())
x, y, z = map(int, input().split())
rr = int(input())
l = 0
r = int(1e13)
while r - l > 1:
m = (l + r) // 2
s = max(0, (m * cntA - a) * x) + max(0, (m * cntB - b) * y) + max(0, (m * cntC - c) * z)
if s <= rr:
l = m
else:
r = m
print(l) | 9 | PYTHON3 |
s = input()
K = int(input())
l = set([])
for i in range(len(s)):
for j in range(i, min(len(s),i+K)):
l.add(s[i:j+1])
l2 = list(l)
l2.sort()
print(l2[K-1]) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5;
vector<vector<int> >g;
int p1[N],p2[N];
int n,m,k;
int findset(int p[],int u)
{
if (p[u]<0) return u;
else return p[u]=findset(p,p[u]);
}
void Union(int p[],int u, int v)
{
if (p[u]>p[v]) swap(u,v);
p[u]+=p[v];
p[v]=u;
}
int main()
{
ios_base::sync_with_stdio(0);
cin>>n>>m>>k;
g.resize(n+1);
for(int i=1;i<=n;i++)
{
p1[i]=p2[i]=-1;
}
for(int i=1;i<=m;i++)
{
int u,v;
cin>>u>>v;
int t=findset(p1,u);
int s=findset(p1,v);
if (t!=s) Union(p1,t,s);
}
for(int i=1;i<=k;i++)
{
int u,v;
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
int t=findset(p2,u);
int s=findset(p2,v);
if (t!=s) Union(p2,t,s);
}
map<pair<int,int>,int> mp;
for(int u=1;u<=n;u++)
{
mp[make_pair(findset(p1,u),findset(p2,u))]++;
}
for(int u=1;u<=n;u++)
{
cout<<mp[make_pair(findset(p1,u),findset(p2,u))]<<' ';
}
return 0;
}
| 0 | CPP |
n,k=list(map(int,input().split(' ')))
a=list(map(int,input().split(' ')))
ans=0
for i in a:
if i >= a[k-1] and i>0 :
ans+=1
print(ans) | 7 | PYTHON3 |
a1=input("")
a2=input("")
a3=input("")
a= int(a1)
b = int(a2)
c= int(a3)
n=a+b+c
i=a*b*c
j = (a+b)*c
m =a*(b+c)
k=(a*b)+c
s = a+(b*c)
print(max(n,i,j,m,k,s) ) | 7 | PYTHON3 |
#include <stdio.h>
class Dice {
private:
int dev[6],tmp;
public:
void setNum(int i, int num) {
dev[i] = num;
}
int getNum(int i) {
return dev[i];
}
void e() {
tmp = dev[0];
dev[0] = dev[3];
dev[3] = dev[5];
dev[5] = dev[2];
dev[2] = tmp;
}
void n() {
tmp = dev[0];
dev[0] = dev[1];
dev[1] = dev[5];
dev[5] = dev[4];
dev[4] = tmp;
}
void s() {
tmp = dev[0];
dev[0] = dev[4];
dev[4] = dev[5];
dev[5] = dev[1];
dev[1] = tmp;
}
void w() {
tmp = dev[0];
dev[0] = dev[2];
dev[2] = dev[5];
dev[5] = dev[3];
dev[3] = tmp;
}
};
bool check(Dice dice1, Dice dice2) {
for (int i = 0; i < 6; i++) {
if (dice1.getNum(i) != dice2.getNum(i)) return false;
}
return true;
}
int main() {
int a;
char order;
Dice d1,d2;
for (int i = 0; i < 6; i++) {
scanf("%d", &a);
d1.setNum(i,a);
}
for (int i = 0; i < 6; i++) {
scanf("%d", &a);
d2.setNum(i,a);
}
for (int i = 0; i < 6; i++) {
for (int j = 0; j < 4;j++) {
if (check(d1,d2)) break;
d2.w();
}
if (check(d1,d2)) break;
if (i == 3) d2.w();
else if (i == 4) d2.s();
d2.s();
}
if (check(d1,d2)) printf("Yes\n");
else printf("No\n");
return 0;
}
| 0 | CPP |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define NUM 17
int N,K;
int POW[NUM];
int table_index,num_rest;
int table[6][3],work[3];
bool check[3];
string input[NUM];
vector<map<string,string>> dp(65536);
void makeTable(int index){
if(index == num_rest){
for(int i = 0; i < num_rest; i++){
table[table_index][i] = work[i];
}
table_index++;
return;
}
for(int i = 0; i < num_rest; i++){
if(check[i])continue;
check[i] = true;
work[index] = i;
makeTable(index+1);
check[i] = false;
}
}
string recursive(int state,string line){
if(state == POW[N]-1)return "";
if(dp[state].count(line))return dp[state][line];
string ret = "wrong";
int index;
bool FLG;
for(int loop = 0; loop < N; loop++){
if(state & (1 << loop))continue;
index = 0;
for(int i = 0; i < N; i++){
if(input[loop][index] == line[i]){
index++;
}
}
if(index != K)continue;
string next_line = input[loop];
reverse(next_line.begin(),next_line.end());
for(int i = 0; i < N; i++){
FLG = false;
for(int a = 0; a < K; a++){
if(next_line[a] == line[i]){
FLG = true;
break;
}
}
if(!FLG){
next_line += line[i];
}
}
ret = recursive(state+POW[loop],next_line);
if(ret != "wrong"){
ret = (char)('A'+loop)+ret;
break;
}
}
return dp[state][line] = ret;
}
int main(){
for(int i = 0; i < NUM; i++)POW[i] = pow(2,i);
scanf("%d %d",&N,&K);
getchar();
for(int i = 0; i < N; i++){
getline(cin,input[i]);
}
num_rest = N-K;
table_index = 0;
for(int i = 0; i < num_rest; i++){
check[i] = false;
}
for(int i = 0; i < num_rest; i++){
check[i] = true;
work[0] = i;
makeTable(1);
check[i] = false;
}
string ans = "TMP_ANS";
bool FLG;
for(int first = 0; first < N; first++){
string tmp = input[first];
reverse(tmp.begin(),tmp.end());
string rest;
for(int i = 0; i < N; i++){
FLG = false;
for(int a = 0; a < K; a++){
if(tmp[a] == 'A'+i){
FLG = true;
break;
}
}
if(!FLG){
rest += 'A'+i;
}
}
for(int loop = 0; loop < table_index; loop++){
string add;
for(int i = 0; i < num_rest; i++){
add += rest[table[loop][i]];
}
string line = tmp+add;
string ret = recursive(POW[first],line);
if(ret != "wrong"){
ans = min(ans,(char)('A'+first)+ret);
}
}
if(ans != "TMP_ANS")break;
}
printf("%s\n",ans.c_str());
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct P {
long long x, y;
bool operator<(const P &a) const { return x * a.y > a.x * y; }
};
vector<P> v[200011], v1[200011];
int i, n, d, m, k, a, b, c, e;
int o[511][555];
int l[205111];
int j[1];
int dx[10] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[10] = {1, 0, -1, 0, 1, -1, 1, -1},
dz[10] = {0, 0, 0, 0, 1, -1};
long long mod = 1000000007, mod2 = 1000000009, mod3 = 2017;
long long x, z, y;
double pi = 3.14159265;
P u[211111];
stack<int> s;
priority_queue<P> q;
char r[551];
bool as(int a, int b) { return a > b; }
int main() {
scanf("%d %d", &a, &b);
for (int t = 1; t <= a; t++) scanf("%lld", &u[t].x);
for (int t = 1; t <= a; t++) scanf("%lld", &u[t].y);
for (int t = 1; t <= a; t++)
if (u[t].x / u[t].y <= b) v1[u[t].x / u[t].y].push_back({u[t].x, u[t].y});
x = 2100000000000, y = 0;
for (; y < x;) {
long long h = (x + y) / 2;
n = 1, m = 0;
for (int t = 0; t <= 200000; t++)
for (int h = 0; h < v1[t].size(); h++) v[t].push_back(v1[t][h]);
for (; n <= b; n++) {
for (; v[m].size() == 0 && m < b; m++)
;
if (m == b) {
x = h;
break;
}
if ((m < n - 1) || (n < b && (v[m][v[m].size() - 1].x + h) / n <
v[m][v[m].size() - 1].y)) {
y = h + 1;
goto qwe;
} else {
if ((v[m][v[m].size() - 1].x + h) / v[m][v[m].size() - 1].y < b) {
P p = {v[m][v[m].size() - 1].x + h, v[m][v[m].size() - 1].y};
v[m].pop_back();
v[p.x / p.y].push_back({p.x, p.y});
} else {
v[m].pop_back();
}
}
}
x = h;
qwe:;
for (int t = 0; t <= 200000; t++)
for (; v[t].size(); v[t].pop_back())
;
}
if (x == 2100000000000)
puts("-1");
else
printf("%lld", x);
}
| 10 | CPP |
t=int(input())
for i in range(t):
n=int(input())
l=list(map(int,input().split()))
order=[]
c=[]
flag=[-1 for j in range(n)]
for j in range(1,n):
if l[j-1]<l[j]:
flag[j-1]=0
elif l[j-1]>l[j]:
flag[j-1]=1
else:
flag[j-1]=2
# print(flag)
var=-1
ze=-1
k=0
for k in range(n-2,-1,-1):
# print(flag[k])
if var==-2 and flag[k]==1:
# print("jk")
k=k+1
break
if flag[k]==1 and var!=-2:
var=1
if flag[k]==0:
var=-2
ze=1
if var==-2 and flag[k]==1:
# print("jk")
break
print(k)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, k, i;
cin >> n >> p >> k;
string str;
(p - k <= 1) ? (str = "") : (str = "<< ");
for (i = p - k; i <= p + k; i++) {
if (i >= 1 && i <= n) {
if (i == p) {
str += "(" + to_string(i) + ") ";
} else {
str += to_string(i) + " ";
}
}
}
if (i - 1 < n) {
str += ">>";
}
cout << str;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin>>N;
vector<int64_t> A(N);
for(int64_t i=0;i<N;i++){
int64_t j;
cin>>j;
A.at(i)=j-(i+1);
}
sort(A.begin(),A.end());
int64_t l=A.at(N/2),k=0;
for(int64_t &i:A)
k+=max(i-l,l-i);
cout<<k<<endl;
} | 0 | CPP |
from sys import stdin, stdout
from math import *
from heapq import *
from collections import *
def test(x1,x2,x3,sm):
c=x2+x3-sm
if (c>0):
a=x2-c
b=x3-c
if ((a>0) and (b>0)):
if (x1==(b+a)):
return True,a,b,c
return False,0,0,0
def main():
x=[int(x) for x in stdin.readline().split()]
sm=max(x)
x.sort()
x=x[:3]
# print(x)
permutations=[
[0,1,2],
[0,2,1],
[1,0,2],
[1,2,0],
[2,0,1],
[2,1,0]
]
for permu in permutations:
x1,x2,x3=x[permu[0]],x[permu[1]],x[permu[2]]
d,a,b,c=test(x1,x2,x3,sm)
if (d==True):
stdout.write("%d %d %d" %(a,b,c))
return 0
return 0
if __name__ == "__main__":
main() | 7 | PYTHON3 |
def gcd(num1, num2):
i = min(num1, num2)
while i > 0:
if num1 % i == 0 and num2 % i == 0:
return i
i -= 1
if __name__ == "__main__":
[a, b, n] = [int(x) for x in input().split()]
turn = 's'
while True:
if turn == 's':
simon = gcd(a, n)
if simon is not None and n - simon >= 0:
n -= simon
turn = 'a'
else:
print("1")
exit()
else:
anti_simon = gcd(b, n)
if anti_simon is not None and n - anti_simon >= 0:
n -= anti_simon
turn = 's'
else:
print("0")
exit()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int64_t n, t;
cin >> n >> t;
if (__builtin_popcountll(t) > 1) {
cout << "0\n";
return 0;
}
int len = 1;
for (int64_t y = n; y > 0; y >>= 1) len++;
vector<vector<int64_t>> p(len + 1, vector<int64_t>(len + 1));
for (int j = 1; j <= len; j++) p[1][j] = 1;
for (int i = 2; i <= len; i++)
for (int j = i; j <= len; j++) p[i][j] = p[i][j - 1] + p[i - 1][j - 1];
n++;
int x = __builtin_ctzll(t) + 1, counted = 0;
int64_t ans = __builtin_popcountll(n) == x;
for (int i = 40; i >= 0; i--) {
if ((n >> i) & 1) {
ans += p[x - counted + 1][i + 1];
counted++;
if (counted > x) break;
}
}
cout << ans - (x == 1) << '\n';
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
string b, a;
int ans = 1000000;
void qishiwu() {
a = b;
int len = a.size();
int i;
bool flag = 0;
for (i = len - 1; i >= 0; --i) {
if (a[i] == '5') {
flag = 1;
break;
}
}
if (flag == 0) return;
int cnt = 0;
for (int j = i; j < len - 1; ++j) {
swap(a[j], a[j + 1]);
cnt++;
}
flag = 0;
for (i = len - 1; i >= 0; --i) {
if (a[i] == '7') {
flag = 1;
break;
}
}
if (flag == 0) return;
for (int j = i; j < len - 2; ++j) {
swap(a[j], a[j + 1]);
cnt++;
}
for (i = 0; i < len - 2; ++i)
if (a[i] != '0') break;
ans = min(ans, cnt + i);
}
void linlin() {
a = b;
int len = a.size();
int i;
bool flag = 0;
for (i = len - 1; i >= 0; --i) {
if (a[i] == '0') {
flag = 1;
break;
}
}
if (flag == 0) return;
int cnt = 0;
for (int j = i; j < len - 1; ++j) {
swap(a[j], a[j + 1]);
cnt++;
}
flag = 0;
for (i = len - 2; i >= 0; --i) {
if (a[i] == '0') {
flag = 1;
break;
}
}
if (flag == 0) return;
for (int j = i; j < len - 2; ++j) {
swap(a[j], a[j + 1]);
cnt++;
}
for (i = 0; i < len - 2; ++i)
if (a[i] != '0') break;
ans = min(ans, cnt + i);
}
void wushi() {
a = b;
int len = a.size();
int i;
bool flag = 0;
for (i = len - 1; i >= 0; --i) {
if (a[i] == '0') {
flag = 1;
break;
}
}
if (flag == 0) return;
int cnt = 0;
for (int j = i; j < len - 1; ++j) {
swap(a[j], a[j + 1]);
cnt++;
}
flag = 0;
for (i = len - 1; i >= 0; --i) {
if (a[i] == '5') {
flag = 1;
break;
}
}
if (flag == 0) return;
for (int j = i; j < len - 2; ++j) {
swap(a[j], a[j + 1]);
cnt++;
}
for (i = 0; i < len - 2; ++i)
if (a[i] != '0') break;
ans = min(ans, cnt + i);
}
void ershiwu() {
a = b;
int len = a.size();
int i;
bool flag = 0;
for (i = len - 1; i >= 0; --i) {
if (a[i] == '5') {
flag = 1;
break;
}
}
if (flag == 0) return;
int cnt = 0;
for (int j = i; j < len - 1; ++j) {
swap(a[j], a[j + 1]);
cnt++;
}
flag = 0;
for (i = len - 1; i >= 0; --i) {
if (a[i] == '2') {
flag = 1;
break;
}
}
if (flag == 0) return;
for (int j = i; j < len - 2; ++j) {
swap(a[j], a[j + 1]);
cnt++;
}
for (i = 0; i < len - 2; ++i)
if (a[i] != '0') break;
ans = min(ans, cnt + i);
}
int main() {
cin >> b;
ershiwu();
qishiwu();
linlin();
wushi();
if (ans == 1000000)
puts("-1");
else
cout << ans;
return 0;
}
| 11 | CPP |
def main():
k, n, w = map(int, input().split())
w = w * (w + 1) // 2 * k
print(max(0, w - n))
if __name__ == "__main__":
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define minel *min_element
#define mxel *max_element
#define setp(n) setprecision(n) << std::fixed
#define sz(x) int((x).size())
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
int mpow(int base, int exp);
void ipgraph(int m);
//void dfs(int u, int par);
const int mod = 1000000007 ;
const int N = 1e6 + 16, M = N;
const int LN = 1e9;
//const int LLN = 1e16;
ll dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
//set insert,erase, count
//next_permutation(permutation.begin(),permutation.end())
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
//ll fexp(ll a, ll b){ll ans = 1;while(b){if(b&1) ans = ans*a%MOD; b/=2;a=a*a%MOD;}return ans;}
//ll inverse(ll a, ll p){return fexp(a, p-2);}
// bool sortbysec(const pll &a, const pll &b){return (a.second < b.second);}
//void ingraph(vvl& graph, ll m){ll x, y;fo(i, m){cin>>x>>y;x--, y--;graph[x].pb(y);graph[y].pb(x);}}
//ll modify(ll n){ll res = n;res%=MOD;res+=MOD;res%=MOD;return res;}
struct cmp
{
bool operator()(const pii &a, const pii &b)
{
int len1 = a.S - a.F + 1;
int len2 = b.S - b.F + 1;
if (len1 == len2)
{
return a.F < b.F;
}
return len1 > len2;
}
};
ll fac[N], inv[N], b[N];
int mpow(int base, int exp)
{
base %= mod;
int result = 1;
while (exp > 0)
{
if (exp & 1)
result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
void pre()
{
int i;
fac[0] = inv[0] = 1;
fac[1] = inv[1] = 1;
Fo(i, 2, N)
{
fac[i] = (i * fac[i - 1]) % mod;
inv[i] = (mpow(i, mod - 2) * inv[i - 1]) % mod;
}
}
ll C(int n, int r)
{
if (r > n)
return 0;
ll ans = fac[n];
ans *= inv[r];
ans %= mod;
ans *= inv[n - r];
ans %= mod;
return ans;
}
ll n;
vi permutation;
int chosen[100] = {0};
ll power(ll a, ll b)
{
ll ans = 1;
while (b--)
ans *= a;
return ans;
}
ll k;
ll m;
vi positions[1005];
//vi a1(1005);
int bk[1005];
// int calcmex()
// {
// int mex = n;
// memset(bk, 0, sizeof(bk));
// fo(j, n)
// {
// bk[a1[j]] = 1;
// }
// fo(j, n + 2)
// {
// if (bk[j] == 0)
// {
// mex = j;
// break;
// }
// }
// return mex;
// }
int link[N], size[N];
// int find(int a){
// while(link[a]!=a)a = link[a];
// return a;
// }
// int same(int a,int b){
// return (find(a) == find(b));
// }
// void unite(int a, int b){
// a = find(a);
// b = find(b);
// // if(size[a]<size[b])swap(a,b);
// // size[a]+=size[b];
// link[b] = a;
// }
// void prepare(int n){
// fo(i,n){
// link[i]=i;
// size[i]=1;
// }
// }
bool isPrime(ll x) {
for (ll d = 2; d * d <= x; d++) {
if (x % d == 0)
return false;
}
return true;
}
bool comparator(tuple<int, int, int> a, tuple<int, int, int> b)
{
if (get<0>(a) != get<0>(b))
{
return get<0>(a) > get<0>(b);
}
return (get<1>(a)) < (get<1>(b));
}
vector<ll> primes;
void sieve()
{
int n = 1e6;
int primess[n];
memset(primess, 0, sizeof(primess));
for (int i = 2; i * i <= n; i++)
{
if (primess[i] == 0)
{
primes.pb(i);
fo(j, n)
{
if (i * (j + 1) >= n)
break;
primess[i * (j + 1)] = -1;
}
}
}
}
int visited[26] = {0};
// int visitable[1000][1000] = {0};
vi adj[26];
set<int> deg[100006];
vi radj[100006];
int sub[100006] = {-1};
// int colors[1000006] = {0};
// int subtree[1000006] = {0};
// int cnt =0;
// char s[1000][1000];
vi ans;
vpii moves = {{0, 1}, {1, 0}, {0, -1},{-1, 0}};
int mandist(pii x1, pii x2){
return abs(x1.F - x2.F) + abs(x1.S-x2.S);
}
bool valid(int i,int j){
return i>=0 &&i<n&&j>=0&&j<m ;
}
bool cycledetected = false;
void dfs(int s, int e){
// cout<<"Entered "<<s<<" from" << e<<endl;
if(visited[s]==2)return;
if(visited[s]==1){
cycledetected = true;
return;
}
visited[s]=1;
for(auto xx: adj[s]){
if(xx == e)continue;
if(visited[xx]!=2){
dfs(xx,s);
}
}
ans.pb(s);
visited[s]=2;
// cout<<"Exited "<<s<<endl;
}
vector<long long> trial_division1(long long n) {
vector<long long> factorization;
for (long long d = 2; d * d <= n; d++) {
while (n % d == 0) {
factorization.push_back(d);
n /= d;
}
}
if (n > 1)
factorization.push_back(n);
return factorization;
}
void solve()
{
int n;
cin>>n;
vi a1(n);
fo(i,n)cin>>a1[i];
ll maxsave = 0;
fo(i,n){
int cursave = 0;
if(i==0){
cursave = abs(a1[i+1]-a1[i]);
}
else if(i== n-1){
cursave = abs(a1[n-2]- a1[n-1] );
}
else{
if(a1[i]<a1[i+1] && a1[i]<a1[i-1]){
cursave = min(a1[i+1], a1[i-1]) - a1[i];
cursave = cursave*2;
}
else if(a1[i]>a1[i+1] && a1[i]>a1[i-1]){
cursave = a1[i] - max(a1[i+1], a1[i-1]);
cursave = cursave*2;
}
}
maxsave = max((ll)cursave, maxsave);
}
ll count = 0;
fo(i,n-1){
count+= abs(a1[i+1] - a1[i]);
}
// deb2(maxsave, count);
cout<<count-maxsave<<endl;
}
//While checking consecutive equality in for loop, make sure you check count after loop
//ends
//madarchod... ll ka dekhlo
//ee
int main()
{
#ifndef ONLINE_JUDGE
freopen("./input.txt", "r", stdin);
freopen("./output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll t;
t = 1;
cin>>t;
while (t--)
{
solve();
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
void fre() {
freopen("c://test//input.in", "r", stdin);
freopen("c://test//output.out", "w", stdout);
}
template <class T1, class T2>
inline void gmax(T1 &a, T2 b) {
if (b > a) a = b;
}
template <class T1, class T2>
inline void gmin(T1 &a, T2 b) {
if (b < a) a = b;
}
const int N = 2e5 + 10, M = 0, Z = 1e9 + 7, inf = 0x3f3f3f3f;
template <class T1, class T2>
inline void gadd(T1 &a, T2 b) {
a = (a + b) % Z;
}
int casenum, casei;
int n;
int a[N];
int BF() {
int ans = 0;
for (int l = 1; l <= n; ++l) {
int val = 0;
for (int r = l; r <= n; ++r) {
val |= a[r];
bool flag = 1;
for (int i = l; i <= r; ++i)
if (val <= a[i]) {
flag = 0;
break;
}
ans += flag;
}
}
printf("%d\n", ans);
return ans;
}
int first[N][32];
int b[24];
int f[24][N];
void RMQinit() {
int L = log(n + 0.5) / log(2.0);
for (int j = 1; j <= n; ++j) f[0][j] = a[j];
for (int i = 1; i <= L; ++i) {
int len = b[i - 1] - 1;
for (int j = 1; j + len <= n; ++j) {
f[i][j] = max(f[i - 1][j], f[i - 1][j + len + 1]);
}
}
}
int lg2[N];
inline int check(int l, int r) {
int k = lg2[r - l + 1];
return max(f[k][l], f[k][r - b[k] + 1]);
}
int main() {
for (int i = 1; i <= 200000; ++i) {
lg2[i] = log(i + 0.5) / log(2.0);
}
for (int i = 0; i < 24; ++i) b[i] = 1 << i;
while (~scanf("%d", &n)) {
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
RMQinit();
for (int j = 0; j < 30; ++j) {
first[n + 1][j] = n + 1;
}
for (int i = n; i >= 1; --i) {
for (int j = 0; j < 30; ++j) {
first[i][j] = first[i + 1][j];
if (a[i] >> j & 1) first[i][j] = i;
}
}
long long ans = 0;
for (int i = 1; i <= n; ++i) {
int p = i;
int now = a[i];
while (p <= n) {
int rgt = n + 1;
for (int j = 0; j < 30; ++j)
if (~now >> j & 1) {
gmin(rgt, first[p][j]);
}
int can = 0;
if (now > check(i, p)) {
int l = p;
int r = rgt - 1;
while (l <= r) {
int mid = (l + r >> 1);
int val = check(i, mid);
if (now > val) {
can = mid - p + 1;
l = mid + 1;
} else {
r = mid - 1;
}
}
}
ans += can;
now |= a[rgt];
p = rgt;
}
}
printf("%lld\n", ans);
}
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 112345;
long long data[MAX], pre[MAX];
long long ans[MAX];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &data[i]);
}
sort(data + 1, data + 1 + n, greater<long long>());
for (int i = 1; i <= n; i++) pre[i] = data[i] + pre[i - 1];
for (long long i = 1; i < MAX; i++) {
long long cnt = 1;
long long st = 2;
long long step = i;
for (; st + step - 1 <= n; st += step, cnt++, step *= i) {
ans[i] += (pre[st + step - 1] - pre[st - 1]) * cnt;
}
if (st <= n) {
ans[i] += (pre[n] - pre[st - 1]) * cnt;
}
}
int q;
scanf("%d", &q);
while (q--) {
int t;
scanf("%d", &t);
printf("%lld ", ans[t]);
}
}
| 8 | CPP |
import math
[l, r, x, y] = map(int, input().split())
numpair = 0
for i in range(x, int(math.sqrt(x*y)) + 1, x):
if x*y%i == 0:
a = i
b = x*y//i
if l <= a <= r and l <= b <= r and math.gcd(a, b) == x:
numpair += 1
if a != b:
numpair += 1
print(numpair) | 8 | PYTHON3 |
n = int(input())
s = list(input())
count_a = 0
count_d = 0
for i in range(n):
if s[i] == 'D':
count_d += 1
else:
count_a += 1
if count_a == count_d:
print ('Friendship')
elif count_a > count_d:
print ('Anton')
else:
print ('Danik') | 7 | PYTHON3 |
m,n,o,p=map(int,input().split())
x=max(m,n,o,p)
if n==x:
p=n-p
o=n-o
m=n-m
print(p,o,m)
if m==x:
p=m-p
o=m-o
n=m-n
print(p,o,n)
if o==x:
p=o-p
n=o-n
m=o-m
print(p,n,m)
if p==x:
n=p-n
o=p-o
m=p-m
print(n,o,m) | 7 | PYTHON3 |
t = int(input())
for test in range(t):
s,i,e = map(int,input().split())
d = s - i
if d > 0:
d -= 1
f = max(e-d,0)
if f %2 == 0:
res = (e - f//2)+1
else:
res = (e-(f+1)//2)+1
elif d == 0:
if e > 0:
res = (e-1)//2+1
else:
res = 0
else:
d = i - s
if e < d + 1:
res = 0
else:
e = e - d - 1
res = e//2 + 1
print(res) | 7 | PYTHON3 |
import math
import sys
#def get_ints():
# return map(int, sys.stdin.readline().strip().split())
def inpu():
return sys.stdin.readline().strip()
#T = int(input())
lets = 'abcdefghijklmnopqrstuvwxyz'
key = {lets[i]:i for i in range(26)}
#for t in range(T):
#n = int(input())
n,m = map(int,input().split())
#s = list(map(int,input().split()))
#t = list(map(int,input().split()))
s = input()
t = input()
#b = inpu()
#a = input()
d = False
mins = [-1]*m
j = 0
for i in range(n):
if s[i] == t[j]:
mins[j] = i
j+=1
if j>=m:
break
maxs = [-1]*m
j = m-1
for i in range(n-1,-1,-1):
if s[i] == t[j]:
maxs[j] = i
j-=1
if j< 0:
break
ans = 0
for i in range(1,m):
ans = max(maxs[i]-mins[i-1],ans)
print(ans) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int MAX(int a, int b) { return (a > b) ? a : b; }
double MAX(double a, double b) { return (a > b) ? a : b; }
int MIN(int a, int b) { return (a < b) ? a : b; }
double MIN(double a, double b) { return (a < b) ? a : b; }
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int GCD(unsigned long long int a, unsigned long long int b) {
return b ? GCD(b, a % b) : a;
}
int LCM(int a, int b) { return a / GCD(a, b) * b; }
void swop(double &a, double &b) {
double c = a;
a = b;
b = c;
}
void swop(int &a, int &b) {
a = a ^ b;
b = a ^ b;
a = a ^ b;
}
long long int u(long long int a) {
if (a >= 0) return a;
return a * (-1);
}
int main() {
vector<int> c;
int j, n, i, a, b;
scanf("%d %d %d", &n, &a, &b);
for (i = 0; i < n; i++) {
scanf("%d", &j);
c.push_back(j);
}
sort(c.begin(), c.end());
printf("%d", c[n - a] - c[n - a - 1]);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base ::sync_with_stdio(false), cin.tie(0), cout.tie(0);
;
int n, k;
cin >> n >> k;
long long int sum = 0;
int flag = 1;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
for (int i = 0; i < v.size() && k > 0; i++) {
if (v[i] < 0) {
v[i] *= -1;
k--;
} else
break;
}
sort(v.begin(), v.end());
if (k > 0) {
if (k % 2 == 1) {
v[0] *= -1;
} else
v[0] = v[0];
}
for (long long int i = 0; i < v.size(); i++) {
sum += v[i];
}
cout << sum << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 5e18;
const long double pi = acos(-1.0);
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
inline long long mod(long long n, long long m) {
long long ret = n % m;
if (ret < 0) ret += m;
return ret;
}
long double rad(long double x) { return x * pi / 180.0; }
bool isleft(pair<long long, long long> a, pair<long long, long long> b,
pair<long long, long long> c) {
long long det = (b.first - a.first) * (c.second - a.second) -
(c.first - a.first) * (b.second - a.second);
if (det >= 0) return true;
if (det < 0) return false;
return false;
}
long long exp(long long a, long long b) {
long long result = 1;
while (b > 0) {
if (b & 1) result = mod(result * a, MOD);
b >>= 1;
a = mod(a * a, MOD);
}
return result;
}
long long grp[567891];
bool flag[567891];
vector<long long> adj[567891];
vector<long long> ps[567891];
long long ans[567891];
long long cnt;
void bfs(long long n, long long val) {
queue<long long> fila;
grp[n] = val;
cnt++;
for (long long &i : ps[n]) {
fila.push(i);
flag[i] = true;
}
while (!fila.empty()) {
long long g = fila.front();
fila.pop();
for (long long &i : adj[g]) {
if (grp[i] != -1) continue;
grp[i] = val;
cnt++;
for (long long &j : ps[i]) {
if (!flag[j]) {
fila.push(j);
flag[j] = true;
}
}
}
}
}
void solve() {
for (long long i = 0; i < 567891; i++) {
flag[i] = false;
grp[i] = -1;
}
long long n, m;
cin >> n >> m;
for (long long i = 0; i < m; i++) {
long long q;
cin >> q;
while (q--) {
long long x;
cin >> x;
adj[i].push_back(x);
ps[x].push_back(i);
}
}
long long aux = 1;
for (long long i = 1; i <= n; i++) {
if (grp[i] == -1) {
cnt = 0;
bfs(i, aux);
ans[grp[i]] = cnt;
aux++;
}
}
for (long long i = 1; i <= n; i++) {
cout << ans[grp[i]] << ' ';
}
cout << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long t = 1;
while (t--) solve();
}
| 9 | CPP |
import math
n=int(input())
l=list(map(int,input().split()))
l.sort()
for i in range(n-1,-1,-1):
if l[i] == 0:
print(l[i-1])
break
if l[i] < 0:
print(l[i])
break
else:
flag=1
for x in range(int(math.sqrt(l[i])),0,-1):
if x*x == l[i]:
flag=0
break
if flag==1:
print(l[i])
break
| 7 | PYTHON3 |
#include <bits/stdc++.h>
#define lowbit(x) ((x)&(-(x)))
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int maxn = 5e5 + 10;
int N;
LL A[500], S, X, D, ANS;
int main()
{
scanf("%d", &N);
for (int i = 1; i <= N; i++)
{
scanf("%lld", &A[i]);
if (i <= 2)
S += A[i];
else
X ^= A[i];
}
if (S - X < 0 || (S - X) % 2 != 0)
{
printf("-1\n");
return 0;
}
else
D = (S - X) / 2;
LL ANS = D;
for (int i = 60; i >= 0; i--)
{
int x = ((X >> i) & 1LL), d = ((D >> i) & 1LL);
if (d && x)
{
printf("-1\n");
return 0;
}
if (!d && x && (ANS | (1LL << i)) <= A[1])
ANS |= (1LL << i);
}
if (ANS == 0 || ANS > A[1])
printf("-1\n");
else
printf("%lld\n", A[1] - ANS);
return 0;
} | 0 | CPP |
n,k = map(int,input().split())
if(n%2==0):
h= int(n/2)
else:
h= int(n/2)+ 1
if(k<=h):
print(int((2*k)-1))
else:
print(int(2*(k-h)))
| 7 | PYTHON3 |
#include<bits/stdc++.h>
#define int long long
#define read(x) scanf("%lld",&x)
#define print(a,c) printf("%lld%c",a,c)
using namespace std;
int n,m,x;
signed main(){
int T;
read(T);
while(T--){
read(n),read(m),read(x);
int r=x%n;
if(r==0) r=n;
int c=x/n+(x%n>0);
print((r-1)*m+c,'\n');
}
return 0;
} | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
char z[103][103];
int r[103], c[103], i, j, n, sr, sc;
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%s", z[i]);
for (j = 1; j <= n; j++)
if (z[i][j - 1] == '.') r[i] = j;
}
for (j = 1; j <= n; j++)
for (i = 1; i <= n; i++)
if (z[i][j - 1] == '.') c[j] = i;
for (i = 1; i <= n; i++) sr += !!r[i], sc += !!c[i];
if (sr != n && sc != n) return printf("-1"), 0;
for (i = 1; i <= n; i++)
if (sr == n)
printf("%d %d\n", i, r[i]);
else
printf("%d %d\n", c[i], i);
}
| 7 | CPP |
import math
lines = []
j = 1
no_of_lines = int(input())
while True:
if no_of_lines >= j:
line = input()
lines.append(line)
j += 1
else:
break
k = 0
while k < no_of_lines:
lines[k] = str(lines[k]).split()
k += 1
i = 0
while i < no_of_lines:
if int(lines[i][0]) > 2:
floated = (int(lines[i][0]) - 2) / int(lines[i][1])
print(math.ceil(floated) + 1)
else:
print(1)
i += 1 | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int arr[1001][1001];
int row[1001], col[1001];
int main() {
int n, m, k;
scanf("%d %d %d", &n, &m, &k);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) scanf("%d", &arr[i][j]);
for (int i = 0; i < n; i++) row[i] = i;
for (int i = 0; i < m; i++) col[i] = i;
for (int i = 0; i < k; i++) {
char c;
int x, y;
scanf("%c", &c);
if (c == '\n') scanf("%c", &c);
scanf("%d %d", &x, &y);
if (c == 'r')
swap(row[x - 1], row[y - 1]);
else if (c == 'c')
swap(col[x - 1], col[y - 1]);
else
printf("%d\n", arr[row[x - 1]][col[y - 1]]);
}
}
| 8 | CPP |
print(__import__("math").factorial(min(map(int, input().split()))))
| 7 | PYTHON3 |
import sys
def input():
return sys.stdin.readline().strip()
def solve():
n = int(input())
num = list(map(int, list(input())))
for i in range(n):
if num[i] == 8 and n - i >= 11:
return 'YES'
return 'NO'
t = int(input())
for _ in range(t):
print(solve())
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
char s[maxn];
vector<int> ans[maxn];
int main() {
scanf("%s", s);
int l = strlen(s);
queue<int> a0, a1;
int flag = 0;
int cnt = 0;
for (int i = 0; i < l; i++) {
if (s[i] == '0') {
if (a1.empty()) {
cnt++;
a0.push(cnt);
ans[cnt].push_back(i + 1);
} else {
int t = a1.front();
a1.pop();
a0.push(t);
ans[t].push_back(i + 1);
}
} else {
if (a0.empty()) {
printf("-1\n");
flag = 1;
break;
} else {
int t = a0.front();
a0.pop();
a1.push(t);
ans[t].push_back(i + 1);
}
}
}
if (flag == 0) {
if (!a1.empty()) {
printf("-1\n");
} else {
printf("%d\n", cnt);
for (int i = 1; i <= cnt; i++) {
printf("%d", ans[i].size());
for (int j = 0; j < ans[i].size(); j++) {
printf(" %d", ans[i][j]);
}
printf("\n");
}
}
}
return 0;
}
| 7 | CPP |
n = int(input())
ts,hs = 0,0
for i in range(n):
t,h = input().split()
if t > h:
ts += 3
elif t < h:
hs += 3
else:
ts += 1
hs += 1
print(ts,hs)
| 0 | PYTHON3 |
r, x, y, xf, yf = list(map(int, input().split()))
from math import sqrt, ceil
distancia = sqrt((x-xf)**2 + (y-yf)**2)
# print(distancia)
print(int(ceil(distancia/(2*r)))) | 8 | PYTHON3 |
n, m = map(int, input().split())
a = 0 if n % m == 0 else 1
print(a) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
int c = 0;
cin >> a;
while (a / 10 != 0) {
a++;
while (a % 10 == 0) {
a /= 10;
}
c++;
}
c += 9;
cout << c;
}
| 7 | CPP |
tim = int(input())
while tim:
tim -= 1
t = input()
tag = True
for i in t:
if i != t[0]:
tag = False
break
if(tag):
print(t)
else:
for i in range(len(t)):
print(t[i], end='')
if i == len(t)-1:
break
if(t[i] == t[i+1]):
print((int(t[i])+1) % 2, end='')
print()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
int n;
cin >> n;
vector<int> v(n);
for (int i=0; i < n; i++) cin >> v[i];
vector<int> suff(n+1), pref(n+1);
suff[n] = 0;
pref[0] = 0;
vector<int> kek;
vector<int> indixes;
int t = 0;
for (int i=n-1; i >= 0; i--){
int ind = ((int) kek.size()) - 1;
while (kek.size() && indixes.size() && v[i] > kek.back()){
for (int j=indixes.back(); j < kek.size(); j++){
kek[j] *= 4;
t+=2;
}
if (kek[indixes.back()] * 4 > kek[indixes.back() - 1]) indixes.pop_back();
}
int r = 1, s = 0;
while (kek.size() && r*kek.back() < v[i]){
r *= 4, s++;
}
t += 2*((n-1)-i)*s;
if (kek.size() && 4*v[i] <= kek.back()) indixes.push_back((n-1)-i);
kek.push_back(v[i]);
suff[i] = t;
}
kek.clear(), indixes.clear(), t=0;
reverse(v.begin(), v.end());
for (int i=n-1; i >= 0; i--){
t++;
int ind = ((int) kek.size()) - 1;
while (kek.size() && indixes.size() && v[i] > kek.back()){
for (int j=indixes.back(); j < kek.size(); j++){
kek[j] *= 4;
t+=2;
}
if (kek[indixes.back()] * 4 > kek[indixes.back() - 1]) indixes.pop_back();
}
int r = 1, s = 0;
while (kek.size() && r*kek.back() < v[i]){
r *= 4, s++;
}
t += 2*((n-1)-i)*s;
if (kek.size() && 4*v[i] <= kek.back()) indixes.push_back((n-1)-i);
kek.push_back(v[i]);
pref[n-i] = t;
}
int ans = 1e18;
for (int i=0;i<=n;i++) ans = min(ans, pref[i] + suff[i]);
cout << ans;
return 0;
}
| 0 | CPP |
s = list(input())
s.reverse()
t = list(input())
if t==s:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
cin >> t;
while (t--) {
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
int last = 0;
for (int i = 1; i <= n; i++) {
if (d[i - 1] <= i) last = max(i, last);
}
cout << last + 1 << endl;
}
return 0;
}
| 8 | CPP |
q=input()
for i in range(len(q)):
if 'A'<= q[i] <='Z':
p=chr(ord(q[i])+32)
else:
p=q[i]
if p=="a"or p=="o"or p=="y"or p=="e"or p=="u"or p=="i":
continue
else:
print("."+p, end='')
| 7 | PYTHON3 |
while True:
n = int(input())
if n == 0:
break
on_mark = 0
for i in range(int(n/4)):
on_mark += int(input())
print(on_mark)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int a, b, s;
int x, y;
scanf("%d %d %d", &a, &b, &s);
x = abs(a) + abs(b);
y = (s - abs(a) - abs(b)) % 2;
if (s >= x && y == 0)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
const int maxn = 5005;
const int maxm = 30;
const double eps = 1e-6;
const double pi = acos(-1.0);
int n;
int num[maxn << 1][15];
struct Sam {
int last, cnt;
int tr[maxn << 1][maxm], nxt[maxn << 1];
int len[maxn << 1];
int in[maxn << 1];
int siz1[maxn << 1], siz2[maxn << 1];
queue<int> q;
void init() {
last = cnt = 1;
memset(tr, 0, sizeof(tr)), memset(nxt, 0, sizeof(nxt)),
memset(len, 0, sizeof(len));
memset(in, 0, sizeof(in));
memset(siz1, 0, sizeof(siz1));
memset(siz2, 0, sizeof(siz2));
while (!q.empty()) q.pop();
}
void add(int c) {
int p = last, np = ++cnt;
last = np, len[np] = len[p] + 1;
for (; p && !tr[p][c]; p = nxt[p]) tr[p][c] = np;
if (!p)
nxt[np] = 1;
else {
int q = tr[p][c];
if (len[p] + 1 == len[q])
nxt[np] = q;
else {
int nq = ++cnt;
len[nq] = len[p] + 1;
memcpy(tr[nq], tr[q], sizeof(tr[q]));
nxt[nq] = nxt[q], nxt[q] = nxt[np] = nq;
for (; tr[p][c] == q; p = nxt[p]) tr[p][c] = nq;
}
}
siz1[np] = 1;
}
void build(char *s) {
int Len = strlen(s);
for (int i = 0; i <= Len - 1; i++) add(s[i] - 'a');
}
void cal(char *s) {
int Len = strlen(s);
int now = 1;
for (int i = 0; i <= Len - 1; i++) {
int c = s[i] - 'a';
if (tr[now][c])
now = tr[now][c], siz2[now]++;
else {
while (tr[now][c] == 0 && now >= 1) now = nxt[now];
if (tr[now][c]) {
now = tr[now][c];
siz2[now]++;
} else
now = 1;
}
}
}
void calc() {
for (int i = 1; i <= cnt; i++) in[nxt[i]]++;
for (int i = 1; i <= cnt; i++)
if (in[i] == 0) q.push(i);
while (!q.empty()) {
int u = q.front();
q.pop();
siz1[nxt[u]] += siz1[u];
siz2[nxt[u]] += siz2[u];
in[nxt[u]]--;
if (in[nxt[u]] == 0) q.push(nxt[u]);
}
int ans = inf;
for (int i = 2; i <= cnt; i++)
if (siz1[i] == 1 && siz2[i] == 1) ans = min(ans, len[nxt[i]] + 1);
if (ans == inf) ans = -1;
printf("%d", ans), puts("");
}
} sam;
char s[maxn], t[maxn];
int main() {
scanf("%s", s), scanf("%s", t);
sam.init();
sam.build(s);
sam.cal(t);
sam.calc();
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000;
const double pi = acos(-1);
int n, x[maxn + 10], y[maxn + 10], acnt;
double a[maxn * 2 + 10];
long long ans;
long long calc(long long x) { return x * (x - 1) / 2; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d%d", &x[i], &y[i]);
for (int i = 1; i <= n; ++i) {
acnt = 0;
for (int j = 1; j <= n; ++j)
if (i != j) a[++acnt] = atan2(y[j] - y[i], x[j] - x[i]);
sort(a + 1, a + acnt + 1);
for (int j = 1; j <= acnt; ++j) a[j + acnt] = a[j] + pi * 2;
for (int j = 1, p = 1; j <= acnt; ++j) {
while (a[p] - a[j] < pi) ++p;
ans += calc(p - j - 1) * calc(acnt - p + j);
}
}
printf("%lld", ans / 2);
}
| 12 | CPP |
#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <cstring>
#include <functional>
#include <cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define rep1(i,n) for(int i=1;i<=(n);++i)
#define all(c) (c).begin(),(c).end()
#define fs first
#define sc second
#define pb push_back
#define show(x) cout << #x << " " << x << endl
struct cl{int v[4],x,y;};
int dx[9]={0,0,0,0,0,1,-1,2,-2};
int dy[9]={0,1,-1,2,-2,0,0,0,0};
int valid(int x,int y){
return 0<=x&&x<3&&0<=y&&y<3;
}
bool operator<(const cl& x,const cl& y){
rep(i,4) if(x.v[i]!=y.v[i]) return x.v[i]<y.v[i];
return x.x*4+x.y<y.x*4+y.y;
}
bool operator==(const cl& x,const cl& y){
rep(i,4) if(x.v[i]!=y.v[i]) return false;
return x.x*4+x.y==y.x*4+y.y;
}
int main(){
while(true){
int N;
cin>>N;
if(N==0) break;
cl be;
rep(i,4) be.v[i]=0;
be.x=1,be.y=1;
vector<cl> vc,nvc;
vc.pb(be);
rep(i,N){
int f[4][4];
rep(j,4) rep(k,4) cin>>f[j][k];
for(auto cloud:vc){
int v[4];
rep(j,4) v[j]=cloud.v[j]+1;
int x=cloud.x,y=cloud.y;
if(x==0&&y==0) v[0]=0;
if(x==0&&y==2) v[1]=0;
if(x==2&&y==0) v[2]=0;
if(x==2&&y==2) v[3]=0;
bool can=true;
rep(ii,2) rep(jj,2) if(f[x+ii][y+jj]) can=false;
rep(j,4) if(v[j]==7) can=false;
if(!can) continue;
rep(j,9){
int nx=x+dx[j],ny=y+dy[j];
if(!valid(nx,ny)) continue;
cl hoge;
rep(k,4) hoge.v[k]=v[k];
hoge.x=nx,hoge.y=ny;
nvc.pb(hoge);
}
}
sort(all(nvc));
nvc.erase(unique(all(nvc)),nvc.end());
vc=nvc;
nvc.clear();
// show(vc.size());
}
cout<<(vc.size()?1:0)<<endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = (1 << 14) + 5;
int n, m, i, j, t, k, s, f[maxn], ppc[maxn], Log[maxn], N, head[15];
int lst[maxn][15][15], fst[maxn][15][15], bac[maxn][4];
bool huan[maxn], g[maxn][15][15];
struct Edge {
int nxt, aim;
} edge[14 * 15];
inline void add_edge(int x, int y) {
edge[++N] = (Edge){head[x], y};
head[x] = N;
edge[++N] = (Edge){head[y], x};
head[y] = N;
}
void prt_route(int t0, int t1, int rout) {
if (ppc[rout] < 1) return;
printf("%d %d\n", 1 + t1, 1 + lst[rout][t0][t1]);
prt_route(t0, lst[rout][t0][t1], fst[rout][t0][t1]);
}
void prt(int stat) {
while (ppc[stat] > 1) {
prt_route(bac[stat][0], bac[stat][1], bac[stat][2]);
stat = bac[stat][3];
}
}
int main() {
scanf("%d%d", &n, &m);
for (i = 1; i <= m; ++i) {
scanf("%d%d", &t, &k);
--t;
--k;
add_edge(t, k);
g[(1 << t) | (1 << k)][t][k] = g[(1 << k) | (1 << t)][k][t] = 1;
lst[(1 << t) | (1 << k)][t][k] = t;
lst[(1 << t) | (1 << k)][k][t] = k;
}
Log[0] = -1;
for (i = 1; i < (1 << n); ++i) {
ppc[i] = ppc[i >> 1] + (i & 1);
Log[i] = Log[i >> 1] + 1;
for (j = 0; j < n; ++j)
if ((i >> j) & 1)
for (k = 0; k < n; ++k)
if (((i >> k) & 1) && (j ^ k) && g[i][j][k])
for (t = head[k]; t; t = edge[t].nxt) {
s = edge[t].aim;
if ((s == j && ppc[i] > 2) || 0 == ((i >> s) & 1)) {
g[i | (1 << s)][j][s] = 1, fst[i | (1 << s)][j][s] = i,
lst[i | (1 << s)][j][s] = k;
}
}
}
memset(f, 0x3f3f3f3f, sizeof(f));
f[0] = 0;
for (i = 0; i < n; ++i) f[1 << i] = 0;
for (i = 1; i < (1 << n); ++i) {
int rv = (((1 << n) - 1) ^ i);
for (j = rv; j; j = ((j - 1) & rv))
for (t = 0; t < n; ++t)
if ((i >> t) & 1)
for (k = 0; k < n; ++k)
if ((i >> k) & 1)
if (g[j | (1 << t) | (1 << k)][t][k]) {
int nxt = (i | j | (1 << t) | (1 << k));
int v = f[i] + ppc[j | (1 << t) | (1 << k)] - (t != k);
if (f[nxt] > v) {
f[nxt] = v;
bac[nxt][0] = t;
bac[nxt][1] = k;
bac[nxt][2] = (j | (1 << t) | (1 << k));
bac[nxt][3] = i;
}
}
}
printf("%d\n", f[(1 << n) - 1]);
prt((1 << n) - 1);
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mx = 1000;
int v[mx][mx], n, m, ans[mx];
map<int, int> r;
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x = -1;
for (int j = 0; j < n; j++) {
cin >> v[i][j];
x = max(x, v[i][j]);
}
int mn = 1e9 + 100;
for (int j = 0; j < n; j++) {
if (v[i][j] == x) {
mn = min(mn, j + 1);
}
}
ans[i] = mn;
++r[mn];
}
int x = -1;
for (int i = 0; i < m; i++) {
x = max(x, r[ans[i]]);
}
int mn = 1e9 + 100;
for (int j = 0; j < n; j++) {
if (r[ans[j]] == x) {
mn = min(mn, ans[j]);
}
}
cout << mn << endl;
}
| 7 | CPP |
import re
def checking_format(value):
split_values = value.split('C')
try:
a = int(split_values[0][-1])
b = int(split_values[1][-1])
return 1
except:
return 0
n = int(input())
for i in range(n):
x = input()
if checking_format(x):
row, col = x.split('C')
row = row.split('R')[1]
string = ""
col = int(col)
while col > 0:
m = int(col % 26)
b = col - m
col = b / 26
if m < 1:
m = 26
col -= 1
string = chr(64 + m) + string
print(string+row)
else:
regex = "([A-Z]+)"
matches = re.finditer(regex, x)
totalcol = 0
index_row_start = 0
for match in matches:
col = match.group()
index_row_start = match.end()
for index, char in enumerate(reversed(col)):
num = ord(char) - 64
totalcol += (26**index * num)
print("R{}C{}".format(x[index_row_start:], totalcol))
| 8 | PYTHON3 |
import sys
input_=lambda: sys.stdin.readline().strip("\r\n")
from math import gcd
sa=lambda :input_()
sb=lambda:int(input_())
sc=lambda:input_().split()
sd=lambda:list(map(int,input_().split()))
se=lambda:float(input_())
sf=lambda:list(input_())
flsh=lambda: sys.stdout.flush()
mod=10**9+7
def hnbhai():
n=sb()
a=sd()
b=list(set(a))
sum_=sum(a)
min_=min(a)
minus=0
for i in b:
fact=2
while(i//fact)>min_:
if i%fact==0:
temp=i//fact+min_*fact-i-min_
minus=min(minus,temp)
fact+=1
print(sum_+minus)
for _ in range(1):
hnbhai()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
int r = 1;
for (int i = 0, j = 0; i < n; i++, j += 2) r += j * 6;
cout << r << endl;
}
return 0;
}
| 8 | CPP |
#include<iostream>
int main(){
int n,b, m=0;
while (true){
std::cin >> n;
if (n == 0)break;
for (int i = 0; i < n/4; i++){
std::cin >> b;
m += b;
}
std::cout << m << "\n";
m = 0;
}
} | 0 | CPP |
from collections import Counter
t = int(input())
for _ in range(t):
n = int(input())
lst = [int(ele) for ele in input().split()]
freq = Counter(lst)
vals = list(freq.values())
maxval = max(vals)
count = 0
for ele in vals:
if ele == maxval:
count += 1
print((n - count) // (maxval - 1) - 1) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1000000000;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
struct IOSetup {
IOSetup() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(12);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++)
os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &x : v) is >> x;
return is;
}
struct SuffixArray {
vector<int> SA;
const string s;
SuffixArray(const string &str) : s(str) {
SA.resize(s.size());
iota(begin(SA), end(SA), 0);
sort(begin(SA), end(SA),
[&](int a, int b) { return s[a] == s[b] ? a > b : s[a] < s[b]; });
vector<int> classes(s.size()), c(s.begin(), s.end()), cnt(s.size());
for (int len = 1; len < (int)s.size(); len <<= 1) {
for (int i = 0; i < (int)s.size(); i++) {
if (i > 0 and c[SA[i - 1]] == c[SA[i]] and
SA[i - 1] + len < (int)s.size() and
c[SA[i - 1] + len / 2] == c[SA[i] + len / 2]) {
classes[SA[i]] = classes[SA[i - 1]];
} else {
classes[SA[i]] = i;
}
}
iota(begin(cnt), end(cnt), 0);
copy(begin(SA), end(SA), begin(c));
for (int i = 0; i < (int)s.size(); i++) {
int s1 = c[i] - len;
if (s1 >= 0) SA[cnt[classes[s1]]++] = s1;
}
classes.swap(c);
}
}
int operator[](int k) const { return SA[k]; }
int size() const { return (int)s.size(); }
bool lt_substr(const string &t, int si = 0, int ti = 0) {
int sn = (int)s.size(), tn = (int)t.size();
while (si < sn and ti < tn) {
if (s[si] < t[ti]) return true;
if (s[si] > t[ti]) return false;
++si, ++ti;
}
return si >= sn and ti < tn;
}
int lower_bound(const string &t) {
int low = -1, high = (int)SA.size();
while (high - low > 1) {
int mid = (low + high) / 2;
if (lt_substr(t, SA[mid]))
low = mid;
else
high = mid;
}
return high;
}
pair<int, int> lower_upper_bound(string &t) {
int idx = lower_bound(t);
int low = idx - 1, high = (int)SA.size();
t.back()++;
while (high - low > 1) {
int mid = (low + high) / 2;
if (lt_substr(t, SA[mid]))
low = mid;
else
high = mid;
}
t.back()--;
return {idx, high};
}
void output() {
for (int i = 0; i < size(); i++) {
cout << i << " : " << s.substr(SA[i]) << endl;
}
}
};
struct LongestCommonPrefixArray {
const SuffixArray &SA;
vector<int> LCP, rank;
LongestCommonPrefixArray(const SuffixArray &SA) : SA(SA), LCP(SA.size()) {
rank.resize(SA.size());
for (int i = 0; i < SA.size(); i++) {
rank[SA[i]] = i;
}
for (int i = 0, h = 0; i < (int)SA.size(); i++) {
if (rank[i] + 1 < (int)SA.size()) {
for (int j = SA[rank[i] + 1];
max(i, j) + h < (int)SA.size() and SA.s[i + h] == SA.s[j + h]; ++h)
;
LCP[rank[i] + 1] = h;
if (h > 0) --h;
}
}
}
int operator[](int k) const { return LCP[k]; }
size_t size() const { return LCP.size(); }
void output() {
for (int i = 0; i < (int)size(); i++) {
cout << i << ": " << LCP[i] << " " << SA.s.substr(SA[i]) << endl;
}
}
};
ll LargestRectangle(vector<ll> h) {
ll n = (ll)h.size();
stack<pair<ll, ll>> st;
st.push(make_pair(-LINF, -1));
ll ret = 0;
for (int i = 0; i < (n); i++) {
while (h[i] < st.top().first) {
auto p = st.top();
st.pop();
chmax(ret, (i - st.top().second) / 2 * p.first);
}
st.push(make_pair(h[i], i));
}
while (!st.empty()) {
auto p = st.top();
st.pop();
if (p.first == -LINF) continue;
chmax(ret, (n - st.top().second) / 2 * p.first);
}
return ret;
}
signed main() {
int n;
cin >> n;
string s;
cin >> s;
string bit;
cin >> bit;
reverse(s.begin(), s.end());
reverse(bit.begin(), bit.end());
SuffixArray sa(s);
LongestCommonPrefixArray lcp(sa);
vector<ll> h;
int mi = INF;
for (int i = 0; i < (n); i++) {
chmin(mi, lcp[i]);
if (bit[sa[i]] == '1') continue;
h.push_back(mi);
h.push_back(n - sa[i]);
mi = INF;
}
cout << LargestRectangle(h) << endl;
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<string> numbers;
unsigned n = 2;
unsigned k = 5;
int taken[100];
void print(unsigned i) {
unsigned l;
string str = "";
for (l = 0; l <= i - 1; l++) str += (taken[l] + 1) + '0';
numbers.push_back(str);
}
void variate(unsigned i) {
unsigned j;
if (i >= k) {
print(i);
return;
}
for (j = 0; j < n; j++) {
taken[i] = j;
variate(i + 1);
}
}
int main(void) {
for (unsigned i = 1; i < 11; i++) {
k = i;
variate(0);
}
string input;
cin >> input;
for (int i = 0; i < input.size(); i++) {
if (input[i] == '4')
input[i] = '1';
else
input[i] = '2';
}
for (int i = 0; i < numbers.size(); i++) {
if (numbers[i] == input) cout << i + 1 << endl;
}
return 0;
}
| 8 | CPP |
#include<iostream>
using namespace std;
int main(){
int n,m;
while(1){
cin>>n>>m;
if(!n && !m)break;
int vote[m];
int rank[m];
for(int i=0;i<m;i++){
vote[i]=0;
rank[i]=i+1;
}
int raise;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>raise;
if(raise)vote[j]++;
}
}
for(int i=0;i<m;i++){
for(int j=m-1;j>i;j--){
if(vote[j-1]<vote[j]){
int alt=rank[j];
rank[j]=rank[j-1];
rank[j-1]=alt;
alt=vote[j];
vote[j]=vote[j-1];
vote[j-1]=alt;
}
}
}
cout<<rank[0];
for(int i=1;i<m;i++){
cout<<" "<<rank[i];
}
cout<<endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, s;
int dp[2][155][155 * 155 / 4];
int num[155];
int main() {
while (~scanf("%d%d%d", &n, &k, &s)) {
for (int i = 1; i <= n; i++) {
scanf("%d", &num[i]);
}
int all = (n - k) * k;
if (s >= all) {
sort(num + 1, num + n + 1);
int sum = 0;
for (int i = 1; i <= k; i++) {
sum += num[i];
}
printf("%d\n", sum);
continue;
}
for (int j = 0; j <= k; j++) {
for (int r = 0; r <= s; r++) {
dp[0][j][r] = 1000000000;
}
}
dp[0][0][0] = 0;
int pre = 0, now = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= k; j++) {
for (int r = 0; r <= s; r++) {
dp[now][j][r] = 1000000000;
}
}
int x = min(i, k);
for (int j = 0; j <= x; j++) {
for (int r = 0; r <= s; r++) {
if (dp[pre][j][r] == 1000000000) continue;
dp[now][j][r] = min(dp[now][j][r], dp[pre][j][r]);
if (j + 1 <= k && r + i - j <= s)
dp[now][j + 1][r + i - j] =
min(dp[now][j + 1][r + i - j], dp[pre][j][r] + num[i + 1]);
}
}
now ^= 1;
pre ^= 1;
}
int ans = 1000000000;
for (int i = 0; i <= s; i++) {
ans = min(ans, dp[pre][k][i]);
}
printf("%d\n", ans);
}
return 0;
}
| 10 | CPP |
from sys import stdin,stdout
for query in range(int(stdin.readline())):
n=int(stdin.readline())
a=[int(x) for x in stdin.readline().split()]
for x in range(n):
if x%2==0 and a[x]!=0:
stdout.write('-'+str(abs(a[x]))+' ')
else:
stdout.write(str(abs(a[x]))+' ')
stdout.write('\n')
| 7 | PYTHON3 |
k=int(input())
l=int(input())
m=int(input())
n=int(input())
d=int(input())
s=0
for i in range(1,d+1):
if i%k==0 or i%l==0 or i%m==0 or i%n==0 :
s+=1
print(s)
| 7 | PYTHON3 |
n=int(input())
a=[]
g=[]
for t in range(0,n):
a.append([int(i) for i in list(input().split())])
for t in a:
g.append(t[1]-t[0])
print(max([sum(g[:i]) for i in range(0,n)])) | 7 | PYTHON3 |
MOD = 998244353
def solve():
n = int(input())
ini = []
out = []
state = []
for i in range(n):
a, b, c = list(map(int, input().split()))
ini.append(a)
out.append(b)
state.append(c)
pos = []
for a in out:
le = 0
ri = n-1
while le < ri:
mid = (le+ri) // 2
if a > ini[mid]:
le = mid + 1
else:
ri = mid
pos.append(le)
dp = [ini[0]-out[0]]
for i in range(1, n):
le = pos[i]
a = (dp[i-1]+(ini[i]-ini[i-1])*2+ini[le]-out[i])%MOD
if le:
dp.append((a+dp[i-1]-dp[le-1]-ini[le]+ini[le-1])%MOD)
else:
dp.append((a+dp[i-1])%MOD)
ans = ini[0]+1
if state[0]:
ans = (ans+dp[0])%MOD
for i in range(1, n):
if state[i]:
ans = (ans+dp[i]-dp[i-1])%MOD
else:
ans = (ans+ini[i]-ini[i-1]) % MOD
return ans%MOD
import sys
input = lambda: sys.stdin.readline().rstrip()
print(solve())
| 12 | PYTHON3 |
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#define double long double
const double PI = acos(-1.0);
struct point {
double x, y;
int num;
point operator +(const point &p)const {
return { x + p.x, y + p.y };
}
point operator -(const point &p)const {
return { x - p.x, y - p.y };
}
point Rotate(double Angle) {
Angle = Angle*PI / 180;
double ss = sinl(Angle), cc = cosl(Angle);
return { x*cc - y*ss, x*ss + y*cc };
}
point operator *(const double &k)const {
return { x*k,y*k };
}
}P[4], RD, LD, RR;
point Get() {
char p[3];
int d, l;
scanf("%s%d%d", p,&d,&l);
if (strcmp(p, "BC") == 0) {
return P[1].Rotate(d)*l;
}
if (strcmp(p, "BD") == 0) {
return P[1].Rotate(-d)*l;
}
if (strcmp(p, "CB") == 0) {
return P[2].Rotate(-d)*l;
}
if (strcmp(p, "CD") == 0) {
return P[2].Rotate(d)*l;
}
if (strcmp(p, "DB") == 0) {
return (P[0]-P[3]).Rotate(d)*l;
}
if (strcmp(p, "DC") == 0) {
return P[3].Rotate(-d)*l;
}
}
double ccw(point a, point b, point c) {
return (b.x - a.x)*(c.y - a.y) - (b.y - a.y)*(c.x - a.x);
}
bool Inside(point a, point b, point c, point d) {
if (ccw(a, b, d) < 0 && ccw(b, c, d) < 0 && ccw(c, a, d) < 0)return true;
if (ccw(a, b, d) > 0 && ccw(b, c, d) > 0 && ccw(c, a, d) > 0)return true;
return false;
}
int Loc(point a) {
int i, j, k;
for (i = 0; i < 30; i+=2) {
for (j = 0; j < 30; j += 2) {
for (k = -30; k <= 30; k += 2) {
point tp = P[0] + RR * k + RD * i + LD * j;
point P1 = tp;
point P2 = tp+RR;
point P3 = tp+RR+RR;
point P4 = tp+RD;
point P5 = tp+RD+RR;
point P6 = tp + RD + RR+RR;
point P7 = tp+RD+RD;
point P8 = tp+RD+RD+RR;
point P9 = tp + RD + RD + RR + RR;
if (Inside(P1, P2, P4, a) || Inside(P6, P8, P9, a))return 1;
if (Inside(P2, P3, P5, a) || Inside(P5, P7, P8, a))return 2;
if (Inside(P2, P4, P5, a) || Inside(P5, P6, P8, a))return 3;
if (Inside(P3, P5, P6, a) || Inside(P4, P5, P7, a))return 4;
}
}
}
return 0;
}
int main() {
RD = { 0.5 , -sqrtl(3)*0.5L };
LD = { -0.5 , -sqrtl(3)*0.5L };
RR = { 1.0, 0.0 };
P[0] = { 0.0, 0.0 };
P[1] = P[0] + LD;
P[2] = P[0] + RD;
P[3] = P[0] + RR;
point A = Get(), B = Get();
if (Loc(A) == Loc(B))printf("YES\n");
else printf("NO\n");
} | 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mpp make_pair
#define mod 1000000007
#define inf 9000000000000000000LL
#define bug cout<<"Noooooo"<<endl;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
bool cmp(pair<ll,ll>&a, pair<ll,ll>&b)
{
return a.first<b.first;
}
int main()
{
fast;
ll t;
cin>>t;
while(t--)
{
ll n;
cin>>n;
vector<pair<ll,ll>>v;
for(ll i=1; i<=n; i++)
{
ll x;
cin>>x;
v.pb({x,i});
}
sort(v.begin(),v.end(),cmp);
ll cnt=0;
for(ll i=0; i<n; i++)
{
for(ll j=i+1; j<n; j++)
{
ll ai=v[i].first;
ll aj=v[j].first;
ll x=v[i].second;
ll y=v[j].second;
if(ai*aj==x+y)
{
cnt++;
}
else if(ai*aj>2*n)
{
break;
}
}
}
cout<<cnt<<endl;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
const int K = 5;
const int INF = 1e9;
int a[N + 7][K + 2];
int qt314[K + 2];
struct SEG {
int tree[4 * N + 7][2];
int query(int ss, int se, int si, int qs, int qe, bool fl) {
if (qs > qe || ss > qe || qs > se) {
return fl == 0 ? INF : -INF;
}
if (qs <= ss && se <= qe) {
return tree[si][fl];
}
int t1 = query(ss, ((ss + se) >> 1), si * 2, qs, qe, fl);
int t2 = query(((ss + se) >> 1) + 1, se, si * 2 + 1, qs, qe, fl);
return fl == 0 ? min(t1, t2) : max(t1, t2);
}
void upd(int ss, int se, int si, int id, int k) {
if (ss == se) {
tree[si][0] = tree[si][1] = k;
return;
}
if (id <= ((ss + se) >> 1)) {
upd(ss, ((ss + se) >> 1), si * 2, id, k);
} else {
upd(((ss + se) >> 1) + 1, se, si * 2 + 1, id, k);
}
tree[si][0] = min(tree[si * 2][0], tree[si * 2 + 1][0]);
tree[si][1] = max(tree[si * 2][1], tree[si * 2 + 1][1]);
}
} seg[1 << K];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= k; ++j) {
scanf("%d", &a[i][j]);
}
}
for (int mask = 0; mask < (1 << k); mask++) {
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = 1; j <= k; j++) {
if (((mask >> (j - 1)) & 1) == 0) {
sum += a[i][j];
} else {
sum -= a[i][j];
}
}
seg[mask].upd(1, n, 1, i, sum);
}
}
int q;
cin >> q;
while (q--) {
int t;
scanf("%d", &t);
if (t == 1) {
int i;
scanf("%d", &i);
for (int j = 1; j <= k; j++) {
scanf("%d", &qt314[j]);
}
for (int mask = 0; mask < (1 << k); mask++) {
int sum = 0;
for (int j = 1; j <= k; j++) {
if (((mask >> (j - 1)) & 1) == 0) {
sum += qt314[j];
} else {
sum -= qt314[j];
}
}
seg[mask].upd(1, n, 1, i, sum);
}
} else {
int l, r;
scanf("%d %d", &l, &r);
int ans = -INF;
for (int mask = 0; mask < (1 << k); ++mask) {
int minv = seg[mask].query(1, n, 1, l, r, 0);
int maxv = seg[mask].query(1, n, 1, l, r, 1);
ans = max(ans, maxv - minv);
}
printf("%d\n", ans);
}
}
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) (((x) < 0)?-(x):(x))
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge
using cat = long long;
#ifdef DONLINE_JUDGE
// palindromic tree is better than splay tree!
#define lld I64d
#endif
cat mod = 998244353;
cat C[11][11];
void count(int h, int w, char f_e, char f_h, char f_w, int & out, cat cur = 1) {
if(h+w == 0) {
out += cur;
if(out >= mod) out -= mod;
return;
}
if(!(f_e&1) && h*w == 0) return;
for(int c = 0; c < 2; c++) for(int i = 0; i <= h; i++) for(int j = 0; j <= w; j++) if(i+j) {
if((f_h>>c)&1 && i) continue;
if((f_w>>c)&1 && j) continue;
if(j && f_e&2 && c) continue;
if(i && f_e&4 && c) continue;
cat x = C[h][i] * C[w][j] % mod;
int n_h = f_h, n_w = f_w;
if(i) n_w ^= n_w&(1<<(1-c));
if(j) n_h ^= n_h&(1<<(1-c));
n_h |= 1<<c;
n_w |= 1<<c;
int n_e = f_e&1;
if(!i) n_e |= 2;
if(!j) n_e |= 4;
count(h-i, w-j, n_e, n_h, n_w, out, cur*x%mod);
}
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
int H, W;
cin >> H >> W;
vector<int> V(H, 0);
for(int i = 0; i < H; i++) {
string s;
cin >> s;
for(int j = 0; j < W; j++)
if(s[j] == '#') V[i] |= 1<<j;
}
memset(C, 0, sizeof(C));
for(int i = 0; i <= 10; i++) {
C[i][0] = 1;
for(int j = 1; j <= i; j++)
C[i][j] = (C[i-1][j]+C[i-1][j-1])%mod;
}
int cnt[11][11];
memset(cnt, 0, sizeof(cnt));
for(int i = 0; i <= H; i++) for(int j = 0; j <= W; j++)
count(i, j, (H-i) || (W-j), 0, 0, cnt[i][j]);
cat ans = cnt[H][W];
for(int i = 0; i < (1<<H)-1; i++) {
vector<int> Vr, Vc(W, 0);
for(int j = 0; j < H; j++)
if(!((i>>j)&1)) Vr.push_back(V[j]);
for(int j = 0; j < W; j++) {
for(int k = 0; k < H; k++)
if(!((i>>k)&1)) Vc[j] += ((V[k]>>j)&1)<<k;
Vc[j] = (!Vc[j]) || (Vc[j] == (1<<H)-1-i);
}
int n = H-Vr.size();
for(int j = 0; j < (1<<W)-1; j++) {
int m = (1<<W)-1-j;
bool ok = true;
for(int k = 0; k < H-n; k++) if(!(Vr[k]&m) || (Vr[k]&m) == m) {
ok = false;
break;
}
if(!ok) continue;
for(int k = 0; k < W; k++) if(!((j>>k)&1) && Vc[k]) {
ok = false;
break;
}
if(!ok) continue;
ans += cnt[n][__builtin_popcount(j)];
if(ans >= mod) ans -= mod;
}
}
cout << ans << "\n";
return 0;
}
// look at my code
// my code is amazing
| 0 | CPP |
n = int(input().strip())
a = [int(i) for i in input().split()]
mx = max(a)
mn = min(a)
c = 0
for i in range(n):
if a[i] == mx:
c += i
break
r = i
for i in range(n):
if a[n - i - 1] == mn:
c += i
break
l = n - i - 1
if l < r or n == 2 and c != 0:
print(c - 1)
else:
print(c)
| 7 | PYTHON3 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
long A[10] = {};
for(int i = 0; i < n; ++i ) cin >> A[i];
int a = A[0],
b = A[1],
i = 1, c, r;
while( true )
{
if( a < b ) swap( a, b );
c = a * b;
while( a % b != 0 ) {
r = b;
b = a % b;
a = r;
}
c /= b;
if( i == n - 1 ) break;
a = c;
b = A[++i];
}
cout << c << "\n";
return 0;
} | 0 | CPP |
n,l,r=map(int,input().split())
x=n-l+int(2**l)-1
r=min(r,n)
y=(n-r)*int(2**(r-1))+int(2**r)-1
print(x,y)
| 8 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Mon Jul 20 13:54:21 2020
@author: Tanmay
"""
val=0
t=int(input())
for i in range(t):
arr=input()
arr=list(arr)
for j in range(len(arr)):
if(arr[j]=='+'):
val+=0.5
elif(arr[j]=='-'):
val-=0.5
print(int(val))
| 7 | PYTHON3 |
def ncr(n, r):
return int(fact(n) / (fact(r)
* fact(n - r)))
# Returns factorial of n
def fact(n):
res = 1
for i in range(2, n + 1):
res = res * i
return res
def f(s):
j=0
ans=0
cnt=0
n=len(s)
while(j<n):
if int(s[j])!=0:
for k in range(3 - cnt + 1):
if k <= (n - j - 1):
ans += (ncr(n - j - 1, k)) * (9 ** k)
for k in range(3-cnt):
if k <= (n - j - 1):
ans+=(int(s[j])-1)*((ncr(n-j-1,k))*(9**k))
cnt+=1
if cnt==3:
break
j+=1
return ans
t=int(input())
for i in range(t):
l,r=map(int,input().split())
print(f(str(r))-f(str(l-1)))
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int M = 100005;
int n, a[M], b[M], c[M], ans[M];
void update(int x, int y) {
for (; x <= n; x += x & -x) c[x] = max(c[x], y);
}
int query(int x) {
int r = -1;
for (; x; x -= x & -x) r = max(r, c[x]);
return r;
}
int main() {
memset(c, 0xff, sizeof(c));
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), b[i] = a[i];
sort(b + 1, b + n + 1);
int m = unique(b + 1, b + n + 1) - (b + 1);
for (int i = 1; i <= n; i++) a[i] = lower_bound(b + 1, b + m + 1, a[i]) - b;
for (int i = n; i >= 1; i--) {
int pos = query(a[i] - 1);
if (pos < 0)
ans[i] = -1;
else
ans[i] = pos - i - 1;
update(a[i], i);
}
for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
return 0;
}
| 8 | CPP |
X=int(input())
L=X//500
l=(X-(500*L))//5
print(1000*L+5*l) | 0 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, m;
scanf("%d%d", &n, &m);
if (3 == m && n == 4) {
puts("0 0");
puts("3 0");
puts("0 3");
puts("1 1");
return 0;
}
if (3 == m && n >= 5) {
puts("-1");
return 0;
}
for (int i = 0; i < m; ++i) printf("%d %I64d\n", i, (long long)i * i * 10003);
for (int i = 0; i < n - m; ++i)
printf("%d %I64d\n", i, (long long)i * i * -1 - 10000000);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
map<char, vector<long long>> mpp;
long long n = s.size();
for (int i = 0; i < 26; i++) mpp[(char)(97 + i)].push_back(0);
for (int i = 0; i < n; i++) {
mpp[s[i]].push_back(i + 1);
}
for (int i = 0; i < 26; i++) mpp[(char)(97 + i)].push_back(n + 1);
long long ans = INT_MIN;
long long res = INT_MAX;
for (auto itr = mpp.begin(); itr != mpp.end(); itr++) {
long long sss = itr->second.size();
ans = INT_MIN;
for (int i = 1; i < sss; i++) {
ans = max(ans, itr->second[i] - itr->second[i - 1]);
}
res = min(ans, res);
}
cout << res;
}
| 9 | CPP |
def solve():
n = int(input())
print(n)
for i in range(int(input())):
solve() | 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
#pragma warning(default : 4)
using namespace std;
int n, m;
char c;
int w[100100], a[100100], p[100100], nk[100100], tnk, kl[100100];
vector<int> sk[100100];
int main() {
scanf("%d %d\n", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%c%d\n", &c, &a[i]);
a[i]--;
if (c == '+') {
p[i] = 1;
sk[a[i]].push_back(i);
} else
tnk++, nk[a[i]]++;
}
int pk = 0;
for (int i = 0; i < n; i++) {
if (sk[i].size() + tnk - nk[i] == m) {
pk++;
kl[i] = 1;
for (int j = 0; j < sk[i].size(); j++) w[sk[i][j]]++;
}
}
for (int i = 0; i < n; i++) {
if (p[i] == 0) {
w[i] += pk;
if (kl[a[i]]) w[i]--;
}
if (w[i] == 0) {
puts("Lie");
} else if (w[i] == pk) {
puts("Truth");
} else
puts("Not defined");
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
int main() {
int p;
cin >> p;
int cnt = 0;
for (int i = 1; i < p; ++i) {
bool good = true;
int x = 1;
for (int j = 1; j < p - 1; ++j) {
x *= i;
x %= p;
if (x == 1) good = false;
}
x *= i;
x %= p;
if (x != 1) good = false;
cnt += (good == true);
}
cout << cnt << endl;
return 0;
}
| 7 | CPP |
x = int(input())
print(x//11*2 if x%11==0 else x//11*2+1 if x%11<7 else x//11*2+2) | 0 | PYTHON3 |
# from functools import lru_cache
from sys import stdin, stdout
import sys
from math import *
# sys.setrecursionlimit(10**6)
input = stdin.readline
# print = stdout.write
# @lru_cache()
for __ in range(int(input())):
n,k=map(int,input().split())
ar=list(map(int,input().split()))
if(k not in ar):
print("No")
elif(n==1):
print("Yes")
else:
ans="No"
for i in range(n-1):
if(ar[i]>=k<=ar[i+1]):
ans="Yes"
for i in range(n-2):
if(ar[i]>=k<=ar[i+2]):
ans="Yes"
print(ans) | 8 | PYTHON3 |
n=int(input())
l=[]
for i in range(n):
l.append(list(input().strip()))
ans=1
for i in range(n):
j=len(l[i])-1
if (len(l[i])==1):
if (l[i][0]=='u'):
l[i]=['o','o']
else:
continue
while (j>0):
if (l[i][j]=='h' and l[i][j-1]=='k'):
l[i][j-1:j+1]=['h']
j-=1
j=0
while (True):
try:
if (l[i][j]=='u'):
l[i][j:j+1]=['o','o']
j+=1
except:
break
j+=1
l.sort()
for i in range(n-1):
if (l[i]!=l[i+1]):
ans+=1
print (ans) | 12 | PYTHON3 |
n = int(input())
print(int((n / 2)) if (n % 2) == 0 else int((-(n + 1) / 2))) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
int x1 = 0, x2 = 0, x3 = 0, x;
char vowel[5] = {'a', 'e', 'i', 'o', 'u'};
for (int i = 0; i < n; i++) {
x = 1;
for (int j = 0; j < 5; j++) {
if (s[i] == vowel[j]) x = 0;
}
x3 = x2, x2 = x1, x1 = x;
if (i >= 2) {
if (x1 * x2 * x3 == 1 && !(s[i] == s[i - 1] && s[i - 1] == s[i - 2])) {
cout << " ";
x2 = 0, x3 = 0;
}
}
cout << s[i];
}
cout << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
const int mod = 1e9 + 7;
const int nax = 2e5 + 6;
const long long inf = 2e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n, h;
cin >> n >> h;
vector<long long> dists;
vector<pair<long long, long long>> bl;
dists.push_back(0LL);
for (int i = 1; i <= n; i++) {
long long x, y;
cin >> x >> y;
if (i > 1) {
dists.push_back(dists.back() + abs(x - bl.back().second));
}
bl.push_back({x, y});
}
dists.push_back(inf);
long long so_far = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
long long targ = h + dists[i] - 1;
int pos = lower_bound(dists.begin(), dists.end(), targ) - dists.begin();
if (dists[pos] > targ) {
pos--;
}
long long rem = h - (dists[pos] - dists[i]);
ans = max(ans, bl[pos].second - bl[i].first + rem);
}
cout << ans << '\n';
return 0;
}
| 10 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int p;
string a[2],c,ans;
while(1){
cin>>a[0];
if(a[0]=="-")break;
cin>>a[1]>>c;
p=1;
while(c.size()){
if(c[0]==a[p][0]){
if(c.size())c=c.substr(1,c.size()-1);
if(a[p].size())a[p]=a[p].substr(1,a[p].size()-1);
p=0;
}else{
ans+=a[p][0];
if(a[p].size())a[p]=a[p].substr(1,a[p].size()-1);
p=1;
}
}
ans+=a[0];
ans+=a[1];
cout<<ans<<endl;
ans.clear();
a[0].clear();
a[1].clear();
c.clear();
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
struct point {
long long x, y;
bool operator<(const point &a) const {
return x < a.x || (x == a.x && y < a.y);
}
} p[maxn], s[maxn];
int n, top;
double dis(point p, point q) {
return sqrt(1.0 * (p.x - q.x) * (p.x - q.x) +
1.0 * (p.y - q.y) * (p.y - q.y));
}
long long cross1(point p, point a, point b) {
return (a.x - p.x) * (b.x - p.x) + (a.y - p.y) * (b.y - p.y);
}
long long cross2(point p, point a, point b) {
return (a.x - p.x) * (b.y - p.y) - (a.y - p.y) * (b.x - p.x);
}
void convex() {
sort(p, p + n);
s[0] = p[0];
s[1] = p[1];
top = 2;
for (int i = 2; i < n; i++) {
if (p[i].x == s[top - 1].x && p[i].y == s[top - 1].y) continue;
while (top >= 2 && cross2(s[top - 2], s[top - 1], p[i]) >= 0) top--;
s[top++] = p[i];
}
int tmp = top - 1;
s[top++] = p[n - 2];
for (int i = n - 3; i >= 0; i--) {
if (p[i].x == s[top - 1].x && p[i].y == s[top - 1].y) continue;
while (top - tmp >= 2 && cross2(s[top - 2], s[top - 1], p[i]) >= 0) top--;
s[top++] = p[i];
}
}
double cal(point a, point b) { return max(1.0 * b.x / a.x, 1.0 * b.y / a.y); }
double work(point a, point b, point p) {
point tmp;
tmp.x = tmp.y = 0;
if (a.x > b.x) {
swap(a.x, b.x);
swap(a.y, b.y);
}
if (cross2(tmp, a, p) < 0 && cross2(tmp, b, p) > 0)
return min((1.0 * (b.x - a.x) * p.y + 1.0 * (a.y - b.y) * p.x) /
(1.0 * a.y * b.x - 1.0 * a.x * b.y),
min(cal(a, p), cal(b, p)));
else
return min(cal(a, p), cal(b, p));
}
int main() {
point tmp;
scanf("%d%I64d%I64d", &n, &tmp.x, &tmp.y);
for (int i = 0; i < n; i++) scanf("%I64d%I64d", &p[i].x, &p[i].y);
convex();
double ans = work(s[0], s[1], tmp);
for (int i = 1; i < top - 1; i++) ans = min(ans, work(s[i], s[i + 1], tmp));
printf("%.10lf\n", ans);
return 0;
}
| 11 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.