code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#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 ordered_set tree<int, null_type , less<int> , rb_tree_tag , tree_order_statistics_node_update>
#define int long long int
#define ull unsigned long long
#de... | #include<stdio.h>
#include<algorithm>
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
ll a, b, c;
cin >> a >> b >> c;
//coditions for a
if(a==b){
cout<<"="<<endl;
}
else if(a==0&&a<b){
cout<<"<"<<endl;
}
else if(a==0 && a>b && c%2!=0... |
#include <bits/stdc++.h>
using namespace std;
// #define TEST(a) cout<<"Case #"<<a<<": ";
#define int long long
// #define ll unsigned long long
// #define Uint unsigned int
#define rep(i, a, b) for (int i = a; i < b; i++)
#define vi vector<int>
#define all(a) a.begin(),a.end()
#define pb push_back
#define mii map<int... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector <int> Liczby(200003);
int main()
{
int Ilosc;
long long wynik = 0, AktualnyWynik = 0;
cin >> Ilosc;
for(int i = 0; i < Ilosc; ++i)
{
cin >> Liczby[i];
AktualnyWynik += Liczby[i];
}
so... |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
bool fg[10005];
int main() {
int n;
cin>>n;
for(int i=6;6*i<=10000;i++) {
cout<<6*i<<" ";
fg[6*i]=true;
n--;
if(n==2) {
cout<<"10 15";
cout<<endl;
return 0;
}
}
for(int i=6;10*i<=10000;i++) {
if(... | #include<bits/stdc++.h>
#define MAX 10000
#define N 2505
using namespace std;
int n;
int a[N];
int main(){
scanf("%d",&n);
for(int i=2;i<=MAX&&a[0]<n-1;i+=2){
if(i%3!=0&&i%5!=0&&i%7!=0&&i%11!=0)continue;
a[++a[0]]=i;
}
a[n]=3*5*7*11;
for(int i=1;i<=n;i++)printf("%d ",a[i]);
} |
//{{{
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VLL = vector<LL>;
using vi = vector<int>;
using pii = pair<int, int>;
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
#ifdef LOCAL
#include "prettyprint.hpp"
// clang-format of... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_N = 19;
const int MAX_M = 105;
ll dp[(1 << MAX_N)];
int X[MAX_M],Y[MAX_M],Z[MAX_M];
int main()
{
int N,M;
cin >> N >> M;
rep(i,M)
{
cin >> X[i] >> Y[i] >> Z[i];
... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A;
vector<int> B;
for (int i = 0; i < N; i++){
int a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < N; i++){
int b;
cin >> b;
B.push_back(b);
}
int minn = A[0];
int maxx = B[0];
for... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i, a, b) for... |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
int x;
cin >> x;
cout << max(x, 0) << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <math.h>
using namespace std;
long long n;
long long bin_search(long long l, long long r) {
if (r == l) return l;
long long m = l + (r - l) / 2;
if (m * m + m > 2 * n + 2) {
return bin_search(l, m);
} else {
return bin_search(m + 1, r);
}
}
int main(... |
#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;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_fron... | //in dp prefix suffix sum helps..
#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<stack>
#include <iterator>
#include <map>
#include<list>
#include <fstream>
#include<unordered_map>
#include<set>
#include<queue>
#define int long long
#define double ... |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | #define fast ios::sync_with_stdio(false); cin.tie(0)
#define foru(i, k, n) for (int i = k; i < n; i++)
#define ford(i, k, n) for (int i = k; i >= n; i--)
#define pb push_back
#define ff first
#define ss second
#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <queue>
using namespac... |
#include <iostream>
using namespace std;
int main()
{
unsigned long long int n;
cin>>n;
unsigned long long i=1;
while(i*(i+1)/2<=n+1)
i++;
cout<<n-i+2<<endl;
return 0;
}
| //#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
//#include<ctime>
//#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
... |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
//Graph[i][j][k] ==> i 番目のアルファベットが置かれている
//辺のうち、j から出ている k 番目の辺がつなぐ j 以外の頂点
vector<int> Graph[26][1000];
int main()
{
int N, M;
cin >> N >> M;
//作れるどんな回文の大きさよりも大きい数（今回はどんなに長くても N * N * 2 とかだねたぶん）
int inf = 1 << 30;
//真ん中に一文字... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 1010
#define M 1010
#define ll long long
int last[N], nxt[M * 2], to[M * 2], ty[M * 2], len = 0;
int dis[N][N], p[N][N];
struct {
int x, y;
}q[9000010];
void add(int x, int y, int w) {
to[++len] = y;
nxt[len] = last[x];
ty[len] = ... |
#include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... | #include<bits/stdc++.h>
// #include<atcoder/all>
using namespace std;
// using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
template<class T>using graph = vector<vector<T>>;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
lint const mod = 1e9+7;
//long const mod = 99... |
#include "bits/stdc++.h"
#define int long long
#define pb push_back
using namespace std;
const int MOD = 1e9 + 7;
int power(int z){
if(z==0)return 1;
return power(z-1)*10;
}
signed main(){
int K;
cin >> K;
string S,T;
cin >> S >> T;
int cnt[10];
for(int i=1;i<=9;i++)cnt[i]=K;
int to=... | #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>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
ll t, n;
cin>>t>>n;
auto f = [&](auto x){
return (ll)floor((100+t)*x*0.01);
};
ll ok = 0, ng = 100*n;
while (abs(ok-ng) > 1) {
ll mid = (ok + ng) /... | #include<bits/stdc++.h>
using namespace std;
int t,N,hah[160];
vector<int> g;
template<typename Tp>
void read(Tp &x)
{
x=0;int f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}x*=f;
}
int main()
{
read(t),read(N);
for(int i=1;i<=100;i++)
{
... |
#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(){
const int m=1000000007;
int n, p;
cin>>n>>p;
int ans=p-1;
int c=p-2;
for(int d=n-1; d>0; d>>=1){
if(d&1) ans=(ll)ans*c%m;
c=(ll)c*c%m;
}
cout<<ans<<endl;... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include<float.h>
#include<tuple>
#include<string.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<map>
#include<deque>
#include<math.h>
using namespace std;
#define ll long long
... |
/*
I love the sound you make when you shut up.
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
/*-------typedefs------*/
template<class T> using or... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
ll res = 2000000000;
for (int bit = 0; bit < (1<<N); bit++) {
stack<ll> tmp;
tmp.push(A[0]);
for (int i = 1; i < N;... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define read freopen ("in.txt","r",stdin);
#define out freopen ("out.txt","w",stdout);
#define sz(x) int((x).size())
#define rep0(i,k) for (int i=0 ; i<k ; i++)
#define rep... | #include <bits/stdc++.h>
using namespace std;
using lli = int64_t;
using ld = long double;
lli g = 10000;
lli dist(lli x1, lli y1, lli x2, lli y2)
{
return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}
lli bsearch(lli x, lli y, lli r, lli y1, lli l, lli h, bool fl)
{
lli ans = LLONG_MAX;
while (l <=... |
#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... |
using namespace std;
#define visual
#ifdef visual
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <assert.h>
#include <functional>
#include <math.h>
#include <string>
#include <ctime>
#endif
#ifndef visual
#include <bits/stdc++.h>
... |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define int long long
int32_t main() {
int n, m;
cin >> n >> m;
if (m < 0) {
cout << -1 << endl;
return 0;
}
else if (m > 0 && n-m < 2) {
cout << -1 << endl;
return 0;
}
vector<vector<int>> r... | #include <bits/stdc++.h>
using namespace std;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define double long double
#define pii pair<int,... |
#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;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back... | #ifndef _MSC_VER
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#endif
#pragma region
using llint = long long;
constexpr std::pair<int, int> dxy[] = { {1,0}, {0,1}, {-1,0}, {0,-1} };
#pragma endregion
namespace mtl {
template <class T, class U>
c... |
/**
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⡖⠁⠀⠀⠀⠀⠀⠀⠈⢲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣸⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣇⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⠀⢀⣀⣤⣤⣤⣤⣀⡀⠀⢸⣿⣿⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣔⢿⡿⠟⠛⠛⠻⢿⡿⣢⣿⣿⡟⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣀⣤⣶⣾⣿⣿⣿⣷⣤⣀⡀⢀⣀⣤⣾⣿⣿⣿⣷⣶⣤⡀⠀⠀⠀⠀
⠀⠀⢠⣾⣿⡿⠿⠿⠿⣿⣿⣿⣿⡿⠏⠻⢿⣿⣿⣿⣿⠿⠿⠿⢿⣿⣷⡀⠀⠀
⠀⢠⡿⠋⠁⠀⠀⢸⣿⡇⠉⠻⣿⠇⠀⠀⠸⣿⡿⠋⢰⣿⡇⠀⠀⠈⠙⢿⡄⠀
⠀⡿⠁⠀⠀⠀⠀⠘⣿⣷⡀⠀⠰⣿⣶⣶⣿⡎⠀⢀⣾⣿⠇⠀⠀⠀⠀⠈⢿⠀
⠀⡇⠀⠀⠀⠀... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ll X;
cin>>X;
ll Y=X;
Y/=100;
Y+=1;
Y*=100;
ll ans=Y-X;
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 998244353
#define INF LONG_MAX/3
#define bit(n) (1LL<<(n))
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, cons... | #include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef vector<int> vi;
typedef pa... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define next Cry_For_theMoon
using namespace std;
const int MAXN=25,LIM=1<<19;
int n,m,g[MAXN][MAXN];
int f[LIM],d[LIM],ans,vis[MAXN];
inline int Min(int a,int b){
return (a<b)?a:b;
}
int main(){
scanf("%d%d",&n,&m);
ans=n;
for(int i=1;i<=n... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef tuple<int,int,int> ti;
typedef tuple<ll,ll,ll> tl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi>... |
#include <bits/stdc++.h>
#define Mod 998244353
using namespace std;
typedef long long ll;
inline int read() {
int out = 0;
bool flag = false;
register char cc = getchar();
while (cc < '0' || cc > '9') {
if (cc == '-') flag = true;
cc = getchar();
}
while (cc >= '0' && cc <= '9') {
out = (out << 3)... | #include <bits/stdc++.h>
using namespace std;
//const long nPrime = 1000000007;
//const long nPrime = 998244353;
int main() {
int n;
cin >> n;
vector<long> viAns = {6,10,15};
for(long i = 2; 6*i < 10000; i++){
viAns.push_back(6*i);
}
for(long i = 2; 10*i < 10000; i++){
viAns.push... |
//GIVE ME AC!!!!!!!!!!!!!!!!!
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define ll long long
#define floatset() fixed<<setprecision(15)
#define all(n) n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()
#define rep(i, s, n) for (ll i = s; i < (ll... | #include <algorithm>
#include <bitset>
//#include <cmath>
//#include <complex>
#include <cctype>
#include <cstdio>
#include <cstdint>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <climits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
ll i,j,k,a,b,c;
ll T,m;
ll t[10005],v[10005],f[100005];
int main()
{
cin>>a>>b;
if(b%a==0)
{
cout<<"Yes";
return 0;
}
else cout<<"No";
return 0;
}
| #include <bits/stdc++.h>
#define ig cin.ignore(numeric_limits<streamsize>::max(), '\n');
using namespace std;
int binarySearch(long long int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
... |
#include<bits/stdc++.h>
using namespace std;
using int64 = long long;
// const int mod = 1e9 + 7;
const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);... | #include <iostream>
#include <string>
int main() {
long long n,m;
std::cin >> n >> m;
long long p = 0;
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
int c = 0;
for (int k = 0; k < m; k++) {
if (s[k] == '1') c++;
}
if (c & 1) p++;
}
std::cout << p * (n - p) << std... |
#include<bits/stdc++.h>
#include<stdlib.h>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<queue>
#include<time.h>
#include <cstdio>
#include <iostream>
#include <vector>
#define ll long long
#define int long long
#define inf 0x3f3f3f3f
#define mods 1000000007
#define modd 998244353
#define PI acos(-... | #include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define F first
#define S second
#define pb push_back
using namespace std;
void test(){
ll n;
cin>>n;
ll a[n];
f(i,n)cin>>a[i];
ll res = a[0];
f(i,n){
ll c = 0, s = a[i];
for(int j=i;j<n;j++){
c++;... |
#include <iostream>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int T;
cin >> T;
while(T--)
{
int n;
cin >> n;
string s[3];
cin >> s[0] >> s[1] >> s[2];
int ones = 0, zeros = 0;
cout << 1;
for(int i = 1; i <= n; i++) cout << 0;
for(in... | #include<bits/stdc++.h>
#define ll long long
#define N 200005
using namespace std;
int n,a[N],b[N],p[N],ans,sx[N],sy[N],z[N],zz,mx,mxid;
bool vis[N];
void dfs(int x)
{
if(vis[x])return;
z[++zz]=x;
vis[x]=1;
if(a[x]>mx)
{
mx=a[x];
mxid=x;
}
dfs(p[x]);
}
int main()
{
#ifdef lovelyG
Sfile(1);
#endif
scanf("%d"... |
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
constexpr ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#de... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pp=pair<int,int>;
const ll INF=1e9;
const ll mod=1e9+7;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int x=c-a, y=d-b;
int s;
if (x==0 && y==0) {s=0; goto OUT;}
else if (abs(x)==abs(y) || (abs(x)<=2 && abs(y)<=2) || (abs(x)==3... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
static const ll mod=1000000007;
ll H,W;
char f[2005][2005];
ll modpow(ll x,ll y){
if(y==0)
return 1;
else if(y%2==0){
ll z=modpow(x,y/2);
return (z*z)%mod;
}else{
ll z=modpow(x,y/2);
return (x*((z*z)%mod))%mod;
}
}
ll sum[2005][20... | #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;
template<int M>
class ModInt {
public:
ll value;
constexpr ModInt(ll v = 0) { value = v % M; if (value < 0) value += M; }
c... |
/**
* @FileName d.cpp
* @Author kanpurin
* @Created 2020.10.10 22:08:23
**/
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template< int MOD >
struct mint {
public:
long long x;
mint(long long x = 0) :x((x%MOD+MOD)%MOD) {}
mint(std::string &s) {
long long z = 0;
... | #include <cstdio>
#include <cctype>
#define rr register
using namespace std;
const int N=111;
int f[N],siz[N],x[N],y[N],n;
inline signed iut(){
rr int ans=0,f=1; rr char c=getchar();
while (!isdigit(c)) f=(c=='-')?-f:f,c=getchar();
while (isdigit(c)) ans=(ans<<3)+(ans<<1)+(c^48),c=getchar();
return ans*f;
}
inline ... |
#include "bits/stdc++.h"
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,avx2")
using namespace std;
using ll = long long;
const int mod = 1e9+7;
ll ans = 0;
array<int, 61> dfs(auto &g, int u, int par, auto &pref, auto &sz)
{
sz[u] = 1;
array<int, 61> ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n,m,dis[1001001],mod=1e9+7,u,v,w,num,ans;
struct node
{
int v,w;
}t;
vector<node>g[1001001];
void dfs(int u,int fa)
{
for(int i=0;i<g[u].size();i++)
{
int v=g[u][i].v;
if(g[u][i].v==fa)
continue;
dis[v]=dis[u]^g[u][i].w;
dfs(v,u);
}
... |
// Author: Pawan Raj
// Problem: D - Shipping Center
// Contest: AtCoder - Panasonic Programming Contest (AtCoder Beginner Contest 195)
// URL: https://atcoder.jp/contests/abc195/tasks/abc195_d
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define int long long
#define F(i, n) for (i... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define fore(i_in,a) for (auto& i_in: a)
#define sz(x) (int)x.... |
#include <bits/stdc++.h>
using namespace std;
struct __INIT
{
__INIT()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
//#define INF (1<<30)
#define LINF (lint)(1... | #include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
// #define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts(... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0)... | #include <bits/stdc++.h>
#define fo(a,b,c) for (a=b; a<=c; a++)
#define fd(a,b,c) for (a=b; a>=c; a--)
#define min(a,b) (a<b?a:b)
#define ll long long
//#define file
using namespace std;
int a[100002],b[100002],n,L,i,j,k,l,sum;
ll ans;
void Exit() {printf("-1\n");exit(0);}
int main()
{
#ifdef file
freopen("c.in","... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pi = acos(-1);
const int maxn = 2e6 + 10;
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const ull base = 131;
const ull mod1 = 1e9 + 9;
const ull mod2 = 1610612741;
ll x, y, a, b;
int main() {
scan... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
const ll mod=1e9+7;
typedef pair<int,int> P;
const int INF=1<<29;
int main(){
double a,b;
cin>>a>>b;
cout<<fixed<<setprecision(10);
cout<<a*b/100<<endl;
} |
#include <iostream>
#include <vector>
#include <utility>
#include<algorithm>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <random>
#include <tuple>
#include <set>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
ll t,n;
cin >>... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include <cfenv>
#include <cmath>
using namespace std;
int main() {
double t, N;
cin >> t >> N;
double A = ceil(N * 100 / t);
double B = floor(t * (A - 1.0) / 100);
long long C = (long long)A + (long long)B;
cout << C << endl;
retur... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n,w;
cin >> n >> w;
cout << n/w << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define stp(var, init, end) for (auto var = init; var < end; ++var)
#define stpe(var, init, end) for (auto var = init; var <= end; ++var)
#define ll long long
int main(void)
{
string a, b;
cin >> a >> b;
int sa = 0, sb = 0;
stp(i, 0, 3)
{
sa +=... |
/* winners never quit and quitters never win.
#swap */
#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;
#pragma GCC optimize ("-O3")
using ll = long long;
using ld = long ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
string t;
cin >> t;
if (t == "0") {
cout << 10000000000 << endl;
return 0;
}
if (t == "1") {
cout << 20000000000 << en... |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define INFLL 0x3f3f3f3f3f3f3f3fLL
#define EPS 10e-9
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define st first
#define nd second
#define sz(v) int(v.size())
#define all(X) (X).begin(), (X).end()
#define... | //Code by Mukul Totla
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
void sublime(){
#ifndef ONLINE_JUDGE
freopen ("input.txt", "r", stdin);
freopen ("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
}
in... |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int64_t a,b;
cin >> a >> b;
cout << max(2*a+100-b,0L) << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define NL '\n'
#define sz(x) x.size()
#define INF LONG_MAX
#define IINF LLONG_MAX
#define PI (2.0*acos(0.0))
#define sfi(x) scanf("%d",&x)
#define sfi2(x,y) scanf("%d %d",&x,&y)
#define sfi3(x,y,z) scanf("%d %d %d",&x,&y,&z)
#define sfl(x) scanf("%lld",&x)
#define sfl2(x,... |
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<stdio.h>
constexpr long long MOD = 998244353;
constexpr long long MOD32 = 665496236;
int main(){
long H=0, W=0, K=0;
char c=getchar_unlocked();
while(c<='9'&&c>='0') {H=(H<<1)+(H<<3)+c-'0'; c=getchar_unlo... | #include<bits/stdc++.h>
using namespace std;
const int N=5010;
int dp[N][N];
char ma[N][N];
int row[N][N],col[N][N];
int po[N*N];
const int P=998244353;
const int inv2=P-P/2;
const int inv3=(P-P/3ll)*inv2%P;
int main(){
int H,W;
cin>>H>>W;
int K;cin>>K;
po[0]=1;
for(int i=1;i<=H*W;i++){
po[i]=(3ll*po[i-1])%P;
}... |
#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"
//#include"atcoder.h"
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll inf = ll(1e18) + 1;
const ll mod = 1000000007;
int main() {
int N;
string S;
cin >> N >> S;
string V;
for (int i = 0; i < N; i++) {
... |
#include <iostream>
#include <vector>
#include <algorithm> //sort,二分探査など
//#include<bitset>
//#include<cmath>//pow,logなど
//#include<deque>
//#include<functional>
//#include<iterator>
//#include<map>
//#include<numeric>//gcd,lcm
//#include<queue>
//#include<set>
//#include<stack>
//#include<string>
//#include<utility>//... | #include <iostream>
//#include <vector>
//#include <string>
//#include <algorithm>
//#include <math.h>
//#include <queue>
//#include <stack>
//#include <iomanip>
// sometimes used
//#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
typedef long long L... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
long long tmp=n;
long long num=0;
long long len=1;
bool flag=true;
while(tmp>0){
if(flag&&tmp%10==0) len*=10;
else flag=false;
num=num*10+tmp%10;
tmp/=10;
}
num*=len;
... | #include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long
#define all(x) (x).begin(),(x).end()
using namespace std;
template<typename KeyType, typename ValueType>
std::pair<KeyType,ValueType> get_max( const std::map<KeyType,ValueType>& x ) {
using pairtype=std::pair<Key... |
//#include <bits/stdc++.h>
//using namespace std;
#include <cstdio>
#include <vector>
using namespace std;
#define rep(i,_l,_r) for(signed i=(_l),_end=(_r);i<=_end;++i)
#define fep(i,_l,_r) for(signed i=(_l),_end=(_r);i>=_end;--i)
#define erep(i,u) for(signed i=head[u],v=to[i];i;i=nxt[i],v=to[i])
#define efep(i,u) for... |
#include<bits/stdc++.h>
#define fi first
#define se second
#define INF 100000000000000000LL
#define ll long long
#define debug(x) cout << #x << " "<< x <<endl;
#define debug_vector(v) cout << #v << " "; _print(v);
const ll inf =1e9+44;
const int MAX=3e5+9;
const ll MOD= 1e9+7;
const double eps=1e-10;
double const ... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define Test int T;cin>>T;while(T--)
#define ls lower_bound
#define up upper_bound
#define bs bina... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define d(x) cout<<x<<" "
#define nl cout<<endl
#define rep(var,init_val,final_val) for(int var = init_val; var < final_val; ++var)
#define tt ll t;cin>>t;while(t--)
#defin... |
#include<bits/stdc++.h>
using namespace std;
long long n,K,T[3000000];
long long f(long long a){
if(a<2)return 0;
else if(a<=n+1)return a-1;
else if(a<=n+n)return n+n+1-a;
else return 0;
}
long long S(long long k){
if(k<0) return 0;
else if(k<n) return (k+2)*(k+1)/2;
else if(k<2*n-2)return (9*n-3*n*n+6*k*n-6... | // Problem: B - -- - B
// Contest: AtCoder - AtCoder Regular Contest 112
// URL: https://atcoder.jp/contests/arc112/tasks/arc112_b
// 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 = pair<int,... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 998244353;
int p(int a, int b) {
if (b == 0) return 1;
int tmp = p(a, b / 2);
if (b % 2 == 0) return (tmp * tmp)%mod;
return ((tmp * tmp)%mod * a)%mod;
}
int n, m;
int sum[5001];
int val[5001][5001];
int pow_m[5001... | #include <bits/stdc++.h>
template <int MOD_> struct modnum {
static constexpr int MOD = MOD_;
static_assert(MOD_ > 0, "MOD must be positive");
private:
using ll = long long;
int v;
static int minv(int a, int m) {
a %= m;
assert(a);
return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a);
}
public:
mo... |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int h,w;
cin>>h>>w;
//(i,j)から a[i][j][k]にいける
vector<vector<vector<pair<int,int>>>>go(h,vector<vector<pair<int,int>>>(w,vector<pair<int,int>>(0)));
go.push_back(vector<vector<pair<int,int>>>(26,vector... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... |
#include <bits/stdc++.h>
#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 chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define even(x) (x % 2 == 0 ? true : f... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<string> S(N);
vector<int> T(N);
for(int i=0; i<N; i++) cin >> S.at(i) >> T.at(i);
vector<int> t(N);
for(int i=0; i<N; i++) t.at(i) = T.at(i);
sort(t.begin(),t.end());
int ans;
for(int i=0; i<N; i++){
if(T.at(i) ==... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
#define ar array
const int INF = 0x3f3f3f3f;
const ll LINF = 0... |
// radhey krishna
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
template<typename T> T sqr(const T &x) {
return x * x;
}
#define endl "\n"
int mx[31] , mn[31];
void solve(){
ll a ,b ,c ,d;
cin>>a>>b>>c>>d;
ll flag = 0;
if(a == b+c+d){
fla... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
vector<int> v(4);
int ans = 0;
for(int i=0;i<4;i++){
cin>>v[i];
ans+=v[i];
}
for(int i=1;i<8;i++){
int curr = 0;
for(int j=0;j<... |
#include<stdio.h>
int main()
{
int N,K,M,i,sum = 0;
scanf("%d %d %d",&N,&K,&M);
int ar[N-1];
for(i=0;i < N-1;i++)
{
scanf("%d",&ar[i]);
sum += ar[i];
}
if((sum/N) >= M)
{
printf("0\n");
}
else if(((sum+K)/N)< M)
{
printf("-1\n");
}
else... | #include<iostream>
using namespace std;
int main()
{
int N,K,M,t;
cin>>N;
cin>>K;
cin>>M;
int sum=0;
for(int i=0;i<N-1;i++){
cin>>t;
sum=sum+t;
}
int check=N*M-sum;
if(check<0)
cout<<0;
else if(check<=K && check>=0)
cout<<check;
else
cout<<-1;
return 0;
} |
#include <bits/stdc++.h>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include <numeric>
usin... | #include <bits/stdc++.h>
using namespace std;
int a, b;
vector<int> ans;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
while (cin >> a >> b) {
int sum = 0;
ans.clear();
if (a >= b) {
for (int i = 1; i <= a; i++) ans.push_back(i), sum += i;
for (int i... |
//#include<bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <string.h>
#include <vector>
#include <utility>
#include <map>
//#pragma GCC optimize "trapv"
#define int long long
#define For(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define endl "\n"
#define F first
#def... | #include "bits/stdc++.h"
#define pb push_back
#define mp make_pair
using namespace std;
using ll = long long;
signed main(){
ll n;
cin >> n;
vector<ll>a(n),b(n);
ll sum = 0;
vector<pair<ll,pair<ll,ll>>>d;
for(ll i=0;i<n;i++){
cin >> a[i] >> b[i];
sum = sum + a[i];
d.pb(mp(-2*a[i]-b[i],mp(a[i],a[i]+b[... |
#include <bits/stdc++.h>
using namespace std;
#define SOLVER(x) solve_B x
static void s_solve(void)
{
long long N, X;
string S;
long long ans;
cin >> N >> X;
cin >> S;
ans = X;
for (long long i = 0; i < N; i++)
{
switch ( S.at(i) )
{
case 'o':
... | #include <string>
#include <iostream>
#include <vector>
#include <algorithm>
#include <sstream>
#define BUF_SIZE 500
enum way {
u,
l,
r,
d
};
int main()
{
short int si, sj;
{
char buf[1000];
std::stringstream ss;
std::cin.getline(buf, 1000);
ss << buf;
... |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define mod 1000000007ll
//#define mod 998244353ll
#define endl '\n'
#define inf ((ll)1e18+1)
#include<chrono>
using namespace chrono;
mt19937_64 rng(high_resolution_clock::now().time_since_epoch().count());
#include <ext/pb_ds/assoc_container.hpp>
... | #include <bits/stdc++.h>
using namespace std;
int inf = 1001001001;
int main(){
int N,M;
cin >> N >> M;
vector<int> A(N);
for(int i=0;i<N;i++) cin >> A[i];
vector<vector<int>> G(N,vector<int>(0));
for(int i=0;i<M;i++){
int x,y;
cin >> x >> y;
x--;y--;
G[x].push_back(y);
}
vector<int... |
#include <iostream>
#include <string>
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << 21 - a - b - c << endl;
return 0;
}
| // Problem Link - https://www.codechef.com/UADPIP01/problems/KFIB
/* By Prateek Pani */
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
// // #include<ext/pd_ds/tree_policy.hpp> // works on decommenting on my machine
// // #include<ext/pd_ds/trie_policy.hpp> // works on decommenting on my machine
usi... |
/* dont stick to an approach */
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
#include <cstdlib>
#include <bitset>
using namesp... | // author: sharad12arse
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define gcd __gcd
#define INF LONG_LONG_MAX
void solve(){
int n;
cin>>n;
vector<ll> arr(n);
for(int i=0;i<n;i++){
cin>>arr[i];
}
map<ll,ll> m1;
m1[0]=1;
ll sum=0;
ll ans=0;
for(int i=0... |
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
const int mxn = 103;
bool g[mxn][mxn], f[mxn][mxn];
int n, id;
void dfs(int v) {
f[v][id] = true;
for(int i = 0; i < n; i++)
if(g[v][i] && !f[i][id])
dfs(i);
}
signed main() {
std::ios::sync_with_stdio(0);
std::cout.tie(0);
std::... | // Problem: D - Message from Aliens
// Contest: AtCoder - ZONe Energy Programming Contest
// URL: https://atcoder.jp/contests/zone2021/tasks/zone2021_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define int long long
... |
#include "bits/stdc++.h"
using namespace std;
#define sync ios_base::sync_with_stdio(0);cin.tie(0);
#define all(x) x.begin(),x.end()
#define unq(a) sort(all(a));a.resize(unique(all(a)) - a.begin())
#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define mem(a , x) me... | #include<bits/stdc++.h>
#include <iostream>
using namespace std;
int main()
{
#ifdef LOCAL_EXEC
#else
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#endif // LOCAL_EXEC
long long int n,i,j,k,x=0,y,z,sum=0;
cin>>n>>k;
long long int cnt[n+1]={0};
for(i=1;i<=n;i++){
cin>>x;... |
#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10;
const int p=1e9+7;
#define rint register int
#define rll register long long
#define ll long long
char s[N];
ll dp[N][20];
int n,k,st[N],a[N];
ll dfs(rint hh,rint re,bool ismx,bool iszero){
if(re<0||re>hh)return 0;
if(!hh)return 1;
if(dp[hh][re]!=-1&&!i... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#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... |
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MTP make_tuple
typedef long long int ll;
constexpr int kN = int(2E5 + 10);
struct BIT {
int val[kN];
BIT () {memset(val, 0, sizeof(val));}
void add(int pos, int x) {
while (pos < kN) {
val[pos] += x;
pos += pos & -pos;
}
return ;... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int fa[maxn];
unordered_map<int, int> mp[maxn];
int findfa(int x){
if(fa[x] == x) return x;
return fa[x] = findfa(fa[x]);
}
void merge(int x, int y){
int fx = findfa(x), fy = findfa(y);
if(fx==fy) return;
if(mp[fx].size() > mp... |
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define db double
#define el "\n"
#define ld long double
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n;i>=0;i--)
#define r... | // D - Circle Lattice Points
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using dbl = long double;
int main(){
ll scale = 1e4;
dbl x, y, r; cin>>x>>y>>r;
ll X = round(x*scale);
ll Y = round(y*scale);
ll R = round(r*scale);
ll r2 = R*R;
ll ans = 0;
for(ll i=0; i<=2*R+scale; i+=scale){
ll ... |
/////home/mohammed/.config/sublime-text-3/Packages/User
/*input
*/
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <math.h>
#include <sstream>
#include <iterator>
#include <cstdlib>
#include <unordered_map>
#include <map>
#include <li... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
... |
#include <bits/stdc++.h>
using namespace std;
#define For(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define End return 0
#define vi vector<int>
#define pb push_back
#define YES printf("YES\n")
#define NO printf("NO\n")
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << s[1] << s[2] << s[0] << endl;
}
|
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define int long long
const int maxn = 2e5+10;
int lst[300];
int Minus[300];
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
for(int i = 'a';i <= 'z';i++)lst[i] = n;
ll ans = 0;
if(... | #include<bits/stdc++.h>
#define f(i,a,b) for( int i=a;i<=b;++i)
#define ff(i,a,b) for( int i=a;i>=b;--i)
#define debug(x) cerr << #x << " : " << x << " " << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<string, string> ps... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int T;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::en... |
/**
* author: Taara Sinh Aatrey
* created: 26.06.2021 17:33:36
**/
#include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> istream& operator>>(istream &is, pair<A, B> &p) { return is >> p.first >> p.second;} template<typename T_container, typename T = typename enable_if<!is_same<T_cont... | #include <iostream>
#include <cstdint>
int main() {
std::int64_t A, B, C, D;
std::cin >> A >> B >> C >> D;
std::int64_t count = -1;
if (B < C * D) {
const auto denom = C * D - B;
count = (A + denom - 1) / denom;
}
std::cout << count << std::endl;
return 0;
}
|
#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>
using namespace std;
bool brute(int n,int k,vector<vector<int>> &a,vector<int> &b){
if(k==0){
bool bo=true;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(a[i][j]!=a[0][1]){
bo=false;
break;
}
}
if(!bo) break;
}
if(bo){
cout << "conglats" << a[0][1] <<... |
#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;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define reset(x) memset(x... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define iambharatks \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define bitcount __builtin_popcount
#define setbits(x) __builti... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aurinegro (Nicolás Álvarez)
*/
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for(int i=0;i<(int)(n);i++)
#define si(c) ((int)(c).size())
#define pb push_back
using ll = long long int;
using vi = v... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef long long ll;
typedef vector<ll> vint;
typedef vector< vector<ll> > vvint;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repf(i,f,n) for(ll i=f;i<n;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define mp make_p... |
#include <bits/stdc++.h>
#define pb(a) push_back(a)
#define rep(i, d, e) for (int i = d; i < e; i++)
#define ffor(i, a, b) for (int i = a; i <= b; i++)
#define rloop(i, c, d) for (int i = c; i >= d; i--)
#define ll long long
#define vc vector<ll>
#define pp pop_back()
#define mod 1000000007
#define MAX 1000000
using n... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < n; i++)
int main()
{
int n;
cin >> n;
vector<vector<int>> a(n,vector<int>(3));
rep(i,n){
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
int ans = 0;
rep(i,n){
... |
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(...) begin(__VA_ARGS__) , end(__VA_ARGS__)
#define boost {ios_base::sync_with_stdio(false); cin.tie(); cout.tie();}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long... | #include<bits/stdc++.h>
using namespace std;
struct fastio{fastio(){cin.tie(nullptr);ios_base::sync_with_stdio(false);std::cout<<std::fixed<<setprecision(10);}}oitsaf;
#define rep(i,n) for(int i=0;i<int(n);++i)
constexpr char newl = '\n';
template<class T>std::istream&operator>>(std::istream&is,std::vector<T>&v){for(a... |
//g++ t.cpp -o t && t < p.txt
//d>p.txt&&t<p.txt&&t2<p.txt
#include <iostream> // プログラムの耳と口
#include <vector> // 超有能配列秘書
#include <algorithm> // みんな大好きソートと二分探索
#include <queue> // きゅーちゃん、だいすき
#include <string> // to_string
#include <functional> // 関数を変数に入れる子
#include <set> // 値の取得・挿入・削除を高速に
#include <map> // setの妹 これま... | #define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(...) begin(__VA_ARGS__) , end(__VA_ARGS__)
#define boost {ios_base::sync_with_stdio(false); cin.tie(); cout.tie();}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll read() {
ll sum = 0, ff = 1;
char ch = getchar();
while(ch < '0' || ch > '9') {
if(ch == '-') {
ff = -1;
}
ch = getchar();
}
while(ch >= '0' && ch <= '9') {
sum = sum * 10 + ch - 4... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long ans = 0;
int abmin = max(2, K + 2);
int abmax = min(2 * N, K + 2 * N);
for (int ab = abmin; ab <= abmax; ab++) {
long long abl = max(ab - N, 1);
long long abr = min(N, ab-1);
long long cdl = max(ab... |
#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;
vector<int> check;
string get(string s){
string n="";
for (char&c:s){
n.push_back(check[c-'a']+'0');
}
return n;
}
int main(){
string s1,s2,s3;cin>>s1>>s2>>s3;
check.assign(26,-1);
for (char&c:s1) check[c-'a']=1;
for (char&c:s2) check[c-'a']=1;
for (char&c:s3) c... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int ans = 0;
for(int i = 0; i < S.size(); i++){
if(i % 2 == 0 && S.at(i) > 'Z') ans++;
if(i % 2 == 1 && S.at(i) < 'a') ans++;
}
if(ans == S.size()) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
// #pragma GCC target ("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC target("fpmath=387") //ex... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int count = 1;
cin >> str;
for (auto s : str) {
if (count%2 == 1 && isupper(s)) {
cout << "No";
return 0;
}
else if (count%2 == 0 && islower(s)) {
cout << "No";
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define REP(i, k, n) for(ll i = k; i < n; ++i)
#define REPI(i, k, n) for(ll i = k; i >= n; --i)
#define vi vector<int>
#define vch vector<char>
#define vstr vector<string>
#define vll vector<ll>
#define vb vector<bool>
#def... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define fz(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define ffe(it,v) for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define fill0(a) memset(a,0,sizeof(a))
#define fill1(a) memset(a,-1,sizeof(a))
#define... |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
#define DIV 1000000007
#define ll long long
using namespace std;
const int INF = 1e9+7;
int show_matrix(vector<vector<int>> &dp) {
loop(0, dp.size(), i) {
loop(0, dp[i].size(), j) {
cout << dp... |
#include <iostream>
#include <bits/stdc++.h>
#define ll long long int
#define max_value 0x3f3f3f
/*0 0, 0, 1, 0], [0, 1, 0, 0, 0], [0, 0, 0, 0, 1], [0, 0, 1, 0, 0], 1, 0, 0, 0, 0
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
using namespace std;
typedef pair<ll,ll> pii;
const in... | // abc196_e
#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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
#define MOD 1000000007
//#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#ifndef ONLINE_JUDGE
#define F_AND_L __FUNCTION__ << ":" << __LINE__
#define X(x) { cerr << F_AND_L << "[ " << #x << " : " << x << " ]" << endl;}
#define D(x) << "[ " << #x << " : " << x << " ] "
#define S(...) cerr << F_AND_L __VA_ARGS__ << endl... |
#include<bits/stdc++.h>
using namespace std;
// #pragma GCC target ("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC target("fpmath=387") //ex... | #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;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... |
#include <bits/stdc++.h> //12.25 , -7,
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#include <fstream>
#define int unsigned long long int
#define mod 1000000007
#define watch(x) cout<<(#x)<<" is "<<(x)<<"\n"
#define watch2(x,y) cout<<(#x)<<" is "<<(x)<<" and "<<(#y)<< " is " <<(... | //Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector... |
#include <bits/stdc++.h>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
using ll = long long;
using P = pair<int,int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline bool chmax(T& a, T b) { if (a < b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define N 2114514
const ll mod = 998244353;
const ll inf = 1000000000000000000;
P a[N];
ll num[N];
bool used[N];
int main() {
ll n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
ll x;
cin >> x;
... |
#include<bits/stdc++.h>
using namespace std;
#define vec vector<int>
#define vecp vector<pair<int,int>>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fr first
#define sc second
#define fr1(i,a,b) for(int i=a;i<b;i++)
#define fr2(i,a,b) for(int i=a;i>=b;i--)
#define fr3(i,a,b) for(int ... | #include <bits/stdc++.h>
#define F first
#define S second
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define RFOR(i, a, b) for(int i = a; i >= b; i--)
#define all(v) ((v).begin()), ((v).end())
#define endl '\n'
using namespace std;
using ll = long long;
using ull = unsigned long long;
using Graph = vecto... |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define endl '\n'
// n acho que eu seja bom, mas eu j... | ///
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fo(i,a,b) for(int i=a;i<b;i++)
#define fodec(i,a,b) for(int i=a;i>b;i--)
#define sz(v) int(v.size())
#define len(s) s.length()
#define vi vector<int>
#define vll vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define... |
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
using namespace std;
// タイプ定義
typedef long long llong;
// マクロ
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(llong i=llong(a);i<llong(b);++i)
#define rep(.... | // In the name of God...
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define F first
#define S second
const int N = 3000;
int a[N], t;
bool mark[N];
ll GCD(int n, int m){
if(n == 0) return m;
if(m == 0) return n;
if(n > m) return GCD(n % m, m);
return... |
#include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using namespace std;
using ll = long long;
using ld = long double;
ll MOD = 1000000007;
const ll root = 3;
ll... | #include <bits/stdc++.h>
#define fo(a,b,c) for (a=b; a<=c; a++)
#define fd(a,b,c) for (a=b; a>=c; a--)
#define ll long long
//#define file
using namespace std;
int n,i,j,k,l;
char S[500001];
char T[500001];
int s1[500001],s2[500001];
int ans,sum;
int main()
{
#ifdef file
freopen("b.in","r",stdin);
#endif
scanf(... |
////////////////////////////////////
/// ∧__∧ ///
/// （ '・ω・） < Let's ///
/// （ つ旦と） Go AC ///
/// と__)___） ///
////////////////////////////////////
/// Coded In Sublime Text ///
////////////////////////////////////
#include <bits/stdc++.h>
using ... | #include<bits/stdc++.h>
using namespace std;
int a[3];
int n1,n2,n;
int main(){
int t,i,m,j,k;
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
if(a[0]==a[1])
{
cout<<a[2]<<endl;
}
else if(a[1]==a[2])
{
cout<<a[0]<<endl;
}
else
{
cout<<0<<endl;
}
} |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define PRECISION cout << fixed << setprecision(20);
using namespace std;
template<class Fun>
class y_combinator_result {
Fun fun_;
public:
template<class T>
explicit y_c... | #include <bits/stdc++.h>
using namespace std ;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
const ll mod = 1e9 + 7 ;
int main(){
ll n ;
cin >> n ;
ll ans = 0 ;
map<ll,ll> P ;
rep(i,n){
ll p ;
cin >> p ;
P[p]++ ;
if( p == ans ){
... |
#include <bits/stdc++.h>
using namespace std;
const int p[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
int n,x[55];
long long ans=1e18;
void dfs(int i,long long j) {
if (i==15) {
for (int i=1; i<=n; ++i)
if (__gcd((long long)x[i],j)==1) return;
ans=min(ans,j); return;
}
dfs(i+1,j);
dfs(i+1,j*p[i]);
}
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb emplace_back
#define pii pair<int , int>
#define F first
#define S second
const int mod = 1000000007;
const int MAXX = 1e5 + 5;
int t , n;
int x[MAXX];
... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
double N;
cin >> N;
double a;
int ans;
a = 1.08 * N;
ans = a;
if(ans < 206) {
cout << "Yay!" << endl;
}
else if(ans == 206) {
cout << "so-so" << endl;
}
else {
cout << ":(" << endl;
}
... | // Ref :
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
#define tab "\t"
#define endl "\n"
#define pb emplace_back
#define sz(x) int((x).size())
#defin... |
#include<bits/stdc++.h>
using namespace std ;
int main()
{
std::ios::sync_with_stdio(false) , cin.tie(0) ;
int n ;
cin >> n ;
vector<array<int , 2>> v(n) ;
for(int i = 0 ; i < n ; i ++) v[i][0] = i * 2 % n , v[i][1] = (i * 2 + 1) % n ;
for(int i = 0 ; i < n ; i ++) cout << v[i][0] + 1 << ' ' <... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
template<class T>T ABS(T x) {return x<0?-x:x;}
//int ksm(int x,int y) {int r=1;whil... |
#pragma GCC optimize("Ofast")
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <stack>
#include <deque>
#include <queue>
#include <list>
#include <set>
#include <map>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
... |
#include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15);
#define f first
#define s second
#define newl cout<<"\n";
#define pb push_back
#define mset(a,... | #include<bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
int n,m;
int dp[2000][2000];
int a[2000],b[2000];
signed main(){
memset(dp,10,sizeof(dp));
cin>>n>>m;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=m;i++)cin>>b[i];
dp[0][0]=0;
for(int i=1;i<=n;i++)dp[i][0]=i;
for(int i=1;i<=... |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
#define repr(i,n) for (int i = (n)-1; i >= 0; --i)
#define rep1r(i,n) for (int i = (n); i > 0; --i)
#define bit(n,k) ((n>>k)&1... | #include<bits/stdc++.h>
#define FORz(i,t,n) for(int i=t;i<=n;i++)
#define FORf(i,n,t) for(int i=n;i>=t;i--)
#define SCC(x) scanf("%d",&x)
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef long long ll;
using namespace std;
const int N=2e5+5;
const ll MOD=1e9+7;
// inline int read(){int x=0,f=1;char... |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
map<int,vector<int>> mp;
bool dp[400010];
int main(){
int i,n,m; cin >> n >> m;
for(i=0;i<m;i++){
int x,y; cin >> x >> y;
mp[x].push_back(y);
}
for(i=0;i<=2*m;i++) dp[i] = false;
dp[m] = true;
map<int,bool... | #include<bits/stdc++.h>
using namespace std;
#define int ll
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,... |
#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()
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
#define FOR(i,x,n) for(int i=x;i<(n);i++)
using ll = long long;
using PAIR = pair<int, int>;
using PAIRLL = pair<ll,ll>;
using vi... | #include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> //Policy Based Data Structure
// using namespace __gnu_pbds; //Policy Based Data Structure
using namespace std;
// typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> pbds; //Policy Based Data Structure
/... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.