solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<int, vector<int>> vii;
typedef vector<ll> vl;
typedef vector<ll, vector<ll>> vll;
typedef pair<int, int> pii;
typedef map<int, int> mi;
typedef vector<pair<int, int>> vpi;
#define ln "\n"
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define rall(x) (x).rbegin(), (x).rend()
#define sor(x) sort(all(x))
#define lb lower_bound
#define ub upper_bound
void solve()
{
int n;
cin >> n;
vector<int> v(n);
set<int> s;
int z;
set<int>::iterator it;
bool ok = true;
for (int i = 0; i < n; i++)
{
cin >> z;
if (ok)
{
if (i > 0 && z != *it)
{
s.insert(z);
if (z > *it)
{
it++;
if (it != s.end() && z > *it)
{
ok = false;
}
}
else if (z < *it && it != s.begin())
{
it--;
if (z < *it)
{
ok = false;
}
}
}
auto k = s.insert(z);
it = k.first;
}
}
if (ok)
cout << "YES" << ln;
else
cout << "NO" << ln;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int test;
cin >> test;
for (int i = 1; i <= test; i++)
{
solve();
}
return 0;
} | 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int const N = 202000;
long long const mod = 1000 * 1000 * 1000 + 7;
vector<pair<double, double>> in;
double x[1002];
double r;
bool inter(double a, double c) {
if ((a + r <= c + r && a + r >= c - r)) return true;
if ((a - r >= c - r && a - r <= c + r)) return true;
return false;
}
double calc(double a, double b, double c) {
return sqrt((r * 2) * (r * 2) - ((a - b) * (a - b))) + c;
}
int main() {
int a;
scanf("%d", &a);
cin >> r;
for (int i = 0; i < a; ++i) cin >> x[i];
for (int i = 0; i < a; i++) {
double mx = -1;
for (auto el : in) {
if (inter(el.first, x[i])) {
mx = max(mx, calc(el.first, x[i], el.second));
}
}
if (mx == -1) {
in.push_back(make_pair(x[i], r));
printf("%.6f ", r);
} else {
in.push_back(make_pair(x[i], mx));
printf("%.6f ", mx);
}
}
return 0;
}
| 1,500 | CPP |
name=input()
x=list()
for i in range(len(name)):
x.append(name[i])
x.sort()
count=1
for i in range(len(x)-1):
if(x[i]!=x[i+1]):
count+=1
if(count%2==0):
print("CHAT WITH HER!")
else:
print("IGNORE HIM!")
| 800 | PYTHON3 |
t=int(input())
for i in range(t):
n=int(input())
arr=list(map(int,input().split()))
c=[0,0]
for i in range(n):
c[arr[i]%2]+=1
#print(c[0])
#print(c[1])
if c[0] and c[1]:
print('NO')
else:
print('YES')
| 900 | PYTHON3 |
#include<stdio.h>
long long int n,k;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
long long int a;
int i=1;
scanf("%lld%lld",&n,&k);
if(n>k)
{
if(n%k==0)
printf("1\n");
else if(n>2*k)
{
printf("2\n");
}
else
printf("%lld\n",n/k+1);
}
else
{
if(k%n==0)
printf("%lld\n",k/n);
else
printf("%lld\n",k/n+1);
}
}
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
map<long long, bool> ada;
int main() {
int n;
scanf("%d", &n);
long long node;
for (int i = 0; i < n; i++) {
long long x;
scanf("%lld", &x);
ada[x] = 1;
node = x;
}
while (1) {
if (ada[node * 3])
node *= 3;
else if (node % 2 == 0 && ada[node / 2])
node /= 2;
else
break;
}
while (1) {
printf("%lld", node);
if (node % 3 == 0 && ada[node / 3])
node /= 3;
else if (ada[node * 2])
node *= 2;
else
break;
printf(" ");
}
printf("\n");
}
| 1,400 | CPP |
import sys
t=int(sys.stdin.readline())
l=[]
for i in range(t):
m,n=map(int,sys.stdin.readline().split())
l.append([m,n])
k=int(sys.stdin.readline())
flag=0
for i in range(n):
if(k>=l[i][0] and k<=l[i][1]):
flag=i
break
ans=t-flag
print(ans) | 800 | PYTHON3 |
def check(x,y,r,c):
return (x >= r or y >= c or x<0 or y <0)
near = []
pos = []
inp = input().split()
r,c,p = int(inp[0]),int(inp[1]),inp[2]
lst = []
for _ in range(r):
row = input()
lst.append(row)
for _ in range(r):
for __ in range(c):
if lst[_][__] == p:
pos.append((_,__))
dirsx = [0,1,0,-1]
dirsy = [1,0,-1,0]
for x,y in pos:
for i in range(4):
if not check(x+dirsx[i],y+dirsy[i],r,c):
cur = lst[x+dirsx[i]][y+dirsy[i]]
if cur != '.' and cur not in near and cur != p:
near.append(cur)
print(len(near))
| 1,100 | PYTHON3 |
# Abu Hurayra
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s + '\n')
def wi(n): sys.stdout.write(str(n) + '\n')
def wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\n')
#a = list(map(int, input().split()))
def main():
d = {}
n = ri()
for _ in range(n):
s = rs()
if s not in d:
print('OK')
d[s] = 0
else:
d[s] += 1
print(s + str(d[s]))
if __name__ == '__main__':
main()
| 1,300 | PYTHON3 |
# METO Bot 0.9.9
n,m,k=map(int,input().split())
if k<m<=k+n:
t=1
for i in range(k+1):
t*=(m-i)/(n+k-(i-1))
print(1-t)
else:
print(0 if m>n+k else 1)
| 2,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100100, mod = 1e9 + 7;
inline int read() {
int x = 0, c = getchar(), f = 0;
for (; c > '9' || c < '0'; f = c == '-', c = getchar())
;
for (; c >= '0' && c <= '9'; c = getchar()) x = (x << 1) + (x << 3) + c - '0';
return f ? -x : x;
}
inline void write(int x) {
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
int dfs(long long x) {
if (x == 1) return 0;
return dfs((x + 1) / 2) + 1;
}
long long n, f[110];
int i;
int main() {
scanf("%I64d", &n);
f[0] = 1;
f[1] = 2;
for (i = 1; f[i] <= n; i++) f[i + 1] = f[i] + f[i - 1];
printf("%d\n", i - 1);
return 0;
}
| 1,600 | CPP |
length = int(input())
arr = input().split(" ")
summ = 0;
isodd = False
for x in range(0, len(arr)):
if int(arr[x]) % 2 != 0:
isodd = True
summ += int(arr[x])
if (summ%2!=0 or (summ %2 ==0 and isodd)):
print("First")
else :
print("Second")
| 1,100 | PYTHON3 |
n = str(input())
num = int(n)
if(n[len(n)-1]=='1' or n[len(n)-1]=='2' or n[len(n)-1]=='5' or n[len(n)-1]=='6' or n[len(n)-1]=='9'):
if((int(num/10))%2==0):
print("1\n")
else:
print("0\n");
else:
if((int(num/10))%2==0):
print("0\n");
else:
print("1\n");
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, v[30];
char c[100001];
int main() {
cin >> n >> c;
for (int i = 0; i < n; i++) v[c[i] - 'a']++;
for (int i = 0; i < 26; i++)
while (v[i]--) cout << char('a' + i);
return 0;
}
| 1,300 | CPP |
from sys import stdin as sin
for _ in range(int(sin.readline())):
n = int(sin.readline())
c = n
cnt = 0
while c != 1:
if (c % 3 != 0):
print(-1)
break
elif (c % 6 == 0):
c = c // 6
cnt += 1
elif (c % 3 == 0):
c = c * 2
cnt += 1
if (c == 1):
print(cnt) | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int z, k = 0, kk = 0, a[200010], b[200010], count = 0, sum = 0;
for (int i = 0; i < n; i++) {
cin >> z;
if (z > 0) {
a[k++] = z;
sum += z;
} else {
b[kk++] = -1 * z;
count += -1 * z;
}
}
int c;
if (z > 0)
c = 1;
else
c = 0;
int g = 2;
if (sum > count) {
cout << "first" << endl;
} else if (count > sum)
cout << "second" << endl;
else {
if (k < kk) {
g = 0;
for (int i = 0; i < k; i++) {
if (a[i] > b[i]) {
g = 1;
break;
} else if (b[i] > a[i]) {
g = 0;
break;
}
}
if (g == 1)
cout << "first" << endl;
else
cout << "second" << endl;
} else if (k > kk) {
g = 1;
for (int i = 0; i < kk; i++) {
if (a[i] > b[i]) {
g = 1;
break;
} else if (b[i] > a[i]) {
g = 0;
break;
}
}
if (g == 1)
cout << "first" << endl;
else
cout << "second" << endl;
} else {
for (int i = 0; i < kk; i++) {
if (a[i] > b[i]) {
g = 1;
break;
} else if (b[i] > a[i]) {
g = 0;
break;
}
}
if (g == 2) {
if (c == 1)
cout << "first" << endl;
else
cout << "second" << endl;
} else {
if (g == 1)
cout << "first" << endl;
else
cout << "second" << endl;
}
}
}
return 0;
}
| 1,400 | CPP |
a = int(input())
mat=[]
zugo=0
for i in range(a):
s = input().split()
for j in range(2):
s[j]=int(s[j])
if s[0]==s[1]:
pass
else:
for k in mat:
if k[0]>s[0] and k[1]<s[1]:
print('Happy Alex')
zugo=1
break
elif k[0]<s[0] and k[1]>s[1]:
print('Happy Alex')
zugo=1
break
mat.append(s)
if zugo==1:
break
if zugo!=1:
print('Poor Alex')
| 1,100 | PYTHON3 |
n, k = map(int, input().split())
count = 0
while n <= k:
n *= 3
k *= 2
count += 1
print(count) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1111;
int cap[51][51], deg[51], adj[51][51];
int q[51], prv[51];
int dinic(int n, int s, int t) {
int flow = 0;
memset(deg, 0, sizeof(deg));
for (int u = 0; u < n; u++)
for (int v = 0; v < n; v++)
if (cap[u][v] || cap[v][u]) adj[u][deg[u]++] = v;
while (true) {
memset(prv, -1, sizeof(prv));
int qf = 0, qb = 0;
prv[q[qb++] = s] = -2;
while (qb > qf && prv[t] == -1)
for (int u = q[qf++], i = 0, v; i < deg[u]; i++)
if (prv[v = adj[u][i]] == -1 && cap[u][v]) prv[q[qb++] = v] = u;
if (prv[t] == -1) break;
for (int z = 0; z < n; z++)
if (cap[z][t] && prv[z] != -1) {
int bot = cap[z][t];
for (int v = z, u = prv[v]; u >= 0; v = u, u = prv[v])
bot = min(bot, cap[u][v]);
if (!bot) continue;
cap[z][t] -= bot;
cap[t][z] += bot;
for (int v = z, u = prv[v]; u >= 0; v = u, u = prv[v]) {
cap[u][v] -= bot;
cap[v][u] += bot;
}
flow += bot;
}
}
return flow;
}
int a[N], b[N], c[N];
int main() {
std::ios::sync_with_stdio(false);
int n, m, x;
cin >> n >> m >> x;
for (int i = 0; i < m; ++i) {
cin >> a[i] >> b[i] >> c[i];
--a[i], --b[i];
}
double l = 1.0 / x, r = 1e6;
for (int i = 0; i < 200; ++i) {
double md = (l + r) / 2;
for (int j = 0; j < m; ++j) {
cap[a[j]][b[j]] = (int)(floor(c[j] / md) + 0.5);
}
if (dinic(n, 0, n - 1) >= x)
l = md;
else
r = md;
}
cout << fixed << setprecision(10);
cout << (double)(x * l) << endl;
return 0;
}
| 2,200 | CPP |
import math
n=int(input())
l=[]
for i in range(n):
lst=list(map(int, input().strip().split(' ')))
l.append(lst)
if n==1:
print(1)
elif n==2:
print(1,l[0][1],end=" ")
else:
k=int(math.sqrt((l[0][1]*l[0][2]*l[1][2]))//l[1][2])
for j in range(n):
if j==0:
print(k,end=" ")
else:
print(l[0][j]//k,end=" ") | 1,300 | PYTHON3 |
n=int(input())
dic={}
l=list(map(int,input().split()))
m=list(map(int,input().split()))
l=l[-1::-1]
m=m[-1::-1]
for i in range(n):
dic[l[i]]=i+1
i=0
ans=0
cur=0
while(i<len(m)):
# print(dic[m[i]],cur,i,ans)
if(cur<dic[m[i]]):
cur=dic[m[i]]
else:
ans+=1
i+=1
print(ans) | 1,300 | PYTHON3 |
num = int(input())
host = []
guest = []
Ans = 0
for i in range(num):
h, g = map(int, input().split())
host.append(h)
guest.append(g)
for i in range(len(host)):
for j in range(len(guest)):
if host[i] == guest[j]:
Ans += 1
print(Ans)
| 800 | PYTHON3 |
repeat=int(input())
answer=[]
for _ in range(repeat):
n=input()
first=input()
second=input()
a=first
b=second
for i in range(len(first)):
if first[i]!=second[i]:
for j in range(i,len(second)):
a=first[:i]+second[j]+first[i+1:]
b=second[:j]+first[i]+second[j+1:]
if a==b:
answer.append("Yes")
a=True
break
if a!=b:
if j==len(second)-1:
answer.append("No")
a=True
break
continue
if a:
break
for n in range(repeat):
print(answer[n])
| 1,000 | PYTHON3 |
x=input()
x=x.lower()
y=''
for i in range(len(x)):
if x[i] not in ('aoyeui'):
y+='.'+x[i]
print(y) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int main() {
int a, b, c, d, e;
while (cin >> a >> b >> c >> d >> e) {
int ans = 100000;
ans = min(ans, a);
ans = min(ans, b);
ans = min(ans, c / 2);
ans = min(ans, d / 7);
ans = min(ans, e / 4);
printf("%d\n", ans);
}
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long one = 1;
struct trie {
int ct;
struct trie *left, *right;
trie() : ct(0), left(NULL), right(NULL) {}
};
void Insert(trie *root, int level, long long x, int change) {
if (level < 0) return;
if ((x & (one << level)) == 0) {
if (root->left == NULL) root->left = new trie();
root->left->ct += change;
Insert(root->left, level - 1, x, change);
} else {
if (root->right == NULL) root->right = new trie();
root->right->ct += change;
Insert(root->right, level - 1, x, change);
}
}
long long query(trie *root, int level, long long x) {
if (root == NULL) return 0;
if (level < 0) return 0;
if ((one << level) & x) {
if (root->left != NULL) {
if (root->left->ct)
return (one << level) + query(root->left, level - 1, x);
else
return query(root->right, level - 1, x);
} else
return query(root->right, level - 1, x);
} else {
if (root->right != NULL) {
if (root->right->ct)
return (one << level) + query(root->right, level - 1, x);
else
return query(root->left, level - 1, x);
} else
return query(root->left, level - 1, x);
}
}
int main() {
trie *root = new trie();
int N;
cin >> N;
long long Array[N];
for (int i = 0; i < N; ++i) cin >> Array[i];
long long sufffix[N + 1];
sufffix[N] = 0;
Insert(root, 40, 0, 1);
long long xr = 0;
long long Ans = 0;
for (int i = N - 1; i >= 0; --i) {
xr = (xr ^ Array[i]);
sufffix[i] = xr;
Ans = max(Ans, xr);
Insert(root, 40, xr, 1);
}
xr = 0;
for (int i = 0; i <= N - 1; ++i) {
Insert(root, 40, sufffix[i], -1);
xr = (xr ^ Array[i]);
long long value = query(root, 40, xr);
Ans = max(Ans, value);
}
cout << Ans << endl;
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, count = 0;
cin >> n;
char x[n + 1][n + 1];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> x[i][j];
}
}
for (int i = 2; i < n; i++) {
for (int j = 2; j < n; j++) {
if (x[i][j] == 'X' && x[i - 1][j + 1] == 'X' && x[i + 1][j - 1] == 'X' &&
x[i + 1][j + 1] == 'X' && x[i - 1][j - 1] == 'X') {
count++;
}
}
}
cout << count << endl;
}
| 800 | CPP |
n = int(input())
m = int(input())
mx=0
for i in range(30):
if (2**i == m and i == n):
print(0)
exit(0)
elif (2 ** i > m):
mx = i
break
if (n > mx) :
print (m)
else:
print (m%(2**n))
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int m;
scanf("%d", &m);
int a[1005];
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int b[1005];
for (int i = 0; i < n; i++) scanf("%d", &b[i]);
double Max = 2e9, Min = 0;
while ((Max - Min) / Max > 1e-7) {
double mid = (Max + Min) / 2;
double now = mid + m, fuel = mid;
for (int i = 0; i < n; i++) {
double need = now / a[i];
now -= need;
fuel -= need;
need = now / b[(i + 1) % n];
now -= need;
fuel -= need;
if (fuel < 0) break;
}
if (fuel < 0) {
Min = mid;
} else {
Max = mid;
}
}
if (Min > 1e9)
printf("-1\n");
else
printf("%.12lf\n", Min);
}
| 1,500 | CPP |
t = int(input())
for _ in range(t):
n = int(input())
p = list(map(int, input().split()))
dic = []
for i in p:
if i not in dic:
dic.append(i)
print(*dic) | 800 | PYTHON3 |
//ceil(a/b) is equal to (a+b-1)/b
#include<bits/stdc++.h>
#define mx(a) *max_element(all(a))
#define mn(a) *min_element(all(a))
#define int long long int
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define vec vector <int>
#define pr vector<pair<int,int>>
#define vecv vector <vec>
#define vecs vector <string>
#define vecc vector <char>
#define pi 3.141592653589793238
#define mod 1000000007
#define Mod 998244353
#define inf 1e16
#define precise(i) fixed << setprecision(10) << i
#define endl "\n"
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define one cout<<-1<<endl;
#define err1(a) cout<<#a<<" "<<a<<endl;
#define err2(a,b) cout<<#a<<" "<<a<<" "<<#b<<" "<<b<<endl;
#define err3(a,b,c) cout<<#a<<" "<<a<<" "<<#b<<" "<<b<<" "<<#c<<" "<<c<<endl;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define all(a) a.begin(),a.end()
#define show(a) for(auto xyz:a)cout<<xyz<<" ";cout<<endl;
#define show_nl(a) for(auto xyz:a)cout<<xyz<<endl;
#define loop(a) for(auto xyz:a)
#define f(i,a,b) for(int i=a;i<b;i++)
#define rf(i,a,b) for(int i=b;i>=a;i--)
const long double eps = 1e-8;
#define lb lower_bound //THIS GIVES THE ITR TO THE ELEMENT IN RANGE [SI,EI) THAT IS >= OUR VALUE
#define ub upper_bound //THIS GIVES THE ITR TO THE ELEMENT IN RANGE [SI,EI) THAT IS > OUR VALUE
using namespace std;
signed main() {
fastio
int t=1;
cin>>t;
while(t--)
{
int n;
cin>>n;
int x=0;
int pow1=1;
int sum=0;
int ans=0;
int temp;
f(i,1,11)
{
x+=(pow1);
pow1*=10;
sum=x;
temp=x;
f(j,1,10)
{
if(sum<=n) ans++;
sum+=temp;
}
}
cout<<ans<<endl;
}
} | 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool isPrime(int num) {
if (num == 2) return true;
if (num < 2 || num % 2 == 0) return false;
int limit = sqrt(num);
for (int i = 3; i <= limit; i += 2)
if (num % i == 0) return false;
return true;
}
int main() {
int n, k, counter = 0;
cin >> n >> k;
vector<int> primes;
for (int i = 2; i <= n; i++)
if (isPrime(i)) primes.push_back(i);
for (int i = 0; i < primes.size() - 1; i++) {
int temp = primes[i] + primes[i + 1] + 1;
if (isPrime(temp) && temp <= n) counter++;
}
(counter >= k) ? cout << "YES" : cout << "NO";
return 0;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while (!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
__attribute__((unused)) int idx,
__attribute__((unused)) int LINE_NUM) {
cerr << "\n";
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
if (idx > 0)
cerr << ", ";
else
cerr << "Line(" << LINE_NUM << ") ";
stringstream ss;
ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, LINE_NUM, T...);
}
long long int countpow(long long int n) {
long long int ct = 0;
while (n) {
n /= 2;
ct++;
}
return ct;
}
void solve() {
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
vector<long long int> v(n);
map<long long int, long long int> mp;
for (long long int(i) = 0; (i) < (n); (i)++) {
cin >> v[i];
long long int key = countpow(v[i]);
v[i] = pow(2, key - 1);
mp[v[i]]++;
}
long long int sum = 0;
for (auto it : mp) {
if (it.second > 1) {
sum += (it.second * (it.second - 1)) / 2;
}
}
cout << sum << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
| 1,200 | CPP |
r,c=input().split(" ")
r=int(r)
c=int(c)
bw="BWG"
color="CMY"
l=[]
for i in range(r):
a=input().split(" ")
l.append(a)
flag=0
for i in range(r):
if(flag==1):
break
for j in range(c):
if(l[i][j] in color):
#print("hii",l[i][j])
flag=1
break
else:
flag=0
if(flag==1):
print("#Color")
else:
print("#Black&White") | 800 | PYTHON3 |
n = int(input())
for i in range(n):
c = input()
if len(c) > 10:
print(c[0] + str(len(c) - 2) + c[-1])
else:
print(c)
| 800 | PYTHON3 |
u1, u2=map(int, input().split())
t, d=map(int,input().split())
if u1 > u2:
u1,u2=u2,u1
s = [u1 for i in range(t-1)]
s.append(u2)
l=1
r=t-2
for i in range(t-2, 0, -1):
s[i]=s[i+1]+d
i =1
while s[i] -s[i-1]>d:
s[i]=s[i-1]+d
i+=1
print(sum(s)) | 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n], remove[n], ans[n], sum[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
remove[i] = a[i];
if (i == 0)
sum[i] = a[i];
else
sum[i] = sum[i - 1] + a[i];
}
for (int i = 0; i < n; i++) {
if (sum[i] <= m)
ans[i] = 0;
else {
int need = sum[i] - m;
int temp = 0;
sort(remove, remove + i);
int j = i - 1;
int add = 0;
while (1) {
temp += remove[j];
j--;
add++;
if (temp >= need) {
ans[i] = add;
break;
}
}
}
printf("%d ", ans[i]);
}
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, dp[200][200], ans;
string a;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
cin >> a;
int c = a[a.length() - 1], c2 = a[0];
for (int i = 'a'; i <= 'z'; ++i)
if (dp[i][c2] > 0) dp[i][c] = max(dp[i][c], dp[i][c2] + (int)a.length());
dp[c2][c] = max(dp[c2][c], (int)a.length());
}
for (int i = 'a'; i <= 'z'; ++i) ans = max(ans, dp[i][i]);
printf("%d ", ans);
}
| 1,500 | CPP |
from math import ceil
from collections import deque
for _ in range(int(input())):
n = int(input())
s = input()+"A"
ans = c = 0
j = 0
while s[j]=='P' and j<n:
j += 1
while j<n:
if s[j]=='A':
c = 0
else:
c += 1
ans = max(ans, c)
j += 1
print(ans) | 800 | PYTHON3 |
x = input()
d = {}
for l in 'abcdefghijklmnopqrstuvwxyz':
if l in x:
d[l] = x.count(l)
def panic():
print("No")
exit(0)
def ok():
print("Yes")
exit(0)
cnt = len(d.keys())
nums = sorted(d.values())
if cnt == 2 and nums[0] > 1 and nums[1] > 1:
ok()
if cnt == 3 and max(nums)>1:
ok()
if cnt == 4:
ok()
panic()
| 1,400 | PYTHON3 |
n = int(input())
f = {}
for i in range(n):
s = input()
if s in f:
f[s]+=1
else:
f[s]=1
# print(f)
print(max(f, key = f.get))
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
ofstream g("date.out");
int v[300005];
int dp[300005][22];
int ant[22];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.tie(NULL);
int n, q;
cin >> n >> q;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= 20; j++) {
if (v[i] & (1 << j)) {
dp[i][j] = i;
for (int k = 0; k <= 20; k++) {
dp[i][k] = max(dp[i][k], dp[ant[j]][k]);
}
ant[j] = i;
}
}
}
for (int i = 1; i <= q; i++) {
int x, y;
cin >> x >> y;
int rasp = 0;
for (int bit = 0; bit <= 20; bit++) {
if (((v[x]) & (1 << bit)) != 0 && dp[y][bit] >= x) {
rasp = 1;
break;
}
}
if (rasp) {
cout << "Shi" << '\n';
} else
cout << "Fou" << '\n';
}
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int x, y, n, k, cnt;
int val[1010], nxt[1010], id[1010];
int f[1010][1010];
int f1[1010];
int ans[1010];
int dis[1010][1010];
int a[1010];
inline void Build(int x, int y) {
cnt++;
val[cnt] = y;
nxt[cnt] = id[x];
id[x] = cnt;
}
inline void dfs(int x, int fa) {
for (int i = 1; i <= n; ++i) f[i][x] = a[dis[i][x]] + k;
for (int i = id[x]; i; i = nxt[i]) {
int y = val[i];
if (y == fa) continue;
dfs(y, x);
for (int j = 1; j <= n; ++j)
f[j][x] = f[j][x] + min(f[j][y] - k, f[f1[y]][y]);
}
f1[x] = 1;
for (int i = 1; i <= n; ++i)
if (f[i][x] < f[f1[x]][x]) f1[x] = i;
}
inline void tong(int x, int fa, int v) {
for (int i = id[x]; i; i = nxt[i]) {
int y = val[i];
if (y == fa) continue;
if (f[f1[y]][y] > f[v][y] - k)
ans[y] = v;
else
ans[y] = f1[y];
tong(y, x, ans[y]);
}
}
int main() {
scanf("%d%d", &n, &k);
memset(dis, 0x3f, sizeof(dis));
for (int i = 1; i < n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= n; ++i) dis[i][i] = 0;
for (int i = 1; i < n; ++i) {
scanf("%d%d", &x, &y);
dis[x][y] = 1;
dis[y][x] = 1;
Build(x, y), Build(y, x);
}
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
for (int k = 1; k <= n; ++k)
if (dis[j][k] > dis[j][i] + dis[i][k])
dis[j][k] = dis[j][i] + dis[i][k];
dfs(1, 0);
printf("%d\n", f[f1[1]][1]);
ans[1] = f1[1];
tong(1, 0, ans[1]);
for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
printf("\n");
return 0;
}
| 2,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const bool debugger1 = 1;
const bool debugger2 = 0;
const bool debugger3 = 0;
const bool debugger4 = 0;
const bool debugger5 = 0;
const long long wielkosc = 1e5 + 90;
const long long maxlen = 7;
long long n;
long long p10[10];
map<long long, string> m;
set<long long> second[10];
template <class T>
string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
long long getlen(long long x) {
long long ans = 0;
while (x) {
x /= 10;
ans++;
}
return max(ans, (long long)1);
}
string daj(long long x) {
if (m.count(x)) return m[x];
return toString(x);
}
void uprosc(long long x, string str) {
if (x > n || str.length() >= getlen(x)) return;
if (m.count(x) && m[x].length() <= str.length()) return;
second[m[x].length()].erase(x);
m[x] = str;
second[str.length()].insert(x);
}
void pot10() {
p10[0] = 1;
for (int i = 1; i < 10; i++) p10[i] = 10 * p10[i - 1];
}
void zrob_potegi() {
for (long long x = 2; x * x <= n; x++) {
long long c = x * x;
long long akpot = 2;
while (c <= n) {
string temp = toString(x) + "^" + toString(akpot);
uprosc(c, temp);
c *= x;
akpot++;
}
}
}
void potrazypot() {
for (long long i = 1; i <= maxlen; i++) {
for (long long j = i; i + j + 1 <= maxlen; j++) {
for (auto x : second[i]) {
for (auto y : second[j]) {
uprosc(x * y, daj(x) + "*" + daj(y));
}
}
}
}
}
void potrazynum() {
for (long long i = 1; i + 2 <= maxlen; i++) {
for (long long x = 1; x < p10[maxlen - 1 - i]; x++) {
for (long long y : second[i]) {
uprosc(x * y, toString(x) + '*' + daj(y));
}
}
}
}
void pocz() {
zrob_potegi();
potrazypot();
potrazynum();
}
string ans;
void ustans(string second) {
if (ans.length() > second.length()) {
ans = second;
}
}
void dajodp() {
for (long long i = 1; i * 2 + 1 < ans.length(); i++) {
for (long long x = 1; x <= p10[i]; x++) {
ustans(daj(n - x) + "+" + daj(x));
if (n % x == 0) {
ustans(daj(n / x) + "*" + daj(x));
}
}
for (auto x : second[i]) {
ustans(daj(n - x) + "+" + daj(x));
if (n % x == 0) {
ustans(daj(n / x) + "*" + daj(x));
}
}
}
}
int main() {
pot10();
scanf("%lld", &n);
pocz();
ans = daj(n);
dajodp();
cout << ans;
return 0;
}
| 2,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXn = 500 + 10;
int n, m;
int a[MAXn][MAXn];
int r[MAXn][MAXn], c[MAXn][MAXn];
int f[MAXn][MAXn];
int ans = -(1 << 30);
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0, _n = (n); i < _n; i++)
for (int j = 0, _n = (m); j < _n; j++) cin >> a[i][j];
for (int i = 0, _n = (n); i < _n; i++)
for (int j = 0, _n = (m); j < _n; j++)
r[i][j + 1] = r[i][j] + a[i][j], c[i + 1][j] = c[i][j] + a[i][j];
for (int i = 0, _n = (n - 2); i < _n; i++)
for (int j = 0, _n = (m - 2); j < _n; j++) f[i][j] = a[i][j];
for (int k = 5; k <= min(n, m); k += 4)
for (int i = 0, _n = (n - k + 1); i < _n; i++)
for (int j = 0, _n = (m - k + 1); j < _n; j++) {
f[i][j] = f[i + 2][j + 2] + (r[i][j + k] - r[i][j]) +
(c[i + k][j + k - 1] - c[i + 1][j + k - 1]) +
(r[i + k - 1][j + k - 1] - r[i + k - 1][j]) +
(c[i + k - 1][j] - c[i + 2][j]) + a[i + 2][j + 1];
(ans = max(ans, f[i][j]));
}
for (int i = 0, _n = (n - 2); i < _n; i++)
for (int j = 0, _n = (m - 2); j < _n; j++) {
f[i][j] = a[i][j] + a[i][j + 1] + a[i][j + 2] + a[i + 1][j + 2] +
a[i + 2][j + 2] + a[i + 2][j + 1] + a[i + 2][j];
(ans = max(ans, f[i][j]));
}
for (int k = 7; k <= min(n, m); k += 4)
for (int i = 0, _n = (n - k + 1); i < _n; i++)
for (int j = 0, _n = (m - k + 1); j < _n; j++) {
f[i][j] = f[i + 2][j + 2] + (r[i][j + k] - r[i][j]) +
(c[i + k][j + k - 1] - c[i + 1][j + k - 1]) +
(r[i + k - 1][j + k - 1] - r[i + k - 1][j]) +
(c[i + k - 1][j] - c[i + 2][j]) + a[i + 2][j + 1];
(ans = max(ans, f[i][j]));
}
cout << ans << endl;
{
int _;
cin >> _;
}
}
| 1,900 | CPP |
t= int(input())
while(t > 0):
t -= 1
print(int(input())//2) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
short f = 1;
x = 0;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') f = -1;
c = getchar();
}
while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
x *= f;
}
int main() {
string s = "1001010111001010";
int n;
read(n);
cout << s[n - 1] << endl;
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct tree {
int id;
long long d, mi;
} f[500005 * 4];
struct node {
int x, y, z;
} b[500005];
int q[500005], n, tot, r;
map<int, int> ma;
vector<int> A[500005], a;
set<int> G;
set<int>::iterator gt;
long long F[500005];
inline void change(int x, long long y) {
for (; x <= r; x += x & -x) F[x] += y;
}
inline long long ask(int x) {
long long s = 0;
for (; x; x -= x & -x) s += F[x];
return s;
}
inline bool cmp(int x, int y) { return b[x].y < b[y].y; }
inline void build(int o, int l, int r) {
f[o].mi = 1000000000000000000ll;
if (l == r) {
f[o].id = q[l];
return;
}
int mid = (l + r) >> 1;
build((o << 1), l, mid), build(((o << 1) + 1), mid + 1, r);
}
inline void down(int o) {
if (!f[o].d) return;
f[(o << 1)].mi += f[o].d;
f[(o << 1)].d += f[o].d;
f[((o << 1) + 1)].mi += f[o].d;
f[((o << 1) + 1)].d += f[o].d;
f[o].d = 0;
}
inline void change(int o, int l, int r, int ll, long long p) {
if (l == ll && r == ll) {
f[o].mi = p;
return;
}
down(o);
int mid = (l + r) >> 1;
if (ll <= mid)
change((o << 1), l, mid, ll, p);
else
change(((o << 1) + 1), mid + 1, r, ll, p);
f[o].mi = min(f[(o << 1)].mi, f[((o << 1) + 1)].mi);
}
inline void change(int o, int l, int r, int ll, int rr, int p) {
if (ll > rr) return;
if (l == ll && r == rr) {
f[o].mi += p;
f[o].d += p;
return;
}
down(o);
int mid = (l + r) >> 1;
if (rr <= mid)
change((o << 1), l, mid, ll, rr, p);
else if (ll > mid)
change(((o << 1) + 1), mid + 1, r, ll, rr, p);
else
change((o << 1), l, mid, ll, mid, p),
change(((o << 1) + 1), mid + 1, r, mid + 1, rr, p);
f[o].mi = min(f[(o << 1)].mi, f[((o << 1) + 1)].mi);
}
inline void ask(int o, int l, int r) {
if (l == r) {
if (f[o].mi < 0) G.insert(f[o].id), f[o].mi = 1000000000000000000ll;
return;
}
down(o);
int mid = (l + r) >> 1;
if (f[(o << 1)].mi < 0) ask((o << 1), l, mid);
if (f[((o << 1) + 1)].mi < 0) ask(((o << 1) + 1), mid + 1, r);
f[o].mi = min(f[(o << 1)].mi, f[((o << 1) + 1)].mi);
}
int main() {
scanf("%d", &n);
int ans = 0;
for (int i = 1; i <= n; i++) {
char c = getchar();
while (c != '+' && c != '-') c = getchar();
if (c == '+')
b[i].x = 1;
else
b[i].x = 0;
scanf("%d", &b[i].y);
if (b[i].x == 1) q[++r] = i;
}
sort(q + 1, q + 1 + r, cmp);
for (int i = 1; i <= r; i++) b[q[i]].z = i;
build(1, 1, r);
for (int i = 1; i <= n; i++) {
if (!ma[b[i].y]) ma[b[i].y] = ++tot;
int Y = ma[b[i].y];
if (b[i].x == 1) {
A[Y].push_back(i);
ans++;
long long sum = ask(b[i].z);
long long p = (b[i].y + 1) / 2;
change(b[i].z, b[i].y);
if (sum >= p) {
change(1, 1, r, b[i].z, sum - p);
change(1, 1, r, b[i].z + 1, r, b[i].y);
} else {
change(1, 1, r, b[i].z + 1, r, b[i].y);
G.insert(i);
}
a.clear();
for (gt = G.begin(); gt != G.end(); gt++) {
int tmp = *gt;
if (b[tmp].z <= b[i].z) continue;
sum = ask(b[tmp].z - 1);
p = (b[tmp].y + 1) >> 1;
if (sum >= p) {
a.push_back(tmp);
change(1, 1, r, b[tmp].z, sum - p);
}
}
for (int i = 0; i < a.size(); i++) G.erase(a[i]);
printf("%d\n", ans - (int)G.size());
} else {
int x = *A[Y].begin();
change(b[x].z, -b[x].y);
A[Y].erase(A[Y].begin());
change(1, 1, r, b[x].z + 1, r, -b[x].y);
change(1, 1, r, b[x].z, 1000000000000000000ll);
ask(1, 1, r);
gt = G.find(x);
if (gt != G.end()) G.erase(gt);
ans--;
printf("%d\n", ans - (int)G.size());
}
}
}
| 2,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5, INF = int(1e9), mod = int(1e9) + 7;
const long long BIG = 1e17;
int n, a[N], b[N], s[N];
int main() {
cin >> n;
if (n % 2 == 0) {
cout << "NO\n";
return 0;
}
int num = 1;
bool cond = 1;
for (int i = 1; i <= n; i++) {
if (cond) {
a[i] = num;
a[i + n] = num + 1;
} else {
a[i] = num + 1;
a[i + n] = num;
}
cond = 1 - cond;
num += 2;
}
cout << "YES\n";
for (int i = 1; i <= 2 * n; i++) {
cout << a[i] << " ";
}
}
| 1,200 | CPP |
from random import randint
n=randint(0,9)
print(n)
s=str(input())
if(s=="don't think so" or s=="don't touch me" or s=="not bad" or s=="great" or s=="cool"):
print("normal")
elif(s=="are you serious?" or s=="go die in a hole" or s=="worse" or s=="terrible" or s=="no way" or s=="don't even"):
print("grumpy")
elif(s=="no"):
z=0
while(z==0):
n=randint(0,9)
print(n)
s=str(input())
if(s=="don't think so" or s=="don't touch me" or s=="not bad" or s=="great" or s=="cool"):
print("normal")
z=1
elif(s=="are you serious?" or s=="go die in a hole" or s=="worse" or s=="terrible" or s=="no way" or s=="don't even"):
print("grumpy")
z=1
elif(s=="no"):
pass
| 1,900 | PYTHON3 |
a=input()
b=[int(x) for x in a.split()]
print((b[0]*b[1])//2) | 800 | PYTHON3 |
for _ in range(int(input())):
n,m=map(int,input().split())
print("YNEOS"[n%m!=0::2])
| 800 | PYTHON3 |
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
if d > 0 and d < l:
print(d)
else:
print(((r+d)//d) * d)
| 1,000 | PYTHON3 |
a = input()
b = len(a)
def pal(a):
return a==a[::-1]
for i in range(b):
if pal(a[i:]):
b -= 1
else:
break
print(b)
| 900 | PYTHON3 |
import sys
input = sys.stdin.readline
for _ in range(int(input())):
n = int(input())
hs = list(map(int, input().split()))
even = []
odd = []
for h in hs:
if h % 2:
odd.append(h)
else:
even.append(h)
for x in odd:
print(x, end=' ')
for x in even:
print(x, end=' ')
print() | 800 | PYTHON3 |
for i in range(int(input())):
n=int(input())
arr=list(map(int,input().split()))
ty=set(arr)
if(len(ty)==1):
print(n)
else:
print("1") | 800 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, m, Max, Min, i, x, flag = 0, ok = 0;
scanf("%d%d%d%d", &n, &m, &Min, &Max);
for (i = 0; i < m; i++) {
scanf("%d", &x);
if (x == Max)
flag = 1;
else if (x == Min)
flag = 1;
else if (x > Max)
ok = 1;
else if (x < Min)
ok = 1;
}
if (ok == 1)
printf("Incorrect");
else if (flag == 0 && n - m < 2)
printf("Incorrect");
else
printf("Correct");
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
const long long mod = 998244353;
const long long LINF = 1ll << 60;
const int INF = 1 << 30;
int dx[] = {0, 1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, 0, -1, 1, -1, -1, 1};
int main() {
int T;
cin >> T;
while (T--) {
int h, w, n;
cin >> h >> w >> n;
string s;
cin >> s;
vector<int> cnt(26, 0);
int res = n - (h + w);
for (int i = 0; i < s.length(); i++) {
cnt[s[i] - 'A']++;
}
long long ans = LINF;
for (int i = 0; i < 26; i++) {
if (cnt[i] == 0) continue;
vector<bool> dp(h + 1, 0);
dp[0] = true;
for (int j = 0; j < 26; j++) {
if (i == j) continue;
for (int k = h; k >= 0; k--) {
if (not dp[k]) continue;
if (k + cnt[j] <= h) dp[k + cnt[j]] = true;
}
}
for (int j = max(0, h - cnt[i]); j <= h; j++) {
if (not dp[j]) continue;
long long S = h - j;
chmin(ans, S * max(0ll, (cnt[i] - S - res)));
}
}
cout << ans << endl;
}
return 0;
}
| 2,300 | CPP |
count=0
n=int(input())
count=n//100
n=n-count*100
while (n!=0):
if n>=100:
n=n-100
count=count+1
elif n>=20:
n=n-20
count=count+1
elif n>=10:
n=n-10
count=count+1
elif n>=5:
n=n-5
count=count+1
elif n>=1:
n=n-1
count=count+1
print(count)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
int n = s.length();
if (n < 3 || n == 3 && s <= "127")
printf("byte\n");
else if (n < 5 || n == 5 && s <= "32767")
printf("short\n");
else if (n < 10 || n == 10 && s <= "2147483647")
printf("int\n");
else if (n < 19 || n == 19 && s <= "9223372036854775807")
printf("long\n");
else
printf("BigInteger\n");
return 0;
}
| 1,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAX = (const int)(1e6 + 11);
int T[4 * MAX], P[4 * MAX];
static void t_set(int v, int a, int b, int idx, int x) {
if (a == idx && b == idx) {
T[v] = x;
P[v] = max(P[v], x);
} else {
int m = (a + b) / 2;
if (idx <= m)
t_set(2 * v, a, m, idx, x);
else
t_set(2 * v + 1, m + 1, b, idx, x);
T[v] = T[2 * v] + T[2 * v + 1];
P[v] = max(P[2 * v + 1], P[2 * v] + T[2 * v + 1]);
}
}
static int t_get(int v, int a, int b, int f, int t) {
if (f > t) return 0;
if (a == f && b == t) return T[v];
int m = (a + b) / 2;
int x = t_get(2 * v, a, m, f, min(t, m));
int y = t_get(2 * v + 1, m + 1, b, max(f, m + 1), t);
return x + y;
}
static int t_idx(int v, int a, int b, int x, int p = 0) {
if (a == b) return a;
int m = (a + b) / 2;
if (P[2 * v + 1] + p >= x) return t_idx(2 * v + 1, m + 1, b, x, p);
return t_idx(2 * v, a, m, x, p + T[2 * v + 1]);
}
struct {
int p, t, x;
} A[MAX];
int N;
static int t_get(int f, int t) { return t_get(1, 0, N - 1, f, t); }
static void t_set(int idx, int x) { t_set(1, 0, N - 1, idx, x); }
static int t_idx() {
if (P[1] <= 0) return -1;
return t_idx(1, 0, N - 1, 1);
}
static void solve(std::int32_t test) {
memset(P, 0xFF, sizeof(P));
memset(T, 0, sizeof(T));
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> A[i].p >> A[i].t;
if (A[i].t != 0) cin >> A[i].x;
}
map<int, int> xs;
for (int i = 0; i < N; ++i)
if (A[i].t != 0) xs[A[i].p] = A[i].x;
for (int i = 0; i < N; ++i) {
if (A[i].t == 0)
t_set(A[i].p - 1, -1);
else
t_set(A[i].p - 1, +1);
int res = t_idx();
if (0 <= res && res < N) res = xs[res + 1];
cout << res << "\n";
}
}
int main() {
ios_base::sync_with_stdio(0);
cout << setprecision(12) << fixed;
solve(0);
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
struct MCF {
int n;
vector<int> prio, curflow, prevedge, prevnode, pot;
priority_queue<long long, vector<long long>, greater<long long>> q;
struct edge {
int to, rev;
int f, cap, cost;
};
vector<vector<edge>> adj;
MCF(int n)
: n(n), prio(n), curflow(n), prevedge(n), prevnode(n), pot(n), adj(n) {}
void add_edge(int s, int t, int cap, int cost) {
adj[s].push_back((edge){t, int(adj[t].size()), 0, cap, cost});
adj[t].push_back((edge){s, int(adj[s].size()) - 1, 0, 0, -cost});
}
pair<int, int> get_flow(int s, int t) {
int flow = 0, flowcost = 0;
while (1) {
q.push(s);
fill(prio.begin(), prio.end(), INF);
prio[s] = 0;
curflow[s] = INF;
while (!q.empty()) {
long long cur = q.top();
int d = cur >> 32, u = cur;
q.pop();
if (d != prio[u]) continue;
for (int i = 0; i < int(adj[u].size()); ++i) {
edge &e = adj[u][i];
int v = e.to;
if (e.cap <= e.f) continue;
int nprio = prio[u] + e.cost + pot[u] - pot[v];
if (prio[v] > nprio) {
prio[v] = nprio;
q.push(((long long)nprio << 32) + v);
prevnode[v] = u;
prevedge[v] = i;
curflow[v] = min(curflow[u], e.cap - e.f);
}
}
}
if (prio[t] == INF) break;
for (int i = 0, ThxDem = n; i < ThxDem; ++i) pot[i] += prio[i];
int df = min(curflow[t], INF - flow);
flow += df;
for (int v = t; v != s; v = prevnode[v]) {
edge &e = adj[prevnode[v]][prevedge[v]];
e.f += df;
adj[v][e.rev].f -= df;
flowcost += df * e.cost;
}
}
return {flow, flowcost};
}
};
int n, m, k, c, d;
int main() {
scanf("%d%d%d%d%d", &n, &m, &k, &c, &d);
MCF nt(6 + 107 * n);
for (int _ = 0, ThxDem = k; _ < ThxDem; ++_) {
int x;
scanf("%d", &x);
x--;
nt.add_edge(0, 1 + x, 1, 0);
}
for (int _ = 0, ThxDem = m; _ < ThxDem; ++_) {
int x, y;
scanf("%d%d", &x, &y);
x--;
y--;
for (int i = 0, ThxDem = 105; i < ThxDem; ++i) {
for (int j = 0, ThxDem = 51; j < ThxDem; ++j) {
nt.add_edge(1 + i * n + x, 1 + (i + 1) * n + y, 1, c + d * (2 * j + 1));
nt.add_edge(1 + i * n + y, 1 + (i + 1) * n + x, 1, c + d * (2 * j + 1));
}
}
}
for (int i = 0, ThxDem = 105; i < ThxDem; ++i)
for (int j = 0, ThxDem = n; j < ThxDem; ++j)
nt.add_edge(1 + i * n + j, 1 + (i + 1) * n + j, 51, c);
for (int i = 0, ThxDem = 105; i < ThxDem; ++i)
nt.add_edge(1 + i * n, 1 + 105 * n, 51, 0);
auto ans = nt.get_flow(0, 1 + 105 * n);
printf("%d\n", ans.second);
return 0;
}
| 2,500 | CPP |
'''input
5 7
2 3 5 4 1
'''
import sys
from collections import defaultdict as dd
from itertools import permutations as pp
from itertools import combinations as cc
from collections import Counter as ccd
from random import randint as rd
from bisect import bisect_left as bl
from heapq import heappush as hpush
from heapq import heappop as hpop
mod=10**9+7
def ri(flag=0):
if flag==0:
return [int(i) for i in sys.stdin.readline().split()]
else:
return int(sys.stdin.readline())
def check(k):
now=a[:k]
now.sort(reverse=True)
ok=0
f=0
for i in range(len(now)):
f+=1
if f%2==1:
ok+=now[i]
if ok<=h:
return 1
else:
return 0
n,h=ri()
a=ri()
ans=-1
low=0
high=n
while low<=high:
mid=(low+high)//2
if check(mid):
low=mid+1
ans=mid
else:
high=mid-1
print(ans) | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, k, rem;
bool dp[5005][1 << 12];
string s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
n = s.size();
k = log2(n);
rem = n - (1 << k) + 1;
for (int mask = 0; mask < (1 << k); ++mask) dp[0][mask] = true;
for (int i = 1; i <= rem; ++i) {
char ans = 'z';
for (int mask = 0; mask < (1 << k); ++mask)
if (dp[i - 1][mask]) ans = min(ans, s[i + mask - 1]);
cout << ans;
for (int mask = 0; mask < (1 << k); ++mask) {
if (dp[i - 1][mask] && s[i + mask - 1] == ans) dp[i][mask] = true;
if (dp[i][mask]) {
for (int j = 0; j < k; ++j) {
if ((mask >> j) & 1) continue;
dp[i][mask | (1 << j)] = true;
}
}
}
}
}
| 2,700 | CPP |
a=int(input())
b=list(map(int,input().split()))
c=list(map(int,input().split()))
b.remove(b[0])
c.remove(c[0])
y=[]
d=[]
for i in range(1,a+1):
y.append(i)
x=set(y)
d=b+c
e=set(d)
if(e==x):
print('I become the guy.')
else:
print('Oh, my keyboard!') | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5, maxm = 2e6 + 6;
int n, a[maxn], p[maxm], vis[maxm], fa[maxm];
int get(int x) { return x == fa[x] ? x : fa[x] = get(fa[x]); }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", a + i);
for (int i = 2, m = 2e6; i <= m; i++) {
if (!vis[i]) p[++p[0]] = i;
fa[i] = i;
for (int j = 1; j <= p[0] && i * p[j] <= m; j++) {
vis[i * p[j]] = 1;
if (i % p[j] == 0) break;
}
}
int pd = 0;
for (int i = 1, x, y; i <= n; i++) {
if (pd)
x = get(2), y = sqrt(x);
else
x = get(a[i]), y = sqrt(x), pd |= (x > a[i]);
printf("%d%c", x, i == n ? '\n' : ' ');
for (int j = 1; p[j] <= y; j++) {
if (x % p[j]) continue;
while (!(x % p[j])) x /= p[j];
for (int o = p[j]; o < maxm; o += p[j]) fa[get(o)] = get(o + 1);
}
if (x > 1)
for (int o = x; o < maxm; o += x) fa[get(o)] = get(o + 1);
}
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 100;
char st[maxn];
int dl[maxn], dr[maxn];
int main() {
int n;
while (cin >> n && n) {
scanf("%s", st + 1);
dl[0] = dr[n + 1] = 0;
int num = 0;
for (int i = 1; i <= n; ++i) {
if (st[i] == '(')
num++;
else
num--;
if (num < 0 || dl[i - 1] < 0)
dl[i] = -1;
else
dl[i] = num;
}
num = 0;
for (int i = n; i >= 1; --i) {
if (st[i] == ')')
num++;
else
num--;
if (num < 0 || dr[i + 1] < 0)
dr[i] = -1;
else
dr[i] = num;
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
if (dl[i - 1] >= 0 && dr[i + 1] >= 0) {
int t = dl[i - 1] - dr[i + 1];
if (t == 1 && st[i] == '(')
ans++;
else if (t == -1 && st[i] == ')')
ans++;
}
}
cout << ans << endl;
}
return 0;
}
| 1,900 | CPP |
#from bisect import bisect_left as bl #c++ lowerbound bl(array,element)
#from bisect import bisect_right as br #c++ upperbound br(array,element)
#from __future__ import print_function, division #while using python2
def modinv(n,p):
return pow(n,p-2,p)
def main():
#sys.stdin = open('input.txt', 'r')
#sys.stdout = open('output.txt', 'w')
for case in range(int(input())):
n = int(input())
matrix = []
for i in range(n):
matrix.append([0] * n)
for i in range(n):
temp = input()
for j in range(n):
matrix[i][j] += int(temp[j])
# print(matrix)
ans_flag = True
for i in range(n):
for j in range(n):
if matrix[i][j] == 1:
if i == n-1 or j == n-1:
pass
elif matrix[i+1][j] == 1 or matrix[i][j+1] == 1:
pass
else:
ans_flag = False
break
if ans_flag == False:
break
if ans_flag:
print("YES")
else:
print("NO")
#------------------ Python 2 and 3 footer by Pajenegod and c1729-----------------------------------------
py2 = round(0.5)
if py2:
from future_builtins import ascii, filter, hex, map, oct, zip
range = xrange
import os, sys
from io import IOBase, BytesIO
BUFSIZE = 8192
class FastIO(BytesIO):
newlines = 0
def __init__(self, file):
self._file = file
self._fd = file.fileno()
self.writable = "x" in file.mode or "w" in file.mode
self.write = super(FastIO, self).write if self.writable else None
def _fill(self):
s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.seek((self.tell(), self.seek(0,2), super(FastIO, self).write(s))[0])
return s
def read(self):
while self._fill(): pass
return super(FastIO,self).read()
def readline(self):
while self.newlines == 0:
s = self._fill(); self.newlines = s.count(b"\n") + (not s)
self.newlines -= 1
return super(FastIO, self).readline()
def flush(self):
if self.writable:
os.write(self._fd, self.getvalue())
self.truncate(0), self.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
if py2:
self.write = self.buffer.write
self.read = self.buffer.read
self.readline = self.buffer.readline
else:
self.write = lambda s:self.buffer.write(s.encode('ascii'))
self.read = lambda:self.buffer.read().decode('ascii')
self.readline = lambda:self.buffer.readline().decode('ascii')
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
if __name__ == '__main__':
main()
| 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 55;
struct node {
int x, y;
} grid[maxn * maxn];
int n, m, k, num;
bool cmp(node a, node b) { return a.x + a.y < b.x + b.y; }
int main() {
num = 0;
cin >> n >> m >> k;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) grid[num].x = i, grid[num++].y = j;
sort(grid, grid + n * m, cmp);
int ans = 0;
for (int i = 0; i < k; i++) ans += grid[i].x + grid[i].y - 1;
cout << ans << endl;
for (int i = k - 1; i >= 0; i--) {
for (int j = 1; j <= grid[i].x; j++) printf("(%d,%d) ", j, 1);
for (int j = 2; j <= grid[i].y; j++) printf("(%d,%d) ", grid[i].x, j);
cout << endl;
}
return 0;
}
| 0 | CPP |
n, ans, last = int(input()), 0, 0
a = list(map(int, input().split()))
for i in range(len(a)):
while last > 0 and a[i] >= 2:
ans += 1
a[i] -= 2
last -= 1
ans += a[i] // 3
last += a[i] % 3
print(ans) | 1,900 | PYTHON3 |
import sys
def gcd(a, b):
if a<b:
return gcd(b, a)
if b == 0:
return a
return gcd(b, a%b)
in_file = sys.stdin #open("C.txt", "r")
n, m, q = map(int, in_file.readline().strip().split())
d = gcd(n, m)
n = n//d
m = m//d
for _ in range(q):
sx, sy, ex, ey = map(int, in_file.readline().strip().split())
sy -= 1
ey -= 1
if sx == 1:
sy = sy//n
else:
sy = sy//m
if ex == 1:
ey = ey//n
else:
ey = ey//m
if ey == sy:
print("YES")
else:
print("NO")
sys.stdout.flush() | 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[100500];
int main() {
int n, res = 0;
cin >> n;
int rsum = 0, lsum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
rsum += a[i];
}
for (int i = 0; i < n - 1; i++) {
lsum += a[i];
rsum -= a[i];
res += (lsum == rsum);
}
cout << res;
return 0;
}
| 1,200 | CPP |
import io
import os
from collections import Counter, defaultdict, deque
def solve(N, A, B):
valToIndex = {}
for i, x in enumerate(A):
valToIndex[x] = i
rotateToMatches = defaultdict(int)
for i, x in enumerate(B):
j = valToIndex[x]
rotateToMatches[(j - i) % N] += 1
return max(rotateToMatches.values())
if __name__ == "__main__":
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
(N,) = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
ans = solve(N, A, B)
print(ans)
| 1,400 | PYTHON3 |
no = int(input())
res = []
for i in range(no):
x=int(input())
res.append(x)
for i in res:
print(i) | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int max_N = 100000 + 10;
const int N = 100000;
const int sq = 320;
vector<int> h[max_N], v[max_N];
unordered_map<int, bool> mark[max_N];
int main() {
int n, x, y;
long long ans(0);
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &x, &y);
h[y].push_back(x);
mark[x][y] = true;
}
for (int i = 0; i <= N; i++) {
int sz = (int)h[i].size();
if (sz > sq) {
for (int x : h[i]) v[x].push_back(i);
continue;
}
for (int j = 0; j < sz; j++) {
int a = h[i][j];
for (int k = j + 1; k < sz; k++) {
int b = h[i][k];
int t = abs(a - b);
if (i + t <= N && mark[a][i + t] && mark[b][i + t]) ans++;
if (i - t >= 0 && mark[a][i - t] && mark[b][i - t]) ans++;
}
mark[a][i] = false;
}
}
for (int i = 0; i <= N; i++) {
int sz = (int)v[i].size();
for (int j = 0; j < sz; j++) {
for (int k = j + 1; k < sz; k++) {
int a = v[i][j], b = v[i][k];
int t = abs(a - b);
if (mark[i + t][a] && mark[i + t][b]) ans++;
}
}
}
printf("%lld\n", ans);
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
long long n;
long long p[100000];
int cs[100000], np;
long long res;
void update(long long z, long long y, long long x) {
if (z >= y && y >= x && ((x + y + z) % 2 == 0) && z < y + x) {
long long p = (x + y + z) / 2;
long long a = p - x;
long long b = p - y;
long long c = p - z;
if (a < b) swap(a, b);
if (a < c) swap(a, c);
if (b < c) swap(b, c);
if (a == b && b == c)
res++;
else if (a == b)
res += 3;
else if (b == c)
res += 3;
else
res += 6;
}
}
void findY(int i, long long y, long long z) {
if (y > z) return;
if (i == np + 1) {
update(z, y, n / y / z);
return;
}
long long t = 1;
for (int cnt = (0), _b = (cs[i]); cnt <= _b; cnt++) {
cs[i] -= cnt;
findY(i + 1, y * t, z);
cs[i] += cnt;
if (cnt != cs[i]) t *= p[i];
}
}
void findZ(int i, long long z) {
if (i == np + 1) {
findY(1, 1, z);
return;
}
long long t = 1;
for (int cnt = (0), _b = (cs[i]); cnt <= _b; cnt++) {
cs[i] -= cnt;
findZ(i + 1, z * t);
cs[i] += cnt;
if (cnt != cs[i]) t *= p[i];
}
}
int main() {
cin >> n;
if ((n % 3)) {
cout << 0;
return 0;
}
n /= 3;
long long T = n;
for (int i = (2), _b = (sqrt(n) + 10); i <= _b; i++)
if ((T % i) == 0) {
p[++np] = i;
while ((T % i) == 0) {
cs[np]++;
T /= i;
}
}
if (T > 1) {
p[++np] = T;
cs[np] = 1;
}
res = 0;
findZ(1, 1);
cout << res;
return 0;
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long m, cnt, a, b, c, d, o, p, u, v, x, y, z, i, j, l, flg, t = 1, tc,
gt, ans;
long long ax, ay, bx, by, cx, cy, pos;
while (cin >> ax >> ay >> bx >> by >> cx >> cy) {
pos = ((bx - ax) * (cy - ay) - (by - ay) * (cx - ax));
if (pos == 0)
printf("TOWARDS\n");
else if (pos < 0)
printf("RIGHT\n");
else
printf("LEFT\n");
}
return 0;
}
| 1,300 | CPP |
n = int(input())
ans = 1 + (3 * n * (n + 1))
print(ans)
| 1,100 | PYTHON3 |
n,k=map(int,input().split())
b=[]
for i in range(n):
f,t=map(int,input().split())
if t>k:
b.append(f-t+k)
else:
b.append(f)
print(max(b)) | 900 | PYTHON3 |
def main():
neck = input()
count1 = neck.count('-')
count2 = neck.count('o')
if count1 == 0 or count2 ==0:
print('YES')
elif count1 % count2 == 0:
print('YES')
else :
print('NO')
if __name__ == '__main__':
main() | 900 | PYTHON3 |
for i in range(int(input())):
a,b=list(map(int,input().split()))
print(a+b) | 800 | PYTHON3 |
from bisect import *
from sys import stdin
input = stdin.readline
for _ in ' '*int(input()):
n, m = map(int, input().split())
a = sorted([(int(x), i) for i, x in enumerate(input().split())])
b = [x for x, y in a]
x = bisect_left(b, m/2)
if x < len(b) and m/2 <= b[x] <= m: print(1, a[x][1]+1); continue
ans, s, n = [], 0, m/2
for i in range(x):
s += a[i][0]
ans.append(a[i][1]+1)
if s >= n: break
else: print(-1); continue
print(len(ans), *ans) | 1,300 | PYTHON3 |
import math
'''
def fact(num):
for j in range(1, num + 1):
fact= fact * j
return fact
def f(num):
l = fact(num) * num
ans = l * (l - num+ 2) // 2
for j in range(1, num):
ans -= fact(num) // factorial(j + 1)
num(j * (num - j) - 1)
return ans
'''
def solution(num):
m = 998244353
p = num
a = 0
for i in range(num, 1, -1):
a = (a + p * (i - 1) * (num - i + 1) - p) % m
p = p* i % m
a = (p* (p - num + 2) - 2 * a) % m
if a & 1: a+= m
return a// 2
x = int(input())
ans = solution(x)
print(ans) | 3,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int n, m;
long long a[100005];
long long S[100005][6], C[6][6];
struct Node {
int l, r;
long long s[6], lazy;
Node *lc, *rc;
} *tree = 0;
void print(Node *root);
void Init() {
for (int i = 1; i <= n; i++) {
long long x = 1;
for (int j = 0; j <= 5; j++) {
S[i][j] = (S[i - 1][j] + x) % MOD;
x = x * i % MOD;
}
}
for (int i = 0; i < 6; i++) {
C[i][0] = C[i][i] = 1;
for (int j = 1; j < 6 - 1; j++) C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
}
}
void down(Node *&root) {
if (!root) return;
if (root->lazy == -1) return;
root->lc->lazy = root->rc->lazy = root->lazy;
for (int i = 0; i <= 5; i++) {
root->lc->s[i] =
(S[root->lc->r][i] - S[root->lc->l - 1][i] + MOD) * root->lazy % MOD;
root->rc->s[i] =
(S[root->rc->r][i] - S[root->rc->l - 1][i] + MOD) * root->lazy % MOD;
}
root->lazy = -1;
}
void update(Node *&root) {
for (int i = 0; i <= 5; i++)
root->s[i] = (root->lc->s[i] + root->rc->s[i]) % MOD;
}
void Build_Tree(Node *&root, int l, int r) {
root = new Node;
root->l = l;
root->r = r;
root->lazy = -1;
root->lc = root->rc = 0;
if (l == r) {
root->s[0] = a[l];
for (int i = 1; i <= 5; i++) root->s[i] = root->s[i - 1] * l % MOD;
return;
}
int mid = (l + r) >> 1;
Build_Tree(root->lc, l, mid);
Build_Tree(root->rc, mid + 1, r);
update(root);
}
void Modify(Node *&root, int l, int r, long long x) {
if (!root) return;
if (root->l > r || root->r < l) return;
if (root->l >= l && root->r <= r) {
root->lazy = x;
for (int i = 0; i <= 5; i++)
root->s[i] = (S[root->r][i] - S[root->l - 1][i] + MOD) * x % MOD;
return;
}
down(root);
Modify(root->lc, l, r, x);
Modify(root->rc, l, r, x);
update(root);
}
long long Query(Node *root, int l, int r, int k) {
if (!root) return 0;
if (root->l > r || root->r < l) return 0;
if (root->l >= l && root->r <= r) {
long long x = 1, ret = 0;
for (int i = 0; i <= k; i++) {
ret += (i % 2 ? -1 : 1) * C[k][i] * (root->s[k - i] * x % MOD) % MOD;
x = x * (l - 1) % MOD;
}
return (ret % MOD + MOD) % MOD;
}
down(root);
return (Query(root->lc, l, r, k) + Query(root->rc, l, r, k)) % MOD;
}
void print(Node *root) {
if (!root) return;
cout << root->l << " " << root->r << " : ";
for (int i = 0; i <= 5; i++) cout << root->s[i] << " ";
cout << endl;
print(root->lc);
print(root->rc);
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
Init();
Build_Tree(tree, 1, n);
for (int i = 1; i <= m; i++) {
char op;
int l, r;
cin >> op >> l >> r;
if (op == '?') {
int k;
cin >> k;
cout << Query(tree, l, r, k) % MOD << endl;
} else {
long long x;
cin >> x;
Modify(tree, l, r, x);
}
}
return 0;
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-') f = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = (x << 1) + (x << 3) + ch - '0';
return x * f;
}
const int N = 82;
int a[N][N];
pair<int, int> nxt[N][N];
double f[N][N];
double dfs(int x, int y) {
if (x == 1 && y == 1) return 0;
if (f[x][y] >= 0) return f[x][y];
f[x][y] = 0;
int sx = x, sy = y;
int k = 0;
for (int i = 1; i <= 6; ++i) {
if (sx == 1 && sy == 1) {
k = 7 - i;
break;
}
int nx = nxt[sx][sy].first;
int ny = nxt[sx][sy].second;
sx = nx;
sy = ny;
if (a[sx][sy])
f[x][y] += min(dfs(sx - a[sx][sy], sy), dfs(sx, sy));
else
f[x][y] += dfs(sx, sy);
}
return f[x][y] = (f[x][y] + 6) / (6.0 - k);
}
int main() {
for (int i = 1; i <= 10; ++i)
for (int j = 1; j <= 10; ++j) a[i][j] = read(), f[i][j] = -1;
for (int i = 1; i <= 10; ++i)
for (int j = 1; j <= 10; ++j)
if (i & 1) {
if (j == 1)
nxt[i][j] = {i - 1, j};
else
nxt[i][j] = {i, j - 1};
} else {
if (j == 10)
nxt[i][j] = {i - 1, j};
else
nxt[i][j] = {i, j + 1};
}
printf("%.8f\n", dfs(10, 1));
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long jawab;
int kmp[300005], jump[300005][26], child[100005], sibling[100005], vertex;
string pattern, kata[100005];
void proses(int node, int indeks) {
if (sibling[node]) proses(sibling[node], indeks);
for (int i = 0; i < kata[node].length(); ++i) {
while ((indeks > -1) && (pattern[indeks + 1] != kata[node][i])) {
indeks = jump[indeks][kata[node][i] - 'a'];
}
if (pattern[indeks + 1] == kata[node][i]) ++indeks;
if (indeks == pattern.length() - 1) {
++jawab;
indeks = kmp[indeks];
}
}
if (child[node]) proses(child[node], indeks);
}
int main() {
scanf("%d", &vertex);
for (int i = 2, sem; i <= vertex; ++i) {
scanf("%d", &sem);
sibling[i] = child[sem];
child[sem] = i;
cin >> kata[i];
}
cin >> pattern;
kmp[0] = -1;
int indeks = -1;
for (int i = 1; i < pattern.length(); ++i) {
while ((indeks > -1) && (pattern[indeks + 1] != pattern[i]))
indeks = kmp[indeks];
if (pattern[indeks + 1] == pattern[i]) ++indeks;
kmp[i] = indeks;
}
for (int i = 0; i < pattern.length(); ++i) {
if (kmp[i] != -1) {
for (int j = 0; j < 26; ++j) jump[i][j] = jump[kmp[i]][j];
jump[i][pattern[kmp[i] + 1] - 'a'] = kmp[i];
} else {
for (int j = 0; j < 26; ++j) jump[i][j] = -1;
}
}
jawab = 0;
proses(child[1], -1);
cout << jawab << endl;
return 0;
}
| 2,000 | CPP |
x = list(map(int,input().split()))
if sum(x)%5==0 and sum(x)!=0:
print(sum(x)//5)
else:
print(-1) | 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 123456;
int n;
int a[2009], b[2009];
int main() {
ios::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
b[a[i]]++;
}
for (int i = 2000; i > 0; --i) {
b[i] += b[i + 1];
}
for (int i = 1; i <= n; i++) {
cout << b[a[i] + 1] + 1 << ' ';
}
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
struct P {
double x, y;
P(double x = 0, double y = 0) : x(x), y(y) {}
P operator+(P p) { return P(x + p.x, y + p.y); }
P operator-(P p) { return P(x - p.x, y - p.y); }
double operator*(P p) { return (x * p.x + y * p.y); }
P operator*(double d) { return P(x * d, y * d); }
P rot(double a) {
return P(x * cos(a) - y * sin(a), x * sin(a) + y * cos(a));
}
} ns[110], vet = P(1, 0);
double ls[110];
int cmp(double a, double b) {
if (fabs(a - b) <= 1e-3) return 0;
return (a < b) ? -1 : 1;
}
int main() {
int n;
scanf("%d", &n);
srand(time(NULL) * 1337);
double ang = 2.0 * pi / n;
if (n <= 4)
puts("No solution");
else
while (1) {
P tmp = vet, ant = vet;
ns[0] = P();
bool ok = 1;
for (int i = 1; i < n - 1; ++i) {
ls[i] = (1.0 + 100.0 * (rand() / double(RAND_MAX)));
for (int j = 1; j < i; ++j)
if (cmp(ls[j], ls[i]) == 0) {
i--;
continue;
}
ns[i] = ns[i - 1] + tmp * ls[i];
tmp = tmp.rot(ang);
if (cmp(ang, acos(tmp * ant))) ok = 0;
ant = tmp;
}
P um = tmp, dois = um.rot(ang), d = ns[0] - ns[n - 2];
double b = (d.y - um.y * d.x / um.x) / (dois.y - um.y * dois.x / um.x);
double a = (d.x - dois.x * b) / um.x;
P veta = vet, vetb = dois;
if (cmp(ang, acos(um * dois)) || cmp(ang, acos(dois * vet))) ok = 0;
if (ok && a >= 1 && a <= 1000 && b >= 1 && b <= 1000) {
ns[n - 1] = ns[n - 2] + um * a;
for (int i = 0; i < n; ++i) printf("%lf %lf\n", ns[i].x, ns[i].y);
break;
}
}
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const int64_t MOD = 1000000007;
const int INF = 0x3F3F3F3F;
const long long LINF = 4611686018427387903;
int64_t gcd(int64_t a, int64_t b) {
if (b == 0) return a;
a %= b;
return gcd(b, a);
}
template <typename _Size>
inline _Size __lg(_Size __n) {
_Size __k;
for (__k = 0; __n != 0; __n >>= 1) ++__k;
return __k - 1;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int64_t n;
cin >> n;
int64_t ans = 0;
while (n % 5 == 0) n /= 5, n *= 4, ans++;
while (n % 3 == 0) n /= 3, n *= 2, ans++;
while (n % 2 == 0) n /= 2, ans++;
if (n != 1)
cout << -1 << "\n";
else
cout << ans << "\n";
}
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int n;
cin >> n;
char ch;
int idx;
cin >> ch >> idx;
int loc = 0, roc = 0;
int dfc[200005];
char where[200005];
dfc[idx] = 0;
for (int i = 1; i < n; i++) {
cin >> ch >> idx;
if (ch == 'L') {
dfc[idx] = ++loc;
where[idx] = ch;
}
if (ch == 'R') {
dfc[idx] = ++roc;
where[idx] = ch;
}
if (ch == '?') {
if (where[idx] == 'L')
cout << min(loc - dfc[idx], dfc[idx] + roc);
else
cout << min(roc - dfc[idx], dfc[idx] + loc);
cout << '\n';
}
}
return 0;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[6] = {4, 8, 15, 16, 23, 42};
int b[6];
int main() {
for (int i = 1; i <= 4; i++) {
printf("? %d %d\n", i, i + 1);
fflush(stdout);
scanf("%d", &b[i]);
}
do {
if (a[0] * a[1] == b[1] && a[1] * a[2] == b[2])
if (a[2] * a[3] == b[3] && a[3] * a[4] == b[4]) break;
} while (next_permutation(a, a + 6));
printf("! ");
for (int i = 0; i < 6; i++) printf("%d ", a[i]);
printf("\n");
return 0;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
unsigned long long int ans = 0;
int gcd(unsigned long long int a, unsigned long long int b) {
if ((a == 0) || (b == 0))
return 0;
else if (a > b) {
ans += a / b;
gcd(b, a % b);
} else
gcd(b, a);
return 0;
}
int main() {
unsigned long long int a, b;
cin >> a >> b;
if ((a == 1) && (b == 1)) {
cout << 1;
return 0;
} else if ((a == 1) && (a != b)) {
cout << b;
return 0;
} else if ((b == 1) && (a != b)) {
cout << a;
return 0;
} else
gcd(a, b);
cout << ans;
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000007;
const int max_size = 100001;
int parent[max_size];
int Size[max_size];
int root(int x) {
while (x != parent[x]) {
parent[x] = parent[parent[x]];
x = parent[x];
}
return x;
}
void sunion(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx != ry) {
if (Size[rx] > Size[ry]) {
parent[ry] = parent[rx];
Size[rx] += Size[ry];
} else {
parent[rx] = parent[ry];
Size[ry] += Size[rx];
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--) {
int n, m;
cin >> n >> m;
int p[n + 1];
for (int i = 1; i <= n; i++) cin >> p[i];
int l, r, x;
while (m--) {
cin >> l >> r >> x;
int v = p[x];
int cl = 0;
for (int i = l; i <= r; i++) {
if (p[i] < v) cl++;
}
if (l + cl != x)
cout << "No\n";
else
cout << "Yes\n";
}
}
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
long long n, used[N], len[N];
double ans, ver[N];
vector<long long int> d[N];
void dfs(int v, int ln, double f) {
used[v] = 1;
ver[v] = f;
len[v] = ln;
if (v != 1 && d[v].size() == 1) ans += ver[v] * len[v];
for (int i = 0; i < d[v].size(); ++i) {
int to = d[v][i];
if (used[to] == 1) continue;
double q = d[v].size();
if (v != 1)
dfs(to, ln + 1, f / (q - 1));
else
dfs(to, ln + 1, f / (q));
}
}
int main() {
cin >> n;
for (int i = 1; i < n; ++i) {
int a, b;
cin >> a >> b;
d[a].push_back(b);
d[b].push_back(a);
}
dfs(1, 0, 1);
printf("%.6f", ans);
return 0;
}
| 1,500 | CPP |
import math
def answer(n):
if n==1:
return 1
elif n==2:
return 2
if n%2!=0:
return n*(n-1)*(n-2)
elif n<=6:
return n*(n-1)*(n-2)//2
else:
flag=0
if n%3==0 or (n-1)%3==0:
flag=1
x=(n-1)*(n-2)*(n-3)
for i in range(n-3,0,-1):
if flag:
if i%3!=0 and i%2!=0:
return max(x,i*(n)*(n-1))
else:
if i%2!=0:
return max(x,i*n*(n-1))
n=int(input())
print(answer(n)) | 1,600 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[100010], b[100010], f[100010];
int solve(int m) {
int i, k, l, r, mid;
a[1] = b[1], k = 1;
for (i = 2; i <= m; i++) {
if (a[k] <= b[i])
a[++k] = b[i];
else {
l = 1;
r = k;
while (l <= r) {
mid = (l + r) / 2;
if (a[mid] <= b[i])
l = mid + 1;
else
r = mid - 1;
}
a[l] = b[i];
}
}
return k;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i, j, t, n, m, k, mx = 0, ct = 0;
cin >> n >> t;
for (i = 1; i < n + 1; i++) {
cin >> b[i];
f[b[i]]++;
if (f[b[i]] >= f[mx]) {
mx = b[i];
}
}
k = 0;
for (i = 1; i < n && i < t; i++) {
k += n;
for (j = 1; j <= n; j++) {
b[k + j] = b[j];
}
}
m = n * min(n, t);
int ans = solve(m);
long long fin = (long long)ans;
fin = fin + (long long)(t - min(t, n)) * (long long)(f[mx]);
cout << fin << endl;
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
long long k;
cin >> k;
string s;
cin >> s;
long long n = s.size();
long long a[26] = {0};
for (long long i = 0; i < s.size(); i++) {
a[s[i] - 'a']++;
}
for (long long i = 0; i < 26; i++) {
if (a[i] % k != 0) {
cout << -1;
return 0;
}
}
string ans = "";
for (long long i = 0; i < 26; i++) {
for (long long j = 0; j < a[i] / k; j++) {
ans += (i + 'a');
}
}
string p = ans;
for (long long i = 0; i < k - 1; i++) {
ans += p;
}
cout << ans;
return 0;
}
| 1,000 | CPP |
t=int(input())
a=[]
for i in range(t):
a.append(input())
for i in a:
print(len(max(i.split('R')))+1) | 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void gcd_ex(long long a, long long b, long long& x, long long& y) {
if (b == 0) {
x = 1, y = 0;
return;
}
long long x1, y1;
gcd_ex(b, a % b, y1, x1);
x = x1;
y = y1 - (a / b) * x1;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long sgn(long long a) {
if (a >= 0) return 1;
return -1;
}
int main() {
long long a, b, c;
cin >> a >> b >> c;
c = -c;
if (a == 0) {
if (c % b != 0) {
cout << -1;
return 0;
}
cout << 0 << ' ' << c / b;
return 0;
}
if (b == 0) {
if (c % a != 0) {
cout << -1;
return 0;
}
cout << c / a << ' ' << 0;
return 0;
}
long long x, y;
long long g = gcd(((a < 0) ? (-a) : (a)), ((b < 0) ? (-b) : (b)));
if (c % g != 0) {
cout << -1;
return 0;
}
a /= g, b /= g, c /= g;
gcd_ex(((a < 0) ? (-a) : (a)), ((b < 0) ? (-b) : (b)), x, y);
cout << x * c * sgn(a) << ' ' << y * c * sgn(b);
return 0;
}
| 1,800 | CPP |
Subsets and Splits