code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <iostream>
using namespace std;
int main()
{
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ans = 0;
if (r1 == r2 && c1 == c2){
ans = 0;
}else if (abs(r1 - r2) + abs(c1 - c2) <= 3){
ans = 1;
}else if (r1 - r2 + c1 - c2 == 0 || r1 - r2 - c1 + c2 == 0){
ans... | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define IO std::ios::sync_with_stdio(false); cin.tie(0)
#define ll long long
#define ull unsigned long long
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rep(i, l, r) for (int i = l; i <= r; i++... |
#include <bits/stdc++.h>
#define int long long
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
constexpr int MOD = 1000000007;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int,int> P;
us... | #include<iostream>
using namespace std;
int main()
{
int a, b, c;
int ans;
cin >> a >> b >> c;
if (a == b) {
ans = c;
} else {
if (b == c) {
ans = a;
} else {
if (c == a) {
ans = b;
} else {
ans = 0;
... |
#include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
void solve() {
int n, m;
cin >> n >> m;
vector<i64> dp(1 << n);
vector<vector<pair<int, int>>> conds(1 + n);
while (m--) {
int x, y, z;
cin >> x >> y >> z;
conds[x].emplace_back(y, z);
}
dp[0] = 1;
for (int s = 0; s < 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define MOD(a, m) ((a % m + m) % m)
template<class T>bool chm... |
// 問題の URL を書いておく
//
#include <bits/stdc++.h>
using namespace std;
//#define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#define PrintVec(v) \
do {\
for(int __i = 0; __i < v.size(); ++__i) \
{ \
cout << #v << "[" << __i << "]: "... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int a = 0, b = 1000000;
for (int i = 0; i < n; i++) {
int a1; cin >> a1;
a = max(a1, a);
}
for (int i = 0; i < n; i++) {
int b1; cin >> b1;
b = min(b1, b);
}
if (b < a) cout << 0;
else cout << b - a + 1;
} |
#include <bits/stdc++.h>
using namespace std;
#define flush cout.flush
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pl = pair<ll, ll>;
const ll INF = 1e9 + 7;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ld eps = 1e-9;
const ld PI = acos(-1);
ld C = (ld) 9 / (ld) 2... | #include<bits/stdc++.h>
using namespace std;
#define DONTSYNC ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) //dont use stdio with iostream functions //input and output are out of order now!
#define TEST unsigned long long T; cin>>T; while(T--) //loop over each testcase
#define endl "\n"
#define for... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).ren... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define INF63 1061109567
#define INF127 9187201950435737471
#define UINF 18446744073709551615
#define F first
#define S second
#define ll long long
#define N 100010
using... |
#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#... | //#define _DEBUG
#pragma GCC optimize("O2")
#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<<": "... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
int main(){
int n,x;
cin >> n >> x;
string s;
cin >> s;
rep(i,n){
if(s.at(i) == 'o') x += 1;
if(s.at(i) == 'x'){
if(x != 0) x -= 1;
else continue;
}
}
cout << x << endl;
return 0;
}
| #include <bits/stdc++.h>
#define llong long long
#define INF 999999999
using namespace std;
int main()
{
int N, X;
string S;
cin >> N >> X >> S;
for (int i = 0; i < N; i++)
{
if (S[i] == 'o')
X++;
else
{
if (X > 0)
X--;
}
}... |
/*
मनस्वी म्रियते कामं कार्पण्यं न तु गच्छति ।
अपि निर्वाणमायाति नानलो याति शीतताम् ॥
*/
#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;
#define mod 1000000007
#define pb push_back
#define ll long long i... | #include <bits/stdc++.h>
using namespace std;
#define fo(a,b) for(int64_t a=0;a<b;a++)
#define sor(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define ll int64_t
#define mod 998244353
#define vl vector<int64_t>
#define vc vector<char>
#define vs vector<string>
#define np(vec) next_permutation(v... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int L,R;
scanf("%d%d",&L,&R);
if(R>=2*L)
printf("%lld\n",(R-2*L+1ll)*(R-2*L+2)>>1);
else
puts("0");
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define boost ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//#define mp make_pair
#define pb push_back
#define fp first
#define sp second
typedef long long int ll;
typedef pair<ll,ll> pp;
#define check(x, i) ((x>>i)&1LL)
#define set(x,i) (x|(1LL<<i))
#define unset(x,... |
#include<bits/stdc++.h>
#define ll long long
#define re register
#define INF 2147483647
using namespace std;
inline int read()
{
int f=1,x=0;char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-') f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-48;
s=getchar();
}
return f*x;
}
const int p=1e9+7;
inl... | #include <bits/stdc++.h>
#define rep(i, n)for(int i=0,i<(n);++i)
using namespace std;
using ll = long long;
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 mint a) {
if ((x += a.x) >... |
#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>
using namespace std;
int main(){
int n, x;
cin >> n >> x;
string str;
cin >> str;
for (int i=0; i<n; i++){
if (str[i]=='o'){
x++;
}
else if (str[i]=='x'){
x--;
}
x = max(x, 0);
}
cout << x << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll,ll> pll;
typedef vector <int> vint;
typedef vector <ll> vll;
typedef vector <pii> vpii;
typedef vector <pll> vpll;
typedef vector <string> vs;
typedef priority_queue <int> pqi;
#define FOR(i, a, b) for(... | // Problem: E - Count Descendants
// Contest: AtCoder - AISing Programming Contest 2021（AtCoder Beginner Contest 202）
// URL: https://atcoder.jp/contests/abc202/tasks/abc202_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Author: abhidot
#include <bits/stdc++.h>
#define int long long
#define IOS std::ios::sync_wi... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 10;
int a[maxn];
int main()
{
int n, m, pos;
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; ++i) { scanf("%d", &pos); a[pos] ^= 1;}
for(int i = 1; i <= m; ++i) { scanf("%d", &pos); a[pos] ^= 1;}
for(int i = 1; i < maxn; ++i) if(a[i]) printf("%d ",... | //Code By CXY07
#include<bits/stdc++.h>
using namespace std;
//#define FILE
#define int long long
#define debug(x) cout << #x << " = " << x << endl
#define file(FILENAME) freopen(FILENAME".in", "r", stdin), freopen(FILENAME".out", "w", stdout)
#define LINE() cout << "LINE = " << __LINE__ << endl
#define LL long long
#... |
#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename temp>using ordered_set = tree<temp, null_type, less_equal<temp>, rb_tree_tag,tree_order_statistics_node_update>;
//order_of_key(k) : Number of items s... | /*
Created on 19-12-20 15:05
@author: roastedcoder
*/
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
const int MOD = 1e9 + 7;
const int INF = INT_MAX;
const int MAX = 4e6 + 5;
const int N = 1e5 + 5;
//const int MAXX = 1e14;
#define ll long long
#define int ll
#define all(x) x.begin(), ... |
#include <bits/stdc++.h>
#define MAXN 80
#define MAXM 1048576
using namespace std;
int P[20] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71};
map <int,long long> mp[MAXN];
int main()
{
long long A,B;
cin>>A>>B;
mp[0][0] = 1;
for(long long i = A;i <= B;i++)
{
int sta = 0;
for(int j=0;j<20;j++)
... | //Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#define ll long long
#define maxn 100005
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;
ll modpow(ll pow, ll mod) {
ll ret = 1, mult = 10;
while (pow) {
if (pow & 1) ret = (ret * m... |
#include <bits/stdc++.h>
using namespace std;
const string YES = "Yes";
const string NO = "No";
using ll = long long;
int main(){
int N;cin >> N;
vector<pair<int, int>> v1, v2;
for(int i = 0;i < N;i++){
int A, B;cin >> A >> B;
v1.push_back(make_pair(A, B));
}
for(int j = 0;j < N;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#defin... |
#include <bits/stdc++.h>
//#define DEBUG
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template<typename... T>
void r... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include <utility>
#include<functional>
#include<math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define REP(i,l,n) for(ll i=(l);i<(n);i++)
#define per(i,n) for(ll i=(n);i>0;i--)
#d... |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int,int>
#define mk make_pair
#define pb push_back
#define eb emplace_back
#define ins insert
#define fi first
#define se second
#define Rep(x,y,z) for(int x=y;x<=z;x++)
#define Red(x,y,z) for(int x=y;x>=z;x--)
using... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
string a,b,c;
cin>>a>>b>>c;
for(int i=0;i<n;i++)
cout<<"0";
for(int i=0;i<n;i++)
cout<<"1";
cout<<"0\n";
}
}
|
// Murabito-B 21/04/12
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 100005;
int n, c[N], cnt[N];
bool good[N];
vector<int> to[N];
void dfs(int u, int fa) {
if (cnt[c[u]] == 0) good[u] = true;
cnt[c[u]]++;
for (int i = 0, v; i < to[u].size(); i++)
if ((v = to[u... | #include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
#define enviar {io... |
#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... | //Generated at 2020-10-03 20:08:03 UTC+8
//Created by Alphagocc
#include<bits/stdc++.h>
#ifdef USE_PBDS
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/priority_queue.hpp>
#endif
using namespace std;
#define FI __inline__ __attribute__((always_inline))
#define TN typename
#define TP template
#define TS *this... |
#include <bits/stdc++.h>
//#include <atcoder/modint>
//#include <atcoder/math>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPP(i, n) for(int i = 1; i <= n;... | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <cassert>
#include <map>
#include <numeric>
#include <cstring>
#include <set>
#include <ctime>
#include <queue>
#include <cmath>
#include <iomanip>
#include <iterator>
using namespace std;
clock_t timeStart, timeFi... |
/*
Author-> Codie_1(Akash)
*/
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(n) for(int i=0;i<n;i++)
#define repi(n) for(int i=0;i<n;i++)
#define repj(n) for(int j=0;j<n;j++)
#define repp(n) for(int i=0;i<=n;i++)
#define repab(a,b) ... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <string>
#include <list>
#include <cassert>
#include <numeric>
#include <cstdint>
#include <queue>
#include <deque>
using ll = long long;
using ld = long double;
using namespace std;
using Graph = ve... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
int n,q;
const ll inf=1e18;
ll a[maxn],delta[maxn],sum[maxn],k;
int main()
{
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
delta[i-1]=a[i]-a[i-1]-1;
}
delta[n]=inf;
sum[0... | #include "bits/stdc++.h"
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>;
using vvll=vector<vll>;
using pii=pair<int,int>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sor(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define pb push_ba... |
#include <iostream>
using namespace std;
int main(int argc, char** argv) {
int n,a[1005],b[1005];
cin>>n;
int mmin1=1e5+1,mmin2=1e5+1;
int _mmin1,_mmin2;
for(int i=1;i<=n;i++)
{ cin>>a[i]>>b[i];
if(a[i]<mmin1)
{ mmin1=a[i];_mmin1=i;
}
if(b[i]<mmin2)
{ mmin2=b[i];_mmin2=i;
}
}
if(_mmin1=... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define int ll
#define each(i, a) for (auto &&i : (a))
using ll = long long;
using ld = long double;
using vi = v... |
/*
Author: Nguyen Tan Bao
Status:
Idea:
*/
#include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(),a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORE(i,a,b) for (int i ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define pi 3.141592653589793238
#define lb lower_bound
#define ub upper_bound
#define rep(i,a,n) for(ll i=a;i<n;i++)
#define For(i,a,n) for(ll i=a;i<=n;i++)
const ll inf = 100000000000000000;
const ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
using ll = long long;
//<< fixed << setprecision(n) 小数第n位まで表示
int main() {
int N;
cin >> N;
cout << N - 1 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
ios::sync_with_stdio(0), cin.tie(0);
string s, t = ""; cin >> s; bool ok = 1;
deque<char> q;
for(char c : s) {
if(c == 'R') ok = 1 - ok;
else {
if(ok) {
if(q.size() && q.bac... |
/* TAHMID RAHMAN
DAMIAN FOREVER
MATH LOVER
NEVER GIVE UP
*/
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pb push_back
#define fi first
#define se second
#define in insert
#define... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, m, k = 0, ans = 0;
cin >> n >> m;
vector<int64_t> a(m);
map<int64_t, int> s;
for (auto i = 0; i < m; i++) cin >> a[i], a[i];
sort(a.begin(), a.end());
if (m == n) {
cout << 0 << endl;
return 0;
}
i... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
const int N = 3e5 + 10;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
cout << setprecision(12) << fixed ;
vector<int>v(n);
for (int i = 0;i < n;i++){
cin >> v[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i,j,k,n;
pair <int,int> a[400010];
int b[400010];
cin>>n;
for(i=0;i<2*n;i++) {
cin>>k;
a[i]=make_pair(k,i);
}
sort(a,a+2*n);
for(i=0;i<n;i++) {
b[a[i].second]=-1;
}
for(i=n;i<2*n;i++) {
... |
/* (
( ) (
) )
||||||| ( ( (
( O O ) )
____oOO___(_)___OOo____(
(_______________________)
JOINT ░█─░█ ░█▀▀▀ ▀█▀ ░█▀▀▀█ ░█▀▀▀ ░█▄─░█ ░█▀▀█ ░█▀▀▀ ░█▀▀█ ░█▀▀█ █ ░█▀▀▀█ ░█▀▀█ ░█▀▀▀█ ░█▀▀▄ ░█▀▀▀
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int num; cin>>num;
int ans=0;
priority_queue <int> pq;
for (int i=0; i<num; i++) {
int temp; cin>>temp;
pq.push(temp);
}
for (int i=num; i!=0; i--) {
if (pq.top()!=i) {
cout<<"No";
b... |
#include<iostream>
using namespace std;
int main(){
int a,n=0;
cin >> a;
if(a%100!=0){
n=1;
}
cout << a/100 + n << endl;
return(0);
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
us... |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | #include <bits/stdc++.h>
#include <random>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3,unroll-loops")
using ll = long long;
using ull = unsigned long long;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#def... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rrep(i,n) for(int i = (n-1);i>=0;--i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int INF=1<<30;
//const ll INF=1LL<<60;
int dpa[102];
int dpb[102];
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H,W,N,M;
cin >> H >> W >> N >> M;
vector<vector<int>> data(H, vector<int>(W,0));
vector<int>x(N);
vector<int>y(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i);
cin >> y.at(i);
}
vector<int>X(M);
vector<int>Y(M);
for (int i... |
#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <iterator>
#include <math.h>
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define MOD 1000000007;
#include <algorithm>
#include <cmath>
using n... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define S second
#define F first
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vll vector<long long int>
#define pll pair<long long int,long long int>
/* unordered_map<int,int>mp; mp.reserve(1024); mp.max_load_factor(0.25)... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mp make_pair
#define fr first
#define sc second
int main(){
int n,m;
scanf("%d%d",&n,&m);
ll cnt[2]={};
for(int i=0;i<n;i++){
string s;
cin>>s;
int t=0;
for(char c: s)t+=c-'0';
cnt[t&1]++;
}
cou... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 50;
string s[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> s[i];
set<int> zeroes, ones;
... |
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<iomanip>
#include<regex>
using namespace std;
#define int long long
const int mod=1e9+7;
signed main(){
int n,a[100000],fib[100001];
cin>>n;
... | #include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include<vector>
#include<math.h>
using namespace std;
int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
int main()
{
int t,n,i,j,k,l,a,b,c,flag,d;
int arr[100001];
c... |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | #include "bits/stdc++.h"
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define vi vector <int>
#define ff first
#define ss secon... |
#include<bits/stdc++.h>
#define db double
#define il inline
#define iL (1<<20)
#define re register
#define ll long long
#define ui unsigned int
#define ull unsigned long long
#define TEM template<class T>il void
#define Write(x,LC) write((x)),*iter++=LC
#define Writeneg(x,LC) writeneg((x)),*iter++=LC
#define flush() fw... | #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include... |
#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;
char win(char a, char b) {
if (a == b)return a;
if ((a == 'R'&&b == 'S') || (a == 'S'&&b == 'P') || (a == 'P'&&b == 'R')) {
return a;
}
return b;
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define M 1000000007
#define INF ((1LL<<62LL) - 1)
int n,k;
char win(char x, char y){
string gg = "RSP";
if(x == y) return x;
for(int i=0;i<3;i++){
if(gg[i] == x && gg[(i+1)%3] == y) return x;
if(gg[i] == y && gg[(i+1)%3]... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n)
using namespace std;
using ll = long long;
using vll = vector<... | #include<bits/stdc++.h>
using namespace std;
char status[12];
int main(){
scanf("%s",status);
int ans=0;
for(int num=0; num<=9999; num+=1){
vector<bool> on(10);
for(int x=num, t=0; t<4; t++,x/=10)
on[x%10]=1;
bool safe=true;
for(int i=0; i<=9; i+=1)
if((status[i]=='o' and on[i]==0) or (status[i]=='x... |
#include<iostream>
#include<string>
using namespace std;
int main(){
string str;
bool flag=false;
cin>>str;
for(int i=0;i<str.length();++i){
if((i+1)%2!=0){
if(str[i]>=97 && str[i]<=122){
continue;
}
else{
cout<<"No\n";
flag=true;
break;
}
}
else{
if(str[i]>=65 && str[i]<=90){
... | /*include&using-----------------------------------------------------------------------*/
#include <bits/stdc++.h>
using namespace std;
/*debug-------------------------------------------------------------------------------*/
#define _GLIBCXX_DEBUG
#ifdef _DEBUG
#define debug(...) COUT(__VA_ARGS__)
#else
#define debug(..... |
#include <bits/stdc++.h>
/* #include <atcoder/all> */
using namespace std;
/* using namespace atcoder; */
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using vvll = vector<vector<long long>>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
f... | #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>
#include <cassert>
typedef long long int ll;
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// @@ !! LIM(f:gcd)
// --> f:gcd
// ---- inserted function gcd from util.cc
tuple<ll, ll, ll> mut_div(ll a, ll b, ll c, bool eff_c = true) {
// auto [g, s, t] = mut_div(a,... | #include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 9;
const int maxn = 2e3 + 5;
ll rd(){
ll x = 0;
int f = 1;
char ch = getchar();
while(ch < '0' || ch > '9') {
if(ch == '-') f = -1;
ch = getchar();
}
while(ch >= '0' && ch <= '9') {
x... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define All(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend() //reverse
#define strall(v) (v).cbegin(),(v).cend() //const_itterator
#define IN(a, b, x) (a<=x&&x<b)
using namespace std;
using... | #include<iostream>
using namespace std;
int main() {
int n;
cin>>n;
string str;
cin>>str;
for (int i=n-1;i>=0;i--) {
if (i==n-1 && str[0] != str[i]) {
cout<<1<<endl;
return 0;
}
else if (i<n-2 && str[0] != str[i] && str[n-1] != str[i+1]) {
cout<<2<<endl;
return 0;
}
}
cout<<-1<<endl;
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n... | #ifdef Prateek
#include "Prateek.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define debug(...) 42
#endif
#define F first
#define S second
#define pb push_back
#define f(i,x,n) for(int i=x;i<n;i++)
#define all(c) c.begin(),c.end()
#define int ll
using ll = long long;
const int MOD = 1e9+7, N = 20;
... |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF = 1e18;
#define r... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#i... |
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<algorithm>
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++)
#defi... | #include<bits/stdc++.h>
#define ll long long int
#define inf 1E18
#define ninf -1*1E18
#define mod 1000000007
#define fi first
#define si second
#define pb push_back
#define vi vector<long long int>
#define pi pair<long long int,long long int>
#define vpi vector<pair<long long int,long long int>>
using namespace std;
l... |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
// ll n;
int main()
{
#ifndef ONLINE_JUDGE
freopen("inn.txt", "r", stdin);
freopen("hell.txt", "w", stdout);
#else
#endif
ll n;
cin>>n;
ll ans=0;
while(n--)
{
ll a,b;
cin>>a>>b;
ans+=(b*(b+1)/2-a*(a-1)/2);
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin>>n;
vector<long long> a(n);
map<int,long long> cnt;
for(int i=0;i<n;i++){
cin>>a.at(i);
cnt[a.at(i)]++;
}
long long ans=n*(n-1)/2;
auto begin = cnt.begin(), end = cnt.end();
for (auto iter = begin; iter != end; iter+... |
/**
Abir3014
**/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define for1(x, a, b) for(x=a; x<b; x++)
#define for2(x, a, b) for(x=a, x>=b; x--)
#define endl "\n"
#define all(x) x.begin(), x.end()
#define p pair
#def... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 2e5+8, inf = 1e18+9, mod = 998244353;
int n, m;
void solve() {
int i, j, a, b, c;
cin >> a >> b >> c;
cout << 21 - (a + b + c) << endl;
}
signed main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); ... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x)... |
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define rep2(i,n) for(ll i=1;i<=(n);++i)
#define rep3(i,i0,n) for(ll i=i0;i<(n);++i)
#define rrep(i,n) for(ll i=((n)-1); i>=0; --i)
#define rrep2(i,n) for(ll i=(n); i>0; --i)
#define pb push_back
#define mo... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 10000;
int n;
bool mem[N][N];
class ad {
public:
int a, b, c, d, r, id;
ad() {}
void read() {
scanf("%d%d%d", &a, &b, &r);
mem[a][b] = true;
c = a + 1, d = b + 1;
}
void print() { printf("%d %d %d %d\n", a, b, c, ... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
#def... |
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); mt19937 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
#define F first
#define S second
#define PI 4.0*atan(1.0);
#define pb push_back
using namespace... | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define endl "\n"
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
ll a;
cin>>a;
int aa[a];
int bb[a];
for(int i=0;i<a;i++){
cin>>aa[i];
}
for(int j=0;j<a;j++){
... |
#include <bits/stdc++.h>
#define FOR(i, j, k) for(int i = j; i < k; i ++)
#define FORE(i, j, k) for(int i = j; i <= k; i ++)
#define FORD(i, j, k) for(int i = j; i >= k; i --)
#define mp make_pair
#define ll long long
//#define f first
//#define s second
//#define int long long
using namespace std;
const int MOD=1e9+7... | //#include<math.h>
#include<algorithm>
#include<stdlib.h>
#include<time.h>
#include<stdio.h>
#include<string.h>
#define un unsigned
#define srd srand(time(0))
#define ll long long
#define con continue
#define gtc getchar()
#define ptc putchar
#define dou double
#define eps 0.00000000001
#define opr operator
#define cl(... |
#include<stdio.h>
int main()
{
double x,a,b,c,d;
scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
x=(c*b+a*d)/(b+d);
printf("%.10f",x);
} | #include<bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for(int i=(int)(l);i<(int)(r);i+... |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<": "<<(x)<<endl
using namespace std;
using llong = long long;
using vi = vector<int>;
using vvi = vector<vi >;
using vvvi = vector<vvi >;
using pii = pair<int,int>;
constexpr i... | #include <bits/stdc++.h>
#pragma GCC optimize(3)
#define int long long
#define ri register
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define is insert
#define es erase
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getcha... |
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include<atcoder/all>
using namespace std;
// using namespace atcoder;
using ll=long long;
template<class T,class U> inline bool chmin(T&x,U y){if(x>y){x=y;return true;}return false;}
template<class T,class U> inline bool chmax(T&x,U y){if(x<y){x=y;return true;}retu... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(void)
{
LL A,B;
cin>>A>>B;
LL ans=0;
LL maxx=max(A,B);
LL minn=min(A,B);
for(LL i=1;i<=minn-1;i++)
{
cout<<i<<' '<<-i<<' ';
}
if(A>B)
{
for(LL i=minn;i<=maxx;i++)
{
... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.14159265358979323846... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long K, std::vector<std::vector<long long>> T){
vector<int> zyunnretu;
for(int i = 1;i < N;i++){
zyunnretu.push_back(i);
}
ll ans = 0;
do{
ll cost = T[0][zyunnretu[0]];
for(int... |
#include<bits/stdc++.h>
#define pi 3.141592653589793238
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define MOD 1000000007
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#defin... | #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>;
const ll MOD=1000000007;
int main(){
int N;cin>>N;
vector<ll>A;
A.push_back(0);
set<ll>B;
ll tmp;
rep(i,N){
cin>>tmp;
if(B.find(tmp)!=B.end())contin... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=... | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<cmath>
#include<set>
#include<vector>
#define rep(i,a,b) for(ll i=a;i<=b;++i)
#define per(i,a,b) for(ll i=a;i>=b;--i)
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(),x.end()
#define de... |
//#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;
typedef long long Long;
typedef lon... | #include<bits/stdc++.h>
#define fp(x,a,b) for(int x = a; x < b; x++)
#define fn(x,a,b) for(int x = a; x > b; x--)
#define f(x, m) for(auto x : m)
#define cpu() ios::sync_with_stdio(false); cin.tie(nullptr)
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll, ll>
#define vi vector<int>
... |
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
ll s,p;
int main(){
scanf("%lld%lld",&s,&p);
bool flag = 0;
for(ll i = 1;i * i <= p;i++){
if(p%i == 0){
ll x = i,y = p/i;
if(x + y == s) flag = 1;
}
if(flag) break;
}
if(flag) puts("Yes");
else puts("No");
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <climits>
#include <... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
inline int inint(istream& in) {int x; in >> x; return x;}
inline ll inll(istream& in) {ll x; in >> x; retur... | #include<bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i=a; i<b; i++)
#define fr(i,a,b) for(int i=a; i>=b; i--)
#define fll(i,a,b) for(ll i=a; i<b; i++)
#define frll(i,a,b) for(ll i=a; i>=b; i--)
typedef vector<int> vi;
typedef long long int ll;
typedef vector<ll> vll;
#define fastio std::ios::sync_with... |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// nam... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
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; }
#define rep(i, n) for (int i = 0; i < (int)(... |
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//# include <x86intrin.h>
# include <bits/stdc++.h>
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
us... | #include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
#define all(x) (x).begin(), (x).end()
ll a,b,n,m,adj[18],dp[1<<18],s[1<<18];
int chrom(){
ll al=1<<n;
ll bigp=1077563119;
dp[0]=1;
for(ll i=0;i<al;i++){
if ((n-__builtin_popcount(i))%2){
s[i]=1;
... |
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr<< #x << ": "<< x <<"\n";
#define rep(i, n) for(int i=0; i<(int)(n); i++)
template <class T>
bool chmin(T &a, const T &b){
if(a > b){
a = b;
return true;
}
retu... |
#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
using namespace std;
#define ll long long
#define pb(x) push_back(... | #include <bits/stdc++.h>
// 1. dp
typedef long double ld;
#define int long long
#define gcd __gcd
#define endl "\n"
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *m... |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
class CombinationPascal {
public:
CombinationPascal(int n) {
N = n;
dp.assign(n + 1, vector<ll>(n + 1));
d... | #include <bits/stdc++.h>
using ll = long long;
using std::cin;
using std::cout;
using std::endl;
std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());
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... |
// arc120_c
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../../debug_util/cxx-prettyprint/prettyprint.hpp"
#include "../../debug_util/rng.hpp"
#include "../../debug_util/timer.hpp"
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//#include <atcoder/convolution>
//#incl... |
#include<bits/stdc++.h>
using namespace std;
namespace WHH
{
typedef long long ll;
int N;
ll ans;
inline ll gcd(ll a,ll b)
{return ((b==0)?a:gcd(b,a%b));}
inline ll lcm(ll a,ll b)
{return a/gcd(a,b)*b;}
int work()
{
scanf("%d",&N);
ans = 1;
for(int i=2;i<=N;i++) ans = lcm(ans,i);
++ans;
pri... | #include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<cstdlib>
#include<bitset>
#include<stack>
#define fio cin.tie(0);ios_base::sync_with_stdio(false)
#define ll long long
using namespace std;
int main(){
ll int k;
cin>>k;
ll int a = 1;
for(... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
typedef long long LL;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int N = 4e5 + 5;
int n, m, a[N], b[N];
LL ans = 4e17, suf[N], pre[N];
int main() {
cin>>... | #include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1e5+10,mod=998244353;
typedef long long LL;
LL qpow(LL x,LL k){
LL res=1;
while(k){
if(k&1)res=res*x%mod;
x=x*x%mod;
k>>=1;
}
return res;
}
int main(){
long long n,m,k;
scanf("%lld%lld%lld",&n,&m,&k);
if(n==1){
prin... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
//#pragma GCC optimize("O3")
using namespace std;
using namespace _... | /*
========= Plozia =========
Author:Plozia
Problem:T2
Date:2021/3/21
========= Plozia =========
*/
#include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 500 + 10;
const LL P = 998244353;
int n, m, a[MAXN][MAXN];
LL sum;
int read()
{
int sum = 0, fh = 1; char ch = getchar();
for (; ch < '0' || ch > '9... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int INF = int (1e9) + int (1e5);
const ll INFL = ll(2e18) + ll(1e10);
const ui MOD = 1E9 ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define Mp make_pair
#define pb push_back
using ll = long long;
using db = double;
using pii = pair<int, int>;
using vi = vector<int>;
mt19937 mrand(time(0));
ll get(ll r) { return ((ll)mrand() * mrand() % r + r) % r; }
ll get(ll l, ll r)... |
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(ios::badbit | ios::failbit);
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n));
int ii = 0, jj = 0;
for(auto i = 0; i < n; ++ i){
for(auto j = 0; j < n; ++ j){
cin >> a[i][j];
if(a[ii][jj] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); ++i)
const long long INF = 1LL<<60;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
ci... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, x;
cin >> n >> x;
int v[n], p[n];
for (int i=0; i<n; i++){
cin >> v[i] >> p[i];
}
int alcohol;
for (int i=0; i<n; i++){
alcohol += v[i]*p[i];
if (alcohol > x*100){
cout << i + 1 << endl;
... | /*/ Author: _Math.man /*/
#include<bits/stdc++.h>
using namespace std;
/*/---------------------------Defines-----------------------------------------/*/
#pragma GCC optimize("Ofast")
#define int long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#... |
/*#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")*/
// only when really needed
/* GNU G++17 7.3.0: No long long for faster code
GNU G++17 9.2.0 (64 bit, msys 2): Long long only for faster code */
#include <bits/stdc++.h>
#define for1(i,a,b) for (int i = a; ... | #define MOD_TYPE 2
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 0
#pragma GCC target(... |
#include<bits/stdc++.h>
using namespace std;
long long x, y, a[200005], b[200005], ans, n;
priority_queue <int> pq;
main(){
cin>>n;
for (int i=1; i<=n; i++)cin>>a[n-i+1],ans+=a[n-i+1];
for (int i=1; i<=n; i++)cin>>b[i],ans+=b[i];
for (int i=1; i<=n; i++){
pq.push(-a[i]);
pq.push(-b[i]);
ans+=pq.top();
pq.po... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define FOR(i,a,b,c) for(int i=a;i<b;i+=c)
#define REV(i,a,b,c) for(int i=a;i>=b;i-=c)
#define all(x) x.begin(),x.end()
#define Dhruv main
const int pinf=LLONG_MAX;
const int ninf=LLONG_MIN;
const int mod=100000... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <math.h>
#include <chrono>
#include <random>
#include <assert.h>
#include <functional>
using namespace std ;
using... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
int get_smaller_half(ll n) {
string s = to_string(n);
int nsize = s.length();
if (nsize % 2 == 1) {
exit(9);
}
int M = nsize... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main() {
ll n;
cin >> n;
int ans = 0;
for(int i = 1; i<pow(10, log10(n)); i++){
string s = to_string(i);
s += s;
if(stol(s) > n){
break;
}
else{
an... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(40)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
struct Vertex {
ll p;
vector<ll> c;
l... | #include <bits/stdc++.h>
using namespace std;
vector<int> c[100005];
int n, x, ans1[100005], ans2[100005];
bool msf(pair<int, int> x, pair<int, int> y){
if ((x.first+x.second)%2!=(y.first+y.second)%2){
if (x.first-x.second < 0 and (x.first-x.second)%2==0)
return 1;
if (y.first-y.second < 0 and (y.first-y.second... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
cin >> n >> s;
ll ans=0... |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
//const lint MOD =1000000007;
const lint ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const int MAX = 2e5+1;
template <typename T, typename F>
class SegTree{
int n; T uni; F f;
vector<T> dat;
public:
SegTree(int _n, F f, T uni) : f(f), uni(uni) {
n = 1;
while(n < _n) n *= 2... |
#include<bits/stdc++.h>
#define push push_back
using namespace std;
typedef long long ll;
const int inf = 1e9 + 10;
const ll INF = 1e18 + 10;
//
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n;
cin>>n;
int v... |
// Problem: C - Unexpressed
// Contest: AtCoder - Caddi Programming Contest 2021(AtCoder Beginner Contest 193)
// URL: https://atcoder.jp/contests/abc193/tasks/abc193_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
// Disclaimer: Don't copy my template,... |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5+10;
int main()
{
long long N;
cin>>N;
N*=2;
long long ans=0;
for(long long i=1;i*i<=N;i++)
{
if(N%i!=0)continue;
long long temp=i;
if((N/temp+1-temp)%2==0)ans++;
temp=N/i;
if((N/temp+1-temp... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,S;
cin >> s;
S=s;
s[0]=S[1];
s[1]=S[2];
s[2]=S[0];
cout << s << endl;
return 0;
} |
#include <stack>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <utility>
#include <climits>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cstring>
#include <iostream>
#include <fstream>
#include <iomanip... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
double a,b;
cin>>a>>b;
cout<<(a*b)/100<<endl;
return 0;
} |
#include <bits/stdc++.h>
#ifndef M_PI
#define M_PI 3.14159265358979
#endif
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef pair<int, int> ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=10000;
int pcnt;
int primes[N];
bool st[N];
ll ans[2550];
void init()
{
for(int i=2;i<=N;i++)
{
if(!st[i]) primes[pcnt++]=i;
for(int j=0;i*primes[j]<=N;j++)
{
st[i*primes[j]]=true;
if(i%primes[j]==0) break;
}
}
}
int main()
... |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{ cin.tie(NULL);
ios_base::sync_with_stdio(false);
cout.tie(NULL);
int a,b,w;
cin>>a>>b>>w;
w=w*1000;
int l=INT_MAX;//min
int r=INT_MIN;//max;
for(int i=1;i<=w;i++)
{
if(a*i<=w&&w<=b*i)
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout);
#define endl '\n'
#define MOD 1000000007
#def... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 50;
const int inf = 1e9;
inline int lowbit(const int & x) { return x & (-x);}
int n, rt;
int ls[maxn], rs[maxn];
int a[maxn][maxn];
void check()
{
for(int i = 1; i <= n; ++i) for(int j = 1; j <= n; ++j) a[i][j] = (i == j) ? 0 : inf;
for(int i = 1; ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
printf("%d %d\n",(i*2-1)%n+1,(i*2)%n+1);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define INF 1<<30
int adj[2001][2001];
set<int> nb[20001];
int n;
int walk(int root) {
vector<int> d(n+1, INF);
set<pair<int, int> > q;
for(set<int>::iterator i = nb[root].begin(); i!=nb[root].end(); i++){
q.insert(make_pair(adj[root][*i], *i));
d[*i]=adj[root][*i];
... | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 10000000000000;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
void dijkstra(vector<vector<pair<int, int>>> &G, int s,
vector... |
using namespace std;
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long int
#define nl "\n"
#define forf(i,a,n) for(ll i=a;i<=n;i++)
#define forb(i,b,n) for(ll i=b;i>=n;i--)
#define pb push_back
#define vll vector<ll>
#define all(qw) qw.begin(),qw.end()
#define ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;double x,y,a,b,c = 0; cin >> n >> x >> y;
for(int i=0;i<n;i++){
cin >> a >> b;
c = max(c,y-(y-b)/(x-a)*x);
}
cout << c << endl;
} |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld\n", x)
#define c... | #include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <cfloat>
#include <iomanip>
using namespace std;
string S[2000];
long long dp[2000][2000];
long ... |
#include <bits/stdc++.h>
#define ll long long
#define md 1000000007
using namespace std;
int main(){
ll n,H,D,d,h,i;
double mx=0;
cin>>n>>D>>H;
for(i=0;i<n;i++){
cin>>d>>h;
if(H*d>=h*D) continue;
double numr = h*D - H*d;
double den = D-d;
double val = numr/den;
mx = max(mx,val);
}
cout.precision(10);
cout<<fixe... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef pair<ll, ll> pll;
#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 ms memset
#define pb p... |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#include<functional>
#include<iomanip>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
std::fstream myfile("D:\\CodeBlocks\\c++\\input.txt.c", std::ios_base::in);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
vector<ll> vec(n);
for(ll i=0;i<n;i++){
cin>>v... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define pow(n,m) powl(n,m)
#define sqrt(n) sqrtl(n)
const ll MAX = 5000000000000000000;
const ll MOD = 0;
void randinit(){srand((unsigned)time(NULL));}
int main(){
ll N;
cin >> N;
N *= 2;
vector<ll> A,B,C;
... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define dsrep(i,t,s) for(int i = (t)-1; i >= (s); --i)
#define rng... |
#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>;
int main() {
int n;
map<int,int> b;
cin >> n;
ll ans = 0;
vector<int> a(n);
rep(i,n){
cin >> a[i];
b[a[i]] = 0;
}
for(int i = 0; i ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> s(n);
for(ll i=0; i<n; i++){
string S;
cin >> S;
if(S=="AND") s.at(i)=1;
else s.at(i)=0;
}
vector<ll> t(n+1,0);
vector<ll> f(n+1,0);
t.at(0)=1;
f... |
#include <bits/stdc++.h>
#define N 105
#define Mo 998244353
#define pb push_back
#define mk make_pair
#define fi first
#define se second
using namespace std;
int dp[N][N][N * N], n, a[N], fac[N];
int main()
{
scanf("%d", &n); fac[0] = 1; for (int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % Mo;
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int MAXN = 100005;
int f[MAXN], sz[MAXN], n;
vector<int> son[MAXN];
struct Data {
int a, b;
bool operator<(const Data &d) const {
return a - b < d.a - d.b;
}
};
void dfs(int u) {
sz[u] = 1;
vector<Data> v0... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int M;
cin >> M >> M;
vector<string> s(M);
map<string, int> m;
set<string> S;
vector<vector<char>> a(20, vector<char>(20, 'A'));
deque<tuple<int, int, string>> t;
for (int i = 0; i < M; i++) {
cin >> s.at(i);
if (m.count(s.at(i))) {
... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200000 + 10;
const int MOD = 998244353;
int pow(int x, int k) {
if (k == 0) return 1;
long long t = pow(x, k / 2);
t = (t * t) % MOD;
if (k % 2 == 1) t = (t * x) % MOD;
return (int)(t);
}
int main() {
int n, m, k;
cin >> n >>... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define MAXN 101
using namespace std;
double memo[MAXN][MAXN][MAXN]{};
double dfs(vector<int> &coins) {
if (coins[1] == 0)
return 100.0 - coins[0];
if (coins[0] == 100 || coins[1] == 100 || coins[2] == 100)
ret... |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
int main()
{
string s;
cin>>s;
reverse(s.begin(),s.end());
int l = s.size();
for(int i=0;i<l;i++)
{
if(s[i]=='9')s[i] = '6';
else if(s[i]=='6')s[i] = '9';
}
cout<<s<<endl;
return 0;
}
| #include <bits/stdc++.h>
int main()
{
std::string s, t = "";
std::string table[] = { "0", "1", "", "", "", "", "9", "", "8", "6", };
std::cin >> s;
for (int i = s.length() - 1; i >= 0; i--)
t += table[s[i] - '0'];
std::cout << t << std::endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.