solution stringlengths 10 983k | difficulty int64 0 25 | language stringclasses 2
values |
|---|---|---|
from sys import stdout
a,b,n=map(int,input().split())
c=0
co=0
temp=str(a)
f=0
for i in range(0,10):
if int(temp+str(i))%b==0:
temp=temp+str(i)
f=1
break
if f==0:
print(-1)
else:
for i in range(n-1):
temp+="0"
stdout.write(temp) | 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int maxn = 35, maxx = 55;
int dp[maxn][maxn][maxn * maxn];
int main() {
for (int i = 0; i < maxn; i++) {
for (int j = 0; j < maxn; j++)
for (int o = 0; o < maxx; o++) dp[i][j][o] = 1000000000;
}
f... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
static void print(const unordered_map<int, pair<int, int>> &a) {
for (auto &e : a) {
cout << "id: " << e.first << " " << e.second.first << ", "
<< e.second.second << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
u... | 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int d[1000005];
struct stree {
long long sum;
long long mx;
} sts[300002 * 4];
long long a[1000005];
void pushup(int root) {
sts[root].sum = sts[root << 1].sum + sts[root << 1 | 1].sum;
sts[root].mx = max(sts[root << 1].mx, sts[root << 1 | 1].mx);
}
void init() {
... | 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100, M = 100;
int main() {
int n, m;
cin >> n >> m;
int sl[N][M], sr[N][M], bounds[M] = {0};
for (int i = 0; i < n; ++i) {
int k, l, r;
cin >> k;
for (int p = 0; p < k; ++p) {
cin >> l >> r;
for (int j = l - 1; j < r; ++j) {
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, x, days, extra, start, ans;
cin >> n >> x;
long long a[2 * n], c[2 * n], d[2 * n];
for (i = 0; i < n; i++) cin >> a[i], a[n + i] = a[i];
c[0] = a[0];
d[0] = (a[0] * (a[0] + 1)) / 2;
for (i = 1; i < 2 * n; i++)
c[i] = c[i - 1] +... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
long long int s = 0;
for (int i = 0; i < n / 2; i++) {
long long int x = pow((arr[i] + arr[n - 1 - i]), 2);
s += x;
}
cout << s << endl;
retu... | 9 | CPP |
word_order = []
sorted_word_order = []
for i in range(2):
word_order.append(input().lower())
sorted_word_order = sorted(word_order)
if word_order[0] != word_order[1]:
if word_order[0] == sorted_word_order[0]:
print(-1)
else:
print(1)
else:
print(0)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
printf("%d %d\n", (n + 1) / 36, (n + 1) % 36 / 3);
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a, b, w, x, c;
bool ok(long long t) {
long long l = c - t;
long long num = max(0ll, (1ll * t * x - b + w - 1) / w);
long long r = a - num;
return l <= r;
}
int main() {
cin >> a >> b >> w >> x >> c;
long long l = 0, r = 1e15 + 5;
while (l < r) {
long l... | 8 | CPP |
#include <iostream>
#include <string>
using namespace std;
int main(){
string x, y, z;
while(cin >> x >> y >> z){
int xi = 0, yi = 0, zi = 0;
char ch = y[yi++];
string res;
while(zi < z.size()){
if(ch == z[zi]){
++zi;
ch = x[xi++];
}
else{
res += ch;
ch = y[yi++];
}
}
res += ... | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x1, x2;
scanf("%d %d %d", &n, &x1, &x2);
int tt, tp;
scanf("%d %d", &tt, &tp);
int idx, pt;
scanf("%d %d", &idx, &pt);
int pp = (x1 < x2) ? 1 : -1;
int flag = false;
for (int i = 1; i <= 1000007; i++) {
if (x1 == idx && pp == pt) fl... | 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
vector<pair<int, int> > g[maxn];
pair<int, int> pre[maxn];
int c[maxn], rt;
long long w[maxn];
bool vis[maxn], id[maxn];
bool dfs(int u, int fa, bool tp) {
if (vis[u]) {
if (tp != id[u] && !rt) {
rt = u;
return true;
} else
... | 10 | CPP |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#define curr(P, i) P[(i) % P.size()]
#define next(P, i) P[(i+1) % P.size()]
#define prev(P, i) P[(i+P.size()-1) % P.size()]
#define Next(a,i) ((i)+1)%(a).size()
#define Curr(a,i) (i)%(a).size()
#define Prev(a, i) (i+a.size()-1) % a.size()
using n... | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long x = 2 * k + 1;
long long y = n / x, r = n % x;
if (r != 0)
y++;
else
r = 2 * k;
cout << y << endl;
for (long long i = 1 + r / 2; i <= n; i += x) cout << i << " ";
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n],dist[n],cnt[n];
for(int i=0;i<n;i++){
cin>>a[i];
dist[i] = a[i] - (i+1);
}
sort(dist,dist + n);
int p = (dist[n/2]+dist[(n-1)/2])/2;
long long ans = 0;
for(int i=0;i<n;i++){
// ans += abs(a[i] - (p + (i+1)));
ans += abs(di... | 0 | CPP |
from math import gcd
n=int(input())
arr=list(map(int,input().split()))
gcds=[0 for i in range(n)]
gcds[n-1]=arr[n-1]
for i in range(n-2,-1,-1):
gcds[i]=gcd(gcds[i+1],arr[i])
curr=0
for i in range(n-1):
curr=gcd(curr,(arr[i]*gcds[i+1])//gcd(arr[i],gcds[i+1]))
print(curr)
| 7 | PYTHON3 |
#include <iostream>
#include <vector>
using namespace std;
#define MAX 1299710
int main (){
bool pr[MAX];
int a;
vector <int> prl;
for(int i=0;i<MAX;i++) pr[i]=true;
pr[0]=false;
pr[1]=false;
for(int i=0;i*i<MAX;i++){
if(pr[i]){
for(int j=i*i;j<=MAX;j=j+i){
pr[j]=false;
}
}
}
for(int i=0,j=0;i<... | 0 | CPP |
#include<stdio.h>
int main()
{
int n,m;
scanf("%d%d",&n,&m);
if(n%m)
printf("1\n");
else
printf("0\n");
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a, d = 1;
cin >> n >> m;
a = n / 2;
for (int i = 0; i < m; i++) {
cout << a << " " << a + d << "\n";
a--;
d += 2;
if (n % 2 == 0 && (d == n / 2 || d == n / 2 + 1)) d++;
}
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int Inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
struct Point {
int x, y;
Point() {}
Point(int x, int y) : x(x), y(y) {}
Point inline operator-(const Point &p) const {
return Point(x - p.x, y - p.y);
}
long long inline operator*(const ... | 12 | CPP |
#include <bits/stdc++.h>
const int MAXN = (int)5e5 + 10;
const int MODN = (int)1e9 + 7;
int inf = 0x3f3f3f3f;
using namespace std;
char str[20];
int a[11];
int main() {
while (scanf("%s", str) != EOF) {
memset(a, 0, sizeof(a));
for (int i = 0; i < strlen(str); i++) {
int index = str[i] - '0';
a[in... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long a, b;
string s;
long long dx = 0, dy = 0, nx = 0, ny = 0;
bool isOk() {
long long k1, k2;
if (dx == 0) {
if (nx != a) return false;
if (dy == 0) {
if (ny == b) return true;
return false;
}
k2 = (b - ny) / dy;
if (k2 * dy == b - ... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = 1;
ans += (n * (n + 1) / 2) * 6;
cout << ans << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int a[1000 + 1][1000 + 1];
int origr[1000 + 1], origc[1000 + 1];
void swap(int *a, int *b) {
int t = *a;
*a = *b;
*b = t;
}
int main() {
int i, j;
int n, m, k;
int x, y;
char c;
scanf("%d %d %d", &n, &m, &k);
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) scanf("%d", &a... | 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:255000000")
bool firstout = 1;
template <class T>
T &minn(T &a, T b) {
if (b < a) a = b;
return a;
}
template <class T>
T &maxx(T &a, T b) {
if (a < b) a = b;
return a;
}
int &madd(int &a, int b) {
a += b;
if (a >= 1000000007) a -... | 7 | CPP |
t = int(input())
dva = [2**i for i in range(31)]
for i in range(t):
n = int(input())
a = dva[n] + sum(dva[1:n//2])
b = sum(dva[n//2:n])
print(abs(a-b))
| 7 | PYTHON3 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <complex>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;... | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int mat[200][200];
int main() {
int n, k, ma = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n / k; ++i)
for (int j = 1; j <= k; ++j) scanf("%d", &mat[i][j]);
for (int j = 1; j <= k; ++j) {
int nr1 = 0, nr2 = 0;
for (int i = 1; i <= n / k; ++i)
if... | 7 | CPP |
n=int(input())
for _ in range(0,n):
x=input()
ans=""
ans+=x[0]
ans+=x[1]
for i in range(3,len(x),2):
ans+=x[i]
print(ans)
| 7 | PYTHON3 |
import math
from sys import stdin
users = []
traffic = 0
for line in stdin:
#line = input()
if line[0] == '+':
users.append(line[1:])
if line[0] == '-':
users.remove(line[1:])
if line == '\n':
break
loc = None
for i in range(0, len(line)):
if line[i] == ':':
... | 7 | PYTHON3 |
def magnets(l):
groups=1
for i in range(0,len(l)-1):
if l[i][1]==l[i+1][0]:
groups+=1
else:
groups+=0
return groups
n=int(input())
l=[]
for i in range(0,n):
a=input()
l.append(a)
print(magnets(l)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
string s, t;
cin >> s >> t;
for (long long i = 0; i < n; i++) {
if (s[i] > t[i]) {
cout << -1 << endl;
return;
}
if (s[i] == t[i]) {
s[i] = t[i] = 'z';
}
}
if (s == t) {
cout << 0 << e... | 7 | CPP |
n = int(input())
a = []
for i in range(n):
a.append(input())
a.sort(key=len)
i = 0
b = []
while True and i < n - 1:
if a[i+1].count(a[i]) < 1:
print('NO')
exit()
i += 1
print('YES')
for i in a:
print(i) | 8 | PYTHON3 |
'''
A. Team Olympiad
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good a... | 7 | PYTHON3 |
n,a,b,c=map(int, input().split())
arr = [-1e9]*8085
arr[0] = 0
parts = [a,b,c]
for i in range(1,n+1):
list_prob = [(arr[i-j]+1) for j in parts if arr[i-j]>=0]
if list_prob:
max_dp = max(list_prob)
arr[i] = max_dp
print(arr[n] if arr[n]>=0 else 0) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a, sum, t, n;
int main() {
scanf("%d", &t);
while (t--) {
int ans = 0;
sum = 0;
scanf("%d", &n);
while (n--) {
scanf("%d", &a);
if (a == 0) ++ans, a = 1;
sum += a;
}
if (sum == 0) ++ans;
printf("%d\n", ans);
}
return... | 7 | CPP |
#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int a[100001];
int main() {
int n,q,k,cnt=0;
cin>>n;
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
cin>>q;
while(q--){
scanf("%d",&k);
if(*lower_bound(a,a+n,k)==k) cnt++;
}
cout<<cnt<<endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int N = 1e7 + 7;
long long d[N], n, a, b;
const long long inf = 2e16;
int main() {
cin >> n >> a >> b;
d[0] = 0;
d[1] = a;
for (int i = 2; i <= n; i++)
if (i & 1)
d[i] = min(d[i - 1] + a, d[(i +... | 11 | CPP |
from collections import defaultdict
t = int(input())
for ii in range(t):
n = int(input())
a = list(reversed(list(map(int, input().split(' ')))))
m = defaultdict(int)
res = 0
for i in range(len(a)):
s = str(bin(a[i])[2:])
res += m[len(s)]
m[len(s)] += 1
print(... | 8 | PYTHON3 |
#include <bits/stdc++.h>
const int INF = 1e9 + 1;
const double PI = acos(-1.0);
const double EPS = 1e-9;
using namespace std;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(os... | 8 | CPP |
#include "bits/stdc++.h"
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1286
using namespace std;
#define ll long long
int n, m, k;
void dfs(int now, int Sum,map<int,int>& M) {
if (now == n) {
M[max(Sum - k, 1)]++;
return;
}
else {
for (int i = 1; i <= m;i++) {
dfs(now + 1, Sum + i, M);
}
}
... | 0 | CPP |
#include <stdio.h>
#include <string.h>
#include <vector>
int n, b[200005], dp[200005], cnt, M[200005 << 2], q, x, y;
std::vector<int> v[200005];
void modify(int cur, int l, int r, int pos, int num) {
M[cur] = std::min(M[cur], num);
if (l == r) return;
int mid = l + r >> 1;
if (pos <= mid) modify(cur << 1, l, mid, p... | 0 | CPP |
for _ in range(int(input())):
n=input()
leni=len(n)
p = n[0]
ans = int(p)-1
if leni==4:
fans=ans*10+10
print(fans)
elif leni==3:
fans=ans*10+6
print(fans)
elif leni==2:
fans=ans*10+3
print(fans)
else:
fans=ans*10+1
print(fan... | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200;
const int INF = 0x3f3f3f3f;
struct UF_union {
int par[MAXN], siz[MAXN], n;
void init(int a) {
n = a;
for (int i = 0; i < MAXN; i++) {
par[i] = i;
siz[i] = 1;
}
}
int find(int x) {
if (par[x] == x) return x;
retur... | 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec) is >> v;
return is;
}
template <typename T>
void dout(string name, T arg) {
cerr << arg << endl;
}
template <typename T1, typename... T2>
void dout(string names, T1 arg, T2...... | 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("AAtest.in.txt");
string s, s1, s2;
long long n;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
cin >> s;
for (int(i) = (0); ((i)) < ((s.size())); ((i))++)
if (s[i] != 'a') n++;
if (n % 2) {
cout << ":(";
r... | 8 | CPP |
inf =10**100
n = int(input())
cost=list(map(int,input().split()))
s=[]
for i in range(n):
u=input()
s.append(u)
r=[i[::-1] for i in s]
dp=[[ inf, inf] for j in range(n)]
dp[0] = [0,cost[0]]
for i in range(1,n):
if s[i] >= s[i-1]:
dp[i][0] = min(dp[i][0], dp[i-1][0])
if s[i] >... | 9 | PYTHON3 |
n,k = list(map(int,input().split()))
for i in range(n):
for j in range(n):
if j == i:
print(k,end=' ')
else:
print(0,end=' ')
print() | 7 | PYTHON3 |
n = input()
n = str(n.count('4') + n.count('7'))
if n.count('4') + n.count('7') == len(n):
print('YES')
else:
print('NO') | 7 | PYTHON3 |
def main():
n = int(input())
problems = [int(i) for i in input().split()]
all_problems = sum(problems)
now_problems = problems[0]
i = 0
while now_problems < (all_problems + 1) // 2:
i += 1
now_problems += problems[i]
print(i + 1)
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
int a[10], ans;
int cnt(int x) {
int ret = 0;
while (x) {
ret += a[x % 10];
x /= 10;
}
return ret != 0;
}
int main() {
int n;
while (scanf("%d", &n) != EOF) {
ans = 0;
memset(a, 0, sizeof(a));
for (int i = n; i; i /= 10) a[i % 10] = 1;
for (int i = 1; i * i <... | 8 | CPP |
num = int(input())
if num%2==0:
print(8, num-8)
else:
print(9, num-9)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long i, j, cnt = 0;
string s;
long long ar[105];
long long dp[105][105][105];
long long dfs(int l, int r, int k) {
int i;
if (l > r) return 0;
if (l == r) return ar[k];
if (~dp[l][r][k]) return dp[l][r][k];
dp[l][r][k] = dfs(l, r - 1, 0) + ar[k];
for (i = l... | 11 | CPP |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <sstream>
using namespace std;
typedef unsigned int ui;
int main(){
int Q;
double c[7];
for(int i = 0 ; i < 7 ; i++){
c[i] = pow(0.5,i+1);
}
cin >> Q;
while(Q--){
ui s;
scanf("%x" ,&s);
ui integer = (s & 0x7fffffff) >>... | 0 | CPP |
def do():
conv = dict()
conv["0"] = "0"
conv["1"] = "1"
conv["2"] = "5"
conv["3"] = "xxxxxx"
conv["4"] = "xxxxxx"
conv["5"] = "2"
conv["6"] = "xxxxxx"
conv["7"] = "xxxxxx"
conv["8"] = "8"
conv["9"] = "xxxxxx"
def isitok(curtime):
curtime %= maxtime
h, m... | 8 | PYTHON3 |
#include <bits/stdc++.h>
const int kN = 61 + 5;
int m, a[kN];
bool f[kN][kN][kN * (kN - 1) / 2];
bool ok(int i, int j, int k) {
if (i < 0 || i > m || j < 0 || j > 61 || k < 0 || k > 61 * 30) return false;
if ((j - 1) * j / 2 > k) return false;
return true;
}
int main() {
scanf("%d", &m);
for (int i = 1; i <= ... | 10 | CPP |
n=int(input())
count=0
for i in range(n):
i=input()
if i=="Tetrahedron":
count+=4
if i=="Cube":
count+=6
if i =="Octahedron" :
count+=8
if i=="Dodecahedron":
count+=12
if i=="Icosahedron":
count+=20
print(count)
| 7 | PYTHON3 |
a=str(input())
c=[]
b=[int(i) for i in a.split()]
for i in b:
if i not in c:
c.append(i)
print(len(b)-len(c)) | 7 | PYTHON3 |
// this code is moriizumi's code
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace... | 0 | CPP |
#include <bits/stdc++.h>
const int N = 1e6 + 50;
int n, m, w[N], c[N], s[N];
bool vis[N];
std::vector<std::pair<int, int> > G[N];
template <int T>
struct fast_io {
char p[T], q[T], *p1, *p2, *q1, *q2;
fast_io() {
p1 = p2 = p;
q1 = q, q2 = q + T;
}
inline char gc() {
return p1 == p2 && (p2 = (p1 = p)... | 21 | CPP |
first = input().split(' ')
day = int(input())
tmp = []
tmp.append(first[0] + ' ' + first[1])
while day:
second = input().split(' ')
if (first[0] == second[0]):
tmp.append(first[1] + ' ' + second[1])
else:
tmp.append(first[0] + ' ' + second[1])
first = tmp[-1].split(' ')
day -= 1
for i in tmp:
print(i) | 7 | PYTHON3 |
n = int(input())
for i in range(n):
st = input()
length = len(st)-2
if (length <= 8):
print(st)
else:
print(st[0] + str(length) + st[length + 1]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int P = 107;
pair<unsigned long long, int> operator+(
const pair<unsigned long long, int> &first, const char &second) {
return make_pair(first.first * P + second, first.second + 1);
}
pair<unsigned long long, int> S[205], H[2005];
char A[1000005], B[205];
int an... | 11 | CPP |
n=int(input())
a=0
b=0
c=0
for i in range(n):
x,y,z=[int(i) for i in input().split()]
a+=x
b+=y
c+=z
if a==0 and b==0 and c==0:
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
inp = input().split("+")
lis = [int(i) for i in inp]
lis.sort()
print(lis[0],end='',sep='')
for i in range(1,len(lis)):
print("+",lis[i],end='',sep='')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dig[11], ans, len;
void f(long long n) {
len = 0;
while (n) {
dig[++len] = n % 10;
n /= 10;
}
}
void judge(int x) {
bool f = 0;
while (x) {
int xx = x % 10;
for (int i = 1; i <= len; i++) {
if (xx == dig[i]) {
ans++;
f = 1... | 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[123];
int n;
bool check(int u) { return n <= (u * u + 1) / 2; }
int main() {
while (~scanf("%d", &n)) {
if (n == 1)
cout << 1 << endl;
else if (n == 2)
cout << 3 << endl;
else if (n == 3)
cout << 5 << endl;
else {
for (int i... | 7 | CPP |
from decimal import *
getcontext().prec = 30
T = int(input())
o = []
for i in range(T):
h, c, t = input().split()
h = int(h)
c = int(c)
t = int(t)
s = (h + c) / 2
if t >= h:
o.append(1)
elif t <= s:
o.append(2)
else:
i = (h - t) / (2 * t - (h + c))
#p... | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dir1[8][2] = {1, 2, 2, 1, 2, -1, 1, -2, -1, 2, -2, 1, -1, -2, -2, -1};
int dir2[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
int dir3[8][2] = {1, 0, 0, 1, -1, 0, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1};
int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); }
bool Isleap(int year... | 10 | CPP |
z,zz=input,lambda:list(map(int,z().split()))
zzz=lambda:[int(i) for i in stdin.readline().split()]
szz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())
from string import *
from collections import *
from queue import *
from sys import *
from collections import *
from math import *
from heapq import *
... | 8 | PYTHON3 |
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <queue>
using namespace std;
const int maxn=185+5;
int n,m;
char s[maxn][maxn];
int dp[maxn][maxn][maxn];
int main() {
scanf("%d%d", &n, &m);
for (int i=1;i<=n;++i)
scanf("%s",s[i]+1);
for (in... | 0 | CPP |
n=int(input())
testStr=input()
ones=testStr.count("1")
zeroes=testStr.count("0")
print(abs(ones-zeroes))
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N; int M; cin >> N >> M;
//
int tim=1900*M+100*(N-M);
cout << tim*(1<<M) << endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::val... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
vector<long long> v;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
int n, i, j, maxx = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
maxx = max(maxx, a[i]);
}
long long l;
... | 10 | CPP |
n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans1 = a[0]
for i in range(0, n):
if ans1 % a[i] != 0:
print(ans1, a[i])
break
else:
if i and a[i] == a[i - 1]:
print(ans1, a[i])
break | 8 | PYTHON3 |
a=input().lower()
b=input().lower()
for i in range(len(a)):
if a[i] < b[i]:
print(-1)
break
elif a[i] > b[i]:
print(1)
break
else:
if i==len(a)-1:
print(0)
break
else:
continue
| 7 | PYTHON3 |
n = int(input())
a = [int(a_i) for a_i in input().split()]
max_ones = 0
for i in range(n):
for j in range(i, n):
temp = sum(a) - a[i:j+1].count(1) + a[i:j+1].count(0)
if max_ones < temp:
max_ones = temp
print(max_ones) | 7 | PYTHON3 |
stations = int(input())
ab = [list(map(int,input().split())) for _ in range(stations)]
diff_array = [ab[i][1]-ab[i][0] for i in range(len(ab))]
max_cap = 0
running_cap = 0
for i in range(len(diff_array)):
running_cap += diff_array[i]
if running_cap > max_cap:
max_cap = running_cap
print(max_cap)
| 7 | PYTHON3 |
# cook your dish here
t=int(input())
for i in range(t):
a,b,c=map(int,input().split())
if(a==b and b==c):
print(0)
else:
x=abs(a-b)+abs(b-c)+abs(c-a)-4
print(max(0,x)) | 7 | PYTHON3 |
n = int(input())
for i in range(n):
x = [bin(int(i))[2:] for i in input().split()]
l = x[0]
r = x[1]
if(len(l) != len(r)):
if( '1' * len(r) == r):
print(int(r,2))
else:
print(int('1'*(len(r) - 1), 2))
else:
j = 0
while(j < len(r) and l[j] == r[j]):
j+=1
#print(l,j)
if( '1' * len(r[j:]) == r[... | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.rbegin(), a.rend());
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = 0; j < n; j++) {
sum += ... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const double EPS = 1e-6;
const int MAX_N = 305;
char s[MAX_N][MAX_N];
bool vist[MAX_N][MAX_N];
int n;
bool Solve() {
char x = s[0][0], o = s[0][1];
if (x == o) {
return false;
}
int l = 0, r = n - 1;
for (int i = 0; i < n; i++) {
i... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 251234;
bool path;
int n, k, m, dep[maxn], f[maxn], lim;
vector<int> G[maxn], back[maxn], leaves;
void dfs(int u, int p) {
bool lv = true;
f[u] = p;
dep[u] = dep[p] + 1;
if (dep[u] >= lim) {
path = true;
puts("PATH");
printf("%d\n", dep[... | 11 | CPP |
#include <stdio.h>
#include <string.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n, m, f[64][64];
void rec(int x, int y) {
if (f[x][y] == 0) return ;
f[x][y] = 0;
rep (i, 3) rep (j, 3) rec(x+i-1, y+j-1);
}
int main() {
for (;;) {
scanf("%d%d", &m, &n);
if (n == 0) retu... | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, pair<int, int> > > edges;
vector<pair<int, int> > g[100005];
long long D[100005], P[100005];
bool vis[100005];
int p[100005];
int root(int a) { return p[a] == a ? a : (p[a] = root(p[a])); }
void merge(int a, int b) {
a = root(a), b = root(b);
if (... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
vector<long long> adj[100001];
long long vis[100001] = {0};
map<pair<long long, long long>, long long> flag;
long long cycles = 0;
void dfs(long long node, long long par) {
vis[node] = 1;
for (auto child : adj[node]) {
... | 10 | CPP |
from fractions import gcd
for _ in range(int(input())):
n, m = map(int, input().split())
if gcd(n, m) == 1:
print('Finite')
else:
print('Infinite')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> vs;
long long int n, m, b, k, x1[200010], x2[200010], z, c, s = 0, ans, ab, ac, d,
a;
string j, t;
char e;
int main() {
cin >> n;
for (int r = 0; r < n; r++) {
cin >> x1[r];
... | 8 | CPP |
import re
print(len(re.search('A\w*Z',input()).group(0))) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
set<int> rows[26], cols[26];
char board[2010][2010];
int ovr, ovc;
array<int, 4> ans[26];
void solve() {
int n, m, big = -1;
cin >> n >> m;
for (int i = 0; i < 26; i++) {
rows[i].clear();
cols[i].clear();
}
for (int i = 1; i <= n; i++) {
for (int j = 1... | 11 | CPP |
def wieght(w):
if w%2==0 and w!=2 and w!=1:
return "YES"
else:
return"NO"
w=int(input())
print(wieght(w)) | 7 | PYTHON3 |
t = int(input())
for y in range(t):
s = input()
ct = 0
n = dict()
e = dict()
w = dict()
ss = dict()
x,y = 0,0
for i in s:
dx,dy = x,y
if i == 'N':
dx += 1
if (x,y) in ss or (dx,dy) in n:
ct += 1
else:
ct += 5
n[(dx,dy)] = 1
if i == 'E':
dy += 1
if (x,y) in w or (dx,dy) in e:
... | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string S;
cin>>S;
int L=0;
int D=0;
for(int i=0;i<N;i++){
if(S.at(i)=='('){
L++;
}
else L--;
D=min(D,L);
}
for(int i=D;i<0;i++){
cout<<"(";
}
cout<<S;
for(int i=0;i<L-D;i++){
cout<<")";
}
... | 0 | CPP |
class Tree:
def __init__(self):
self.root = None
def insert(self, key):
z = Node(key)
y = None # x?????????????´????????????°
# z???parent???????´?
x = self.root
while x:
y = x
if z.key < x.key:
x = x.left
else... | 0 | PYTHON3 |
import sys
input = sys.stdin.readline
t = int(input())
for i in range(t):
x,y,a,b = map(int,input().split())
ans = 0
if x != a and y != b:
ans += 2
ans += abs(x-a) + abs(y-b)
print(ans) | 7 | PYTHON3 |
n=int(input())
for i in range(n):
srcstr=input()
resstr=""
if len(srcstr)>10:
resstr+=srcstr[0]
resstr+=str(len(srcstr)-2)
resstr+=srcstr[len(srcstr)-1]
else:
resstr=srcstr
print(resstr)
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.