code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
/*
string r(string s){
string r;
for(int i=s.size()-1;i>=0;i--){
r+=s.at(i);
}
return r;
}
*/
int main(){
string s;
cin >> s;
string t;
bool r=false;
for(int i=0;i<s.size();i++){
if(s.at(i)!='R'){
if(!r){
if... |
// Problem: D - Message from Aliens
// Contest: AtCoder - ZONe Energy Programming Contest
// URL: https://atcoder.jp/contests/zone2021/tasks/zone2021_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include<bits/stdc++.h>
typedef long long int ll;
#defi... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
char s[200100];
ll N, pw[17][200100], a[200100], C[17][17]; const ll mod = 1e9+7;
ll D[20][20][200100], D2[20][20][200100];
ll f(ll n){
ll i, j, cnt = 0, ret = 0;
set <ll> S;
if(n == 0) return -1;
for(i=1; i<=N; i++) {
for(j=0; ... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
static const ll mod=1000000007;
string S;
ll K;
ll comb[17][17];
ll Pow[17][250001];
void init(){
for(ll n=0;n<17;n++)comb[n][0]=1;
for(ll n=1;n<17;n++)
for(ll k=1;k<=n;k++)
comb[n][k]=(n*comb[n-1][k-1])/k;
for(ll i=0;i<17;i++)Pow[i][0]=1;
... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
void Main()
{
int n;
string s;
cin >> n >> s;
int i = 0;
while (i < s.size()){
if (s.substr(i, 3) == "fox") {
s = s.substr(0, i) + s.substr(i+3);
i = max(i-3,-1);
... | #include<bits/stdc++.h>
using namespace std;
char s[200005];
int len,ans,l[200005],f[200005];
int main(){
cin>>len>>(s+1);
if(len<3){
printf("%d\n",len);
return 0;
}
for(int i=1;i<=len;i++){
l[i]=i-1;
}
for(int i=3;i<=len;i++){
if(s[i]=='x'&&s[l[i]]=='o'&&s[l[l[i]]]=='f'){
ans+=3;
l[i+1]=l[l[l[i]]];... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... | #include<bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using ll=long long;
using ld=long double;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const ll MOD=1e9+7;
template<typename T> bool ... |
#include<bits/stdc++.h>
using namespace std;
#define rapid() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
#define inf 1e36
#define pb push_back
#define mp make_pair
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define REP1(i,a,b) for(int i=a;i<=(int)b;i++)
#define ll long long int
#define ld long double
#define nl endl
#define s(a) scanf("%d",&a)
#define p(a) printf("%d",a);
#define pb push_back
const double PI=acos(-1.0);
int main(... |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long LL;
template <class T>
void read(T& x) {
x = 0;
T f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') f = (ch == '-' ? -1 : 1), ch = getchar();
while (ch >= '0' && ch <= '9') x =... | #include<iostream>
#include<vector>
#include<map>
using namespace std;
int main(){
int a, b; cin >> a >> b;
long long k; cin >> k;
vector<vector<long long>> s(a+1, vector<long long>(b+1));
for(int i = a; i >= 0; i--){
for(int j = b; j >= 0; j--){
if(i==a || j==b) s[i][j] = 1;
else{
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define abs(x)(x<0 ? -x : x)
int main(){
int x,y,a,b;
cin>>x>>y>>b>>a;
int t;
if(2*b<a){
a=2*b;
}
if(y>x){
cout<<(a*(y-x))+b;
}else if(x-y<2){
cout<<b;
}else{
cout<<(a*(x-y-1))+b;
... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0... |
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using ll = long long;
using ld = long double;
#define mp make_pair
int p = 1e9 + 7;
int mul(int a, int b) {
return (1LL * a * b) % p;
}
int add(int a, int b) {... |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> as(n), bs(n), ps(n);
for (int i = 0; i < n; i++) {
cin >> as[i];
}
for (int i = 0; i < n; i++) {
cin >> bs[i];
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool ch... |
#include <cstdio>
#include <random>
#include <ctime>
using namespace std;
std::mt19937 rnd(time(0));
long long gcd(long long a,long long b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
bool f;
int ans[135];
void solve(long long x,long long y,int &now)
{
if(now>130)
{
f=false;
return... |
#include <iostream>
#include <queue>
#include <map>
#include <cmath>
#include <algorithm>
#include <queue>
#include <cstdarg>
#include <set>
#include <limits>
#include <iomanip>
using namespace std;
#define INF 2e9 + 9
#define MOD 1000000007
#define ALL(v) v.begin() , v.end()
#define Int int64_t
#define pll pair<Int,... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
for(int i=s.size()-1;i>=0;i--)
{
if(s[i]=='1' || s[i]=='0' || s[i]=='8')
cout<<s[i];
if(s[i]=='6')
cout<<'9';
if(s[i]=='9')
cout<<'6';
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define f first
#define s second
#define pb(x) push_back(x)
#define inf (int)1e9
#define PI 3.1415926535897932384626433832795
#define mod 1000000007
#define imax INT_MAX
#define imin INT_MIN
using namespace std;
char c[5000000];
void input() {
string s;
cin>>s;
s... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(x) memset(x,0,sizeof(x))
const ll inf=1000000000000000000;
const long double ep=2.6180339887498948482045868343656;
inline int read()
{
char C=getchar();
int F=1,ANS=0;
while (C<'0'||C>'9')
{
if (C=='-') F=-1;
C=getchar();
}
while... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <t... | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) i... |
#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 drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... | //g++ 7.4.0
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAXN 200005
vector<ll> adj[MAXN];
ll vis[MAXN];
ll dp[MAXN];
ll A[MAXN];
void DFS(ll s)
{
vis[s] = 1;
for(auto it: adj[s])
{
ll v = it;
if(!vis[v])
DFS(v);
... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1000000007;
int quickpower(int a,int b){
int ans=1;
a%=mod;
while(b){
if(b&1) ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans%mod;
}
int C(int n,int m){
if(n<m) return 0;
if(m*2>n) m=n-m;
if(m==0) return 1;
int up=1,down... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
r... |
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#define fs(i,x,y) for(int i=(x),_=(y);i<=_;++i)
#define fn(i,x,y) for(int i=(x),_=(y);i>=_;--i)
#define tor(i,v,x) for(int i=head[x],v=to[i];i;i=nxt[i],v=to[i])
#define Li inline
#define R regist... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;++i)
#define mp make_pair
#define pb push_back
#define size sze
#define inf 998244353
int n,k;
vector<int> g[210000];
int v[210000],dep[210000];
int q[210000];
int f[210000][20],size[210000],son[210000],minp[210000];
int father[210000],root... |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define f(i,n) for(ll i=0;i<n;i++)
#define fa(i,a,n) for(ll i=a;i<n;i++)
#define M 1000000007
#define pb push_back
#define vl vector
#define sp(x) setprecision(x)
void code()
{
ll n;
cin>>n;
ll a... |
/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed i... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
#define repc(i,f,n) for(char i=(f); (i) <= (n); i++)
#define PI 3.14159265358979323846264338327950ll
#define debug(x) cout<<#x<<" :: "<<x... |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using... |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
t... | //CODED BY SUMIT KUMAR PRAJAPATI
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
#define PI 3.1415926535897932384626
#define pb push_back
#define mk make_pair
#define ff first
#define ss second
#define watch(x) ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll mod=998244353;
ll n,k;
ll f[3010][3010];
int read(){
int f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9'){if(ss=='-')f=-1;ss=getchar();}
while(ss>='0'&&ss<='9'){x=x*10+ss-'0';ss=getchar();}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
map<pair<int, int>, int> ans;
int solve(vector<int> & a, int x, int st)
{
if (ans[{x, st}])
{
return ans[{x, st}];
}
if (st == n - 1)
{
return 1;
}
if (x % (a[st + 1] / a[st]) == 0)
{
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc;
cin >> tc;
while(tc--){
int n;
cin >> n;
vector<long long> a(n);
for(int i=0;i<n;i++) cin >> a[i];
if(n&1){
cout << "Second\n";
}else{
sort(a.begin(),a.end());
bool bo=... | #include <bits/stdc++.h>
#define pb push_back
#define SZ(x) ((int)(x.size()))
#define FOR(i,s,n) for (ll i = (s); (i) < (n); ++i)
#define FORD(i,s,l) for (ll i = (s); (i) >= l; --i)
#define F first
#define S second
#define TC int __tc; cin >> __tc; FOR(case_num,1,__tc+1)
#define TEST(x,i) ((x)&(1ll<<(i)))
#define SET(x... |
//g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#inclu... | #include <iostream>
#include <vector>
#include <string>
int main()
{
int N;
int64_t X;
std::cin>>N>>X;
std::vector<int64_t> A(N);
for(auto &e:A)std::cin>>e;
std::string result;
result.reserve(11*N);
for(auto e:A)if(e!=X)(result+=std::to_string(e))+=' ';
if(result.empty()==false)result.pop_back(... |
#include<bits/stdc++.h>
using namespace std;
const int maxn=55;
struct to {
int x,y,id;
} dd[5],d[5];
int a[maxn][maxn],w[maxn][maxn],ans[maxn*maxn],temp[maxn*maxn],vis[maxn*maxn],sum=0,n=50,finalans=0,s[maxn];
char p[5]= {'\0','D','R','U','L'};
bool cmp(to a,to b) {
return s[a.id]>s[b.id];
}
int get(int x,int y,to a... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define MOD 1000000007ll
#define INF 1000000000000000000ll
#define pb push_back
#define fs first
#define sc second
const double pi = acos(-1);
vector<bool> dfs(int start, vector<vector<int>>& adj) {
stack<int> s;
s.push(start);
vector<bool> vis(adj... |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 1e5 + 10;
int n, m;
int tot, Head[N], ver[N << 1], Next[N << 1], Leng[N << 1];
int fa[N], ans[N];
void add(int x, int y, int z) {
tot++;
ver[tot] = y;
Leng[tot] = z;... | #include<bits/stdc++.h>
using namespace std;
using namespace std::chrono;
const int mod=1e9+7;
const int mex=300005;
#define ll long long
#define test int t;cin>>t;while(t--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,n) for(int i=a;i<n;i++)
#define rfo(i,a,b) for(int i=a;i>=b;i--)
#... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define ALL(x) (x).begin(),(x).end()
using P = pair<int,int>;
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; }... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (n); i++)
using ll = long long;
using P = pair<ll, ll>;
template<class T>
bool chmax(T &a, T b) {if (a < b) {a = b;return true;}else return false;}
template<class T>
bool chmin(T &a, T b) {if (a > b) {a = b;return true;}else retu... |
#include <bits/stdc++.h>
template <class T>
inline void read(T &x) {
static char ch;
static bool opt;
while (!isdigit(ch = getchar()) && ch != '-');
x = (opt = ch == '-') ? 0 : ch - '0';
while (isdigit(ch = getchar()))
x = x * 10 + ch - '0';
if (opt)
x = ~x + 1;
}
template <class T>
inline void putint... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const long long MOD = 1000000007;
signe... |
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;... |
//Ctrl+Shift+Bでコンパイル
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long t,N;
cin >> t >> N;
long long ans = 0;
long num = N/t;
int num_a = N%t;
if(num_a == 0){
ans = num*(100+t) - 1;
}
else{
ans = num*(100... | #include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<utility>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define sec second
#define pq priority_queue
#define lb lower_bound
#define ub upper_bound
#define ll long long int
#define endl "\n"
#define all(x) (x).begin()... |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <sstream>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <string.h>
#include <assert.h>
#include <ioma... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
double n,x,y;
cin>>n>>x>>y;
double maxi=INT_MAX;
while(n--)
{
double u,i;
cin>>u>>i;
maxi=min(maxi,x*... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int N, T;
cin >> T;
for(int i = 0; i < T; i++){
cin >> N;
if(N % 2 == 0){
if(N % 4 == 0){
cout << "Even" << endl;
}else{
cout << "Same" << endl;
}
... |
#include <map>
#include <set>
#include <math.h>
#include <queue>
#include <cstdio>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#define f(i,a,b) f... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int ans=0;
for(int i=0;i<=9999;i++)
{
bool flag[10]={false};
int x=i;
for(int j=0;j<4;j++)
{
flag[x%10]=true;
x/=10;
}
int f2=1;
for(int i=0;i<10;i++)
{
if(s[i]=='o'&&flag[i]==false)
... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... |
#include<bits/stdc++.h>
using namespace std;
int t[10];
int tp[50]={8,16,24,32,40,48,56,64,72,80,88,96};
int main()
{
string s;
cin>>s;
for(int i=0;i<s.size();i++)
{
int d=s[i]-'0';
t[d]++;
}
if(s.size()>=3)
{
for(int i=112;i<=999;i+=8)
{
int a1,b1,c1;
a1=i/100;
b1=i/10%10;
c1=i%10;
t[a1]--;
t[... | #include<bits/stdc++.h>
#define ll long long
#define re register
#define INF 2147483647
using namespace std;
inline ll read()
{
ll f=1,x=0;char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-') f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-48;
s=getchar();
}
return f*x;
}
ll mul(ll a,ll b,ll mod)
... |
#include<bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i) < (n);(i)++)
#define repsec(i,m,n) for(int (i)=(m);(i) < (n);(i)++)
#define ll long long
#define mod 998244353
#define MOD 1000000007
using namespace std;
int gcd(int a,int b){
if(b == 0) return a;
else return gcd(b,a%b);
}
int main(){
int n,ans;
cin... | //#pragma GCC optimize(4)
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define REP(u) for(int i=p[u];i!=-1;i=e[i].nxt)
#define ll long long
#define ull unsigned long long
#define PII pair<int,int>
#define rd (rand()<<16^rand())
#define pb push_back
#define iter multiset<int>::iterator
using namespac... |
#include <iostream>
using namespace std;
int main() {
int H, W, aij;
cin >> H >> W;
int minblock = 1e9;
int sum = 0;
for (int i = 0; i < W; i++) {
for (int j = 0; j < H; j++) {
cin >> aij;
minblock = min(aij, minblock);
sum += aij;
}
}
cout << sum - (minblock * H * W) << endl;
}
| #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define max(a, b) (a < b? b : a)
#define min(a, b) ((a>b)?b:a)
#define MOD 1000000007
#define FOR(a,c) for ( ll (a)=0; (a)<(c); (a)++)
#define FORL(a,b,c) for ( ll (a)=(b); (a)<(c); (a)++)
#define FORR(a,b,c) fo... |
#include <stdio.h>
#include <vector>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pl;
int main(void) {
ll i, j, n, m, x, y, z, cnt;
scanf("%lld%lld", &n, &m);
vector<pl> vec[n + 1];
ll dp[1 << n], sum[n];
for(i = 0; i < 1 << n; ++i) dp[i] = 0;
dp[0] = 1;
for(i = 0; i... | #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#includ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0,endrep=(n); i<endrep; ++i)
#define rep1(i,n) for(ll i=1,endrep=(n); i<=endrep; ++i)
#define revrep(i,n) for(ll i=(ll)(n)-1; i>=0; --i)
inline constexpr ll Inf = (1ULL << 60) -123456789;
#define fastio cin.tie(0); ios_base::s... | #include <bits/stdc++.h>
using namespace std;
static const int INF=1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
int A[200010];
int dp[200010];
int main(){
int n,m;
cin>>n>>m;
rep(i,n) cin>>A[i];
vector<int>edge[n];
rep(i,m){
int a,b;
cin>>a>>b;
a--;
b--;
edge[a].push_back(b);
}
r... |
#include<bits/stdc++.h>
#define re register
#define mod 998244353
#define eps (1e-10)
#define int long long
using namespace std;
#define N 100010
int n;
double f[N];
template <class T> inline void read(T &x)
{
x=0;int g=1;char ss=getchar();
for (;ss>'9'||ss<'0';ss=getchar()) if (ss=='-') g=-1;
for (;ss<='9'&&ss>='0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main(){
int N;
cin >> N;
double sum = 0;
for(int i = 1; i < N; i++){
sum += double(1) / i;
}
cout << fixed << setprecision(7);
cout << N * sum << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
vector<int> x(200001, 0);
for (int i = 1; i <= b; ++i) {
x[i] = b / i - (a - 1) / i;
}
int ret = 1;
for (int i = 1; i < 200001; ++i) {
if (x[i] >= 2) {
if (ret < i) ret = i... | #include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <set>
#include <climits>
#include <cmath>
using namespace std;
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define MOD 1000000007
#define MAX 100005
usi... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
int solve(int nkr, int b, int a, int i) {
if (nkr == 0) return 0;
int cur = 1;
while (true) {
int we = nkr / cur;
if (we < a) return -1;
else if (we < b) return cur;
... | typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ld a,b,c,d;
std::cin >> a>>b>>c>>d;
d *= -1;
std::cout <<setprecision(20)<< -b*(c-a)/(d-b)+a << std::endl;
}
|
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace chrono;
typedef long long int ll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define pb push_back
#define odd(x) ((x)&1)
#define even(x) (!odd(x))
#define all(v) (v).begin(),(v).e... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define DREP(i,s,n) for(int i = (s); i < (n); i++)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}ret... |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define endl "\n"
#define maxpq priority_queue<ll>
#define minpq priority_queue<ll, vector<ll>, g... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <limits>
#include <string>
using namespace std;
int main() {
int V, T, S, D;
cin >> V >> T >> S >> D;
cout << ((V * T > D || (V * T + (V * (S - T)) < D)) ? "Yes" : "No") << endl;
return 0;
}
|
/* cerberus97 - Hanit Banga */
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
#define pb p... | #include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) ... |
//#include<math.h>
#include<algorithm>
#include<stdlib.h>
#include<time.h>
#include<stdio.h>
#include<string.h>
#define un unsigned
#define srd srand(time(0))
#define ll long long
#define con continue
#define gtc getchar()
#define ptc putchar
#define dou double
#define eps 0.00000000001
#define opr operator
#define cl(... | #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>
# define INF32 2147483647
# define INF64 9223372036854775807
# define rep(i,l,n) for(int i=l,i##_end=n;i<i##_end;++i)
# define rrep(i,n,l) for(int i=((int)(n)-1),i##_end=l;i>=i##_end;--i)
# define erep(i,n) for(auto &i : n)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int flag=0;
for(int i=0;i<s.length();i++)
{
if( (i%2==0) )
{
if(s[i]>= 'a' && s[i]<= 'z') flag=1;
else {flag=0; break;}
}
else if(i%2==1)
{
if(s[i]... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forin(in ,n) for(ll i=0; i<n; i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) fo... | #include<bits/stdc++.h>
using namespace std;
long long f[5001][5001];
const int mod=998244353;
int main()
{
int n,m;
cin>>n>>m;
for (int i=0;i<=m;i++){
f[i][0]=1;
for (int j=1;j<=n;j++){
f[i][j]=f[i][j-1]*1ll*i%mod;
}
}
long long res=1ll*n*f[m][n]%mod;
f... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define mod ((int)1e9+7)
#define lim 1000000000000000007
#define lim1 18446744073709551615 //Unsigned
#define sq(a) ((a)*(a))
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mms(v,i) memset(v,i,siz... | #include<iostream>
using namespace std;
int main(void)
{
int n; cin>>n;
if(n&1) puts("Black");
else puts("White");
return 0;
} |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_bac... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 200005
typedef long long ll;
typedef unsigned long long ull;
ull Max = 0x3f3f3f3f3f3f3f3f;
ull dist[MAXN];
typedef struct
{
ull to;
ull t, k;
} Node;
vector<Node> vec[MAXN];
ull N, M, X, Y;
void min_len2()
{
using Pair = pair<ull, ull>;
for... |
#include<iostream>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<a*d-b*c<<endl;
return 0;
} | //Bismillahirrahmanirrahim
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(fa... |
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
const LL MOD = 998244353;
int board[1010][1010]; // マスの色... | #include <bits/stdc++.h>
#define rep(i,n) for ((i)=1;(i)<=(n);(i)++)
using namespace std;
const int mod=998244353;
int n,m,i,j,s=1;
char c[505][505];
int main(){
cin>>n>>m;
rep(i,n)rep(j,m)cin>>c[i][j];
for(i=1+1;i<=n+m;i++){
bool b=0,r=0;
rep(j,n){
int k=i-j;
if(1<=k&&k<=m){
if(c[j][k]=='B')b=1;
i... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
/**********************************************/
void solve() {
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_std... | // Winners don't quit and Quitters don't win
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vii vector<int>
#define vll vector<ll>
#define mod 998244353
#define MAX 100005
int main()
{
#ifndef ONLINE_JUDGE
// for... |
/*
设dp[i][j]为当前算到tak拿了i个物品，它的和为j的方案数。
*/
#include<cstdio>
const long long mod=998244353;
long long n,w[110],sum,dp[110][10010],power[110],ans;
int main()
{
scanf("%lld",&n);
for(long long i=1;i<=n;++i) scanf("%lld",&w[i]);
dp[0][0]=1;
power[0]=1;
for(long long i=1;i<=n;++i)
{
power[i]=(power[i-1]*i)%mod;
for... | #include <bits/stdc++.h>
const int N = 105, P = 998244353;
int n, a[N], sum = 0, f[N][N * N], g[N][N * N], fac[N]; // 1：当前权值；2：<0次数
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]), sum += a[i];
if (sum & 1) { puts("0"); return 0; }
fac[1] = 1;
for (int i = 2; i <= n; i++)
fac[i] =... |
#include <bits/stdc++.h>
#define pb(x) push_back(x)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F(w,x,y) for(ll w=x; w<y; w++)
#define endl "\n"
#define mod 1000000007
typedef long long ll;
typedef long double ld;
using namespace std;
void play()
{
ll n,a;
cin>>n;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
int n,a[200010];
long long sum[200010],ma;
void solve() {
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++) sum[i]=sum[i-1]+a[i];
for(int i=1;i<=n;i++) sum[i]=sum[i-1]+s... |
#include<bits/stdc++.h>
#define MAXN 50+10
#define MAXM 2500+10
using namespace std;
const int n = 50;
int si,sj;
string Fs = "RDLU";
int Fx[10] = {0,1,0,-1};
int Fy[10] = {1,0,-1,0};
int Soc[MAXM];
bool vis[MAXM];
int t[MAXN][MAXN];
int p[MAXN][MAXN];
string Move,s;
int Now = 0;
int Ans = 0;
const int Time_Lim... | #include<bits/stdc++.h>
using namespace std;
int n,t,a[102],ans;
set<int> q;
void Dfs1(int dep,int sum){
if(sum>t)
return;
if(dep==(n>>1)+1){
q.insert(sum);
return;
}
Dfs1(dep+1,sum),
Dfs1(dep+1,sum+a[dep]);
}
void Dfs2(int dep,int sum){
if(sum>t)
return;
if(dep==n+1){
set<int>::iterator i=q.upper_boun... |
// D - RGB Coloring 2
// sample code
// reference: https://atcoder.jp/contests/abc199/submissions/22053625
#include <bits/stdc++.h>
using namespace std;
#define vec vector
using vi = vec<int>;
using ll = int64_t;
#define rep(i,e) for(int i=0;i<(e);++i)
vec<vi> G;
vi IX; //彩色順を記録。違う連結成分なら同じ index もある
ll dfs(int now, v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MO... |
// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#incl... | #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 rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, b) for (ll i = a; i < b; ++i)
#define rep_down(i, a, b) for (ll i = a; i > b; --i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
#define v... | #include "bits/stdc++.h"
using namespace std;
int h, w, a, b;
long long dp[1 << 16][9];
bool ok[16];
void solution() {
cin >> h >> w >> a >> b;
int mx = h * w;
for (int i = 0; i < mx; i ++) {
if ((i + 1) % w == 0) ok[i] = false;
else ok[i] = true;
}
dp[0][0] = 1;
for (int msk = 0; msk < (1 << mx); m... |
// Jai Shree Ram
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define ll long long
#define int long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define endl "\n"
#define x first
#define y ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using... |
#include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define all(c) c.begin(),c.end()
#define de... | #include <bits/stdc++.h>
using namespace std;
int main()
{
double R, X, Y;
cin >> R >> X >> Y;
double dist = sqrt(pow(X, 2) + pow(Y, 2));
double ans = dist / R;
if (ans < 1.0) {
ans = 2;
}
cout << ceil(ans) << endl;
return 0;
}
|
#include<iostream>
#include <iomanip>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(int i=a;i<b;i++)
#define it(x,b) for(auto &x:b)
#define NUM 1000000007
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define endl "\n"
long long binpow(long long a, long long b) {
if (b =... | #include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <climits>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <bits/stdc++.h>
using namespace std;
#define lson 2*i
#def... |
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 100 + 10 ;
int Sub(int x , int y , int mod)
{
x -= y ;
if(x < 0)
x += mod ;
return x ;
}
int arr[MAX] ;
int n ;
long long x ;
int dp[2][MAX][MAX] ;
int main()
{
ios_base:... | #include <bits/stdc++.h>
using namespace std;
const long long MOD=998244353;
vector<long long> fact, fact_inv, inv;
void init_nCk(int n){
fact.resize(n+54);
fact_inv.resize(n+54);
inv.resize(n+54);
fact[0]=fact[1]=fact_inv[0]=fact_inv[1]=inv[1]=1;
for(int i=2;i<n+54;i++){
fact[i]=(fact[i-1]*... |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n;
int a[maxn];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#in... |
#pragma GCC optimize("Ofast")
//#pragma GCC target ("sse4")
#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<bitset>
#include<stack>
#i... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define ps(x, y) fixed << setprecision(y) << x
#define w(x) int x; cin >> x; while(x --)
#define mk(arr, n, type) type *arr = new type[n];
#define gcd(x, y) ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define mem(x) (memset(x,0,sizeof(x)))
type... | #include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <set>
typedef long long ll;
#define int long long
#define endl "\n"
#define forp(i, x, t) for (int i = x; i < t; i++)
#define forn(i, t) for (int i = t; i >= 0; i--)
#define deb(x) cout << #x << " = " << x << endl
const int mod = 1e... |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int main(void)
{
int n,m;
scanf("%d%d",&n,&m);
if(m == 0)
{
for(int i=1; i<=n; ++i)
printf("%d %d\n",2*i-1,2*i);
return 0;
}
if(... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <set>
#include <vector>
#include <deque>
#include <queue>
#include <numeric> //gcd,lcm c++17
#include <tuple>
#include <iomanip> //setprecision
#include <unordered_map>
#include <chrono>
//#define _GLIBCXX_DEBUG
using na... |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, q;
int t[... | /********include********/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <ra... |
#include <ctime>
#include <deque>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <climits>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <regex>
#include <set>
#include <bitset>
const int64_t infl = 1LL << 60;
con... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using V = vector<int>;
using Q = queue<int>;
using Graph = vector<vector<int>>;
#define sz(x) ((int)(x).size())
#define in(x) int x;cin>>x
#define inn(x, y) int x,y;cin>>x>>y
#define innn(x, y, z) int x,y,z;cin>>x>>y>>z
#define bit(n) (1<<(n))
#de... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define LOCAL
#endif
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<ll> vi;
typedef vector<pll> vpll;
const ll infl=0x3f3f3f3f3f3f3f3fLL;
const int infi=0x3f3f3f3f;
#define endl '\n'
#define pb pus... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e18;
const ... | #include <bits/stdc++.h>
#define DEBUG if(0)
#define lli long long int
#define ldouble long double
using namespace std;
const int maxN = 20; int n;
lli a[maxN];
lli solve(int i = 0, lli currOr = 0, lli currXor = 0)
{
if (i == n) return currXor ^ currOr;
currOr |= a[i];
lli ans = min(
solve(i + 1, 0, currXo... |
#include <bits/stdc++.h>
//#define DEBUG
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define deb(x) std::cout << #x << " " << x << endl;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template<typename... T>
void read(T& ... a){
((cin >> a),...);
}
template<type... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<class T,class U> inline bool chmin(T&x,U y){if(x>y){x=y;return true;}return false;}
template<class T,class U> inline bool chmax(T&x,U y){if(x<y){x=y;return true;}return false;}
void solve(){
int a,b;
cin>>a>>b;
cout<<(a+b)/2<<" "<<(a... |
#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
... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << ": " << (x) << endl;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> iip;
string s;
int cnt[10] = {0};
bool check(int last_digit) {
// debug(last_digit);
if (!cnt[last_digit]) r... |
#include "bits/stdc++.h" //custom precompiled stdc++.h header :)
using namespace std;
#define ll long long int
#define Print(x) cout << x << endl
#define PrintAns(x) cout << x << endl; return
#define PrintPrec(x, y) cout << fixed << setprecision(y) << x << endl;
#ifdef SUBLIME
#... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n,i;
cin>>n;
ll A[n];
ll S=0;
for(i=0;i<n;i++)
{
cin>>A[i];
S+=A[i];
}
sort(A,A+n);
ll prev=0,ans=0;
for(i=0;i<n;i++)
{
ll p1,p2;
prev+=A[i];
p1=(i+1)*A[i]-prev;
... |
#include <iostream>
using namespace std;
#define STRMAX 101
int main()
{
int V, T, S, D;
char str[STRMAX];
cin >> V >> T >> S >> D;
int x_T = V * T;
int x_S = V * S;
if(D >= x_T && D <= x_S) cout << "No" << endl;
else cout << "Yes" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans = n*1.08;
if(206>ans){
cout << "Yay!" << endl;
}
else if(206 == ans){
cout << "so-so" << endl;
}
else{
cout << ":(" << endl;
}
} |
#include <bits/stdc++.h>
#define rei register int
using namespace std;
const int maxn = 1010;
int h,w;
string s[maxn];
queue<int>q;
int vish[maxn],visw[maxn],cnth = 2,cntw = 2;
void updateh(int x){
for(rei i = 0;i < w;++i) if(s[x][i] == '#') {
if(visw[i + 1] == 0){
visw[i + 1] = 1; q.push(i + 1); ++cntw;
}
... | #include<bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,abm,mmx,avx,avx2")
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define req(i,a,b) for(int i=(a);i>=(b);--i)
#define rep_(i,a,b) for(int i=(a);i<(b).size();++i)
#define F(a) rep(a,1,n)
#define M(a,b) memset(a,b,sizeof a)
#define DC int T;cin>>T;while(... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define forn(i,a,n) for (int i=a; i<n; i++)
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int b,c;
cin>>b>>c;
if (b!=0 && c==1){
cout<<2<<endl;
... | #include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <bits/stdc++.h>
using namespace std;
#define lson 2*i
#define rson 2*i+1
#d... |
// Hail god Yato
#include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
//
//
int ncr(int n, int r){
if(r > n || r < 0)
return 0;
if(n < 3){
int a... | /*
ALLAH is Almighty....
*/
#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 pi acos( -1.0 )
#define rep( i, a, n ) for ( ll i = a; i < n; i++ )
#define per... |
//2*10^9
//9*10^18
// __int128_t
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long int
#define ll long long int
const ll M=1e9+7;
//to handle when remainder is -neg we add + M
//but when rem is +pos that time also we add so use %M
//so it will work for both
ll mod(ll n){
return (n%M + ... | #include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define fst first
#define snd second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define EPS (1e-9)
#define equals(a,b) (fabs((a)-(b))<EPS)
using namespace std;
bool LT(double a,double b) { return !equals(a,b) && a ... |
#include <bits/stdc++.h>
using namespace std;
vector<vector<bool>> masu(10,vector<bool>(10));
int h,w;
int main(){
char s;
int ans=0;
bool a,b,c,d;
cin>>h>>w;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>s;
if(s=='#'){
masu.at(i).at(j)=true;
}else{
masu.at(i).at(j)=... | #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... |
#include <bits/stdc++.h>
using namespace std;
template <int64_t mod>
class modint {
int64_t x;
public:
modint(int64_t x = 0) : x((x % mod + mod) % mod) {}
modint operator-() const { return modint(-x); }
modint& operator+=(const modint& a) {
if ((x += a.x) >= mod) x -= mod;
return *this... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author NikuKyabe
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M, K;
cin >> N >> K >> M;
int sum=0;
int purpose = M*N;
for(int i=0; i<N-1; i++){
int x;
cin >> x;
sum+=x;
}
if(purpose - sum <=K){
if(purpose-sum >=0){
cout << purpose-sum << endl;
}else
{
cout << 0 << e... | #include <bits/stdc++.h>
using namespace std;
static const auto do_fast_io = [] {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
return nullptr;
}();
int main() {
int a, b, c;
cin >> a >> b >> c;
long long req = (a * a) + (b * b);
if (req < c * c) {
cout << "... |
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define INF ((1LL<<62)-(1LL<<31))
typedef long long ll;
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a ... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i=1; i < (int)(n); i++)
#define rrep(i, n) for (int i=((int)(n)-1); i>=0; i--)
#define rreps(i, n) for (int i=((int)(n)-1); i>0; i--)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using name... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
// ll t;
// cin>>t;
// while (t--)
// {
ll n,x;
cin>>n>>x;
ll a[n];
for (int i = 0; i < n; i++)
{
cin>>a[i];
}
for (int i = 0; i < n; i++)
{
if(a[i]... |
#include<iostream>
using namespace std;
int main(){
long long int i,j,k,n;
cin>>n;
long long int a[n],b[n];
long long int ma,mi;
cin>>a[0];
ma=a[0];
for(i=1;i<n;i++){
cin>>a[i];
if(a[i]>ma){
ma=a[i];
}
}
cin>>b[0];
mi=b[0];
for(i=1;i<n;i++){
cin>>b[i];
if(b[i]<mi){
mi=b[i];
}
}
... | #include <bits/stdc++.h>
using namespace std;
const int N=1100;
int pre[N];
int main()
{
int n,x=1;
cin>>n;
vector<int> a(n+1);
vector<int> b(n+1);
for(int i=0;i<n;i++)
{
cin>>a[i];
pre[a[i]]++;
}
for(int i=0;i<n;i++)
{
cin>>b[i];
pre[b[i]+1]--;
}
int ans=0;
for(int i=1;i<1100;i++)
{
pre[i] +... |
//#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define bit(... | #include <bits/stdc++.h>
using namespace std;
#define len(a) (int) a.size()
#define long long long
int nxt() {
int a;
scanf("%d", &a);
return a;
}
const int N = 55;
long dp[N][2];
long a[N];
long k[N];
long s;
int can[N];
int n;
int main() {
n = nxt();
scanf("%lld", &s);
for (int i = 0; i ... |
//libraries
#include<bits/stdc++.h>
//namespace
using namespace std;
//typedef
//typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//typedef tree<long long,null_type,greater<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set1;
typed... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
//ll の最大値 2147483647≒10^9
//long longの最大値 9,223,372,036,854,775,807≒10^18
ll gcd(ll a, ll b){
if(a%b==0){
return b;
}
else{
return gcd(b,a%b);
... |
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using vl = vector<ll>;
#define ice(i, a, b) for (int (i) = (a); (i) < (b); ++(i))
const ll INF = 1e18;
ll A, B, C, A2, B2, C2;
vl a(200000), t(200000);
void fix(ll& X, ll& Y, ll& Z, int idx) {
if (t[idx] == 1) {
X = a[idx], Y = -INF, Z ... | #include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
long long N, A[1 << 18], T[1 << 18];
long long Q, X[1 << 18];
int main() {
// Step #1. 入力
cin >> N;
for (int i = 0; i < N; i++) cin... |
#include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... |
#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;
enum{N=207};
int n,X[N],Y[N],R[N],A[N],B[N],C[N],D[N],P[N];
int O(int x,int y,int z) {
return x<=y&&y<=z;
}
int banana(int a,int b) {
return (
(O(A[a],A[b],C[a])||O(A[a],C[b],C[a])||O(A[b],A... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
//#include <queue>
//#include <stack>
#include <cstring>
#include <cassert>
using namespace std;
#ifdef LOCAL_DEBUG
#include <local_debug.h>
#define DEBUG(...) DBG2::print(#__VA_ARGS__, __LINE__, __VA_ARGS__)
#e... |
#include <stdio.h>
int n;
int h[256][256];
int main() {
scanf("%d", &n);
h[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < (1 << i); j++) {
for (int k = 0; k < (1 << i); k++) {
h[j + (1 << i)][k] = h[j][k];
h[j][k + (1 << i)] = h[j][k];
h[j + (1 << i)][k + (1 << i)] = -h[j][k];
}
}... | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
#define sz(x) (int)(x).size()
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
cout << (1<<n)-1 << "\n";
for(int i=1; i<=(1<<n)-1; i++) {
for(int j=0; j<(1<<n); j++)
cou... |
#include<bits/stdc++.h>
#define ll long long
#define re register
#define INF 2147483647
using namespace std;
inline int read()
{
int f=1,x=0;char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-') f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-48;
s=getchar();
}
return f*x;
}
struct node
{
int op;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
using pii = pair<int, int>;
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 (... |
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include<bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define pf ... |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
#define pb push_back
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define pi pair<int,int>
#define vi vector<int>
#define mii map<int,... |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
return buf[s++];
}
... | #include <iostream>
#include <vector>
#include <unordered_map>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <bits/stdc++.h>
#include <iomanip>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
//cout << std::fixed << std::setpre... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define reps(i,n) for (int i = 1; i <= (n); ++i)
#define rrep(i,n) for (int i = (n) - 1; i >= 0; --i)
#define rreps(i,n) for (int i = (n); i > 0; --i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define PB push_back
#defin... | #include <bits/stdc++.h>
using namespace std;
int main(){
long n;
cin >> n;
long c[n][n], k[n] = {}, g[n] = {}, mnx = 0, mny = 0;
bool b = 1;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++) cin >> c[i][j];
}
for(int i = 1; i < n; i++){
k[i] = c[i][0] - c[0][0];
... |
#include <iostream>
#define ll long long
using namespace std;
const ll MOD=1e9+7;
int main() {
ll n,p,now,ans=1;
cin>>n>>p;
now=p-2;
n--;
while(n){
if(n%2) {
ans*=now;
ans%=MOD;
}
now*=now;
now%=MOD;
n/=2;
}
ans*=(p-1);
ans%=MOD;
cout<<ans;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("a.out","w",stdout); // console output is better (in most cases)
#else
// add i/o method of specific testing system
#... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using ll=long long;
using ld=long double;
using namespace std;
int main(){
ll n;cin>>n;ll res=0;
ll m=n+1;ll ns=0;
for(ll i=1;;i++){
ns+=i;
if(ns>m)break;
res++;
}
cout<<n+1-res<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fo(a,b) for(int64_t a=0;a<b;a++)
#define sor(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define ll int64_t
#define mod 1000000007
#define vl vector<int64_t>
int main(){
ll n;
cin>>n;
ll ub=n+2;
ll lb=-1;
while(ub-lb>1){
ll mid=(lb... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define ins insert
#define pqueue... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
int read()
{
char ch=getchar();int f=0,x=1;
while(ch<'0'||ch>'9'){if(ch=='-') x=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){f=(f<<1)+(f<<3)+ch-'0';ch=getchar();}
return f*x;
}
char s[500... |
#include<bits/stdc++.h>
int main(){
int a,b,c,d;
scanf("%d%d%d",&a,&b,&c);
d=a+b+c;
puts(d==a*3||d==b*3||d==c*3?"Yes":"No");
} | #include<bits/stdc++.h>
using ll= long long;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define RREP(i,n) for(ll i=1;i<ll(n+1);i++)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define ALL(x) x.begin(),x.end()
#define INF (int)1e9 //10^9:∞
#define LLINF (long long)1e12
#define MOD (int)1e9+7 //10^9+7:合同式の法
#define PI 3.1... |
//Never stop trying
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
constexpr int mod=1e9+7;
int p2[4000001],y[2000][2000],t[2000][2000];
signed main(){
int h,w;
string s[2000];
cin>>h>>w;
for(int i=0;i<h;i++)
cin>>s[i];
for(int i=0;i<h;i++){
int tmp=0;
for(int j=0;j<w;j++){
... |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
//rep…「0からn-1まで」の繰り返し
#define rep2(i,s,n) for(long long i=s; i<=(long long)(n);i++)
//rep2…「sからnまで」の繰り返し
#define repr(i,s,n) for(long long i=s;i>=(long long)(n);i--)
//repr…「ｓから... | #include<iostream>
#include<vector>
#include<algorithm>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<string.h>
#include<math.h>
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define F first
#define S second
#define MAX 500005
#define MOD (ll)(1e9+7)
#define IN... |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 10000000000000007;
const long long mod = 1000000007;
typedef long long ll;
typedef pair<int, int> P;
template<class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
vector<int> table(2500);
vector<... | #include <iostream>
#include <queue>
using namespace std;
int R, C;
int A[501][501], B[501][501];
int dijkstra() {
bool used[501][501] = {};
int minScore[501][501] = {};
for(int i = 0;i < 501;i++) {
for(int j = 0;j < 501;j++) {
minScore[j][i] = 1000000000;
}
}
priorit... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.