code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9+7)
int main(){
ll n, k;
cin >> n >> k;
int max_bit = 31;
vector<ll> a(n);
vector<ll> b(n);
for(int i = 0; i < n; i++){
... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <list>
#include <cassert>
#include <climits>
#inclu... | 0 | 46,261,452 |
#include<iostream>
#include<stdio.h>
#include<queue>
#include<string.h>
using namespace std;
int mp[1002][1002],mp2[1002][1002];
int main()
{
char a;
int t, j, h, w, k, i;
pair<int, int> s, m[10];
queue<pair<int, int> > u;
queue<int> e;
cin >> h >> w >> k;
for (i = 0; i <= h; i++)
{
mp[i][0] = 1;
mp[i][w + ... | #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 RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
int main(){
ll h, w;
cin >> h >> w;
vector<string> s(h);
REP(i, h){... | 0 | 6,771,520 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | 0 | 27,425,683 |
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <set>
#include <utility>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>
#include <cstdio>
#include <map>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#d... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
#include <string>
#include <sstream>
#include <utility>
#include <deque>
#include <numeric>
#include <map>
#include <stack>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF 1000000000000
using names... | 0 | 27,298,002 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int main(){
int n;
while(true){
cin >> n;
if(n == 0){
break;
}
vector< pair<int, int> > train;
train.push_back(make_pair(0, 0));
vector< pair<int, int> >... | #include <iostream>
#include <vector>
#include <string>
#include <tuple>
class A
{
public:
A()
{
int n;
std::cin >> n;
std::vector<int> a(n);
for(int i = 0; i < n; ++i)
{
std::cin >> a[i];
}
int cnt = bubbleSort(a, n);
show(a);
... | 0 | 72,776,801 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include<iostream>
#include<cstdio>
#include <cstring>
using namespace std;
int main()
{
int n;
bool a[1000001];
memset(a,0,sizeof(a));
for(int i=2;i<=1000;++i)
{
for(int j=2;j*i<=1000000;++j)
{
a[i*j]=1;
}
}
while(cin>>n)
{
int count=0;
for(int k=2;k<=n;k++)
{
if(!a[k])
count... | 0 | 20,410,514 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <functional>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <typeinfo>
#define PI 3.14159265359
#define INF 99999999;
#define rep(i, ... | #include <bits/stdc++.h>
using namespace std;
string s;
unordered_map<int, int>cnt;
int main(){
cin>>s;
int cur = 0, x;
cnt[cur] = 1;
for(int i = 0; i < s.size(); ++i){
cur ^= (1 << (s[i] - 'a'));
if(cur == 0){
continue;
... | 0 | 77,643,838 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x)(x).begin(), (x).end()
#define rall(v)(v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair < ll, ll >
#define F first
#define S second
const int MOD =... | #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;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | 0 | 10,837,104 |
#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 = 1001001001LL;
constexpr long long LINF = 1001001001001001001;... | #include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int state=0,cnt=0;
for(string step;n>0;--n){
cin>>step;
if(step=="lu"||step=="ru"){
if(state==1) cnt++;
state=1;
}else{
if(state==0) cnt++;
stat... | 0 | 66,635,454 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <math.h>
#include <iomanip>
#include <map>
#include <queue>
#include <tuple>
#include <math.h>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef tuple<int,int,int> P;
int main(){
string S;
cin >> S;
if(... | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long ... | 0 | 36,696,588 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,m,need;
int a[15][15];
int cost[20];
int dp[20][1<<15];
int func(int pos,int mask)
{
if(pos>n)
{
int tcost=0;
for(int i=1; i<=m; i++)
{
int sm=0;
for(int j=1; j<=n; j++)
{
... | 0 | 9,052,437 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
int x = -1, y = -1, z = -1;
for (int i = 0; i <= N; i++){
for (int j = 0; j <= N - i; j++){
if (1000 * (N - i - j) == Y - 10000 * i - 5000 * j){
x = i;
y = j;
z = N - i - j;
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N,M;
cin >> N >> M;
vector<int64_t> A(N),B(N);
for ( int64_t i = 0; i < N; ++i){
cin >> A[i] >> B[i];
}
vector<vector<int64_t>> AB(N,vector<int64_t>(2));
for ( int64_t i = 0; i < N; ++i){
AB[i][0] = A[i];
... | 0 | 18,635,503 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
s << "[";
for (int i = 0; i < len; i++) {
if (i > 0) s << ", ";
s << v[i];
}
s << "]";
return s;
}
int main()... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pi 3.141592653589793
#define eps 0.00000001
#d... | 0 | 47,086,443 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | 0 | 40,942,808 |
#include <iostream>
using namespace std;
int main(){
int track[10], c, num;
while(1){
cin >> num;
if(!num){
if(!c) break;
else cout << track[c--] <<endl;
}
else{
if(c==10) cout << "Already Full" <<endl;
else track[++c] = num;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
constexpr ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#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 | 31,447,803 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> h,w;
int _h,_w;
while(1){
cin >> _h >> _w;
if(_h == 0 && _w == 0){
break;
}
h.push_back(_h);
w.push_back(_w);
}
for(int i=0;i<h.size();i++){
for(int h_i=0;h_i<h[i];h_i++){
for(int w_i=0;w_i<w... | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, ... | 0 | 5,691,313 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool c... | #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... | 0 | 60,021,161 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll h, w, d; cin >> h >> w >> d;
vector <pair <ll, ll>> v(h*w, pair <ll, ll> ());
rep(i, h) {
rep(j, w) {
ll a; cin >> a;
... | #include<iostream>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
#include<cstdlib>
#include<set>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#include<iostream>
int const MAX_N = 100000;
int par[MAX_N];
int depth[MAX_N];
void init(int n){
for(int i = 0; i < n; i++){
... | 0 | 15,442,002 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree <ll, null_type, less_equal <ll>, rb_tree_tag, tree_order_statistics_node_update>
#define mp make_pair
#define pb... | #include<algorithm>
#include<iostream>
#include<cstring>
#define rep(i,a) for(int i=0;i<(a);++i)
#define repd(i,a) for(int i=(a);i>=0;--i)
#define clr(a,v) memset((a),(v),sizeof(a))
const int MAX_X = 1000, MAX_Y = 1000;
int q;
std::string X, Y;
int dp[MAX_X+1][MAX_Y+1];
int main()
{
std::cin >> q;
while( q-- )
... | 0 | 41,411,974 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,x[200];
while(1){
cin>>n>>a>>b;
if(n==0 && a==0 && b==0) break;
for(int i =0;i<n;i++){
cin>>x[i];
}
int j=0,k=a;
for(int i=a-1;i<b;i++){
if(x[i]-x[i+1]>=j){
j=x[i]-x[i+1];
k=i+1;
}
}
cout<<k<<endl;... | #include <iostream>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#define PI 3.1415926535
using namespace std;
int main()
{
int a,b,arg;
scanf("%d %d %d",&a,&b,&arg);
double rad = (arg / 180.0) * PI;
printf("%5lf\n",(a * b * sin(rad)) / 2);
printf("%5lf\n",a + b + sqrt(a*a + b*b - 2*a*b*c... | 0 | 79,357,356 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef vector<int> vi;
typedef vector< vi > vvi;
int a[6];
int main() {
int L,N=0,M=0;
while (cin >> N) {
L = 1000 - N;
if (N == 0) {
break;
}
... | #include <iostream>
#include <string>
using namespace std;
const int cnMaxAry = 1000033;
long long fnStrToLL(string sKey)
{
int iElm;
int iBase = 1;
long long llKey = 0;
for (int i = sKey.size() - 1; i >= 0; i--)
{
switch (sKey[i])
{
case 'A': iElm = 1;
break;
case 'C':... | 0 | 71,966,343 |
#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=100010;
const ll mod... | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | 0 | 91,288,127 |
#include<bits/stdc++.h>
using namespace std;
void test()
{
int a,b,c;
map<int,int>mp;
int res=0;
cin>>a>>b>>c;
mp[a]++;
mp[b]++;
mp[c]++;
for(int i=1;i<=100;i++)
{
if(mp[i])
res++;
}
cout<<res<<"\n";
}
int main()
{
ios::sync_with_stdio(NULL);
cin.tie(0);
cout.... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long n;
cin >> n;
vector<long long> a(n);
for(long long i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
vector<bool> divide(1000001, false);
vector<bool> seen(1000001,... | 0 | 57,962,373 |
#include<iostream>
#include<vector>
using namespace std;
vector<int> ans;
int main(){
while(1){
int n,a,b,c,x;
cin >> n >> a >> b >> c >> x;
if(n + a + b + c + x == 0) break;
int y[100];
int count = -1;
int reel = 0;
for(int i = 0;i < n;i++){
cin >> y[i];
}
for(int i = 0;i <= 10000;i++){
if(x =... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
using namespace std;
int main(){
int K;
cin>>K;
queue<long long> q;
for(int i=1;i<10;i++){
q.push(i);
}
int cnt=0;
long long node;
while(!q.empty()){
node=q.front();q.pop();
cnt++;
if... | 0 | 15,042,691 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, N) for(int i = 0; i < N; i++)
#define rep2(i, N, a, b) for(int i = a; i < N; i += b)
int main(){
string A, B;
cin >> A >> B;
if (A.size() == B.size()){
if (A > B) cout << "GREATER" << endl;
else if (A < B) cout << "LESS" << endl;... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P=pair<int,int>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
int ... | 0 | 39,144,713 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int n;
cin>>n;
int m;
cin>>m;
if(m<2*n)
cout<<m/2<<endl;
else
{
int ans=n;
m=m-n*2;
cout<<ans+(m/4)<<endl;
}
} | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<l... | 0 | 60,389,856 |
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
ll stone[100010];
bool ch[100010];
ll dfs(int key, vector<vector<int>> &g){
ch[key]=1;
ll sum=0, mx=0;
int cnt=0;
for(int i=0; i<g[key].size(); ++i){
if(!ch[g[key][i]]){
++cnt;
ll p=dfs(g[key]... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
using namespace std;
const int INF = (1<<30) - 1;
const int T = 24 * 60 * 60;
int d[T];
int to_in... | 0 | 25,635,214 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD... | #include <bits/stdc++.h>
using namespace std;
const long long MD=1e9+7;
long long n,dp[100005],pre[100005],ans;
vector<int> v;
string str;
long long qpow(long long b,long long exp) {
long long ret=1;
while (exp!=0) {
if (exp%2==1) {ret*=b; ret%=MD;}
b*=b; b%=MD;
exp/=2;
}
return ... | 0 | 96,304,185 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
int mx = 0;
... | 0 | 40,434,293 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n, m, k; cin >> n >> m >> k;
for (int i = 0; i <= n; i++) for (int j = 0; j <= m; j++) {
if (i * m + j * n - 2 * i * j == k) {
cout << "Yes\n";
return 0;
}
}
cout << "No\n";
return 0;
} | #include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
template<class T>inline void read(T &res)
{
char c;T flag=1;
while((c=getchar())<'0'|c>'9'... | 0 | 94,534,462 |
#include <iostream>
#include <queue>
using namespace std;
int main() {
priority_queue<int> A;
string command;
int target;
while(true) {
cin >> command;
if (command == "insert") {
cin >> target;
A.push(target);
} else if (command == "extract") {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
long x;
cin >> n >> m >> x;
long c[n], a[n][m];
for (int i = 0; i < n; i++) {
cin >> c[i];
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
long min = -1;
int b = 0b0;
while (b++ < pow(2, n)) {
long total_price... | 0 | 34,033,140 |
#include <algorithm>
#include <iostream>
using namespace std;
long long count(long long n) {
return n < 5 ? 0 : count(n / 5) + n / 5;
}
int main() {
long long n; cin >> n;
cout << (n % 2 == 0 ? count(n / 2) : 0) << '\n';
return 0;
} | #include<bits/stdc++.h>
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 res = A[0] - 1;
int ma = 1;
for (int i = 1; i < N; i++) {
if (A[i] == ma + 1) ma++;
if (A[i] <= ma) continue;
res += (A[i]-1) / (ma+1);
}
cout << res << endl;
} | 0 | 60,950,016 |
#include <cstdio>
#include <cstring>
#include <cctype>
int main () {
char c;
int ans[150];
for (int i=0; i< 150; i++) ans[i] = 0;
while (scanf("%c", &c) != EOF) {
char lower = tolower(c);
ans[lower] += 1;
}
for (int i=97; i<123; i++) {
printf("%c : %d\n", i, ans[i]);
... | # include <cstdio>
# include <cmath>
#define M_PI 3.14159265358979323846
int n;
struct PointPair {
double x, y;
};
void koch(int k, PointPair p1, PointPair p2) {
if (k == 0)
return;
PointPair s, u, t;
double th = M_PI * 60.0 / 180.0;
s.x = (2.0 * p1.x + 1.0 * p2.x) / 3.0;
s.y = (2.0 * p1... | 0 | 40,708,361 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
vector<ll> a;
ll N;
bool isOK(ll start, ll goal) {
for(ll i = 0; i < N; i++) {
start -= (start % a[i]);
}
if(start >= goal)
return true;
else... | #include <bits/stdc++.h>
#define SS " "
#define endl "\n"
#define EPS 1e-9
#define gcd __gcd
#define pb push_back
#define pi acos(-1.0)
#define Ars greater<int>()
#define vi vector<int>
#define vvi vector<vector<int> >
#define flush ... | 0 | 90,153,268 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
string S;
cin >> S;
ll K;
cin >> K;
char ans;
for (int i = 0; i < K; i++)
{
if (... | # include <iostream>
# include <string>
using namespace std;
typedef long long ll;
bool allCharSame(string s){
char c = s[0];
for(int i=1; i<s.size(); i++) if(s[i] != c) return false;
return true;
}
int main(){
string s;
ll k;
cin >> s >> k;
if(allCharSame(s)){
cout << s.size() * k / 2 << endl;
}
... | 0 | 90,060,585 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
map<string, int>mp;
for (int n = 0; n < N; ++n) {
string S;
cin >> S;
sort(S.begin(),S.end());
mp[S]++;
}
long long ans = 0;
auto begin = mp.begin(), end = mp.end();
for (auto iter = begin; iter != end; iter++) {
ans += (long ... | #define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
vector<pair<ll, int>> factorize(ll n) {
vec... | 0 | 81,534,923 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long res = 0;
for(long long a = 1; a <N; a++){
res += (N-1)/a;
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int convert(char c) {
if (c == 'R') return 0;
if (c == 'G') return 1;
return 2;
}
int remain(char c1, char c2) {
if ((c1 == 'R' && c2 == 'G') || (c1 == 'G' && c2 == 'R')) return 2;
if ((c1 == 'R' && c2 == 'B') || (c1 == 'B' && c2 == 'R')) return 1;
r... | 0 | 87,931,186 |
#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;
using P = pair<ll,ll>;
using grid = vector<vector<int>>;
const int dx[2] = {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
int main(void){
ll k,a,b;
cin>>k>>a>>b;
if(b-a<=2){
cout<<k+1<<endl;
}
else{
ll x=k-(a-1);
ll ans=a;
if(... | 0 | 33,872,360 |
#include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair <int, int>;
const double PI = acos(-1);
const ll MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector<ll> B(N);
rep(i,N){
ll x;
cin >> x;
B[i] = x - i - 1;
}
... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<vector<char> >v(n,vector<char>(m));
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>v[i][j];
}
}
bool no=false;
for(int i=0;i<n;i++)
{
for(in... | 0 | 58,634,781 |
#include <bits/stdc++.h>
#define REP(i, n) for (int (i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for(int (i) = a; (i) < (int)b; i++)
#define RREP(i, n) for(int (i)=((int)(n)-1); (i)>=0; i--)
#define RFOR(i, a, b) for(int (i) =((int)(b)-1); (i)>=(int)a; i--)
#define ALL(v) (v).begin(),(v).end()
#define MOD 100000... | #include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int n,q[40003];
long long ans,c[50];
int main(){
cin>>n;
char _a;
for(int i=1,_n=n+1;i<_n;i++){
cin>>_a;
switch(_a){
case 'R':
q[i]=1;
break;
case 'G':
q[i]=2;
... | 0 | 2,105,256 |
#include <iostream>
using namespace std;
#define rep(i, n) for(int i=1;i<n;i++)
int main(){
int num;
cin >> num;
int count=0, ans=0;
rep(i, num+1){
if(i%2 == 1){
rep(j, i+1){
if(i%j == 0){
count++;
}
}
if(cou... | #include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#define rep(i, a, b) for ( int i = (a); i < (b); i++ )
#define per(i, a, b) for ( int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#defin... | 0 | 8,716,698 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << e... | #include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
using namespace std;
string S[300];
int main(){
int N;
cin >> N;
for(int i = 0; i < N; i++){
... | 0 | 72,001,031 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
REP(i, n) cin >> a[i];
if (n == k) cout << 1 << '\n';
else {
int ans = 1;
int tmp ... | #include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <float.h>
#include <iomanip>
#include <iostream>
using namespace std;
int gcd(int x,int y){
if(y==0)return x;
return gcd(y,x%y);
}
int lcm(int x,int y){
return x*y/gcd(x,y);
}
in... | 0 | 74,849,817 |
#include<iostream>
using namespace std;
int main(){
int n;
while(cin>>n){
bool array[1000500];
for(int i=0;i<=n;i++){
array[i]=true;
}
int count=0;
array[0]=array[1]=false;
for(int i=1;i<=n;i++){
if(array[i]){
count++;
for(int j=i*2;j<=n;j+=i){
array[j]=false;
}
}
}
cout<<cou... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int W,H,N;
cin >> W >> H >> N;
int x[N],y[N],a[N];
for(int i = 0 ; i < N ; i++){
cin >> x[i] >> y[i] >> a[i];
}
bool judge[H][W];
for(int i = 0 ; i < H ; i++){
for(int j = 0 ; j < W ; j++){
judge[i][j] ... | 0 | 69,024,302 |
#include<iostream>
#include<map>
using namespace std;
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
typedef long int li;
int main(){
string s; cin >> s;
rep(i,4) cout << s[i];
cout << " ";
repa(i,4,s.size()) cout << s[i];
cout << "\n";
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef... | 0 | 29,428,882 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <random>
#include <cstdlib>
#define INT_MAX 2147483647
#de... | #include <bits/stdc++.h>
#define FR first
#define SE second
using namespace std;
typedef pair<int,int> pr;
int num[200005];
pr st[400005];
bool check(int n,int d) {
int top=0;
for(int i=1;i<=n;i++)
if (num[i]>num[i-1]) st[++top]=pr(1,num[i]-num[i-1]);
else {
int len=num[i-1];
while (len>num[i])
... | 0 | 12,022,336 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,a,b) for (int i = (a); i < (b); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 100000000;
const double PI=3.14159265358979323846;
int main () {
ll X,Y;
cin >> X >> Y;
ll ans = 0;
ll tmp =... | #include <bits/stdc++.h>
using namespace std;
int main(){
char s[4];
scanf("%s", s);
map <char, int> freq;
for(int i = 0; i < 4; i++){
freq[s[i]]++;
if(freq[s[i]] >= 3)
return puts("No"), 0;
}
for(auto x : freq){
if(x.second != 2)
return puts("No")... | 0 | 37,347,743 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL (1LL<<62)
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 88,623,919 |
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5+5;
int n, t[MAXN], v;
vector<int> g[MAXN];
int s[MAXN];
void dfs(int v, int f = -1) {
s[v] = 1;
int ct = 0;
for (int u : g[v]) {
if (u != f) {
dfs(u, v);
s[v] += s[u];
ct += s... | 0 | 99,454,943 |
#include <bits/stdc++.h>
using namespace std;
const string color = "RYGB";
int H,W,d;
int main() {
cin>>H>>W>>d;
for (int h=0;h<H;h++) {
for (int w=0;w<W;w++) {
int d1 = h+w;
int d2 = h-w+W-1;
int num = d1/d % 2 * 2 + d2/d % 2 * 3;
cout << color[num%4];
... | #include<bits/stdc++.h>
using namespace std;
int a[100000];
int main(){
int n;
scanf("%d",&n);
memset(a,0x3f,sizeof(a));
for(int i=0,x;i<n;i++){
scanf("%d",&x);
*lower_bound(a,a+n,x)=x;
}
printf("%d\n",lower_bound(a,a+n,0x3f3f3f3f)-a);
return 0;
} | 0 | 22,160,922 |
#include <bits/stdc++.h>
#define int long long int
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,k;
cin>>k>>n;
int t,t2;
int s=0;
int maxi=INT_MIN;
int f;
cin>>s;
f=s;
int sum=0;
for(int i=0;i<n-1;i++)
{
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
string s, t;
cin >> N >> s >> t;
reverse(s.begin(), s.end());
for (int i = N; ... | 0 | 66,057,561 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m, x, y;
cin >> n >> m >> x >> y;
ll mx = x;
ll my = y;
for (ll i = 0; i < n; ++i) {
ll u;
cin >> u;
mx = max(mx, u);
}
for (ll i = 0; i < m; ++i) {
ll u;
cin >> u;
... | #include <iostream>
using namespace std;
int main(void) {
string s;
int m, h, c, n, i;
while (1) {
cin >> s;
if (s == "-") break;
cin >> m;
n = s.size();
c = 0;
for (i = 0; i < m; i++) {
cin >> h;
c = (c + h) % n;
}
cout... | 0 | 26,055,200 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int main(){
fast;
ll a,b;
cin>>a>>b;
cout<<2*b-a;
return 0;
} | #include<bits/stdc++.h>
#include <iostream>
using namespace std;
int main()
{
#ifdef LOCAL_EXEC
#else
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#endif
vector<long long int>vt;
long long int i,n,j;
cin>>n;
long long int A[n+1];
bool ok=true;
vt.push_back(1);
for(i=... | 0 | 65,913,196 |
#include<bits/stdc++.h>
#define MAX 1000000
using namespace std;
int main(){
vector<int> prime(MAX,1);
vector<int> ans;
prime[0] = 0;
prime[1] = 0;
prime[2] = 1;
for(int i=4;i<MAX;i+=2)
prime[i] = 0;
for(int i=3;i<sqrt(MAX);i+=2)
for(int j=i+i;j<MAX;j+=i)
prime[j] = 0;
int n;
while(cin>>n){
int ... | #include <iostream>
using namespace std;
int a[101];
float avg(int * a, int n) {
float mean = 0;
for (int i = 0; i < n; i++) {
mean += a[i];
}
mean /= n;
return mean;
}
int main() {
int n;
cin >> n;
int int_mean = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
float mean = av... | 0 | 34,769,935 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll Q, H, S, D, N;
cin >> Q >> H >> S >> D >> N;
ll P = 0;
ll m = min (D, S * 2);
m = min(m, H * 4);
m = min(m, Q * 8);
if (m == D) {
ll PD = N / 2 * D;
ll m2 = min(S, H * 2);
m2 = min(m2, Q * 4);
ll PS = (N % ... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | 0 | 18,018,867 |
#include <stdio.h>
int main(){
int A;
scanf("%d", &A);
int B;
scanf("%d", &B);
if(A==1 && B==3){
printf("2");
}
else if(A==1 && B==2){
printf("3");
}
else if(A==2 && B==3){
printf("1");
}
else if(A==3 && B==1){
printf("2");
}
else if(A==2 && B==1){
printf("3");
}
else i... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
using namespace std;
typedef long long ll;
int dfs(int h,int n, int sum,int s){
if(h==10){
if(sum == s && n == 0) return 1;
... | 0 | 51,258,318 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P=pair<int,int>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
ll c... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | 0 | 53,275,542 |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define for(i,a,b) for(int i = a;i<b;i++)
int main()
{
int n,l;
cin>>n>>l;
string a[n];
for(i,0,n) cin>>a[i];
for(i,0,n-1){
for(j,i+1,n){
if(a[i]>a[j]){
swap(a[i],a[j]);
}
}
}
for(i,0,n) cout<<a[i];
return 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1000000007;
template<class T> inline bool chmin(T &a,T b){
if (a>b){
a=b;
return true;
... | 0 | 78,385,250 |
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<ll, int> P;
int main()
{
int w, h;
scanf("%d %d", &w, &h);
v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
const int N=100005;
vector<int> v[N];
array<ll,2> dfs(int a,int p=-1)
{
array<ll,2> now={1,1};
for(int to:v[a])
{
if(to==p) continue;
array<ll,2> nxt=dfs(to,a);
now[0]=(now[0]*(nxt[0]+nxt[1])... | 0 | 23,601,949 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i,n) cin >> h.at(i);
if(n == 1){
cout << 0 << endl;
return 0;
}
vector<int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
#define pb push_back
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define endl '\n'
const ll MOD = 1000000007;
int... | 0 | 53,006,621 |
#include<stdio.h>
#include<queue>
#include<math.h>
#include<time.h>
#include<string.h>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<map>
#include<stack>
#define LL long long
#define mem(a,b) memset(a,b,sizeof(a))
#define lowbit(a) a&(-a)
#define PI acos(-1)
#define shortime(a) std::io... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb em... | 0 | 30,554,281 |
#include<bits/stdc++.h>
#include<limits.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
static const int N = 100;
int main(){
int n;
vector<int> p(N+1);
vector<vector<int>> m(N+1, vector<int>(N+1, 0));
cin >> n;
for(int i = 1; i <= n; i++){
cin >> p.at(i - 1) >> p.at(i);... | #include <iostream>
using namespace std;
const int big_month = 20;
const int small_month = 19;
const int ordinal_year = big_month * 5 + small_month * 5;
const int special_year = big_month * 10;
const int three_years = ordinal_year * 2 + special_year;
const int millennium = three_years * 333 + 1;
int count_day_from_firs... | 0 | 26,500,421 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
long long n;
cin>>n;
vector<long long> a;
for(long long i=1;i*i<=n;i++){
if(n%i==0){
a.push_back(i+n/i-2);
}
}
sort(a.begin(),a.end());
cout<<a[0]<<endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int H,W;
int dh[4] = {1,0,-1,0};
int dw[4] = {0,1,0,-1};
cin >> H >> W;
vector<vector<char>>c(H,vector<char>(W,' '));
vector<vector<int>>dist(H,vector<int>(W,-1));
queue<pair<int,int>>que;
for(int i = 0; i < H; i++)
{
... | 0 | 56,940,635 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> sticks(n);
for (size_t i = 0; i < n; ++i) cin >> sticks[i];
sort(sticks.begin(), sticks.end(), greater<int>());
cout << accumulate(sticks.begin(), ... | #include<bits/stdc++.h>
using namespace std;
long long N;
long long x[1005];
long long y[1005];
int main(){
cin >> N;
bool ok = true;
for(long long i = 0; i < N; i++){
cin >> x[i] >> y[i];
if(i != 0){
if((abs(x[0]) + abs(y[0]))%2 != (abs(x[i]) + abs(y[i]))%2){
ok = false;
}
}
}
if(!ok){
cout << -... | 0 | 40,134,606 |
#include <iostream>
int main()
{
int a,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{
std::cout << "a" << " == " << "b" << std::endl;
}
return 0;
} | #include <cstdio>
void printFrame(int x, int y) {
int i, j;
for(i=0;i<y;i++) printf("#");
printf("\n");
for(i=2;i<x;i++) {
printf("#");
for(j=2;j<y;j++) printf(".");
printf("#\n");
}
for(i=0;i<y;i++) printf("#");
printf("\n\n");
}
int main() {
int x=-1, y=-1;
... | 0 | 23,626,986 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
struct UnionFind {
vector< int > data;
UnionFind(int sz) {
data.assign(sz, -1);
}
bool unite(int x, int y) {
x = find(x), y = find(y);
if(x == y) return (false);
if(data[x] > data[y]) swap(x, y);
data[x] += data[y];
d... | 0 | 49,013,196 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include <fstream>
#include<string>
#include<sstream>
#include<algorithm>
#include<bitset>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<iomanip>
#include <functional>
#include <m... | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | 0 | 86,464,896 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,P;
cin>>N>>P;
int64_t Z=0,E=1,O=0;
for(int i=0;i<N;i++){
int a;
cin>>a;
if(a%2==0){
E*=2;
}
else{
O++;
}
}
int64_t Q=E;
for(int64_t i=1;i<=O+1;i++){
P=(P^1);
if(P){
Z+=Q;
}
Q*=O+1-i;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
using P = pair<int, int>;
int main() {
ll h, w; cin >> h >> w;
if(h%3==0 || w%3==0){
cout << 0 << endl;
return 0;
}
dump(h);
ll ht = h/... | 0 | 30,699,164 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, H, W;
vector<ll> A, B;
int main() {
cin >> N >> H >> W;
A.resize(N); B.reserve(N);
rep(i, N) cin >> A[i] >... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 0 | 83,848,774 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int f(int x){
if(x%2 == 0) return x/2;
else return 3*x + 1;
}
int main(){
int s;
cin >> s;
const int I... | #include<bits/stdc++.h>
using namespace std;
vector< int >apply(const vector< int >&v) {
int n = v.size();
vector< int >cu(n, 0);
for (int i = 0; i < n; i++) {
int l = max(i-v[i], 0);
int r = min(i+v[i], n-1);
cu[l]++;
if (r+1 < n) cu[r+1]--;
}
for (int i = 1; i < n; ... | 0 | 38,196,329 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=15;
char s[N+9];
int n;
void into(){
scanf("%s",s+1);
n=strlen(s+1);
}
int ans;
void Get_ans(){
ans+=15-n;
for (int i=1;i<=n;++i) ans+=s[i]=='o';
}
void work(){
Get_ans();
}
void outo(){
puts(ans>=8?"YES":"NO");
}
int main(){
i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 40,408,419 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n,count = 0,ans = -1,flag;
cin>>n;
for(int i = 1;i<=n;i++)
{
count = 0;
int temp = i;
while(temp%2 == 0 && temp != 0)
{
count++;
temp = temp/2;
}
if(count ... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
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; }
const int64_t INF = 1LL << 60;
int main() {
int64_t A,B,K;
cin>... | 0 | 54,580,222 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int A, B, K;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> A... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define VL vector<lol>
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ... | 0 | 48,756,824 |
#include <iostream>
#include <vector>
#include <climits>
using namespace std;
typedef long long ll;
vector<int> v;
ll dfs(ll i, ll N, ll K, ll *a, ll m) {
if (i == N) {
if (v.size() < K)
return 999999999999;
return 0;
}
ll ans;
if (a[i] <= m) {
v.push_back(i);
... | #include<iostream>
#include<cstring>
using namespace std;
int data[10][6]={
{5,'.',',','!','?',' '},
{3,'a','b','c',0,0},
{3,'d','e','f',0,0},
{3,'g','h','i',0,0},
{3,'j','k','l',0,0},
{3,'m','n','o',0,0},
{4,'p','q','r','s',0},
{3,'t','u','v',0,0},
{4,'w','x','y','z',0}
};
int main(){
int n;
cin>... | 0 | 30,793,808 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define reps(i,s,n) for (int i = (s); i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n[3];
cin >> n[0];
cin >> n[1];
cin >> n[2];
sort(n, n + 3);
int diff = 2 * n[2] - n[1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
int N, K;
long long a[5010];
bool dp1[5010][5010], dp2[5010][5010];
vector<int> acc[5010];
int main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> N >> K;
rep(i, N) cin >> a[i];
dp1[0][0] = ... | 0 | 79,225,028 |
#include<bits/stdc++.h>
using namespace std;
using lint = long long;
typedef pair<lint, lint> P;
vector<lint> dist;
const lint INF = 1e18;
struct edge{lint to, cost;};
vector<edge> G[100010];
void dij(lint start){
priority_queue<P, vector<P>, greater<P> > que;
for(lint i = 0; i < dist.size(); i++) dist[i] = INF;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000000
#define MOD 1000000007
#define all(v) v.begin(),v.end()
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int kaijo[222222];
struct edge{int to,c... | 0 | 16,030,770 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | #include <iostream>
#include <queue>
using namespace std;
int c[101][102],ch[101];
queue<int> q;
int main(){
int a,b,e,d,n,k;
cin>>a;
for(int i=1;i<=a;i++)ch[i]=-1;
for(int i=0;i<a;i++){
cin>>b>>e;
c[b][0]=e;
for(int j=1;j<=e;j++){
cin>>d;
c[b][j]=d;
}
}
q.push(1);
ch[1]=0;
w... | 0 | 15,330,675 |
#include <iostream>
#include <ctime>
#define ESP 1e-10
using namespace std;
int main() {
bool flag = false;
time_t c1;
while (true) {
int H, W; cin >> H >> W;
if (!flag) { c1 = clock(); flag = true; }
if (H == 0 && W == 0) break;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W;j++) {
cout << "#";
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 53,350,308 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f)... | 0 | 5,417,080 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<string> s(N);
for (int i=0; i<N; i++){
cin >> s.at(i);
}
cin >> M;
vector<string> t(M);
for (int i=0; i<M; i++){
cin >> t.at(i);
}
vector<int> count(N);
for (int i=0; i<N; i++){
for (int j=i; j<N; j++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N = 0;
cin >> N;
vector<ll> A(N,0);
for(ll i = 0; i < N; i++) {
cin >> A.at(i);
}
map<int, int> m;
int ans = 0;
for(int i = 0; i < N; i++) {
for(int j = -1; j < 2; j++) {
if(!m... | 0 | 3,637,009 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int d1,d2,d3,d4,d5,d6;
int x1,x2,x3,x4,x5,x6;
cin>>x1>>x2>>x3>>x4>>x5>>x6;
d1=x1,d2=x2,d3=x3,d4=x4,d5=x5,d6=x6;
int m1,m2,m3,m4,m5,m6;
int a,x,y;
cin>>a;
for(int i=0;i<a;i++)
{
d1=x1;d2=x2;d3=x3;d4=x4;d5=x5;d6=x6;
m1=d1;m2=d2;m3=d3;m4=d4;m5=d5;m6=d6;
cin>>x>>y;
f... | #include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#define fail return puts("-1"), 0
const int N = 1e5 + 5, M = 2e5 + 5;
int n, tot, lnk[N], ter[M], nxt[M], sz[N], fa[N];
long long dep[N], d[N], D[N];
std::map<long long, int> mp;
void add(int u, int v) {
ter[++tot] = v, nxt[tot] = lnk[u], lnk[u] ... | 0 | 34,299,771 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(){
double a,b;
cin >> a >> b;
ll ans=0;
if(a==1||b==1){
cout <<"1" <<endl;
return 0;
}
double calc =floor(a/2)*b;
ans = calc;
if(fmod(a,2) != 0){
ans += ceil(b/2);
}
cout... | #include <bits/stdc++.h>
using namespace std;
template<typename T> T combination(int n, int r) {
T ans = 1;
for (int i = 0; i < r; i++) {
ans *= n - i;
}
for (int i = 1; i <= r; i++) {
ans /= i;
}
return ans;
}
int main() {
int N;
map<string, int> M;
cin >> N;
for... | 0 | 37,955,048 |
#include <bits/stdc++.h>
using namespace std;
#define froop1(a,n) for(int i = a;i < n;i++)
#define froop2(a,n) for(int i = a;i > n;i--)
int main(){
long long N,tickets;
cin >> N >> tickets;
priority_queue<long long> pq;
froop1(0,N){
long long a;
cin >> a;
pq.push(a);
}
froop1(0,tickets){
long ... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(){
int N;
cin >> N;
vector<ll> A(N),cnt(60);
ll x = 0;
for(int i=0;i<N;i++){
cin >> A[i];
x ^= A[i];
}
for(int i=0;i<N;i++) A[i] &= ~x;
int r = 0;
for(int j=59;j>=0;j--){
... | 0 | 8,176,216 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const LL INF = 0x3f3f3f3f3f3f3f3fLL;
const LL MOD = 1e9 + 7;
void solve(int u, int p, auto &G, auto &dp) {
for (auto &v : G[u]) {
if (v == p)
continue;
solve(v... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n,k,x=-2,y=2000000,m;map<ll,ll>ml;
cin>>n>>m;
vector<pair<ll,ll>>v;
for(int i=1;i<=m;i++){
ll a,b;
cin>>a>>b;
v.push_back(make_pair(a,b));
}
sort(v.begin(),v.end());
for(int i=0;i<v.... | 0 | 36,726,260 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef pair<int,int> PI;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL,LL> PLL;
typedef unsigned long long ULL;
typedef pair<double,double> PD;
#define FOR(x, b, e) for(int x = b; x<= (e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,K;
cin >> A >> B >> K;
int count = 0;
while(true){
if (A%2 == 1){
A = A - 1;
B = B + A / 2;
A = A / 2;
}
else{
B = B + A / 2;
A = A / 2;
}
co... | 0 | 60,681,777 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
signed main() {
string a;
cin >> a;
for (int b = a.length() - 1; b != -1; b--)cout << a[b];
cout << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
ll x;
cin >> x;
x -= i + 1;
a[i] = x;
}
sort(a.begin(), a.end());
ll b = a[(n % 2 == 1 ? (n - 1) / 2 : n / 2 - 1)];... | 0 | 68,067,887 |
#include<iostream>
#include<cmath>
#include<vector>
#include<set>
#include<algorithm>
#include<tuple>
#include<utility>
#include<cctype>
#include<climits>
#include<map>
#include<queue>
#include<functional>
#include<stack>
#include<iomanip>
#include<sstream>
#include<bitset>
using namespace std;
#define REP(i,a,n) for(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,m;cin>>n>>m;
vector<vector<char>> a(n,vector<char>(n)),b(m,vector<char>(m));
rep(i,n)rep(j,n)cin>>a[i][j];
rep(i,m)rep(j,m)cin>>b[i][j];
rep(i,n... | 0 | 76,736,453 |
#include <iostream>
#include <cstdlib>
#include <queue>
#include <cstring>
using namespace std;
typedef long long ll;
const int N=500010;
char c[N];
int ru[N],ans[N],hed[N],ver[N],nex[N],tot;
ll sum;
queue<int> q;
void add(int x,int y)
{
tot++;
ver[tot]=y;
nex[tot]=hed[x];
hed[x]=tot;
}
int main()
{
int i,x,y;
... | #include <bits/stdc++.h>
using namespace std;
#define println(msg) cout << msg << endl
#define yes_or_no(flag) if (flag) { println("Yes"); } else { println("No"); }
#define sort_vec(vec) sort(vec.begin(), vec.end())
#define rsort_vec(vec) sort(vec.rbegin(), vec.rend())
int main() {
int N;
cin >> N;
vector<string... | 0 | 31,442,175 |
#include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << endl
#define Int int64_t
#define fi first
#define se second
Int INF = 1e18;
Int mod = 1e9+7;
int main() {
Int n, l;
cin >> n >> l;
vector<Int> a(n + 1);
for (Int i = 1; i <= n; i++) {
cin >> a[i];
}
Int index = ... | #include <bits/stdc++.h>
int main(){
int N;
std::cin >> N;
std::vector< int > A(N);
for(int i=0; i<N; i++){
std::cin >> A[i];
}
std::vector< bool > b(N, false);
std::vector< bool > s(N, false);
int best = 1e9;
bool up = false;
for(int i=0; i<N; i++){
if(!up && bes... | 0 | 70,138,237 |
#include <cstdio>
main(){
int a[4],b[4],ar,br;
scanf("%d%d%d%d",a,a+1,a+2,a+3);
scanf("%d%d%d%d",b,b+1,b+2,b+3);
ar=*a+a[1]+a[2]+a[3],br=*b+b[1]+b[2]+b[3];
printf("%d\n",ar>br?ar:br);
} | #include <array>
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void dfs(int32_t H, int32_t W, array<array<char, 20>, 20> &tiles, array<array<bool, 20>, 20> &visited, int32_t i, int32_t j, char index)
{
visited[i][j] = true;
tiles[i][j] = index;
for (int32_t l = -1... | 0 | 87,926,194 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
string o;
set<string> d;
for (int i = 1; i <= n; i++... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 3,452,430 |
#include "bits/stdc++.h"
using namespace std;
class HandV {
private:
int h, w, k;
int black = 0;
int ans = 0;
vector<string> board;
vector<int> hBlack;
vector<bool> hDrawn;
public:
HandV(int _h, int _w, int _k) {
h = _h;
w = _w;
k = _k;
board = vector<string>(h);
hBlack = vector<int>(h, 0);
hDrawn = ... | #include <iostream>
#include<cmath>
using namespace std;
int main()
{
double a, b, k;
cin >> a >> b >> k;
double vol = a * a * b;
double pi = acos(-1);
double d = atan(b / a);
if (vol / 2 < k) {
int amari = vol - k;
double ans = atan(amari*2.0 / (a * a * a));
printf("%.10... | 0 | 49,220,127 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
double pi=acos(-1);
#define ll long long
#d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 43,784,403 |
#include <iostream>
using namespace std;
int main() {
int n,t_p=0,h_p=0;
string taro,hanako;
cin>>n;
while (n!=0){
cin>>taro>>hanako;
if(taro==hanako){t_p++;h_p++;}
else taro>hanako? t_p+=3 : h_p+=3;
n--;
}
cout<<t_p<<" "<<h_p<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int K;
string S;
cin>>K;
cin>>S;
for(int i= 0; i < S.length(); i++){
if(i>=K){
cout<<"...";
break;
}else{
cout<<S[i];
}
}
} | 0 | 39,492,384 |
#include <bits/stdc++.h>
using namespace std;
#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 all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | 0 | 57,405,458 |
#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>;
const int INF = 1 << 30;
int fr[100002];
int main() {
int n;
cin >> n;
rep(i, n) {
int a; cin >> a;
a--;
fr[i] = a;
}
ll cnt = 0;
rep(i, n) {
int j = fr[i];
if (... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(x, arr) for (auto& x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end... | 0 | 65,649,368 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
bool flag = false;
int legs = 0;
for(int i=0; i<=X; i++){
int j = X-i;
legs = 2*i + 4*j;
if(legs == Y){
flag = true;
break;
}
}
if(flag)
cout << "Yes" << endl;
else
cout << "No" << end... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | 0 | 55,117,104 |
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using intl = int64_t;
using graph = vector<vector<int> >;
int main(){
int ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
#endif
ll n,m;
cin>>n>>m;
vector<ll> a(n);
for(int i=0;i<n;i++)
{
cin>>a[i];
a[i]=a[i]/2;
}
ll lcm=a[0];
ll pre... | 0 | 19,988,911 |
#include <bits/stdc++.h>
#include <iostream>
#include <utility>
#include <string>
#include <vector>
#define MAX_N 100001
#define MOD 1000000007
#define FOR(i, a, b) for(ll i=a; i<b; i++)
#define REP(i, n) for(ll i=0; i<n; i++)
#define RER(i, n) for(ll i=n-1; i>=0; i--)
#define ALL(v) v.begin() v.end()
#define pb push_... | #include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <bitset>
typedef long long ll;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
const int MAX = 510000;
const int MOD = 1000000007;
const int MAX_N = 200000;
int ctoi(const char c){
switch(c){
... | 0 | 66,191,046 |
#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() {
double n, m;
cin >> n >> m;
vector<double> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end(), greater<int>());
double s = accumulate(a.begin(... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (... | 0 | 68,927,590 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.