code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int nums[n];
for(auto i = 0; i < n; ++i){
cin >> nums[i];
}
int safe = 0;
int find = 1;
for(auto &x: nums) {
if(x == find){
safe++;
find++;
}
}
if(safe){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | 0 | 99,022,127 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=1e9+7;
int main(){
int N, K; cin >> N >> K;
vi H(N);
for(auto &x : H) cin >> ... | #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--)
typedef long long ll;
static const ll MX = 100005;
static const ll MX_ll = 1e18;
const double PI = acos(-1);
using namespace std;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
int c... | 0 | 28,150,270 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string S;
cin>>S;
int check=0;
for(int i=0;i<(S.size()-1)/2+1;i++){
if(S[i]==S[(S.size()-1)/2+1+i]){
check++;
}
}
if(check==(S.size()-1)/2){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<en... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int n, l, t, a[100001], cnt;
int main(int argc, char const *argv[])
{
scanf("%d%d%d", &n, &l, &t);
for (int i = 1; i <= n; i++)
{
int op;
scanf("%d%d", &a[i], &op);
a[i] += op == 1 ? t ... | 0 | 77,541,967 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
int main() {
int a, b;
cin >> a >> b;
char ans = 'x';
... | #include<iostream>
#include<iomanip>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<vector>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=4e18;
c... | 0 | 98,477,023 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main()
{
string s,t;
cin>>s>>t;
map<char,char> mp,gorl;
for(unsigned int i=0;i<s.size();i++)
{
if(mp[s[i]]>='a'&&mp[s[i]]<='z')
{
if(mp[s[i]]!=t[i])
{
cout... | 0 | 37,442,906 |
#include <iostream>
using std::cout;
using std::cin;
using std::endl;
int main(void) {
int a;
int b;
cin >> a >> b;
if (a < b) {
cout << "a < b" << endl;
} else if (a > b) {
cout << "a > b" << endl;
} else if (a == b) {
cout << "a == b" << endl;
}
return 0;
} | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 0 | 46,568,741 |
#include <iostream>
#include <cstdlib>
using namespace std;
const int MAX = 1010;
const long long INF = 1LL << 60;
long long dp[MAX][MAX] = {INF};
string s1, s2;
int main() {
cin >> s1 >> s2;
int s1_len = (int)s1.length();
int s2_len = (int)s2.length();
for (int i = 0; i <= s1_len; ++i) dp[i][0] = i;
for (int... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
ll df(ll a, ll b)
{
if (b < 0) a = -a, b = -b;
return a / b - (a % b < 0);
}
ll dc(ll a, ll b)
{
if (b < 0) a = -a, ... | 0 | 64,099,216 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main() {
int n;
cin >> n;
vector<int> dp(n + 1, 100010);
dp.at(0) = 0;
for (int i = 1; i <= n; i++) {
d... | #include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
using namespace std;
int a[30][30];
int w, h, cnt;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
void search(int x, int y);
bool issearched[30][30];
int main(... | 0 | 65,909,129 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int N , M ; cin >> N >> M ;
vector<int> A(N) , B(N) ;
for(int i = 0 ; i< N ; i++){
cin >> A.at(i) >> B.at(i) ;
}
vector<pair<int , int >> AB(N) ;
for(int i = 0 ; i < N ; i++){
AB.at(i) = make_pair(A.at(i) , B.at(i)) ;
}
sort(AB.begin... | #include<iostream>
#include<stdio.h>
using namespace std;
int main(){
char num[1000] = "1";
while(1){
int S = 0;
scanf("%s", num);
if(num[0] == '0')break;
for(int i = 0; i < 1001; i++){
if(num[i] == '\0')break;
S += (num[i] - '0');
}
cout <... | 0 | 76,037,490 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s, t, u;
int a, b;
cin >> s >> t >> a >> b >> u;
if (u == s) cout << a-1 << " " << b << '\n';
else cout << a << " " << b-1 << '\n';
return (0);
} | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
signed main()
{
ios::sync_with... | 0 | 6,208,472 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | 0 | 63,400,628 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{
int n, m, d;
cin >> n >> m >> d;
if (d =... | #include <iostream>
#include <complex>
using namespace std;
double area(complex<double> a, complex<double> b, complex<double> c){
return (conj(b-a)*(c-a)).imag()/2.0;
}
int main(){
double x1,y1,x2,y2,x3,y3,xp,yp;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp){
complex<double> v[3];
complex<dou... | 0 | 32,942,831 |
#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++)
#define VL vector<ll>
int main(){
ll N,A,B;
cin>>N>>A>>B;
ll ans=0;
rep(i,1,N+1){
ll sum=0;
string s=to_string(i);
rep(j,0,s.size()){
... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
long long int dp[2][100001];
long long int mod=1e9+7;
long long int dfs(int node,int parent,int color,vector<int > Tree[])
{
if(Tree[node].size()==1&&node!=1)
{
return 1;
}
if(dp[color-1][node]!=-1)
return dp[color-1][node];
... | 0 | 12,140,685 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n, taro, hanako;
string a, b;
cin >> n;
taro = 0;
hanako = 0;
for(int i = 0; i < n; i++) {
cin >> a >> b;
if (a > b) {
taro += 3;
}
else if (a < b) {
hanako += 3;
}
else {
taro += 1;
ha... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n];
rep(i,n) cin >> a[i];
sort(a,a+... | 0 | 78,878,745 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main() {
string s;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n, k;
cin >> n >> k;
if(k > (n - 1) * (n - 2) / 2){
cout << -1 << endl;
}
else{
int m = (n * (n - 1) / 2) - k;
cout << m << endl;
for(int i = 1; i <= n-1; i... | 0 | 28,588,679 |
#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();
}
template <class T>
inline T sqr(T x) {
return x * x;
}
typede... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | 0 | 22,300,904 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
#define dame { puts("-1"); return 0;}
#define yn {puts("... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
vector<int>a(n);
ll allsum=0;
int tmp=0;
for(int i=0;i<n;i++){
cin>>a[i];
allsum+=abs(a[i]-tmp);
tmp=a[i];
}
allsum+=abs... | 0 | 4,020,467 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define pb emplace_back
#define ll long long
const int INF = 2e9 + 1;
const ll INFLL = 1e18 + 1;
const ll mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
... | #include <bits/stdc++.h>
using namespace std;
const int N = 50000;
const int INF = 1e8;
const int M = 20;
int main(){
int n,m;
cin >> n >> m;
vector<int> v(m);
int dp[M+1][N+1];
for(auto &t: v){
cin >> t;
}
for(int i=0;i<=M;i++){
for(int j=0;j<=N;j++){
dp[i][j]=(j... | 0 | 5,064,247 |
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <climits>
#include <tuple>
#include <queue>
#include <cassert>
#include <set>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define PB pus... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b){return b == 0 ? a : GCD(b, a % b);}
long long fast_exp(long long base, long long exp, long long mod = MOD) {
long long tot = 1;
for(;exp > 0;exp >>= 1) {
if((exp & 1) == 1) tot = tot ... | 0 | 49,377,947 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i >= 0; i--)
#define be(v) (v).begin(), (v).end()
#define d... | #include <bits/stdc++.h>
#define int long long int
#define ll long long
#define quickie ios_base::sync_with_stdio(false); cin.tie(NULL);
#define rep(i, a, b) for(int i=a; i<b; i++)
#define rep1(i, a, b) for(int i=a; i<=b; i++)
#define repp(i, a, b) for(int i=b-1; i>=a; i--)
#define pb push_back
#define mp make_pair
#de... | 0 | 5,458,124 |
#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 a,b;
cin >> a >> b;
if(a==1) a+=13;
if(b==1) b+=13;
if(a>b) cout << "Alice";
else if(a<b) cout << "Bob";
else cout << "Draw";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, n;
cin >> w >> h >> n;
int r=w, l=0, u=h, d=0;
int x[n], y[n], a[n];
for(int i=0; i<n; i++){
cin >> x[i] >> y[i] >> a[i];
if(a[i]==1 && x[i]>l)
l=x[i];
else if(a[i]==2 && x[i]<r)
r=x[i];
else if(a[i]==3 && y[i]>d)... | 0 | 76,625,812 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
int n;
str... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace ... | 0 | 45,669,545 |
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
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)... | 0 | 54,313,171 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main(void){
ll n, ans = 0;
scanf("%lld", &n);
map<ll, vector<int>> vs;
vector<ll> ns;
rep(i, n){
int a, b;
scanf("%d %d", &a, &b);
if (!vs.count(a + b)) ns.push_back(a + b);
v... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
ll a[N];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll n, x;
cin >> n >> x;
for(int i = 0; i < n; i++) cin >> a[i];
x *= 2;
ll lcm = a[0];
for(int i = 1; i < n; i++)... | 0 | 9,842,667 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define f first
#define s second
#define go ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int main()
{
ll n,d,arr[20][20];
cin>>n>>d;
for(int i=0;i<n;i++)
{
for(int j=0;j<d;j++)
{
... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> parent;
vector<int> size;
UnionFind(int n) : parent(n, -1), size(n, 1) {}
int find(int i) {
if (parent[i] == -1) {
return i;
}
return parent[i] = find(parent[i]);
}
void unite(int i, int j) {
i = find(i);
... | 0 | 74,669,865 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int data,m[10];
for (int j=0;j<=9;j++){
while(cin >> data){
if (data<=10000 && data >= 0 ) {
m[j]=data;
break;
}
}
}
for (int i=0;i<=8;i++){
if (m[i] < m[i+1]){
swap(m[i],m[i+1]);
for (int j=i;j>0;j--){
if (m[j] > m[j-1])... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
ll n, m;
ll ans = 0;
cin >> n >> m;
ll minR, maxL;
minR = 1e7;
maxL = -1;
ll r, l;
rep(i, m){
cin >> l >> r;
minR = min(minR, r);
maxL = max(m... | 0 | 88,819,362 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<vector<int>> Graph;
int main() {
int n,k,h,ans=0;
cin >> n >> k;
rep(i,n){
cin >> h;
if (h>=k) ans++;
... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
int a[500010];
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
str s;
cin>>s;
int n=s.size()+1;
int nn=0;
int sn=0;
int mn=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='<')nn++;
... | 0 | 100,387,955 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
int N; cin >> N;
ll A[N];
rep(i, N){
ll Ai; cin >> Ai;
A[i] = Ai;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
#define PRYES(x) PR((x) ? "Yes" : "No")
const lo... | 0 | 49,026,636 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
struct edge { ll s, t, x; };
typedef pair<ll, ll> P;
typedef pair<ll,P> event;
const ll MAX = 510000;
const ll MOD = 1000000007;
#define INF (ll)1000000000000
long long fac[MAX], finv[MAX], inv[MAX];
v... | 0 | 16,369,091 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int now = 0;
ll ans = 0;
rep(i, s.size()) {
if (s[i] == 'W') {
if (now != i) ans += i - now;
now++;
}
}
cout << ans << endl;
return 0;
} | #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 h,w;
cin >> h >> w;
vector <vector <int>> tate(h,vector <int> (w));
vector <vector <int>> yoko(h,vector <int> (w));
vector <string> s(h);
rep(i,h)... | 0 | 47,283,591 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
vector<string>s(n);
vector<ll>t(n);
for(ll i=0;i<n;i++){
cin >> s[i] >> t[i];
}
ll ans=0;
string x;
cin >> x;
ll ti;
for(ll i=0;i<n;i++){
if(s[i]==x){
ti=i;
br... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <string>
using namespace std;
int hiniti(int y,int m,int d){
int result=0;
for(int s=1;s<=y;s++){
for(int j=1;j<=10;j++){
if(y==s&&m==j){
return result+=d;
... | 0 | 84,434,357 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <limits>
#include <sstream>
#include <fstream>
#include <climits>
#include <map>
#include <numeric>
#include <functional>
#include <utility>
using namespace std;
#define rep(i, n) for (int i = 0; i ... | #include <iostream>
#include <vector>
using namespace std;
enum FACE { TOP, BOTTOM, FRONT, BACK, LEFT, RIGHT };
class dice {
public:
dice() {
id[TOP] = 1; id[FRONT] = 2; id[LEFT] = 3;
id[RIGHT] = 4; id[BACK] = 5; id[BOTTOM] = 6;
}
dice(int top,int front,int right,int left,int back,int bottom) {
id[TOP... | 0 | 91,713,511 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
... | #include<bits/stdc++.h>
using namespace std;
int main(void) {
long n;
cin >> n;
vector<long> a(n);
for(auto &e: a) cin >> e;
sort(a.begin(), a.end());
long m = a[n-1];
if(m == 1) {
cout << (n==2 ? "Possible" : "Impossible") << endl;
return 0;
}
if(m%2 == 0) {
... | 0 | 12,904,386 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int c1, c2, c3, c4;
cin >> N;
c1 = N / 1000;
c2 = N / 100 % 10;
c3 = N / 10 % 10;
c4 = N % 10;
if (c1 == c2 && c1 == c3)
{
cout << "Yes" << endl;
}
else if (c2 == c3 && c2 ... | 0 | 47,022,895 |
#include<stdio.h>
int selectionSort(int A[], int N) {
int sw = 0;
for(int i = 0; i < N; i++) {
int minj = i;
for(int j = i; j < N; j++) {
if(A[minj] > A[j]) minj = j;
}
int tmp;
if(minj != i) {
tmp = A[minj]; A[minj] = A[i]; A[i] = tmp;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<int> h(n);
rep(i, n) scanf("%d", &h[i]);
vector<vector<int>> g(n);
rep(i, m) {
int a, b;
scanf("%d%d", &a, &b);
a--;
... | 0 | 66,268,569 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s; cin>>s;
int l = s.length(); set<char> st;
for(auto ch:s)st.insert(ch);
if(st.size()==l)cout<<"yes";
else cout<<"no";
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin>>s;
reverse(s.begin(),s.end());
string t="";
std::deque<string> words{"maerd","remaerd","esare","resare"};
std::deque<string> deq{t};
while (deq.size()!=0) {
string tmp=deq.front();
deq.pop_front();
... | 0 | 10,777,430 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
unsigned long long n,m;
cin >> n >> m;
if(m <= n*2){
cout << m/2 << endl;
}else{
cout << n + (m-n*2)/4 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> snuke(n, 0);
for (int i = 0; i < k; i++) {
int d;
cin >> d;
for (int j = 0; j < d... | 0 | 60,180,365 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>h(n);
int ans=0,active=0;
for(int i=0;i<n;i++){
cin>>h[i];
}
for(int i=0;i<n;i++){
if(active>=h[i]){
active=h[i];
}
else{
ans+=h[i]-active;
active=h[i];
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define int long long
#define double long double
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("avx,avx2,sse")
using namespace std;
int n, ans = 0;
int get(int x) {
return (x * (x + 1)) / 2;
}
void analyze(int a, int b) {
if (b > a) {
... | 0 | 59,278,535 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
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;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <class T> bool chmin(T& x, T y) {
return x > y ? (x = y, true) : false;
}
int main() {
string S; cin >> S;
const int INF = 1e9;
vector<int> A(1 << 26, INF);
A[0] = 0;
int hash = 0;
for (int i = 0; i < S.size(); i++... | 0 | 16,666,742 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define pii pair <int, int>
#define all(vv) (vv).begin(), (vv).end()
#define rep(ii, jj, ll, ss) for(int ii = jj; ii < ll; ii += ss)
#define time cerr << '\n' << (double)clock()/CLOCKS_PER_SEC << '\n'; return ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define input freopen("input.txt","r",stdin)
#define output freopen("output.txt","w",stdout)
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d%d",&a,&b)
#define ... | 0 | 54,896,157 |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<ll,ll>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
... | 0 | 100,102,692 |
#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
int main(){
string s;ll k,i,ans = 0;cin >> s >> k;
ll n = s.size();bool streak = false;
if(count(s.begin(),s.end(),s[0]) == n){
cout << n*k/2 << "\n";
... | #include<bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = n - 1; i >= (ll)(m); i--... | 0 | 15,476,659 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int i;
string S, T;
cin >> S >> T;
int x = S.length();
int y = T.length();
int a = 0;
if (y == x + 1) {
for (i = 0; i < x; i++) {
if (S[i] != T[i]) {
a += 1;
}
}
if (a == 0) {
cout << "Yes" << "\n";
}
else {
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N,P;
cin >> N >> P;
vector<int>A(N);
int count = 0;
long long sum = 1;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum *= 2;
if (A.at(i) % 2 == 1){
count = 1;
}
}
if (count == 1){
cout << sum/2 << endl;
}
els... | 0 | 56,612,556 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
using namespace std;
const int num = 2000001, num1 = 10000;
int main() {
int n, a[num], c[num1 + 1], b[num];
cin >> n;
for (int i = 0; i <= num1; i++) c[i] = 0;
for (int i = 0; i < n; i++) cin >> a[i];
for ... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define li long int
#define pb push_back
#define mkp make_pair
#define nikalL return
#define chalavo continue
#define basHo break
#define umap unordered_map
#define vi vector<int>
#define fr(i,s,n) for(int i=s;i<=n;++i)
#define frr(i,s,n) for(int i=... | 0 | 23,117,068 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
void func()
{
string N;
cin >> N;
long sum = 0;
for (int i = 0; i < N.length(); ++i)
{
sum += N[i] - '0';
}
if(sum%9==0)
cout << "Yes" << en... | #include <bits/stdc++.h>
using namespace std;
using i64=int64_t;
#define rep(i,x,y) for(i64 i=i64(x),i##_max_for_repmacro=i64(y); i<i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#def... | 0 | 39,004,073 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
int n;
cin>>n;
deque<int> a;
rep(i,n){
int x;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define bigger (char)toupper
#define smaller (char)tolower
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef v... | 0 | 16,354,205 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll... | 0 | 54,607,024 |
#include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<P,P> PP;
const ll MOD=10000;
const ll INF=1000000010;
const int MAX=100001;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
int a[5];for(int i=0;i<5;i++){cin>>a... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <utility>
#include <queue>
#include <map>
#include <deque>
#include <assert.h>
#include <stack>
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_bac... | 0 | 86,595,841 |
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using lint = long long;
const int MAXN = 250005;
const int MAXV = 1000005;
map<lint, int> mp;
int main(){
int n; scanf("%d",&n);
lint sum = 0;
mp[sum]++;
lint ret = 0;
for(int i=1; i<=n; i++){
int ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int main(){
fastIO
ios::sync_with_stdi... | 0 | 16,537,755 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, l;
cin >> n >>l;
vector<string>a(n);
for(int i =0 ; i < n; ++i){
cin >> a[i];
}
sort(a.begin(), a.end());
string ans;
for(int i =0 ; i < n; ++i){
ans ... | #include<iostream>
using namespace std;
int main(void)
{
long long int n,m,i,max=0,min=10000000,all=0;
cin>>n;
for(i=1;i<=n;i++){
cin>>m;
all=all+m;
if(max<=m) max=m;
if(min>=m) min=m;
}
if(n==1) cout<<m<<" "<<m<<" "<<m<<endl;
else cout<<min<<" "<<max<<" "<<all<<endl;
return 0;
} | 0 | 60,870,323 |
#include <algorithm>
#include <bits/stdc++.h>
#include<iostream>
#include<string>
using namespace std;
#define rep(i, n) for (int i = 0; i <(int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
int main(){
int a,b,c;cin>>a>>b>>c;
int sum=a+b+c;
int count=0;
int tmp=max(a,b);
int ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for (int i = 1; i <= n; i++)... | 0 | 89,354,683 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s1,s2;
int dp[1001][1001];
cin >> s1 >> s2;
for(int i=0;i<=s1.size();i++) dp[i][0]=i;
for(int i=0;i<=s2.size();i++) dp[0][i]=i;
for(int i=1;i<=s1.size();i++){
for(int j=1;j<=s2.size();j++){
int key=1;
if(s2[j-1]==s... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll x, ll y){
if(x < y) return gcd(y, x);
if(x%y == 0) return y;
return gcd(y, x%y);
}
int main(){
ll n,x;
cin >> n >> x;
vector<ll>d(n);
for(int i=0;i<n;i++){
ll a;
cin >> a;
d[i] = abs(a - x);
... | 0 | 71,263,746 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define RREP(i,a) for(int i = a;i >= 0;i--)
#define rep(i,n) for(int i = 0;i < (n);i++)
#define rrep(i,n) for(int i = n - 1;i >= 0;i--)
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long n,cnta=0,cntb=0;
cin >> n;
long a[n],b[n];
rep(i,n){
cin >> a[i];
cnta += a[i];
}
rep(i,n){
cin >> b[i];
cntb += b[i];
}
if(cnta<cntb) cou... | 0 | 1,312,406 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<list>
#include<set>
#include<string>
#include <iomanip>
#include<math.h>
using namespace std;
typedef long long ll;
#define lscan(x) scanf("%I64d",&x);
#define lprint(x) printf("%I64d",x);
ll gcd(ll a, ll b) {
int c = a % ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <random>
#include <ioman... | 0 | 71,466,828 |
#include<bits/stdc++.h>
using namespace std;
string s,t;
int ms(string a,string b){
int c=0;
for(int i=0;i<a.size();i++){
if(a[i]!=b[i])
c++;
}
return c;
}
void solve(){
int ans=1e9;
cin>>s>>t;
for(int i=0;i+t.size()<=s.size();i++){
ans=min(ans,ms(s.substr(i,t.size()),t));
}
co... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
int a[n], b[n], c[m], d[m];
for (int i = 0; i < n; i++)
{
cin >> a[i] >> b[i];
}
for (int i = 0; i < m; i++)
{
cin >> c[i] >> d[i];
}
for (int i = 0; i < n; i++)
... | 0 | 21,693,590 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<math.h>
#include<assert.h>
#include<string>
#include<cstdlib>
#include<cctype>
#include<unordered_map>
#include<sstream>
#include<numeric>
#i... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
cin.tie(NULL); cout.tie(NULL);
ios_base:: sync_with_stdio(false);
ll n,m,k;cin>>n>>m>>k;
for(ll i=0;i<=n;i++){
for(ll j=0;j<=m;j++){
ll cnt = i*(m-j) + j*(n-i);
if(cnt==k)return cout<<"Yes" , ... | 0 | 59,665,109 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | 0 | 47,077,738 |
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
int main()
{
optimize();
string st;
cin>>st;
string s=st.substr(5,2);
if(s=="01"||s=="02"||s=="03"||s=="04")
cout<<"Heisei"<<"\n";
else
cout<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
int main()
{
ll n;
string s;
cin >> n >> s;
... | 0 | 72,206,119 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, f, n) for (int i = (f); i < (int)(n); i++)
#define repe(i, f, n) for (int i = (f); i <= (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
const i... | #include <iostream>
using namespace std;
int n, s;
int dfs( int a, int m, int c ){
if(a == s && c == n) return 1;
if(a > s || c > n) return 0;
if(m > 9) return 0;
int t = 0;
for(int i = m; a+i <= s && i < 10; i++){
t += dfs(a+i, i+1, c+1);
}
return t;
}
int main(){
while( true ){... | 0 | 92,473,378 |
#include <bits/stdc++.h>
using namespace std;
int ct[26];
int main(){
string s;
cin >> s;
long long ans = 1;
for (int i = 0; i < s.size(); i++){
ans += i-ct[s[i]-'a'];
ct[s[i]-'a']++;
}
printf("%lld",ans);
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,a[3],i;
for(i=0;i<3;i++)
{
cin >> a[i];
}
sort(a,a+3,greater<int>());
if(a[1]%2!=a[2]%2)
{
cout << ((a[0]-a[1])+(a[0]-a[2]))/2+2 << endl;
}
else
{
cout << ((a[0]-a[1])+(a[0]-a[2]... | 0 | 24,922,141 |
#include <bits/stdc++.h>
#include <type_traits>
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 = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | #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>
#include <i... | 0 | 60,241,529 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | #include <iostream>
using namespace std;
int main() {
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
int s;
bool a = x >= r && x <= W -r && y >= r && y <= H - r;
if (a){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | 0 | 34,397,857 |
#include <string>
#include <iostream>
using namespace std;
int main()
{
int h, w;
while(cin >> h >> w && h && w) {
string top(w, '#');
string middle(w,'.');
middle[0] = '#'; middle.back() = '#';
cout << top << '\n';
while(h-- > 2) cout << middle << '\n';
cout << t... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define vi vector <int>
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define piii pair< int,pair<int,int> >
#define tiii tuple <int,int,int>
#define ff first
#define ss sec... | 0 | 70,497,298 |
#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;
using pll = pair<ll,ll>;
#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,... | #include<bits/stdc++.h>
using namespace std;
void swap(int* x, int* y){
int temp;
temp = *x;
*x = *y;
*y = temp;
}
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a > b){
swap(&a, &b);
}
if(a > c){
swap(&a, &c);
}
if(b > c){
swap(&b, &c);
}
cou... | 0 | 4,172,215 |
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstring>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, s, n) for(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | 0 | 91,957,618 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int a[10],u,count=0;
while(cin >> u ){
if(u!=0){
a[count]=u;
count++;
}
else {
cout << a[count-1]<<endl;
count--;
}
}
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
int main()
{
ll n,m;
cin>>n>>m;
vector<ll> a(n),memo(n+10);
rep(i,m){
int b;
cin>>b;
a[b]=1;
}
memo[0]=1;
if(a[1]==0){
memo[1]=1;
}
for(ll i=2;i<=n... | 0 | 69,535,010 |
#include<iostream>
#include<queue>
#include<cstdio>
using namespace std;
const int INF=1000000;
int d[1005][1005];
int dx[4]= {1,0,-1,0};
int dy[4]= {0,1,0,-1};
char s[1005][1005];
int m,n,k;
typedef pair <int,int >P;
P aim[15];
int isd(char ch)
{
return ch>='0'&&ch<='9'?1:0;
}
int bfs(int sx,int sy,int gx,int gy)
... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | 0 | 38,999,957 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")... | #include <bits/stdc++.h>
using namespace std;
vector<int> a;
void solve () {
int n;
cin >> n;
string s;
cin >> s;
string ans = s;
stack<char> st;
for (int i = 0; i < (int) s.size(); i++) {
if (s[i] == ')') {
if (st.empty()) {
ans = '(' + ans;
}... | 0 | 97,650,855 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define ANS(n) cout << (n) << "\n"
#define R... | 0 | 98,219,490 |
#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... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... | 0 | 69,920,291 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
if(a<b){
cout << a*c << endl;
}else{
int n=a-b;
cout << b*c+n*d << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N , M ;
cin >> N >> M ;
vector<int> d1(N+1) , d2(N+1);
for(int i = 0 ; i < M ; i++){
int a , b ;
cin >> a >> b ;
if(a == 1) d1.at(b)++ ;
if(b == N) d2.at(a)++ ;
}
int cnt = 0 ;
for( int i = 0 ; i <= N ; i++){
cnt++... | 0 | 93,795,230 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
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 > b)
{
a = b;
return 1;
}
return 0;
}
templa... | #include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include<algorithm>
#include <iomanip>
#include <math.h>
#include <iostream>
#include <bitset>
#define db double
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define ... | 0 | 5,577,723 |
#include <iostream>
using namespace std;
int c[16], a[16][16], n, m, x;
bool v[16];
int ans = 2e9;
void checkSol() {
for(int j = 1; j <= m; j++) {
int total = 0;
for(int i = 1; i <= n; i++)
if(v[i]) total += a[i][j];
if(total < x) return;
}
int cost = 0;
for(int i = 1... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n), b(n);
for(int i = 0; i < n; ++i)
{
int num;
cin >> num;
a[i] = num;
b[i] = num;
}
sort(a.begin(), a.end());
int max = a[n-1];
int next;
bool dup = false;
... | 0 | 72,518,843 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
const ll MOD = 10000... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
long long nChoosek( long long n, long long k )
{
if (k > n) return 0;
if (k * 2 > n) k = n-k;
if (k == 0) return 1;
long long result = n;
for( long long i = 2; i <= k; ++i ) {
result *= (n-i+1);
result /= i;
... | 0 | 59,061,223 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ll ans = 1e18;
for (int bit = 0; bit < (1 << n); ++bit) {
int bitcnt = 0;
ll cur = 0, cost = 0;
... | #include <bits/stdc++.h>
using namespace std;
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x... | 0 | 46,755,513 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N ; cin >> N ;
int P ;
int a,b,c,d,e,f,g,h ;
a = N % 10 ;
b = (N / 10) % 10 ;
c = (N / 100) % 10 ;
d = (N / 1000) % 10 ;
e = (N / 10000) % 10 ;
f = (N / 100000) % 10 ;
g = (N / 1000000) % 10 ;
h = (N / 10000000) % 10 ;
if ( N % (a+b+... | #include <bits/stdc++.h>
#define inf 1000000005
#define mod 1000000007
#define eps 1e-10
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define isin(x,l,r) ((l) <= (x) && ... | 0 | 79,012,248 |
#include <bits/stdc++.h>
using namespace std;
const int dx[]={1,0,0,-1,1,-1,-1,1};
const int dy[]={0,1,-1,0,1,1,-1,-1};
const int INF = 1<<30;
const double EPS = 1e-8;
#define PB push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i,j,k) for(int i = (j); i < (k); ++i)
#define rep(i,j) reps(i,... | #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 int INF = (int) 1e9;
const ll LINF = (ll) 4e18;
const ll ... | 0 | 73,505,837 |
#include <bits/stdc++.h>
#define F first
#define S second
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define p_b push_back
#define all(c) c.begin(), c.end()
using namespace std;
typedef long long ll;
typedef pair <int , int> pii;
typedef pair <ll , ll> pll;
const double eps = 1e-6;
const int MAXN ... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstring>
#include<cstdio>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
#define all(n) n.begin(),n.end()
const int MAXN = 100 * 1000 + 10;
double s[MAXN];
double t;
int main()
{
int n... | 0 | 55,313,621 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define re... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define F first
#define S second
#define SZ(a) (int)((a).size())
#define pb push_back
#define mp make_pair
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> PI;
typedef unsigned long long ull;
#defi... | 0 | 60,593,304 |
#include<iostream>
#include<vector>
#include<algorithm>
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
int compute(int y, int m, int d){
int cnt = 0;
int b_years = (y-1)/3;
int s_years = (y-1) - b_years;
cnt += b_years*200 + s_years*195;
if(y%3==0){
cnt += (m-1)*20;
}else{
... | #include<cmath>
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<deque>
#include<queue>
#include<algorithm>
#include<list>
#include<cstring>
#include <numeric>
#define ll long long
#define int long long
#define ld long double
#define endl "\n"
#define debugv(v) cerr<<#v<<" : ";fo... | 0 | 61,282,351 |
#include<stdio.h>
int main()
{
int x,y;
scanf("%d %d",&x,&y);
while(1){
if(x==0 && y==0) break;
if(x>y){
printf("%d %d\n",y,x);
}
else {
printf("%d %d\n",x,y);
}
scanf("%d %d",&x,&y);
}
return 0;
} | #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() {
string s, t;
cin >> s >> t;
int ls = s.size();
int lt = t.size();
vector<string> ss;
for (int i = 0; i + lt - 1 < ls; ++i) {
bool ok = true;
rep(j,... | 0 | 7,135,082 |
#include <iostream>
int triangle(int x, int y, int z)
{
int a = x * x;
int b = y * y;
int c = z * z;
return (a + b - c) * (b + c - a) * (c + a - b);
}
int main()
{
int N, x, y, z;
std::cin >> N;
for(int i = 0; i < N; i++){
std::cin >> x >> y >> z;
if ( triangle(x, y, z) == 0 ){
std::cout << "YES" << std::... | #include<bits/stdc++.h>
using namespace std;
struct tree{
int p;
int l;
int r;
int d;
};
tree t[100000];
void dfs(int n,int d){
if(n==-1)return;
t[n].d=d;
dfs(t[n].r,d),dfs(t[n].l,d+1);
}
int main(){
int n,a,b,c,tmp;
cin>>n;
for(int i=0;i<n;i++)t[i].l=-1,t[i].p=-1,t[i].r=-1,t[i].d=0;
for(int i=0;i... | 0 | 87,525,051 |
#include <iostream>
#include <vector>
#include <chrono>
#include <random>
#include <cassert>
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);
int n, ... | #include <bits/stdc++.h>
#define ll uint64_t
#define vi vector <int>
#define vl vector <ll>
#define dl pair <ll, ll>
#define ii pair <ll, ll>
#define vii vector <ii>
#define graph vector <set <int> >
#define REP(a, b, step) for (int a = 0; a < b; a += step)
#define inf 1000000000
using namespace std;
int main() {
i... | 0 | 31,000,293 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define dump(a) cerr << #a << " = " << (a) << "(L:" << __LINE__ << ")" << endl
void solve(long long A, long long B, long long C, long long K) {
if (K <= A + B) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i,n){
cin >> a.at(i);
}
ll ans1=0;
ll ans2=1;
sort... | 0 | 9,725,348 |
#include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int s = a;
int m = b;
int l = c;
int tmp;
if (s > m) {
tmp = s;
s = m;
m = tmp;
}
if (m > l) {
tmp = m;
m = l;
l = tmp;
}
if (s > m) {
tmp = s;
s = m;
m = tmp;
}
cout << s << " " << m << " " << l << "\n... | #include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<sstream>
using namespace std;
#define sf scanf
#define pf printf
#define pfn printf("\n");
#define pfk printf(" ");
#define pf0 printf("0");
#... | 0 | 78,931,608 |
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
cout<<111+999-n<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(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 > b) { a = b... | 0 | 39,149,227 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
ll modpow(ll a, ll n, ll mo... | 0 | 51,380,863 |
using namespace std;
#include <bits/stdc++.h>
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
if(abs(a-b)<=d){
if(abs(b-c)<=d){
std::cout << "Yes" << std::endl;
}
else{
std::cout << "No" << std::endl;
}
}
else if(abs(a-c)<=d){
std::cout << "Y... | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
using namespace st... | 0 | 37,859,828 |
#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 MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100001,INF=1<<30;
int main(){
int N;
ll K;cin>>N>>K;
vector<ll> A(N),B(N);
for(int i=0;i<N;i++){
cin>>A[i]>>B[i];
}
ll ans=0;
int dig=-1;
for(int ... | 0 | 14,788,688 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using ll = long long;
const int inf = 1e8;
int dp[105][105];
int main() {
int n;
cin >> n;
vector<int> p(n+1);
cin >> p[0] >> p[1];... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | 0 | 54,451,650 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, x;
cin >> n >> d >> x;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
while (cnt * a.at(i) + 1 <= d) {
cnt++;
}
ans += cnt;
}
cout <... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n,a,b;
cin >> n >> b >> a;
if(a+b<=n+1&&a*b>=n) {
for(ll i=a;i;i--) {
if(i!=a) cout << " ";
cout <<... | 0 | 65,747,563 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
vector<long long> dp, paty;
long long dfs(long long N, long long X){
long long ans = 0;
if(X == 1 && N == 0) return 1;
else if(X == 1) return 0;
if(X == dp[N]) return paty[N];
if(X > dp[N] / 2 + 1) ans... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main(){
int N, K;
cin >> N >> K;
vector<long long> H(N);
long long ans = 0;
for(int i=0; i<N; ++i){
cin >> H[i];
}
sort(H.rbegin(), H.rend());
if( N <= K){
ans = 0;
}else{
for(i... | 0 | 61,546,412 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
struct Card{
char suit, value;
};
void BubbleSort(struct Card A[], int N){
int flag =1;
int swap = 0;
while(flag){
flag = 0;
for(int i = N-1; i >= 1; i--){
if(A[i].value < A[i-1].val... | 0 | 93,047,805 |
#include<iostream>
#include<string>
#include<stack>
using namespace std;
string s;
void solve(){
stack<char> T;
for(int i=0;i<s.size();i++){
if(s[i]=='(' || s[i]=='[')
T.push(s[i]);
if(s[i]==')'){
if(T.empty()){cout<<"no"<<endl;return;}
if(T.top()=='(') T.pop();
else{cout<<"no"<<endl;return;}
}
if... | #include <iostream>
using namespace std;
typedef long long ll;
ll n,m,a,b,c,dp[100][100];
int main(void){
cin>>n>>m;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i!=j)dp[i][j]=1e18;
}
}
for(int i=0;i<m;i++){
cin>>a>>b>>c;
dp[a][b]=c;
}
for(int k=0;k<... | 0 | 29,773,225 |
#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 LL long long
int n;
vector<vector<int>> v;
int main(){
cin>>n;
int k=0;
FOR(i,1,10000){
k+=i;
if(n<k){
cout<<"No"<<endl;
return 0;
}
if(n==k){
k=i;
... | #include<bits/stdc++.h>
#include <unordered_map>
#define int long long int
#define double long double
#define endl "\n"
#define PI 3.141592653589793238462643383279502884
#define sum_up(x) (x*(x+1))/2
#define sp(x) setprecision(x)
#define ceil(a,b) (a+(b-1))/b
#define mp(a,b) make_pair(a,b)
#define LCM(a,b) (a... | 0 | 43,470,654 |
#include <bits/stdc++.h>
using namespace std;
#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(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
map<ll,int> A;... | #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a,long long int b)
{
if(b==0)
return a;
else
return gcd(b,a%b);
}
int main()
{
long long int x,i,y,ans=0;
scanf("%lld%lld",&x,&y);
if(x==y ||((x>y) && (gcd(x,y)==y)))
printf("-1");
else
{
... | 0 | 47,511,889 |
#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() {
ll n;cin>>n;
int ans;
for(int i=1;i<=sqrt(n);i++){
ll x=n%i;
if(x==0)ans=i;
}
cout<<ans-1+n/ans-1<<endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int m... | 0 | 25,150,509 |
#include<bits/stdc++.h>
using namespace std;
int used[300000];
int main(){
int N;
cin >> N;
int A[(1<<N)+1];
for(int i=0; i<(1<<N); i++){
cin >> A[i];
}
A[1<<N] = -1;
long long data[1<<N][2];
data[0][0] = 0; data[0][1] = -1;
for(int i=1; i<(1<<N); i++){
vector<int> arr;
arr.push_back(i);
for(int j=0; j... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int h,w;cin>>h>>w;
vector<string> m(h);
for(int i=0;i<h;++i){
cin>>m[i];
}
vector<bool> hi(h,false);
vector<bool> wi(w,false);
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
if(m[i][j]=='#')... | 0 | 88,763,332 |
#include <bits/stdc++.h>
using namespace std;
inline void rd(int &x) {
char ch; for(;!isdigit(ch=getchar()););
for(x=ch-'0';isdigit(ch=getchar());)x=x*10+ch-'0';
}
typedef long long LL;
const int MAXN = 300005;
int n, cnt[MAXN];
LL sum[MAXN];
int ans[MAXN];
inline bool chk(int k, int x) { return sum[x] >= 1ll*k*x; }
... | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<in... | 0 | 80,761,377 |
#include <stdio.h>
int x,y,c,t;
int main(){
scanf("%d%d", &x,&y); for(t=0; t<=x; t++){
c=x-t;
if(4*t+2*c==y){
printf("Yes\n");
return 0;
}
}
printf("No\n");
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i< (n);i++)
using namespace std;
int main() {
int s;
cin>>s;
int d[1000010];
d[0]=s;
rep(i,1000000){
if(d[i]%2==0)d[i+1]=d[i]/2;
else{ d[i+1]=d[i]*3+1;}
}
bool ok=false;
for(int i=1;i<1000000;i++){
for(int j=i-1;j>=0;j--){
if... | 0 | 32,805,378 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.