code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define ALL(v) (v.begin(),v.end())
#define COUT(x) cout<<(x)<<... | 0 | 72,088,376 |
#include <bits/stdc++.h>
#warning !!!check the size of arrayss!!!
#define INF 2000000000000000005
#define MOD 1000000007
#define newMOD 998244353
#define MAX 300006
#define pi 3.1415926535897932384626433832795
#define ld long double
#define ll long long
#define int long long
#define P(gg) for(a... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int mod = 1e9+7;
vector<int> a[30];
void solve() {
int n; string s; cin >> n >> s;
... | 0 | 60,653,800 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
vector<int> prime(int N) {
vector<bool> a(N, true);
for(int i=1; i<sqrt(N); i++) {
... | #include<iostream>
using namespace std;
int main() {
int m[10000], f[10000], r[10000];
int n = 0;
for (;;n++) {
cin >> m[n] >> f[n] >> r[n];
if (m[n] == -1 && f[n] == -1 && r[n] == -1) {
break;
}
}
for ( int i = 0; i < n; i++) {
if (m[i] == -1 || f[i] == -1) {
cout << "F" << endl;
... | 0 | 98,333,897 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using VVI = vector<vector<int>>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
bool dp[30009][4][1009];
string s;
int... | 0 | 73,395,419 |
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d;
int main()
{
cin >> a >> b >> c >> d;
int ab = a + b;
int cd = c + d;
if (ab > cd)
{
cout << "Left" << endl;
}
else if (ab < cd)
{
cout << "Right" << endl;
}
else
{
cout << "Balanced" << end... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef ... | 0 | 54,130,192 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
double average(double a, double b) { return (a + b) / 2.0; }
int main() {
int ... | #include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = numeric_limits<int>::max() /4;
const ll linf =... | 0 | 77,568,926 |
#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;
cin >> n;
deque<int> q;
rep(i,n) {
int a;
cin >> a;
if(i%2==0) q.push_back(a);
else q.... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 2000000010;
constexpr ll INF= 2000000000000000000;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
typedef pair<int,P> PP;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
... | 0 | 93,077,561 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pii pair<int,int>
#define fi first
#define se second
#define int long long
#define pb push_back
#define mod 1000000007
#define pll pair<long long,long long>
using namespace std;
templa... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0... | 0 | 68,427,996 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
signed main() {
int n;
while ( cin >> n, n ) {
vector<int> a(n);
for ( int i = 0; i < n; i++ ) cin >> a[i];
int ans = INF;
sort(a.begin(), a.end());
for ( int i = 1; i < n; i++ ) {
ans = min(ans, a[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>;
ll x[100010];
int main(){
int n; ll k;
cin>>n>>k;
rep(i,n){
int a,b;
cin>>a>>b;
x[a]+=b;
}
ll cnt=0;
rep(i,100010){
cnt+=x[i];
... | 0 | 38,813,245 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(false);}} fast;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 0 | 88,134,176 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define int long long
using namespace std;
const int N = 1e3 + 5;
int read() {
int x = 0, f = 1; char ch;
while(! isdigit(ch = getchar())) (ch == '-') && (f = -f);
for(x = ch ^ 48; isdigit(ch = getchar()); x = (x << 3) + (x << 1) + (ch ^ 4... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typ... | 0 | 54,311,994 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << max({1ll*a*c, 1ll*a*d, 1ll*b*c, 1ll*b*d});
return 0;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 14,468,295 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << #x << ": " << x << endl;
#define line() cerr << "---------------" << endl;
char board[30][30];
bool visited[30][30];
int H, W;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
void dfs(int x, int y) {
for (int i = 0; i < ... | 0 | 45,300,753 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--... | 0 | 61,640,502 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typede... | #include<iostream>
#include<vector>
int main(){
int h,w,m;
std::cin>>h>>w>>m;
std::vector<int> yList(m);
std::vector<int> xList(m);
for(int i=0; i< m; i++)
std::cin>>yList[i]>>xList[i];
std::vector<long long> yCount(h, 0);
std::vector<long long> xCount(w, 0);
for(int i=0; i<m; i++){
yCount[yList[i]-1]++;
... | 0 | 66,236,644 |
#include <bits/stdc++.h>
#define sc(x) scanf("%d", &x)
#define pr(x) printf("%d\n", x)
#define lowbit(x) (x & -x)
#define ll long long
#define N 100010
#define memset(x) memset(x, 0, sizeof(x))
using namespace std;
int n, a[N], f[N][35], l, q;
int main()
{
sc(n);
for (int i = 1; i <= n; i++)
sc(a[i]);
sc(l);
for (... | #include <iostream>
void show_ret(int home[][10], bool use_partition) {
for(int i= 0; i < 3; i++) {
for(int j = 0; j < 10; j++) {
std::cout << " " << home[i][j];
}
std::cout << std::endl;
}
if(use_partition) std::cout << "####################" << std::endl;
}
int main(int... | 0 | 79,901,819 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
vector<pair<ll, ll> > prime_factorize(ll N) {
vector<pair<... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#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 a, b;
string s;
cin >> a >> b >> s;
if(s.size()!=a+b+1) {cout << "No" << endl; return 0;}
if(s... | 0 | 43,871,500 |
#include <iostream>
using namespace std;
int main()
{
int W,H,x,y,r;
cin >> W >> H >> x >> y >> r;
int maxX,minX,maxY,minY;
maxX = x + r;
minX = x - r;
maxY = y + r;
minY = y - r;
if(maxX > W || minX < 0 || maxY > H || minY < 0)
{
cout << "No" << endl;
}
else
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 100 * 1000 + 100;
vector <int> adj[MAXN];
bool p = true;
int good[MAXN], mark[MAXN], cnt[3];
void dfs(int v, bool b) {
mark[v] = true;
good[v] = b;
for(int i : adj[v]) {
if(!mark[i])
dfs(i, !b);
else if(good[i] == good[v])
... | 0 | 56,719,080 |
#include <iostream>
unsigned int elevations[100002];
bool reached[100002] = {false};
int main() {
int n, m, a, b;
std::cin >> n >> m;
for (int i = 0; i < n; ++i) {
std::cin >> elevations[i + 1];
}
int good = n;
for (int i = 0; i < m; ++i) {
std::cin >> a >> b;
if (elevati... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | 0 | 85,214,978 |
#include <iostream>
using namespace std;
int main(void){
int a;
int b;
std::cin >> a >> b;
if(a < b) {
std::cout << "a < b" << std::endl;
} else if(a > b) {
std::cout << "a > b" << std::endl;
} else if(a == b) {
std::cout << "a == b" << std::endl;
}
} | #include <iostream>
using namespace std;
void RotateDice(int* a,int n)
{
int c = a[0];
a[0] = a[n];
a[n] = a[5];
a[5] = a[5 - n];
a[5 - n] = c;
}
int main()
{
int a[6], q, top, front;
for (int i = 0; i < 6; i++)
{
cin >> a[i];
}
cin >> q;
for (int i = 0; i < q; i++)
... | 0 | 73,102,049 |
#include<cstdio>
int main(){
int A, B;
scanf("%d %d", &A, &B);
if (A < 14 && B < 14 && A > 0 && B > 0){
if(A == 1 && B!= 1){
printf("Alice");
} else if (A != 1 && B == 1){
printf("Bob");
} else if (A != 1 && B != 1 && A > B){
printf("Alice");
} else if (A != 1 && ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include<ext/pb_ds/detail/standard_policies.hpp>
#define pi acos(-1)
#define pb push_back
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define MAX 300005
#define INF 0x3f3f3f3f
tem... | 0 | 77,383,599 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int ans = 1;
while(ans <= n)
{
ans *= 2;
}
cout << ans / 2 << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
const long long INFTY = 1e20;
int main(){
int N; cin >> N;
vector<long long> A(N);
long long sum = 0ll;
for(int i=0;i<N;i++){
cin >> A[i];
sum += A[i];
}
long long x, y, ans;
x = A[0];
y = sum - x;
ans = abs(x... | 0 | 34,948,554 |
#include <iostream>
int main() {
int x, y;
for (std::cin >> x >> y; x != 0 || y != 0; std::cin >> x >> y) {
if (x < y) {
std::cout << x << ' ' << y << std::endl;
} else {
std::cout << y << ' ' << x << std::endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define mem(a,n) memset(a,n,sizeof(a))
#define memc(a,b) memcpy(a,b,sizeof(b))
#define rep(i,a,n) for(int i=a;i<n;i++)
#define pb push_back
#define IO ios::sync_with_stdio(false)
#define fre freopen("in.txt","r",stdin)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
type... | 0 | 84,746,322 |
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main()
{
int num = 0, i = 0;
string operation, word;
map<string, int> word_map;
cin >> num;
while ( i < num )
{
cin >> operation;
cin >> word;
if ( operation == "insert" )
{
word_map[word] = 1;
}
else if ( operation == "f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr long double EPS = 1e-15;
const long double PI = acos(-1);
constexpr int inf = 1e9;
constexpr ll INF = 2e18;
constexpr ll MOD = 1e9+7;
constexpr ll MOD1 = 998244353;
typedef pair<ll,ll> P;
#define rep(i,a,b) for... | 0 | 74,962,734 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> drink(n);
rep(i,n) {
ll a, b;
cin >> a >> b;
drink[i] = make_pair(a, b);
}
sort(drink.begin(), drink.e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[500][500];
const ll LINF = 1e18+5;
int main() {
int n,k;
cin >> n >> k;
int h[500] = {};
for (int i=1;i<=n;i++) cin >> h[i];
for (int i=0;i<=n;i++)
for (int j=0;j<=i;j++)
dp[i][j] = LINF;
dp[0][0] = 0;... | 0 | 53,223,065 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=200010;
const ll mod... | #include <bits/stdc++.h>
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < n; i++)
#define ford(i, n) for (int i = n - 1; i > -1; i--)
#define forl(i, l, r) for (int i = l; i <= r; i++)
#define vc vector
#define f first
#define s second
#define pb(i) push_back(i)
#define mx(ar, n) (*max_element(ar, ar + n... | 0 | 37,491,479 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n + 2);
a.at(0) = 0;
a.at(n + 1) = 0;
rep(i, n) cin >> a.at(i + 1);
rep(i, n + 1) sum += abs(a.at(i + 1) - a.at(i));
rep(i, n) cout << sum - abs... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main()
{
int h, w, a, b;
cin >> h >> w >> a >> b;
rep(i, b)
{
rep(j, a) cout << 0;
for (int j = a; j < w; j++)
cout << 1;
... | 0 | 20,041,953 |
#define rep(i, n) for(int i = 0; i < n; i++)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i,n) cin >> s[i];
int ans = 0;
int end_A, start_B, haji_AB;
end_A = 0, start_B = 0, haji_AB = 0;
rep(i,n) {
int len ... | #include <iostream>
using namespace std;
const int MAX_NUM = 2000000;
const int MAX_VALUE = 10000;
void counting_sort(int* array1, int* array2, int n)
{
int k = -1, count[MAX_VALUE] = {};
for(int i=0;i<n;++i)
{
++count[array1[i]];
k = max(k, array1[i]);
}
for(int i=0;i<k;++i)
{
... | 0 | 37,154,328 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 51;
i... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("Ofast")
#define sint( a ) int a; qread(a);
#define sint2( a, b ) int a,b; qread(a),qread(b);
#define sint3( a, b, c ) int a,b,c; qread(a),qread(b),qread(c);
#define int1( a ) qread(a);
#define int2( a, b ) qread(a),qread(b);
#define int3( a, b, c ) qre... | 0 | 73,573,036 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=100005,maxm=400005;
int last[maxn],pre[maxm],other[maxm],t,cal[maxn],vis[maxn],q[maxn],head,tail;
void add(int x,int y){++t;pre[t]=last[x];last[x]=t;other[t]=y;}
int main()... | 0 | 50,019,555 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
string s;
int a, b;
cin >> a >> b;
if (a > b) swap(a, b);
for (int i = 0; i < b; i++)
{
s += a + '0';
}
cout << s << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
int n, q;
int rank[10000], par[10000];
void init(){
rep(i,n) par[i] = i;
rep(i,n) rank[i] = 0;
}
int find(int x){
if(x == par[x]) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y){
x = find(par[x]);
y = find... | 0 | 23,257,864 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e16+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int gcd(int X,int Y) {
if(X%Y == 0) {
return Y;
}
else {
return gcd(Y,X%Y);
}
}
signed main() {
int N,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int before = 0;
int ans = 0;... | 0 | 61,940,166 |
#include<bits/stdc++.h>
#define INF 1000000000
using namespace std;
int main(){
vector<int> a(5);
for(int i=0;i<5;i++)cin >> a[i];
vector<int> P = {0,1,2,3,4};
int ans=INF;
do{
int sum=0;
for(int i=0;i<5;i++){
while(sum%10!=0)sum++;
sum+=a[P[i]];
}
ans=min(ans,sum);
}while(next_... | #include <iostream>
#include <vector>
#include <math.h>
#include <list>
using namespace std;
typedef long long int ll;
ll MOD = pow(10,9) + 7;
void print(vector<ll>& v)
{
for (auto i:v)
{
cout<<i<<" ";
}
cout<<endl;
}
void helper(vector<list<ll>>& adj,vector<bool>& vis,vector<ll>& W,vector<ll>& ... | 0 | 368,708 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") { cout << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 0 | 28,593,520 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long h, w;
cin >> h >> w;
long long a, b, c, ans = 1e15;
for(int i = 1; i < h; i++){
a = i * w;
b = (w / 2) * (h - i);
c = h * w - a - b;
ans = min(ans, max({a, b, c}) - min({a, b, c}));
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<ll> par;
Union(ll a){
par=vector<ll>(a,-1);
}
ll find(ll a){
if(par[a]<0){
return a;
}
... | 0 | 79,174,955 |
#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)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pint;
#define MAX_N 10000
struct UnionFind{
int par[MAX_N];
void init(int n){
for (int i=0;i<n;i+... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x)... | 0 | 41,372,338 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
long long ans = 0;
int MaxNum = 0;
for (int i = 0; i < N; i++)
{
MaxNum = max(MaxNum, A[i]);... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 97,276,571 |
#include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
const ll MAX = 1e2;
void solve(){
string a, b, c; cin>>a>>b>>c;
int size_a = a.size(), size_b = b.size();
cout<<(a[size_a-1] == b[0] && b[size_b-1] == c[0] ? "YES" : "NO")<<endl;
}
int main(){
solve();
Bye;
} | #include <bits/stdc++.h>
using namespace std;
struct Node{
int parent,left,right;
Node(){
parent=-1;left=-1;right=-1;
}
};
int node_depth(Node T[],int D[],int node){
if(D[node]!=-1)return D[node];
if(T[node].parent==-1)D[node]=0;
else D[node]=1+node_depth(T,D,T[node].parent);
return ... | 0 | 53,441,486 |
#include<iostream>
#include<math.h>
#define pi 2*acos(0)
int main()
{
int a,b,c;
int x=0;
std::cin>>a>>b>>c;
x = c/a;
if(a*x>= b){
std::cout<<"OK"<<std::endl;
}
else{
std::cout<<"NG"<<std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int ans = 0;
int l = 0, r = s.length() - 1;
while (l < r) {
if (s[l] == s[r]) {
l++;
r--;
} else if (s[l] == 'x') {
ans++;
l++;
} else if (s[r] == 'x') {
ans++;
r--;
} else {
... | 0 | 58,826,502 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
templ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,p,x;
int a[100];
int sum;
while(1){
cin>>n>>m>>p;
if(n==0 && m==0 && p==0) break;
sum=0;
for(int i=0;i<100;i++){
a[i]=0;
}
for(int i=0;i<n;i++){
cin>>x;
a[i]=x;
sum+=x;
}
if(a[m-1]!=0){
... | 0 | 17,809,487 |
#include <iostream>
using namespace std;
int main (){
int r;
cin >> r;
printf("%d", r*r);
} | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int ... | 0 | 40,636,436 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
string S;
cin >> N >> S >> K;
char c=S[K-1];
for(int i=0; i<N; i++){
if(S[i]!=c) S[i]='*';
}
cout << S << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int count[5][4][11], n;
for ( int s = 1; s <= 4; s++){
for ( int t = 1; t <= 3; t++)
for ( int u = 1; u <= 10; u++)
count[s][t][u] = 0;
}
cin >> n;
for ( int i = 0 ; i < n; i++){
int b, f, r, v;
cin >> b >> f... | 0 | 17,837,065 |
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#include <utility>
using namespace std;
int main() {
int N;
cin >> N;
vector<map<int, int>> cnt_map(2);
for (int n = 0; n < N; ++n) {
int v;
cin >> v;
++cnt_map[n % 2][v];
}
vector<vector<pair<int, int>>> cnts(2, vector<pa... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9+7;
int main(){
ll n,k;
cin >> n >> k;
ll sum = min(n,k);
ll v[n+10];
ll kotae;
ll ans = -1;
for(int i = 0; i < n; i++){
ll temp;
cin >> temp;
v[i] = temp;
}
for(int i = 0; ... | 0 | 74,700,205 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b, c, d;
vector<ll> ans;
int main() {
cin >> a >> b >> c >> d;
ans.emplace_back(a * c);
ans.emplace_back(a * d);
ans.emplace_back(b * c);
ans.emplace_back(b * d);
if (a * b <= 0 || c * d <= 0)
ans.emplace_back(0);
sort(ans.rbegin(), ans.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 0 | 90,272,464 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
int ans=0;
for(int i=0;i<3001;i++){
for(int j=0;j<3001;j++){
if((d-a*i-b*j)%c==0 && (d-a*i-b*j)>=0){
ans++;
}
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b;... | 0 | 905,495 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
vector<int> v;
while(cin.peek() != '\n')v.push_back(getchar()-'0');
int n = (int)v.size();
int k; cin >> k;
ll dp1[101][5] = {};
ll dp2[101][5] = {};
dp1[0][1] = v[0]-1;
dp1[0][0] = 1;
dp2[0][1] = 1;
for(int i = 0; i < n-... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | 0 | 2,855,811 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const int N = 100005;
vector<pair<int, ll> > g[N];
ll dist[N];
void dfs(int v, int p){
for(auto x : g[v]){
if(x.first == p)continue;
dist[x.first] = dist[v] + x.seco... | #include <iostream>
#include <stdlib.h>
using namespace std;
int main(){
string s, p;
getline(cin, s);
getline(cin, p);
bool judge;
for(int j=0; j<s.size(); j++){
if(p[0] == s[j]){
judge = true;
int s_index;
for(int k=1; k<p.size(); k++){
s_index = j+k;
if(s_index >= s.si... | 0 | 40,854,793 |
#include<stdio.h>
int main(){
int N,R,hasil;
scanf ("%d %d",&N,&R);
if (N<10){
hasil = 100*(10-N);
hasil = R + hasil;
}
else {
hasil= R;
}
printf ("%d", hasil);
} | #include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<deque>
#include<map>
#include<queue>
using namespace std;
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define pb push_back
#define fi first
#define se second
type... | 0 | 62,027,933 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
int answer = 0;
string op;
cin >> A >> op >> B;
if (op == "+") {
answer = A + B;
}
if (op == "-") {
answer = A - B;
}
cout << answer << endl;
} | #include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define e_b emplace_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ipair;
typedef pair<ll,ll> lpair;
template <class T... | 0 | 51,272,542 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define MOD (ll)1000000007
ll arr[1000000];
int main(){
ll n;
cin >> n;
for(ll i = 0; i < n; i++){
cin >> arr[i];
}
ll sum = 0;
for(ll i = 0; i < 60; i++){
ll oc = 0, zc = 0;
for(ll j = 0; j < n; j++){... | 0 | 75,648,449 |
#include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#define bit(n) (1LL << (n)... | 0 | 80,336,260 |
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin>>N;
int count=0;
while(N>=3){
count++;
N-=3;
if(N-3>=3)continue;
else{
count++;
break;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define rep(i, a, n) for (int i = a; i < n; ++i)
int main() {
int w, h, n;
cin >> w >> h >> n;
int x1 = 0, y1 = 0;
rep(i, 0, n) {
int x, y, a;
cin >> x >> y >> a;
if (a == 1) {
x1 = ma... | 0 | 27,084,430 |
#include <iostream>
#include <algorithm>
using namespace std;
const int INF = 1000000007;
int main()
{
int n, k, a[5003];
cin >> n >> k;
int least = INF;
for(int i = 0; i < n; i++){
cin >> a[i];
if(a[i] >= k) least = min(least, a[i]);
}
sort(a, a + n, greater<int>());
int dp[... | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uni... | 0 | 92,845,821 |
#include <sys/time.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <utility>
#include <cctype>
using namespace std;
using ll = long long;
using... | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int P[10010];
int Rank[10010];
void init(int N){
for(int i = 0; i < N; ++i){
P[i] = i;
Rank[i] = 0;
}
}
int root(int a){
if(P[a] == a) return a;
return (P[a] = root(P[a]));
}
bool IsSameSet(int a, int b){
return root(a) == root(b);
... | 0 | 50,013,501 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y;
cin >> x >> y;
int ans = abs(abs(x) - abs(y));
if (x > y && y > 0) ans += 2;
else if (x < 0 && 0 < y... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n; cin... | 0 | 7,659,398 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main() {
int n;
cin>>n;
vector<char> s(n);
vector<char> t(n);
rep(i,n){
cin>>s[i];
}
rep(i,n){
cin>>t[i];
}
rep(i,n){
cout<<s[i]<<t[i];
}
cout<<endl;
} | #include<iostream>
using namespace std;
const int maxSize = 21;
int mapData[maxSize][maxSize] = {0};
int W, H, Ans;
void dfs(int hh, int ww) {
if(mapData[hh][ww] == 1) {
mapData[hh][ww] = 0;
Ans++;
if(hh+1<H && mapData[hh+1][ww]==1) {
dfs(hh+1, ww);
}
if(ww+1<W && mapData[hh][ww+1]==1) {
... | 0 | 37,264,476 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main(void) {
string s;
int num, k = 1, i, j, l, r;
ll ans = 1, ansr = 1;
cin >> num >> s;
vector<int> d(s.size() + 1, 0);
l = 0;
r = 0;
for (i = 0; i < num * 2; i++)... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/home/shahraaz/bin/debug.h"
#else
#define db(...)
#endif
using ll = long long;
#define f first
#define s second
#define pb push_back
#define all(v) v.begin(), v.end()
const int NAX = 2e5 + 5, MOD = 1000000007;
class Solution
{
private:
public:
Sol... | 0 | 9,157,963 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int graph[100][100];
for( int i = 0 ; i < 100 ; i++ )
for( int j = 0 ; j < 100 ; j++ )
graph[i][j] = 0;
int n;
cin >> n;
for( int i = 0 ; i < n ; i++ ){
int u, k;
cin >> u >> k;
u--;
while( k-- ){
int... | 0 | 13,875,525 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (long long)(n); ++i)
using namespace std;
using ll = long long;
int main() {
ll n, k, ans = 1;
const ll mod = 7 + 1e9;
cin >> n >> k;
vector<int> s(n + 2);
rep (i, n + 1) s[i + 1] = (s[i] + i + 1) % mod;;
for (int i = k; i <= n; i++) {
ans = (an... | #include <iostream>
using namespace std;
int main() {
int n;
int b, f, r, v;
int room[4][3][10];
for (int j = 0; j < 4; j++){
for (int k = 0; k < 3; k++){
for (int l = 0; l < 10; l++){
room[j][k][l] = 0;
}
}
}
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> b >> f >> r >> v;
room[b-1][f-1][r-1]... | 0 | 52,672,406 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
#include <deque>
#include <string.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pi;
typedef pa... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int mod = 1000000007;
int main(){
int n,k;
cin >> n >> k;
vector<int> v(n);
rep(i,n) cin >> v.at(i);
int ans = 0;
for(int l = 0; l <= k;l++){
... | 0 | 18,851,081 |
#include <iostream>
#include <string>
using namespace std ;
using ll = long long ;
int main(){
string s,t ;
cin >> s >> t ;
ll n = t.size() ;
for(int i=s.size()-n;i>=0;i--){
bool ok = true ;
for(int j=0;j<n;j++){
if(s.at(i+j)!='?'&&s.at(i+j)!=t.at(j)){
ok = false ;
break ;
}
}
if(ok){
for(i... | #include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n";
using namespace std;
using ll=long long;
using ld=long double;
ll mod = ll(1e9)+7;
ll inf = ll(1e18);
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
... | 0 | 76,805,556 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;cin>>S;
int l=S.size();
vector<bool> A(26,false);
for(int i=0;i<l;i++) A.at(S.at(i)-'a')=true;
int m=-1;
for(int j=0;j<26;j++){
if(!A.at(j)){
m=j;
break;
}
}
if(m==-1) cout<<"None"<<endl;
else cout<<(char)('a'+m)<<e... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define ld long double
#define lll __int128
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int> >
#define ... | 0 | 55,601,695 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
u... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | 0 | 37,642 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1ll<<60;
struct UnionFind
{
vector<ll> par;
UnionFind(ll N = 20001) : par(N)
{
for (ll i = 0; i < N; ++i) par[i] = i;
}
ll root(ll x)
{
if (par[x] == x) return x;
else return par[x] = root(p... | #include<cstdio>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<cstdlib>
#include<iomanip>
#include<queue>
#include<set>
#include <valarray>
#include<stack>
#include<sstream>
#include<math.h>
using namespace std;
void Solution()
{
int n, x;
while(... | 0 | 2,254,360 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
int ans;cin>>ans;
for(int i=1;i<n;i++)
{
int a;cin>>a;
ans=gcd... | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using lli = long long int;
using ld = long double;
using pa = pair<int,int>;
using ppa = pair<pa,int>;
#define SORT(v, n) sort(v, v+n);
#define ALL(v) v.begin(),v.end()
#define VSORT(v) sort(ALL(v))
#define GRESORT(v) so... | 0 | 2,098,033 |
#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() {
ll r, g, b, n, cnt = 0;
cin >> r >> g >> b >> n;
rep(i, n / r + 1) rep(j, n / g + 1) {
if ((n - r * i - g * j) % b == 0 && 0 <= (n - r * i - g * j)) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n); i > 0; i--)
#define all(n) n.begin(), n.end()
#define print(n) cout << n << endl
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
ll n,p;
string s... | 0 | 24,827,423 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int x, y;
while(true)
{
cin >> x >> y;
if (x == 0 && y == 0)
{
break;
}
else
{
if (x <= y)
{
printf("%d %d\n", x, y);
}
else
{
printf("%d %d\n", y, x);
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 34,488,945 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
long long int res = 0;
long long int n;
cin >> n;
for(long long int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
long long int a = i - 1;
long long int b = (n/i) - 1;
if(a==b)
{
if(a!=0)
{
i... | #include<bits/stdc++.h>
#include<algorithm>
#include <fstream>
#include <sstream>
#include <string>
using namespace std;
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define is insert
#define rep1(i,a,b) for(long long i=a;i<=b;i++)
#define mp make_pair
#define mh make_heap
#defi... | 0 | 39,219,843 |
#include <bits/stdc++.h>
using namespace std;
template <class T> T input() {T t; cin>>t; return t;}
#define FOR(i,a,b) for (ll i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (ll i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,x) for (ll i = 0; i < x.size(); i++)
#define RREP... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 0 | 44,104,328 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int n,s;
int Sum_of_Integers(int i,int sum,int v);
int main(){
while(1){
cin >> n >> s;
if(!n && !s)break;
cout << Sum_of_Integers( 0 , 0 , -1) << endl;
}
}
int Sum_of_Integers(int i,int sum,int v){
int ret... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1000000007;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = ... | 0 | 19,467,934 |
#include <utility>
#include <iostream>
#include <algorithm>
using namespace std;
int v,A[100][100],u,k,w;
int main(){
cin >> v ;
for (int i=0; i<v; ++i){
cin >> u >> k;
for(int j=0; j<k; ++j){
cin >> w;
A[u-1][w-1] = 1;
}
}
for (int i=0; i<v; ++i){
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int H, W;
cin >> H >> W;
vector<string> a(H);
rep(i, H) cin >> a[i];
vector<bool> row(H, false);
vector<bool> col(W, false);
rep(i, H) {
rep(j, W) {
if (a[i][j] == '#') ... | 0 | 76,225,353 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ... | #include <bits/stdc++.h>
using namespace std;
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 ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 10000... | 0 | 94,053,654 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using P = pair<int,int>;
using vp = vector<P>;
using vvp = vector<vp>;
int main(){
int n;
string s;
cin>>n>>s;
ll r=0,g=0,b=0;
rep(i,n){
if(s[i]=='R')r++... | #include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <queue>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main() {
while(1){
int w,h;
cin>>w>>h;
if(!w)break;
vector<string> t(h);
REP(i,h)cin>>t[i];
int si,sj;
REP(i,h)... | 0 | 70,399,806 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k, s;
cin >> n >> k >> s;
rep(i,n){
if(i < k){
cout << s << (i == n - 1 ? "\n" : " ");
}else {
if(s == 1000000000){
cout << ... | #include <bits/stdc++.h>
using namespace std;
struct edge{int to;int cost;};
vector<edge> tree[100010];
vector< int> d(100010 , -1e9);
bool f;
void bfs(int s){
queue<int> q;
q.push(s);
d[s]=0;
while(!q.empty()){
int p=q.front();
q.pop();
for(auto x:tree[p]){
int u=x.to,v=x.cost;
if(d[u]=... | 0 | 14,858,617 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, x, n) for (ll i = ... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 0 | 48,678,047 |
#include<stdio.h>
int main(){
int n,x;
while(true){
scanf("%d%d",&n,&x);
if (n==0&&x==0)break;
int a=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
for(int k=1;k<=n;k++){
if(i+j+k==x&&i<j&&j<k){
a++;
... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <math.h>
#include <stdlib.h>
using namespace std;
int main(){
int n;
while(cin>>n){
if(n==0) break;
string s[n][2];
for(int i=0;i<n;i++){
cin>>s[i][0]>>s[i][1];
}
int t;
cin>>t;
for(int i=0;i<t;i++){
string a;
... | 0 | 20,391,318 |
#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, m;
cin >> n;
vector<string> blue(n);
for (int i = 0; i < n; i++) {
cin >> blue.at(i);
}
cin >> m;
vector<string> red(m);
for (int i = 0; i < m; i++) {
cin ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int ichi=0;
int ni=0;
int san=0;
int yon=0;
for(int i=0;i<3;i++){
int a,b;
cin>>a>>b;
if(a==1||b==1){
ichi++;
}
if(a==2||b==2){
ni++;
}
if... | 0 | 46,063,533 |
#include <bits/stdc++.h>
using namespace std;
int n, s;
int a[200020];
long long z;
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
for (int i = 0, j = 0; i < n; s ^= a[i++])
{
while (j < n && (s & a[j]) == 0)
{
s ^= a[j++];
}
z += j - i;
}
printf("%lld\n", z);
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
int main(){
string s, t; cin >> s >> t;
int n=s.size();
vector<set<char>> key(26);
for(int i=0; i<n; i++)
key[t[i]-'a']... | 0 | 86,812,525 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
vector<vector<int>> a(3, vector<int>(3));
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
cin >> a[i][j];
}
}
int n;
cin >> n;
vector<int> b(n);
for (int i = 0; i < n; i++)
{
cin >> b[i];... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<cstdio>
using namespace std;
map<char,int>M;
int cnv(string str){
str="."+str;
int res=0;
for(int i=0;i<str.length();i++){
if(M.find(str[i])!=M.end()){
int a;
if(str[i-1]>='0'&&str... | 0 | 79,373,271 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<int>L(N);
for (int n = 0;n<N;++n) {
cin >> L[n];
}
int ans = 1e9;
for (int n = 0;n<(1<<2*N);++n) {
int a = 0;
int b = 0;
int c = 0;
int count = 0;
int anstmp = 0;
for (int m = 0;m<N;++m) {
... | #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define ss ... | 0 | 21,648,085 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,a,b;
cin >> n>>a>>b;
cout << (((b-a) % 2) ? "Borys" : "Alice") << '\n';
return (0);
} | #include <bits/stdc++.h>
using namespace std;
bool desc(int a,int b){
return a>b;
}
int main(){
int n;
cin>>n;
int a[n],b[n],d1=0,d2=0;
string aa,bb,df;
for(int i = 1 ; i <= n ; i++){
df+=i+'0';
}
for(int i = 0 ; i < n ; i++){
cin>>a[i]... | 0 | 68,131,011 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 101234567;
int main() {
ll N;
ll ans = 0;
vector<ll>v;
cin >> N;
for (int k = 1; k < (double)sqrt(N); k++) {
if (N % k == 0) {
ll m = N/k - 1;
if (m > k) {
ans += m;
... | #include<bits/stdc++.h>
#define ll long long
#define P pair<ll ,ll>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int r,s,p;
cin >> r >> s >> p;
string t;
cin >> t;
ll ans = 0;
vector<char>was(n ,'x');
for(int i=0;i<n;i++){
if(i-k >=0){
if(was[i-k]!='r... | 0 | 17,000,982 |
#include <iostream>
int main() {
int n, r;
std::cin >> n >> r;
int ans = r;
if (n < 10) ans = r + 100 * (10 - n);
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#de... | 0 | 52,773,037 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
... | 0 | 49,155,236 |
#include <iostream>
#include <string.h>
using namespace std;
int main()
{
string alphabet;
cin >> alphabet;
if(alphabet[0] >= 'A' && alphabet[0] <= 'Z')
{
cout << "A" << endl;
}
if(alphabet[0] >= 'a' && alphabet[0] <= 'z')
{
cout << "a" << endl;
}
} | # include <iostream>
# include <map>
using namespace std;
int main() {
int n; cin >> n;
map<string, int> cnt_map;
string ans = "Yes";
char last_char = '\0';
for (int i = 0; i < n; i++) {
string s; cin >> s;
if (last_char != '\0' && last_char != s[0]) {
ans = "No";
break;
}
last_cha... | 0 | 82,987,523 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> w(n);
for(int i = 0; i < n; i++) cin >> w[i];
int ans = 1e9;
for(int i = 1; i < n; i++){
int l = 0, r = 0;
for(int j = 0; j < i; j++){
l += w[j];
}
for(int j = i; j < n; j++){
r += w[j];
}
... | #include <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#includ... | 0 | 99,444,605 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | #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)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define PRINT(a) cout << (a) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi... | 0 | 50,563,393 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++ )
#define repf(i,m,n) for(int (i)=m;(i)<n;(i)++)
#define all(v) (v).begin(), (v).end()
#de... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all... | 0 | 17,201,459 |
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
char Str[21];
int StrLen;
cin >> Str;
StrLen = strlen( Str );
while( 1 ){
cout << Str[StrLen-1];
StrLen--;
if( StrLen == 0 ) break;
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 54,388,025 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
int main(){
string s;
cin >> s;
if(s.size() < 4){
cout << "No" << endl;
return 0;
}
if(s.substr(0,4) == "YAKI"){
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main()
{
ll n{},k{};
cin>>n>>k;
ll x = (ll)pow((k-1),(n-1));
cout<<x*k<<endl;
return 0;
} | 0 | 41,955,031 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end... | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include <math.h>
#define M 1046527
#define L 15
char H[M][L];
long long convertToNum(char* str) {
long long result = 0;
int i = 0;
int len = strlen(str);
for (int i = 0; i < len; ++i) {
int j = 0;
switch (str[i]) {
case... | 0 | 79,555,586 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
int N,a,b;
cin >> N >> a >> b;
vector<int> nums;
for(int i=1; i<=N; i++){
int temp = i;
deque<int> digit;
while(temp>0){
digit.push_front(t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 89,608,997 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n,m; cin>>n>>m;
vector<ll> a(n);
for(auto &i:a) {
cin>>i;
i/=2;
}
ll l = a.at(0);
for(int i=1; i<n; i++){
if(l%a.at(i)==0&&(l/a.at(i))%2==0){
cout << 0 << endl;
return 0;
}
if(a.at(i)%l==0&&(a.at(i)/l)%2==0){
cou... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> V... | 0 | 96,564,421 |
End of preview. Expand in Data Studio
- Downloads last month
- 28