code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
//Coded by Abhijay Mitra (AbJ)
#include "bits/stdc++.h"
#define double long double
#define int long long int
#define ibs ios_base::sync_with_stdio(false)
#define cti cin.tie(0)
#define mp make_pair
#define pb emplace_back
#define F first
#define S second
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using p... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int,int>;
void solve();
int main()
{
srand((unsigned)time(NULL));
int T;
cin >> T;
while(T--)solve();
}
template<class T> ostream& operator<<(ostream& os, const vector<T> arr){ for(int i = 0; i < (int)arr.size(); i++... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1000000007LL;
int main(void){
int N, M;
cin >> N >> M;
vector<ll> H(N), W(M);
for(int i = 0; i < N; i++) cin >> H[i];
sort(H.begin(), H.end());
for(int i = 0; i < M; i++) cin >> W[i];
sort(W.begin(), W.end());
... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl '\n'
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
long decimalToOctal(long n) {
int remainder;
long octal = 0, i = 1;
while(n != 0) {
remainder = n%8;
n = n/8;
octal = octal + (remainder*i);
i = i*10;
}
return octal;
}
int main() {
ll n;
c... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a,b;
cin>>a>>b;
if(b<a){
long long sum=0;
long long bum=0;
for(int i=1;i<=a;i++){
cout<<i<<" ";
sum=sum+i;
}
for(int i=1;i<=b-1;i++){
cout<<(-1)*i<<" ";
bum=bum+i... | #include <iostream>
using namespace std;
int mtf,mf;
int sum;
int main()
{
cin>>mtf>>mf;
sum = mtf+mf;
if(sum>=15&&mf>=8)
cout<<1;
else
if(sum>=10&&mf>=3)
cout<<2;
else
if(sum>=3)
cout<<3;
else
cout<<4;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> edges[26];
vector<pair<int, int>> states[1024][1024];
int d[1024][1024];
int main()
{
int N, M;
scanf("%d %d", &N, &M);
queue<pair<int, int>> q;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
d[i][j] = 1'000'0... | #include <bits/stdc++.h>
using namespace std;
/*
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
*/
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-lo... |
#include<bits/stdc++.h>
#define endl '\n'
#define QAQ(m, n) for(ll i = m;i <= n;i++)
#define QWQ(m, n) for(ll j = m;j <= n;j++)
#define FOR(k, m, n) for(ll k = m;k <= n;k++)
#define uQAQ(n, m) for(ll i = n;i >= m;--i)
#define uQWQ(n, m) for(ll j = n;j >= m;--j)
#define uFOR(k, n, m) for(ll k = n;k >= m;--k)
#define ALL... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define pow(n,m) powl(n,m)
#define sqrt(n) sqrtl(n)
const ll MAX = 5000000000000000000;
const ll MOD = 0;
random_device rd;
mt19937 mt(rd());
int main(){
ll N,M;
cin >> N >> M;
vector<string> S(M),ans(N),T;
se... |
//---------------------------------------------------------JAI HIND------------------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define all(a) a.begin(), a.end()
#define Summon_Tourist ios::sync_with_stdio(false); ... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 2005
ll A,B;
ll table[SIZE];
int main(){
scanf("%lld %lld",&A,&B);
... |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define Bs binary_search
#define In insert
#define Mp make_pair
#define All(x) x.begin(), x.end()
#defin... | #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(a) int((a).si... |
#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>
... | // Problem: C - Sequence Scores
// Contest: AtCoder - AtCoder Regular Contest 114
// URL: https://atcoder.jp/contests/arc114/tasks/arc114_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
//愿神 zhoukangyang 指引我。
#include<bits/stdc++.h>
#define int long long
using names... |
#include <iostream>
#include <stdio.h>
#include <cstdio>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <cstring>
#include <math.h>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int n,di1,di2,di;
long long t,ans;
long... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (int) n; i++)
#define PB push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
const int MOD = 1e9+7... |
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define rep(i,n) for(int i=0; i<(n); ++i)
typedef pair<ll, ll> P;
typedef pair<string, int> Psi;
ll index_max[1234567];
ll A[1234567];
ll ruiseki[1234567];
ll ruiseki_sum[1234567];
int main() {
cin.tie(0);
ios::s... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
struct LOC{
ll x,y;
};
typedef vector<ll> V;
typedef vector<V>... |
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
int nt[200009], id[200009], ds[200009];
bool rm[200009];
queue<int> q;
int uf(int n)
{
if (ds[n] == n) return n;
return ds[n] = uf(ds[n]);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n; cin >> n;
for (in... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define vi vector<int>
const int kMod = 1e9 + 7;
const int kInf = (~(1<<31)) / 2 - 500;
const ll kInfL = (~(1LL<<63)) / 2 - 2000;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; ++i) {
cin >>... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int modu = 998244353;
const double eps = 1e-5;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
typedef long long LL;
int n;
LL sum[maxn];
int main() {
// freopen("my.txt", "w", stdout);
cin >> n;
sum[0] = 0;
... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n);++i)
using ll = long long;
int main(){
double X,Y,Z,ans;
double price_per_gram;
cin >> X >> Y >> Z;
ans = 1000001.0;
price_per_gram = (double) (Y/X);
while (1){
if((double)(ans/Z)>=price_per_gram){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
#define all(hoge) (hoge).begin(), (hoge).end()
#... |
//In the name of Allah (swt)
/*
T sort / plano ax
== [g o t c p]
// 我爱雨，花，食物，空气，水，都赞美真主 由 埃姆兰 制造
upper_bound = find the last positon where n could be inserted
lower_boudn = find the first position where n could be inserted
lambda = [](int x){return x<10;}
STL Algorithm Non- modifying----
----------------... | #include<bits/stdc++.h>
#define int long long
#define ll int
#define itn int
#define ld long double
#define all(c) c.begin(),c.end()
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int,int>
#define rep(i, n) for(int i = 0 ; i < n ; i++ )
#define repu(i, a, b) for(int i = a; i <=b; ++i)
#define ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long A[N],P[N],X[N];
for (long i = 0; i < N; i++) {
cin >> A[i] >> P[i] >> X[i];
}
long long price = 2000000000;
for (long i = 0; i < N; i++) {
if (X[i] > A[i]) {
price = min(price,P[i]);
... | // Author : Chinmay JHa @chinmayajha
//
// Problem: B - Play Snuke
// Contest: AtCoder - Caddi Programming Contest 2021(AtCoder Beginner Contest 193)
// URL: https://atcoder.jp/contests/abc193/tasks/abc193_b
// Date / Time: 02-04-2021 18:58:24
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
i... |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<string> S(3);
for (auto &s: S)
cin >> s;
string C = "";
for (const auto &s: S)
C += s;
sort(C.begin(), C.end());
C.erase(unique(C.begin(), C.end()), C.end());
if (C.size() > 10){
puts("UNSOLVABL... | #include "bits/stdc++.h"
#pragma region header
#define loop(n) for ([[maybe_unused]] size_t lpcnt_ = 0; lpcnt_ < (n); ++lpcnt_)
using i32 = int;
using i64 = long long int;
using u32 = unsigned int;
using u64 = unsigned long long int;
using isize = ptrdiff_t;
using usize = size_t;
template <class T, T Div = 2>
constex... |
#include<bits/stdc++.h>
using namespace std;
int a[200000];
long long b[200000];
int Mod=1e9+7;
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
sort(a+1,a+1+n);
int tot=0;
for(int i=1;i<=n;i++)
if(a[i]!=a[i-1]) b[++tot]=a[i];
long long sum=1;
for(int i=1;i<=tot;i++)
{
sum=sum*(b[i]-b[i-1]+1)%... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define ll long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a))
#define FORN(a, b, c) for (int(... |
/*
Author- Aasav Badera
Time- Sat Oct 3 17:21:39 2020
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
using namespace __gnu_pbds;
#ifdef LOCAL
... | #include<bits/stdc++.h>
#define fl(i,a,n) for(int i=a;i<=n;i++)
#define pb push_back
#define int long long int
#define ump unordered_map
#define pii pair<int,int>
#define ff first
#define ss second
#define PI 3.1415926535898
#define i... |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define forn(i,n) for(int i = 0; i < (int) n; i++)
#define ios ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
typedef long long ll;
int n;
vector<int> w, maxL;
vector<pair<int,int>> seg;
ll mindist(vector<int>& o) {
ll ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
#define int long long
int N,M,maxW=0,ans=0;
cin>>N>>M;
vector<int> w(N),l(M),v(M),p(N);
vector<pair<int,int>> rock(M);
for(int i=0;i<N;i++){
cin>>w.at(i);
maxW=max(maxW,w.at(i));
p.at(i)=i;
}
for(int i=0;i<M;i++){
cin>>l.at(i)>>v.... |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <numeric>
/* debug macros */
#ifdef WAFDAYO
#define DBG_LINE() {std::cerr<<"\e[2m[L"<<__LINE__<<... |
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include <stdio.h>
constexpr int HeighestDim = 505000;
int n, m, k;
long long int res[101];
int dim_a = 0, dim_b = 0;
int A[HeighestDim + 1], B[HeighestDim];
void mult_a(int v){
for(int i = dim_a, j = i - v; j >= 0; --i, --j){ A[i] -= A[j]; if... | #include<bits/stdc++.h>
using namespace std;
const int MX = 6e5, K = 101;
int M;
int dp[K][2*MX];
int sum[2*MX];
int add(int a, int b) {
return a+b >= M ? a+b-M : a+b;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin>>n>>k>>M;
// n = 100, k = 100, M = 1e9;
dp[0][0] = 1;... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
typedef pair<int,int> pp;
bool com(pp x,pp y){
if(x.ff==y.ff) return x.ss<y.ss;
return x.ff<y.ff;
}
ll power(ll x,ll y){
ll prod=1;
while(y){
if(y... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <list>
#include <iomanip>
using namespace std;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#defin... |
#include<bits/stdc++.h>
#define N ((int)5e4 + 5)
#define MAXL ((ll)1e18 + 5)
#define MAX ((int)2e9 + 5)
#define fastio ios_base::sync_with_stdio(false) , cin.tie(0) , cout.tie(0)
#define endl "\n"
#define ll long long
using namespace std;
int main(){
fastio ;
string s ;
cin>>s ;
if(s[0]==s[1] && s[2... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
int main()
{
fast
ll n,x;cin>>n>>x;
ll a[n];
for(ll i=0;i<n;i++)
cin>>a[i];
for(ll i=0;i<n;i++)
{
if(a[i]!=x)
cout<<a[i]<<" ";
}
co... | #pragma GCC optimize("O3")
#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;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int, int> ... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); ++i)
#define rep_r(i,n) for(int i=(int)(n)-1; i>=0; --i)
#define reps(i,n,m) for(int i=(int)(n); i<(int)(m); ++i)
#define reps_r(i,n,m) for(int i=(int)(m)-1; i>=(int)(n); --i)
#define N 200001
int main(){
//cout<<fixed<<setpreci... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(int)(n); i++)
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<LL, int> PR;
const LL INF=1e16;
struct Graph{
int N, M; VI A, B; VL C; vector<VI> S, T;
Graph(int n) : N(n), M(0), S(n), T(n) {}
void setE... |
#include<iostream>
#include<algorithm>
#include<cstring>
#define debug(a) cout<<#a<<" = "<<a<<endl
using namespace std;
typedef long long ll;
const int N = 5010;
const int MOD = 998244353;
int n , m;
ll C[N];
ll f[N];
ll Q_power(ll a ,ll b){
ll res = 1;
while(b){
if(b & 1) res = res * a % MOD;
... | #include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<set>
typedef long long ll;
typedef unsigned un;
typedef std::vector<int> P;
typedef std::pair<int,int> pii;
ll read(){ll x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9')x=x*1... |
// #include <bits/stdc++.h>
// string s;
// getline(cin, s);
// g++ -std=c++11 -O2 -Wall test.cpp -o test
// printf("%.9f\n", x); PRECISION
#include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> x(n);
vector<int> y(n);
for(int i=0; i<n; i++){
cin >> x.at(i);
cin >> y.at(i);
}
for(int i=0; i<n-2; i++){
for(int j=i+1; j<n-1; j++){
for(int k=j+1; k<n; k++){
if((x.at(j)-x.at(i))*(y.at(k)-... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b,c;
cin>>a>>b>>c;
long long int sqa=pow(a,2)+pow(b,2);
long long int sqc=pow(c,2);
if(sqa<sqc)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x, y, ans = 0;
cin >> a >> b >> x >> y;
if (2 * x >= y) {
if (a <= b) ans = abs(a - b) * y + x;
else
ans = (abs(a - b) - 1) * y + x;
} else
ans = abs(a - b) * x * 2 + ((a <= b) ? x : -x);
cout <... |
//https://cp-algorithms.com/algebra/linear_congruence_equation.html
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,size... | #include <iostream>
int64_t gcd(int64_t a,int64_t b,int64_t &x,int64_t &y)
{
if(b==0){x=1;y=0;return a;}
int64_t d=gcd(b,a%b,y,x);
y-=a/b*x;
return d;
}
int main()
{
int T;
std::cin>>T;
for(int i=0;i<T;i++)
{
int64_t N,S,K;
std::cin>>N>>S>>K;
int64_t result=0;
int64_t x,y;
int64... |
#include <bits/stdc++.h>
//#include <bits/extc++.h>
//#define int long long
#define ll long long
#define ull unsigned ll
#define endl "\n"
#define pb push_back
#define ms(v,x) memset(v,x,sizeof(v))
#define ff first
#define ss second
#define td(v) v.begin(),v.end()
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define pe... | #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include <chrono>
#include <random>
#include <unordered_set>
using namespace std;
typedef long long ll;
void solve() {
ll a, b;
cin >> a >> b;
int n = 73;
vector<int> s(n);
vector<int> prime;
for (int i = 2; i < n; i++) {
if (s[i... |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<stdbool.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr=buf;}*ptr++=c;
}
static inline int IN(void)
{
int x=0,f=0,c=getch... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.14159265358979323846264338327950L
struct times{
bool start;
ll time = 0;
ll value = 0;
};
int N,C;
priority_queue<pair<int,times*>> q ;
void solve(){
cin >> N>> C;
ll a,b,c;
for (int i = 0; i < N; i++)
... |
#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<algorithm>
#include<iostream>
using namespace std;
#define ll long long
#define For(i,l,r) for(int i=l;i<=r;i++)
#define MAXN 200001
int N,ans;ll now=0;struct A{int a,b;bool operator<(A x)const{return 2ll*a+b>2ll*x.a+x.b;}}a[MAXN];
int main()
{
cin>>N;For(i,1,N)cin>>a[i].a>>a[i].b,now-=a[i].a;sort(a+1,a+N+1);... |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(... | #include<bits/stdc++.h>
using namespace std;
typedef long long int in;
int main()
{
in n,i,j,k;
cin>>n;
in a[n],b[n];
for(i=0;i<n;++i)
cin>>a[i]>>b[i];
for(i=0;i<n;++i)
for(j=i+1;j<n;++j)
for(k=j+1;k<n;++k)
{
in val=a[i]*(b[j]-b[k])+a[j]*(b[k]-b[i])+a[k]*(b[i]-b[j]);
... |
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
ll pw(ll a, ll b, ll mod) {
if (b == 0) return 1 % mod;
if (b & 1) {
return (a * pw(a, b - 1, mod)) % mod;
}
ll res = pw(a, b / 2, m... | #include<bits/stdc++.h>
using namespace std;
int main()
{
char s,t;
cin>>s>>t;
if(s=='Y')
{
char p=(t-'a'+'A');
cout<<p;
}
else
{
cout<<t;
}
} |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using ld = long double;
using vld = vector<ld>;
using vb = vector<bool>;
#define rep(i, n) for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define int long long
#define PI 3.1415926535897932384626
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
typedef pair<int, int> pi;
typedef vector<int>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+7;
ll seg[N<<2],tag[N<<2];
int fa[N],dep[N],siz[N],son[N],top[N],dfn[N],rk[N], w[N];
int a[N], b[N];
int n,m,root;
int tot=0;
vector<int> G[N];
void pushDown(int node,int t){
if(tag[node]!=0){
tag[node<<1]+=tag[node];
... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<vector<char>> mat;
vector<pair<int,string>> in;
vector<string> in2;
vector<string> in3;
vector<string> in4;
vector<string> in5;
vector<string> in6;
vector<string> in7;
vector<string> in8;
vector<string> in9;
vector... | #line 1 "main.cpp"
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include... |
#include <iostream>
using namespace std;
int main()
{
int N, M, T;
cin>>N>>M>>T;
int max=N;
int A=0,B=0,C=0;
for(int i=0;i<M;i++)
{
cin>>A;
N=N-(B>A?(B-A):(A-B));
if(N<=0)
break;
cin>>B;
N=N+(B-A);
if(N>max)
N=max;
}
N=N-(T-B);
if(N>0)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/*
提出前に確認!
- 配列は+10ぐらい余分にとっておく
- setとmultisetを間違えない
*/
/*
デバッグ時にチェック!
- RE
配列の取りうる最大値、最小値を**すべて**チェックする
*/
int main(void)
{
int n, m, t;
cin >> n >> m >> t;
int now = n;
int pre = 0;
for (int i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
now -= a - pre;
if... |
#include<bits/stdc++.h>
using namespace std;
void solve(){
string s; cin >> s;
int go = 0, ma = 0;
for(char c : s){
if(c == 'o')go++;
if(c == '?')ma++;
}
int ans = 0;
for(int i = 0; i < 10000; ++i){
string no = to_string(i);
while(no.size() < 4)no = '0'+no;
string co = "xxxxxxxxxx";
for(char c : no)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main()
{
ull n, a; cin >> n;
ull ans = 0;
vector<ull> mod(200);
rep(i, n)
{
cin >> a;
mod.at(a % 200)++;
}
rep(i, 200)
{
if (mod.at(i)... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 200005
vector<int>tree[4*N];
void build_tree( int cur , int l , int r, int a[])
{
if( l==r )
{
tree[cur].push_back(a[l]);
return ;
}
int mid = l+(r-l)/2;
build_tree(2*cur+1 , l , mid, a); // Bu... | #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()
#include <bits/stdc++.h>
using namespace std;
char readchar() {
static char buf[1 << 15], *ptr = buf, *end = buf;
if (ptr == end) ptr = buf, end = buf + fread(buf, 1, 1 << 15, stdin);
return *... |
#include <bits/stdc++.h>
using namespace std;
int main() {
using ll = long long;
const ll N = 1e6 + 10;
ll l, r;
cin >> l >> r;
vector<ll> cnt(N, 0);
ll ans = 0;
for (ll g = 1e6; g >= 2; g--) {
ll xk = r / g - (l - 1) / g;
ll val = xk * xk;
for (ll i = 2; i * g < N;... | #pragma once
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#include<limits>
#include<bitset>
#include<functional>
#include<type_traits>
#include<queue>
#include<stack>
#include<array>
#include<random>
#include<utility>
#include<cstdlib>
#include<... |
#include<bits/stdc++.h>
using namespace std;
#define hi ios_base::sync_with_stdio(false);cin.tie(NULL);
typedef int64_t ll;
typedef long double ld;
typedef long long unsigned llu;
#define test int test; cin>>test; while(test--)
#define loop(i,n,k) for(int i=n;i<k;i++)
#define rloop(i,n,k) ... | #include <iostream>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
using namespace std;
typedef long long int ll;
typedef pair <int,int> pii;
typedef pair<ll,ll> pll;
/*bool compare_function(const pair<int, int> a, const pair<int, int> b... |
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a, b;
cin >> a >> b;
int x = (a + b) / 2, y = (a - b) / 2;
cout << x << " " << y;
} | // https://atcoder.jp/contests/arc104/tasks/arc104_a
#include <bits/stdc++.h>
using namespace std;
// #define cerr if(false) cerr
#define watch(x) cerr << (#x) << " is " << (x) << endl;
#define endl '\n'
#define ld long double
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define ... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#de... | #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=3005;
const int MOD=998244353;
int n,m,p=0,q=1;
int dp[N][N];
void add(int &x,int y){
x+=y;
if(x>=MOD) x-=MOD;
}
int main(){
scanf("%d%d",&n,&m);
dp[n][m]=1;
for(int j=n;j>=0;j--){
for(int k=0;k<=j;k++){
if(k%2==0) add(dp[j][k],dp[j][k/2]);
add(dp... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> //required
//#include <ext/pb_ds/tree_policy.hpp> //required
//using namespace __gnu_pbds; //required
using namespace std;
//template <typename T> using ordered_set = tree<T, null_typ... |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
#define P pair<ll,ll>
#define T tuple<int, int, int>
#define PP pair<P,P>
#define ALL(a) a.begin(), a.end()
int main()... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<utility>
#include<set>
#include<stack>
#include<list>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<cmath>
#include<cctype... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#incl... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
using pll=pair<ll, ll>;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typenam... |
//#define DEBUG
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5;
const int INF = 0x3f3f3f3f, MOD = 1000000007;
const long long LINF = LONG_LONG_MAX;
#define INIT(arr, val) fill(arr, arr+(int)(sizeof(arr)/sizeof(arr[0])), val)
#define REP(i, lb, rb, inc) for(int i = (lb); i < (rb); i += inc)
#define... | #include <bits/stdc++.h>
#define LL long long
#define PII pair<int,int>
#define PIL pair<int,LL>
#define PLI pair<LL,int>
#define PIII pair<int,PII>
#define PLL pair<LL,LL>
#define PLII pair<LL,PII>
#define VI vector<int>
#define VVI vector<VI>
#define VL vector<LL>
#define VVL vector<VL>
#define VPII vector<PII>
#defi... |
#ifdef LOCAL
#pragma warning(disable:4996)
#pragma warning(disable:4244)
#pragma warning(disable:4554)
#define gets gets_s
#endif
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<stack>
#include<queue>
#include<cmath>
#include<vector>
#include<string>
#include<cctype>
#include<cstdio>
#include<bitse... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define printV(v) for(int i=0;i<(int)v.size();i++){cout << v[i]<< " ";} cout << endl
#define printRev(v) for(int i=(int)v.size()-1;i >= 0;i--){cout << v[i] << " ";} cout << endl
#define sortV(v) sort(v.be... | #include <bits/stdc++.h>
#define int long long
#define sc(x) scanf("%lld",&x);
#define P pair<int,int>
#define fi first
#define se second
#define pb push_back
#define endl '\n'
using namespace std;
int N;
int A[300006];
int B[300005];
signed main()
{
int n,k;
sc(n)sc(k)
int x;
for(int i = 0; i < n; i... |
#include <iostream>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
set<pair<int,int>> s;
set<int> st;
int a[100010],b[100010],d[100010] = {};
vector<int> v;
int main(){
int i,j,n,l; cin >> n >> l;
for(i=1;i<=n;i++) cin >> a[i];
for(i=1;i<=n;i++) cin >> b[i];
... | #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;
long long int a[50] = {0} , b[50] = {0};
int main() {
// your code goes here
int n;
long long int t;
cin >> n >> t;
int x = n/2;
for(int i = 0 ; i < x ; i++){
cin >> a[i];
}
for(int i = 0 ; i < n-x ; i++){
cin >> b[i];
... |
/**
* Coded by : lucky_21
* --------Lokesh Singh
**/
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_upd... |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=401000;
int n;
int a[maxn],rk[maxn];
bool type[maxn];
int scnt,stype;
inline int read(){
int res=0;
char ch=getchar(),ch1=ch;
while(!isdigit(ch))ch1=ch,ch=getchar();
while(isdigit(ch))res=res*10+ch-'0',ch=getchar... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
inline int read() {
int x=0,f=1;char c=getchar();
while(c<48||c>57){if(c=='-')f=-1;c=getchar();}
while(c>=48&&c<=57)x=(x<<1)+(x<<3)+(c^48),c=getchar();
return x*f;
}
using namespac... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int mn = 1e9, mx = -1e9;
for(int i=0;i<n;++i){
int x; cin >> x;
mx = max(mx, x);
}
for(int i=0;i<n;++i){
int x; cin >> x;
mn = min(mn, x);
}
cout << (mn < mx ? 0 : mn-mx+1);
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define LL long long
#define PII pair<int,int>
#define PIL pair<int,LL>
#define PLI pair<LL,int>
#define PIII pair<int,PII>
#define PLL pair<LL,LL>
#define PLII pair<LL,PII>
#define VI vector<int>
#define VVI vector<VI>
#define VL vector<LL>
#define VVL vector<VL>
#define VPII vector<PII>
#defi... |
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("O2")
#include"bits/stdc++.h"
using namespace std;
const int p = 31;
const int M = 998244353;
typedef long long ll;
typedef double d;
typedef long double ld;
typedef unsigned long long ull;
#define ar array
#define ff first
#define ss sec... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int, int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #include<bits/stdc++.h>
using namespace std;
const long long maxn=2e5+5;
const long long maxm=20;
const long long inf=0x3f3f3f3f;
vector<long long> g[maxn];
queue<pair<long long,long long> >q;
bool vis[maxn];
long long n,m,k,c[maxm],idx[maxn];
long long dist[maxm][maxm],dp[maxm][1<<maxm];
int main(){
cin>>n>>m;
for(l... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector<bool> seen;
const ll MOD = 998244353;
void dfs(Graph &G, int v){
seen[v] = true;
for... | # pragma GCC optimize ("O3")
# pragma GCC optimize ("Ofast")
# pragma GCC optimize ("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define rep2(i,a,b) for(int i = (b) - 1; i >= (a); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+5;
int head[maxn],tot;
struct Edge{
int next,to,tim,val;
}e[maxn];
void add_edge(int x,int y,int z,int w){
e[++tot] = (Edge){head[x],y,z,w},head[x] = tot;
}
int n,m,x,y;
struct Sta{
long long tim;
int u;
bool operator <(Sta b)const{return tim>b.ti... |
#include <bits/stdc++.h>
using namespace std;
struct level{
int type; //-1 = left, 1 = right
int id;
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
int N;
cin >> N;
vector<level> e(2 * N + 1);
vector<bool> dp(2 * N + 1);
dp[0] = true;
for(int i = 0... | #include<bits/stdc++.h>
using namespace std;
namespace Ruri{
#define ms(a,b) memset(a,b,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t,n,i;
cin >> t;
while(t--){
cin >> n;
if(n%4==0){
cout << "Even" << endl;
}else if(n%2==0){
cout << "Same" << endl;
}else{
cout << "Odd" << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (intt i = 0; i < (intt)(n); i++)
using intt = int64_t;
intt sum(const long &a, const long &b) { return (a + b) * (b - a + 1) / 2; }
vector<char> alphabet={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','... |
//#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <functional>
#include <algorithm>
#include <map>
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <queue>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define vi vector<int>
#define vll vector<long long>
#de... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, w; cin >> n >> w;
cout << n / w << "\n";
return 0;
} |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPE(i,l,n) for(ll i=l;i<=ll(n);i++)
#define FORA(i,I) for(const auto& i:I)
#define ALL(v) v.begin(),v.end()
#define P(str) cout << str << endl
#define VLL vector<ll>
#define chmax(a, b) a = (((a)<(b)) ?... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,K;cin >> N >> K;
vector<vector<int> >A(N,vector<int>(N));
for (int i=0;i<N;i++){
for (int j=0;j<N;j++){
cin >> A[i][j];
}
}
int r=1000000008;
int l=-1;
while (abs(r-l)>1){
int m=(r+l)/2;
... | #include <bits/stdc++.h>
using namespace std;
#define fst ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define tc int tt; cin >> tt; while(tt--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
const int N = 2e5 + 5, mod = 1e9 + 7, INF = 1e16 + 6;
int p... |
#include <bits/stdc++.h>
using namespace std;
#define int unsigned long long
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; }
int memo[200][20];
int l;
int dp(int i, int j){
if(i == l-1){
... | #include <bits/stdc++.h>
//abcdefghijklmnopqrstuvwxyz
/*
Народ все кто играет в CodeForces вступайте в нашу
Организацию "Megumin's Fan Club" там был Я, Я все еще там
Хорошая организация классная правда сейчас загнивает))))
*/
#define F first
#define S second
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#def... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c... | /* bimillahir rahmanir rahim...
* AUTHOR
* mubin_akib */
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair <int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef... |
#include <bits/stdc++.h>
#define rep(i,n) REP(i, 0, n)
#define REP(i, a, n) for(int i = a ; i < (int)n ; i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int main()
{
ll n; cin >> n;
map<ll, ll> map;
rep(i, n) {
ll x; cin >> x;
map[x]++;
}
ll ans = n*(n-1)/2;
for (auto p : map... | /*
You Can Do This!
From Madeline
To You
https://www.youtube.com/watch?v=vBUhgkMD5kc
*/
#include <bits/stdc++.h>
#define inf ll (1e18)
#define ninf ll (-1e18)
#define mod ll (1e9 + 7)
#define first F
#define second S
#define fast ios::sync_with_stdio (0); cin.tie (0);
using namespace std;
using ll = long long;
us... |
#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using ll = long long;
using lint = long long;
typedef vector<long long> vint;
typedef pair<long long, long long> pint;
#define INF INT32_MAX / 2
#define INF64 INT64_MAX / 2
#define EPS 0.001
#define EPS14 1.0E-14
#define REP(i, n) for (int i = 0; i < n... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=55;
int n,vis;
int a[maxn],prime[15]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
bool s[maxn][15];
inline int read(){
int ret=0,f=1; char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
while(isdigit(ch)){ret=ret*10+c... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t; using Vll =vector<ll>; using VVll =vector<vector<ll>>;
template <class T> using Vec = vector<T>; template <class T> using VVec = vector<vector<T>>;
#define INF 9223372036854775807LL/2
void Z(ll i=-1){ if(i==-1)cout<<"Test"<<endl; else cout<<"Test"<<i<<e... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
#include <ctype.h>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF... |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;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; }
const long long INF = 1LL <<60;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b,x,y;
cin>>a>>b;
int d=b-a;
while(true){
x=a/d;
if(a%d!=0) x++;
y=b/d;
if(x<y){
cout<<d;
break;
}
d--;
}... |
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#i... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define REP(i,n) for (int i=0; i<n; i++)
using ll = long long;
using P = pair<int,int>;
pair<long, long> extract(const long&B, const long&C) {
const auto n = C/2;
if (C%2) {
return {-B-n, -B+n};
} else {
if (!C) return {B,B};
return {B-n... |
#define _USE_MATH_DEFINES
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
#include <unordered_map>
#include <queue>
#include <math.h>
#include <climits>
#include <set>
#include <map>
using namespace std;
using ll = long long;
using ld = l... | #include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define fi first
#define se second
#define ll long long
#define tp top()
#define fr front()
#define vi vect... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#d... | #include <vector>
#include <queue>
#include <functional>
#include <utility>
using namespace std;
// E[i]: vertexes which can be reased from i
// W[i]: their weight
template<class T>
vector<T> dijkstra(vector<vector<int>> E, vector<vector<T>> W, int s, T inf)
{
int n = (int)E.size();
vector<T> D(n, inf);
... |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using T = tuple<int,int,int>;
using P = pair<int,int>;
int main(){
int n, k;
cin >> n >> k;
vvi field(n, vi(... | #include <iostream>
#include <string>
#define ll long long
using namespace std;
const int N = 2e5+10;
int cnt[N][26];
int main() {
string s; cin >> s;
int n = s.size();
ll ans = 0;
for(int i = n - 1; i >= 0; --i) {
for(int x = 0; x < 26; ++x) {
cnt[i][x] = cnt[i+1][x];
}
++cnt[i][s[i] - 'a'];
}
int prev ... |
#include <bits/stdc++.h>
#define ll long long
#define lll long long
#define mp make_pair
#define pb push_back
#define inf 1000000001
#define vll vector <ll>
lll p = 1000000007;
using namespace std;
lll sq(lll i){
return i*i;
}
lll fact(ll n){
ll ans=1;
for(ll i=1; i<=n;i++)ans=(ans*i)%p;
return ans;
}
unsigne... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef vector<int> vi;
typedef vector<vi> vvi;
int h,w;
vvi a(2010, vi(2010));
vvi opt(2010, vi(2010));
int main(){
cin>>h>>w;
rep(i,h)rep(j,w) {
char A; cin>>A;
if(A=='+') a[i][j]=1; else a[i][j]=-1;
}
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define intmax 0x7fffffff
#define halfintmax 0x3fffffff
typedef pair<int, int> pii;
typedef pair<int, char> pic;
const int N = 200009;
const int mod = 998244353;
ll n;
int main() {
cin >> n;
ll l = 0, r = 1.5... | #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;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long int
#define s(x) cin>>x... |
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<time.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
bool flag[2510];
int t[51][51];
int p[51][51];
int dx[4];
int dy[4];
string direction = "UDLR";
string rout... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
int inf=1000001000;
ll INF=2e18;
ll MOD=1000000007;
ll mod=998244353;
int main() {
int n,l;
ci... |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for (auto i = (C).begin(); i != (C).end(); i++)
#define pr(a) cout << a
#define prl(a) cout << ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
int main(){
int n; cin>>n;
vector<complex<double>>a(n),c(n);
for(int i=0; i<n; i++){
int a1,a2;
cin>>a1>>a2;
a.at(i).real(a1);
a.at(i).imag(a2);
}
for(int i=0; i<n; i++){
int a1,a2;
cin>>a1>>a2... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
int64_t A[1000000],b,c,x=1;
for(int i=0;i<N;i++){
cin >> A[i];
}
b=A[0]; c=A[0]*A[0];
int64_t S=0,T=0;
for(int i=1;i<N;i++){
S+=(A[i]*A[i]*x+c);
T+=(A[i]*b);
b+=A[i]; c+=A[i]*A[i]; x++... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
#include <map>
#include <memory>
#include <list>
#include <deque>
#include <queue>
#include <iomanip>
#include <set>
#include <stack>
#include <numeric>
#include <unordered_set>
#include <unordered_map>
#inc... |
#include <iostream>
#include <vector>
using namespace std;
#include <iostream>
#include <cassert>
template<long long mod>
class modint{
private:
using T = long long;
T a;
public:
constexpr modint(const long long x = 0) noexcept : a((x%mod+mod)%mod) {}
constexpr T& value() noexcept { return a; }
constexpr co... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (int) x.size()
#define cat(x) cerr << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (int i = j; i <= n; ++i)
#define per(i, j, n) for (int i = n; j <= i; --i)
using ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B(N), mem_A(N,0), mem_B(N,0);
for (int i = 0; i < N; i++) {
int A;
cin >> A;
mem_A.at(A - 1)++; //mem_A.at(n - 1) = 数列Aのうちnの値の数字の個数
}
for (int i = 0; i < N; i++) {
cin >> B.at(i); //B.at(n - 1) = ... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#incl... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <class T>
using... | #include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIB... |
#include <iostream>
#include <algorithm>
using namespace std;
int a=0, i;
long long ans=0, n, s=1;
int main(){
cin>>n;
while(true){
s*=10;
a++;
if(n>=s)
ans+=(s-s/10)*((a-1)/3);
else{
ans+=(n-s/10+1)*((a-1)/3);
break;
}
}
cout<<ans<<endl;
} | // どこが間違っているか分からない時は,簡単なミス(型,スペル,入力or出力など)をしていたり問題文の見落としがあったりする. 一度落ち着いて頭をリセットしよう.
// 計算途中のオーバーフローに注意しよう
#include "bits/stdc++.h"
#define REP(i, n, N) for(ll i=(n); i<(N); i++)
#define RREP(i, n, N) for(ll i=(N-1); i>=(n); i--)
#define LREP(lst,itr) for(auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a... |
//#include<i_am_noob_orz>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define int ll
#define ull unsigned long long
#define pii pair<int,int>
#define X first
#define Y second
#define mod ((ll)... | #include <bits/stdc++.h>
#define SZ(v) ((int)(v).size())
using namespace std;
typedef long long ll;
const int MAXN = 1001;
int N;
int a[MAXN], b[MAXN];
int main(void)
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> N;
for (int i(1); i <= N; ++i)
cout << 1 + (2 * i)%N << ' '<< 1 + (2 * i + 1)... |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
char s[N];
int a[N], k;
int add (int a, int b) {
return ((a += b) >= mod) ? (a - mod) : a;
}
int dp[N][20], K;
int f (int l, int k) {
if (~dp[l][k]) return dp[l][k];
if (l == 0) return k == K;
dp[l][k] = (ll)... | #include<bits/stdc++.h>
#define maxn 2000010
using namespace std;
typedef long long LL;
int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*w;
}
int n,m,a[maxn],s[maxn<<2],c[maxn<<2];
void ins(int ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x;
int k;
cin >> x >> k;
int num = x;
for(int j = 0; j < k; ++j){
int n = 0;
vector<int> v;
while(num != 0){
v.push_back(num%10);
num /= 10;
n++;
}
sort(v.begin(... | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int inc(int n){
string s = to_string(n);
sort(s.begin(), s.end());
int val = stoi(s);
return val;
}
int dec(int n){
string s = to_string(n);
sort(s.begin(),s.end(), greater<char>());
int val = ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = 1e9;
const int MOD = 1... | // for(int i = 0; i < n; i++) {cin >> a[i];}
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define gcd __gcd
#define F first
#define S second
#define pii pair<int,int>
using ll = long long;
bool isSubsequence(string s, string t) {
int index = 0;
if(s.length() == 0) {... |
#include <bits/stdc++.h>
using namespace std;
#define FOE(i, s, t) for (int i = s; i <= t; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define FOD(i, s, t) for (int i = s; i >= t; i--)
#define LL long long
#define mp make_pair
#define pb push_back
#define K 600001
int a[K], b[K], n, l;
int c[K], d[K];
v... | #include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#inc... |
#define ll long long
#define dd long double
#define pb push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define fo(i ,a, n) for(ll i =a ; i < n ; i++)
//#define all(x) x.begin(), x.end()
#define tr(it, a) for(auto it ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n; cin >> n;
vector<ll> a(n),b(n); rep(i,n) cin >> a[i] >> b[i];
ll sum = 0;
vector<pair<ll,int>> s(n);
r... |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define pb(a) push_back(a)
#define vll vector<ll>
#define loop(i, n) for(ll i=1;i<=n;i++)
#define loop0(i, n) for(ll i=0;i<n;i++)
#define in(i) scanf("%lld", &i);
#define out(i) printf("%lld", i)
#define pll pair<ll, ll>
#define vpll vector<pair<l... | #include<bits/stdc++.h>
using namespace std;
# define ll long long
# define read read1<ll>()
# define Type template<typename T>
Type T read1(){
T t=0;
char k;
bool vis=0;
do (k=getchar())=='-'&&(vis=1);while('0'>k||k>'9');
while('0'<=k&&k<='9')t=(t<<3)+(t<<1)+(k^'0'),k=getchar();
return vis?-t:t;
}
# define fre(k... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
typedef long long ll;
int main(void){
int n,x;
string s;
cin>>n>>x>>s;
rep(i,s.size()){
if(s[i]=='o'){
x++;
}else if(x>0){
x--;
}else{
x=0;
}
}
... | ///−In the name of God −///
//In mathematics, an unordered pair or pair set is a set of the form {a, b},
//i.e. a set having two elements a and b with no particular relation between them.
//In contrast, an ordered pair (a, b) has a as its first element and b as its second element.
//S... |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i,a,b) for (ll i = (a); i < (ll)(b); i++)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define popcnt(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define fr first
#define... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define intarr(arr, n) ll arr[n]; for (ll i = 0; i < n; i++) cin >> arr[i]
#define inpvec(v,n) for(ll i=0;i<n... |
#include<iostream>
#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>
#include<utility>
#in... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <iomanip>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <... |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define rep(i,n) repi(i,0,n)
#define repi(i,a,n) for(ll i=a;i<(ll)n;++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define Show(val) cout<<(val)<<" "
#define Showl... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const long double PI = acos(-1.0);
const ll mod ... |
/*/ Author : Abhishek Chauhan /*/
#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;
// a+b = a^b + 2*(a&b)
// According to Fermat's little theorem, (a^b)%mod = ((a^(b%(mod - 1)))%mod) if mod is a pri... | #include<bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define yes(x) ((x) ? "yes" : "no")
#define Yes(x) ((x) ? "Yes" : "No")
using i64 = int_fast64_t;
using u64 = uint_fast64_t;
using f64 = double_t;
using p64 = pair<i64, i64>;
constexpr i64 INF = INT_FAST64... |
// Problem:
// D - Orientation
//
//
// Contest: AtCoder - AtCoder Regular Contest 111
// URL: https://atcoder.jp/contests/arc111/tasks/arc111_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using n... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../debug.h"
#else
#define debug(x...) 141
#endif
#define forn(i,x,n) for(int i = x; i < n; ++i)
#define forit(it, m) for(auto it = m.begin(); it!=m.end(); ++it)
typedef long long ll;
ll n,m,k,x,y,p=1e9+7,invm;
void mult(vector<vector<ll>>& a, vecto... |
// Problem: F - Rook on Grid
// Contest: AtCoder - Panasonic Programming Contest (AtCoder Beginner Contest 186)
// URL: https://atcoder.jp/contests/abc186/tasks/abc186_f
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using names... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
void update(int bit[],int n,int x, int val)
{
for(; x <= n; x += x&-x)
bit[x] += val;
}
int sum1(int bit[],int n)
{
int sum = 0; int x=n;
for(; x > 0; x -= x&-x)
sum += bit[x];
return sum;
}
int main()
{
int h,w,m... |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sep ' '
#define endl ... |
#include <algorithm>
#include<cfenv>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#include<numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define N 2114514
const ll mod = 998244353;
const ll inf = 1000000000000000000;
int main() {
ll n;
cin >> n;
ll ans = 0, l = 1, r = 10, num = 0;
for (int i = 0;; i++) {
if (r <= n) ans += num * (r - l);
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.