solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,abm,mmx,tune=native")
using namespace std;
long long gcd(long long i, long long j) {
if (j == 0)
return i;
else
return gcd(j, i % j);
}
long long lcm(long long i, long long j) { return i * j / gcd(i, j); }
long long max(long long i, long long j) { return (i > j) ? i : j; }
long long min(long long i, long long j) { return (i < j) ? i : j; }
long long numofdivs(long long n) {
long long ans = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n / i == i)
ans++;
else
ans += 2;
}
}
return ans;
}
bool prime(long long i) {
if (i < 2)
return false;
else {
for (int j = 2; j <= i / 2; j++) {
if (i % j == 0) return false;
}
}
return true;
}
bool primewithexc(long long i, long long k) {
if (i < 2)
return false;
else {
for (long long j = 2; j <= i / 2; j++) {
if (j == k) continue;
if (i % j == 0) return false;
}
}
return true;
}
bool Tprime(long long i) {
if (sqrt(i) == (long long)sqrt(i))
if (numofdivs(i) == 3)
return true;
else
return false;
else
return false;
}
bool positive_negative(int n, int x) {
if (n < 0 && x > 0)
return true;
else if (n > 0 && x < 0)
return true;
else
return false;
}
void binary(vector<int>& v, int n) {
int i;
for (i = 0; n > 0; i++) {
v[i] = n % 2;
n = n / 2;
}
}
long long sumofdigs(long long n) {
long long sum = 0;
long long remainder = 0;
while (n > 0) {
remainder = n % 10;
sum += remainder;
n /= 10;
}
return sum;
}
int lcsnums(int x[], int y[], int n, int m) {
int lcssuf[100 + 1][100 + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
if (i == 0 || j == 0)
lcssuf[i][j] = 0;
else if (x[i - 1] == y[j - 1])
lcssuf[i][j] = lcssuf[i - 1][j - 1] + 1;
else
lcssuf[i][j] = max(lcssuf[i - 1][j], lcssuf[i][j - 1]);
}
}
return lcssuf[n][m];
}
int lcs(string x, string y, int n, int m) {
int lcssuf[100 + 1][100 + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
if (i == 0 || j == 0)
lcssuf[i][j] = 0;
else if (x[i - 1] == y[j - 1])
lcssuf[i][j] = lcssuf[i - 1][j - 1] + 1;
else
lcssuf[i][j] = max(lcssuf[i - 1][j], lcssuf[i][j - 1]);
}
}
return lcssuf[n][m];
}
int lcssub(string x, string y, int n, int m) {
int lcssuf[100 + 1][100 + 1];
int answer = 0;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
if (i == 0 || j == 0)
lcssuf[i][j] = 0;
else if (x[i - 1] == x[j - 1]) {
lcssuf[i][j] = lcssuf[i - 1][j - 1] + 1;
answer = max(answer, lcssuf[i][j]);
} else
lcssuf[i][j] = 0;
}
}
return answer;
}
string mul(string s, int k) {
string res = "";
while (k--) res += s;
return res;
};
int fact(int n) {
int sum = 1;
for (int i = 1; i <= n; i++) sum *= i;
return sum;
}
void solve() {
long long n, x, d, counter = 0;
char g;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> g >> d;
if (g == '+')
x += d;
else if (x - d < 0)
counter++;
else
x -= d;
}
cout << x << " " << counter << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
| 7 | CPP |
x = 0
no_of_lines = int(input())
words = []
while x < no_of_lines:
x += 1
word = str(input())
if word:
words.append(word)
else:
break
for i in words:
if len(i) <= 10:
print(i)
else:
print(i[0] + str(len(i) - 2) + i[-1])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
const int maxn = 100010;
const int BLOCK = 400;
int jmp[maxn];
int end[maxn];
int cnt[maxn];
int a[maxn];
int n;
void go(int now) {
int ans = 0;
while (jmp[now] != maxn) {
ans += cnt[now];
now = jmp[now];
}
ans += cnt[now];
printf("%d %d\n", end[now], ans);
}
void update(int i, int j) {
if (j > n) {
end[i] = i;
jmp[i] = maxn;
cnt[i] = 1;
} else {
end[i] = end[j];
if (i / BLOCK == j / BLOCK) {
jmp[i] = jmp[j];
cnt[i] = cnt[j] + 1;
} else {
jmp[i] = j;
cnt[i] = 1;
}
}
}
int main() {
int m, op, x, y;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = n; i >= 1; i--) {
update(i, i + a[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &op);
if (!op) {
scanf("%d%d", &x, &y);
a[x] = y;
update(x, x + a[x]);
int start = x / BLOCK * BLOCK;
for (int i = x - 1; i >= start; i--) {
update(i, i + a[i]);
}
} else {
scanf("%d", &x);
go(x);
}
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct func {
string name;
vector<string> p;
};
void solve() {
int n, m, k;
func fu[1010];
string s, s1, s2;
cin >> n;
getline(cin, s);
for (int i = 0; i < n; i++) {
getline(cin, s);
int f = 0;
string cnt;
for (int j = 0; j < s.size(); j++) {
if (isalpha(s[j]) || isdigit(s[j]))
cnt += s[j];
else {
if (cnt != "") {
if (f == 1) fu[i].name = cnt;
if (f == 2) {
f--;
fu[i].p.push_back(cnt);
}
cnt = "";
f++;
}
}
}
}
cin >> m;
getline(cin, s);
map<string, string> mm;
for (int i = 0; i < m; i++) {
cin >> s1 >> s2;
mm[s2] = s1;
}
cin >> k;
getline(cin, s);
for (int i = 0; i < k; i++) {
getline(cin, s);
int f = 1, ans = 0;
string cnt;
func a;
for (int j = 0; j < s.size(); j++) {
if (isalpha(s[j]) || isdigit(s[j]))
cnt += s[j];
else {
if (cnt != "") {
if (f == 1) a.name = cnt;
if (f == 2) {
f--;
a.p.push_back(cnt);
}
cnt = "";
f++;
}
}
}
for (int j = 0; j < n; j++) {
if (a.name != fu[j].name) continue;
if (a.p.size() != fu[j].p.size()) continue;
bool suc = 1;
for (int x = 0; x < a.p.size(); x++)
if (fu[j].p[x] != "T" && mm[a.p[x]] != fu[j].p[x]) suc = 0;
if (suc) ans++;
}
cout << ans << endl;
}
}
int main() {
int T;
T = 1;
while (T--) solve();
return 0;
}
| 10 | CPP |
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
int main(){
ll a,b,c,d;
cin>>a>>b>>c>>d;
cout<<max(a*c,max(b*c,max(a*d,b*d)))<<endl;
} | 0 | CPP |
N = int(input())
print((N//2)*(N-N//2)) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
const int M = 1e5 + 5;
const int mod = 1e9 + 7;
const double pi = 2 * acos(0);
int m, d;
string s;
int dp[N][N][2];
int add(int a, int b) { return (a + b) % mod; }
int solve(int idx, int md, bool flag) {
if (idx == (int)s.size()) return !md;
int &ans = dp[idx][md][flag];
if (~ans) return ans;
ans = 0;
if (idx & 1) {
if (flag || d <= s[idx] - '0')
ans = add(ans,
solve(idx + 1, (md * 10 + d) % m, (d < s[idx] - '0' | flag)));
} else {
for (int i = 0; i <= 9; i++) {
if (i == d || (!flag && i > s[idx] - '0')) continue;
if (!i && !idx) continue;
ans = add(ans,
solve(idx + 1, (md * 10 + i) % m, (flag | i < s[idx] - '0')));
}
}
return ans;
}
bool tmam(string ss) {
int md = 0;
for (int i = 0; i < (int)ss.size(); i++) {
if (i % 2 && (ss[i] - '0') != d) return false;
if (i % 2 == 0 && (ss[i] - '0') == d) return false;
md = (md * 10 + (ss[i] - '0')) % m;
}
return !md;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> m >> d;
string a, b;
cin >> a >> b;
memset(dp, -1, sizeof dp);
s = b;
int ans = solve(0, 0, 0);
s = a;
memset(dp, -1, sizeof dp);
ans = ((ans - solve(0, 0, 0) + tmam(a)) % mod + mod) % mod;
cout << ans;
return 0;
}
| 10 | CPP |
while True:
try:
L=list(map(int,input().split()))
x=L[0]*L[4]-L[3]*L[1]
y=L[2]*L[4]-L[5]*L[1]
z=y/x+0
w=(L[2]-L[0]*z)/L[1]+0
print(f"{z:.3f} {w:.3f}")
except EOFError:
break
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int64_t N, K;
int64_t a[205];
int64_t DP[3][205][1005];
signed main() {
cin >> N >> K;
for (int64_t i = 1; i <= N; i++) cin >> a[i];
sort(a + 1, a + 1 + N);
a[0] = a[1];
DP[0][0][0] = 1;
for (int64_t iter = 1; iter <= N; iter++) {
int64_t prev = (iter - 1) % 3;
int64_t i = iter % 3;
for (int64_t j = 0; j <= N; j++) {
for (int64_t k = 0; k <= K; k++) {
DP[i][j][k] = 0;
}
}
for (int64_t j = 0; j <= N; j++) {
for (int64_t k = 0; k <= K; k++) {
int64_t v = DP[prev][j][k];
int64_t new_imba = k + j * (a[iter] - a[iter - 1]);
if (new_imba > K) continue;
DP[i][j][new_imba] += v;
DP[i][j][new_imba] += j * v;
DP[i][j][new_imba] %= 1000000007L;
if (j != N) {
DP[i][j + 1][new_imba] += v;
DP[i][j + 1][new_imba] %= 1000000007L;
}
if (j != 0) {
DP[i][j - 1][new_imba] += j * v;
DP[i][j - 1][new_imba] %= 1000000007L;
}
}
}
}
int64_t answer = 0;
for (int64_t i = 0; i <= K; i++) {
answer += DP[N % 3][0][i];
answer %= 1000000007L;
}
cout << answer << endl;
}
| 12 | CPP |
#from collections import Counter,defaultdict,deque
#from heapq import *
#from itertools import *
#from operator import itemgetter
#from itertools import count, islice
#from functools import reduce
#alph = 'abcdefghijklmnopqrstuvwxyz'
#dirs = [[1,0],[0,1],[-1,0],[0,-1]]
#from math import factorial as fact
#a,b = [int(x) for x in input().split()]
#sarr = [x for x in input().strip().split()]
#import math
#from math import *
import sys
input=sys.stdin.readline
#sys.setrecursionlimit(2**30)
#MOD = 10**9+7
def solve():
n = int(input())
print(3*(n+1)+1)
def draw(x,y):
for i in range(2):
for j in range(2):
if not (i==j==1):
sys.stdout.write(str(x+i)+' '+str(y+j)+'\n')
for i in range(0,n+1):
draw(i,i)
print(n+1,n+1)
tt = 1#int(input())
for test in range(tt):
solve()
#
| 9 | PYTHON3 |
#include <bits/stdc++.h>
const int maxn = 2e5 + 2;
const long long mod = 1e9 + 7, inf = 1e18;
using namespace std;
int steps[maxn], steps1[maxn];
vector<int> adj[maxn];
bool seen[maxn], seen1[maxn];
void dfs(int u, int s) {
if (seen[u]) return;
seen[u] = 1;
steps[u] = s;
for (auto v : adj[u]) dfs(v, s + 1);
}
void dfs1(int u, int s) {
if (seen1[u]) return;
seen1[u] = 1;
steps1[u] = s;
for (auto v : adj[u]) dfs1(v, s + 1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
for (int i = 1; i <= n - 1; i++) {
int u, v;
cin >> u >> v;
adj[u].emplace_back(v);
adj[v].emplace_back(u);
}
dfs(1, 0);
dfs1(x, 0);
int ans = 0;
for (int i = 1; i <= n; i++) {
if (steps1[i] < steps[i]) ans = max(ans, (steps[i] << 1));
}
cout << max(ans, 2) << '\n';
return 0;
}
| 9 | CPP |
n = int(input())
arr = [0]
for _ in range(n):
inp = int(input())
new = []
for o in arr:
new.extend([o + inp, o - inp])
arr = new[:]
print("YES" if any(c%360==0 for c in arr) else "NO") | 8 | PYTHON3 |
T = int(input())
for _ in range(T):
x, y, n = map(int, input().strip().split())
res = n - n % x + y
if res > n:
print(res - x)
else:
print(res) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 105, MOD = 100000000;
int n, m, a, b, dp[MAX][MAX][2];
int F(int i, int j, int f) {
if (i < 0 || j < 0) return 0;
if (dp[i][j][f] != -1) return dp[i][j][f];
int ans = 0;
if (f == 0)
for (int k = 1; k <= a; k++) ans = (ans + F(i - k, j, f ^ 1)) % MOD;
if (f == 1)
for (int k = 1; k <= b; k++) ans = (ans + F(i, j - k, f ^ 1)) % MOD;
return dp[i][j][f] = ans;
}
int main() {
scanf("%d%d%d%d", &n, &m, &a, &b);
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= a; i++) dp[i][0][0] = 1;
for (int i = 1; i <= b; i++) dp[0][i][1] = 1;
int sol = (F(n, m, 0) + F(n, m, 1)) % MOD;
printf("%d\n", sol);
return 0;
}
| 10 | CPP |
# I'm always doing things I can't do. That's how I get to do them. Pablo Picasso
def gcd(a:int,b:int) -> int:
return a if b==0 else gcd(b,a%b)
for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
a.sort(reverse=True)
i=0
cm = a[0]
while i<n-1:
j=i+1
m=i+1
cm = gcd(cm,a[i])
gm=1
while j<n:
g = gcd(cm,a[j])
if g>gm:
gm=g
m=j
j+=1
if m!=(i+1):
a[i+1],a[m]=a[m],a[i+1]
i+=1
print(*a)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
const int MAX_N=2e5;
typedef long long ll;
const ll INF=1e16;
int N;
ll A[MAX_N];
int main(){
cin>>N;
ll all=0;
REP(i,N){
cin>>A[i];
all+=A[i];
}
int s=1,t=2,u=3;
ll b,c,d,e,ans=INF;
b=A[0];
c=A[1];
d=A[2];
e=all-b-c-d;
while(t<N-1){
while(b<c){
b+=A[s];
c-=A[s];
s++;
}
b-=A[s-1];
c+=A[s-1];
s--;
ll w,x,y,z;
w=max(b,c-A[s]);
x=b+c-w;
while(d<e){
d+=A[u];
e-=A[u];
u++;
}
d-=A[u-1];
e+=A[u-1];
u--;
y=max(d,e-A[u]);
z=d+e-y;
ans=min(ans,max(x,z)-min(w,y));
c+=A[t];
d-=A[t];
t++;
}
cout<<ans<<endl;
return 0;
}
| 0 | CPP |
import sys
from collections import deque
input = sys.stdin.readline
def main():
while True:
w, h = map(int, input().split())
if w == 0:
break
board = [list(map(int, input().split())) for i in range(h)]
tmp = list(map(int, input().split()))
p_cost = [tmp[2], tmp[3], tmp[0], tmp[1]]
INF = int(1e5)
mincost = [[[INF] * 4 for i in range(w)] for j in range(h)]
q = deque()
q.append((0, 0, 0, 3))
while len(q) > 0:
x, y, cost, from_ = q.popleft()
# γ³γΉγγͺγγ§ι²γγζΉε
if board[y][x] == 0:# η΄ι²: (from_ + 2) % 4
no_cost = (from_ + 2) % 4
elif board[y][x] == 1:# ε³ζ: (from_ + 3) % 4
no_cost = (from_ + 3) % 4
elif board[y][x] == 2:# εθ»’: from_
no_cost = from_
elif board[y][x] == 3:# ε·¦ζ: (from_ + 1) % 4
no_cost = (from_ + 1) % 4
else:# εζ’: γͺγ
no_cost = -1
for i, (nx, ny) in enumerate([(x, y-1), (x+1, y), (x, y+1), (x-1, y)]):
if i == no_cost:
next_cost = cost
else:
next_cost = cost + p_cost[(i+4-from_)%4]
if mincost[y][x][i] > next_cost:# ζε°ε€γζ΄ζ°
mincost[y][x][i] = next_cost
# γγΉγεε¨γγε ΄εγ―qγ«ε
₯γγ
if 0 <= nx and nx < w and 0 <= ny and ny < h:
q.append((nx, ny, next_cost, (i + 2) % 4))
# print(mincost)
print(min(mincost[h-2][w-1][2], mincost[h-1][w-2][1]))
if __name__ == "__main__":
main()
| 0 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int dp[1005][1005];
int main()
{
int h,w;
char a[1005][1005];
cin>>h>>w;
dp[1][1]=1;
for(int i=1; i<=h; i++){
for(int j=1; j<=w; j++){
cin>>a[i][j];
}
}
for(int i=1; i<=h; i++){
for(int j=1; j<=w; j++){
if(a[i][j]!='#'){
dp[i][j]+=(dp[i-1][j]%MOD+dp[i][j-1]%MOD)%MOD;
}
}
}
cout<<dp[h][w]<<'\n';
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long a[n], x = 0, i, ans = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
x += a[i];
}
if (x == 0)
cout << "NO\n";
else {
cout << "YES\n";
if (x > 0) {
sort(a, a + n, greater<int>());
for (i = 0; i < n; i++) cout << a[i] << " ";
cout << endl;
} else {
sort(a, a + n);
for (i = 0; i < n; i++) cout << a[i] << " ";
cout << endl;
}
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
unsigned int gcd(unsigned int a, unsigned int b) {
return (b > 0) ? gcd(b, a % b) : a;
}
int a[200000];
int main() {
int n;
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
int g;
g = gcd(a[0], a[1]);
for (i = 2; i < n; i++) g = gcd(g, a[i]);
for (i = 0; i < n; i++) a[i] /= g;
for (i = 0; i < n; i++) {
while (!(a[i] % 2)) a[i] /= 2;
while (!(a[i] % 3)) a[i] /= 3;
if (a[i] != 1) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1, ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
inline void write(int x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10) write(x / 10);
putchar(x % 10 + '0');
}
inline void writeln(int x) {
write(x);
puts("");
}
const double eps = 1e-14;
double a, vm, L, d, limit;
double v0, V, T, ans, x1, x2;
inline void init() {
a = read();
vm = read();
L = read();
d = read();
limit = read();
}
inline double sqr(double x) { return x * x; }
inline void sol(double A, double B, double C) {
double delta = sqr(B) - 4 * A * C;
x1 = 1.0 * (-B - sqrt(delta)) / (2 * A),
x2 = 1.0 * (-B + sqrt(delta)) / (2 * A);
}
inline double dis(double v0, double t, double a) {
return v0 * t + 0.5 * a * sqr(t);
}
inline bool check(double t) {
if (t < 0) return 0;
double v = v0 + 1.0 * a * t;
if (v > vm) return 0;
double delta = v - limit, s2 = dis(v0, t, a);
if (s2 > d) return 0;
if (delta <= 0) {
T = t + (d - s2) / v;
V = v;
return 1;
}
double t1 = 1.0 * delta / a, s = dis(v0, t, a) + dis(v, t1, -a);
if (s > d) return 0;
T = t1 + t + 1.0 * (d - s) / v;
V = limit;
return 1;
}
inline void solve() {
double l = 0, r = 10000000;
v0 = 0;
while (l + eps < r) {
double mid = 1.0 * (l + r) / 2;
if (check(mid)) {
l = mid;
} else {
r = mid;
}
}
ans += T;
T = 0;
v0 = V;
d = L - d;
limit = vm;
check(0);
l = 0, r = 10000000;
while (l + eps < r) {
double mid = 1.0 * (l + r) / 2;
if (check(mid)) {
l = mid;
} else {
r = mid;
}
}
ans += T;
printf("%.10lf\n", ans);
}
int main() {
init();
solve();
return 0;
}
| 10 | CPP |
n,h=map(int ,input().split())
a=list(map(int ,input().split()))
count=0
for i in a:
if i>h:
count=count+2
else:
count=count+1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, k, pos, apos, p1, p2, o1, o2, a[505];
void q() {
printf("?");
for (int i = 1; i <= k; ++i) printf(" %d", a[i]);
printf("\n");
fflush(stdout);
scanf("%d", &pos);
if (pos == -1) exit(0);
scanf("%d", &apos);
}
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= k; ++i) a[i] = i;
q();
p1 = apos;
o1 = 1;
for (int i = 1; i <= k; ++i) {
a[i] = k + 1;
q();
if (apos == p1)
++o1;
else {
p2 = apos;
++o2;
}
a[i] = i;
}
if (p1 > p2)
printf("! %d\n", o1);
else
printf("! %d\n", o2);
fflush(stdout);
return 0;
}
| 10 | CPP |
from collections import defaultdict
N = int(input())
A = list(map(int, input().split()))
dp = defaultdict(lambda: -float('inf'))
dp[(0, 0, 0)] = 0
for i, a in enumerate(A, start=1):
j = i // 2
for x in range(j - 1, j + 2):
dp[(i, x, 0)] = max(dp[(i - 1, x, 0)], dp[(i - 1, x, 1)])
dp[(i, x, 1)] = dp[(i - 1, x - 1, 0)] + a
print(max(dp[(N, N // 2, 0)], dp[(N, N // 2, 1)])) | 0 | PYTHON3 |
def circle(n,a,x,b,y):
i = 0
while i < n:
# print(f'a: {a},b: {b},i: {i}')
if a == b:
return 'YES'
if ((a == x or b == y) and (a!=b)):
return 'NO'
if a==n:
a = 0
if b ==1:
b = n+1
a+=1
b-=1
i+=1
return "NO"
n,a,x,b,y = list(map(int,input().split()))
print(circle(n,a,x,b,y))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long n, m, k, s;
vector<long long> a, b;
vector<pair<long long, long long> > cheapd, cheapf;
vector<pair<pair<long long, long long>, pair<long long, long long> > > ans;
vector<pair<long long, long long> > dol, fun;
bool check(long long day) {
long long tot = 0;
int doli = 0, funi = 0;
for (int i = 0; i < k; i++) {
if (doli < dol.size() && funi < fun.size()) {
if (cheapd[day].first * dol[doli].first <
cheapf[day].first * fun[funi].first) {
tot += cheapd[day].first * dol[doli].first;
doli++;
} else {
tot += cheapf[day].first * fun[funi].first;
funi++;
}
} else if (doli < dol.size()) {
tot += cheapd[day].first * dol[doli].first;
doli++;
} else {
tot += cheapf[day].first * fun[funi].first;
funi++;
}
}
return (tot <= s);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> k >> s;
a.resize(n);
b.resize(n);
cheapd.resize(n);
cheapf.resize(n);
ans.resize(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
cheapd[i] = make_pair(a[i], i);
if (i) cheapd[i] = min(cheapd[i], cheapd[i - 1]);
}
for (int i = 0; i < n; i++) {
cin >> b[i];
cheapf[i] = make_pair(b[i], i);
if (i) cheapf[i] = min(cheapf[i], cheapf[i - 1]);
}
for (int i = 0; i < m; i++) {
long long t, c;
cin >> t >> c;
if (t == 1)
dol.push_back(make_pair(c, i));
else
fun.push_back(make_pair(c, i));
}
sort((dol).begin(), (dol).end());
sort((fun).begin(), (fun).end());
if (!check(n - 1)) {
cout << -1;
return 0;
}
int l = 0, r = n - 1;
while (r - l > 1) {
int m = ((l + r) >> 1);
if (check(m))
r = m;
else
l = m;
}
int ansday = (check(l) ? l : r);
cout << ansday + 1 << endl;
int doli = 0, funi = 0;
for (int i = 0; i < k; i++) {
if (doli < dol.size() && funi < fun.size()) {
if (cheapd[ansday].first * dol[doli].first <
cheapf[ansday].first * fun[funi].first) {
cout << dol[doli].second + 1 << ' ' << cheapd[ansday].second + 1
<< endl;
doli++;
} else {
cout << fun[funi].second + 1 << ' ' << cheapf[ansday].second + 1
<< endl;
funi++;
}
} else if (doli < dol.size()) {
cout << dol[doli].second + 1 << ' ' << cheapd[ansday].second + 1 << endl;
doli++;
} else {
cout << fun[funi].second + 1 << ' ' << cheapf[ansday].second + 1 << endl;
funi++;
}
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dp[1050][1050] = {0};
int main() {
long long a, b, c, n, m, t;
string s, ss;
map<char, int> mp;
mp['A'] = true;
mp['H'] = true;
mp['I'] = true;
mp['M'] = true;
mp['O'] = true;
mp['T'] = true;
mp['U'] = true;
mp['V'] = true;
mp['W'] = true;
mp['X'] = true;
mp['Y'] = true;
cin >> s;
ss = s;
reverse(s.begin(), s.end());
for (int i = 0; i < s.size(); i++) {
if (mp[s[i]] != true) {
cout << "NO";
return 0;
}
}
if (ss == s)
cout << "YES";
else
cout << "NO";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string vow = "aeiou";
int month[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1};
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const long double pie = 3.1415926535897932384626;
const long long mod = 1e9 + 7;
const int N = 2e5 + 2;
int n;
vector<int> g[N];
set<pair<int, int> > ed;
void read() {
cin >> n;
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
ed.insert({a, b});
}
}
int dis[N];
int red[N];
bool vis[N];
int tot_red = 0;
char find_color_of_edge(int a, int b) {
pair<int, int> temp;
temp.first = a;
temp.second = b;
if (ed.count(temp))
return 'G';
else
return 'R';
}
void dfs(int node) {
vis[node] = 1;
for (auto i : g[node]) {
if (vis[i]) continue;
;
dis[i] = dis[node] + 1;
red[i] = red[node];
char col = find_color_of_edge(node, i);
if (col == 'R') red[i]++, tot_red++;
dfs(i);
}
}
int ans[N];
void solve(int test_case) {
read();
dfs(0);
for (int i = 0; i < n; i++) {
int green_in_path = dis[i] - red[i];
int red_in_subtree = tot_red - red[i];
int invert = green_in_path + red_in_subtree;
ans[i] = invert;
}
int minn = 1e7;
int cnt = 0;
for (int i = 0; i < n; i++) minn = min(minn, ans[i]);
cout << minn;
cout << "\n";
for (int i = 0; i < n; i++)
if (ans[i] == minn) cout << i + 1 << " ";
cout << "\n";
;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
for (int i = 0; i < t; i++) solve(i);
return 0;
}
| 10 | CPP |
t=int(input())
for _ in range(t):
a,b=map(int,input().split())
A=list(map(int,input().split()))
P=list(map(int,input().split()))
P.append(a+2)
B=A.copy()
B.sort()
P.sort()
a1=P[0]
b1=P[0]
C=[]
NA=[]
PA=[]
for i in range(b):
if(P[i+1]==P[i]+1):
b1=P[i+1]
else:
C.append([a1-1,b1+1])
a1=P[i+1]
b1=P[i+1]
for i in range(len(C)):
NA=A[C[i][0]:C[i][1]]
NA.sort()
A[C[i][0]:C[i][1]]=NA
#print(A,C)
if(A==B):
print("YES")
else:
print("NO")
| 8 | PYTHON3 |
t = int(input())
while t:
a,b = map(int,input().split())
minn = min(2*a,2*b,a+b)
a,b = sorted([a,b])
if minn**2>=b**2:
print(minn**2)
else:
print(b**2)
t-=1 | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
long long b[maxn], num[maxn << 2];
struct node {
long long x, y;
node(long long x = 0, long long y = 0) : x(x), y(y) {}
bool operator<(const node& g) const {
if (y != g.y) return y > g.y;
return x < g.x;
}
} a[maxn];
void update(int k, int lef, int rig, int pos) {
if (lef == rig) {
num[k] = 1;
return;
}
int mid = (lef + rig) >> 1;
if (pos <= mid)
update(k << 1, lef, mid, pos);
else
update(k << 1 | 1, mid + 1, rig, pos);
num[k] = num[k << 1] + num[k << 1 | 1];
}
long long query(int k, int lef, int rig, int l, int r) {
if (l > r) return 0;
if (l <= lef && r >= rig) {
return num[k];
}
int mid = (lef + rig) >> 1;
long long ans = 0;
if (l <= mid) ans += query(k << 1, lef, mid, l, r);
if (r > mid) ans += query(k << 1 | 1, mid + 1, rig, l, r);
return ans;
}
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &a[i].x, &a[i].y);
b[i] = a[i].x;
}
sort(b + 1, b + n + 1);
int sz = unique(b + 1, b + n + 1) - b;
for (int i = 1; i <= n; i++) a[i].x = lower_bound(b + 1, b + sz, a[i].x) - b;
sort(a + 1, a + n + 1);
vector<int> g;
long long ans = 0;
for (int i = 1; i <= n; i++) {
update(1, 1, sz, a[i].x);
g.push_back(i);
if (i == n || a[i + 1].y != a[i].y) {
for (int j = 0; j < g.size(); j++) {
int u = g[j];
int lb = 1;
if (j > 0) lb = a[g[j - 1]].x + 1;
int ub = a[u].x - 1;
long long t = query(1, 1, sz, lb, ub);
t++;
lb = a[u].x + 1;
ub = sz - 1;
long long t1 = query(1, 1, sz, lb, ub);
t1++;
ans += t * t1;
}
g.clear();
}
}
printf("%lld\n", ans);
return 0;
}
| 12 | CPP |
#include <iostream>
using namespace std;
int main()
{
long n,cnt=0;
cin >> n;
long a[n+1];
for(int i=0;i<n;i++){
cin >> a[i];
while(a[i]%2==0){
a[i] /= 2;
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x) {
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
inline void write(int x) {
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
const int N = 50005, M = 50005, V = N * 7, E = M * 17;
int cntv;
int He[V], Ne[E], To[E], _k;
inline void init() {
for (int i = 1; i <= cntv; ++i) He[i] = 0;
_k = 0;
}
inline void add(int x, int y) {
++_k;
To[_k] = y, Ne[_k] = He[x], He[x] = _k;
}
int Time, dfn[V], low[V], vis[V], stk[V], top, scc[V], scc_cnt;
inline void dfs(int x) {
dfn[x] = low[x] = ++Time;
stk[++top] = x;
vis[x] = 1;
for (int y, p = He[x]; p; p = Ne[p]) {
y = To[p];
if (!dfn[y])
dfs(y), low[x] = min(low[x], low[y]);
else if (vis[y])
low[x] = min(low[x], dfn[y]);
}
if (low[x] == dfn[x]) {
scc[x] = ++scc_cnt;
vis[x] = 0;
while (stk[top] ^ x) scc[stk[top]] = scc[x], vis[stk[top]] = 0, --top;
--top;
}
}
inline void tarjan() {
int i;
Time = 0, top = 0, scc_cnt = 0;
for (i = 1; i <= cntv; ++i) dfn[i] = low[i] = vis[i] = scc[i] = stk[i] = 0;
for (i = 1; i <= cntv; ++i)
if (!dfn[i]) dfs(i);
}
int n, m, ex[M], ey[M], ec[M], et[M];
int eex[E], eey[E], le;
vector<int> G[N];
inline void build(int w) {
static int p[N], lenp, i, q[N], x, y;
lenp = G[w].size();
for (i = 1; i <= lenp; ++i) p[i] = G[w][i - 1];
for (i = 2; i <= lenp; ++i) {
q[i] = ++cntv;
++le;
eex[le] = q[i], eey[le] = p[i];
}
for (i = 2; i < lenp; ++i) {
++le;
eex[le] = q[i], eey[le] = q[i + 1];
}
for (i = 1; i < lenp; ++i) {
++le;
eex[le] = p[i] + m, eey[le] = q[i + 1];
}
for (i = 1; i < lenp; ++i) {
q[i] = ++cntv;
++le;
eex[le] = q[i], eey[le] = p[i];
}
for (i = 2; i < lenp; ++i) {
++le;
eex[le] = q[i], eey[le] = q[i - 1];
}
for (i = 2; i <= lenp; ++i) {
++le;
eex[le] = p[i] + m, eey[le] = q[i - 1];
}
}
inline void work() {
int i, x, y;
map<pair<int, int>, int> M;
M.clear();
cntv = m << 1;
for (i = 1; i <= m; ++i) {
G[ex[i]].push_back(i), G[ey[i]].push_back(i);
if (M.count(make_pair(ec[i], ex[i]))) {
x = M[make_pair(ec[i], ex[i])], y = i;
++le;
eex[le] = x, eey[le] = y + m;
++le;
eex[le] = x + m, eey[le] = y;
++le;
eex[le] = y, eey[le] = x + m;
++le;
eex[le] = y + m, eey[le] = x;
} else
M[make_pair(ec[i], ex[i])] = i;
if (M.count(make_pair(ec[i], ey[i]))) {
x = M[make_pair(ec[i], ey[i])], y = i;
++le;
eex[le] = x, eey[le] = y + m;
++le;
eex[le] = x + m, eey[le] = y;
++le;
eex[le] = y, eey[le] = x + m;
++le;
eex[le] = y + m, eey[le] = x;
} else
M[make_pair(ec[i], ey[i])] = i;
}
for (i = 1; i <= n; ++i)
if (G[i].size() > 1) build(i);
}
inline bool check(int v, int tp) {
int i;
init();
for (i = 1; i <= le; ++i) add(eex[i], eey[i]);
for (i = 1; i <= m; ++i)
if (et[i] > v) add(i + m, i);
tarjan();
for (i = 1; i <= m; ++i)
if (scc[i] == scc[i + m]) return 0;
if (!tp) return 1;
int cnt = 0;
for (i = 1; i <= m; ++i) cnt += scc[i + m] < scc[i];
write(v), putchar(' '), write(cnt), putchar('\n');
for (i = 1; i <= m; ++i)
if (scc[i + m] < scc[i]) write(i), putchar((--cnt) ? ' ' : '\n');
return 1;
}
namespace sub0 {
int v[M], lv, cnt[N];
vector<int> G[N];
inline bool chk() {
int i, j, id, x, y;
for (i = 1; i <= m; ++i) v[i] = ec[i];
sort(v + 1, v + m + 1), lv = unique(v + 1, v + m + 1) - v - 1;
for (i = 1; i <= m; ++i)
ec[i] = lower_bound(v + 1, v + lv + 1, ec[i]) - v, G[ec[i]].push_back(i);
for (i = 1; i <= m; ++i)
if (G[i].size()) {
for (j = 0; j < G[i].size(); ++j) {
id = G[i][j], x = ex[id], y = ey[id], ++cnt[x], ++cnt[y];
if (cnt[x] > 2) return 0;
if (cnt[y] > 2) return 0;
}
for (j = 0; j < G[i].size(); ++j)
id = G[i][j], x = ex[id], y = ey[id], --cnt[x], --cnt[y];
}
return 1;
}
} // namespace sub0
int main() {
int i;
read(n), read(m);
for (i = 1; i <= m; ++i) read(ex[i]), read(ey[i]), read(ec[i]), read(et[i]);
if (!sub0::chk()) {
puts("No");
return 0;
}
work();
int L = 0, R = 1e9 + 7, Mid, Ans = R;
while (L <= R) {
Mid = L + R >> 1;
if (check(Mid, 0))
Ans = Mid, R = Mid - 1;
else
L = Mid + 1;
}
if (Ans > 1000000000)
puts("No");
else
puts("Yes"), check(Ans, 1);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int dydis = 1e3 + 10;
int n, m;
vector<int> gr[dydis];
int dist[dydis][dydis] = {};
const int inf = 1e9;
int s, b, k, h;
vector<pair<int, pair<int, int> > > ships;
vector<pair<int, int> > bases;
vector<int> nGr[dydis + dydis + 100];
int dst[dydis + dydis + 100];
int pairL[dydis + dydis + dydis + 100], pairR[dydis + dydis + 100];
int nul = dydis * 2 - 1;
bool dfs(int v) {
if (v == nul) return true;
for (auto x : nGr[v]) {
if (dst[pairR[x]] == dst[v] + 1) {
if (dfs(pairR[x])) {
pairR[x] = v;
pairL[v] = x;
return true;
}
}
}
dst[v] = inf;
return false;
}
bool bfs(vector<int> &kaire) {
queue<int> q;
for (auto x : kaire) {
if (pairL[x] == nul) {
dst[x] = 0;
q.push(x);
} else {
dst[x] = inf;
}
}
dst[nul] = inf;
while (!q.empty()) {
int v = q.front();
q.pop();
if (dst[v] >= dst[nul]) continue;
for (auto x : nGr[v]) {
if (dst[pairR[x]] == inf) {
dst[pairR[x]] = dst[v] + 1;
q.push(pairR[x]);
}
}
}
return dst[nul] != inf;
}
int matchink(vector<int> &kaire, vector<int> &desine) {
int ans = 0;
for (auto x : kaire) {
pairL[x] = nul;
}
for (auto x : desine) {
pairR[x] = nul;
}
int ret = 0;
while (bfs(kaire)) {
for (auto x : kaire) {
if (pairL[x] == nul) {
if (dfs(x)) ret++;
}
}
}
return ret;
}
int main() {
for (int i = 0; i < dydis; i++) {
for (int j = 0; j < dydis; j++) {
dist[i][j] = inf;
}
}
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
gr[a].push_back(b);
gr[b].push_back(a);
dist[a][b] = dist[b][a] = 1;
}
for (int i = 0; i < n; i++) dist[i][i] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int h = 0; h < n; h++) {
dist[j][h] = min(dist[j][h], dist[j][i] + dist[i][h]);
}
}
}
cin >> s >> b >> k >> h;
for (int i = 0; i < s; i++) {
int a, b, c;
cin >> a >> b >> c;
a--;
ships.push_back({a, {b, c}});
}
for (int i = 0; i < b; i++) {
int a, b;
cin >> a >> b;
a--;
bases.push_back({a, b});
}
for (int i = 0; i < s; i++) {
for (int j = 0; j < b; j++) {
if (dist[ships[i].first][bases[j].first] <= ships[i].second.second &&
ships[i].second.first >= bases[j].second) {
nGr[i].push_back(s + j);
nGr[s + j].push_back(i);
}
}
}
vector<int> kaire, desine;
for (int i = 0; i < s; i++) kaire.push_back(i);
for (int i = s; i < s + b; i++) desine.push_back(i);
long long mt = matchink(kaire, desine);
long long ans = mt * k;
for (int i = 0; i <= s; i++) {
long long sitas = 0;
if (i <= (s - mt))
sitas = 1ll * i * h + mt * k;
else
sitas = 1ll * (mt - (i - (s - mt))) * k + (1ll * i * h);
ans = min(ans, sitas);
}
cout << ans;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
float a1, b1, c1, a2, b2, c2;
cin >> a1 >> b1 >> c1 >> a2 >> b2 >> c2;
if (!b1 && !b2) {
if (!a1 && !a2 && c1 && c2) {
cout << 0 << endl;
return 0;
}
if ((!a1 && c1) || (!a1 && c2)) {
cout << 0 << endl;
return 0;
}
if ((!c1 && !c2) || (!a1 && !a2) || c1 / a1 == c2 / a2) {
cout << -1 << endl;
return 0;
} else {
cout << 0 << endl;
return 0;
}
} else if ((!b1 && !a1 && !c1) || (!b2 && !a2 && !c2)) {
cout << -1 << endl;
return 0;
} else if ((!b1 && !a1) || (!b2 && !a2)) {
cout << 0 << endl;
return 0;
} else if (!b1 || !b2) {
cout << 1 << endl;
return 0;
}
if (a1 / b1 == a2 / b2 && c1 / b1 == c2 / b2)
cout << -1 << endl;
else if (a1 / b1 == a2 / b2)
cout << 0 << endl;
else
cout << 1 << endl;
return 0;
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
for(int i=0;i<s.size();i++)cout << 'x';
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int ChromeConstant = (0x100);
const int MaxN = (int)(1e5) + ChromeConstant;
const double eps = 1e-9;
int f(vector<int> &p) {
int res = 0;
for (int i = 0; i < p.size(); ++i) {
int mn = INT_MAX;
for (int j = i; j < p.size(); ++j) {
mn = min(mn, p[j]);
res += mn;
}
}
return res;
}
bool cmp(pair<int, vector<int> > &a, pair<int, vector<int> > &b) {
if (a.first == b.first) return a.second < b.second;
return a.first > b.first;
}
int main() {
srand(time(0));
vector<pair<int, vector<int> > > v;
vector<int> x;
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) x.push_back(i + 1);
do {
v.push_back(make_pair(f(x), x));
} while (next_permutation(x.begin(), x.end()));
sort(v.begin(), v.end(), cmp);
for (int i = 0; i < n; ++i) cout << v[m - 1].second[i] << " ";
return 0;
}
| 8 | CPP |
input()
r=0
for x in sorted(map(int,input().split())):r+=x>r
print(r) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-10;
struct vec {
long double x, y;
vec() { x = y = 0; }
vec(long double x, long double y) {
this->x = x;
this->y = y;
}
vec operator-(const vec other) const { return vec(x - other.x, y - other.y); }
vec operator+(const vec other) const { return vec(x + other.x, y + other.y); }
vec operator/(const long double a) const { return vec(x / a, y / a); }
vec operator*(const long double a) const { return vec(x * a, y * a); }
long double operator*(const vec other) const {
return x * other.x + y * other.y;
}
long double operator^(const vec other) const {
return x * other.y - other.x * y;
}
};
int N, Q;
vec poly[10005];
vec centroid;
vector<int> pinned;
long double norm(vec a) { return sqrt(a.x * a.x + a.y * a.y); }
long double calculateArea() {
long double area = 0;
for (int i = 0; i < N; i++)
area += poly[i].x * poly[(i + 1) % N].y - poly[(i + 1) % N].x * poly[i].y;
return abs(area) / 2;
}
vec calculateCentroid() {
vec centroid(0, 0);
for (int i = 0; i < N; i++) {
centroid.x +=
(poly[i].x + poly[(i + 1) % N].x) *
(poly[i].x * poly[(i + 1) % N].y - poly[(i + 1) % N].x * poly[i].y);
centroid.y +=
(poly[i].y + poly[(i + 1) % N].y) *
(poly[i].x * poly[(i + 1) % N].y - poly[(i + 1) % N].x * poly[i].y);
}
long double A = calculateArea();
centroid.x /= 6 * A;
centroid.y /= 6 * A;
return centroid;
}
bool ccw(vec a, vec b, vec c) { return ((a - b) ^ (c - b)) > 0; }
vec rotatePoint(vec a, long double angle) {
return vec(a.x * cos(angle) - a.y * sin(angle),
a.x * sin(angle) + a.y * cos(angle));
}
vec calculateLocation(int x, vec vx, vec cent, int pos) {
if (pos == x) return vx;
long double angle =
acos(max(min((long double)1,
(centroid - poly[x]) * (poly[pos] - poly[x]) /
norm(centroid - poly[x]) / norm(poly[pos] - poly[x])),
(long double)-1));
long double rAngle = -angle;
if (!ccw(poly[x], centroid, poly[pos])) rAngle = angle;
vec location = rotatePoint(cent - vx, rAngle);
location = location / norm(centroid - poly[x]);
location = location * norm(poly[pos] - poly[x]);
return location + vx;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> N >> Q;
for (int i = 0; i < N; i++) cin >> poly[i].x >> poly[i].y;
pinned.push_back(0);
pinned.push_back(1);
vec shift(poly[0].x, poly[1].y);
for (int i = 0; i < N; i++) poly[i].x -= shift.x, poly[i].y -= shift.y;
centroid = calculateCentroid();
vec currV0 = poly[0], currCent = centroid;
for (int i = 0; i < Q; i++) {
int type;
cin >> type;
if (type == 1) {
int f, t;
cin >> f >> t;
f--;
t--;
for (auto i = pinned.begin(); i != pinned.end(); ++i) {
if (*i == f) {
pinned.erase(i);
break;
}
}
if (pinned.size() == 1) {
vec pinV = calculateLocation(0, currV0, currCent, pinned[0]);
vec newCent = vec(pinV.x, pinV.y);
newCent.y -= norm(centroid - poly[pinned[0]]);
currCent = newCent;
currV0 = calculateLocation(pinned[0], pinV, currCent, 0);
}
pinned.push_back(t);
} else {
int v;
cin >> v;
v--;
vec loc = shift + calculateLocation(0, currV0, currCent, v);
cout << fixed << setprecision(10) << loc.x << " ";
cout << fixed << setprecision(10) << loc.y << "\n";
}
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename _tp> inline void read(_tp&x){
char ch=getchar(),ob=0;x=0;
while(ch!='-'&&!isdigit(ch))ch=getchar();if(ch=='-')ob=1,ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();if(ob)x=-x;
}
#define bin(x) (1<<(x))
#define b(x) (1<<(x)>>1)
inline void cmax(int&x, const int y) {x < y && (x = y);}
const int N = 17, M = 40100;
int f[N][M], g[M];
int mp[N][N];
int n, m;
int main() {
read(n), read(m);
int Ans = 0;
for(int i=1,x,y,z;i<=m;++i) {
read(x), read(y), read(z);
Ans += z;
mp[x][y] = mp[y][x] = z;
}
for(int s=0;s<bin(n);++s) {
int&v = g[s];
for(int i=1;i<=n;++i) if(s & b(i))
for(int j=i+1;j<=n;++j) if(s & b(j)) v += mp[i][j];
}
for(int i=1;i<=n;++i)
for(int j=0;j<bin(n);++j)
f[i][j] = -1;
f[1][1] = 0;
for(int S=1;S<bin(n);++S)
for(int i=1;i<=n;++i) if((S & b(i)) and ~f[i][S]) {
for(int j=1;j<=n;++j) if((~S & b(j)) and mp[i][j]) cmax(f[j][S|b(j)], f[i][S] + mp[i][j]);
for(int iS=(bin(n)-1)^S, s = iS; s; s = (s-1) & iS)
cmax(f[i][S|s], f[i][S] + g[s|b(i)]);
}
printf("%d\n", Ans - f[n][bin(n)-1]);
return 0;
} | 0 | CPP |
s=input().strip()
t=input().strip()
# match=0
i=len(s)-1
j=len(t)-1
ans=len(s)+len(t)
while i>=0 and j>=0:
if s[i]==t[j]:
# match+=1
ans-=2
else:
break
i-=1
j-=1
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long const mod = 1000000007;
long long const md = 998244353;
long long mypowr(long long a, long long b) {
long long res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res;
}
long long mypow(long long a, long long b) {
long long res = 1;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a;
a = a * a;
}
return res;
}
ifstream in("txt.in");
ofstream out("txt.out");
float f[1005];
float h[1005];
int main() {
cout << fixed << setprecision(12);
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
long long n;
float r;
scanf("%lld%f", &n, &r);
for (int i = 1; i <= n; ++i) {
scanf("%f", &f[i]);
}
for (int i = 1; i <= n; ++i) {
float mx = r;
for (int j = 1; j < i; ++j) {
double distance = abs(f[i] - f[j]);
if (distance <= 2 * r) {
mx = max(mx, h[j] + sqrt(4 * r * r - (f[j] - f[i]) * (f[j] - f[i])));
}
}
h[i] = mx;
printf("%.15f ", h[i]);
}
return 0;
}
| 9 | CPP |
n, k = map(int, input().split())
a = 1 if k and k < n else 0
b = 2 * k if k <= n // 3 else n - k
print(a, b) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[2010], b[2010];
unordered_map<int, int> mp;
int main() {
int n;
scanf("%d", &n);
int ans = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
mp[a[i]] = 1;
}
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
mp[b[i]] = 1;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (mp[a[i] ^ b[j]] == 1) ans++;
}
}
if (ans % 2 == 1) {
puts("Koyomi");
} else {
puts("Karen");
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
typedef struct {
int n1;
int n2;
int n3;
} triple;
int main() {
double n, a;
cin >> n;
cin >> a;
double ugl = (n - 2) * 180 / n;
double mod = 0;
vector<pair<triple, double>> v;
triple trip;
trip.n1 = 2;
trip.n2 = 1;
trip.n3 = n;
pair<triple, double> p;
p.first = trip;
p.second = abs(ugl - a);
v.push_back(p);
int div = n - 2;
int i = n - 3;
int t = n - 1;
ugl = ugl / (n - 2);
for (int i = n - 3; i >= 1; i--) {
mod = abs(ugl * i - a);
trip.n3 = t;
p.first = trip;
p.second = mod;
v.push_back(p);
t--;
}
double min = v[0].second;
trip = v[0].first;
for (int i = 0; i < v.size(); i++) {
if (min > v[i].second) {
min = v[i].second;
trip = v[i].first;
}
}
cout << trip.n1 << " " << trip.n2 << " " << trip.n3;
return 0;
}
| 8 | CPP |
n,k=map(int,input().split())
c=list(map(int,input().split()))
l=sorted(list(set(c)))
s=[l[0]]
for i in range(1,len(l)):
s.append(l[i]-l[i-1])
if k>len(s):
for i in range(k-len(s)):
s.append(0)
for i in range(k):
print(s[i])
| 8 | PYTHON3 |
import math,sys
t = int(input())
while t!=0:
t-=1
n = int(input())
p = list(map(int,input().split()))
c = 0
for i in range(1,n-1):
if p[i-1]<p[i] and p[i]>p[i+1]:
print('YES')
print(i,i+1,i+2)
c = 1
break
if c==1:continue
print('NO')
| 7 | PYTHON3 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
void shuffle(vector<int> &deck,int c) {
const int n = deck.size();
queue<int> a,b;
for(int i=0; i<(n/2); ++i) b.push(deck[i]);
for(int i=(n/2); i<n; ++i) a.push(deck[i]);
int idx=0;
while(true) {
for(int i=0; i<c; ++i) {
if(a.empty()) break;
deck[idx++] = a.front();
a.pop();
}
for(int i=0; i<c; ++i) {
if(b.empty()) break;
deck[idx++] = b.front();
b.pop();
}
if(a.empty() && b.empty()) break;
}
}
int main() {
int n,k,r;
while(cin>>n>>r) {
vector<int> deck(n);
for(int i=0; i<n; ++i) deck[i] = i;
for(int i=0; i<r; ++i) {
cin>>k;
shuffle(deck, k);
}
cout<<deck[n-1]<<endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
char S[5005];
int Min[5005][5005], Min2[5005][5005];
int ans, Aux[5005], Partial[5005];
int N;
void precalcMin() {
for (int i = 1; i <= N; i++) {
int cnt = 0, cnt2 = 0;
for (int j = i; j <= N; j++) {
if (S[j] == '?' || S[j] == ')')
--cnt;
else
++cnt;
if (S[j] == '?' || S[j] == '(')
++cnt2;
else
--cnt2;
if (j == i)
Min[i][j] = cnt, Min2[i][j] = cnt2;
else
Min[i][j] = min(Min[i][j - 1], cnt),
Min2[i][j] = min(Min2[i][j - 1], cnt2);
}
}
}
void Solve(int pos) {
int ind = 0;
int rem = pos % 2, r = rem, sum = 0;
Aux[0] = pos - 1;
for (int i = pos; i <= N; i++, rem = 1 - rem) {
if (S[i] == '?') Aux[++ind] = i;
if (S[i] == '(') sum++;
if (S[i] == ')') sum--;
if (ind == 0) {
if (sum < 0) return;
if (sum == 0) ans++;
}
if (rem == r || ind == 0) continue;
int nbp = (ind - sum) / 2;
int nbm = ind - nbp;
if (nbp < 0 || nbm < 0) continue;
if (Min2[pos][Aux[nbp]] >= 0 &&
Min[Aux[nbp] + 1][i] + nbp + Partial[Aux[nbp]] - Partial[pos - 1] >= 0)
ans++;
}
}
int main() {
cin.getline(S + 1, 5005);
N = strlen(S + 1);
for (int i = 1; i <= N; i++) {
Partial[i] = Partial[i - 1];
if (S[i] == '?') continue;
if (S[i] == '(')
++Partial[i];
else
--Partial[i];
}
precalcMin();
for (int i = 1; i <= N; i++) Solve(i);
cout << ans << "\n";
return 0;
}
| 7 | CPP |
a=input()
b=input()
c=0
for i in range(len(a)):
if a[i]!=b[i]:
c=c+1
print(c) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int u;
while (scanf("%d", &n) != EOF) {
int ans = 0;
int neg = 0;
int mi = 100000;
int zero = 0;
for (int i = 1; i <= 2 * n - 1; ++i) {
scanf("%d", &u);
if (u == 0) zero = 1;
if (u < 0) neg++;
ans += abs(u);
if (mi > abs(u)) mi = abs(u);
}
if (neg % 2 && n % 2 == 0) {
if (!zero) ans -= 2 * mi;
}
printf("%d\n", ans);
}
return 0;
}
| 7 | CPP |
a = int(input())
b = list(map(int, input().split()))
listing = [0] * a
for i in b:
listing[b[i - 1] - 1] = i
for i in listing:
print(i, end=' ')
| 7 | PYTHON3 |
n,m,a = map(int,input().split())
import math
if 1 <= n <= 10**9 and 1 <= m <= 10**9 and 1 <= a <= 10**9 :
c = math.ceil(n/a)
d = math.ceil(m/a)
x = c * d
print(x) | 7 | PYTHON3 |
n = int(input())
s = input()
res = ''
d = 1
while s:
res += s[0]
s = s[d:]
d += 1
print(res)
| 7 | PYTHON3 |
#!/bin/python3
import sys
# n toy cars
# every pair collides
# - no car turns over
# - 1 car turns over
# - 2 cars turn over
# ith row, jth column
# -1 cars never collided
# 0 if no car turned over
# 1 if i turned over
# 2 if j turned over
# 3 if both cars turned over
# read in n
n = int(input())
scores=[True for x in range(n)]
# read in the matrix A
for i in range(n):
line = input().split(' ')
for j in range(len(line)):
e = line[j]
if e == "-1":
continue
elif e == "0":
continue
elif e == "1":
scores[i] = False;
elif e == "2":
scores[j] = False;
elif e == "3":
scores[i] = False;
scores[j] = False;
total = 0
for car in scores:
if car:
total += 1
print(total)
for i, car in enumerate(scores):
if car:
print(i + 1, end=" ")
print()
| 7 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
p=list(map(int,input().split()))
a=[]
f=0
for i in range(len(p)-2):
if(p[i]<p[i+1] and p[i+1]>p[i+2]):
a.append([p.index(p[i])+1,p.index(p[i+1])+1,p.index(p[i+2])+1])
f=1
break
if f==0:
print("NO")
else:
print("YES")
print(' '.join(map(str,a[0])))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
int n;
cin >> n;
int a[n];
int m[n];
for (int(i) = 0; (i) < (n); (i)++) {
cin >> a[i];
a[i]--;
m[a[i]] = i;
}
int c = 0;
for (int i = 0; i < n; i++) {
if (a[i] != i) {
int temp = a[i];
a[i] = i;
a[m[i]] = temp;
m[temp] = m[i];
m[i] = i;
c++;
}
}
if (n & 1) {
if (c & 1)
cout << "Petr";
else
cout << "Um_nik";
} else {
if (c & 1)
cout << "Um_nik";
else
cout << "Petr";
}
return 0;
}
| 11 | CPP |
n,x = map(int,input().split())
if x == 1 or x == 2*n-1:
print("No")
else:
if x <= n:
r = [i for i in range(1, x+n)]
l = [i for i in range(x+n, 2*n)]
else:
l = [i for i in range(x-n+1, 2*n)]
r = [i for i in range(1, x-n+1)]
ans = l + r
print("Yes")
for i in range(2*n-1):
print(ans[i])
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3005;
char arr[N];
int main() {
int n, k;
scanf("%d%d", &n, &k);
scanf("%s", arr);
vector<vector<int>> ps = vector<vector<int>>(k, vector<int>());
int tol = 0;
int m = 0;
while (1) {
vector<int> step;
for (int i = 0; i < n - 1; i++) {
if (arr[i] == 'R' && arr[i + 1] == 'L') step.push_back(i), tol++;
}
if (step.empty()) break;
if (m >= k) {
puts("-1");
return 0;
}
ps[m++] = step;
for (auto x : step) swap(arr[x], arr[x + 1]);
}
if (k > tol) {
puts("-1");
return 0;
}
int fs = m - 1;
for (int i = k - 1; i >= 0; i--) {
if (ps[fs].empty()) fs--;
if (!ps[i].empty()) break;
ps[i] = vector<int>{ps[fs].back()};
ps[fs].pop_back();
}
for (int i = 0; i < k; i++) {
printf("%d ", ps[i].size());
for (auto x : ps[i]) printf("%d ", x + 1);
puts("");
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a;
string b;
cin >> a >> b;
int n = b.size();
int y = 1;
for (int i = 0; i < n; i++) {
int m;
char c = b[i];
stringstream ss;
ss << c;
ss >> m;
m *= y;
y *= 10;
a += m;
}
cout << a;
return 0;
}
| 7 | CPP |
a, b, c = map(int, input().split())
q = int(input())
l = list(map(int, input().split()))
s = 0
for i in range(q):
if l[i] > b and l[i] < c:
s += 1
print(s) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long temp;
vector<long long> v(3, 0);
for (long long i = 0; i < n; i++) {
cin >> temp;
long long ind = temp % 3;
v[ind]++;
}
long long ans = 0;
ans += v[0];
long long val = min(v[1], v[2]);
ans += val;
v[1] -= val;
v[2] -= val;
val = ((v[1] + v[2]) / 3);
ans += val;
cout << ans << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
const int INF = 2147483647;
const int MOD = 1000000007;
const long long INF64 = 9223372036854775807;
const long double EPS = 1e-7;
using namespace std;
int main() {
int n, t;
scanf("%d", &n);
set<int> s;
for (int i = (0); i < (n); i++) {
scanf("%d", &t);
s.insert(t);
}
if ((int)(s).size() < 3) {
printf("YES\n");
return 0;
}
if ((int)(s).size() == 3) {
auto it = s.begin();
int a = *it;
it++;
int b = *it;
it++;
int c = *it;
printf(b - a == c - b ? "YES\n" : "NO\n");
return 0;
}
printf("NO\n");
return 0;
}
| 8 | CPP |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = (int)1e5 + 10 ;
char str[MAXN] ;
int dp[MAXN][2] ;
int getc (char c){
if (c == '1' || c == '4' || c == '7') return 1 ;
if (c == '2' || c == '8') return 2 ;
return 3 ;
}
int main(){
while (~scanf("%s",str)){
if (str[0]=='#') break ;
int n = strlen(str) ;
dp[1][0] = dp[1][1] = 0 ;
for (int i = 2 ; i <= n ; i++){
char c = str[i-1] ;
int now = getc(c) , last = getc(str[i-2]) ;
dp[i][0] = dp[i-1][0] + 1 ;
if (now <= last)
dp[i][0] = min(dp[i][0] , dp[i-1][1]) ;
dp[i][1] = dp[i-1][1] + 1 ;
if (now >= last)
dp[i][1] = min(dp[i][1] , dp[i-1][0]) ;
}
printf("%d\n",min(dp[n][0],dp[n][1]));
}
return 0 ;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long v[500000];
long long k, c;
long long sum;
long long aa, bb, x, y, a, b, r, l, mid, q, n, vv, xx, yy, ans;
long long gcd(long long u, long long v) {
for (int i = u; i >= 1; i--)
if ((u % i == 0) && (v % i == 0)) return i;
}
bool check(long long t) {
long long e = t / c;
long long f = t / a;
long long g = t / b;
for (int i = 1; i <= t; i++) {
if (e > 0) {
sum += (x + y) * v[n - i + 1];
e--;
f--;
g--;
} else if (f > 0) {
sum += x * v[n - i + 1];
f--;
} else if (g > 0) {
sum += y * v[n - i + 1];
g--;
}
}
if (sum >= k)
return true;
else
return false;
}
int main() {
cin >> q;
for (int i = 1; i <= q; i++) {
cin >> n;
for (int j = 1; j <= n; j++) {
cin >> vv;
v[j] = vv / 100;
}
sort(v + 1, v + n + 1);
cin >> xx >> aa;
cin >> yy >> bb;
if (xx > yy) {
a = aa;
b = bb;
x = xx;
y = yy;
} else {
x = yy;
a = bb;
b = aa;
y = xx;
}
cin >> k;
c = (a * b) / gcd(b, a);
r = n;
l = 1;
ans = -1;
while (l <= r) {
mid = (r + l) / 2;
sum = 0;
if (check(mid)) {
ans = mid;
r = mid - 1;
} else
l = mid + 1;
}
cout << ans << endl;
}
}
| 7 | CPP |
t=int(input())
inp = list(map(int,input().split()))
zero=0
five=0
for item in inp:
if(item==5):
five=five+1
else:
zero=zero+1
if(zero==0):
print ("-1")
else:
k=five-(five%9)
if(k>0):
for i in range(k):
print("5",end="")
for i in range(zero):
print ("0",end="")
else:
print ("0")
| 7 | PYTHON3 |
x1,y1,x2,y2=(int(x)for x in input().split(" "));
x,y=(int(x)for x in input().split(" "));
def abs(a):
if(a<0): return -a;
return a;
if((x1-x2)%x!=0 or (y1-y2)%y!=0):
print("NO");
else:
a=abs(x1-x2)//x;
b=abs(y1-y2)//y;
if((a&1)==(b&1)): print("YES");
else: print("NO");
| 7 | PYTHON3 |
def input_as_list():
return list(map(int, input().split()))
[n] = input_as_list()
a = input_as_list()
b = input_as_list()
mapping = dict()
for i in range(n):
mapping[b[i]] = i
diffs = dict()
for i in range(n):
key = i - mapping[a[i]]
if key < 0:
key = n + key
# print('element {e} will match after {d} shifts'.format(e=a[i], d=key))
if key in diffs:
diffs[key] += 1
else:
diffs[key] = 1
solution = 0
for k in diffs:
if diffs[k] > solution:
solution = diffs[k]
print(solution) | 9 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split()))
for i in range(n-2):
for j in range(i+1, n-1):
a = sorted([sorted([arr[i], arr[i + 1]]), sorted([arr[j], arr[j + 1]])])
if a[1][0] > a[0][0] and a[1][0] < a[0][1] and a[1][1] > a[0][1]:
print('yes')
exit()
print('no')
| 7 | PYTHON3 |
for _ in range(int(input())):
n = int(input())
lst = [int(i) for i in input().split()]
s = set([int(i) for i in input().split()])
result = len(s) > 1 or lst == sorted(lst)
print('Yes' if result else 'No')
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
int n, k1, k2, val_p, val_c;
vector<int> set_p, set_lc, set_rc;
while (t--) {
cin >> n;
k1 = 1;
k2 = n - 1;
set_p.clear();
set_lc.clear();
set_rc.clear();
for (int i = 1; i <= k2; i++) set_p.push_back(i + 1);
cout << k1 << " " << k2 << " 1 ";
for (int i = 0; i < k2; i++) cout << set_p[i] << " ";
cout << "\n";
cout.flush();
cin >> val_p;
if (val_p == -1) exit(0);
while (k2 != 1) {
for (int i = 0; i < k2 / 2; i++) set_lc.push_back(set_p[i]);
for (int i = k2 / 2; i < k2; i++) set_rc.push_back(set_p[i]);
k2 = set_lc.size();
cout << k1 << " " << k2 << " 1 ";
for (int i = 0; i < k2; i++) cout << set_lc[i] << " ";
cout << "\n";
cout.flush();
cin >> val_c;
if (val_c == -1) exit(0);
set_p.clear();
if (val_c == val_p)
set_p = set_lc;
else
set_p = set_rc;
set_lc.clear();
set_rc.clear();
k2 = set_p.size();
}
cout << k1 << " " << n - 1 << " " << set_p[0] << " ";
for (int i = 0; i < n; i++) {
if (i + 1 == set_p[0]) continue;
cout << i + 1 << " ";
}
cout << "\n";
cout.flush();
cin >> val_p;
if (val_p == -1) exit(0);
cout << "-1 " << val_p << "\n";
cout.flush();
}
return 0;
}
| 9 | CPP |
#include<bits/stdc++.h>
using namespace std;
typedef complex<double> P;
double dot(P a,P b){
return real(b*conj(a));
}
double cross(P a,P b){
return imag(b*conj(a));
}
P init(P a){
return a/max(0.0001,abs(a));
}
int ax,ay,bx,by,cx,cy;
P A,B,C;
double sinA,cosA,sinB,cosB,sinC,cosC;
double funcC(double ra){
double L=0,R=10000,M;
for(int i=0;i<100;i++){
M=(L+R)/2.0;
if( M/sinC*cosC + ra/sinA*cosA + sqrt( 4.0*ra*M ) < abs(A-C) ) L=M;
else R=M;
}
return L;
}
double funcB(double ra){
double L=0,R=10000,M;
for(int i=0;i<100;i++){
M=(L+R)/2.0;
if( M/sinB*cosB + ra/sinA*cosA + sqrt( 4.0*ra*M ) < abs(A-B) ) L=M;
else R=M;
}
return L;
}
bool check(double ra){
double rb=funcB(ra);
double rc=funcC(ra);
if( rb/sinB*cosB + rc/sinC*cosC + sqrt( 4.0*rb*rc ) < abs(C-B) ){
return true;
}else{
return false;
}
}
int main(){
while(1){
cin>>ax>>ay>>bx>>by>>cx>>cy;
if(ax==0&&ay==0&&bx==0&&by==0&&cx==0&&cy==0)break;
A=P(ax,ay),B=P(bx,by),C=P(cx,cy);
P AB=init(B-A),AC=init(C-A);
AB=(AB+AC)*0.5;
sinA = abs(cross(AB,AC))/abs(AB);
cosA = dot(AB,AC)/abs(AB);
P BA=init(A-B),BC=init(C-B);
BA=(BA+BC)*0.5;
sinB = abs(cross(BA,BC))/abs(BA);
cosB = dot(BA,BC)/abs(BA);
P CA=init(A-C),CB=init(B-C);
CA=(CA+CB)*0.5;
sinC = abs(cross(CA,CB))/abs(CA);
cosC = dot(CA,CB)/abs(CA);
double L=0,R=10000,M;
for(int i=0;i<100;i++){
M=(L+R)/2.0;
if(check(M))R=M;
else L=M;
}
printf("%.10f %.10f %.10f\n",L,funcB(L),funcC(L));
}
return 0;
} | 0 | CPP |
x = 0
n = int(input())
for c in range(0, n):
o = input()
if("++" in o):
x += 1
if("--" in o):
x -= 1
print(x) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void chkmin(T &a, const T &b) {
a = a < b ? a : b;
}
template <typename T>
inline void chkmax(T &a, const T &b) {
a = a > b ? a : b;
}
const int MAXN = 200005, MAXT = 1 << 19;
char *mp[MAXN], mem[MAXN];
int beg[MAXN], ed[MAXN], sum[MAXT], tag[MAXT], n, m, tot;
vector<int> edge[MAXN];
struct Opt {
int l, r, tp;
};
vector<Opt> md[MAXN];
void dfs(int u) {
assert(!beg[u]);
beg[u] = ++tot;
for (int v : edge[u]) dfs(v);
ed[u] = tot;
}
void modify(int a, int b, int t, int l = 1, int r = tot, int k = 1) {
if (a > r || b < l) return;
if (a <= l && b >= r) {
tag[k] += t;
sum[k] = tag[k] ? r - l + 1 : (l == r ? 0 : sum[k << 1] + sum[k << 1 | 1]);
return;
}
int mid = (l + r) >> 1;
modify(a, b, t, l, mid, k << 1);
modify(a, b, t, mid + 1, r, k << 1 | 1);
sum[k] = tag[k] ? r - l + 1 : sum[k << 1] + sum[k << 1 | 1];
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
mp[i] = mem + i * m;
scanf("%s", mp[i]);
}
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
char c = mp[i][j];
int p = i * m + j;
if (c == 'U' && i + 2 < n)
edge[(i + 2) * m + j].push_back(p);
else if (c == 'D' && i > 1)
edge[(i - 2) * m + j].push_back(p);
else if (c == 'L' && j + 2 < m)
edge[p + 2].push_back(p);
else if (c == 'R' && j > 1)
edge[p - 2].push_back(p);
else
edge[n * m].push_back(p);
}
dfs(n * m);
assert(tot == n * m + 1);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
if (~(i + j) & 1) {
char c = mp[i][j];
int p = i * m + j, q;
if (c == 'U')
q = p + m;
else if (c == 'D')
q = p - m;
else if (c == 'L')
q = p + 1;
else
q = p - 1;
md[beg[p]].push_back(Opt{beg[q], ed[q], 1});
md[ed[p] + 1].push_back(Opt{beg[q], ed[q], -1});
}
long long ans = 0;
for (int i = 1; i <= tot; i++) {
for (const Opt &o : md[i]) modify(o.l, o.r, o.tp);
ans += sum[1];
}
printf("%lld\n", ans);
return 0;
}
| 13 | CPP |
#include<iostream>
using namespace std;
int main(){
string s,t;
int n;
int ans=0;
cin>>n>>s>>t;
for(int i=n;i>=0;i--){
bool ok=true;
for(int j=0;j<i;j++){
if(s[n-i+j]!=t[j]){
ok=false;
break;
}
}
if(ok){
ans=i;
break;
}
}
cout<<2*n-ans<<endl;
} | 0 | CPP |
from sys import stdin
input = lambda: stdin.readline().rstrip("\r\n")
from collections import defaultdict as vector
from collections import deque as que
inin = lambda: int(input())
inar = lambda: list(map(int,input().split()))
def maxSubArraySum(even,odd,size):
max_so_far = 0
max_ending_here = 0
start = 0
end = 0
s = 0
for i in range(0,size):
max_ending_here += (odd[i]-even[i])
if max_so_far < max_ending_here:
max_so_far = max_ending_here
if max_ending_here < 0:
max_ending_here = 0
return max_so_far
Testcase=inin()
for _ in range(Testcase):
n=inin()
arr=inar()
ans=0
if n%2:
n+=1
arr.append(0)
even=[]
odd=[]
for i in range(n):
if i%2:
odd.append(arr[i])
else:
even.append(arr[i])
ans+=arr[i]
cpy=ans
ans+=maxSubArraySum(even,odd,len(even))
odd=[0]+odd[:-1]
ans=max(ans,cpy+maxSubArraySum(even,odd,len(even)))
print(ans) | 10 | PYTHON3 |
n=int(input())
total=(n**2*(n**2 + 1))//2
target=total//n
arr=[i for i in range(1,n**2+1)]
k=0
l=n**2-1
for i in range(n):
for j in range(k,k+n//2):
print(arr[j],end=" ")
k=k+n//2
for j in range(l,l-n//2,-1):
print(arr[j],end=" ")
l=l-n//2
print()
| 7 | PYTHON3 |
#include <iostream>
#include <cstdio>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (a==b && b==c ? "Yes" : "No");
return 0;
}
| 0 | CPP |
n = int(input())
h = list(map(int, input().split()))
x = h[0]
for i in range(1, n):
x = max(x, h[i])
if h[i] - x < -1:
print('No')
exit()
print('Yes')
| 0 | PYTHON3 |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#define NUM 11000
int main(){
int table[NUM],limit;
for(int i=0; i < NUM;i++)table[i] = 1;
table[0] = 0;
table[1] = 0;
limit = sqrt(NUM);
for(int i=2;i<=limit;i++){
if(table[i] == 1){
for(int k=2*i;k < NUM; k += i){
table[k] = 0;
}
}
}
int n,count;
while(scanf("%d",&n)!=EOF){
count = 0;
for(int i=1; i<= n; i++){
if(table[i] == 1 && table[n+1-i] == 1)count++;
}
printf("%d\n",count);
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 1;
const int maxn = 3e5 + 1;
int h[maxn], dp[maxn], lge[maxn], lle[maxn], rge[maxn], rle[maxn];
vector<int> jumps[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = INF;
}
dp[0] = 0;
vector<pair<int, int> > st;
for (int i = 0; i < n; i++) {
while (!st.empty() && st.back().first < h[i]) {
st.pop_back();
}
if (st.empty())
lge[i] = -1;
else
lge[i] = st.back().second;
st.push_back({h[i], i});
}
st.clear();
for (int i = 0; i < n; i++) {
while (!st.empty() && st.back().first > h[i]) {
st.pop_back();
}
if (st.empty())
lle[i] = -1;
else
lle[i] = st.back().second;
st.push_back({h[i], i});
}
st.clear();
for (int i = n - 1; i >= 0; i--) {
while (!st.empty() && st.back().first < h[i]) {
st.pop_back();
}
if (st.empty())
rge[i] = -1;
else
rge[i] = st.back().second;
st.push_back({h[i], i});
}
st.clear();
for (int i = n - 1; i >= 0; i--) {
while (!st.empty() && st.back().first > h[i]) {
st.pop_back();
}
if (st.empty())
rle[i] = -1;
else
rle[i] = st.back().second;
st.push_back({h[i], i});
}
st.clear();
for (int i = 0; i < n; i++) {
if (rle[i] != -1) jumps[i].push_back(rle[i]);
if (rge[i] != -1) jumps[i].push_back(rge[i]);
if (lle[i] != -1) jumps[lle[i]].push_back(i);
if (lge[i] != -1) jumps[lge[i]].push_back(i);
}
for (int i = 0; i < n; i++) {
for (int to : jumps[i]) {
dp[to] = min(dp[to], dp[i] + 1);
}
}
cout << dp[n - 1];
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
const int MN = 131072;
int d[MN];
pii ch[2][MN];
int N;
vector<pll> vec[MN];
void dfs(int v, ll x)
{
if (d[v] == 0) {
vec[v].eb(0LL, 0LL);
return ;
}
int a = ch[0][v].fi, c1 = ch[0][v].se;
int b = ch[1][v].fi, c2 = ch[1][v].se;
dfs(a, x);
dfs(b, x);
if ((int)vec[a].size() == 0 || (int)vec[b].size() == 0) return ;
if (vec[a].size() > vec[b].size()) {
swap(a, b);
swap(c1, c2);
}
int i = 0, i2 = 0;
vector<pll> v1, v2;
for (pll &p : vec[a]) { //a,b
ll c = x - c1 - c2 - p.se;
while (i+1 < vec[b].size() && vec[b][i+1].fi <= c) {
++i;
}
if (vec[b][i].fi <= c) {
v1.eb(p.fi + c1, vec[b][i].se + c2);
}
}
for (pll &p : vec[a]) { //b,a
ll c = x - c1 - c2 - p.fi;
while (i2 < vec[b].size() && vec[b][i2].se > c) {
++i2;
}
if (i2 < vec[b].size()) {
v2.eb(vec[b][i2].fi + c2, p.se + c1);
}
}
vector<pll> res;
int num = v1.size() + v2.size();
v1.eb(LLONG_MAX, -1LL); v2.eb(LLONG_MAX, -1LL);
i = i2 = 0;
rep(tt, num) {
if (v1[i] < v2[i2]) res.eb(v1[i++]);
else res.eb(v2[i2++]);
}
for (pll &p : res) {
if (vec[v].size() == 0 || vec[v].back().se > p.se) {
vec[v].eb(p);
}
}
}
bool f(ll x)
{
rep(i, MN) vec[i].clear();
dfs(0, x);
return (int)vec[0].size() > 0;
}
int main() {
cin >> N;
rep(i, N-1) {
int a, v;
cin >> a >> v;
--a;
ch[d[a]++][a] = mp(i + 1, v);
}
ll ng = -1, ok = 1e11;
while (ok - ng > 1) {
ll m = (ok + ng) / 2;
if (f(m)) {
ok = m;
} else {
ng = m;
}
}
cout << ok << endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct IO {
char buf[(1 << 20)], *p1, *p2;
char pbuf[(1 << 20)], *pp;
IO() : p1(buf), p2(buf), pp(pbuf) {}
inline char gc() {
return getchar();
if (p1 == p2) p2 = (p1 = buf) + fread(buf, 1, (1 << 20), stdin);
return p1 == p2 ? ' ' : *p1++;
}
inline bool blank(char ch) {
return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
template <class T>
inline void read(T &x) {
register double tmp = 1;
register bool sign = 0;
x = 0;
register char ch = gc();
for (; !(ch >= '0' && ch <= '9'); ch = gc())
if (ch == '-') sign = 1;
for (; (ch >= '0' && ch <= '9'); ch = gc()) x = x * 10 + (ch - '0');
if (ch == '.')
for (ch = gc(); (ch >= '0' && ch <= '9'); ch = gc())
tmp /= 10.0, x += tmp * (ch - '0');
if (sign) x = -x;
}
inline void read(char *s) {
register char ch = gc();
for (; blank(ch); ch = gc())
;
for (; !blank(ch); ch = gc()) *s++ = ch;
*s = 0;
}
inline void read(char &c) {
for (c = gc(); blank(c); c = gc())
;
}
template <class t>
inline void write(t x) {
if (x < 0)
putchar('-'), write(-x);
else {
if (x > 9) write(x / 10);
putchar('0' + x % 10);
}
}
} io;
const int mod = 1e9 + 7;
const int mo = 998244353;
const int N = 2e5 + 5;
int n, m, a[N], flg;
int main() {
io.read(n);
for (int i = (1); i <= (n); i++) io.read(a[i]);
for (int i = (2); i <= (n - 1); i++) {
flg = 0;
flg |= ((a[i] > a[i - 1]) && (a[i] > a[i + 1]));
flg |= ((a[i] < a[i - 1]) && (a[i] < a[i + 1]));
m += flg;
}
io.write(m);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
using LL = int64_t;
const int INF = 0x3fffffff;
const double EPS = 1e-9;
const double PI = 2 * asin(1);
struct Point {
int x, y;
Point(int xx = 0, int yy = 0) : x(xx), y(yy) {}
};
int g_xn, g_yn;
int g_xu, g_yu;
vector<string> vs;
vector<vector<Point>> vvp;
vector<vector<bool>> vvb_mark;
const int dx[]{0, 1, 0, -1};
const int dy[]{1, 0, -1, 0};
void pretreat() {}
bool input() {
cin >> g_xn >> g_yn;
if (cin.eof()) return false;
vs.clear(), vvp.clear(), vvb_mark.clear();
vvb_mark.resize(g_xn), vvp.resize(g_xn);
string s;
bool f = true;
for (int i = 0; i < g_xn; ++i) {
vvb_mark[i].resize(g_yn);
vvp[i].resize(g_yn);
cin >> s;
for (int j = 0; f && j < g_yn; ++j) {
if (s[j] == 'S') {
g_xu = i, g_yu = j;
f = false;
}
}
vs.push_back(s);
}
return true;
}
void dfs(int x, int y) {
for (int i = 0; i < 4; ++i) {
Point pn(x + dx[i], y + dy[i]);
Point pm((pn.x % g_xn + g_xn) % g_xn, (pn.y % g_yn + g_yn) % g_yn);
if (vs[pm.x][pm.y] == '#') continue;
if (vvb_mark[pm.x][pm.y]) {
if (pn.x != vvp[pm.x][pm.y].x || pn.y != vvp[pm.x][pm.y].y) {
puts("Yes");
exit(0);
}
} else {
vvb_mark[pm.x][pm.y] = true;
vvp[pm.x][pm.y].x = pn.x;
vvp[pm.x][pm.y].y = pn.y;
dfs(pn.x, pn.y);
}
}
}
void solve() {
dfs(g_xu, g_yu);
puts("No");
}
int main() {
pretreat();
while (input()) {
solve();
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
char a[11];
int main() {
for (int i = 1; i <= 7; i++) cin >> a[i];
int sum = 0;
for (int i = 1; i <= 7; i++) {
if (a[i] == 'A')
sum++;
else if (a[i] == '1')
sum += 10;
else
sum += a[i] - 48;
}
cout << sum << endl;
return 0;
}
| 12 | CPP |
def main():
x=input().lower()
g=["a", "o", "y", "e", "u", "i"]
asn=""
for i in x:
if g.count(i)>0:
x=x.replace(i,"")
for i in range(0,len(x)):
asn+="."+x[i]
print(asn)
if __name__=='__main__':
main() | 7 | PYTHON3 |
h,w=map(int,input().split())
n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(n):
for j in range(a[i]):
l.append(i+1)
for i in range(h):
c=l[i*w:i*w+w]
if i%2==0:
print(*c)
else:
print(*c[::-1]) | 0 | PYTHON3 |
students = int(input())
segment = input().split(' ')
alsegment = list()
for i in range(int(list(segment)[0]),int(list(segment)[1])):
alsegment.append(i)
for i in range(1,students):
segment = input().split(' ')
for i in range(int(list(segment)[0]),int(list(segment)[1])):
if i in alsegment:
alsegment.remove(i)
print(len(alsegment)) | 7 | PYTHON3 |
t=int(input())
while t:
n=int(input())
s=input()
flag = 0
if len(s)==1:
print(-1,-1)
else:
for i in range(1,len(s)):
if (s[i]=="a" and s[i-1]=="b") or ((s[i]=="b" and s[i-1]=="a")):
flag=1
print(i,i+1)
break
if flag==0:
print(-1,-1)
t-=1 | 7 | PYTHON3 |
N,X,T = map(int,input().split())
import math
print(math.ceil(N/X)*T)
| 0 | PYTHON3 |
r=int(input())
if r<1200:print("ABC")
if r>=1200 and r<2800:print("ARC")
if r>=2800:print("AGC") | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline char gc(void) {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
: *p1++;
}
template <class T>
inline void read(T &x) {
T f = 1;
x = 0;
static char c = gc();
for (; !isdigit(c); c = gc())
if (c == '-') f = -f;
for (; isdigit(c); c = gc()) x = (x << 1) + (x << 3) + (c & 15);
x *= f;
}
inline void readstr(char *s) {
do *s = gc();
while ((*s == ' ') || (*s == '\n') || (*s == '\r'));
do *(++s) = gc();
while ((~*s) && (*s != ' ') && (*s != '\n') && (*s != '\r'));
*s = 0;
return;
}
inline void readch(char &x) {
while (isspace(x = gc()))
;
}
template <class T>
inline void write(T x) {
if (x < 0) x = -x, putchar('-');
if (x > 9) write(x / 10);
putchar(x % 10 + 48);
}
template <class T>
inline void writeln(T x, char c = '\n') {
write(x);
putchar(c);
}
template <class T>
inline void chkmax(T &x, const T y) {
x > y ? x = x : x = y;
}
template <class T>
inline void chkmin(T &x, const T y) {
x < y ? x = x : x = y;
}
const int N = 1e6 + 100;
int x[N], y[N], w[N], s[N], v[N];
bool in[N * 2];
vector<pair<int, int> > e[N];
vector<int> res;
int n, m;
int main() {
read(n), read(m);
for (int i = (1); i <= (m); i++) {
read(x[i]), read(y[i]);
w[i] = 1;
s[x[i]]++;
s[y[i]]++;
e[max(x[i], y[i])].push_back(make_pair(min(x[i], y[i]), i));
}
for (int i = (1); i <= (n); i++) {
for (auto it : e[i]) {
if (!v[it.first]) {
v[it.first] = 1;
w[it.second] = 0;
s[i]--;
}
in[s[it.first]] = 1;
}
for (auto it : e[i]) {
if (!in[s[i]]) break;
s[i]++;
v[it.first] = 0;
w[it.second]++;
}
for (auto it : e[i]) in[s[it.first]] = 0;
}
for (int i = (1); i <= (n); i++)
if (v[i]) res.push_back(i);
writeln(int(res.size()));
for (auto it : res) writeln(it, ' ');
puts("");
for (int i = (1); i <= (m); i++)
writeln(x[i], ' '), writeln(y[i], ' '), writeln(w[i]);
return 0;
}
| 21 | CPP |
"""
βββ βββββββ βββ βββββββ βββββββ βββ ββββββ
βββββββββββββββ βββββββββββββββββββββββββββββ
ββββββ ββββββ ββββββββββββββββββββββββββββ
ββββββ ββββββ βββββββ βββββββββ βββ βββββββ
βββββββββββββββ βββββββββββββββββ βββ βββββββ
βββ βββββββ βββ ββββββββ βββββββ βββ ββββββ
"""
from math import factorial as f
n = input()
s = input()
quest = s.count("?")
plusn = n.count("+")
plus = s.count("+")
try:
comb = f(quest)/(f(plusn - plus) * f(quest - (plusn - plus)))
print("%.12f" %(comb/2 ** quest))
except:
print("%.12f" %0)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int head[N], ver[N << 1], Next[N << 1], total;
int d[N], f[N][3], len;
vector<int> seq, stl, str;
inline void add(int x, int y) {
ver[++total] = y;
Next[total] = head[x];
head[x] = total;
}
inline void addv(int x, int v) {
int pos = -1;
for (int i = 0; i <= 2; ++i) {
if (v >= f[x][i]) {
pos = i;
break;
}
}
if (pos == -1) return;
for (int i = 2; i >= pos + 1; --i) f[x][i] = f[x][i - 1];
f[x][pos] = v;
}
void dfs1(int x, int fa, int dep, int b) {
d[x] = 0;
if (x == b) len = dep;
for (int i = head[x]; i; i = Next[i]) {
int y = ver[i];
if (y == fa) continue;
dfs1(y, x, dep + 1, b);
addv(x, d[y] + 1);
d[x] = max(d[x], d[y] + 1);
}
}
bool IsExistKeyPoint(int x, int fa) {
if (f[x][2] >= len) return true;
for (int i = head[x]; i; i = Next[i]) {
int y = ver[i];
if (y == fa) continue;
addv(y, f[x][d[y] + 1 == f[x][0]] + 1);
if (IsExistKeyPoint(y, x)) return true;
}
return false;
}
bool dfs3(int x, int fa, int b) {
bool flag = (x == b);
d[x] = 0;
for (int i = head[x]; i; i = Next[i]) {
int y = ver[i];
if (y == fa) continue;
if (dfs3(y, x, b))
flag = true;
else
d[x] = max(d[x], d[y] + 1);
}
if (flag) seq.push_back(x);
return flag;
}
int main() {
int T, n, a, b;
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
scanf("%d", &a);
scanf("%d", &b);
memset(head, 0, sizeof(int) * (n + 1));
for (int i = 1; i <= n; ++i)
for (int j = 0; j <= 2; ++j) f[i][j] = 0;
total = 0, seq.clear(), stl.clear(), str.clear();
for (int i = 1; i <= n - 1; ++i) {
int u, v;
scanf("%d", &u);
scanf("%d", &v);
add(u, v);
add(v, u);
}
dfs1(a, 0, 0, b);
if (!IsExistKeyPoint(a, 0)) {
puts("NO");
continue;
}
dfs3(a, 0, b);
for (int i = 0; i <= len; ++i) {
stl.push_back(stl.empty() || d[seq[i]] - i > stl.back() ? d[seq[i]] - i
: stl.back());
str.push_back(str.empty() || d[seq[len - i]] - i > str.back()
? d[seq[len - i]] - i
: str.back());
}
reverse(str.begin(), str.end());
int l = 0, r = len;
while (l < r) {
if (l < str[r])
l = str[r];
else if (len - r < stl[l])
r = len - stl[l];
else
break;
}
puts(l >= r ? "YES" : "NO");
}
return 0;
}
| 10 | CPP |
#include <stdio.h>
#include <complex>
#include <iostream>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
typedef complex<double> P;
#define INF (1e100)
#define EPS (1e-12)
inline double cross(const P& a, const P& b) { return imag(conj(a)*b); }
inline double dot(const P& a, const P& b) { return real(conj(a)*b); }
inline P projection(const P& l0, const P& l1, const P& p) {
const double t = dot(p-l0, l1-l0) / norm(l1-l0);
return l0 + t*(l1-l0);
}
inline P reflection(const P& l0, const P& l1, const P& p) {
return 2.0*projection(l0, l1, p) - p;
}
int ccw(const P& a, P b, P c) {
b -= a; c -= a;
if(cross(b, c)>0) return 1;
if(cross(b, c)<0) return -1;
if(dot(b, c)<0) return 2;
if(norm(b)<norm(c)) return -2;
return 0;
}
inline bool intersectSP(const P& s0, const P& s1, const P& p) {
return abs(s0-p)+abs(s1-p)-abs(s1-s0)<EPS;
}
inline bool intersectSS(const P& s0, const P& s1, const P& t0, const P& t1) {
return ccw(s0, s1, t0)*ccw(s0, s1, t1) <= 0
&& ccw(t0, t1, s0)*ccw(t0, t1, s1) <= 0;
}
inline P crosspoint(const P& l0, const P& l1, const P& m0, const P& m1) {
const double A = cross(l1-l0, m1-m0);
const double B = cross(l1-l0, l1-m0);
if(abs(A)<EPS && abs(B)<EPS) return m0;
// if(abs(A)<EPS) throw 0;
return m0 + B/A * (m1-m0);
}
int n, ord[8];
P ps[8][8], qs[8][8], gl[8], st;
bool crossing_any(int d, P s, P t) {
rep(i, n) {
if(intersectSP(ps[d][i], qs[d][i], s)) continue;
if(intersectSP(ps[d][i], qs[d][i], t)) continue;
if(intersectSS(ps[d][i], qs[d][i], s, t)) return true;
}
return false;
}
double calc(int d) {
P p = st;
rep(i, d) {
const int k = ord[i];
if(!intersectSS(ps[i][k], qs[i][k], p, gl[d])) return INF;
const P np = crosspoint(ps[i][k], qs[i][k], p, gl[d]);
if(crossing_any(i, p, np)) return INF;
p = np;
}
if(crossing_any(d, p, gl[d])) return INF;
return abs(gl[d]-st);
}
double rec(int d, int pre) {
double ans = calc(d);
if(d<5) {
rep(i, n) if(i!=pre) {
ps[d+1][i] = ps[d][i];
qs[d+1][i] = qs[d][i];
rep(j, n) if(j!=i) {
ps[d+1][j] = reflection(ps[d][i], qs[d][i], ps[d][j]);
qs[d+1][j] = reflection(ps[d][i], qs[d][i], qs[d][j]);
}
gl[d+1] = reflection(ps[d][i], qs[d][i], gl[d]);
ord[d] = i;
ans = min(ans, rec(d+1, i));
}
}
return ans;
}
int main() {
for(;;) {
scanf("%d", &n);
if(n==0) return 0;
int x, y;
rep(i, n) {
scanf("%d%d", &x, &y);
ps[0][i] = P(x, y);
scanf("%d%d", &x, &y);
qs[0][i] = P(x, y);
}
scanf("%d%d", &x, &y);
gl[0] = P(x, y);
scanf("%d%d", &x, &y);
st = P(x, y);
const double ans = rec(0, -1);
printf("%.9f\n", ans);
}
} | 0 | CPP |
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstring>
const int N=250001;
int n, dis[N], q[N];
bool vis[N];
bool cmin(int &a, int b) {
return b<a?(a=b, true):false;
}
int main() {
scanf("%d", &n);
for(int i=1; i<=n; ++i) {
for(int j=1; j<=n; ++j) {
dis[i*n+j-n]=std::min(std::min(i, n-i+1), std::min(j, n-j+1));
vis[i*n+j-n]=true;
}
}
int ans=0;
for(int i=1; i<=n*n; ++i) {
int p, *qhead=q, *qtail=q;
scanf("%d", &p);
*qtail++=p;
ans+=--dis[p];
vis[p]=false;
while(qhead<qtail) {
int u=*qhead++;
if(u>n && cmin(dis[u-n], dis[u]+vis[u-n])) *qtail++ = u-n;
if(u<=n*n-n && cmin(dis[u+n], dis[u]+vis[u+n])) *qtail++ = u+n;
if(u%n!=1 && cmin(dis[u-1], dis[u]+vis[u-1])) *qtail++ = u-1;
if(u%n!=0 && cmin(dis[u+1], dis[u]+vis[u+1])) *qtail++ = u+1;
}
}
printf("%d\n", ans);
return 0;
}
| 0 | CPP |
#include<iostream>
#include<cstring>
using namespace std;
string s;int n;
int main(){
cin>>n;
cin>>s;
for(int i=0;i<s.length();i++){
char c=s[i];c-='A';c+=n;c%=26;c+='A';cout<<c;
}
return 0;
} | 0 | CPP |
#include <cstdio>
#include <vector>
#include <algorithm>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int n,T,s,a,b,dp[3001],ans;
vector<int> t,v;
int main(){
scanf("%d%d%d",&n,&T,&s);
rep(i,n){
scanf("%d%d",&a,&b);
v.push_back(a);t.push_back(b);
}
rep(i,t.size()){
for(int j = T; j >= 0; j--){
if((j<s&&j+t[i]>s)||j+t[i]>T)continue;
dp[j+t[i]]=max(dp[j+t[i]],dp[j]+v[i]);
}
}
rep(i,T+1)ans=max(ans,dp[i]);
printf("%d\n",ans);
} | 0 | CPP |
n, p = map(int, input().split())
L, R = [], []
for i in range(n):
l, r = map(int, input().split())
L.append(l)
R.append(r)
ans = 0
for i in range (n):
l1, r1, l2, r2 = L[i], R[i], L[(i + 1) % n], R[(i + 1) % n]
l_1, r_1, l_2, r_2 = L[i], R[i], L[(i + 1) % n], R[(i + 1) % n]
if (l1 % p > 0):
l1 += p - l1 % p
if (l2 % p > 0):
l2 += p - l2 % p
r1 -= r1 % p
r2 -= r2 % p
#print(l1, r1, l2, r2)
#print(((r2 // p - l2 // p + 1) / (r_2 - l_2 + 1) + (r1 // p - l1 // p + 1) / (r_1 - l_1 + 1) - (r2 // p - l2 // p + 1) / (r_2 - l_2 + 1) * (r1 // p - l1 // p + 1) / (r_1 - l_1 + 1)))
ans += (2000 * (r2 // p - l2 // p + 1) / (r_2 - l_2 + 1) + 2000 * (r1 // p - l1 // p + 1) / (r_1 - l_1 + 1) - 2000 * (r2 // p - l2 // p + 1) / (r_2 - l_2 + 1) * (r1 // p - l1 // p + 1) / (r_1 - l_1 + 1))
print(ans) | 9 | PYTHON3 |
T = int(input())
for _ in range(T):
A, B, C, D, K = map(int, input().split())
x = -(-A//C)
y = -(-B//D)
if x + y > K:
print(-1)
else:
print(x, y)
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.