code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | #include <iostream>
#include <string>
using namespace std;
int main(){
while(1){
string str, left, right;
int m, h;
cin>>str;
if(str == "-") break;
cin>>m;
for(int i=0;i<m;i++){
cin>>h;
left = str.substr(0, h);
right = str.substr(h, str.length()-h);
str = right + left;
}
cout<<str<<endl;
... | 0 | 58,687,822 |
#include <iostream>
using namespace std;
bool map[100][100];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, c;
cin >> a >> c;
for (int j = 0; j < c; j++) {
int b;
cin >> b;
map[a - 1][b - 1] = true;
}
}
for (int i = 0; i < n; i++) {
cout << (map[i][0] ? "1" : "0");
for (int... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_b... | 0 | 17,745,092 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> v,p(n,0),q(n,0);
for(int i=0;i<n;i++){
cin>>p[i];
}
for(int i=0;i<n;i++){
cin>>q[i];
}
int a,b,i=0;
bool flag=true;
for(int i=1;i<=n;i++){
v.push_back(i);
}
do{
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define increment(a, b) (a == '.' && b == '#')
int find_root(int h, int w)
{
unsigned int dp[h][w];
string s[h];
REP(i, h)
{
cin >> s[i];
REP(j, w)
{
dp[i][j] = -1;
}
}
dp[0][0] = (s[0][0] == '#'... | 0 | 34,085,487 |
#include<cstdio>
int main(){
int n,m,l;
scanf("%d %d %d",&n,&m,&l);
printf("%s\n",(n<m && m<l)?"Yes":"No");
} | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#define NDEBUG
#include <cassert>
using namespace std;
#define TEST
#ifdef T... | 0 | 74,541,550 |
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
ll N = pow(10,10);
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;cin>>n>>k;
int ans=0;
if(k==1){
ans =0;
}
else{
ans = n-k;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define endl '\... | 0 | 89,523,858 |
#include <bits/stdc++.h>
using namespace std;
const int C = 1046527;
char baca[C][13];
int hs(int key, int i) {
return (key % C + i * (1 + key % (C - 1))) % C;
}
int cToI(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
else
re... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int table[64][100000];
int b[64];
int Abit[64][100000];
int shift[64];
int dim;
void dump(const vector<int>& look, const int N) {
for (int i=0; i<look.size(); i++) {
for (int j=0; j<N; j++) {
cerr << table[i][j] << "... | 0 | 91,736,041 |
#include<bits/stdc++.h>
#define MAX 5000
#define MOD 1000000007
using namespace std;
vector<int> p,c;
long long go(int start, int k)
{
long long sum = 0;
int ii = start;
int steps = 0;
vector<int> v;
do
{
ii = p[ii];
v.push_back(c[ii]);
sum += 1LL*c[ii];
++steps;
}
while(ii^start);
long long tmp = 0, r... | #pragma GCC optimize("Ofast")
#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))
constexpr int MOD=1000000007;
#define INF (1<<30)
#define LINF (lint)(... | 0 | 7,793,949 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
const ll INF = 1LL << 60;
int main(){
int n;
char x;
string s;
cin >> x;
if (x == ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
vector <char> s, t;
string S, T;
cin >> S >> T;
for (unsigned int i = 0; i < S.length(); i++) {
char c = S[i];
s.push_back(c);
}
for (unsigned int i = 0; i < T.length(); i++) {
char c =... | 0 | 24,143,160 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n;
cin >> n;
int a[n],b[n];
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
int line[n];
rep(i,n) line[i] = i+1;
int count = 1;
int ansa = 0, ansb = 0;
bool flag = tr... | #pragma target("avx")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
#define rep(i,b,e) for(ll i=b; i<e; i++)
#define... | 0 | 7,244,849 |
#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define mp make_pair
#define pb push_back
#define re register ll
#define fr first
#define sd second
#define pa pair<ll,ll>
#define FOR(i,a,b) for(re i=a;i<=b;i++)
#define REP(i,a,b) for(re i=a;i>=b;i--)
#define lowbit(x) (x&(-x))
#define Z(x) (x>=mod?x-mod:x)
#de... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a ... | 0 | 33,056,443 |
#include <bits/stdc++.h>
#define MAX 11000
#define ll long int
using namespace std;
int main() {
map<string,int> mp;
string s ;
ll i,j,n,count=0,sum=0;
cin >> n;
for(i=0;i<n;i++)
{
cin >> s;
sort(s.rbegin(), s.rend(), greater<char>());
count += mp[s]++;
}
cout << count;
} | #include<iostream>
#include<map>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string tmp[]={"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
string str;
int i,l,cnt1,cnt2,n;
cin >>n;
for(int v=0;v<n;v++){
cin >> str;
l=str.size(... | 0 | 6,837,524 |
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a);i<(b);++i)
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; ++i)
#define all(a) (a).begin(), (a).end()
int N;
vector<int> A, c, S;
int main() {
map<int, int> m;
cin >> N;
A.resize(N);
rep(i, N) {
cin >> A[i];
m[A[i]]++;
}
for (auto it = m.begin()... | 0 | 99,513,760 |
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define all(x) x.begin(), x.end()
#define watch(x) cout<<#x<<" : "<<x<<endl
#define tr(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define testCa... | #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(void){
int n,t,m;
cin >> n;
(t = ceil((sqrt(1+8*n)-1) / 2));
m = (t*(t+1))/2;
for(int i = 1; i <= t; i++){
if( n == m - i ){
}
else{
cout << i << endl;
}
}
} | 0 | 7,845,023 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <fstream>
#include <string>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> T;
const ll mod = 1000000007;
const ll INF = 100000010000;
ll kai[100... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
int N;
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return (b);
}
else
{
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b)
{
return a / gcd(a, b) * b;
}
int ma... | 0 | 31,864,443 |
#include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<string>
#include<iostream>
#include<vector>
#include<cstdlib>
using namespace std;
template <class T> using V = vector<T>;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}... | #include<iostream>
#include<vector>
using namespace std;
int BFS(int s, int t, const vector<vector<int> >& G){
vector<int> stock1;
vector<int> stock2;
stock1.push_back(s);
vector<int> check(101, 0);
int d = 0;
while (1) {
for (int i = 0; i < stock1.size(); i++) {
if (stock1[i... | 0 | 14,198,311 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,A;
cin>>N>>A;
puts(N%500<=A?"Yes":"No");
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
template <typename T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {... | 0 | 26,847,167 |
#include<algorithm>
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<string>
#include<vector>
using namespace std;
#define MP make_pair
int n,m;
int a[200005];
bool v[200005];
vector<pair<int,int> > g[200005];
in... | #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << (x) << "\n";
#def... | 0 | 99,403,777 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int nmin, nmax, m;
while (cin >> m >> nmin >> nmax, m) {
int p[210];
for (int i = 1; i <= m; i++)cin >> p[i];
int ans = nmin, v = p[nmin] - p[nmin + 1];
for (int i = nmin + 1; i <= nmax; i++) {
if (v <= p[i] - p[i + 1]) {
ans = i;... | #include <bits/stdc++.h>
using namespace std;
int parent[200005];
int ranking[200005];
int n, m;
int get_parent(int a)
{
return (parent[a] = parent[a] == a ? a : get_parent(parent[a]));
}
void join(int a, int b)
{
if (get_parent(a) == get_parent(b))
return;
if (ranking[get_parent(a)] < ranking[get_p... | 0 | 40,564,546 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int N = S.length();
int M = T.length();
for (int i = N - M; i >= 0; i--) {
string s = S.substr(i, M);
bool ok = true;
for (int j = 0; j < M; j++)... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include<iomanip>
#include<cassert>
#include<bitset>
#include<sstream>
using namespace std;
... | 0 | 32,059,678 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define rsz resize
#define ins insert
#define mp make_pair
#define pf push_front
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define sz(x) (int)(x).size(... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
string dream = "dream";
string dreamer = "dreamer";
string erase = "erase";
string eraser = "eraser";
reverse(dream.begin(), dream.end());
rev... | 0 | 14,380,170 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int remaining = n;
int left = 0, right = n - 1;
while (right -... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <set>
#include <algorithm>
#define FOREVER for (;;)
#define FOR(i,a,b) \
for (int (i)=(a);(i)<(b);(i)++)
#define REP(i,a,b) \
for (int (i)=(a);(i)<=(b);(i)++)
#define log(exp) \
printf(#exp" = %d\n", exp)
#define INF 100000000
using namespace std;
const ... | 0 | 20,595,632 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int main() {
ll n,m;
cin >> n >> m;
vector<ll> a(n,0);
vector<int> b(n,0);
... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 38,439,263 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pii pair<int, int>
const int mod = 1e9+7;
const int MAXN = 1e5+5;
const int N = 1e5+5;
int fac[N];
int spf[MAXN];
void pre(int p) {
fac[0] = 1;
for(int i=1; i<N; i++) {
fac[i] = (fac[i-1... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n;
cin>>n;
string s;
double u;
double sum=0;
for(int i=0;i<n;i++){
cin>>u>>s;
if(s=="JPY")sum+=u;
else sum+=u*380000.0;
}
cout<<sum<<end... | 0 | 8,108,508 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N),B(N);
for(int i=0;i<N;i++){
cin >> A.at(i);
}
for(int i=0;i<N;i++){
cin >> B.at(i);
}
int64_t sum=0;
int64_t ans=0;
vector<int> diff;
for(int i=0;i<N;i++){
if(A.at(i)>=B.at(i)){
diff.push_... | #include<bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c, d;
cin >> a >> b >> c >> d;
int count = 0;
if(a>b) {
count+=b;
} else {
count+=a;
}
if(c>d) {
count+=d;
} else {
count+=c;
}
cou... | 0 | 63,920,198 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define enter putchar('\n')
#define space putchar(' ')
#define MAXN 100005
typedef long long int64;
using namespace std;
template<class T>
void read(T &res) {
res = 0;char c = getchar();T f =... | #include<iostream>
#include<vector>
#include<string>
#include<math.h>
#include<algorithm>
#include<cstring>
using namespace std;
int canReach[2][16001];
bool DP(vector<int> v,int t,int start){
memset(canReach,0,sizeof(canReach));
canReach[0][8000+start]=1;
if(v.size()==0)
retur... | 0 | 72,592,185 |
#include <stdio.h>
char number[1001];
int main(){
int x,sum;
sum=1;
while(sum!=0){
sum=0;
while((x=getchar())!='\n'){
sum+=x-'0';
}
if(sum==0){
break;
}
printf("%d\n",sum);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp, vector<Q_temp>, greater<Q_temp>>;
const ll MOD = (ll)(1e9 + 7);
const int INF = (int)1e9;
const ll... | 0 | 62,692,524 |
#include <iostream>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
bool ok = true;
map<int, bool> vis;
for(int i = 1; i <= n; ++i) {
int x;
cin >> x;
if(ok)
ok = !vis[x];
vis[x] = true;
}
cout << (ok ? "YES" : "NO");
} | #include <bits/stdc++.h>
using namespace std;
int N,K;
const int n=200010;
int cnt[n];
int main()
{
cin>>N>>K;
for (int i = 0; i < N; i++)
{
int a;
cin>>a;
cnt[a-1]++;
}
sort(cnt,cnt+N);
int ans=0;
for (int i = 0; i < N-K; i++)
{
ans+=cnt[i];
}
co... | 0 | 61,537,873 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
const int MN = 112;
const int inf = 1e9;
int n, m, dp[MN][MN];
char s[MN][MN];
int ds (int i, int j) {
if (dp[i][j] != -1) return dp[i][j];
int res = inf;
if (i+1 < n) {
if (s[i][j] == '#') {
... | #include <bits/stdc++.h>
#define INF 1000000000000000001
#define ll long long
#define pll pair<ll, ll>
using namespace std;
vector<bool> next(bool fir, bool sec, string& s)
{
vector<bool> res = {fir, sec};
ll N = s.size();
for (ll i = 0; i < N; ++i)
{
if (sec)
{
if (s[i] == 'o')
{
re... | 0 | 15,599,702 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int (i)=a;(i)<(b);(i)++)
#define rep(i, n) FOR(i,0,n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>>
vvvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef ve... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int ans = 0, N;
string n;
cin >> n;
N = atoi(n.c_str());
for (int i = 0; i <= n.size(); i += 2) {
for (int j = pow(10, i); j < pow(10, i + 1); ++j) {
if ... | 0 | 35,176,434 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define INF 10000000
using namespace std;
bool check(char x){
for(int i=48; i<=57; i++){
if(x == i) return true;
}
return false;
}
int main(){
int n;
cin >> n;
rep(i,n){
string a,b;
cin >> a >> b;
int... | #include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | 0 | 69,636,796 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int h, w;
string s;
int ansi, ansj;
cin >> h >> w;
for ( int i = 0; i < h; i++ ){
for ( int j = 0; j < w; j++){
cin >> s;
if ( s == "snuke" ){
ansi = i;
ansj = j;
}
}
}
char c = 'A' + ansj;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long long unsigned int ull;
typedef long double ld;
typedef vector<int> vr;
typedef pair<int, int> pr;
#define pb push_back
#define ff first
#define ss second
#define INF 1999999999
#define MODA 1000000007
#define PI 3.141592653589793238462... | 0 | 69,207,983 |
#include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
int main() {
int nums[3];
rep(0, 3) cin >> nums[i];
sort(nums, nums + 3);
cout << (nums[0] == nums[1] ? nums[2] : nums[0]) << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int N;
int main() {
cin >> N;
vector<int> a(N);
int mx = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
a[i] = tmp;
mx = max(mx, tmp);
}
int r = -1;
for (int ... | 0 | 40,124,557 |
#include <stdio.h>
#include <string.h>
int main(){
int N;
scanf("%d",&N);
int a;
int b;
int c;
a = N%10;
b = N/10%10;
c = N/100;
if(a==7||b==7||c==7){
printf("Yes");
}else{
printf("No");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int init();
int solve();
#define rep(i, a) for (int i = 0; i < (int) (a); i++)
#define reps(i, a, b) for (int i = (int) (a); i < (int) (b); i++)
#define rrep(i, a) for (int i = (int) a-1; i >= 0; i--)
#define rreps(i, a, b) for (int i = (int) (a)-1; i ... | 0 | 5,813,577 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define INF 1000000000
#define PB ... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long dp[101][2][101] = { 0 ... | 0 | 53,136,316 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> v(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back(b);
v[b].push_back(a);
}
bool ok = false;
for (auto s : v[0]) {
fo... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template... | 0 | 30,506,207 |
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#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 ll long long int
#define ld long double
#define vi vector<ll>
#define vii vector <pair<ll,ll> >
#define se... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
ll n;... | 0 | 16,402,057 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<unsigned long long int>;
void PrintVec(VI& v) {
for (Int i = 0; i < v.size(); ++i) {
cout << v[i] << endl;
}
return;
}
... | #include <iostream>
#include <cmath>
#include <cstdint>
int main()
{
int64_t a, b, c, d;
std::cin >> a >> b >> c >> d;
int64_t num[4] = {a * c, a * d, b * c, b * d};
int64_t max = num[0];
for(int i = 1; i < 4; i++)
{
if(num[i] > max)
{
max = num[i];
}
}
std::cout << max << std::endl;
return 0;
} | 0 | 97,370,192 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define pi 3.14159265358979323
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {
return(gcd(b, a % b));
}
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
string temp;
rep(i,n) {
if(s.substr(i, n) == t.substr(0, n-i)){
... | 0 | 15,646,397 |
#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(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
struct Vertex {
vector<ll> node;
};
Vertex V[105];... | #include <bits/stdc++.h>
using namespace std;
long long int MOD = 1000000007;
int main()
{
int N;
string S;
cin >> N;
cin >> S;
if (S[0] == 'W' || S[2 * N - 1] == 'W')
{
cout << 0 << endl;
return 0;
}
vector<int> C(2 * N);
C[0] = 1;
long long int cnt = 1;
for ... | 0 | 28,781,958 |
#include <cstdio>
int N, M, f[100001], w[100001], b[100001], d[100001];
int F(int x)
{
if (f[x] == x)
return x;
F(f[x]);
w[x] ^= w[f[x]];
return f[x] = f[f[x]];
}
int main()
{
scanf("%d%d", &N, &M);
for (int i = 1; i <= N; i++)
f[i] = i;
for (int i = 1, u, v; i <= M; i++)
{
scanf("%d%d", &u, &v);
d[u]++... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rre... | 0 | 66,217,444 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n,m,k;
cin >> n >> m >> k;
for(ll i=0;i<=n;i++){
for(ll j=0;j<=m;j++){
ll ans = (n-i)*j+(m-j)*i;
if(ans==k){
cout << "Yes" << endl;
return 0;
}
... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
templat... | 0 | 59,081,496 |
#pragma GCC optimize("avx2, O3")
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <deque>
#include <map>
#include <fstream>
#include <utility>
#include <stack>
#include <unordered_map>
#include <unord... | #include <bits/stdc++.h>
#include<cmath>
using namespace std;
#define int long long int
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define F first
#define S second
#define all(a) a.begin(),a.end()
#define endl '\n'
#define boost ios::sync_with_stdio(false);cin.tie(0);cout.ti... | 0 | 59,138,113 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <numeric>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9+7)
int main(){
int n;
cin >> n;
vector<int> yes;
int v = 2;
while(v*(v+1)/2<=n){
yes.push_back(v*(v+1)/2);
v++;... | 0 | 74,912,611 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <utility>
#include <iomanip>
#include <queue>
#include <set>
#include <numeric>
#include <unordered_set>
#define rep(i,n) for(int i=0;i< (n);++i)
typedef long long ll;
using namespace std;
ll gcd(ll a,ll b){
while(true){
b=b%a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, uint>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
const int CASES = 2;
void solve(){
int N, K; cin >> N >> K;
vector<ll> A(N);
for(int i = 0; i < N ; ++i) cin >> A[i];
vector<l... | 0 | 34,358,483 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<ll, ll>;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inl... | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
ll N;
cin >>... | 0 | 83,010,612 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool ... | #include <iostream>
using namespace std;
int main()
{
int first = 0;
int second = 0;
int third = 0;
for (int i = 0; i < 10; ++i) {
int number;
cin >> number;
if (number <= third) continue;
third = number;
if (third <= second) continue;
swap(second, third);... | 0 | 68,609,546 |
#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;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define INIT(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | 0 | 3,138,883 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A,B;
cin >> A >> B;
int64_t num;
int64_t ans = 0;
if ( A % 2 == 0 ){
if ( B % 2 == 0 ){
num = B - A;
ans = num/2;
ans = ans%2;
ans = ans^B;
} else {
num = B ... | 0 | 80,648,871 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
string str;
int n;
cin >> str>>n;
while (n--){
string require;
cin >> require;
if (require == "replace"){
int a, b;
string p;
cin >> a >> b >> p;
str.replace(a, b - a + 1, p)... | #include <cstdio>
#include <cstring>
using namespace std;
int main()
{
int W, H;
int N;
int state[16][16];
int dp[16][16];
while (scanf("%d %d", &W, &H) && W != 0){
scanf("%d", &N);
memset(state, 0, sizeof(state));
memset(dp, 0, sizeof(dp));
for (int i = 0; i < N; i++){
int x, y;
scanf("%d %d", &x,... | 0 | 66,066,818 |
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef unsigned long long ull;
... | #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 l, r;
cin >> l >> r;
if(r - l >= 2019) cout << 0 << endl;
else{
vector<int> n;
for(int i = l; i <= r; i++){
n.push_back(i... | 0 | 29,697,788 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
cout << t << s << endl;
return 0;
} | #include <iostream>
#include <queue>
#include <string>
#include <stdio.h>
using namespace std;
int main(){
string command;
int k;
priority_queue<int> S;
while(cin >> command && command != "end"){
if(command == "insert"){
cin >> k;
S.push(k);
}else if(command == "e... | 0 | 85,811,482 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
ll cnt1=n/100;
ll cnt2=n%100;
if(cnt1*5>=cnt2){
cout << 1;
}
else{
cout << 0;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>P;
int main(){
int N,M;
while(1){
cin >>N>>M;
if(N==0 && M==0)break;
P a[N];
for(int i=0 ; i < N ; i++){
cin >>a[i].second>>a[i].first;
}
sort(a,a+N,greater<P>());
for(int i=0 ; i < N ; i++){
int d=min(M,a[i].s... | 0 | 48,233,908 |
#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 H, W, K;
int main()
{
cin >> H >> W >> K;
vector<string> s(H);
rep(i, H) cin >> s[i];
int ans = 0;
rep(is, 1 << H) rep(js, 1 << W)
{
int cnt =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
ll n,cnt=0;
ll a[N],f[N];
bool prime[N];
string s1,s2;
int main() {
ios::sync_with_stdio(false);
ll t, i, j = 0;
ll m, x, y,k;
memset(prime,true,sizeof(prime));
for(... | 0 | 23,777,289 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,a,b;cin>>n>>a>>b;
int cnt=0;
for(int i=1;i<=n;i++){
int c=i,ans=0;
while(c){
ans+=c%10;
c/=10;
}
if(a<=ans&&ans<=b)c... | #include <bits/stdc++.h>
using namespace std;
int main(){
map<long long,int> dict;
int n;
cin >> n;
for(int i=0;i<n;i++){
int a;
cin >> a;
if(dict.count(a)){
cout << "NO" << endl;
return 0;
}else{
dict[a] = 1;
}
}
cout <... | 0 | 3,264,460 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n, m;
cin >> n >> m;
vector<bool> e(n);
for (auto _ : irange(0L, m)) {
int64_t a, b;
cin >> a >... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
class UnionFind{
public:
vector<int> p;
vector<int> rank;
UnionFind(int n){
p... | 0 | 46,394,532 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,x,n) for(int i=x;i<n;i++)
#define mod 1000000007
#define INF 1000000000000
#define F first
#define S second
#define P pair<int,int>
#define all(vec) vec.begin(),vec.end()
int n,m;
int h[200000];
int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int n, m, x;
cin >> n >> m >> x;
vi c(n);
vector<vector<int>> a(n, vector<int>(m));
rep(i,n){
cin >> c[i];
rep(j,m) cin >... | 0 | 51,729,168 |
#include <math.h>
#include <iostream>
#include <stdio.h>
using namespace std;
typedef long long ll;
int main() {
ll X,Y;
cin >> X >> Y;
ll out = X+Y/2;
cout << out << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define PI acos(-1)
#define INF 100000000
#define sc(n) scanf("%d",&n);
#define ssc(n) scanf("%s",n);
#define lsc(n) scanf("%lld",&n);
#define dsc(n) scanf("%lf",&n);
#define csc(n) scanf("%c",&n);
#define LL long long int... | 0 | 81,061,770 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll X;
cin >> X;
ll n = X/100;
ll m = X - 100*n;
if(m <= 5*n)cout << 1 << endl;
else cout << 0 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int ma=0;
for(int i=0;i<2;i++){
int sum=0;
for(int j=0;j<4;j++){
int a;
cin>>a;
sum+=a;
}
ma=max(ma,sum);
}
cout<<ma<<endl;
return 0;
} | 0 | 6,500,389 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n;cin>>n;
ll a[n],b[n],c[n];
rep(i,n) {
cin>>a[i]>>b[i];
c[i]=-(a[i]%b[i]);
if(a[... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; ret... | 0 | 24,329,986 |
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#define vi vector<int>
#define vpii vector<pii>
#define pii pair<int, int >
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define LL long long
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define al... | #include <bits/stdc++.h>
using namespace std;
signed main () {
int n, l;
cin >> n >> l;
vector < int > a(n + 1, 0);
int j = 0;
for (int i = 1; i <= n; ++i)
cin >> a[i];
for (int i = 1; i < n; ++i) {
if (a[i] + a[i + 1] >= l) {
j = i;
break;
}
}... | 0 | 81,032,550 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
int main(){
ll n,x;
cin>>n>>x;
--x;
vector<vector<ll>> index(n+1,vector<ll>(3));
vector<ll> p(n+1);
index[0][0]=0;
index[0][1]=0;
index[0][2]=0;
p[0]=1;
fo... | #include <bits/stdc++.h>
#define lli long long int
#define vec2 vector<vector<lli>>
#define fio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define FRE freopen("explicit.in","r",stdin);freopen("explicit.out","w",stdout)
#define pll pair <lli,lli>
#define vll vector <lli>
#define vpll vector <pll>
#define f ... | 0 | 17,629,358 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LONG... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MN = 200010;
int N;
int A[MN];
set<pii> st;
bool check(int x) {
st.clear();
for(int i = 1; i < N; i++) {
if(A[i - 1] < A[i]) {
continue;
}
else {
int pos = A[i];
while(p... | 0 | 70,808,679 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize ("-ffloat-store")
#pragma GCC optimize ("-fno-defer-pop")
#define all(a) a.begin(),a.end()
#define ll long long int
#define ld long double
ll power(ll a,ll b,ll m){ if(b==0) return 1; if... | #include <bits/stdc++.h>
using namespace std;
void print(vector<int> x){
int n;
for (n = 1; n < x.size()-1; n++){
cout << x.at(n) << " ";
}
cout << x.at(n) << endl;
}
void clean(vector<int> &x){
for (int n = 0; n < x.size(); n++){
x.at(n) = 0;
}
}
int main(){
int N, K;
cin >> N >> K;
vector<in... | 0 | 64,474,016 |
#include "bits/stdc++.h"
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define endl '\n'
#define F first
#define S second
#define IO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define cf ll testcases;cin>>testcases;while(testcases--)
#define prn(x) if(x) cout<<"YES"<<endl; else cout<<"NO"<<endl;
#... | #include<iostream>
#include<cmath>
using namespace std;
int min_one_way(int h, int w){
return min(h,w);
}
int min_two_way(int h, int w){
int divh = h/3;
int divw = w/2;
int s1 = divh*w;
int s2 = (h-divh)*divw;
int s3 = (h-divh)*(w-divw);
int min_horizon1 = min(min(s1,s2),s3);
int max_hor... | 0 | 79,879,003 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstdint>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
const int mod=1e9 + 7;
int n,k;
cin>>n>>k;
vector<int> v(n,0);
for(int i=0;i<n;i++)
cin>>v[i];
vector<ll> dp(k+1,0);
for(int i=0;i<=min(k,v[0]);i++)
dp[i]=1;
fo... | 0 | 507,858 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << (x) << '\n'
#define debugArray(x, n) ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using ll = long long;
const ll M = 1000000000000000000;
int main(){
ll n; cin >> n;
vector<ll> a(n);
bool flag = false;
rep(i,n){
cin >> a[i];
if(a[i]==0) flag = true;
}
ll ans=1;
rep(i,... | 0 | 16,846,369 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
ll N, M, d;
signed main() {
cin >> N >> M >> d;
ll p = 0;
if (d == 0) {
p += N;
} else {
... | #include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
int n;
stack<int> st;
int cef;
int ans;
cin >> n;
for(int i = 0; i < n; i++) {
string mcxi1, mcxi2;
cin >> mcxi1 >> mcxi2;
int temp1 = 0;
int temp2 = 0;
cef = 1;
for(int i = 0; i < mcxi1.size();... | 0 | 33,731,336 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m=1e32,s,p,j,i,a[500];
cin>>n;
for(i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
for(i=a[0];i<=a[n-1];i++)
{
s=0;
for(j=0;j<n;j++)
{
p=(a[j]-i);
s+=(p*p);
}
if(s<m)m=s;
}
... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define hcf __gcd
bool is_prime(ll n){
if(n==2) return true;
if(n%2==0) return false;
for(ll i=3;i*i<=n;i+=2){
if(n%i==0)
return false;
}
return true;
}
int main(void){
ios::sync_with_stdio(0); cin.tie(0);
#i... | 0 | 90,557,254 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int a, b;
cin >> a >> b;
if ((a*b)%2 == 0) cout << ... | #include <iostream>
#include <vector>
#include <set>
using namespace std;
int H, W, M;
int main() {
cin >> H >> W >> M;
vector<int> h(H), w(W);
set<pair<int, int> > st;
int maxH = 0, maxW = 0;
for (int i = 0; i < M; i++) {
int ih, iw;
cin >> ih >> iw;
--ih; --iw;
st.insert({ih, iw});
h[ih]... | 0 | 67,024,231 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
#define FS fix... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll H,W,K,i,j,count;
ll ans = 0;
char C[6][6],B[6][6];
cin >> H >> W >> K;
for(i=0;i<=H-1;i++)
cin >> C[i];
for(ll bith = 0;bith < (1<<H);bith++)
for(ll bitw = 0;bitw < (1<<W);bitw++){
count = 0;
for(i=0;i<=H... | 0 | 92,657,746 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << e... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define INF 1000000
void make_multiplier(int x, int N, vector<int>& coins) {
int num = x;
while(num <= N) {
coins.push_back(num);
num *= x;
}
}
int main() {
int N;
cin >> N;
int dp[100010];
for(in... | 0 | 98,575,216 |
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define forn(n1,n2) for(ll i=n1;i<n2;i++)
#define w(t) ll t;cin>>t;while(t--)
#define en "\n"
#define mod 1e6+3
#define f first
# define s second
using namespace std;
ll i,n,m,x,y,z,j,k,l,mn=LLONG_MAX,mx=0,c,a[100005],r,cnt=0,sum=0;
string str;char c... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
long long a,b;
cin>>a>>b;
long long sum = a*b;
long long ss = (long long)sqrt(sum);
if(a==b||abs(a-b)==1){
a = min(a,b);
cout<<2*a-2<<endl;
}else{
... | 0 | 1,940,186 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
ll gcd(ll a, ll b){ if(b==0){ return a; } return ... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep(i,a,b) for(int i=a;i>=b;i--)
template<class T> inline bool chma... | 0 | 23,447,059 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include <bits/stdc++.h>
using namespace std;
const int maxn=3e5+10;
struct point {
int x,y;
}p[maxn];
map<int,int> xcnt,ycnt;
signed main(void){
int n,m,k;
cin>>n>>m>>k;
int x,y,maxr=0,maxc=0;
for(int i=0;i<k;i++){
cin>>x>>y;
p[i]={x,y};
xcnt[x]++,ycnt[y]++;
maxr=max... | 0 | 50,949,067 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
int n;
int cnt[maxn], Max;
void no() { puts("Impossible"); exit(0);}
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
{
int v;
scanf("%d", &v);
++cnt[v];
Max = max(Max, v);
}
if(Max % 2 == 0)
{
int h = Max / 2;
for(int i = 1;... | #define _USE_MATH_DEFINES
#include <cmath>
#include <iostream>
# include <bits/stdc++.h>
using namespace std;
long long powerexp(long long base, long long exp, int mod) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res= (res * base) % mod;
exp = exp >> 1;
base = (base * base)... | 0 | 70,897,883 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<queue>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n; ll ans = 0;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; ) {
ll tmp = 0;
int j = i;
while (j < n && a... | 0 | 48,696,091 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using lint = long long int;
int H, W, N;
vector<P> p;
int count(int x, int y)
{
if (x <= 0 || y <= 0 || x >= H-1 || y >= W-1) return 0;
int ans = 0;
for (int i=-1; i<=1; i++)
{
for (int j=-1; j<=1; j++)
{
... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 0 | 23,906,555 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+5;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>s;
for(ll i=2; i<s.size(); i++)
{
if(s[i]==s[i-1]&&s[i-1]==s[i-2])
{
cout<<"Yes";
return 0;
}
}
cout<<"No";
return 0;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<v... | 0 | 75,048,089 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int gcds(vector<int> as) {
int ans = as[0];
for (int i = 1; i < as.size(); i++) {
ans = gc... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <bitset>
#include <math.h>
typedef long long ll;
typedef unsigned long long ull;
#define vi std::vector<int>
#define vl std::vector<ll>
#define floop(n) for(int i = 0; i < n; ++i)... | 0 | 41,960,839 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<ll,ll>
#define poly vector<ll>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-... | 0 | 6,966,226 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll GCD(ll a, ll b){ return a ? GCD(b % a, a) : b; }
int main(){
int h,w,d;
cin>>h>>w>>d;
vector<vector<int>> a(h,vector<int>(w));
map<int,pair<int,int>> m;
map<pair<int,int>,int> m2;
for(int i=0; i<h; i++){
for(int j=0; ... | #include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()... | 0 | 70,112,224 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i,j,k,ar[32]= {1,1,1,2,1,2,1,5,2,2,1,5,1,2,1,14,1,5,1,5,2,2,1,15,2,2,5,4,1,4,1,51};
cin>>k;
for(i=0; i<=32; i++)
{
if(i==(k-1))
cout<<ar[i];
}
return 0;
} | #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <iterator>
#include <numeric>
#include <cstdint>
#include <cmath>
#include <bitset>
#include <string>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define N_... | 0 | 38,893,005 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s,p;
int index = 0;
getline(cin, s);
getline(cin, p);
for (int i = 0; i < s.size(); i++){
index = i;
if (s[i] == p[0]){
for (int j = 0; j < p.size(); j++){
index = (i + j) % s.size();
if (s[index] != p[j]) break;
if (j... | #include <cstdio>
int main()
{
int m,f,r;
while(1){
scanf("%d %d %d", &m, &f, &r);
if(m == -1 && f == -1 && r == -1) break;
if(m == -1 || f == -1)
printf("F\n");
else if(m + f < 30)
printf("F\n");
else if(m + f >= 30 && m + f < 50){
if(... | 0 | 32,380,821 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
using ll = long long;
using P = pair<ll, ll>;
int main()... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin>>N;
vector<char> S(N);
for(int i=0;i<N;i++){
cin>>S[i];
}
int K;
cin>>K;
char temp=S[K-1];
for(int i=0;i<N;i++){
if(S[i]!=temp){
S[i]='*';
}
}
for(int i=0;i<N;i++){
cout<<S[i];
}
... | 0 | 92,582,972 |
#include <iostream>
using namespace std;
int main(void)
{
int k, a, b; cin >> k >> a >> b;
bool flag = 0;
int tmp = k;
while (tmp <= b)
{
if (tmp >= a && tmp <= b)
{
flag = true;
break;
}
tmp += k;
}
if (flag) cout << "OK" << endl;
... | #include<bits/stdc++.h>
using namespace std;
template <typename T> inline void readline(T &n) {n = 0; int f = 1; register int ch = getchar();
for (; !isdigit(ch); ch = getchar()) if (ch == '-') f = -1;for (; isdigit(ch);
ch = getchar()) n = (n << 3) + (n << 1) + ch - '0';n = n * f;}
template <typename T, typename TT>... | 0 | 74,115,275 |
#include <fstream>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;
int cnt_sum_s(int n, int k, int s, int tmp_sum) {
if (n == 0) {
return (tmp_sum == s) ? 1 : 0;
}
int res = 0;
for (int i = k+1; i < 10; i++) {
res += cn... | #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... | 0 | 39,151,330 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int M=3e5+5;
int a[M],cnt[M];
int main()
{
int n; scanf("%d",&n);
int nu;
for(int i=0;i<n;i++)
{
scanf("%d",&nu);
a[nu]++;
}
for(int i=1;i<=n;i++)
cnt[a[i]]++;
int ans=n;
int j=n;
for(int i=1;i<=n;i++)
{
while(j>ans... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int pair[100];
int input;
vector<int> inputs;
for(int i = 0; i < 10; i++)
for(int j = 0; j < 10; j++)
pair[i * 10 + j] = i + j;
while(cin >> input) inputs.push_back(input);
for(int k = 0; k < (int)inputs.size(); k++){
int inp... | 0 | 68,835,902 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pb push_back
#define f(i,n) for(int i=0; i<n; ++i)
#define fi(i,st,n) for(int i=st; i<=n; ++i)
#define veci vector<int>
#define vecp vector<pair<int,int> >
#define vecl vector<ll>
int prime[100000+10];
ll lcm(ll a... | 0 | 52,345,011 |
#include <stdio.h>
int
main(void)
{
char line[80];
int d;
while (fgets(line, sizeof line, stdin)) {
if (sscanf(line, "%d", &d) == 1) {
int s = 0;
for (int i = 1; d*i <= 600 - d; i++) {
s += (d*i)*(d*i) * d;
}
printf("%d\n", s);
}
}
return 0;
} | #include<bits/stdc++.h>
#define int long long
#define maxn 100005
#define pii pair<int,int>
using namespace std;
int N;
pii arr[maxn];
int sz[maxn];
vector<int> G[maxn];
int dfs(int u,int pa) {
int ret = 0;
for(int v:G[u])
if(v!=pa)
ret += sz[v]+dfs(v,u);
return ret;
}
main() {
ios::sync_with_stdio(0);
cin.ti... | 0 | 10,008,459 |
#include<bits/stdc++.h>
using namespace std;
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define pa pair<int,int>
#define mod 998244353
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define cl(x) memset(x,0,sizeof x)
#ifdef Devil_Gary
#def... | #include <iostream>
using namespace std;
bool board[7][7];
bool row[7], col[7];
int h, w, k, tol = 0;
void dfs(int i, int j) {
if (i < h) {
col[i] = true;
dfs(i + 1, j);
col[i] = false;
dfs(i + 1, j);
} else if (j < w) {
row[j] = true;
dfs(i, j + 1);
row[j... | 0 | 54,598,834 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | 0 | 70,095,036 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define ALLTRUE(xs) all_of(ALL(xs),[](bool x){return x;})
#define AND(x,y,z) set_intersection((x).begin(),(x).end(),(y).begin(),(y).end(),inserter((z),(z).end()))
#define ANYTRUE(xs) any_of(ALL(xs),[](bool x){return x;})
#define CONCAT(... | 0 | 14,943,948 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,P>
#define T tuple<ll,ll,ll>
#define pr(x) cout << x << endl;
using namespace std;... | #include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL)
#define int long long
using namespace std;
const int mod = 1e9+7;
int expo(int a, int b){
if(b == 0){
return 1;
}
int ans = expo((a*a)%mod,b/2);
if(b%2){
return (a*ans)%mod;
}
return ans%mod;
}
vo... | 0 | 21,989,610 |
End of preview. Expand in Data Studio
- Downloads last month
- 14