code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/priority_queue.hpp>
//#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll a,b,x,y;
cin>>a>>b>>x>>y;
if(a==b)
{
cout<<x<<"\n";
}
else if(a<b)
{
int d=b-a;
int ans=min(d*y+x,d*2*x+x);
cout<<ans<<"\n";
}
else
{
int d=a-b;
int ans=min({(d*y)+x,(d-1)*2*x+x,(d-1)*y+x});
cout<<ans<<"\n";
}
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define co cout
#define ci cin
#define sf1(n) scanf("%lld",&n)
#define sf2(n,m) scanf("%lld %lld",&n,&m);
#define sf3(n,m,p) scanf("%lld %lld %lld",&n,&m,&p);
#define pf1(n) printf("%lld\n",n);
#define mem(a,b) mem... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
t=1;
while(t--)
{
int n;
cin>>n;
vector<int> v;
for(int i=0;i<n;i++)
{
int a;
cin>>a;
v.push_back(a);
}
sort(v.begin(),v.end());
bool ans=... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N,X; cin >> N >> X;
vector<int> a(N);
for( int i=0;i<N;i++ ){
cin >> a[i];
}
vector<int> ans;
int element=0;
for(int i=0;i<N;i++){
if(a[i]!=X) ans.push_back(a[i]);
element++;
}
if(element==0) cout << endl;
for(i... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pb push_back
#define f(i,n) for(int i=0; i<n; ++i)
#define fi(i,st,n) for(int i=st; i<=n; ++i)
#define veci vector<int>
#define vecp vector<pair<int,int> >
#define vecl vector<ll>
int prime[100000+10];
ll lcm(ll ... | #include <bits/stdc++.h>
#define fastIO ios_base::sync_with_stdio(0), cin.tie(NULL)
#define pb push_back
#define all(x) x.begin(), x.end()
#define endl '\n'
#define mkp make_pair
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
constexpr int INF = INT_MAX;
using namespace std;
int m... |
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define endl '\n'
#define mod 1000000007
//#define mod 998244353
#define inf 1e18
#define ff first
#define ss secon... | #include<bits/stdc++.h>
using namespace std;
int n;
const int N = 25;
typedef long long ll;
ll ans = 1e18;
ll a[N];
void dfs(int p,ll s){
if(p == n){
ans = min(ans,s);
return;
}
ll sum = 0;
for(int i=p;i<n;i++){
sum |= a[i];
dfs(i+1,s^sum);
}
}
int main(){
cin >> ... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn=1e3+5;
int a[maxn],b[maxn];
int book1[maxn],book2[maxn];
int main()
{
int n,m;
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
book1[a[i]]=1;
}
for(int i=1;i<=m;i++)
{
scanf("%d",&b[i]);
bo... | //#include<bits/stdc++.h> ----万能头----
#include <iostream>
#include<stdio.h>
#include<string>
#include<algorithm>
#include<string.h>
#include<cstring>
#include<cmath>
#include<queue>
#include<list>
#include<map>
#include<set>
#include<unordered_map>
#include<stack>
#include<time.h>
using namespace std;
const int mod = 1... |
#include<bits/stdc++.h>
using namespace std;
bool check(int num){
int num1 = num, num2 = num;
while(num1 != 0){
int x = num1 % 10;
num1 /= 10;
if(x == 7)
return 0;
}
while(num2 != 0){
int x = num2 % 8;
num2 /= 8;
if(x == 7)
return 0;
}
return 1;
}
int main(){
int N = 0, ans = 0;
cin >> N... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
int n, res = 0;
void f(int i, int x, int cnt = 0) {
if (i == n) {
if (x % 3 == 0) {
res = max(res, cnt);
}
return;
}
f(i + 1, x + s[i] - '0', cnt + 1);
f(i + 1, x, cnt);
}
void solve() {
cin >> s;
n = s.size();
f(0, 0);
cou... |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <string>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
in... | #include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _r... |
/*
* Author: $%U%$
* Time: $%Y%$-$%M%$-$%D%$ $%h%$:$%m%$:$%s%$
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#define ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
constexpr int INF=1e18;
void chmin(int&a,int b){if(a>b)a=b;}
signed main(){
int N; cin>>N;
string S; cin>>S;
vector<vector<int>> dp(N,vector<int>(26,INF));
dp[0][S[0]-'a']=0;
int ans=INF;
for(int i=0;i<N;i++){
for(int j=0;j<26;j++)if(S[i... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF32 2147483647 //2.147483647×10^{9}:32bit整数のinf
int main(){
int H,W;
cin >> H >> W;
vector<int > A(H*W);
int amin=10000;
for(int i=0; i<H*W; i++){
cin >> A.at(i);
amin = min(amin,A.at(i));
}
int a... |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ull> vull;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORDOWN(i, a, b) for (int i = a; i >= b; --i)
#define ff first
#define ss second
... | // Standard I/O
#include <iostream>
#include <sstream>
#include <cstdio>
// Standard Library
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
// Template Class
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
//... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,k,n) for(int i=k;i<n;i++)
#define all(x) x.begin(),x.end()
#define sz(x) (int) x.size()
#define pii pair<int,int>
#define debug(x) cerr << #x << " : " << x << "\n";
#define int ll
/*##... | #include <bits/stdc++.h>
#include <set>
#define ll long long
#include <string>
#define pb push_back
#define mp make_pair
#define pi 3.14159265358979323846
#define mod 1000000007
#define INF 1e18
// typedef pair<ll, ll> pi;
#define rep(i,n) for(i=0;i<n;i++)
#define repk(i,k,n) for(i=k;i<n;i++)
#include <ext/pb_ds/assoc_... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)
int main() {
int n;
string s, t;
cin >> n >> s >> t;
vector <int> vs, vt;
rep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
int pre = 0;
queue<int> stk;
for (int i = 0; i < n; ++i) {
if (s[i] == '1') {
stk.push(i);
}
}
long long ans = 0;
bool ok = true;
for (int i = ... |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pll pair<ll,ll>
#define rep(i,n) for(ll i=0;i<n;i++)
#define mod 1000000007
#define INF 10000000000000000
#define F first
#define S second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pie 3.14159265... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve()
{
int n;
cin>>n;
string s=to_string(n);
string t=s;
reverse(t.begin(),t.end());
if(s==t)
cout<<"Yes\n";
else{
int count=0;
for(int i=0;i<t.length();i++){
if(t[i]=='0')
... |
#include <bits/stdc++.h>
#define DEBUG if(0)
#define lli long long int
#define ldouble long double
using namespace std;
const int maxN = 1e4; int n;
int a[maxN];
int main()
{
while (~scanf("%d", &n))
{
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int ans = 0;
for (int i = 0; i < n; i++)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(int i=0;i<n;i++)
int main() {
ll n;
cin >> n;
ll n2 = n*2, ans = 0;
ll sq = sqrt(n2);
for (ll x = 1; x <= sq; x++) {
if (n2 % x) continue; // 約数ではない
ll y = n2/x;
bool ok = (x+y-1) % 2 == 0 && (x-y+1) % 2 ==... |
/*input
5 4 4
3 2
3 4
4 2
5 2
*/
// assic value of ('0'-'9') is(48 - 57) and (a-z) is (97-122) and (A-Z) is(65-90) and 32 for space
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
t... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+1000;
const int MOD=1e9+7;
int n;
int h[N],e[N],ne[N],idx;
ll w[N],d[N];
ll f[2];
void add(int a,int b,ll c)
{
e[idx]=b;w[idx]=c;ne[idx]=h[a];h[a]=idx++;
}
void dfs(int u,int fa)
{
for(int i=h[u];~i;i=ne[i])
{
int j =e[i];
if(j==... | //#include<math.h>
#include<algorithm>
#include<stdlib.h>
#include<time.h>
#include<stdio.h>
#include<string.h>
#define un unsigned
#define srd srand(time(0))
#define ll long long
#define con continue
#define gtc getchar()
#define ptc putchar
#define dou double
#define eps 0.00000000001
#define opr operator
#define cl(... |
#include<bits/stdc++.h>
using namespace std;
const int mod=3;
const int N=400010;
int f[10][10];
char s[N];
int lucas(int n,int m){
if(n<mod && m<mod) return f[n][m];
else return f[n%mod][m%mod]*lucas(n/mod,m/mod);
}
int getx(char s){
if(s=='R') return 1;
if(s=='W') return 2;
else return 0;
}
int ma... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin>>n;
vector<ll>dp(2,1);
rep(i,n){
string s;
cin>>s;
vector<ll>p(2); swap(dp,p);
rep(j,2)rep(x,2){
int nj = j;
if( s == "AND... |
#include <bits/stdc++.h>
using namespace std;
long long X;
vector<long long> fibo = {0,1};
vector<int> ans = {1};
bitset<100> bs;
int main() {
scanf("%lld", &X);
while (fibo[fibo.size()-2] + fibo[fibo.size()-1] <= X) fibo.push_back(fibo[fibo.size()-2] + fibo[fibo.size()-1]);
int K = fibo.size();
X -= ... | //#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " <<... |
#include<bits/stdc++.h>
#define ll long long int
#define LLI long long int
#define pii pair<ll,ll>
#define F first
#define S second
#define mod 1000000007
using namespace std;
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
int ans=0; int n; cin>>n; vector<pii> arr(n);
for(int i=0;i<n;i++){
... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' ';... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll=long long;
typedef pair<int,int> P;
const int MAX=2000005;
const int MOD=1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = ... | #include <iostream>
using namespace std;
int main() {
int A, B, W;
cin >> A >> B >> W;
W *= 1000;
int m = 1000003;
int M = -1;
for (int i=1; i<=1000000;i++) {
if (A * i <= W && B * i >= W) {
m = min(m, i);
M = max(M, i);}
}
if (m == 1000003 && M == -1) co... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
int n;
ll a[N], b[N], c[N];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%lld", &a[i]);
}
ll mx = 0, mx2 = 0;
for (int i = 0; i < n; ++i) {
mx = max(mx, a[i]);
scanf("%lld", &b[i]);
c[i] =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define REP(i,k,n) for(ll i=k;i<ll(n);i++)
#define all(a) a.begin(),a.end()
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se secon... |
#include<iostream>
#include<string>
#include<cctype>
using namespace std;
int main(){
string a;
int i,j,c=0,f=0;
cin>>a;
for(i=0;i<a.length();i++){
if(isupper(a[i])){
f++;
}
}
if(f==3){
for(i=0;i<a.length();i++){
if((i+1)<a.length()){
if(a[i]!=a[i+1]){
c++;
... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <math.h>
#include <algorithm>
#include <numeric>
using namespace std;
int main() {
long long N;
cin >> N;
vector<int> v;
int i;
for (i = 0; N > 0; i++) {
v.push_back(N % 10);
N /= 10;
}
if (accumulate(v.begin(), v.... |
//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
typedef long long ll; typedef vector<int> ... | #include <algorithm>
#include <array>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typena... |
#include <stdio.h>
int count[10];
int main()
{
long long int a;
scanf("%lld",&a);
int sum = 0,digit = 0;
while(a)
{
sum += (a%10);
digit++;
count[(a%10)%3]++;
a/=10;
}
if(sum%3==0) printf("0");
else if(sum%3==1)
{
if(digit>=2&&count[1]>=1) printf("1");
else if(digit>=3&&count[2]>=2) printf("2");
... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef pair<int,int> PI;
typedef pair<LL,LL> PLL;
typedef unsigned long long ULL;
typedef pair<double,double> PD;
#define FOR(x, b, e) for(int x = b; x<= (e); x++)
#define FORD(x, b, e) for(int x = b;... |
#include<bits/stdc++.h>
typedef long long ll;
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define nep(i,r,l) for(int i=r;i>=l;i--)
void re(int &x){scanf("%d",&x);}
void re(int &x,int &y){scanf("%d %d",&x,&y);}
void re(ll &x){scanf("%lld",&x);}
void re(ll &x,ll &y){scanf("%lld %lld",&x,&y);}
void re(double &x){scanf("%lf",... | #include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define ll long long
#define rep(i,x,y) for(int i=x; i<y; i++)
int n,m;
vector<vector<int>> a;
bool check(int x){
int b[n][n];
//memset(b,0,sizeof b);
//cout<<x<<'\n';
rep(i,0,n){
rep(j,0,n){
b[i][j]=(a[i][j]<=x);
if(i>0)b[i][j]+=b[i-1][j... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
int M=1000000007;
const int N=200005;
signed main(){
int t1=1;
//cin>>t1;
while(t1--){
int n;
cin>>n;
int a[1005]{0};
for(int i=0;i<n;i++) {
int x;
cin>>x;
a[x]++;
}
for(int i=0... | #include<fstream>
#include<iostream>
#include<sstream>
#include<vector>
#include<stack>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
#include<tuple>
#include<iomanip>
#include<bitset>
#include<stdio.h>
#include<set>
#include<array>
using namespace std;
#define rep(i,n) for(int i=0;... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
if (r1 == r2 && c1 == c2) cout << 0 << endl;
else if (r1 + c1 == r2 + c2 || r1 - c1 == r2 - c2 ||
abs(r1 - r2) + abs(c1 - c2) <= 3) {
cout << 1 << endl;
}
else if ((r1 + c1) % 2 == (r2... | #include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <ctime>
#include <bitset>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define fi first
#define se second
#define il inline
#define Ld double
... |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n;
int a[N];
int pos[N];
bool used[N];
int solve() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
pos[--a[i]] = i;
used[i] = false;
}
vector<int> ans;
for (int i = n - 1; i > 0; --i) {
while (po... | #include <iostream>
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define ll long long
#define forn(i,a,n,b) for(ll i=a;i<n;i+=b)
#define forr(i,a,n,b) for(ll i=a;i>=n;i-=b)
#define MOD 1000000007
#define vll vector<ll>
using namespace std;
int main()
{
fas... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
... | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(0)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
type... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <string>
#include <cctype>
#include <map>
#include <queue>
#include <limits>
#include <iomanip>
#include <sstream>
#include <cstdlib>
#include <locale>
#include <bitset>
#include <set>
using namespace std;
const i... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; cin >> N;
vector<ll> A(N), B(N), C(N), D(N), E(N);
REP(i, 0, N) cin >> A[i] >> B[i] >> C[i] >> D[i] >> E[i... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << std::max((a + b), max((b + c), (c + a)));
return 0;
} | //wtrl,everybody hangbeat me
#include<bits/stdc++.h>
/*#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstre... |
/*NEVER GIVE UP*/
/*First try brute force and check if it is in the range of time complexity*/
/*Then try to solve the problem in mathematical form*/
/*Then try to imagine how the final ans will look like*/
/*Write on paper if still not able to get*/
/*Try to think diff. algorithms and data structures that could solve ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005
int GCD(int x, ... |
#include <iostream>
using namespace std;
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <math.h>
int main() {
long long int n;
cin >> n;
vector< long long int > a;
for ( long long int i = 0; i < n; i++ ) {
... | #include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#incl... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) &&... | #include <bits/stdc++.h>
#define REP(i, nn) for (int i = 0; i < (int)nn; i++)
#define REPS(i, ss, nn) for (int i = ss; i < (int)nn; i++)
#define REV(i, ss, nn) for (int i = ss; i >= nn; i--)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
#define all(x) x.begin(),... |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size()) //size() unsigned -> int
#define descsort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
int main(void)
{
int a,b;
c... | //git pull --rebase origin master
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) ... |
#include <bits/stdc++.h>
using namespace std;
#define nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<
#define INF (ll)1e18
#define mod 998244353
#define maxn 500010
ll i, i1, j, k, k1, n, m, res, flag[10], a, b;
string s, t;
int main() {
ios::sync_with_stdio(0);
cin.tie... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define itn int
#define ll long long
#define yes {puts("Yes");}
#define no {puts("No");}
using namespace std;
ll read(){
ll a=0,b=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')b=-1;c=getchar();}
while(c>='0'&&c<='9')a=a*10... |
#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//uniform_int_distribution<int>(1000,10000)(rng)
ll binpow(ll a, ll b)
{
ll res = 1;
while (b > 0)
{
if (b & 1)
res = r... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
using namespace std;
using ll = long long;
struct Graph {
struct Vertex { int n, c, f; };
struct Edge { int i, n, d; };
Graph(int n, int m) : v(n, { -1, -1, 0 }), e(m), n(n), ... |
#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<queue>
#include<stack>
#include<utility>
#include<cstdlib>
#include<cstdio>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<list>
#include<tuple>
usin... | #include <bits/stdc++.h>
using namespace std;
const long nPrime = 1000000007;
//const long nPrime = 998244353;
struct Node{
long iON = 0;
long iOFF = 1;
};
long DFS(int x, const vector<vector<pair<int,long>>> &vviEdge,
vector<Node> &vzNode, vector<int> &viCheck){
viCheck[x] = 1;
long nRe... |
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstring>
#include <regex>
#include <cmath>
#include <algorithm>
#include <vector>
#include <list>
#include <map>
#include <unordered_set>
#include <queue>
#include <unordered_map>
#include <set>
#include <cassert>
#include <climits>
#pragma GCC optimize("O3")
u... | #include <iostream>
#include <string>
constexpr int MAX = 30;
long long dp[MAX + 1][MAX + 1];
std::string find_kth(int A, int B, long long K) {
if (A == 0) {
return std::string(B, 'b');
}
if (B == 0) {
return std::string(A, 'a');
}
if (K <= dp[A - 1][B]) {
return std::string(... |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | #include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define loop(i,n)for(i=0;i<n;i++)
//#define INF 1000000000
using ll = long long int;
typedef pair<ll,ll> pii;
typedef vector<pii>... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
const ll INF = 1001001001;
void chmin(ll& a,ll b){if(a>b)a = b;}
int main(){
int n, m;
cin >> n >> m;
vector<int> g(n)... | #include <bits/stdc++.h>
using namespace std;
#define cfor(n) for(int i = 0; i < n; ++i)
#define forcn(i,n) for(int i = 0; i < n; ++i)
#define forlcn(i,l,n) for(int i = l; i < n; i++)
#define fordn(i,n) for(int i = n - 1; i >= 0; --i)
#define forldn(i,l,n) for(int i = n - 1 - l; i >= 0; i--)
#define forau(i,v) for(au... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
int n;
int a[maxn + 10][maxn + 10];
char s[maxn + 10];
double ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%s", s + 1);
for (int j = 1; j <= n; ++j)
a[i][j] = s[j] == '1';
a[i][i] = 1;
}
for (int k = 1; k <= n; ... | #include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int N=2e5;
priority_queue<int> pq;
int tab[N+10][2];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>tab[n-i+1][0];
for(int i=1;i<=n;i++)
cin>>tab[i][1... |
#include <iostream>
#include <iomanip> //<<setprecision(12), or <<fixed
#include <algorithm>
#include <functional>
#include <map>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pll=pair<ll,ll>;
int main()
{
ll N,M... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MOD = 1000000007;
ll fexp(ll b, ll e){
ll res = 1;
for(;e;e>>=1){
if(e&1... |
#include <bits/stdc++.h>
#define int int64_t
const int N=1e5+9, N2=2e5+9;
using namespace std;
signed main(){
int a, b;
vector<int> vc, vs;
cin >> a >> b;
if (a==b){
for (int i=1; i<=a; i++){
cout << -i << " " << i << " ";
}
}
else if (a>b){
int i=1, mn=0, pl=0;
for (; i<=b; i++){
vc.push_back... | #include <iostream>
#include <set>
#include <iterator>
#include <bitset>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod=1000000007;
ll power(ll x,ll y, ll p)
{
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> pl;
struct edge {
ll to; // 辺の行き先
ll weight; // 辺の重み
edge(ll t, ll w) : to(t), weight(w) { }
};
typedef vector<vector<ll> > Graph;
typedef vector<vector<edge> > WGraph;
#define rep(i, n) for(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main () {
int N;
cin >> N;
ll A[550][550];
for (int i = 0; i < N; i ++) {
for (int j = 0; j < N; j ++) {
cin >> A[i][j];
}
}
ll dif_r[550];
ll dif_c[550];
for (int i = 0; i < N - 1; i ++) {
dif_c[i] = A[0][i + 1] -... |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | //
// Created by 原田 on 2021/04/13.
//
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cs... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int m = 2e5+10;
int k = ceil(log2(m)) + 1;
int sk = (1 << k);
vector<ll> seg(sk);
void update(int s, int e, int at, int l, int r, int p){
if(l<=s && e<=r) seg[at]+=p;
else {
int q = (s+e)>>1;
if(r<=q) update(s,q,at*2+1,l,r,p);
else if(l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
ll n, w, s, t, p;
int main() {
cin >> n >> w;
vector<ll> c(200001, 0);
rep (i, n) {
cin >> s >> t >> p;
c[s] -= p;
c[t] += p;
}
ll d = w;
string ans = "Y... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
int main(void)
{
long long a, b, c;
std::cin >> a >> b >> c;
if (a * a < c * c - b * b)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return (0);
} | #include <bits/stdc++.h>
#define x first
#define y second
#define endll '\n'
#define pb push_back
#define mem(x,a) memset(x,a,sizeof(x))
using namespace std;
const int N=1e5+10,mod=19650827;
const int inf=0x3f3f3f3f;
typedef long long ll;
typedef pair<int,int> pii;
typedef unsigned long long ull;
int n,k,m;
inline int ... |
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<vector>
#include<cstdio>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define SZ(v) ((int)(v).size())
typedef long long LL;
typede... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = (n-1); i >= 0; i--)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
#define popcountll(x) __builtin_popcountll(x)
template <class S>S s... |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int m = 1;
while (n != 0) {
m *= 2;
--n;
}
int a, b;
a = 0; b = 0;
for (int i = 1; i <= m / 2; ++i) {
int c;
cin >> c;
if (b < c) {
a = i;
b = c;
... | #include <bits/stdc++.h>
using namespace std;
template<class T>void chmin(T& a,T b){
if(a>b){
a=b;
}
}
typedef std::pair<int,int> p;
#define rep(i,n) for(int i=0;i<n;++i)
int main(){
const int INF=1001001001;
int N;
cin>>N;
int k=1<<(N-1);
vector<int> a(k),b(k);
rep(i,k)cin>>a[i];
rep(i,... |
#include <bits/stdc++.h>
#define DEBUG if(0)
#define lli long long int
#define ldouble long double
using namespace std;
const int maxN = 2e3; int n, m;
char a[maxN][maxN];
int getPoints(int i, int j, bool taka)
{
if (!taka)
return a[i][j] == '+' ? 1 : -1;
return a[i][j] == '-' ? 1 : -1;
}
int memo[maxN][maxN]... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set... |
#include<cstdio>
#define N 100010
#define mo 1000000007
#define ll long long
#define fo(x,a,b) for(int x=(a);x<=(b);x++)
#define fd(x,a,b) for(int x=(a);x>=(b);x--)
using namespace std;
int n;
ll f[N][2],num[N][2],a[N];
inline int read() {
int x=0,f=0; char c=getchar();
while (c<'0'||c>'9') f=(c=='-')?1:f,c=getchar(... | #include <bits/stdc++.h>
using namespace std;
#define Gene template< class
#define Rics printer& operator,
Gene c> struct rge{c b, e;};
Gene c> rge<c> range(c i, c j){ return {i, j};}
struct printer{
~printer(){cerr<<endl;}
Gene c >Rics(c x){ cerr<<boolalpha<<x; return *this;}
Rics(string x){cerr<<x;return... |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
long long A, B;
cin>>A>>B;
vector<int> F;
for (int f=2; f<=72; f++)
{
bool ok = true;
for (int i=2; i<f; i++)
if (f%i==0)
ok = false;
if (ok)
F.push_back(f);
... | #include <algorithm>
#include <iostream>
#include <deque>
#include <climits>
#include <cmath>
#include <cstring>
#include <map>
#include <set>
#include <vector>
// #include <atcoder/convolution>
using namespace std;
using ll = long long;
#define len(s) static_cast<ll>(s.size())
#define rep(i, n) for (ll i = 0; i < n;... |
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
if(b == 0)
return 1;
if(b == 1)
return a;
long long x = power(a, b / 2);
x *= x;
if(b & 1)
x *= a;
return x;
}
int main() {
long long n;
cin >> n;
long long a = 1;
... | #include<bits/stdc++.h>
using namespace std;
#define For(i,l,r) for(int i=l;i<=r;i++)
int read(){
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int a[200001],res=0,n;
bool vis[200001];
void calc(int x){
if(x==... |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
template<typename T>
long long modpow(const T n,const T p,const T mod);
template<typename T>
long long modinv(const T n,const T mod);
template<typename T>
bool chmax(T &a,const T &b);
template<typename T>
bool chmin(T &a,const T &b);
long long inf=10000... | #include <bits/stdc++.h>
#define LL_INFI 0x3f3f3f3f
using namespace std;
long long ** creat2dArray(int N);
void delete2dArray(long long ** dp, int N);
int main ()
{
int N;
scanf("%d", &N);
int X[N + 1];
int Y[N + 1];
int Z[N + 1];
for(int i = 1; i <= N; i++)
scanf("%d %d %d", &X[i], &... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
string S;
cin >> S;
stack<char> st;
int si = S.size();
rep(i,si){
switch(S[i]){
case '6':S[i] = '9';
break;
case '9':S[i] = '6';
break;
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
string s;
cin>>s;
reverse(s.begin(),s.end());
int i;
for(i=0;i<s.size();i++)
{
if(s[i]=='0')
s[i]='0';
else if(s[i]=='1')
s[i]='1';
else if(s[i]=='6')
s[i]='9... |
//Ô¸Éñ zhoukangyang Ö¸ÒýÎÒ¡£
#include <stdio.h>
#include <string.h>
#include <queue>
#define int long long
inline int read()
{
int num=0,f=1;char c=getchar();
while(c<48||c>57){if(c=='-')f=-1;c=getchar();}
while(c>47&&c<58)num=(num<<3)+(num<<1)+(c^48),c=getchar();
return num*f;
}
inline int min(int a,i... | /* made by amunduzbaev */
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
using namespace std;
//~ using namespace __gnu_pbds;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#def... |
#include <cstdio>
#include <algorithm>
using namespace std;
int n,a[5010][11],f[5010][5][41];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=0;j<5;j++)
scanf("%d",&a[i][j]);
f[0][0][0]=1e9;
for(int i=1;i<=n;i++)
for(int j=0;j<=3;j++)
for(int k=0;k<32;k++)
{
f[i][j][k]=max(f[i][j][k],f... | #include <cassert>
#include <limits>
/*
find the maximum integer value that satisfies the given condition,
where if x satisfies it, every y (< x) satisfies it
template parameters:
Integer: an integer type
Function: a function object type
parameters:
a: the lower bound of the possible value
b: the upper bound of the ... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long t, N;
cin >> t >> N;
long long a = 0;
long long b = 0;
vector<int> v;
while( a < 1000 ) {
a++;
long long c = (100 + t) * a / 100;
if( c - b > 1 ) {
v.push_back( a );
if( a == 100 ) break;
}
b = c;
}
int n = v.size();
a = N /... | #include <bits/stdc++.h>
#include <unordered_set>
#define f(i, a, b) for (int i = a; i < b; i++)
#define rf(i, a, b) for (int i = a; i > b; i--)
#define lf(i, a, b) for (long long i = a; i < b; i++)
#define sq(a) (a)*(a)
#define cube(a) (a)*(a)*(a)
#define pb push_back
#define ppb pop_back
#define LB lower_bound
#defi... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
int sum = 0;
cin >> N >> K;
for(int i = 1; i <= N; i++){
for(int j = 1; j <= K; j++){
sum += (i * 100 + j);
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define mod 1000000007
#define string_mod 2549536629329_base_255
#define pb push_back
#define F first
#define S second
#define ff first
#defin... |
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define rep(i, n) FOR(i,0,n)
#define irep(i, n) IFOR(i,0,n)
#define all(v) begin(v), end(v)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P ... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#de... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S, T;
cin >> S >> T;
int counts = 0, countt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '0') counts++;
if (T[i] == '0') countt++;
}
if (counts != countt) {
cout << -1 << endl;
return 0;
}
int... |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define LL long long
#define READ freopen("in.txt","r",stdin)
#define WRITE freopen("out.txt","w",stdout)
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define m... | //#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define bit(n) (1LL<<(n))
#define FIX(... |
#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <limits>
#include <string>
#include <algorithm>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include "math.h"
#include "assert.h"
using namespace std;
#define ll long l... | #include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(),a.end()
#define SET(a,b) memset(a,b,sizeof(a))
#define off ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef pair<int,int> II;
typ... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #include<bits/stdc++.h>
using namespace std;
const int N=20;
int g[N][N];
int dp[1<<N];
bool ok[1<<N];
int n,m;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int x,y;
scanf("%d%d",&x,&y);
x--,y--;
g[x][y]=g[y][x]=1;
}
for(int i=0;i<(1<<n);i++)
{
vector<int> e;
for(int j=0;j<n;j++)
{
i... |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long int
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll t=1;
//cin>>t;
while(t--)
{
double n;
cin>>n;
n*=1.08;
n=(ll)n;
if(n>20... |
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define pb push_back
#define F first
#define S second
#define ins insert
#define mp ma... | #include <bits/stdc++.h>
#include <variant>
#define rep2(i,k,n) for(i64 i=(i64)(k);i<(i64)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) begin(x),end(x)
#ifdef ENV_LOCAL
#define dump if (1) cerr
#else
#define dump if (0) cerr
#endif
using namespace std;
using namespace std::string_literals;
using i32 = int32... |
#include<bits/stdc++.h>
using namespace std;
const int N=500005;
typedef long long ll;
int n,p[N],q[N],a[N],b[N],i,id[N];
bool cmp(int x,int y)
{
return b[x]>b[y];
}
struct str{
int u,v;
};
vector<str> g;
int main()
{
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&a[i]);
for(i=1;i<=n;++i)
{
scanf("%d",&b[i]);
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
#define ll long lo... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
// head
const int N = 3e5 + 5;
int a[N], n;
int main(void){
scanf("%d", &n);
ll sum1 = 0, sum2 = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum1 += a[i];
sum2 += a[i] * a[i];
}
ll ans = (n - 1) * sum2 - (sum1 * sum1 - sum2);
pri... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
map<long long,long long> height;
long long num =0;
height[0]++;
unsigned long long count =0;
for(int i=0;i<n;i++){
if(i%2==0) {
num += a[i];... |
#include<bits/stdc++.h>
#define MAXN 300005
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
int n;
ll a[MAXN],maxl[MAXN],sum[MAXN],val[MAXN];
ll f(ll len){return maxl[len] * len + sum[len] + val[len];}
int main(){
cin>>n;for(int i = 1 ; i <= n ; i++)cin>>a[i];
maxl[0] = -INF;
for(int i = 1 ; i <... | #include "bits/stdc++.h"
using namespace std;
#define ffor(n) for(int i = 0; i < n; i++)
#define fffor(n) for(int j = 0; j < n; j++)
#define uwu ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize("Ofast")
const int INF = 1e9 + 7;
const long long INF2 = 1e17;
int main(void) {
uwu
// when adding som... |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <stack>
#include <map>
#include <sstream>
#include <cstring>
#include <set>
#include <cctype>
#include <list>
#include <bitset>
#define IO \
ios::sync_with_... | //Bismillahirrahmanirrahim
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define int long long
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_ba... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
//first second
//memset(dp, -1, sizeof dp);
//string binary =bitset<8>(n).to_string();
//(mod)->(10*mod+currentmodulo)%m
struct keycompare {
bool operator()(const pair<ll, ll>& v, const ll& k) {
return (v.first < k... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#define LL long long
using namespace std;
const int N = 55;
int t;
LL n, m;
LL qp(LL a, LL b)
{
LL res = 1;
while (b)
{
if (b & 1) res = res * a % (m * m);
b >>= 1;
a = a * a % (m * m);
}
return ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H, W; cin >> H >> W;
int A[100][100];
int m=1000;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >> A[i][j];
m=min(m, A[i][j]);
}
}
int r=0;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
r+=(A[i][j]-m);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
using vi = vector<int>;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int h,w; cin >> h >>w;
vector<vector<int> > a(h,vector<int>(w));
int mn = 1000;
int sum = 0;
... |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
using namespace std;
int main() {
long int N;
cin >> N;
set<long int> re;
for (int b = 2; b < int(sqrt(N)) + 2; ++b) {
for (int e = 2; e < 40; ++e) {
long int v = static_cast<long int>... | #include <bits/stdc++.h>
using namespace std;
#define N 1000005
#define MAX 1e18
vector<long int> powers;
set<long int> squares;
set<long int> s;
void powersPrecomputation()
{
for (long int i = 2; i < N; i++)
{
squares.insert(i * i);
if (squares.find(i) != squares.end())
continue;
long int... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL INF = 0x3f3f3f3f;
void prepare() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
vector<LL> arr;
int N, Q;
LL K;
map<LL, LL> m;
LL f() {
if(arr[0]>K) {
return K;
}
LL l = 0, r = arr.size();
while... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(n);i++)
int main() {
ll N,Q;
cin >> N>>Q;
vector<ll> A,B;
ll last=0,last_b=0;
rep(i,N){
ll temp;
cin>>temp;
A.push_back(temp);
B.push_back(last_b+temp-last-1);
la... |
#include <bits/stdc++.h>
#include<iostream>
#include<string.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
// helping defines
#define ll long long int
#define ull unsigned long long
#define max3(a, b... | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long n,k;
cin >> n >> k;
long long a = n;
for (long long i=0; i<k; i++) {
int big,sma;
string aa;
aa = to_string(a);
sort(aa.begin(), a... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define repr(i... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
/*--------------------------Containers------------------------*/
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector < int > vi;
typedef vector... |
#include <bits/stdc++.h>
using namespace std;
#define tani_nachi_ke ios_base::sync_with_stdio(false); cin.tie(NULL);
#define M_PI 3.14159265358979323846
#define data data_
#define ff first
#define ss second
#define pb push_back
#define int long long
int32_t main()
{
tani_nachi_ke
int x;
cin >> x;... | #include <bits/stdc++.h>
int main(){
int x;
std::cin >>x;
std::cout << std::max({x,0}) << std::endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define debug(x) cerr << "L" << __LINE__ << ": " << #x << " = " << (x) << endl
#define debugvec(v) rep(i, v.size()) cerr << "L" << __LINE__ << ": " << #v << "[" << i << "] = " << v[i] << endl;
#define debugvec2(v) ce... | #include <bits/stdc++.h>
#define endl "\n"
#define int long long
#define debug(statement) \
if (debugging) \
cerr << statement << endl
#define debug_variable(var) \
if (debugging) \
cerr << (#var) << ": " << var << endl
const bool debugging = 1;
using namespace std;
template <class T>... |
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
typedef int64_t ll;
typedef long double ld;
typedef unsigned long long ULL;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
void read(vector<int> &a) {for (auto &x : a)cin >> x;}
void read... | #include <bits/stdc++.h>
using namespace std;
char str[500005];
deque<char> dq;
int main() {
scanf(" %s", &str);
bool b = true;
for (int i = 0; str[i]; ++i) {
if (str[i] == 'R') b = !b;
else if (b) {
if (!dq.empty() && str[i] == dq.back()) dq.pop_back();
else dq.pus... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define ll long long
#define FOR(i, a, b) for(ll i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (ll i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).... | #pragma GCC optimize("Ofast")
#if 1
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i,n) for(LL i=0;i<(n);i++)
int main()
{
LL n;
LL min = -1;
LL a, p, x;
LL remaind;
cin >> n;
rep(i,n){
cin >> a >> p >> x;
remaind = x - a;
if(remaind > 0){
if(min == -1 || min > p)... | // auther : chotathanos
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vb> vvb;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef vector< pair<int, int> > vpii;
#define MOD 10000... |
#include <bits/stdc++.h>
using namespace std;
#define llong long long
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#ifdef testing/*{{{*/
mt19937 rng(177013);
#else
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
#endif
... | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
//using namespace atcoder;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
typedef vector<vector<int> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
temp... |
#include<bits/stdc++.h>
#include <iterator>
#include <iostream>
#include <numeric>
#include <math.h>
#define ll long long
#define ull long
#define mpa make_pair
#define pb push_back
#define ff first
#define pii pair<ll,ll>
#define dd double
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define boo... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/*............................................................................*/
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_n... |
#include <iostream>
using namespace std;
int main() {
int V, T, S, D;
cin >> V >> T >> S >> D;
bool hit = (D < V * T || V * S < D) ? true : false;
if (hit) cout << "Yes" << endl;
else cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for(int i = (int)(a); i <= (int)(b); ++i)
#define FORR(i, a, b) for(int i = (int)(a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()
using ll = long long;
using VI = vector<int>;
using VL ... |
#define nl "\n"
#define ll long long
#define ull unsigned long long
#define pb push_back
#define SIZE(a) (int)a.size()
#define SORT(v) sort(v.begin(),v.end())
#define RSORT(v) sort(v.rbegin(),v.rend())
#define REV(v) ... | #include "bits/stdc++.h"
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define rep(i, b) for (ll i = 0; i < b; i++)
#define fr(i ,a, b) for (ll i = a; i < b; i++)
#define rev(i, b) for (ll i = b-1; i >=0 ; i--)
#define in(a, n) rep(i, n) cin >> a[i];
#define outp... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rrep(i,n) for (ll i = n - 1; i >= 0;i--)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
// int num = atoi(string.c_str()); 文字列の整数変... | #include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
typedef long long ll;
char s1[105],s2[105];
bool cmp(int a,int b)
{
return a>b;
}
void numTstr(int fl,ll num)
{
if(fl==1)
{
sprintf(s1,"%lld",num);
int len=strlen(s1);
sort(s1,s1+len,cmp);
}
else if(fl==2)
{
spr... |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
ll INF = 1000000000000000;
struct segment_tree{
int n; vector<ll> seg;
segment_tree(vector<ll> v){
n = v.size(); seg.resize(2*n);
for(int i=0;i<n;i++) seg[i + n] = v[i];
for(int i=n - 1;i>0;i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
int pw(int c)
{
int res = 1;
if (c == 0)
return 1;
while (c-- > 0)
res *= 10;
return res;
}
int sc(vector<int> &st, int last)
{
int res = 0;
st[last]++;
for (int i = 1; i < 10; i++)
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
int n=s.size();
for(int i=0;i<n;i++){
if(i<(n/2)){
char temp =s[i];
s[i]=s[n-1-i];
s[n-1-i]=temp;
}
if(s[i]=='6'){
s[i]='9'... |
/*************************************Ninja-nick-s*****************************************/
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;typedef long double ld;typedef pair<int,int> pii;
#define F first
#define S second
#define PB push... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
// -2 -3
if(a > b){
if(c&1)
puts(">");
else{
b = abs(b);
a = abs(a);
if(a > b)
puts(">");
else if(a < b)
puts("<");
else
puts("=");
}
}
else if(a < b){
if(c&1)
puts("<");
... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<math.h>
#include<iomanip>
#include<string>
#include<cassert>
#include<complex>
#include<bits/stdc++.h>
#include<numeric>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#define rep(s,i,n) for(int i = s;i < n;i++)
us... | //GIVE ME AC!!!!!!!!!!!!!!!!!
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define ll long long
#define floatset() fixed<<setprecision(15)
#define all(n) n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()
#define rep(i, s, n) for (ll i = s; i < (ll... |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<tuple<int, int, int>> order;
vector<tuple<int, int, int, int>> bestans;
void input() {
cin >> n;
order.resize(n);
for (auto& [x, y, r] : order) cin >> x >> y >> r;
}
void init() {
bestans.resize(n);
}
void simulate() {
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, Q;
cin >> N >> Q;
vector<int> C(N);
for (int i = 0; i < N; i++){
cin >> C[i];
}
vector<map<int, int>> mp(N);
vector<int> p(N);
vector<vector<int>> g(N);
for (int i = 0; i < N; i++){
p[i] = i;
mp[i][C[i]] = 1;
g[i].push_ba... |
#include <iostream>
#include <vector>
#include <numeric>
#include <set>
int main()
{
int N;
std::cin >> N;
std::vector<long long> vs(2 * N);
for (auto& v : vs) { std::cin >> v; }
std::multiset<long long> pool;
long long aoki = 0;
for (int i = 0; i < N; i++)
{
pool.insert(vs[N - 1-i]);
pool.ins... | #include<bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
typedef long long ll;
cs int N = 4e5 + 5;
int n, a[N], p[N], c[N];
ll ans;
#define mid ((l + r) >> 1)
cs int M = N << 2;
int mn[M], ta[M];
void up(int x) {
mn[x] = min(mn[x << 1], mn[x << 1 | 1]) + ta[x];
}
void build(int x, int l, i... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
int x=0;
bool flag=1;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')
flag=0;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return (flag?x:~(x-1));
... | #include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a),i##END=(b);i<=i##END;i++)
#define Rof(i,b,a) for(int i=(b),i##END=(a);i>=i##END;i--)
#define go(u) for(int i=head[u];i;i=nxt[i])
using namespace std;
inline int read(){
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar()... |
#include <stdio.h>
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <string.h>
#include <cstring>
#include <queue>
#include <map>
using namespace std;
#pragma warning(disable:4996)
#define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define EPS 1... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<int> digs;
while (n) {
digs.push_back(n % 10);
n /= 10;
}
vector<int> rec(3);
int s = 0;
for (auto x : digs) rec[x % 3] ++, s += x;
s %= 3;
if (s == 0) cout << 0;
else if (s == 1) {
if (rec[1] > 0... |
// Artur Kraska, II UWr
#include <bits/stdc++.h>
#define forr(i, n) for(int i=0; i<n; i++)
#define FOREACH(iter, coll) for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll) for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,P... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
int main()
{
ll B,C;
cin >> B >> C;
/*
ll L = B - (C-1)/2;
ll R = B;
ll ans = 0;
if ((L < 0 && R > 0) || (L < 0 && R < 0))
{
ans = 2 * max(abs(L-R));
}
else
{
ans = 2 *... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, n, a) for (int i = n; i >= a; --i)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
t... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <stack>
#include <random>
#include <i... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int64_t> a(n),maxA(n);
for(int i = 0;i < n;i++)cin >> a.at(i);
int64_t ma = 0;
for(int i = 0;i < n;i++){
ma = max(ma,a.at(i));
maxA.at(i) = ma;
}
int64_t ans = 0;
a.at(0) += a.at(... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main()
{
long N;
cin >> N;
long result = 0;
long A[N];
long sum = 0;
for (long i = 0; i < N; i++) {
cin >> A[i];
result += N * A[i] * A[i];
sum += A[i];
}
cout << result - ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.