code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const int maxn=200010;
int n,m;
string s;
char t[maxn];
int main()
{
cin>>n>>s;
for(int i=0;i<n;i++)
{
t[++m]=s[i];
if(m>=3&&t[m-2]=='f'&&t[m-1]=='o'&&t[m]=='x') m-=3;
}
cout<<m;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (... |
#include <bits/stdc++.h>
#define mset(arr, val) memset(arr, val, sizeof(arr))
#define long long long
#define endl "\n"
using namespace std;
// const double PI = acos(-1.0);
// const double E = exp(1.0);
// const double EPS = 1e-9;
const int MOD = (int)1e9 + 7;
const int N = (int)1e5;
int main()
{
#ifdef MY_PREPROCESSO... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
void solve(long long N, long long K){
ll ans = 0;
rep(i, N) rep(j, K) {
ans += (i + 1) * 100 + (j + 1);
}
cout << ans << en... |
#include <bits/stdc++.h>
using namespace std;
//begin of def
#define fastio ios_base::sync_with_stdio(false);cin.tie(0)
#define endl '\n'
using lli = long long int;
using ulli = unsigned long long int;
using Ld = long double;
using pii = pair<int, int>;
using pll = pair<lli, lli>;
using pld = pair<Ld, Ld>;
#define ... | // Problem: C - Max GCD 2
// Contest: AtCoder - Japanese Student Championship 2021
// URL: https://atcoder.jp/contests/jsc2021/tasks/jsc2021_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii... |
#include <bits/stdc++.h>
using namespace std;
const int N = 5005, mod = 998244353;
int n, m, ans, f[N][N];
int fpow_(int a, int b, int res = 1) {
for (; b; b >>= 1, a = 1ll*a*a%mod)
if (b&1)
res = 1ll*res*a%mod;
return res;
}
int main() {
scanf("%d%d", &n, &m);
ans = 1ll*fpow_(m, n)*n%mod;
f[0][0] = 1;
f... | #include<bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define Local
#ifdef Local
#define dbg(args...) do { cout << #args << " -> "; err(args); } while (0)
void err() { std::cout << std::endl; }
t... |
#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 endl '\n'
#define nitro std::ios_base::sync_with_stdio(false), std::cin.tie(NULL)
#define pi 3.141592653589793
#define mod 1000000007
#define pb push_back
#def... | #include<iostream>
using namespace std;
int a[4];
int main(){
for(int i=0;i<4;++i) cin>>a[i];
for(int i=0;i<1<<4;++i){
int remain=0,tot=0;
for(int j=0;j<4;++j){
if(i>>j&1) tot+=a[j];
else remain+=a[j];
}
if(remain==tot){
puts("Yes");
... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxl=3e5+10;
const int inf=1e9+10;
int n,m,k,cnt,tot,cas,ans;
int a[maxl],f[maxl],g[maxl];
bool vis[maxl];
char s[maxl];
vector<int> e[maxl];
inline void prework()
{
scanf("%d%d",&n,&k);
for(int i=1;i<=n-1;i++)
{
int u,v;scanf("%d%d",&... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005
// 点(x2,y2)の角度
... | #include <iostream>
#include <algorithm>
#define MAX 100
using namespace std;
template <typename T>
bool next_combination(const T first, const T last, int k)
{
const T subset = first + k;
// empty container | k = 0 | k == n
if (first == last || first == subset || last == subset)
{
return false;... |
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
typedef long long int ll;
using namespace std;
#define maxn 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
const int mm=2e5+100;
ll d[mm],st[mm],num[mm];
ll sum[3000][3000];
string s[300... | #include <bits/stdc++.h>
using namespace std;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 1e18;
const ll fact_table = 3200008;
priority_queue <ll>... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
int n;
cin >> s;
n = s.size();
for (int i = 0; i < n ; i++){
if (i%2 == 0){
if (s.at(i) == 'A' || s.at(i) == 'B' || s.at(i) == 'C' || s.at(i) == 'D' || s.at(i) == 'E' || s.at(i) == 'F' || s.at(i) == 'G' || s.at(i) == 'H' || s.at... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long(i)=0;(i)<(n);(i)++)
#define kiriage(a,b) ((a)+(b)-1)/(b)
int main(){
string s;
cin >> s;
rep(i,s.length()){
if(i & 0x01){
if(s[i] < 'A' || 'Z' < s[i]){
cout << "No" << endl;
... |
#include <bits/stdc++.h>
#define F first
#define S second
#define endl "\n"
#define Endl "\n"
#define emdl "\n"
#define mod 1000000007
#define pb push_back
// #define mp make_pair
#define all(x) x.begin(),x.end()
using namespace std;
// bool sortBy(const pair<int,pair<int,int>> &a,const pair<int,pair<int,int>> &b){
/... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);++i)
#define fixed(n)fixed<<setprecision(n)
#define ll long long
#define ALL(a)a.begin(),a.end()
#define LLA(a)a.rbegin(),a.rend()
template<class T>void chmin(T& a,T b){
if(a>b){
a=b;
}
}
template<class T>void chmax(... |
#include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].t... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <vector>
#define ALL(container) container.begin(), container.end()
#define REP(counter, end) for (int counter = 0; counter < end; ++counter)
using namespace std;
using ll = long lon... |
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#else
#define D(...) ((void)0)
#define NDEBUG
#endif
#include<bits/stdc++.h>
#define int long long
#define LL long long
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=(a);i<... | #include <bits/stdc++.h>
using namespace std;
int a[100010], b[100010];
long long dp[100010];
int s[100010];
int main () {
int n; scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int j = 1; j <= n; j++) {
scanf("%d", &b[j]);
}
long long ans = 0;
for (int i = 1; i <= n; i++) {
if... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x == y) cout << x << endl;
else cout << 3 - x - y << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll>vl1;
typedef vector<vl1> vl2;
struct struka
{ll val; ll ind;};
typedef vector<struka> vs;
bool compa(struka& a, struka& b)
{ if(a.val==b.val) return a.ind<b.ind;
return a.val<b.val;
}
ll lova(vl1& veka, ll dole, ll gore, ll val... |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define rep2(i, a, b) for(int i=a; i<b; i++)
#define Pii pair<int, int>
#define Pll pair<ll, ll>
using namespace std;
using ll = long long;
int main(){
char s, t;
cin >> s >> t;
if(s=='Y'){
if(t=='a') cout<<'A'<<endl;
if(t=='b... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define FOR(i, j, k, in) for (int i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (int i = j; i >= k; i -= in)
#define REP(i, j) FOR(i, 0, j, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
int main() {
ios_base::sync_w... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define ar array
const int N=2e5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
ar<int, 2> res[n];
if (n==1) {
if (m==0) cout << 1 << " " << 2;
else cout... | //Author: AnandRaj doubleux
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll; ... |
#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 nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<
#define INF (ll)1e18
#define mod 998244353
#define maxn 110
ll i, i1, j, k, k1, t, n, m, res, flag[10], a, b;
ll x, y, z, tt, sm;
ll bnm2(ll x) {
if (x < 0) return 0;
r... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<vector<int>> a(N, vector<int>(N));
rep(i, N) rep(j, N) cin >> a[i][j];
auto check = [=](int x) {
vector<vector<int>> sum(N + 1, vector<int>(N + 1, 0));
rep(i, N)... | #include <stdio.h>
int n, m, r, t, y, d, ans, f;
int w[8];
int b[8];
int c[8];
int l[100000];
int v[100000];
int x[256];
int main() {
ans = 1000000000;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d", w + i);
}
for (int i = 0; i < m; i++) {
scanf("%d%d", l + i, v + i);
for (int j = 0; j < n; ... |
#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 <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // setprecis... |
#include <iostream>
using namespace std;
int main() {
char button;
cin >> button;
char answer;
cin >> answer;
if(button == 'Y') {
if(answer >= 'a') {
answer -= ('a' - 'A');
}
}
else {
if(answer <= 'Z') {
answer += ('a' - 'A');
}
}
cout << answer << "\n";
return 0;
} |
#include <iostream>
#include <iomanip>
#include <string>
using namespace std;
void Main() {
// input
char S;
cin >> S;
char T;
cin >> T;
// process
char ans;
if (S == 'Y') {
ans = toupper(T);
} else {
ans = T;
}
// output
cout << ans << endl;
}
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; } return 0; }
const long long INF = 1LL <<60;
... | #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define X first
#define Y second
#define nl '\n'
#define AC return 0
#define pb(a) push_back(a)
#define mst(a,b) memset(a, b, sizeof a)
#define rep(i,n) for(int i = 0; (i)<(n); i++)
#define rep1(i,n) for(int i = 1; (i)<=(n); i++)
#de... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
bool ok = true;
for... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <functional>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
#include <tuple>
#include <cctype>
#include <numeric>
using namespace std;
using ll = long long;
using ii = pair<int,... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll inf = 1e18;
struct Edge { int to, t, k; };
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
x--, y--;
vector<vector<Edge>> g(... | #include<bits/stdc++.h>
using namespace std;
#define N 301000
#define M 601000
#define inf 1E16
typedef long long ll;
struct node{
int v, next; ll w, kk;
}e1[M];
int head1[N];
ll dist1[N], inq1[N];
int n, m, x, y;
ll t[N], k[N];
int len = 0;
void add_edge1(int x,int y,ll w,ll kk){
e1[++len].v=y;
e1[len].w=w;
e1[l... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 5;
const long double eps = 0.000000000000;
ll n, a[N], p[N];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
for(int i = 1; i <= n; ... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#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++)
#define mydeb(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
//#define mydeb(fmt, ...)
int main()
{
int n;
ci... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
const int maxn = 1000;
struct bign{
int d[maxn], len;
voi... | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <stack>
#include <queue>
#include <cassert>
#include <iomanip>
using namespace std;
typedef long long ll;
#d... |
/**
* Author : RDP
* There are no two words in the English language more harmful than "good job".
* 1729 ;)
**/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T)
{
cerr << " " << to... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define ROF(i, a, b) for (int i = a; i >= b; --i)
#define NEXT(i, u) for (int i = h[u]; i; i = e[i].u)
const int INF = 2e9;
const int K = 1e5 + 7;
int Max(const int &a, const int &b) {return... |
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define MOD (int)(1e9+7)
#define MOD1 998244353
#define ceil(x, y) ((x)%(y))==0? ((x)/(y)) : ((x)/(y)+1)
#define FOR(i, N) for(int i = 0; i < N; ++i)
#define FOR1(i, N) for(int i = 1; i <= N; ++i)
#define vi vector <int>
#define pii pair <int,... | #include<bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define ll long long int
#define f first
#define s second
using namespace std;
ll mod=1e9+7;
ll expo(ll base,ll power,ll m)
{
ll res=1;
while(power)
{
if(power&1)res*=base,res%=m;
base*=base,base%=m;
power/=2;
}
... |
#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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r)
{
uniform_int_distribution<int> uid(l, r);
return uid(rng);... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define int long long
#define eb emplace_back
#define maxll (1ll<<62)
#define minll -(1ll<<62)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll OO = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
const double pi = 3.14159265359;
//freopen("window.in", "r", stdin);
//freopen("output.out", "w", stdout);
void skrrrt() {
ios_base::sync_with_stdio(0), cin.tie(0);
}
//#########################... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define dup(x,y) (((x)+(y)-1)/(y))
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace s... |
#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <limits>
#include <string>
#include <algorithm>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include "math.h"
#include "assert.h"
using namespace std;
#define fast_inp... | #include <bits/stdc++.h>
#define Rep(i,n) for(int i=0;i<n;i++)
#define Repr(i,n) for(int i=n;i>=0;i--)
#define For(i,m,n) for(int i=m;i<n;i++)
#define Inf 1LL<<60
#define All(v) v.begin(),v.end()
#define Mod (ll)(1e9+7)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<long long> vl;
in... |
/*
-----------_____________
--------_¯¯-------------¯¯_
-------¦-------------------¦
------¦---------------------¦
-----¦---_______---_______---¦
----¦---¦¦¦¦¦¦¦¦¦-¦¦¦¦¦¦¦¦¦---¦
----¦--¦¦¯----¯¦¦¦¦¦¯----¯¦¦--¦
---¦¦¦¦¦¦---¦¯¦-¦¦¦---¦¯¦-¦¦¦¦¦¦
---¦¦¦¦¦¦---¯¯¯-¦¦¦---¯¯¯-¦¦¦¦¦¦
----¦--¯¦_----_¦¦-¦¦_----_¦¯--¦
----¦----¯¦¦... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a;
bool isPermutation = true;
cin >> a;
int b[a];
for(int i = 0; i < a; i++){
cin >> b[i];
}
sort(b, b + a);
for(int i = 0; i < a; i++){
if(b[i] != i + 1){
isPermutation = false... |
/**
* author: stein
* created: 2020.11.27 12:14:31
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long s, p;
cin >> s >> p;
for (long long i = 1; i <= 1000000; i++) {
if (i * (s - i) == p) {
cout << "Yes" << '\n';
... | #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(){
ll s, p;
cin >> s >> p;
bool can = false;
for(ll x = 1; x*x <= p; x++) {
if(p % x == 0 and x + p/x == s) can = true;
}
cout << (can ? "Yes": "No") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i=(l); i<(r); i++)
#define REP(i,n) FOR(i,0,n)
#define endl "\n"
#define debug(x) cout<<x<<endl;
typedef long long ll;
static const int INF = 1e9+7;
bool equal(double a, double b){
double eps = 1e-4;
if(fabs(a - b) <= eps) return true;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define rep(i,b,e) for(int i=b;i<e;i++)
#define per(i,e,b) for(int i=e;i>b;i--)
const int maxn = 5e5+5;
void solve() {
ll s,p; cin >> s >> p;
for(ll i=1; i*i <= p; i++) {
if (p%i==0 && (p/i + p/(p/i)) == s) {
cout << "Yes... |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i <= b; ++i)
#define repr(i,a,b) for(int i = a ; i >= b; --i)
#define NAME "CAMEL"
#define pb push_back
#define mp make_pair
#define EL cout << '\n'
#define cqtshadow int main
#define fillchar(a,x) mems... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> w(n);
vector<pair<int, int>> p(m);
int mn = INT_MAX;
for (int i = 0; i < n; ++i) cin >> w[i];
for (int i = 0; i < m; ++i) {
cin >> p[i].second >> p[i].first;... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define vi vector<int>
#define vvi vector<vector<int>>
#define pb push_back
#define pii pair<ll,ll>
#define tii tuple<ll,ll,ll>
#define all(v) (v).begin(),(v).end()
#define ll long long
#define ull unsigned long long
... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#def... |
#include<iostream>
using namespace std;
#include<vector>
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
const ll E18 = 1000000000000000000LL;
int main() {
int N,i,j,k;
ll X;
cin>>N>>X;
vi A(N);
for (i=0;i<N;i++) cin>>A[i];
ll ans = E18;
for (int C=1;C<=N;... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... |
/*
ALLAH IS ALMIGHTY ******BISMILLAHIR RAHMANIR RAHIM.****** ALLAH IS ALMIGHTY
```````````````````````````````
AUTHOR: ANISUR RAHAMAN
BSMRSTU(SHIICT)
... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
static void removeTrailingCharacters(std::string &str, const char charToRemove) {
str.erase (str.find_last_not_of(charToRemove) + 1, std::string::npos );
}
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i = 0;i<((ll)(n));i++)
#define reg(i,a,b) for(ll i = ((ll)(a));i<=((ll)(b));i++)
#define irep(i,n) for(ll i = ((ll)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(ll i = ((ll)(b));i>=((ll)(a));i--)
template<class T = int> using V = vect... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
const int N=2e5+5;
int n,m,k;
int c[N];
vector<int>v[N];
int lowbit(int x){return x&(-x);}
int query(int i){
int res=0;
while(i){
res+=c[i];
i-=lowbit(i);
}
return res;
}
int getsum(int l,int r){return query(r)-query(... |
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define ff first
#define ss second
using namespace std;
ll F[200009],S[200009],sz[200009];
map<ll,ll> mp;
vector<ll> G[100009];
bool cmp(const ll &a,const ll &b)
{
return S[a]-F[a] > S[b]-F[b];
}
void DFS(ll u)
{
vector<ll> tp,bd;
ll i;
... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
#define Output(a) printf("%d %s", a, "\n")
typedef long long int ll;
typedef vector<int> vi;
typedef vector<l... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int i = 1;
int ans = 0;
while(ans < N){
ans += i;
i++;
}
cout << i - 1;
} | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i,j,k,m,n,t;
vector<int>a;
a.push_back(0);
for(i=1;i<=50000;i++)
{
a.push_back((i*(i+1))/2);
}
cin>>n;
auto low1 = std::lower_bound... |
/**
* @author Macesuted (macesuted@qq.com)
* @copyright Copyright (c) 2021
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
// #define mod 998244353
#define maxn 200005
long long fac[maxn], inv[maxn];
long long power(long long a, long long x) {
long long ans = 1;
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
ll N;
ll par[400005];
ll rank_[400005];
bool c[400005];
void init(ll n_){
for(ll i=0;i<n_;i++){
par[i]=i;rank_[i]=0;
}
}
ll find(ll x){
if(par[x]==x)return x;
return par[x]=find(par[x]);
}
void unite(ll x,ll y){
x=find(x);y=find(y);... |
#include<bits/stdc++.h>
using namespace std;
#define reg register
typedef long long ll;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
static char buf[1<<21],*p1=buf,*p2=buf;
inline int read(void){
reg char ch=getchar();
reg int res=0;
while(!isdigit(ch)) ch=getchar();
while(isd... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int N=105;
const double eps=1e-7;
int n,m;
int X[N*3],Y[N*3],p[N*3];
pii XY[N];
pair<double,pii> e[N*N*9];
int fp(int x){
return (x==p[x])?x:(p[x]=fp(p[x]));
}
void lnk(int x,int y){
x=fp(x);y=fp(y);
p[x]=y;
}
bool check(double d){
fo... |
#include<bits/stdc++.h>
#define ll long long
#define fr(i,k,n) for(ll i = k;i<n;i++)
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b;
long double w;
cin>>a>>b>>w;
ll c = w*1000;
ll mini = LONG_MAX;
ll maxi = LONG_MIN;
for(ll i = 0;i<=1000000;i++){
... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define code \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define endl '\n'
#define MM(a, b) memset(a, b, sizeof(a))
using namespace s... |
#include<bits/stdc++.h>
#define SZ(x) ((int)x.size())
#define pb push_back
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>voi... | // doot diddly donger cuckerino Hahahahahah
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<i... |
#include<bits/stdc++.h>
typedef long long int ll ;
#define rep(i,k,n) for (i = k; i < n; i++)
using namespace std;
const unsigned int M = 1000000007;
const unsigned int n=100005;
/*bool sol(pair<ll,ll>a,pair<ll,ll>b)
{
return (b.first>a.first);
}*/
/*
int64_t ceil_div(int64_t a, int64_t b) {
return (a + b - 1... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int main()
{
fast
string s; cin>>s;
if(s[0]==s[1]&&s[1]==s[2])
cout<<"Won";
else
cout<<"Lost";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 200003
#define MOD 998244353
#define INF 1000000000
int main(){
ll X,Y,Z;
cin>>X>>Y>>Z;
for(ll i=1000000;;i--){
//Y/X>ans/Z;
if(Y*Z>i*X){
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
// typedef long long int;
int const N = 4e6 + 10, mod = 1e9 + 7;
int fact[N], infact[N];
int n, m, k;
int qmi(int a, int k, int p) {
int res = 1;
while (k) {
if (k & 1) res = res * a % p;
k >>= 1;
a = a * a % p;
}
... |
#include <bits/stdc++.h>
using namespace std;
const int maxl=300005,LG=55;
int n,m,q,num=0,opt,u,v;
int a[maxl],tree[maxl*LG],L[maxl*LG],R[maxl*LG];
int fa[maxl],RT[maxl];
int fin(int x)
{
if (x==fa[x]) return x;
return fa[x]=fin(fa[x]);
}
void pushup(int rt)
{
tree[rt]=tree[L[rt]]+tree[R[rt]];
}
int change(int... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1000000007;
const do... |
#include"bits/stdc++.h"
int main() {
using namespace std;
int A, B;
cin >> A >> B;
cout << (2 * A + 100) - B << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#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++)
#include <cmath> //数学関数
using ll = long long;
int main() {
int x,y;
cin>>x>>y;
if(x == y) cout<<x<<endl;
else if(x == 0) {
if(y == 1) cout<<2<<... |
#include<bits/stdc++.h>
using namespace std;
#define io cin.tie(0);ios::sync_with_stdio(false);
#define debug(x) cout<<#x<<"="<<x<<endl
#define lowbit(x) x&(-x)
#define pii pair<int,int>
#define mk make_pair
#define ll long long
#define rs p<<1|1
#define ls p<<1
const int maxn = 2005;
const int mod = 1e9 + 7;
const int... | #include <bits/stdc++.h>
//#include <cmath>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007
//#define lld long double
#define mii map<int, int>
#define mci map<char, int>
#define msi map<string, int>
#define pii pair<int, int>... |
#include<bits/stdc++.h>
#define maxn 250000
using namespace std;
int n;
char s[maxn];
int main()
{
scanf("%d",&n);
scanf("%s",s+1);
if(s[1]!=s[n])
cout<<1<<endl;
else
{
int ok=1;
for(int i=1;i<n;i++)
if(s[i]!=s[1]&&s[i+1]!=s[n])
ok=0;
if(ok==0)
cout<<2<<endl;
else
cout<<-1<<endl;
}
retur... | #include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <numeric>
#include <map>
#define fore(i, l, r) for(int i = int(l); i < int(r); i++) //Python style baby
#define sz(a) int((a).size())
#define mp make_pair
#define v... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}
return x*f;
}
co... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;++i)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;--i)
//mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template<typename T>void chkmax(T&x,T y){if(x<y)x=y;}
template<typename T>v... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i,a,b) for(i=(a);i<=(b);++i)
#define per(i,a,b) for(i=(a);i>=(b);--i)
#define REP(i,a,b) for(i=(a);i< (b);++i)
#define PER(i,a,b) for(i=(a);i> (b);--i)
#define ERR(...) fprintf(stderr,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
#define INF ((1<<30)-1)
#define LLINF (1LL<<60)
#define EPS (1e-10)
constexpr ll mod = 1e9 + 7;
int main() {
int T;
cin >> T;
rep(t, T) {... |
#include<iostream>
#include<cstdlib>
#include <cmath>
#include<algorithm>
#include<vector>
#include<string>
#include<unordered_map>
using namespace std;
int main()
{
int n;
cin >> n;
if(n%2==0){
cout << "White" << endl;
}else{
cout << "Black" << endl;
}
}
| #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef double d;
typedef long double ld;
typedef vector<string> vs;
ty... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> G[n];
for (int i = 0; i < n - 1; ++i) {
int p;
cin >> p;
--p;
G[p].push_back(i + 1);
}
vector<int> f(n, 1);
vector<int> s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using pii = pair<int,int>;
int main(){
int n; cin >> n;
vector<int> p(n);
vector<vector<int>> tree(n);
rep(i,n-1){
int p; cin >> p; p--;
tree[p].push_back(i+1);
}
/*
頂点vを根とした木で考えたと... |
#include <bits/stdc++.h>
using namespace std;
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first)... | #include <iostream>
#define DENOM 998244353
using namespace std;
int main(){
long long a, b, c;
cin >> a >> b >> c;
cout << ((((a*(a+1)/2)%DENOM) * ((b*(b+1)/2)%DENOM))%DENOM * ((c*(c+1)/2)%DENOM))%DENOM << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// template <class c, class cmp = less<c> > using ordered_set = tree<c, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);co... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
const int MOD=(int)1e9+7;
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
//freopen("teamwork.in","r",stdin);
//freopen("teamwork.out","w",stdout);
i... |
#include<bits/stdc++.h>
#define deb(x) cout<<#x<<" "<<x<<endl;
#define int long long
using namespace std;
const int mod = 1e9 + 7;
const int MAX = 2e5+ 5;
const int N = 5e4 + 5;
vector< pair<int,int> >a[N];
vector<int>g[MAX];
int mypow(int x, int n ){
if(n == 0){
return 1;
}
int xn2 = mypow(x,n/2)%mod;
int ... | #include <iostream>
using namespace std;
int main()
{
int n,a,b;
cin>>n>>a>>b;
cout<<(n-a)+b;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, t[50];
int main(){
string ch;
cin >> ch;
for(int i = 1;i < ch.size();i++)cout << ch[i];
cout << ch[0];
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin>>x;
if(x<0){cout<<'0';}
else if(x>0){cout<<x;}
else if(x==0){cout<<'0';}
return 0;}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007ll
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using pii = pair<int, int>;
const int INF = 1001001001;
//fixed << setprecision(n) 小数点以下n桁の表示(cout)
int main() {
ll n; cin >> n;
for (int i = 1; true; i++) {
if (st... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
struct Conbinatorics
{
int _max_N;
const int _mod;
const bool _pre_caluculation;
int *_F, *_R;
Conbinatorics(int n, int mod=1000000007, bool pre_calculation=true)
: _max_N(2 * n)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define nline "\n"
const ll M1=1e9+7;
const ll M2=998244353;
const ll N=1000005;
const ll INF_MUL=1e13; ... |
/* これを翻訳している間、あなたはあなたの人生のいくつかの貴重な瞬間を無駄にしました */
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define S(x) (int)(x).size()
#define L(x) ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
template <class T>
inline void read(T &x) {
x = 0;
int f = 0;
char ch = getchar();
while (!isdigit(ch)) { f |= ch == '-'; ch = getchar(); }
while (isdigit(ch)) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar();... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define ... | #include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <set>
#include <map>
#include <... |
//#pragma GCC optimize ("Ofast,unroll-loops")
//#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <unistd.h>
#define FAST_IO ios::sync_with_stdio(0);cin.tie(NULL)
#define all(v) (v).begin(),(v).end()
using namespace std;
void __print(int x) {cerr << x;}
vo... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<ll>> C;
vector<ll> sz;
ll f(ll v){
sz[v]=1;
ll r=1;
vector<ll> p1,p2,p3;
for(ll nv:C[v]){
ll b=f(nv);
if(sz[nv]%2==0 && b<0)p1.push_back(b);
else if(sz[nv]%2==0 && b>=0)p2.push_back(b);
else p3.push_back(b);
sz... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define pb push_back
#define vi vector<int>
#define vl vector<long long>
#define fast \
cin.tie(0); \
... | #include <bits/stdc++.h>
using namespace std;
#define fo(i, x, y) for (int i = (x); i <= (y); ++i)
#define fd(i, x, y) for (int i = (x); i >= (y); --i)
const int maxn = 2e5 + 5;
struct edge{int to, w; edge *nxt;}*arc1[maxn], *arc2[maxn], pool[maxn << 2], *pt = pool;
int n, m;
int ans[maxn];
bool vis[maxn];
int geti... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main()
{
long long int r,c;
cin>>r>>c;
char mat[r][c];
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
cin>>mat[i][j];
}
}
long long int count=0;
for(int i=0;i<r;i++)
{
for(i... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const... |
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
bool isP(int n) {
if(n <= 1) return 0;
for(int i = 2; i*i <= n; i++)
if(n%i == 0) return 0;
retu... | #include <bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define full(a) memset(a, 0x3f, sizeof(a))
#define fornext(x, i) for(int i = head[x], y = ver[i]; i; i = nxt[i], y = ver[i])
#define mset(a, b) memset(a, b, sizeof(a))
#define Rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define dRep(i... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
llong n, k, m;
llong sum;
int main()... | #include<bits/stdc++.h>
#define G getchar();getchar();
using namespace std;
const double eps = 0.0000001;
void solve()
{
double a,b,c;
cin>>a>>b>>c;
double d=sqrt(b*b+c*c);
int i=0;
while(d>2*a)//d==2*a
{
d-=a;
i++;
}
if(d==a)//d==a
{
i+=1;
}
else i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
long long prefix_sum = 0; // A[0] - A[1] + A[2] - A[3] + ...
map<long long, int> count;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
using namespace std;
template <class T = int>
using V = vector<T>;
template <class T = int>
using VV = V<V<T>>;
using ll = lo... |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <queue>
#include <map>
#include <cstdio>
#include <cstring>
#include <set>
#include <math.h>
typedef long long ll;
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
if (c==0){
if(a>=b+1) cout<<"T... | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long a[3];
void solve()
{
sort(a,a+3);
if (2*a[1]==a[2]+a[0]) puts("Yes");
else puts("No");
}
int main()
{
while(cin>>a[0]>>a[1]>>a[2])
solve();
} |
#include<stdio.h>
#include<stdlib.h>
#include<bits/stdc++.h>
//Do DEBUG OR NOT
#define DEBUG
#ifdef DEBUG
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if(n%100==0)
{
cout<<n/100<<endl;
}
else
{
cout<<n/100 +1<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string x;
ll m;
cin >> x >> m;
ll d = 0, lm = 9223372036854775807;
for(char pp : x){ d = max(d, (ll)(pp - '0') ); }
if(x.size() == 1){
if((ll)(x[0] - '0') <= m) {cout << 1; return 0;}
else {cout << 0; return 0;}
}
... | # include <cstdio>
# include <cstring>
namespace Main {
namespace Source {
typedef short unsigned int hu;
typedef long long unsigned int llu;
static inline const hu max(const hu a, const hu b) { return a < b ? b : a; }
static inline const void amax(hu& a, const hu b) { a = max(a, b)... |
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("trapv")
#pragma GCC target("sse4")
#include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for(int i = 0; i < n; i++)
#d... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <random>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
//#include <atcoder/all>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
bool con7(int n){
int t = n;
while(t>0){
if(t%10 == 7) return 0;
t /= 10;
}
while(n>0){
if(n%8 == 7) retu... | #include <bits/stdc++.h>
/////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////
//////////////////////////////////SOLVE HOJA PLZZ////////... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int x=a+b,y=b+c,z=a+c;
int m=max(x,y);
int n=max(m,z);
cout<<n;
return 0;
} | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for(int i=int(n-1);i>=int(0);--i)
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int temp,sum = 0;
for (int i = 0; i < n; i++){
cin >> temp;
if (temp > 10){
sum += temp -10;
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<ll,ll>;
using vi = vector<int>;
int n;
vector<vector<int>> a;
bool is_ok(int x){
bool res = false;
set<int> s;
rep(i,n){
int y = ... |
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vec... | #include <iostream>
#include <bits/stdc++.h>
#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 <cs... |
#include<bits/stdc++.h>
#define int long long
#define REP(i,a,n) for(int i=a;i<(n);i++)
#define REP_sz(i,s) for(int i=0;i<s.size();i++)
#define gcd(a,b) __gcd(a,b)
#define RE return
#define FILL(a,b) memset(a,b,sizeof(a))
#define SO(a) sort(all(a))
#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) (in... | #include <bits/stdc++.h>
#include <functional>
#include<stdio.h>
using namespace std;
#define ll long long int
#define dd long double
#define pb push_back
#define pf push_front
#define pi pair<ll,ll>
#define vi vector<ll>
#define vpi vector<pi>
#define mi ... |
#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 Head,typename... Tail> void print0(Head head,Tail... tail){cout<<fixed<<setprecision(15)<<head;print0(tail...);}
void p... | #include <bits/stdc++.h>
#define nput(a) cout << a << endl
#define sput(a) cout << a << ' '
using namespace std;
typedef long long ll;
const int maxn = 110;
int a[maxn], b[maxn];
int c[17], d[17];
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
}
in... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9+7;
#define inf 1e18
#define spc " "
#define vi vector<int>
#define pb push_back
#define ff first
#define ss second
#define pi pair<int,int>
#define all(v) (v).begin(),(v).end()
#define mk(arr,n,type) type *arr=new type[n];
#define r... | //ll min_len[1<<8];
//void __(){
// _(ll,n);
// _(ll,m);
// _(vl,a,n);
// _(vpll,b,m);
// rep(bm,1<<n){
// ll w = 0;
// rep(i,n)
// if(bm&(1<<i))
// w += a[i];
// rep(i,m){
// if(b[i].Y < w)
// min_len[bm] = max(min_len[bm],b[i].X);... |
#define _DEBUG
#include "bits/stdc++.h"
//#include <atcoder/all>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,a5,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <string>
#include <sstream>
#include <set>
#include <functional>
#include <map>
#include <unordered_map>
#include <queue>
#include <iomanip>
#include <stack>
using namespace std;
typedef long long ll;
#define repi(i,a,b) for(ll i=a;i<b... |
#include<bits/stdc++.h>
#define Imposter ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll unsigned long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,w,x;
cin>>n>>w;
x=n/w;
cout<<x;
} |
#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<int,int>;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mi... | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) for(int i = a; i < b; i++)
#define all(a) a.begin(),a.end()
//#define endl '\n'
using ll = long long;
//using db = long double;
usin... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<long long> Vll;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int a,b;
cin >> a >> b;
cout << 2*a+100-b << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,a,n) for(ll i=a;i<n;i++)
#define rev(i,n,a) for(ll i=n-1;i>=a;i--)
#define f first
#define s second
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define vpii vector<pair<int,int>>
#define vpll vector<pll>
#define pll pair<ll,ll>
... |
#include <iostream>
#include <string>
#include <vector>
#include <numeric>
#include <algorithm>
using ll = long long;
using namespace std;
ll modpow(ll a, ll n, ll mod) {
ll ans = 1;
while (n > 0) {
if (n & 1) {
ans = ans * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return ans;
}
int main(in... | #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
#define all(v) v.begin(), v.end()
#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... |
//*******************************************************************
// author of this code is : horcrux903
//*******************************************************************
// THERE IS ALWAYS A WAY TO GO IF YOU LOOK FOR IT
//*******************************************************************
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using V2 = vector<vector<int>>;
template<typename T>
bool chmin(T &a, T b)
{
if (a > b) {
a = b;
return true;
}
return false;
}
void dfs(Graph &graph, const vector<int> &P, vector<int> &tour, int u)
{
auto... |
/* ** ** ****** ****** ****** ** ****** ***
** ** ** ** ** ** ** ** ** ** ** *********
**\../** ****** ****** ** ** ****** ** ** ***
** ** ** ** ** ** ** ** ** ** ** ** *****
** ** ** ** ** ** ** ****** ****** ****** *****
*/
#include <bits/stdc+... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << b-c << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
n = floor(1.08*(n));
if(n<206)
cout<<"Yay!";
else if(n==206)
cout<<"so-so";
else
cout<<":(";
return 0;
} | #define LOCAL
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <ran... |
#include<bits/stdc++.h>
using ll= long long;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define ALL(x) x.begin(),x.end()
#define INF (ll)1e9 //10^9:∞
#define LLINF (ll)1e12
#define MOD (ll)(1e9+7) //10^9+7:合同式の法
#define PI 3.141592653589
#define PB push_back
#define F first
#d... | #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>
#include<string.h>
#include<time.h>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<cctype>
using namespace std;
#define ll long long
#define ull unsigned lo... |
/* All is Well */
#include <bits/stdc++.h>
using namespace std;
#define tera_baap_aaya main
#define TEZZ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);//
#define ll long long int
#define PB push_back
const ll C=998244353;
////////////////////
bool checkprime(ll n)
{
for (int i=2;i*i<=n;i++)
... | #include<bits/stdc++.h>
using namespace std;
#define flash ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main()
{
flash
int t = 1;
//cin>>t;
while (t--) {
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<b-c;
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int n;
int main()
{
cin>>n;
for(int i=0;i<n;i++)
cout<<(2*i)%n+1<<' '<<(2*i+1)%n+1<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pl pair<ll, ll>
#define vl vector<ll>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define mod 1000000007
#define N 100005
int main()
{
fastIO
string s;... |
#include <bits/stdc++.h>
#include <cmath>
#define rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,k,n) for(int i=k;i<=(n);++i)
#define repD(i,k,n) for(int i=k;i>=(n);--i)
#define endl '\n'
#define print(b) for(auto a:b) cout<<a<<' ';
#define printN(b) for(auto a:b) cout<<a<<endl;
#define fin freopen("C:\\Users... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll mod=1000000007;
ll fact[200000];
ll power(ll x,ll y)
{
ll res=1;
while(y)
{
if(y&1) res=(res*x)%mod;
x=(x*x)%mod; y>>=1;
}
return res;
}
ll nCr(ll n,ll r){
if(r>n) return 0;
else if(r<0) return 0;
else i... |
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
void build();
#define ll long long
#define ULL unsigned long long
#define ff first
#define ss second
#define pb push_back
#define PI acos(-1.0)
#define mk make_pa... | #include<bits/stdc++.h>
using namespace std;
inline int read(){
int res=0;
bool zf=0;
char c;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(zf)return -res;
return res;
}
const int maxn=2e5+5,N=2e5;
int p[maxn],q[maxn]... |
#include<bits/stdc++.h>
using namespace std;
///******************************** C o n t a i n e r ********************************///
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;
typedef vector<pll> vll;
///*********************************** C o n s t ******... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[... |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int a, b, c;
cin >> a >> b >> c;
while (true)
{
if (c % 2 == 0)
{
if (a == 0)
{
cout << "Aoki" << endl;
return;
}
a--;
}
else{
if (b == 0)
{
cout << "Takahashi" << endl;
return;
}
b--;
}
c++;
}
}
int... | //7.21
//rng_58 bless me
#include<bits/stdc++.h>
using namespace std;
//define:
#define ll long long
#define REP(i,n) for(int i = 0; i < n; i++)
//fast io:
inline int Read() {
int s = 0,f = 1;
char ch = getchar();
while(ch < '0' || ch > '9'){
if(ch == '-') {
f = -1;
}
ch = getchar();
}
while(ch >= '0' &&... |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ms memset
#define MOD 1000000007
#define MOD2 1000000009
#define sp fixed<<setprecision
#define sz(x) (int)(x).size()
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
usin... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef int64_t ll;
const ll maxOne = 1'000'000'007;
ll add(ll a, ll b){
if(a<0){
a += maxOne;
}
if(b<0){
b += maxOne;
}
return (a+b)%maxOne;
}
ll mul(ll a, ll b){
if(a<0){
a += maxOne;
}
... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... | #define taskname "test"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 2e5 + 5;
const lli inf = 1e18;
int n;
int x[maxn], c[maxn];
bool app[maxn];
int l[maxn], r[maxn];
int lst_l, ls... |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
// auto mod int
const int mod = 998244353;
struct mint... | #include <bits/stdc++.h>
const int K = 300;
const int N = 200000;
const int P = 998244353;
inline int add(int x, int y) {x += y; return x >= P ? x - P : x;}
inline int sub(int x, int y) {x -= y; return x < 0 ? x + P : x;}
inline int mul(int x, int y) {return (int)(1ll * x * y % P);}
int s[K + 5], t[K + 5], c[K + 5][K... |
#include<iostream>
#include<math.h>
#include<stdlib.h>
#include<string>
#include<limits.h>
#include<utility>
#include<vector>
#include<tuple>
#include<algorithm>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define ALL(A) A.begi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ll,pll> plp;
typedef pair<pll,ll> ppl;
typedef pair<pll,pll> ppp;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vecto... |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using P = pair<int, int>;
ll INF = 1e18;
int main(){
ll n;
cin >> n;
vector<ll> a, b;
ll x = 1, y =... | //
// main.cpp
// atcoder
//
// Created by 荣恒嬉 on 2020/10/24.
//
#include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
int main() {
ll a;
cin>>a;
ll x=1,y=1;
for(int i=1;i<38;i++){
x*=3;
ll y=1;
for(int j=1;j<28;j++){
y*=5;
if(x+y==a)
{
cout<<i<<" "<<j;
return 0;
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.