code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<iostream>
#include<stdio.h>
#include<iomanip>
using namespace std;
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<cmath>
long long int pw(int x,int n)
{
long long int res=1;
while(n>0)
{
if(n%2==0)
{
n=n/2;
x=x*x;
}
... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <array>
//#include <atcoder/all>
using namespace std;
//using namespace at... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define S second
#define F first
#define f(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int,int>
const int MOD = 1e9+7;
const int N = 2005... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
using Graph = vector<vector<int>>;
ll mod = 1000000007;
int main() {
ll N; cin >> N;
ll dp[N+1][N+1];
ll sum[N+1]; sum[0] = 0;
rep(i,N){
... | #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>
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define endl '\n'
string s[100005];
int dist(string& a, string& b) {
int ret = 0;
for (size_t i = 0; i < a.length(); i++) {
if (a[i] != b[i]) ret++;
}
return ret;
}
int main() {
int n, m;
cin >> n >> m;
for (int i... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
long long odd = 0, even = 0;
for(int i = 0; i < n; ++i){
int count = 0;
string s; cin >> s;
for(int j = 0; j < m; ++j){
if(s[j] == '1'){count += 1;}
}
if(count%2 == 1){odd += 1;}
else{even += 1;}
}
... |
#include <math.h>
#include <assert.h>
#include <algorithm>
#include <set>
#include <iostream>
#include <vector>
#include <iomanip>
#include <queue>
#include <map>
#include <string>
#include <cstring>
#include <functional>
#include <stack>
#include <array>
#include <random>
#include <chrono>
#include <climits>
#include ... | #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... |
/**
* created: 09/01/2021, 14:06:07
**/
#include <bits/stdc++.h>
using namespace std;
const int max_n = 600666, inf = 1000111222;
namespace max_flow {
const int max_v = max_n, inf = 1000111222;
struct edge {
int to, residual_capacity;
edge(int to, int residual_capacity): to(to), residual_capacity(resid... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<string,int> psi;
typedef pair<int,string> pis;
typedef array<int,2> aii;
typedef array<int,3> aiii;
typedef array<int,4> aiiii;
typedef unsigned long long ull;
typedef long long int ll;
typedef array<ll,2> all;
typedef array<ll,3> all... |
#include <bits/stdc++.h>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007
//#define lld long double
#define mii map<int, int>
#define mci map<char, int>
#define msi map<string, int>
#define pii pair<int, int>
#define ff first
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
int v[] = {0,6,5,4,3,2,1};
cout << v[a] + v[b] + v[c] << "\n";
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int N;
vector<int>to[200005];
vector<set<int>>st(100);
vector<vector<bool>> pass(100, vector<bool>(100));
void dfs(int v, int i, int p = -1) {
for (int e : to[v]) {
if (p == e) {
continue;
}
if (pass[i][e]) {
continue;
}
pass[i][e] = true;
st[i].insert(e)... | #include <bits/stdc++.h>
#define fi first
#define se second
#define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,size,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define IT iterator
#define V vector
#define TP template <class o>
#define TPP... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 998244353;
int solve(vector<ll> abc)
{
ll ans = 1;
rep(i, 3)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[4];
cin>>a[0]>>a[1]>>a[2]>>a[3];
sort(a, a+4);
cout<<a[0];
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#def... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int _ = 1;
ll dp[200001][2];
map<ll, ll>mn;
map<ll, ll>mx;
vector<int>colors;
ll solve(int i , int left){
ll &ret = dp[i][left];
if(~ret)return ret;
ret = 1e16;
ll inter = abs(mx[colors[i]] - mn[colors[i]]);
if(i == colors.size()... |
#include<iostream>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inline bool chmax... | #include <iostream>
#include <vector>
using namespace std;
int mapn[1500][1500];
int a, b, c, d;
int h, w, n, m;
int ans;
int main() {
cin >> h >> w >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> a >> b;
mapn[a - 1][b - 1] = 1;
}
for (int i = 0; i < m; ++i) {
cin >> c >> d;
mapn[c - 1][d - 1... |
#include<bits/stdc++.h>
#include<cmath>
#define SZ(x) ((int)x.size())
#include<vector>
#include<set>
#include<map>
#define ll long long
#define lli long long int
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#include<string>
#include<cctype>
#define F first
#define S second
#include<queue>
#include <sstre... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define test() ll t;cin>>t;for(ll test = 1;test<=t;test++)
#define f first
#define s sec... |
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
int n;
int g[21];
bool isO... | #include <bits/stdc++.h>
#include <vector>
#include<math.h>
#include<string.h>
using namespace std;
#define MAX 6000005
#define MOD 1000000007
#define SMOD 998244353
#define GMAX 19
#define INF 2000000000000000000
#define EPS 0.0000000001
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#include <ext/pb_ds... |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef long int li;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test ll t; cin >> t; while(t--)
const long long int dx[4] = {0, 0, -1, 1}, dy[4] = {1, -1, 0, 0};
... |
#include <bits/stdc++.h>
// #include <atcoder/all>
#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;
// using namespace atcoder;
typedef long long int ll;
typedef pair<int, int> P;
#define MAX_N 2000... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, m, ops[2000][2000][4];
string s[2000];
int modpow(int a, int b){
if(!b) return 1;
long long res = modpow(a, b / 2);
res = (res * res) % mod;
if(b % 2) res = (res * a) % mod;
return res;
}
int main(){
ios_base::sync_with_stdio(false);... |
// give up
#include <bitset>
#include <cassert>
#include <iostream>
#include <iomanip>
#include <list>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
// alias, using declaration
using llint = long long; using ldouble = long double;
template <class T = llint> u... | #include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>
#define ll long long
#define ld long double
#define eps 1e-8
#define MOD 1000000007
... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define s(x) x.size()
#define endl '\n'
#define r(n) ll n; cin>>n;
#define vl vector<ll>
#define all(x) (x).begin(),(x).end()
#define fk(i,start,end) for(ll i=start;i<ll(end);i++)
typedef long long int ll;
const ll MOD = 1e9 + 7;
s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
int sam =0;
int i=1;
while(sam < N){
sam += i;
i++;
}
cout<< i-1 <<endl;
}
|
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define int ll
#define each(i, a) for (auto &&i : (a))
using ll = long long;
using ld = long double;
using vi = v... | #include <bits/stdc++.h>
using namespace std;
const int N = 105,M = 100005;
int f[N][M];//f[i][j] = 从1~i种中选，且总和正好为j的方案是否存在
int n;
int times[N];//烹饪时间
int main()
{
ios::sync_with_stdio(0);
cin>>n;
int tot_time = 0;//总时间
for(int i=1;i<=n;i++) cin>>times[i],tot_time+=times[i];
for(int i=1;i<=... |
#include<stdio.h>
int main()
{
int min,i,a[4];
for(i=0;i<4;i++)
{
scanf("%d",&a[i]);
}
min=a[0];
for(i=1;i<4;i++)
{
if(a[i]<min)
min=a[i];
}
printf("%d",min);
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
char a,b,c;
scanf("%c %c %c",&a,&b,&c);
if((a==b)&&(b==c)&&(a==c))
{
if((a>='A'&&a<='Z')&&(b>='A'&&b<='Z')&&(c>='A'&&c<='Z'))
{
printf("Won\n");
}
}
else
{
printf("Lost\n");
}
return... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
struct unionfind{
vector<int> parent;
vector<int> rank;
vector<int> size;
unionfind (int N) {
parent = vector<int>(N);
iota(parent.begin(), parent.end(), 0);
rank = vector<int>(N, 0);
... | #include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m)cin >>a[i];
sort(a.begin(),... |
#include <bits/extc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define ALL(x) x.begin(),x.end()
#define MOD (ll)1000000007
signed main() {
ll n;
cin >> n;
cout << n - 1;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int N;
cin>>N;
int w;
w=N-1;
cout<<w<<endl;
return 0;
}
|
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<... | #include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a+b>=15&&b>=8)cout<<1;
else if(a+b>=10&&b>=3)cout<<2;
else if(a+b>=3)cout<<3;
else cout<<4;
return 0;
} | //by azidoazideazide(C2N14)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
#define fi first
#define se second
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define FORE(i, a, b) for (ll i = ... |
#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = l; i < (int)(r); i++)
#define all(vec) vec.begin(), vec.end()
#define allr(vec) vec.rbegin(), vec.rend()
using namespace std;
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << b - c << endl;;
} |
#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 int long long int
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
//const int nax = 1e6+5;... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define f first
#define s second
#define mk make_pair
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<ll, ll>;
using Vec = vector<ll>;
using VecP = vector<P>;
template <class T>
using Vec2 = vector<vector<T>>;
#define REP(i, m, n) for(ll i = (m); i < (n); ++i)
#define REPN(i, m, n) for(ll i = (m); i <= (n); ++i)
#de... | #include<bits/stdc++.h>
using namespace std;
#define fl(n) for(long long int i=0;i<n;i++)
#define sz(a) int((a).size())
#define tr(c,i) for(auto i = (c).begin(); i != (c).end(); i++)
#define trr(c,i) for(auto i = (c).rbegin(); i != (c).rend(); i++)
#define present(c,x) (... |
#include <bits/stdc++.h>
using namespace std;
int tt(int n){
if(n<1)
return 0;
return n+tt(n-1);
}
int main()
{
int n,k;
cin>>n>>k;
int s=0;
int a=100;
int r=tt(k);
while(n--){
s=s+( a*k) + r;
a=a+100;
}
cout<<s;
return 0;
} | //int a = s - '0'; 文字から数字
//小文字から大文字
//transform(a.begin(), a.end(), a.begin(), ::toupper);
//map 全探索
//auto begin = p.begin(), end = p.end();
//for (auto it = begin; it != end; it++) {}
//mapのキー：it->first mapのバリュー：it->second
//大文字判定 isupper(文字) 小文字判定 islower(文字)
//do{}while(next_permutation(ALL(配列)))
//小文字に対応する文字コード：S... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf32 = (1 << 30) - 1;
constexpr ll inf64 = (1LL << 62) - 1LL;
constexpr int mod = 1e9 + 7;
#define rep(i,n) for(int i=0; i<(n); ++i)
#define all(x) x.begin(),x.end()
int main(){
//cout << fixed << setprecision(10);
int n, m; cin >>... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <iomanip>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <chrono>
#include <random>
#define rep(... |
#include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pii pair<LL, LL>
int cnt;
LL B, C;
pii a[5];
int main()
{
scanf("%lld %lld", &B, &C);
a[++ cnt] = pii(B, B + (C - 2) / 2);
a[++ cnt] = pii(-B, -B + (C - 1) / 2);
a[++ cnt] = pii(B - C / 2, B);
a[++ cnt] = pii(-B - (C - 1) / 2, -B);
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1e18;
int main() {
ll n, m, i, j, k;
ll H, W;
cin >> H >> W;
ll N, M;
cin >> N >> M;
vector<ll> A(N), B(N), C(M), D(M);
for(i = 0; i < N; i++) {
cin >> A[i] >> B[i];
... | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define inf LLONG_MAX>>2
#define MAX 1000000
#define mod 1000000007
#define pb push_back
#define f(i,a,n,x) for ((i)=(a);(i)<(n);(i)+=(x))
#define fd(i,a,n,x) for ((i)=(a);(i)>=(n);(i)-=(x))
#define fi first
#define se second
#define mk make_pair
#... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ud unsigned int
#define ll long long
#define ull unsigned long long
#define MAX_INF 0x3f
#define MAX_INF_VAL 0x3f3f3f3f
#define MAX_INF_VAL_LL 0x3f3f3f3f3f3f3f3f
//#define pi 3.141592653589
#define eps 1e-9
#define F(x) ((x)/3+((x)%3==1?0:tb))
#define G(x) ... | #include <bits/stdc++.h>
using namespace std;
int _ = (cout << fixed << setprecision(9), cin.tie(0), ios::sync_with_stdio(0));
using Int = long long;
void solve(int N, string S, vector<int> A) {
int k = 1e9;
for (int i = 0; i < N; i++) {
k = min(k, abs(A[i + 1] - A[i]));
}
vector<vector<int>> B(... |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld=long double;
using vin=vector<int>;
using v... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define ALL(v) v.begin(),v.end()
#define sz(v) (ll)v.size()
const ll INF = 1e18;
// const ll MOD = 998244353;
// const ll MOD = 1000000007;
ll dx[] = {1, 0, -1, 0};
ll dy[] = {0, 1, 0,... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) c... |
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <dequ... | /*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")
//*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int ,int > pii;
mt19937 rng(chrono::steady_clock::now().time_sinc... |
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
#define WT int T=read();while(T--)
#define NO puts("NO");
#define YES puts("YES");
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c... | #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define NUM_CAN 400
struct state
{
int x;
int y;
int score;
string path;
set<int> used;
};
bool operator< (const state &state1, const state &state2... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define pb push_back
#define eb emplace_back
#define sz size
#define ALL(v) v.begin(),v.end()
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using si = set<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
template<typename T> using minpq = priority_queue <T,vector... |
// Jai Shree Ram
#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;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ook order_of_key
#define fb... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s[3];
cin >>s[0];
cin>>s[1];
cin>>s[2];
int n[3];
n[0]=s[0].size();n[1]=s[1].size();n[2]=s[2].size();
set<char> st;
for( int k = 0; k < 3; k++ ) {
for( int i = 0; i < n[k]; i++ ) {
st.insert( s[k][i] );
}
}
int st_s = st.size();
if( s... |
//BISMILLAHIR RAHMANIR RAHIM
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mem(a, b) (memset(a, b, sizeof(a)))
#define pb push_back
#define mk make_pair
#define ff first
#define ss second
#define PI acos(-1)
#define min3(a,b,c) min(a,min(b,c))
#define... | #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using ll = long long;
struct Edge{
ll to;
ll cost;
};
using Graph = vector<vector<Edge>>;
using P =pair<ll,ll>;
#define mp make_pair
#define REP(i, n) for (int i = 0; i < (n); ++... |
#include <bits/stdc++.h>
#include <algorithm>
#include <string.h>
using namespace std;
#define MOD (1000000000+7)
#define alp "abcdefghijklmnopqrstuvwxyz"
#define for0(i,n) for(long long i = 0;i < n;i++)
#define for01(i,n) for(long long i = 0;i <= n;i++)
#define for1(i,n) for(long long i = 1;i < n;i++)
#define for11(i,... | //#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> p;
const int INF = 1e9;
const double eps = 1e-7;
const ll LINF = ll(1e18);... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
vector<string> s(3);
set<char> S;
for (int i = 0; i < 3; i++) {
cin >> s[i];
for (auto c : s[i]) {
S.ins... | /*
"An anomaly, I'm Muhammad Ali
Cause I know one day I'm gonna be the"
- Greatest, Eminem
*/
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typ... |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
const int N = 2e5;
const int mod = 998244353;
using namespace std;
int n,a[N + 5],fa[N + 5];
int mypow(int a,int x){int s = 1;for (;x;x & 1 ? s = 1ll * s * a % mod : 0,a = 1ll * a * a % mod,x >>= 1);return s;}
int find(int x)
{
if (x == f... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#def... |
#include<bits/stdc++.h>
#define FULL(x,y) memset(x,y,sizeof(x))
#define ll long long
#define SZ(x) (int)x.size()
#define pb push_back
using namespace std;
const int N=5005;
const ll mod=998244353;
ll n,m;
ll f[N][N],ff[N];
int main() {
cin>>n>>m;
for(ll i=0;i<=m;i++) f[i][0]=1;
for(ll i=1;i<=m;i++) {
for(ll j=1;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> S >> Q;
bool flag = true;
for (int i = 0; i < Q; i++) {
int T, A, B;
cin >> T >> A >> B;
if (T == 1) {
if (!flag) {
if (A > N) {
A -= N;
} else {
A += N;
... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define int long long
#define all(ds) ... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constex... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("unroll-loops, no-stack-protector")
#pragma GCC target ("avx")
#pragma GCC target ("avx2")
#pragma GCC target ("fma")
#define fastio ios_base::sync_with_stdio(0... |
#include<bits/stdc++.h>
using namespace std::chrono;
using namespace std;
#define int long long
#define loop(i, start, end) for (int i = start; i <= end; i++)
#define rloop(i, start, end) for (int i = start; i >= end; i--)
#define read(a,n) loop(i,0,n-1) cin>>a[i];
#define vi vector<int>
#define vec(x) vector<x>
#defin... | #pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int N;
string s;
void input(void){
cin >> N >> s;
}
int solve(void){
static char buf[200005];
int ptr = 0;
for (int i = 0; i < N; ++i){
if (
... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main(){
int N;
cin >> N;
vector<vector<int>> A(5, vector<int>(N));
for(int i = 0 ; i < N; i++) {
for(int j = 0; j < 5; j++){
int a;
cin >> a;
A[j][i] = a;
}
}
int ub = ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s,d;
cin>>n>>s;
for (char c : s) {
d += c;
if (d.size() >= 3 && d.substr(d.size()-3) == "fox") {
d.erase(d.begin()+d.size()-3, d.end());
}
}
cout<<d.size()<<endl;
return 0;
} | #include<bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define pi acos(-1.0)
#define mod 1000000007
#define test int t; cin>>t ;while(t--)
typedef long long ll;
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
... |
#include <bits/stdc++.h>
using namespace std;
struct compare {
inline bool operator()(const std::string& first,
const std::string& second) const
{
return first.size() < second.size();
}
};
int main() {
int n, m;
cin>>n>>m;
string ins[m];
for (int i=0; i<m; i++) cin>>ins[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w,count=0;
cin>>h>>w;
vector<string>s(h);
for(int i=0;i<h;i++)cin>>s.at(i);
for(int i=0;i<h;i++){
for(int j=0;j<w-1;j++){
if(s.at(i).at(j)=='.'&&s.at(i).at(j+1)=='.'){
count++;
}
}
}
for(int i=0;i<h-1;i++){
... |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define MOD 1'000'000'007
#define ll long long int
#define ull unsigned ll
#define vt vector
#define uset unordered_set
#define umap unordered_map
#define mset multiset
#define umset unordered_multiset
#define in insert
#define pb push_back
#define ff... | #ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <q... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fr first
#define sc second
int lg(ll n) {
assert(n > 0);
int ans = -1;
while (n) {
ans++;
n >>= 1;
}
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
// 初期値
// nが階数、kが1階ごとの部屋数
int n, k;
int count=0;
// 入力
cin >> n >> k;
// 処理
for(int i=1; i<=n; i++){
for(int j=1; j<=k; j++){
coun... |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define ull unsigned long long
#define pi 2*acos(0.0)
#define readl(v,n) for(ll i=0;i<n;i++) {ll val; cin>>val; v.pb(val);}
#define readi(v,n) for(int i=0;i<n;i++) {int val;... | #include <iostream>
#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 ONLINE_JUDGE
#ifndef ONLINE_JUDGE
template<typename T>
void __p(T a) {
cout << a;
}
template<typename T, typename F>
void __p(pair<T, F> ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int k = n/100;
if(n%100 != 0) k++;
cout << k;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
n %= 100;
cout << 100 - n;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,j,n) for(ll i=j;i<n;i++)
#define scn(a) scanf("%lld",&a)
#define nl printf("\n")
#define scns(a,b) scanf("%lld %lld",&a,&b)
#define print(a) printf("%lld",a)
#define tc ll t; scn(t); while(t--)
... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main()
{
int n;
cin>>n;
pair<int,int> a[n];
for(int i=0;i<n;i++){
cin>>a[i].first>>a[i].second;
}
int x=0,y=0; // x-> aoki's votes and y-> takahashi's votes
for(int i=0;i<n;i++){
x+=a[i].first;
}... |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int n;
int s[200005];
vector<int>v[200005];
int ans=0;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;++i)
{
cin>>s[i];
v[s[i]].push_back(i);
}
for(int i=1;i<=n/2;++i)
{
... | #include <bits/stdc++.h>
#define ll long long
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define vl vector<long long>
#define pii pair<int, int>
#define REP(i,a) for (int i = 0; i < (a); i++)
#define add push_back
using namespace std;
template<typename T>
using minpq... |
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
#include <stack>
using namespace std;
#def... | // Problem: C - ARC Wrecker 2
// Contest: AtCoder - AtCoder Regular Contest 119
// URL: https://atcoder.jp/contests/arc119/tasks/arc119_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 10;
int p[N];
ll sum[N];
int main() {
int ... |
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define FF first.first
#define FS first.second
#define SF second.first
#define SS second.second
#define PB push_back
#define MP make_pair
#define all(cont) cont.begin(),cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<stdio.h>
#include<algorithm>
constexpr long long MOD = 998244353;
constexpr long long MOD32 = 665496236;
char f[5000][5000];
long long dp[5000];
int main(){
long H=0, W=0, K=0;
char c=getchar_unlocked... |
#include <iostream> // cout, endl, cin
#include <cmath> //sqrt pow
#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 <cstdint> // in... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
//a
long long lcm = 1;
int n;
cin >> n;
for (long long i = 2; i <= n; i++) {
long long g = __gcd(lcm, i);
lcm = lcm * i / g;
}
lcm++;
assert(lcm <= 1e13);
for (in... |
#include <iostream>
#include <vector>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<deque>
#include<set>
#include<queue>
#include<map>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define req(i,n) for(int i = 1;i<=n;i++)
#define rrep(i,n) for(int i = n-1;i>=0;i--)
#define ALL(a) a.... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define u64 long long
#define rint register int
#define co(x) cout << (x) << endl
#define cosp(x) cout << (x) << ' '
#define ce(x) cerr << (x) << endl
#define cesp(x) cerr << (x) << ' '
using namespace std;
//#define getchar() (p_1==p_2&&(p_2=(p_1=buf)+fread(b... |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<double, double> pdd;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<vi> ... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int MOD=1000000007;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;
ll a[200000],b[200000];
int main(){
int n;cin>>n;
rep(i,n)scanf("%lld",&a[i]);
rep(i,n)scanf("%ll... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int,int>;
// #include"debug.hpp"
const int INF = 1e9;
vector<vector<int>> lcs(vector<int> s, vector<int> t) {
int n = s.size(), m = t.size();
vector<vector<int>> dp(n + 1, vector<int>(m + 1, INF)); //dp[i][j] := s[i - 1], t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(x) x.begin(),x.end()
typedef long long ll;
ll mod = 1000000007;
ll inf = 1e18;
int main(){
int n,m;
cin >> n >> m;
vector<int> h(n),w(m);
vector<int> dist(n-... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
template<class T> auto vec(int r, int c, T v){ return vector<vector<T>>(r, vector<T>(c, v)); }
template<class T> auto vec(int o1, int o2, int o3, T v){ return vector<vector<vector<T>>>(o1, vector<vector<T>>(o2, vector<T>(o3, v))); }
int power(int x... | #include <bits/stdc++.h>
using namespace std;
#define REPP(i,a,b,d) for(int i=(a);i<=(int)(b);i+=(d))
#define REP(i,a,b) REPP(i,a,b,1)
#define REVV(i,a,b,d) for(int i=(a);i>=(int)(b);i-=(d))
#define REV(i,a,b) REVV(i,a,b,1)
#define FOR(i,a) for(int i=0; i<(int)(a); i++)
#define FORD(i,a) for(int i=(int)(a)-1; i>=0; i--... |
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define _roverload(_a1, _a2, _a3, name, ...) name
#define _rep(i, n) repi(i, 0, n)... | #include <cstdio>
using namespace std;
int main()
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if(a == b) printf("%d\n", c);
else if(b == c) printf("%d\n", a);
else if(a == c) printf("%d\n", b);
else puts("0");
return 0;
} |
#include <iostream>
using namespace std;
using LL = long long;
const int kMaxN = 1e6 + 1;
LL f[4][kMaxN * 3];
LL n, k, s;
int main() {
cin >> n >> k;
f[0][0] = 1;
for (int i = 1; i <= 3; i++) {
for (int j = 1; j <= 3 * n; j++) {
f[i][j] = f[i][j - 1] + f[i - 1][j - 1] - (j > n ? f[i - 1][j - 1 - n] ... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define lli long long int
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define plli pair<lli,lli>
#define vi vector<int>
#define vlli vector<lli>
#define vpi vector<pii>
#de... |
#include <bits/stdc++.h>
#define int long long
// #define endl "\n"
#define MOD 1000000007
using namespace std;
template <class T> ostream &operator<<(ostream &os, vector<T> V) {
os << "[ ";
for (auto v : V)
os << v << " ";
os << "]";
return os;
}
template <class T> ostream &operator<<(ost... | #include <bits/stdc++.h>
const int N = 105, P = 998244353;
int n, s, w[N], dp[N][N * N], fac[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &w[i]), s += w[i];
for (int i = fac[0] = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % P;
if (s & 1) return puts("0"), 0;
dp[0][0] = 1;
fo... |
#include<bits/stdc++.h>
using namespace std;
#define lln long long int
#define MOD 1000000007
vector<vector<int> > adj(20001);
int freq;
void dfs(int i, vector<int> & vis)
{
freq=freq+1;
vis[i]=1;
for(auto child: adj[i])
{
if(vis[child]==false)
{
dfs(child,vis);
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
// Ref: https://qiita.com/ysuzuki19/items/d89057d65284ba1a16ac
#define dump(var) do{std::cerr << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::c... |
#include<bits/stdc++.h>
using namespace std;
int const p=1e9+7;
int f[1005][2][2],g[1005][2][2],h[1005][2][2];
int main()
{
int n;
char aa,ab,ba,bb;
cin>>n>>aa>>ab>>ba>>bb;
f[2][0][0]=f[2][0][1]=f[2][1][0]=f[2][1][1]=1;
g[2][0][0]=g[2][0][1]=g[2][1][0]=g[2][1][1]=1;
h[2][0][0]=h[2][0][1]=h[2][1]... | #include <iostream>
using namespace std;
typedef long long ll;
const int N=1007;
const ll mod=1e9+7;
int n;
ll fib[N];
char c1,c2,c3,c4;
ll ksm(ll x,ll p){
ll res=1;
while(p){
if(p&1) res=res*x%mod;
p/=2;
x=x*x%mod;
}
return res;
}
void init(){
fib[1]=1,fib[2]=1;
for(int ... |
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
#define REP(i,b,e) for(int i=b; i<e; i++)
#define PRINT(vec) {printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");}
#define fi first
#define se second
const int MOD = 1e9+7;
int dx[] = {0, 1, 0, -1, 1, 1, -1, ... | #include <iostream>
using namespace std;
int main()
{
int N, W;
cin >> N >> W;
cout << N / W;
return 0;
} |
#include <cstdio>
#include <algorithm>
const int N = 1000 + 10;
const int MOD = 1e9 + 7;
inline int qmod(int x) { return (x>=MOD)?(x-MOD):x; }
int main() {
int i, p2, f1, f2, tmp, n;
char aa, ab, ba, bb;
scanf("%d", &n);
if(n == 2 or n == 3) {
printf("1\n");
return 0;
}
f1 = f2 = 1;
for(i=2; i<=n-2; i++... | #include<bits/stdc++.h>
#define con(typ) const typ
typedef long long ll;
template<typename T>void sf(T &x){x=0;T f=0;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')f=1;for(;c>='0'&&c<='9';c=getchar())x=(x<<3)+(x<<1)+(c^'0');if(f)x=-x;}
template<typename T>void pf(T x,char l='\n'){static int s[100],t;if(x<0)pu... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
constexpr ll mod = 1e9 + 7;
ll modpow(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1) r = r * a % mod;
a = a * a % mod;
b >>= 1;
}
return r;
}
int main(... |
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#pragma GCC optimize(2)
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<string>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<unordered_map>
using namespace std;
typedef long long ll;... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const double pi=3.1415926535897932384626;
inline ll read(){
ll x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}... | #include<iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int N, Q;
cin >> N;
char S1[N], S2[N];
for(int i=0;i<N;i++){
cin >> S1[i];
}
for(int i=0;i<N;i... |
#include<iostream>
#include<bits/stdc++.h>
#include<climits>
#define PI 3.14159265358979323846264338327950L
#define ll long long
#define db double
using namespace std;
const int MOD = 1e9+7;
void go(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout<<fixed;
cout<<setprecision(20);
#ifndef ONLINE_JUDGE
... | #include <iostream>
#include <map>
#include<vector>
#include<set>
#include<math.h>
#include <bits/stdc++.h>
// #define testPrint
using namespace std;
bool solve()
{
int m,h;
cin >> m>>h;
return ((h%m) == 0);
}
signed main(int arg, char **args)
{
cout<<((solve())?"Yes"... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define rep(i,n) for (ll i = 0;i<(n);++i)
#define all(v) v.begin(),v.end()
template <typename T>bool chmax(T &a, const T& b) {if (a < b) {a = b;return true;}return false;}
template <typename T>bool chmin(T &a, const T& b) {if (a > b) ... | #include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int num, nuts, x = 0, y = 0;
cin >> num;
for (int i = 1; i <= num; i++){
cin >> nuts;
if (nuts > 10){
x = nuts - 10;
//y += x;
}
else{
continue;
}
y += x;
}
cout << y << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string s;
cin>>s;
ll n=s.size();
map<char,ll>p;
ll r=0;
for(ll i=n-1;i>0;i--) {
if(s[i-1]==s[i]){
r+=(n-i-1-p[s[i]]);
for (ll j=0;j<26;j++) p[('a'+j)] = 0;
p[s[i]]=n-i;
}else p[s[i]]++;
}
cout<<r<<'\... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
#define int long long
#define double long double
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define M2 1000000009
#define ... | /*
Created by: Amit Kumar at 17:50 on 15 May 21
*/
#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.h"
#else
#define db(...)
#endif
using namespace std;
#define int long long
#define S(x, n) memset(x, n, sizeof(x));
#define pb(x) emplace_back(x)
#define all(x) x.begin(), x.end()
#define NIL -1
const long long ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<long long> Vll;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
ll n,k;
cin >> n >> k;
vector<Vll> t(n,Vll(n));
rep(i,n){
r... | #include <bits/stdc++.h>
using namespace std;
int N, ft[200005];
set< pair<int,int> > s;
void update (int x, int v) {
x++;
while (x <= N) ft[x] += v, x += x & -x;
}
int query (int x) {
x++;
int ans = 0;
while (x) ans += ft[x], x -= x & -x;
return ans;
}
int main() {
scanf("%d", &N);
... |
/*One cannot escape the feeling ... that these mathematical formulae have
an independent existence and an intelligence of their own ... that they
are wiser than we are, wiser even than their discoverers ... that we get
more out of them that was originally put into them.
*/
#include<bits/stdc++.h>
using namespace std;
... | #include<bits/stdc++.h>
long long n,x;
long long ans[2],k[2],a,b,c,now;
int main()
{
scanf("%lld%lld",&n,&x);
scanf("%lld",&b);
ans[0]=1;ans[1]=0;
for(int i=1;i<n;++i)
{
scanf("%lld",&a);
c=a/b;b=a;
now=x%c;
x/=c;
k[0]=ans[0],k[1]=ans[1];
if(now)k[1]+=ans[0];
if(++now!=c)k[0]+=ans[1];
ans[0]=k[0]... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string str;
int a[10]={0};
int zh(string s);
cin >> str;
for(int i=0;i<str.size();i++)
{
a[str[i]-'0']++;
}
if(str.size()==1)
{
if(zh(str) == 8)
{
cout << "Yes";
}
else
{
cout << "No";
}
return 0;
}
if(str.size... | /* BISMILLAHIR-RAHMANIR-RAHIM
____________________________________
| |
| SHANTO_SUST_SWE-19__029 |
| shanto-swe029.github.io |
|____________________________________|
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fast... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef double dd;
#define tst int tttt;cin>>tttt;for(int TTTT=1;TTTT<=tttt;TTTT++)
#define nl cout<<"\n";
#define forn(a,b) for(int ii=a;ii<b;ii++)
const ll MOD1=1e9+7;
const ll MOD2=998244353;
#define mp(a,b) make_pair(a,b)
#define pb(a) push_bac... | #include<bits/stdc++.h>
using namespace std;
int main()
{
// freopen("1.in","r",stdin);
int n,m;
scanf("%d %d",&n,&m);
if(n==1)
{
if(m==0)printf("1 2\n");
else puts("-1");
}
else
{
if(m<0 || m>n-2)puts("-1");
else
{
int nn=n,r=0;
if(m>=1)
{
printf("1 %d\n",n*2);
--nn;r=1;
... |
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#define _GLIBCXX_DEBUG
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using namespace std;
using ll =... | //ye moh moh ke dhaage,tere ungliyon se ja uljhe
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i,n) for(i=0... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s, s1; cin >> s;
s1 = s;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '0'){
s1.at(s.size() - 1 - i) = '0';
}
else if (s.at(i) == '1'){
s1.at(s.size() - 1 - i) = '1';
}
else if (s.at(i) == '6'){
s1.at(s.s... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
const int M=1e9+7;
const int N=200005;
signed main(){
int t1=1;
//cin>>t1;
while(t1--){
string s;
cin>>s;
reverse(s.begin(),s.end());
for(int i=0;i<s.length();i++){
if(s[i]=='6') s[i]='9';
... |
#include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
#define pie 3.14159265
#define ll long long int
#define fr(i,a,n) for(ll i=a;i<n;i++)
#define vi vector<int>
#define vlli vector<ll>
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fv(i,a) for(auto i:a)
#define sz(... | #include <iostream>
#include <cmath>
using namespace std;
int getMaxGCD(int arr[], int n) {
int high = 0;
for (int i = 0; i < n; i++)
high = max(high, arr[i]);
int divisors[high + 1] = { 0 }; //array to store all gcd values
for (int i = 0; i < n; i++) {
for (int j = 1; j <= sqrt(arr[i]); j++) {
... |
#include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vecto... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#define int long long
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define fcout cout << fixed << setprecision(20)
using namespace std;
vector<long long> divisor(long long n) {
v... |
#include<bits/stdc++.h>
#include<string>
#define FIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long
#define mod (ll)(1e9+7)
#define nax (ll)(1e5 + 10)
#define INFL LLONG_MAX
#define NINFL LLONG_MIN
#define INF INT_MAX
#define disp(a,n,arr) for(int i=a;i<(ll)n;i++) cout << arr[i] <<... | #include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int64_t a, b, c;
cin >> a >> b >> c;
if (c & 1 == 1) c = 1;
else c = 2;
if (pow(a, c) > pow(b, c))
cout << ">\n";
else if (pow(a, c) < pow(b, c))
cout << "<\n";
else ... |
#include <stdio.h>
#include <string.h>
int ans[110][10010];
int a;
char x[110];
int y[110];
void func(int k)
{
printf("%d\n",k);
for(int i=0;i<=a;i++)
{
int s = y[i]/k;
int t = y[i]%k;
for(int j=1;j<=t;j++) ans[i][j] = s+1;
for(int j=t+1;j<=k;j++) ans[i][j] = s;
}
for(int j=1;j<=k;j++)
{
for(int i=0... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define lln long long int
#define ld long double
#define all(x) (x).begin(),(x).end()
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int MOD = 1e9 + 7;
const int N = (int)2e5 + 5;
int main(){
IOS;
int TT = 1;
//cin >>... |
// /Applications/Geany.app/Contents/MacOS/geany
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define pairii pair<int,int>
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
const int N = 10000000;
vector<int> lp(N+... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld=long double;
using vin=vector<int>;
using v... |
#include <bits/stdc++.h>
using namespace std;
#define SZ(a) ((int)(a).size())
typedef long long int64;
int main() {
#ifdef LOCAL
freopen(".a.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<string> S(n);
vector<vector<int>> A(n, vector<i... | #include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using si = set<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
template<typename T> using minpq = priority_queue <T,vector... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>
#include <bitset>
... | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define vll v... | #include<bits/stdc++.h>
#define reg register
typedef long long ll;
using namespace std;
inline int qr(){
int x=0,f=0;char ch=0;
while(!isdigit(ch)){f|=ch=='-';ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return f?-x:x;
}
const int N=1e5+100;
int n;
double a[N];
int main(){
n=qr();
for(... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define F first
#define S second
#define ALL(a) a.begin(),a.end()
#define mp make_pair
#define pb push_back
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORN(i,a,b) for(int i=a;i<=b;i++)
#de... | /* @memendra_singh */
#include<bits/stdc++.h>
using namespace std;
#define m7 1000000007
#define m9 1000000009
#define ll long long
#define boost ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define F first
#define S second
#define pb push_b... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll i,j,n,m;
scanf("%lld%lld",&n,&m);
pair<ll,ll>p[m+1];
for(i=0;i<m;++i)
scanf("%lld%lld",&p[i].first,&p[i].second);
sort(p,p+m);
set<ll>s;
s.insert(n);
p[m].first=1e10;
queue<ll>q1,q2;
for(i=0;i<m;++i){
if(s.find(p[i].second)... | #include<bits/stdc++.h>
#define For(a,b,c) for(int a=b;a<=c;++a)
#define Dor(a,b,c) for(int a=b;a>=c;--a)
using namespace std;
typedef long long LL;
const int N=1007;
int n,m,c,a,vH[N],vL[N];
char G[N][N];
void flyL(int);
void flyH(int u) {
if(vH[u]) return;
vH[u]=c;
For(v,1,m) if(G[u][v]=='#') flyL(v);
}
void flyL(... |
#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=(l); i<(r); ++i)
using ll = long long int;
using namespace std;
const int INF = 1234567890;
int main(){
//入力
int x, y;
cin >> x >> y;
//処理
if(x>y) cout << (x<y+3?"Yes":"No") << endl;
else cout << (x+3>y?"Yes":"No") << endl;
//出力
... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
void solve(){
int a,b;
cin>>a>>b;
if(a==b){
cout<<a<<endl;
}else{
cout<<3-a-b<<endl;
}
return;
}
int main() {
int test =1;
// cin>>test;
while(test--){
solve();
}
... |
#include<iostream>
using namespace std;
int p[][4]={{0,0,0,0},{1,1,1,1},{6,2,4,8},{1,3,9,7},{6,4,6,4},{5,5,5,5},{6,6,6,6},{1,7,9,3},{6,8,4,2},{1,9,1,9}};
int f(int b,int c)//快速幂
{
int ans=1;
while(c)
{
if(c%2==1)
{
ans*=b%4;
c--;
}
b=b*b%4;
c/... | /**
*
* @Author : Sindys
* Language : C++
*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <iomanip>
#include <map>
#include <set>
#include <limits>//numeric_limits<int>::max() ... numeric_limits<int>::min()
#include <cmath>
#include <bitset>
#include <tuple>
#... |
#include<bits/stdc++.h>
#define lint long long int
#define rep(i,n) for(int i=0;i<int(n);i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define arep(i,a,n) for(int i=a;i<n;i++)
#define sort(a) sort(a.begin(),a.end())
#define reverse(a) reverse(a.begin(),a.end())
#define fill(a,x) fill(a.begin(),a.end(),x)
#define eb(dat... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> prime_numbers = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
int n = prime_numbers.size();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll A, B;
cin >> A >> B;
ll N = B-A+1;
vector<vector<ll>> d... |
// ###### ### ####### ####### ## # ##### ### ##### //
// # # # # # # # # # # # # # ### //
// # # # # # # # # # # # # # ### //
// ###### ######### # # # # ... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long int
#define mod 1000000007
#define vi vector<int>
#define pint pair<int,int>
#define vint vector<vector<int>>
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const int N = 1e6+5;
int A[N], B[N], P[N], Q[... |
#include<bits/stdc++.h>
using namespace std;
const int N=100005,M=1000000007;
int n,i,a,b,sa[N],st[N],sc[N],sg[N],ans,j;
char c[N];
int main()
{
scanf("%d %s",&n,c+1);
for(i=1;i<=n;++i)
{
sa[i]=sa[i-1];
sc[i]=sc[i-1];
st[i]=st[i-1];
sg[i]=sg[i-1];
if(c[i]=='A')
++sa[i];
if(c[i]=='T')
++st[i];
if(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pll = pair<ll, ll>;
using vll = vector<ll>;
#define endl "\n"
#define space " "
#define TLE_na_ho ios_base::sync_with_stdio(false);cin.tie(NULL)
#define MAX_SIZE 1024
#define MOD 1000000007
... |
#include<cstdio>
#include<cstring>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
typedef int int_;
#define int long long
#define maxn 400010
const int inf=1e9+7;
queue<int> q;
inline int read(){
int ret=0,ff=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') ff=-ff;
ch=getchar();... | #include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef std::vector<ll> vi;
typedef std::vector<std::vector<ll> > vv;
typedef std::vector<std::pair<ll,ll> > pii;
typedef std::pair<ll,ll> pi;
#define mod 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e5+3;
template <typename T>
inline void read(T &x){
x=0;char ch=getchar();bool f=false;
while(!isdigit(ch)) f|=ch=='-',ch=getchar();
while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=f?-x:x;
}
template <typename T>
... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T>
ostream &operator<<(... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x)... | #include <bits/stdc++.h>
using namespace std;
const int N=4e5+2;
int stk[N],top;
int n,m,p,e,a[N],b[N];
int main()
{
scanf("%d",&n);
m=n<<1;
for(int i=1;i<=m;++i)
{
scanf("%d",&a[i]);
b[i]=a[i];
}
sort(b+1,b+m+1);
for(int i=1;i<=m;++i)
if(a[i]<b[n])++p;
else if(a[i]>b[n])++e;
for(int i=1;i<=m;++i)
{
... |
#include <bits/stdc++.h>
using namespace std;
////////////////////////////////////////////////////////////////////////////<editor-fold desc="macros">
#define mod 1000000007
#define endl "\n"
#define long long long
#define all(v) (v).begin(),(v).end()
#define makeset(v) (v).resize(unique((v).begin(),(v).end())-(v).begin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for (int i = 0; i < (n); ++i)
void solve(long long N, std::vector<long long> A){
ll ans = 1E18;
rep(i,1<<N){
if(i == 0) continue;
ll r = 0;
vector<ll> d;
rep(j,N){
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long n, a[100000], i; cin >> n;
double dn = n, x2 = 2;
for(i = 0; i < n; i++) cin >> a[i];
if(n == 1) cout << fixed << setprecision(15)
<< a[0] / x2 << endl;
else if(n == 2) cout << fixed << setprecision(15)
... | #include <bits/stdc++.h>
// #include <atcoder/all>
#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;
// using namespace atcoder;
typedef long long int ll;
typedef pair<int, int> P;
#define MAX_N 2000... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.