text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n);
for(int i=0; n>i; i++)
cin>>a.at(i);
long long sum=0,cntp=0;
for(int i=0; i<n; i++){
sum = sum+a.at(i);
if(i%2==0)
if(sum<=0){
cntp = cntp+1-sum;
sum=1;
}
if(i%2==1)
if(sum>=0){
cntp =... |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n+1];
for(int i=0;i<n;i++)
cin >> a[i];
int64_t sum = 0;
int c = 1;
int64_t ans0 = 0, ans1 = 0;
for(int i=0;i<n;i++) {
sum += a[i];
if(sum * c < 1) {
ans0 += 1 - sum * c;
sum ... |
#include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int n;
long long sum = 0;
long long ans1 = 0;
long long ans2 = 0;
int i, j;
int t = 1;
int main() {
cin >> n ;
int a[100010];
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (sum*t <= 0) {
ans1 += a... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,s1=0,s2=0,c1=0,c2=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
s1+=a;
s2+=a;
if(i%2){
if(s1<=0){
c1+=1-s1;
s1=1;
}
if(s2>=0){
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
void solve() {
int n; cin >> n;
ll a;
vector<ll> sum(2), cnt(2);
for(int i=0; i<n; ++i) {
cin >> a;
for(int j : {0,1}) {
sum[j] += a;
int d = 1 - (i+j) % 2... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<long long> a(n);
for(long long &x: a) cin>>x;
long long ans_1=0,ans=0;
long long sum_1=a[0],sum=a[0];
while(sum_1<=0) {sum_1++; ans_1++;}
while(sum>=0) {sum--; ans++;}
for(int i=1;i<n;i++){
sum_1+=a[i];
if(i%2==1... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
ll A[n];
for(int i=0; i<n; ++i) cin >> A[i];
ll sum = 0, pm = 0, mp = 0;
for(int i=0; i<n; ++i){
sum += A[i];
if(i%2 == 0 && sum <= 0){ pm += 1-sum; sum = 1; }
if(i%2 != 0 && sum >= 0){ pm += 1+sum; ... |
#include<iostream>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
int n, a[100000];
int64_t calc(int sign) {
int64_t ret = 0, sum = 0;
rep(i, n) {
sum += a[i];
if (sum * sign <= 0) {
ret += abs(sum) + 1;
sum = sign;
}
sign *= -1;
}
re... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
int main () {
int n;
cin >> n;
vector<int> a(n);
rep(i,n)cin >> a[i];
ll c1 = 0, c2 = 0;
ll s1 = 0, s2 = 0;
for(int i = 0; i < n; i++) {
s1 += a[i];
if(i % 2 == 0 && s1 <= 0) {... |
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
int n;
ll a[100000];
ll solve(ll t){
ll res = 0, sum = 0;
for(int i = 0; i < n; i++, t = -t){
sum += a[i];
if(sum * t > 0) continue;
res += abs(sum - t);
sum += t * abs(sum - t);
}
return res;
}
int main(){
... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n;
cin >> n;
ll ans = 1e18;
vector<ll> a(n);
for(int i = 0;i<n;i++)cin >> a[i];
for(int aaa = 0;aaa<2;aaa++)
{
if(aaa)for(auto &i:a)i = -i;
ll sum = 0;
ll now = 0;
for(int i = 0;i<n;i++)
... |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
LL ans1,ans2,sum;
int n;
int a[100010];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
sum=0;
for(int i=1,s=1;i<=n;i++,s*=-1){
sum+=a[i];
if(sum*s<=0) ans1+=abs(sum-s),sum=s;
}
sum=0;
for(int i=1,s=-1;i<=n;i++,s*=-1){
... |
#include <bits/stdc++.h>
#define ll long long
#define vl vector<ll>
#define pl pair<ll,ll>
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,b) for(ll i=0;i<b;i++)
#define RFOR(i,a,b) for(ll i=b-1;i>=a;i--)
#define rsort(v) sort((v).rbegin(), (v).rend())
#define all(v) (v).begin(),(v).end()
using namespace std;
ll m... |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
int n; cin >> n;
int a[n+1];
for(int i=1; i<=n; i++) cin >> a[i];
ll p1=0, p2=0, sum1=0, sum2=0;
for(int i=1; i<=n; i++){
sum1 += a[i]; sum2 += a[i];
if(i%2){
p1 += max(-sum1+1, 1LL*0); sum1 = ma... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
cin >> n;
ll a[n], sum, res1 = 0, res2 = 0;
for(int i = 0; i < n; i++) cin >> a[i];
// odd is -
sum = 0;
for(int i = 0; i < n; i++){
sum += a[i];
if(i % 2){
if(sum >= 0) res1 += 1 + sum, sum = -1;
}el... |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
signed main(){
int N;cin>>N;
vector<long long> A(N);
REP(i, N) cin >> A[i];
long long ans=LLONG_MAX;
int sig[2]={1,-1};
REP(j,2){
long... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin>>n;
vector<int> A(n);
for(int &i:A)
cin>>i;
int j,k,l=100000000000000000;
for(int a=0;a<2;a++){
k=0,j=0;
for(int i=0;i<n;i++){
k+=A[i];
if(((i+a)%2*2-1)*k<=0){
j+=1+abs(k);
k... |
#include <iostream>
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
ll sum1,sum2,cost1,cost2;
int main() {
int n; cin >> n;
REP(i,n) {
int cur; cin >> cur;
sum1 += cur, sum2 += cur;
if (i&1) {
if (sum1<=0) cost1 += 1-sum1, sum1 = 1;
if (sum2>=0) cost2 += sum2+1,... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
long long int a[n],sum1=0,sum2=0,cost1=0,cost2=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum1+=a[i];
sum2+=a[i];
if(i%2==0 && sum1>=0){
cost1+=1+sum1;
sum1=-1;
}
else if(i%2==1 && sum1<=0){
cost1+=1-su... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N);
for (int i = 0, a, sum = 0; i < N && cin >> a; i++)
V.at(i) = sum += a;
long long cnt1 = 0;
for (int i = 0, j = 0; i < N; i++) {
int tmp = V.at(i) + j;
if (!(i % 2) && tmp >= 0) cnt1 += abs(-1 - tmp),... |
#include <cstdio>
#include <algorithm>
#define maxn 100000
#define ll long long
int a[maxn];
ll det(int n, int a[], int l) {
int sum = 0;
ll rez = 0;
for (int i = 1; i <= n; i++, l = 1 - l) {
sum += a[i];
if (l == 0 && sum <= 0) {
rez += 1 - sum;
sum = 1;
}... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int n, a[100010];
ll calc(ll s) {
ll sum = 0, res = 0;
for (int i = 0; i < n; ++i, s *= -1) {
sum += a[i];
if (sum * s > 0) continue;
res += abs(sum - s);
sum += s * abs(sum - s);
}
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int>pa;
const int N=2e5+100;
const int mod=1e9+7;
ll a[N];
int n;
ll slove(ll f)
{
ll sum=0,ans=0;
for(int i=1;i<=n;i++){
sum+=a[i];
if(sum*f<=0) {
ans+=abs(f-sum);
sum=f;
}
... |
#include <iostream>
int a[1000005];
int n;
long long calc(int mod){
long long sum = 0, res = 0;
for (int i = 0; i < n; i++){
sum += a[i];
if (i%2 == mod && sum <= 0) {
res += 1-sum;
sum = 1;
}
else if (i%2 != mod && sum >= 0){
res += sum+1;
sum=-1;
}
}
return res;
}... |
#include<iostream>
#include<string>
#include<typeinfo>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
using namespace std;
typedef long long int ll;
int main()
{
int n;
cin >> n;
int a;
ll mp=0, pm=0;
ll mp_tmp=0, pm_tmp=0;
for(int i=0; i<n; i++){
cin >> a;
mp_tmp += a;
pm_tmp += a;
... |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main(){
cin.tie(0); ios::sync_with_stdio(false);
int n; cin>>n; int a[n]; Int a1=0,s1=0,a2=0,s2=0;
for (int i = 0; i < n; i++){
cin>>a[i];
s1+=a[i]; s2+=a[i];
if(i%2){
if(s1>=0){a1+=1+s1; s1=-1;}
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> v(1e5+7);
ll solve(int n)
{
ll sum = 0;
ll ans = 0;
for (int i = 0; i < n; i++) {
if (i % 2) {
if (sum + v[i] <= 0) ans += abs(sum + v[i]) + 1, sum = 1;
else sum += v[i];
}
els... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
const int N = 100010, mod = 1e9 + 7;
int n, a[N];
LL sum, res, ans;
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", a + i);
sum = 0;
for(int i = 1, ... |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for(auto &i:a)cin >> i;
int64_t sum1=0, sum2=0;
int64_t cnt1=0, cnt2=0;
int sign1=1,sign2=-1;
for(int i=0; i<N; i++){
sum1 += a.at(i);
if(sign1 * sum1 <= 0){
cnt1 += abs(sum1) + 1;
sum1 = sign1;
}
s... |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#define ll long long
using namespace std;
int main(){
ll n, a;
cin >> n;
int ans = 0;
vector<ll> vec(n);
for (int i = 0; i < n; i++){
cin >> a;
vec.at(i) = a;
}
ll now1 = 0,... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int d[n];
for(int i=0;i<n;i++) cin >> d[i];
int64_t sume=0;
int64_t counte=0;
for(int i=0;i<n;i++){
sume+=d[i];
if(i%2==0){
if(sume<=0){
counte+=1-sume;
sume=1;
}
}
else{
if(sume>=0){
counte+... |
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a;
long long solve(int x);
int main() {
cin >> n;
for(int i = 0; i < n; ++i) {
int x;
cin >> x;
a.push_back(x);
}
cout << min(solve(0), solve(1)) << endl;
return 0;
}
long long solve(int x) {
long long ans = 0, now ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[100100];
for (int i = 0; i < n; i++) cin >> a[i];
long long cnt[2] = {};
for (int i = 0; i < 2; i++) {
long long sum = 0;
for (int j = 0; j < n; j++) {
sum += a[j];
if (sum == 0) {
if ((i + j) % 2... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> an(n);
for(int i=0; i<n; ++i) cin >> an[i];
ll plusans = 0, cnt = 0;
for(int i=0; i<n; ++i){
cnt += an[i];
if(cnt *(i%2 ? 1:-1) >= 0){
plusans += abs(cnt) +1;
cnt = (i%2 ? -1:1);... |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
ll a[n];
for(ll i=0;i<n;i++) cin >> a[i];
ll x=0,y=0,xc=0,yc=0;
for(ll i=0;i<n;i++){
xc+=a[i];
if(i%2==0&&xc<=0){
x+=1-xc;
xc=1;
}
else if(i%2==1&&xc>=0){
x+=1+x... |
#include<cstdio>
using namespace std;
int main(){
int n;
long long d, a = 0, b = 0, cnta = 0, cntb = 0, i, ans;
scanf("%d", &n);
for(i = 0; i < n; i++){
scanf("%lld", &d);
a += d; b += d;
if(i%2){
if(a > -1){cnta += a + 1; a = -1;}
if(b < 1){cntb += 1 - b; b = 1;}
}else{
if(... |
#include <iostream>
#include <string>
using namespace::std;
long int N, a[100000],A,ans[2];
int min(int x, int y) {
if (x > y)return y;
return x;
}
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
A = 0;
//偶数番目が+
for (int i = 0; i < N; i++) {
A += a[i];
if (A >= 0&&i%2==0) {
ans[... |
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a;
long long solve(int x);
int main() {
cin >> n;
for(int i = 0; i < n; ++i) {
int x;
cin >> x; //項の一つ一つ
a.push_back(x);
}
cout << min(solve(0), solve(1)) << endl;
return 0;
}
long long solve(int x) { //引数は0か1
long ... |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int nw;
int n;cin>>n;
int a[n];for(int i = 0; n > i; i++)cin>>a[i];
//+-+-+-....
long long sh = 0;
nw = 0;
for(int i = 0; n > i; i++){
nw = (long long)nw+a[i];
if(i % 2 == 0)if(nw<=0)sh = (long long)sh+1-nw,nw=1... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll a[100010];
int main() {
ll n;
cin>>n;
for(ll i=0;i<n;i++){
cin>>a[i];
}
ll ans1=0,now1=0;
for(ll i=0;i<n;i++){
now1+=a[i];
if(i%2==0){
if(now1<=0){
ans1+=abs(now1)+1;
now1=1;
}
... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
void count(ll& cnt, ll& sum, ll a, int& sign) {
ll tmp = sum + a;
if (sign > 0 && tmp <= 0)
sum += 1 - sum;
else if (sign < 0 && tmp >= 0)
sum -= 1 + sum;
else
sum = tmp;
sign *= -1... |
#include<bits/stdc++.h>
#define rep(i,a,n) for (int i = a;i < n;i++)
#define per(i,n,a) for (int i = n-1;i >= a;i--)
using namespace std;
long long n,a[100010];
long long c1=0,c2=0,sum=0,c=1;
int main() {
cin >> n;
rep(i, 0, n) {
cin >> a[i];
}
// 奇数番目を正
rep(i, 0, n) {
sum += a[i];... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int N;
cin>>N;
vector<ll> A(N);
rep(i,N) cin>>A[i];
ll ans1=0,ans2=0,sum=0;
rep(i,N){
sum+=A[i];
if(i%2==0&&sum<=0){
ans1+=1-sum;
sum=1;
}
else if(i%2!=0&&sum>=0... |
#include <bits/stdc++.h>
using namespace std;
long f(vector<int>& A, int s) {
long acc = 0, ans = 0;
for (int i = 0; i < A.size(); i++) {
acc += A[i];
if (acc == 0 || s != ((acc < 0) ? -1 : 1)) {
int d = abs(acc) + 1;
acc += s * d;
ans += d;
}
s *= (-1);
}
return ans;
}
int m... |
#include <iostream>
#include <string>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
ll chk(ll a[], int N, bool t)
{
ll total = 0;
ll ops = 0;
for (int i = 0; i < N; i++) {
total += a[i];
if (t == true && (tot... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
ll n, a, s1, s2, c1, c2;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
s1 += a;
s2 += a;
if (i % 2) {
if (s1 <= 0) c1 += 1 - s1, ... |
#include <iostream>
using namespace std;
int main(void){
int n;
cin >> n;
int a[n+1];
int i;
long long ans=0,ans2=0;
a[0] = 0;
for(i=1;i<=n;i++)cin >> a[i];
//1 3 5 7 9を+にする場合
long long b = 0;//bはそれまでの合計値
for(i=1;i<=n;i++){
b += a[i];
if(i%2==1){
if(b>0){
}else{
ans += abs(1-b);
b = 1;
}... |
#include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <string>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
#define P pair<int, int>
int main () {
ll n ;
cin >> n ;
ll A[n] ;
ll a,now1=0,cnt1... |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef uns... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
void solve() {
int n; double p; cin >> n >> p;
p = p / 100.0;
n = (n + 1) / 2;
cout << double(n) / p;
}
// CHECK LIMITS (n <= 10^5)
// CHECK CORNER CASES (n == 1)
int main() {
ios::sync_with_stdio(N... |
#include<bits/stdc++.h>
#define FOR(i, n, m) for(int i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = std::int_fast64_t;
using ld = long double;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 10000000... |
//todo 文字数を少なくする
//#pragma GCC optimize ("-O3")
#include <bits/stdc++.h>
using namespace std;
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
srand((unsigned) clock() + (unsigned) time(NULL));
};
} __i... |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZER... |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }
template<class T, class... U> void assign(V<T>& v, int n, const U&... u... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aajisaka
*/
#include<bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T.... |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
int main(){
int x;double p;cin>>x>>p;p/=100;
if(x%2)printf("%.12lf\n",(x/2)*(1/p)*p+(x/2+1)*(1/p)*(1-p)+1);
else printf("%.12lf\n",(x/2)*(1/p));
} |
#include <stdio.h>
int main(void) {
int x, p;
scanf("%d%d", &x, &p);
printf("%.12f", (double)((x + 1) / 2) * 100.0 / (double)p);
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... |
// #pragma GCC target("avx2") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#inc... |
/* ▄▄▄▄▄▄▄▄▄▄▄ ▄▄▄▄▄▄▄▄▄▄▄▄ ▄ ▄▄▄▄▄▄▄▄▄▄▄ ▄ ▄ ▄▄▄▄▄▄▄▄▄▄▄ ▄▄▄▄▄▄▄▄▄▄▄ ▄▄▄▄▄▄▄▄▄▄
▐░░░░░░░░░░░▌▐░░░░░░░░░░░▌▐░▌ ▐░▌ ▐░░░░░░░░░░░▌▐░▌ ▐░▌ ▐░░░░░░░░░░░▌▐░░░░░░░░░░░▌▐░░░░░░░░░░▌
▐░█▀▀▀▀▀▀▀▀▀ ▐░█▀▀▀▀▀▀▀█░▌▐░▌ ▐░▌ ▐░█▀▀▀▀▀▀▀█░▌▐░▌ ▐░... |
#include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <complex>
#define syos... |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using name... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) st... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
double calc(int x,int p){
return x*100.0/p;
}
int main(){
int x,p;
cin>>x>>p;
double ans=0.0;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef complex<double> point;
#define mapii map<int, int>
#define debug(a) cout << #a << ": " << a << endl
#define debuga1(a, l, r) fto(i, l, r) cout << a[i] << " "; cout << endl
#define fdto(i, r, l) for(int i = (r); i >= (l); --i)
#define fto(i, l... |
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef double lld;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<double> vdl;
typedef vector<vector<lli>> mat;
typedef vector<vdl> mad;
typedef unordered_map<lli,unordered_map<lli,lli>> graph;
typedef complex<double> cmp;
typede... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
... |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;
//typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n... |
#include "iostream"
#include "iomanip"
using namespace std;
long double X;
long double rad;
long double ans;
int main() {
cin >> X >> rad;
if ((long long int)X % 2 == 0) {
for (int i = 0; i < 10000000; i++) {
ans = (ans + X - rad / 100 * ans + (100.0 - rad) / 100 * ans) / 2;
}
}
else {
for (int i = 0; i ... |
#include <bits/stdc++.h>
using ll = long long;
int main()
{
ll x, p;
std::cin >> x >> p;
if (x == 0) { return std::cout << 0 << std::endl, 0; }
std::cout << std::fixed << std::setprecision(15) << (x % 2 == 0 ? 50.0 * x / p : 50.0 * (1 + x) / p) << std::endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>
#include <ca... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... |
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
// stream
//#include <istream>
//#include <sstream>
//#i... |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#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(... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using cd = complex<ld>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int x, p;
cin >> x >> p;
cout.precision(10);
x += x % 2;
cout << fixed << x * 100.0 / (2 * p)... |
// includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
... |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define se second
#define fi first
#define mp make_pair
#define pb push_back
#define all(_v) _v.begin(), _v.end()
const int mod = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
const int N = (int)1e5 + 100;
const int MAXA = (int)3e6;
... |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<... |
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<set>
#include<iomanip>
using namespace std;
double memo[2000]={};
int main(){
int p;
int64_t x;
cin>>x>>p;
double res=0.0;
if(p==100){
int64_t res=0;
if(x%2==1){
... |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i, n) for(int i = 0; i < n; i++... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using uint=unsigned int;
using pcc=pair<char,char>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using pdd=pair<double,double>;
using tuplis=pair<ll,pll>;
template<class T> using pq=priority_queue<T,vector<T>,greater<T>>;... |
// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
... |
#include <iomanip>
#include <iostream>
using namespace std;
int main () {
int n, p; cin >> n >> p;
cout << setprecision(12) << (n%2 ? 100.0 / p * (n/2 + 1) : 100.0 / p * (n/2)) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
const int inf = numeric_limits<int>::max() / 2;
int main(void){
int x,p;
cin >> x >> p;
cout << setprecision(15) << ceil(x/2.0) * (100.0/p) << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll x,p;cin>>x>>p;
if(p==100){
if(x%2) cout<<1+(x-1)/2<<endl;
else cout<<x/2<<endl;
}
else{
bool f=false;
if(x%2){
... |
#include <iostream>
using namespace std;
int main(){
cout.precision(20);
long long x;
long double p,ans;
cin >> x >> p;
ans = (x/2)*100/p;
if(x%2){
ans += 100/p;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int x, percent;
double p;
cin >> x >> percent;
p = percent / 100.0;
double e = ((x + 1) / 2) / p;
cout << setprecision(6) << fixed << e << endl;
} |
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <string>
#include <utility>
#include <set>
#include <stack>
#include <deque>
#include <ctime>
#include <random>
#include <cassert>
#include <cmath>
#include <climits>
#include <queue>
#include <cstring>... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
int x;
double p;
cin >> x >> p;
p /= 100;
double res = 0;
if(x & 1) {
res = 1 + (x - 1.0) / 2 + (1 - p) * (x + 1.0) / 2 / p;
} else {
res = x / 2.0 / p;
}
co... |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<LL, LL> PLL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_ba... |
/*
This Submission is to determine how many 120/240 min const. delivery point there are.
//info
120 req. steps <= 5
*/
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iter... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
double calc(int n, int p) {
return 100.0 * n / p;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int x, p;
cin >> x >> p;
double ans = 0;
if (x % 2 == 0) {
ans = calc(x / 2, p);
} else {
ans ... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int X;
double P;
cin >> X >> P;
if(P == 100) cout << (X + 1) / 2 << endl;
else cout << fixed << setprecision(10) << (X + 1) / 2 / P * 100.0 << endl;
} |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int x, p;
while(cin >> x >> p){
int first = (x+1)/2;
double prob = 0.01 * p;
printf("%.8lf\n", first/prob);
}
}
|
#include<iostream>
using namespace std;
long double p; int n;
int main() {
cin >> n >> p; if (n % 2 == 1)n++; p = 100.0l - p; p /= 100.0l;
long double ans = 1.0l*n / (2 - p * 2);
printf("%.14Lf\n", ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin>>x;
if(x%2==1) x++;
double p;
cin>>p;
p/=100;
cout<<fixed<<setprecision(10);
cout<<x/2/p<<endl;
} |
#include <bits/stdc++.h>
#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )
#define REP(i,n) FOR(i,0,n)
#define YYS(x,arr) for(auto& x:arr)
#define ALL(x) (x).begin(),(x).end()
#define SORT(x) sort( (x).begin(),(x).end() )
#define REVERSE(x) reverse( (x).begin(),(x).end() )
#define UNIQUE(x) (x).erase( uniqu... |
#include<bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define ll long long
#define maxheap priority_queue<int>
#define minheap priority_queue<int,vector<int>,greater<int>>
const double pi = acos(-1.0);
const double eps = 1e-6;
using namespace std;
void solve(){
ll x, p;
cin >> x... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.