code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a; i >-1; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define... | #include <iostream>
#include <string>
#include <cmath>
#include <vector>
using namespace std;
int main(int argc, char** argv)
{
unsigned long long int n,res,it, last,price;
long double nr,t;
res = 0;
nr = 1;
it=0;
last = 0;
cin>>t>>n;
price = ceil((100/t)*n)+(n-1);
cout<<price<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ll = long long;
using vl = vector<long long>;
int main(){
string s; cin >> s;
bitset<18> bb;
bool flag = false;
int ans = 0,cntmin=20;
for(int ix=0;ix<(1<<(int)s.size());ix++){
bb = ix;
int tmp=0,cnt=0;
... | #include <bits/stdc++.h>
using namespace std;
using ll_t = long long;
using digits_t = vector<int>;
digits_t get_digits(int n) {
digits_t digits;
while(n) {
auto d = n%10;
digits.push_back(d);
n /= 10;
}
reverse(digits.begin(), digits.end());
return digits;
}
int main() {
ll_t n;
cin >> n... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#defin... | #include <bits/stdc++.h>
using namespace std;
#define pii pair<long long, long long>
#define FOR(x, j) for(int x = 0; x < j; x++)
using ll = long long;
const int LEAF = 18;
int tree[2*LEAF];
const int maxN = 2e5+10;
//const ll INF = 1000LL*1000LL*1000LL*1000LL*1000LL*10LL;
const int INF = 2e9;
ll DP[maxN];
ll A[m... |
#include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#define int long long
#define ri register
#define mk make_pair
#define fi first
#define se second
#define pb push_b... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... |
//#include <atcoder/maxflow.hpp>
#include <memory>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int n, x, mx; ll s, t;
void solve() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> x;
s += x, t += s;
mx = max(mx, x);
cout << t + 1ll * i * mx << "\n";
}
}
int main() {
ios::sync_with_stdio(false), cin... |
#include<bits/stdc++.h>
#define inf INT_MAX
#define sc(a) scanf("%d",&a)
#define scc(a,b) scanf("%d %d",&a,&b)
#define sccc(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define lsc(a) scanf("%lld",&a)
#define lscc(a,b) scanf("%lld %lld",&a,&b)
#define lsccc(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define pf(a) printf("%d",a)
#def... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long N;
cin >> N;
N *= 2;
long long count = 0;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
long long j = N / i;
if (i % 2 != j % 2) {... |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
bool flag=1;
int x=0;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')
flag=0;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return (flag?x:~(x-1));... | #include <bits/stdc++.h>
using namespace std;
#define M 1005
#define LL long long
const LL mod = 1000000007;
int n;
LL f[M];
char Caa, Cab, Cba, Cbb;
inline LL qkpow (LL x, LL y){
LL res = 1;
while (y){
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
signed main (){
scanf ("%d... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int n;
cin >> n;
int ans = 0;
while (n--)
{
int x;
cin >> x;
ans = __gcd(x, ans);
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int,int> pii;
typedef long long ll;
const long long MOD=1000000007;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep2(i,m,n) for(ll i=(m);i<(n);i++)
#define ALL(v) v.begin(), v.end()
#define pb push_bac... |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <deque>
#include <set>
#include <sstream>
#include <stack>
#include <... | #include <stdio.h>
#include <math.h>
int main(){
long long int n, i, j;
scanf("%lld", &n);
long long int root = sqrt(n);
int found = 0;
long long int a = 1, b = 1;
for (i = 3; i < n; i*=3)
{
b = 1;
for (j = 5; j < n; j*=5)
{
if (i+j == n)
{
found = 1;
printf("%lld %lld\n", a, b);
... |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e2+10;
const int M = 1e4+10;
typedef pair<int,int> pii;
#define fr(i,a,b) for(int i = a;i <= b; ++i)
#define nfr(i,a,b) for(int i = a;i >= b; --i)
#define pb push_back
vector<int> edge[N],id[N];
int c[N],ans[M];
pii p[M];
int n,m;
int dfn[N],tot;
inline void... | #include<bits/stdc++.h>
using namespace std;
int n,m;
vector<vector<int>>a;
vector<pair<int,int>>ds;
int b[104][104];
const int nmax=1e6;
int c[nmax+4];
int mau[105];
int cha[105];
int hang[105];
vector<pair<int,int>>kq;
void dfs(int u)
{
mau[u]=1;
for(int i=0; i<a[u].size(); ++i)
{
int v=a[u][i];
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define INF (int)(1e9)
#define MAXX 1.1529215e+18
#define inf 999999
#define EPS (1e-7)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(... | /**
* author: yixxas
* created: 19.12.2020 19:56:03
**/
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cassert>
using namespace std;
int main(){
int a,b;
cin >> a>> b;
cout << a/b;
return 0;
}
//What we know is a drop, what we don't is an ocean.
|
#include <bits/stdc++.h>
using namespace std;
int solve(int x){
int sum = 0;
while(x > 0){
sum += x%10;
x = x/10;
}
return sum;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int a,b;
cin>>a>>b;
int k = solve(a);
int c = solve(b);
cout<<max(k,c)<<"\... | #include <bits/stdc++.h>
#include <fstream>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF=2147483647;
// 9,223,372,036,854,775,807
const ll INFL = 9223372036854775807;
int s(string x){
int l,m,n;
l = x[2] - '0';
m = x[1] - '0';
n = x[0] - '0';
... |
#include <bits/stdc++.h>
#include<random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i... | //#undef DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll llinf = (1ll<<61)-1;
#define sz(a) int(a.size())
#define all(x) begin(x), end(x)
#ifdef DEBUG
const int DEBUG_END = 26;
#define DOS cout
#include <debug.h>
#else
#define bug(args...) void()
#define cbug(a, args...)
#endif
#defin... |
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | // Author : Sarthak Kapoor
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int ll
#define rep(i,n) for(int i=0;i<n;++i)
#define repa(i,a,n) for(int i=a;i<n;++i)
#define repr(i,n) for(int i=n-1;i>=0;--i)
#define ll long long
#define pi pair<int,in... |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vpll = vector<pair<ll, ll>>;
#define rep(i,n... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define neinf 0xc0c0c0c0c0c0c0c0ll
#define inf 0x3f3f3f3f3f3f3f3fll
#define uint unsigned int
#define ull unsigned ... |
#include <cstdio>
#include <algorithm>
using namespace std;
struct str{
int t;
char *s;
bool operator<(const str &b)const{
return t>b.t;
}
};
int n;
str mon[1003];
int main(){
scanf("%d",&n);
for(int i=0;i<n;++i){
mon[i].s=new char;
scanf("%s%d",mon[i].s,&mon[i].t);
}
sort(mon,mon+n);
printf("%s\n",mon[... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,m,n) for (int i = (m); i < (n); ++i)
#define rrep(i,n) for (int i = (n)-1; i >= 0; --i)
#define RREP(i,m,n) for (int i = (n)-1; i >= (m); ++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespac... |
#include <bits/stdc++.h>
#define il inline
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define mid ((l+r)>>1)
#define MAXN
#define MAXM
#define mod
#define inf (1ll << 30)
#define eps (1e-6)
#define alpha 0.75
#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define repd(i, x, y) f... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... |
#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
using namespace std;
inline int read(){
char ch=getchar(); int w=1,c=0;
for(;!isdigit(ch);ch=g... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 1; i < n; ++i) {
int p;
cin >> p;
p--;
g[p].push_back(i);
}
vector<int> f(n), sz(n);
auto dfs = [&](auto self, int u) -> void {
int sto... |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define forn(i,x1,n) for(int i=x1;... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
vector<vector<string>> ans(9);
ans[1] = {"AB"};
for (int i = 2; i <= 8; ++i) {
for (auto op : ans[i-1]) {
ans[i].emplace_back(op+op);
string nop = op;
... |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <math.h>
#include <random>
#include <chrono>
#include <assert.h>
#include <climits>
using n... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string(string(s)); }
string to_string(bool b) { return to_string(int(b)); }
string to_string(vector<bool>::reference b) { return to_string(int(b)); }
string to_stri... |
#include <bits/stdc++.h>
using namespace std;
#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 ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ve vector<ll>
#define ve_pa vector<pair<ll,ll> >
#define pb push_back
#define mod 1000000007
#define INF 1e18+7
#define ld long double
#define pll pair<ll,ll>
#define fi first
#define se... |
//Hare Krishna
//author: Dipjoy Basak
//dip_10
#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 endl "\n"
#define ll long long
#define int ll
#define ld long double
#define pb push_back
#define mp ... | /* Hare Krishna............Har Har Mahadev */
//cin.ignore();getline(cin,s,'\n');
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define lab(i,a,b) for(i=a;i<=b;i++)
#define bal(i,a,b) for(i=b;i>=a;i--)
#define ff firs... |
#include <bits/stdc++.h>
using namespace std;
int fastio() { ios_base::sync_with_stdio(false); cout << fixed << setprecision(10); cin.tie(nullptr); return 0; }
int __fastio = fastio();
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {ce... | #include <bits/stdc++.h>
#define R register
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
const int mod = 998244353, N = 100;
ll n, fib[N];
vector<int> ans;
inline int addMod(int a, int b) {
return (a += b) >= mod ? a - mod : a;
}
inline ll quickp... |
#include <bits/stdc++.h>
using namespace std;
#define maxn 200005
typedef pair<long long,int> II;
II a[maxn];
int main(){
int n,k;
scanf("%d %d",&n,&k);
for(int i=1;i<=n;++i)
scanf("%lld %d",&a[i].first,&a[i].second);
sort(a+1,a+n+1);
long long local=k;
int i=1;
while(i<=n && local>=a[i].... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i=0; i<n; i++)
string f(string n){
vector<int> s;
for(int i=0; i<n.size(); i++){
s.push_back(n[i] - '0');
}
sort(s.begin(), s.end());
int g1=0, g2=0;
for(int i=0; i<n.size(); i++){
g1 += (pow(10, n.size() - i - 1... |
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << "Line(" << __LINE__ << ") -> " << #x << " is " << x << ... | #line 2 "/home/defineprogram/Desktop/Library/template/template.cpp"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define REP(i,n) for(ll i=1;i<n;i++)
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<ll,ll>
#define len(s) (l... |
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
typedef long long int li;
const ll MAXN=4.5e6+51,MOD=1e9+7;
ll n,m,sm,res;
ll invf[MAXN];
inline ll read()
{
register ll num=0,neg=1;
register char ch=getchar();
while(!isdigit(ch)&&ch!='-')
{
ch=getchar();
}
if(ch=='-')
{
neg=-1;
ch=getchar();
... | #include <cstdio>
#include <algorithm>
#define ll long long
using namespace std;
const ll MOD=1e9+7;
ll Inv[4002005];
ll C(ll r,ll n)
{
if(r>n) return 0;
ll ret=1;
for(int i=1;i<=r;i++) ret=ret*(n-i+1)%MOD*Inv[i]%MOD;
return ret;
}
int main() {
ll n,m,Sum1;
Inv[0]=Inv[1]=1;
for(int i=2;i<=4002000;i++) Inv[i]=(MO... |
//Littleboy123 Template 1.8
#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;
//pragmas
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pra... | //#pragma GCC optimize(2)
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#include<ctime>
#include<cstdlib>
#define X first
#define Y second
#define L (u<<1)
#define... |
//#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define re register int
#define ll long long
#define I inline int
#define V inline void
#define LL inline ll
#define FOR(i,a,b) for(re i=(a),i##i=(b);i<=i##i;++i)
#define ROF(i,a,b) for(re i=(a),i##i=(b);i>=i##i;--i)
//#define gc (_ft==_fs&&(_ft=(_fs=buf)+fread(buf,1,1<... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define repl(i,l,r) for(int i=l;i<r;i++)
#define rrepl(i,l,r) for(int i=r-1;i>=l;i--)
const int inf=1e9+10;
const ll INF=2e18+10;
const int dx[4]={1,0,-1,0};
const int dy[4... |
#include <iostream>
using namespace std;
int a, b, c;
int main(){
cin >> a >> b >> c;
if ( a+c <= b){
cout << "Aoki" << endl;
}else{
cout << "Takahashi" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char a, b, c;
cin>> a >> b >> c;
if (a == b && b == c) printf("Won");
else printf("Lost");
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
const unsigned int mod = 1000000007;
using namespace std;
int main() {
int x; cin>>x;
if(x>=0)
cout<<x<<endl;
else cout<<0<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
int64 pow10(int n)
{
int64 ret=1;
for(int i=0;i<n;i++)ret*=10;
return ret;
}
int main()
{
int64 n;
int64 ans=0;
cin >> n;
int64 a=0;
for(int i=1;i<=5;i++)
{
if(n<pow10(i*3))
{
ans+=(... |
#include <bits/stdc++.h>
using namespace std;
/*
* JUST KEEP GOING
*/
#define endl '\n'
#define ll long long
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for(int i=0;i<... | #include<bits/stdc++.h>
using namespace std;
const int N=105;
int n;
vector<pair<int,int>>A,B;
map<tuple<int,int,int>,int>s,t;
int main()
{
scanf("%d",&n);
A.resize(n),B.resize(n);
for(int i=0;i<n;i++)
scanf("%d%d",&A[i].first,&A[i].second);
for(int i=0;i<n;i++)
scanf("%d%d",&B[i].first,&B[i].second);
auto ad... |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int n;
int a[100100];
int main(){
ios::sync_with_stdio(false);
cin >> n;
rep(i, n)
cin >> a[i];
sort(a, a + n);
double val = 0;
rep(i, n)
val += (double)a[i] - 0.5 * a[0];
double ans = val;
for(int i = 1; i < n; i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, minimum = 100;
cin >> a;
minimum = min(a, minimum);
cin >> b;
minimum = min(b, minimum);
cin >> c;
minimum = min(c, minimum);
cout << a + b + c - minimum;
return 0;
} |
#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 sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int count=0;
vector<pair<int, int>> points;
for (int i=0; i<n; i++){
int a, b;
cin>>a>>b;
points.push_back({a, b});
}
bool used[1005][1005];
for (int i=0; i<1005; i++) for (int j=0; j<1005;... |
#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 vector<int> vi;
typedef vector<ld> vd;
typedef vector<l... | #define _CRT_SECURE_NO_WARNINGS
#define FAST ios::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define FOR(i,a,b) for (int i=a;i<b;i++)
#define ROF(i,a,b) for (int i=b-1;i>=a;i--)
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define sz(v) ((int)v.size())
#define all(v) (v).begi... |
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_E"
#include <bits/stdc++.h>
using namespace std;
//BEGIN CUT HERE
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
//END CUT HERE
... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int N = 3e5 + 5;
int n, m;
int a[N];
int b[N];
int dp[1001][1001];
int memo(int i, int j) {
if(i == -1 && j == -1) return 0;
if(i == -1) return j+1;
if(j == -1) return i+1;
if(dp[i][j] != -1) return dp[i][j];
int res = min(memo(i-1, j), memo... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,x,n) for(i=x;i<=n;i++)
#define all(v) v.begin(),v.end()
#define p_b push_back
#define fr first
#define sc second
#define m_p make_pair
#define zero(a) memset(a,0,sizeof(a))
#define setp setprecision
typedef long long ll;
typed... |
#include <cmath>
#include <iostream>
#include <unordered_set>
using namespace std;
int main()
{
using ll = long long;
ll N;
cin >> N;
const ll r = sqrt(N);
unordered_set<ll> n;
for (ll i = 2; i <= r; ++i)
{
ll ab = i*i;
for (; ab <= N; ab *= i)
n.insert(ab);
}
cout << N - n.size() << e... |
#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 N=200000;
int c[N];
int Root[N],Rank[N],Size[N];
map<int,int>m[N];
int find(int x){
if(Root[x]==x)return x;
else return Root[x]=find(Root[x]);
}
void unite(int x,int y){
int X=find(x);
int Y=find(y);
if(X==Y)return;
if(Rank[X]<Rank[Y]){
... |
#include<bits/stdc++.h>
#define int long long
#define pb emplace_back
#define INF 0x3f3f3f3f
#define f first
#define s second
#define FOR(i, n) for(int i = 1; i <= n; i ++)
#define FFOR(i, a, b) for(int i = a; i <= b; i ++)
#define pii pair<int, int>
#define mod 1000000007
#define all(x) x.begin(), x.end()
#define mem(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool check(int n,int m){
while(n){
if(n % m == 7)return true;
n/=m;
}
return false;
}
void solve(){
int n;
cin>>n;
int c = 0;
for(int i = 1;i<=n;i++){
if(check(i,8) || check(i,10))c++;
}
c... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using P2 = pair<ll, P>;
vector<ll> d;
ll inf = 1e18;
ll c1(ll t, ll c, ll d) {
return t + c + (d / (t + 1));
}
ll culc(ll t, ll c, ll d) {
int kouho = (double)(sqrt(d)+0.00... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
double A, B, C, D;
cin >> A >> B >> C>> D;
double ans = abs(A - C) / (B + D) * B;
if (C > A)
ans += A;
else
ans = A -... |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define endl '\n'
typedef long long int ll;
using namespace std;
const ll N = 2e5 + 77;
ll A[N], Pre[N];
ll n , k ;
ll f(ll x){
return max(0LL,(x-1) - 2*(max(0LL,x-n-1)));
}
void sol(){
cin >> n >> k ;
ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define init(a,i) for(int k=0;k<(i);k++)(a)[k]=0
#define in(a,i) for(int k=0;k<(i);k++)cin>>(a)[k]
#define all(a) (a).begin(),(a).end()
#define inf 2147483647
#define range(x,a,b) (a)<... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n; scanf("%d",&n);
vector<int> p(n);
rep(i,n) scanf("%d",&p[i]), p[i]--;
vector<int> pos(n);
rep(i,n) pos[p[i]]=i;
vector<int> ans;
vector<bool> used(n-1);
rep(x,n){
int i=pos[x];
while(x<i){
if(use... |
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n,t;
double l,r;
cin >> n;
vector<pair<double, double>> v;
for (int i=0; i<n; i++) {
cin >> t >> l >> r;
switch(t) {
case 2:
r -= 0.1;
... | #pragma region templates
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
t... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int m=0,i=0;
while(m<n)
{
m+=i;
i+=1;
}
cout<<i-1;
return 0;
} |
// Problem : B - Savings
// Contest : AtCoder - AtCoder Beginner Contest 206（Sponsored by Panasonic）
// URL : https://atcoder.jp/contests/abc206/tasks/abc206_b
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
// Delete the dynamically allocated memory
#... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define forp(i,a,b) for(ll i=a;i<=b;i++)
#define forn(i,a,b) for(ll i=a;i>=b;i--)
#define read(a,n) forp(i,1,n){cin>>a[i];}
#define vi vector<ll>
#define newl '\n'
#define mod 1000000007
#define no cout<<"NO"<<newl; return;
#define ... | #pragma GCC optimize("Ofast")
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define mod (int)(1e9+7)
#define mod2 998244353
#define PI 3.1415926535897932384626433832795
void... |
#include<bits/stdc++.h>
typedef unsigned long long ull;
typedef long long ll;
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define nep(i,r,l) for(int i=r;i>=l;i--)
void sc(int &x){scanf("%d",&x);}
void sc(int &x,int &y){scanf("%d%d",&x,&y);}
void sc(int &x,int &y,int &z){scanf("%d%d%d",&x,&y,&z);}
void sc(ll &x){scanf("%ll... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long double lb = 0;
long double rb = 2e9 + 9;
long double p = 1.0 / (long double) n;
auto f = [&](long double x) {
long dou... |
#include <iostream>
using namespace std;
int main() {
string s;
int count=0;
cin >> s;
for(int i=0; i<=8; i++) {
if(s[i]=='Z'&&s[i+1]=='O'&&s[i+2]=='N'&&s[i+3]=='e'){
count++;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll a,ll b){
if(b==0) return a;
return gcd(b,a%b);
}
int main(){
ll n;
cin>>n;
vector<ll>v(n+1);
v[2]=2;
for(ll i=3;i<=n;i++){
ll g=gcd(i,v[i-1]);
//cout<<"gcd of "<<i<<" "<<v[i-1]<<" "<<g<<endl;
v[i]=(i*(v[i-1]))/g;
... |
#include <bits/stdc++.h>
// #include <boost/multi_array.hpp>
// #include <boost/optional.hpp>
// #include <boost/range/irange.hpp>
// #include <boost/range/algorithm.hpp>
// #include <boost/range/adaptors.hpp>
// #include <atcoder/all>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
set<long> ans;
for(long i = 1; i * i <= N; i++) {
if(N % i == 0) {
ans.insert(i);
ans.insert(N / i);
}
}
for(auto val:ans) cout << val << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '['; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << ']'; }
template<typename T, size_t size> ostream& operator<<(ostream &os, const array<T, size> &arr) { os <<... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
double a, b; cin >> a >> b;
cout << b/100*a << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return x*f;
}
const double eps=1e-6;
int n,D,H;
int d[1100],h[1100];
bool check(double mid){
double k=(H-mid)/D,b=mid;
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define N 214514
const ll mod = 100000;
const ll inf = 1000000000000000000;
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int read()
{
int 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<<3)+(x<<1)+f*(c-'0'),c=getchar();
return x;
}
const int MAXN=100,inf=1e18;
int n;
int a[MAXN];
int b[]={2,3,5,7,11,13,17,... |
//#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " <<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000 //10^14
template <typename T>
bool chmax(T &a, const T& b) ... |
#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};
int main(){
ll n,m;
cin >> n >> m;
vector<int> cnt(n);
rep(i,n){
string s;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define mp make_pair
const int MOD = 1e9+7;
const int MAX_N=1e5+10;
int n, m;
string s[MAX_N];
int c1, c2;
void solve()
{
for(int i=0;i<n;++i){
int cur = 0;
for(int j=0;j<m;++j){
cur = 2*cur + (s[i][j]-'0');
}
if(_... |
//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>
using namespace std;
const int N = 2005;
const int mod = 1000000007;
int n,m;
char s[N][N];
int sum1[N][N];
int sum2[N][N];
int sum3[N][N];
int sum4[N][N];
inline int fastpow(int x,int p){
int res=1;
while(p){
if(p&1)
res=1ll*res*x%mod;
x=1ll*x*x%mod;
p>>=1;
}
return res;
}
int S... |
#include<ctime>
#include<cstdio>
#include<cctype>
#define ll long long
using namespace std;
const ll N=2e5+7;
ll read(){
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while(isdigit(c)){
x=x*10+f*(c-48);
c=getchar();
}
return x;
}
ll n,sum,a[N],s[N],m[N];
int main(){
#ifndef ONLINE_JUDGE
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<long long>a(n);
vector<long long>b(n);
vector<long long>c(n);
vector<long long>d(n);
vector<long long>ans(n,0);
rep(i,n) cin >> a[i];
long long m = 0;
rep(i,n) {
m = max(a[i],m);... |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N, A, ans;
cin >> N;
ans = 0;
for(int i = 0; i < N; i++){
cin >> A;
if(A > 10){
ans += A - 10;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using Int = long long; // clang-format off
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(v) std::begin(v), std::end(v)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std... | #include <bits/stdc++.h>
using namespace std;
# define endl "\n"
# define io_boost std::ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
typedef unsigned long long int ulli;
typedef long long int lli;
typedef unsigned int ui;
string X;
ulli M;
int main(){
io_boost;
cin >> X >> M;
ulli... |
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
static long long INF = (1LL<<62);
LL H, W, N, M;
map<pair<LL, LL>, int> L, B; //L電球、B：ブロック
map<LL, map<LL, int>> maplh, mapbh; //最初のキー：H座標、次のキー：W座標
map<LL, map<LL, int>> maplw, mapbw; //最初のキー：W... | # include <bits/stdc++.h>
# define ull unsigned long long
# define ll long long
# define double long double
# define pll pair<ll,ll>
# define pb push_back
# define fi first
# define se second
# define mp make_pair
# define all(x) x.begin(),x.end()
# define fill(a,b) memset(a,b,sizeof(a))
# define gcd(m,n) __gcd(m, n)
... |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i,k,j) for(int i=(k);i>=(j);i--)
#define... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
#include<set>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
//const ll mod = 1e9 + 7;
co... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll =long long;
using vi = vector<ll>;
using vc = vector<char>;
using vs = vector<string>;
using P = pair<ll , ll>;
using vp = vector<P>;
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define rep2(i, s, n) f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> cnt(n, 0);
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
long long aoki;
ll taka;
ll a[300001],b[300001],c[300001];
bool cp(ll k,ll l){
return k>l;
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%lld%lld",&a[i],&b[i]);
c[i]=a[i]+b[i]+a[i];
aoki+=a[i];
}
sort(c+1,c+1+n,cp);
for(... | #include <bits/stdc++.h>
using namespace std;
struct Rectangle {
int a, b, c, d;
void update(int a_, int b_, int c_, int d_) {
a = a_;
b = b_;
c = c_;
d = d_;
}
friend ostream &operator<<(ostream &os, const Rectangle &x) {
return os << x.a << ' ' << x.b << ' ' << x.c << ' ' << x.d;
}
};
... |
/*
Author : MatsuTaku
Date : 06/26/21
Certificate:
ssh-rsa
AAAAB3NzaC1yc2EAAAADAQABAAAAgQDF9T447OEo8XSQ6O1AznN5tKC8mzvYc4Zs3+oOKfMqgLXfOwQnpfcoxKs4MAP1eICBD13PkcIezJ9IlV6nKQZKs1BQmvjSXJ+zKK8YCKvAueNPuNO0Bim43IBaNHNFWcMvcmUvHgRb6hUSO0V8I7OsjiFo20KDBj3gAznu9tir0Q==
CompetitiveProgrammingCertification:tk... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... |
#include <bits/stdc++.h>
using namespace std;
template<int MAX>
struct Combination {
vector<long long> _inv, _fac, _ifac;
const long long MOD;
Combination(long long mod) : _inv(MAX+1), _fac(MAX+1), _ifac(MAX+1), MOD(mod) { init(); }
void init() { init_inv(), init_fac(); }
void init_inv() {
... | #include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back;
using namespace std;
using namespace std::chrono;
long long fpb(long long x, long long y) {
return (y == 0) ? x : fpb(y, x % y);
}
long long kpk(long long x, long long y) {
return x * (y / fpb(x, y));
}
bool cmp(long long a,long long b)
{
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
char a;
cin >> a;
for (int i = 1; i < 3;i++)
{
char k;
cin >> k;
printf("%c", k);
}
printf("%c", a);
} |
#include<iostream>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define per(i,b,a) for(int i = (b); i >= (a); i--)
#define N 110
#define T 1000
#define Inf 0x3f3f3f3f
using namespace std;
int t[N], n;
bool dp[N][2*N*T];
int main(){
cin>>n;
int tot = 0;
rep(i,1,n) cin>>t[i], tot += t[i];
dp[0][n*... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define mod 1000000007
#define ad(a,b) a=(a+b)%mod;
ll po(ll x,ll y){
ll res=1;
for(;y;y>>=1){
if(y&1)r... |
//sccは罠.
//Xi = 頂点iを選んだかどうか？とすると、
//E[ΣXi] = ΣE[Xi] = Σpi (頂点iが選ばれる確率)が答え
#include <iostream>
#include <string>
#include <queue>
#include <cstdio>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
int n;
string s[100];
vector<int> et[100];
signed main() {
int i, j;
cin >> n;
rep(i, n) cin >> s[i];
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=105;
int n,e[maxn][maxn];
char s[maxn];
int main()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s",s);
for(int j=0;j<n;j++)
e[i][j]=s[j]-'0';
}
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
e[i][... |
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> A(N), B(N), C(N);
for (auto& x : A) {
std::cin >> x;
x -= 1;
}
for (auto& x : B) {
std::cin >> x;
x -= 1;
}
for (auto& x : C) {
std::cin >> x;
x -= 1... | //#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <list>
#include <cctype>
using namespace std;
#define s... |
#include<bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define DEBUG
#ifdef DEBUG
#define DEBUG_PRINT(fm, ...) do{std::printf("%s:%d(%s)", __FILE__, __LINE__, __func__);std::cout << "DEBUG PRINT ";std::printf(fm, __VA_ARGS__);}while(0)
#define DEBUG_VAL(a, b) do{std::printf("%s:... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int read(){
int x=0,f=1;
char c=getchar();
while(!isdigit(c)){
if(c=='-') f=-1;
c=getchar();
}
while(isdigit(c)){
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
signed main(){
int x=read(),y=read();
if(x>y){
if(y+3>x) cout<<"Yes"<<endl;
... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int main() {
long long int ans = 0, n;
long long value;
map<long long, long long> a;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> value;
for(auto v : a) {
ans += ((value - v.fi) * (value - v.fi) * v.se);
}
a[value]++;
}... | #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>
... |
// *********************************************************************************
// * MURTAZA MUSTAFA KHUMUSI *
// * NIT-DGP,CSE - 2019-2023 *
// **************************************************************... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int64_t> A(N);
for(int i=0;i<N;i++) cin >> A[i];
sort(A.begin(), A.end());
vector<int64_t> sum(N+1);
sum[0] = 0;
for(int i=1;i<N+1;i++) sum[i] = sum[i-1]+A[i-1];
int64_t ans = 0;
for(int i=0;i<N-... |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((beg... | #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#include <deque>
#include <complex>... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cctype>
#include <fstream>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <sstream>
#include <stack>
#inclu... | // khodaya khodet komak kon
# include <bits/stdc++.h>
/*
// ordered_set
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
# define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace std;
typedef l... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int ans=0;
cin >> s;
for(int i=0;i<9;i++){
if(s[i]=='Z' && s[i+1]=='O' && s[i+2]=='N' && s[i+3]=='e') ans++;
}
cout << ans << endl;
} | #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... |
//ABHISHEK AGRAWAL,BIT mesra//
//Newbie......You have to be odd to be no. ONE :)//
//Authhor: Abhishekagrawal
//Date: 27/02/2021
//Time: 17:30:41
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#defin... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<string,int> psi;
typedef pair<int,string> pis;
typedef array<int,2> aii;
typedef array<int,3> aiii;
typedef array<int,4> aiiii;
typedef unsigned long long ull;
typedef long long int ll;
typedef array<ll,2> all;
typedef array<ll,3> all... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m, dp[100][2];
vector<int> vals, cur;
int solve(int x, int car) {
if (x == n-1) return 1;
int &ret = dp[x][car];
if (~ret) return ret;
ret = 0;
if (cur[x] + car == 0) ret = solve(x+1, 0);
else if (cur[x] + car == 3) ret = solve(x+... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define pi 2*acos(0.0)
#define F_OR(i, a, b, s) for (int i=(a); (... |
#include <iostream>
#include <stdio.h>
#include <ctype.h>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <deque>
#include <string>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <map>
#include <unordered_map>
#includ... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
const int inf = 2147483647;
const int N = 5e4 + 10, M = N * 2 * 17;
void solve() {
int n, w;
scanf("%d%d", &n, &w);
printf("%d\n", n / w);
}
int main() {
// freopen("in.txt", "r", s... |
// Problem Link -
/* By Navneet Shukla */
#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define inf 1e18
#define endl "\n"
#define pb emplace... | #include<bits/stdc++.h>
#define maxn 400005
#define INF 0x3f3f3f3f
#define count cnt
using namespace std;
typedef long long ll;
int vis[maxn], viss[maxn];
vector<int > V[maxn];
int flg = 0;
int count = 0;
void dfs(int u, int fa) {
viss[u]= 1;
count++;
for(int i=0;i<V[u].size();i++) {
int v = V[u][i];
if(v == fa)... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
typedef long long ll;
int main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
std::cout.tie(0);
int a, b, c, d;
std::cin >> a >> b >> c >> d;
std::cout << a * d - b * c << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define debug printf("%d %s\n",__LINE__,__FUNCTION__);fflush(stdout)
using ll=long long;using i64=long long;using db=double;
using u32=unsigned int;using u64=unsigned long long;using db=double;
using pii=pair<int,int>;using vi=vector<int>;
using qi=queue<int>;using pqi=prior... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (__builtin_popcount(i) == 1) cnt++;
cout << cnt << " ";
}
cout << "\n";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fr first
#define sc second
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll k;
cin >> k;
ll ans = 0;
for( ll i = 1;i<=k;i++){
for(ll j = 1;j<=k;j++){
if(i*j > k) break;
... |
#include <bits/stdc++.h>
using namespace std;
const uint64_t seed = std::chrono::system_clock::now().time_since_epoch().count();
mt19937_64 rnd(seed);
const int MOD = 998244353;
#ifdef VIPJML_LOCAL
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
os << "{";
for (typename vector<T>::... | #include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef pair<int, int> pi;
typedef pair<long long, long long> pll;
#define endl '\n'
#define ff first
#define ss second
#define pb push_back
#define int long long
#define sz(v) (int)v.size()
#define inf 2147483647
#define l... |
/*
Author: Pratik Bedre
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ll sqsum = 0, sum = 0;
for (int i = 0; i < n; i++)
sqsum += a[i] * a[i];
for (int i = 0; i < n; i++)... | #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; } retu... |
#include <bits/stdc++.h>
#define pb push_back
#define all(a) a.begin(),a.end()
#define forn(i,n) for(int i=0;i<int(n);i++)
#define forr(i,n) for(int i=int(n-1);i>=0;i--)
#define fora(i,a,b) for(int i=int(a);i<=int(b);i++)
#define forb(i,a,b) for(int i=int(a);i>=int(b);i--)
#define kickstart int t,o;cin>>o;for(t=1;t<=o;... | #include<bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ans = true;
for (int i=0; i < s.length(); i++) {
if (i % 2 == 0) {
if (islower(s.at(i))) continue;
else ans = false; break;
}
else {
if (isupper(s.at(i))) continue;
else ans = false; break;
... |
#include<bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define ppll pair<ll,pll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vec... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... |
#include<bits/stdc++.h>
using namespace std;
namespace IO
{
const int buffer_size=1e5+5;
char buf[buffer_size],*S,*T;
bool flag_EOF;
inline char read_char()
{
if(S==T)
T=(S=buf)+fread(buf,1,buffer_size,stdin);
return S!=T?*(S++):EOF;
}
inline int read_int()
{
int flag=1;
char c=read_char(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF = (1LL<<60)-1;
#define rep(i, n) for (int i = 0; i < n; i++)
#define sz(a) (int)(a.size())
template<class T>
bool chmax(T &a, T b) {if (a < b) {a = b;return true;}else return false;}
template<class T>
bo... |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
bool flag=1;
int x=0;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')
flag=0;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return (flag?x:~(x-1));... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typed... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int mod = 1e9+7;
#define debug(x) cout<<"val= "<<x<<"\n";
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
void solve()
{
ll a,b,c;
cin>>a>>b>>c;
cout<<max(max(a+b, b+c) , c+a);
}
int main()
{
f... | #include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
#define rep(i,m,n) for(int (i)=(m);(i)<(n);++(i))
#define rrep(i,m,n) for(int (i)=(n)-1;(i)>=(m);--(i))
#define all(x) (x).begin(),(x).end()
... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll mod= 1e9 + 7;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e9;
#define what_is(x) cerr<<#x<<" is "<<x<<"\n";
#define read(x) freopen("in.txt","r",stdin);
#define write(x) freopen("out.txt","w",stdout);
#define Fast ios_base::sync_with_stdio(false);cin.tie(0);cout.... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
#define debug(x) cerr<<#x<<" :"<<x<<"\n"
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define FAST ios_base::sync_with_stdio(false), cin.tie(), cout.tie()
typedef long long ll;
typedef long double ld;
co... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll input(){
ll x=0,f=0;char ch=getchar();
while(ch<'0'||ch>'9') f|=ch=='-',ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return f? -x:x;
}
const int N=107;
char mp[N][N];
int Ans=0;
int main(){
int n=input(),m=input();
fo... |
#include<cstdio>
#include<vector>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
namespace Elaina{
// #define NDEBUG
#include<cassert>
#define rep(i, l, r) for(int i=(l), i##_end_=(r); i<=i##_end_; ++i)
#define drep(i, l, r) for(int i=(l), i##_end_=(r); i>... | #include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.141592653589793238462
#define set_bits __builtin_popcountl... |
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <numeric>
#include <algorithm>
#include <queue>
#include <bitset>
#include <cmath>
#include <map>
using namespace std;
#define rep(i,n) for(int i=0 ; i<(n) ; ++i)
typedef long long ll;
typedef pair<int,int> p;
const double PI=3.1415... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define rep(i, n) for(int i = 0;i < n;i++)
#define rep1(i, n) for(int i = 1;i < n;i++)
#define repr(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define ALL(a) ... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long n; cin >> n;
string t; cin >> t;
if (t == "1") {cout << 20000000000 << endl; return 0;}
long long ans = 10000000000;
for (int i = 1; i < n; ++i){
if (t[i-1] == '0' && t[i] == '1') ans--;
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define dbl(k, x) fixed << setprecision(k) << (x)
template <typename _T>
inline void _DBG(const char *s, _T x) {
cerr << s << " = " << x << "\n";
}
template <typename _T, typename... args>
void _DBG(const c... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x <<... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
bool contains(const std::string& s, const std::string& v)
{
return s.find(v) != std::string::npos;
}
std::vector<std::string> erase_contained(std::vector<std::string> ss)
{
std::sort(ss.begin(), ss.end());
ss.erase(std::... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200200;
const int INF = 1e9 + 7;
int n, a[MAXN];
pair<int, int> b[MAXN];
map<int, vector<int> > mp;
void dfs(int dep, int x, vector<int> cur) {
if (dep > n) return ;
if (x && mp.count(x) && cur != mp[x]) {
cout << "Yes" << endl;
s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
typedef pair<int, int> P;
typedef long long ll;
int dp[300][300];
int n;
vector<int> bucket;
bool valid(vector<int> x, vector<int> y)
{
if (x.size() == 0 || y.size() == 0)
{
return fals... |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) ((ll)(x).size())
#define ... | #include <bits/stdc++.h>
using namespace std;
int H, W, A, B;
int dfs(int i, int s, int a, int b) {
if (i == H * W) {
if (a == 0 && b == 0) return 1;
else return 0;
}
if (s & (1 << i)) {
return dfs(i+1, s, a, b);
}
int ans = dfs(i+1, (s | (1 << i)), a, b-1);
if (((i ... |
//
#include "bits/stdc++.h"
using namespace std;
#define pr1(a) for(auto b : a) cout << b << " ";cout << endl;
#define pr2(a) for(auto b : a){for(auto c:b) cout << c << " ";cout << endl;}
#define prc(...) for(auto b:{ __VA_ARGS__ }) cout << b << " ";cout << endl;
const int NN=200000;
vector<vector<int>> g(NN+1,vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> pl;
struct edge {
ll to; // 辺の行き先
ll weight; // 辺の重み
edge(ll t, ll w) : to(t), weight(w) { }
};
typedef vector<vector<ll> > Graph;
typedef vector<vector<edge> > WGraph;
#define rep(i, n) for(... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
auto solve = [&]() -> long long {
long long p = abs(c - a), q = abs(d - b);
if (p == 0 && q == 0) return 0;
if (p == q || p + q <= 3) return 1;
if ((p + q) % 2 == 0 || p... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main()
{
ll x1, x2, y1, y2, ans = 0;
cin >> x1 >> y1;
cin... |
#include<bits/stdc++.h>
////////////////////////////dbug/////////////////////////////////////////////////////////////////////////
#define dbug(a) cerr<<"==> "<<a<<endl;
#define dbug_ok cerr<<"==> ok"<<endl;
#define dbug_2d(a,n,m) {cerr<<"********"<<endl;for(int i=0;i<n;i++){for(int j=0;j<m;j++)cerr<<a[i][j]<<" "; cerr<... | #include <iostream>
using namespace std;
void cur_char_count(string S, int chars[], int s_i) {
if (S[s_i] == 'A')
chars[0] += 1;
else if (S[s_i] == 'T')
chars[1] += 1;
else if (S[s_i] == 'C')
chars[2] += 1;
else
chars[3] += 1;
}
int main(void){
int N;
string S;
... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 3005;
long long a[N];
int f[2][N];
int cnt[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
int flag = 0;
for (int i = 1; i <= n; i++) f[flag][i] = 1;
int res = 1;
for (int j = 2; j <= n; j++) {... | #include <iostream>
#include <string>
#include <vector>
using ll=long long;
using namespace std;
// auto mod int
//const int mod = 1000000007;
//const int mod = 998244353;
int mod;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& op... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#define INF 10... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
for(int i = 0; i < (int) s.size() - 4 + 1; ++i) {
string t = "";
for(int j = i; j < (int) i + 4; ++j) {
t += s[j];
}
//cout << t << "\n";
if(t == "ZONe") {
++cnt;
}
}
cout << cnt << '\n';
}
|
#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=(a); i>(n); --i)
#define pb emplace_back
#define mp make_pair
#define clr(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(),(x).end()
#define lowbit(x) (x & -x)
#define fi first
#define se... | // KNOW NOTHING!
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define sz(x) (int)x.size()
#define szs(x) (int)x.length()
#defi... |
#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... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.