code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int b[10],k[10],i,v1,v2;
double h;
while (scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d",&b[0],&b[1],&b[2],&b[3],&b[4],&b[5],&b[6],&b[7],&b[8],&b[9],&v1,&v2)!=EOF) {
k[0]=b[0];
for (i=1;i<10;i++) k[i]=k[i-1]+b[i];
h=(double)k[9]*v1/(v1+v2... | // God put a smile upon your face <3
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug p... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n ;
cin >> n ;
string s , t ;
cin >> s >> t ;
deque<char> S , T ;
rep(i,n){
... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
ty... | #define _GLIBCXX_DEBUG
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<string>
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define rep2(i,s,n) fo... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 100000000;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
int count = 0;
if (x % 2 != 0)
ans = 0;
while (x % 2 == 0) {
x /= 2;
count++;
}
ans = min (ans,count... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i,N){
cin >> A[i];
}
ll color1 = ... | 0 |
/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAj... | #include <iostream>
#include <algorithm>
#include <vector>
typedef long long ll;
using namespace std;
ll x[100010];
int a[100010], nsw[100010], now[100010], vid[100010], vnum[100010], repl[100010];
bool looked[100010]={};
vector<vector<int>> v;
int main() {
int N;
cin >> N;
for(int i=0; i<N; ++i) cin >> x[i];
int... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
void Trace( int *A, int N, int cnt){
//?????????????????????????????????N-1??¨??????
for (int i = 0; i < N - 1; i++){
printf("%d ", A[i]);
}
printf("%d\n", A[N - 1]);
printf("%d\n", cnt);
}
int BubbleSort(int *A, int N){
int cnt = 0;
fo... | #include <iostream>
#include <string>
#include <stdio.h>
#define N 1000
using namespace std;
int main()
{
int n;
int s;
string str;
cin >> n;
cin.ignore();
for(int i = 0; i < n; i++)
{
getline(cin,str);
for(s = 0; s < N; s++){
if(str[s] == 'H' && str[s+1] =='o' && str[s+2] == 's' && str[s+3] == 'h' ... | 0 |
#include <iostream>
using namespace std;
char solve(int m,int e,int j){
if( m == 100 || e == 100 || j == 100 )
return 'A';
if( (m+e)>=180 || (m+e+j)>=240)
return 'A';
if( (m+e+j)>=210 || ( (m+e+j)>=150 && (m>=80||e>=80) ) )
return 'B';
return 'C';
}
int main(){
int n,m,e,j;
while( cin >> n , n ){
for(in... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#define MAXN 10010
using namespace std;
struct Edge
{
int point1;
int point2;
int weight;
};
bool cmp(Edge &x, Edge &y)
{
return x.weight < y.weight;
}
int pre[MAXN];
vector <Edge> vec;
int find(int x)
{//并查集
int root = x;
while (pre[... | 0 |
//include
//------------------------------------------
#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 <... | #include <iostream>
#include <vector>
using namespace std;
typedef vector <int> VI;
typedef vector <VI> VVI;
const int dx[5] = { 0, 0, 0, 1, -1 };
const int dy[5] = { 0, 1, -1, 0, 0 };
int w, h;
int sx, sy, gx, gy;
VVI M;
int answer;
//==================================================
// Tõ
//==================... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,ans;
string s,t;
cin>>n>>s>>t;
ans=n;
for(int i=0;i<n;i++){
if(s.substr(i)==t.substr(0,n-i))break;
ans++;
}
cout<<ans<<endl;
}
| #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int max_a = *max_element(a.be... | #include <iostream>
#include <algorithm>
using namespace std;
const long long mod = 1e9 + 7;
const int inf = 1e5 + 9, maxn = 2e2 + 9;
long long dp[maxn][inf], s[inf];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, x;
cin >> n >> x;
for (int i = 0; i < n; i++) {
... | 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, vector<ll>> P;
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 ... | 0 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
template<class T>bool chmax(T &a, const T &b) { return (a<b... | #include <iostream>
#include <vector>
//---------------------------------------------------------------------------
enum TSquareState
{
ssPlaceable,
ssAttacked,
ssQueen
};
typedef std::vector<std::vector<TSquareState> > TBoard;
//---------------------------------------------------------------------------
TBoard P... | 1 |
#include <string>
#include <iostream>
using namespace std;
int main()
{
string s;
getline(cin, s);
while (getline(cin, s)) {
string::size_type b = 0, e;
do {
e = s.find("Hoshino", b);
if (e != string::npos) {
s[e+6] = 'a';
}
b = e + 1;
} while (e != string::npos);
cout <<... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a;
string str,Hoshino="Hoshino";
cin>>n;
getline(cin,str);
for(int i=0;i<n;i++){
getline(cin,str);
for(int j=0;str[j]!='\0';j++){
if(str[j]=='H'){
for(int k=j;k<7+j;k++){
i... | 1 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n,a,b,c=0;
string s1[3],s2[1];
char str1[11];
cin >> s1[0] >> n;
for(int i=0;i<n;i++){
cin >> s1[1] >> a >> b;
if(s1[1] == "replace"){ // 置き換え
cin >> s2[0];
for(int j=a;j<=b;j++){
s1[0][j]=s2[0][c];
c++;
... | #include <bits/stdc++.h>
using namespace std;
# define ll long long
# define VI vector<int>
# define VLL vector<ll>
# define PII pair<int,int>
#define mp make_pair
#define pb push_back
# define PI acos(-1)
# define ld long double
const int MxN = 200001 ;
# define FOR(i,a,b) for(int i = a ; i < b ; ++i)
# define RFO... | 0 |
#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;
u... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int a, b;
cin >> a >> b;
b*=2, b-=a;
cout << b;
}
| 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int MAXN = 1000000 + 1000;
int n;
char s[MAXN], t[MAXN];
void no()
{
cout << -1 << endl;
exit(0);
}
vector<int> sp, ri;
void init()
{
int p = n;
for(int i = n; i >= 1; ... | #include <vector>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 1001000
#define pb push_back
int n,ans,pos[N],sum[N];
char s[N],p[N];
vector<int>ve[30];
vector<int>::iterator it;
int p1[N],p2[N],m;
bool check(int x)
{
for(int i=1;i+x<=m;++i)
if(p1[i+x]-x<p2[i])
return ... | 1 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(),... | //In The Name of Allah
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define Mp make_pair
typedef pair < int , int > pii;
const int N = 2e5 + 10;
int mark[N], cmp[2][N];
vector < int > adj[2][N];
map < pii , int > mp;
void dfs(int v, int t, int c){
mark[v] = 1;
cmp[t][v] = c;
for ... | 0 |
#include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mpcy(a, b) memcpy(a, b, sizeof(a))
#define rg register
using namespace std;
typedef long long LL;
const int MAXN = 100005;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdigit(c... | #include <iostream>
#include <string>
using namespace std;
int main(){
int num_battle;
int a, b;
int point_a = 0;
int point_b = 0;
string cards;
cin >> num_battle;
for(; num_battle != 0;){
while(num_battle > 0){
cin >> a >> b;
if(a == b){
point_a += a;
point_b += b;
}else if(a > b){
po... | 0 |
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define V vector
#define RE return
#define ALL(a) a.begin(),a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FIL... | #include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
int main(){
ll n;
cin>>n;
ll a[n],b[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
reverse(b,b+n);
ll j=0;
for(int i=0;i<n;i++){
if(a[i]==b[i]){
for(;j<n;j++){
if(a[i]!=b[j] && a[j]!=b[i]){
s... | 0 |
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int a;
cin>>a;
a=a+pow(a,2)+pow(a,3);
cout<<a;
}
| #include <bits/stdc++.h>
#define ms(a) memset (a , 0 , sizeof a)
#define rr(i, a, b) for(register int i=a;i<=b;++i)
#define re(i, a, b) for(register int i=a;i>=b;--i)
#define reps(s) for(register int i=head[s];i;i=Next[i])
typedef long long ll ;
#define v(int) vector <int>
#define pb push_back
#define pp push
#define... | 1 |
#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<ll,ll>;
using vec = vector<ll>;
using vecp = vector<P>;
using mat = vector<vec>;
using matp = vector<vecp>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define all(v) v.begin(), v.end()... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, n) for(int i = 1; i <= n; i++)... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,sum;
cin>>a>>b>>c>>d;
if(a>b && c>d)
sum=b+d;
else if(a>=b && c<=d)
sum=b+c;
else if(a<=b && c<=d)
sum=a+c;
else if(a<=b && c>=d)
sum=a+d;
cout<<sum<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
double n, x, t;
cin>>n>>x>>t;
double t1 = ceil(double(n/x));
//cout<<n/x<<endl;
//cout<<t1<<endl;
ll t11 = ll(t1)*ll(t);
cout<<t11<<endl;
}
| 0 |
#include <iostream>
using namespace std;
int main() {
int n;
while(1){
cin >> n;
if(n == 0) break;
int num[10000][2] = {};
int score[2] = {};
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < 2; ++j){
cin >> num[i][j];
}
if (num[i][0] > num[i][1])
... | #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>
using namespace std;
int main()
{
int n;
int a[10000], b[10000];
while (cin >> n,n) {
int A = 0;
int B = 0;
for (int i = 0; i < n; i++) {
cin >> a[i] >> ... | 1 |
#include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <random>
#include <fun... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define int long long
using namespace std;
const ll INF = 1e18;
const ll MOD = 998244353;
int basis[100];
int cnt = 0;
void insert(int mask) {
for(int i = 61; i >= 0; i--) {
if(!(mask&(1ll << i))) continue;
if(basis[i] == 0) {
basis[i] = ma... | 0 |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define fi first
#define si ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep2(i,a,n) for(int i = (a);i < (n);i++)
#define rep(i,n) rep2(i,0,n)
int main(void){
int n,m,q;cin >> n >> m >> q;
vector<vector<int>> s(n+2,vector<int>(n+2,0));
int num[575][770] = {};
rep(i,m){
int l,r;cin >> l >... | 1 |
#include<bits/stdc++.h>
#define N 200005
#define reg register
#define LL long long
using namespace std;
int val,cnt;
int n,a[N],b[N];
vector<int> p,q;
inline int qr()
{
int x=0,w=1;char a=0;
while(a<'0'||a>'9'){if(a=='-')w=-1;a=getchar();}
while(a<='9'&&a>='0'){x=(x<<3)+(x<<1)+(a^48);a=getchar();}
return x*w;
}... | #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;
const int inf = 1001001001;
int main(){
int n;
cin >> n;
vector<int> a(n), b(n), aa(n+1,0), bb(n+1,0);
rep(i,n) {
cin >> a[i];
aa[a[i]]++;
}
rep(i,n) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pii pair < int, int >
#define pb push_back
#define ll long long
#define int ll
const int inf = (int)1e18 + 7;
pii ar[5234];
int dp[5234];
int x;
bool comp (const pii &a, const pii &b) {
return a.fr + a.sc < b.fr + b.sc;
}
... | #include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#defin... | 0 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);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 PB push_back
#define INF INT_MAX/3
#define ALL(a) (a).begin(),(a).end()
#define CLR(a) memset(a,0,sizeof(a))
... | #include<iostream>
using namespace std;
#define MEMO_MAX 100
typedef unsigned long long ULL;
bool Flag_memo_g = true; //?????¢??????????????????
class Answer
{
public:
Answer()
{
day = 10; year = 365;
for(int i = 0; i < MEMO_MAX; i++)
{
memo[i] = 0;
Flag_memo[i] = false;
}
}
int N; //??\???
int ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int n;
cin >> n;
vector<int> x(n), y(n), per(n);
rep(i, n) cin >> x[i] >> y[i];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
//定数
#define INF 1000000000 //10... | 1 |
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
const int di[]={-1, 0, 1, 0}, dj[]={0, -1, 0, 1};
bool is_valid(const vector<size_t> &q, size_t r) {
for (size_t j=0; j<8; ++j)
if (j!=r && q[j]==q[r])
return false;
for (size_t i=0; i<r; ++i) {
if (q[i... | #include<bits/stdc++.h>
using namespace std;
// macro
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
// code starts
vector<int> part_ans(0);
vector<int> t_ans;
bool fin=false;
int last=-1;
vector<int> topo_sort1(vector<vector<int>> e)
{
int n=e.size();
vector<int> ans(0)... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long double;
int main() {
double n, k;
cin >> n >> k;
vector<ll> arr(n);
for (int i = 0; i < n; i++) {
ll x; cin >> x;
arr[i] = (x + 1.0) / 2.0;
}
ll ans = 0;
for (int i = 0; i < k; i++) ans += arr[i];
ll temp = ... | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, k, ans = 0, prt[N];
vector<int> g[N];
int dfs(int u, int fa) {
int res = 0;
for (auto v : g[u]) {
res = max(res, dfs(v, u));
}
if (res == k - 1 && fa != 1) {
res = -1;
ans++;
}
return res + 1;
}
int main() {
scanf... | 0 |
#include<bits/stdc++.h>
#define REP(i, n) for(int i=0; i<n; i++)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return tr... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int x[n],i=0;
int z=0;
for (;i<n;i++){
cin>>x[i];
if(z==0&&i>0){
int j=i-1;
if(x[j]==x[i]||x[j-1]==x[i])
z++;
}
}
if(z==0){
sort(x,x+n);
int j=n-1;
int m=n/2+1;
int k=n/2-1;
for (int i=0;i<n/4+2;i++){
if(x[i+1]==x[i]||x[j]==x[j-1]||x[m]==x[m-1]||... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const int MAX_N = 2005;
ll sil[MAX_N * MAX_N], odw[MAX_N * MAX_N], DP[MAX_N][MAX_N];
ll pot(ll a, ll b) {
ll result = 1;
while(b > 0) {
if(b % 2 == 1) {
result = (result * a) %... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 4e6 + 10, M = 2e3 + 10, MOD = 1e9 + 7;
int fac[N], inv[N], dp[M][M], ps[M][M];
int sum(int a, int b) {return (a + b) % MOD;}
int mul(int a, int b) {return (a * b) % MOD;}
int Pow(int a, int b)
{
int res = 1;
for (; b; b>>=1, a =... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans=0;
for(int i=0;i<s.size()-1;i++){
if(s.at(i)=='A'&&s.at(i+1)=='C') ans++;
}
if(ans>=1) cout << "Yes";
else cout << "No";
} | #include <bits/stdc++.h> //万能头文件
using namespace std;
int main()
{
string a;
int pos=0; //记录位置
cin>>a;
a=a+"D"; //为防止最后一个字母是"A",添加一个不是"C"的字母
while(1)
{
pos=a.find("A",pos); //find()函数查找位置
if(pos<0) //如果没找到，返回-1
{
cout<<"No"<<endl; //endl养成好习惯
break; //跳出循环
}
if(a[pos+1]=='C') //判断"... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, a, b;
int main() {
while(cin >> n >> m, n) {
vector<vector<int> > G(n);
for(int i = 0; i < m; i++) {
cin >> a >> b; a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> d(n, -1); d[0] = 0;
queue<int> que; que.push(0);
while(!que.empt... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
while(1)
{
int n,m,a[10000],b[10000],lis1[500],lis2[500],x=0,y,z,cnt=0;
cin>>n>>m;
if(n==0&&m==0)break;
for(int i=0;i<m;i++)
{
y=0;
cin>>a[i... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
#define int long long
const int INF = 1e18;
long long d;
unsigned long long ans;
unsigned long long p[50];
map<int, int> kek[2];
void check(long long d, int L, int R, unsigned long long cnt)
{
if (L >= R)
{
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,Y,x,y,z;
cin >> N >> Y;
int check = 0;
for(x=0;x<=N;x++){
for(y = 0;y <=N;y++){
z = N-x-y;
if(z >= 0 && Y == 10000*x+5000*y+1000*z){
check = 1;
break;
}
}
if(check)break;
... | 0 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<pii> VP;
typedef priority_queue<int> ... | 0 |
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <math.h>
#include <utility>
#include <algorithm>
#include <functional>
#include <vector>
#include <numeric>
#include <bits/stdc++.h>
#define int long long
struct edge {
int to;
int cost;
};
using namespace std;
using vi = vector<int>;
using v... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
for(int i=0;i<9;i++){
int A=100*(i+1)+10*(i+1)+i+1;
if(N<=A){
cout << A << endl;
break;
}
}
}
| 0 |
#include <stdio.h>
#include <algorithm>
using namespace std;
using ll = long long;
int n, a[500010], ca[500010];
ll czero[500010], dp[1 << 20][2], last[1 << 20], mod = 1e9+7;
void zero() {
for (int i = 0; i < (1 << 20); i++)
dp[i][0] = 1, last[i] = 0;
for (int i = 1; i <= n; i++) {
czero[i] = czero[i - 1];
if ... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
lli rec(int l, int r, vector<int> &A) {
if(r-l <= 1) return 0;
int m = (l+r)/2;
lli res = rec(l, m, A) + rec(m, r, A);
queue<int> a, b;
for(int i = l; i < m; ++i) a.push(A[i]);
for(int i = m; i < r; ++i) b.push(A[i]);
int k = l;
whil... | 0 |
#include <iostream>
int main(){
int a;
std::cin >> a;
a=a+a*a+a*a*a;
std::cout << a << std::endl;
}
| #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define MAX 1000001
ll prime[MAX];
#define mod 1000000007
ll rec(vector<vector<ll> >& dp,vector<ll>& arr,int n,int i,int k,int w)
{
ll ans=0;
if(i>=n)
return 0;
if(dp[i][k]!=-1)
... | 1 |
#include<stdio.h>
int main(void)
{
int i,num[100],a,j;
scanf("%d",&a);
for(i=0;i<a;i++){
scanf("%d",&num[i]);
}
for(j=a-1;j>=0;j--){
if(j>0&&j<=a-1){
printf("%d ",num[j]);
}
else{
printf("%d\n",num[0]);
}
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
int input()
{
int value;
std::cin>>value;
return value;
}
int main()
{
std::vector<int> vec;
int n;
std::cin >> n;
for(int i = 0;i<n;++i)
vec.push_back(input());
std::reverse(vec.begin(),vec.end());
for(auto i = 0;i... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
ll r = 0, g = 0, b = 0;
for (const auto& c : s) {
if (c == 'R')
r++;
else if (c == 'G')
g++;
else
b++;
}
ll ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define COUNT(V,X) upper_bound((V).begin(),(V).end(),X)-lower_bound((V).begin(),(V).end(),X)
#define ... | 0 |
#include<iostream>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
while(h != 0 || w != 0){
int ans[2],min=100000;;
ans[0]=1000;
ans[1]=1000;
int current=h*h+w*w;
int anstmp=current;
for(int i=1; i<10000; i++){
for(int j=i+1; j<10000-i; j++){
int tmp=i*i+j*j;
if(tmp > current || ... | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdio>
#include<cstdlib>
using namespace std;
struct Node{int key; Node *p,*l,*r;};
Node *null,*root;
void insert(int k){
Node *x,*y,*z;
y=null;
x=root;
z=(Node*)malloc(sizeof(Node));
z->key=k;
z->l=null;
z->r=null;
while(x!=null){
y=x;
i... | 0 |
#include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <map>
//#include <unordered_map>
//#include <unordered_set>
//#include <boost/container/static_vector.hpp>
//#include <boost/uno... | #include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<map>
using namespace std;
const int maxn=4e6+10;
int n,m,head[maxn*2],cnt,vis[maxn*2],dis[maxn*2],tot=200010;
struct edge
{
int next,to,quan;
} e[maxn*2];
priority_queue<pair<int,int> >q;
map<pair<int,... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int,int> pii;
const int maxn=2e5+7;
const ll modn=1e9+7;
const int inf=2e9+7;
const double PI = acos(-1.0);
const double eps=1e-8;
inline int lowbit(int x){return x&-x;}
inline ll l... | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
using base = complex<double>;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair... | 0 |
#include <vector>
#include <iostream>
#include <valarray>
#include <string>
#include <algorithm>
#include <set>
#include <cstdio>
typedef unsigned long long ull;
typedef long long ll;
#define fst first
#define snd second
#define rep(i,n) for(ull i = 0;i<(n);i++)
#define rep1(i,n) for(ull i = 1;i<=(n);i++)
#define revre... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
string v = "Vacant";
vector<string> s(n);
int l = 0;
int r = n-1;
cout << l << endl;
cin >> s[l];
if(s[l] == v) return 0;
cout << r << endl;
cin >> s[r];
if(s[r... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<double> VD;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1;... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 0 |
#include<iostream>
using namespace std;
int main(){
int n, num[10000];
int max = -1000000, min = 1000000;
long long sum = 0;
cin >> n;
for(int i = 0; i < n; i++){
cin >> num[i];
if(min > num[i]) min = num[i];
if(max < num[i]) max = num[i];
sum = sum + num[i];
}
cout << min << " " << max << " " << s... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;n>i;++i)
using namespace std;
using ll=int64_t;
using vi=vector<int>;
using VI=vector<ll>;
using vis=vector<string>;
using vvi=vector<vi>;
int main(){
string s;
cin>>s;
string hitachi="";
for(int i=0;5>i;++i){
hitachi+="hi";
if(hitachi... | 0 |
#include <bits/stdc++.h>
#define gc( ) std::getchar( )
#define pc( i ) std::putchar( i )
template < typename T >
inline T read( )
{
register T x = 0;
register char ch = gc( );
register bool f = 0;
while( !std::isdigit( ch ) )
{
f = ( ch == '-' );
ch = gc( );
}
while( std::isdigit( ch ) )
{
x = x * 10 + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
const ll MAX = 50;
ll N;
ll X[100005];
ll D[10000... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D;
cin >> A >> B >> C >> D;
if(A+B > C+D)
cout << "Left" << endl;
if(A+B == C+D)
cout << "Balanced" << endl;
if(A+B < C+D)
cout << "Right" <<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re register
#define il inline
#define inf 0x3f3f3f
#define maxn 1000005
int n, pos, ans, head, tail;
int q[maxn];
char s[maxn], t[maxn];
int main() {
scanf("%d%s%s", &n, s + 1, t + 1);
if (strcmp(s + 1, t... | 0 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#in... | #include <bits/stdc++.h>
typedef long long LL;
const int N = 2e3, M = 4e6, MOD = 1e9 + 7;
int n, k, f[N + 5][N + 5], fac[M + 5], ifac[M + 5];
inline void add(int &x, const int &y) {
(x += y) >= MOD && (x -= MOD);
}
inline int pow(int x, int k) {
int ans = 1;
for (; k > 0; k >>= 1, x = (LL)x * x % MOD) {
if (k ... | 0 |
#include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll A, ll B, ll C, ll D) {
cout << min(A,B) + min(C,D) << endl;
}
int main() {
ll A;
cin... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int AB[2], CD[2], value;
for(int i = 0; i < 2; i++)
cin >> AB[i];
for(int i = 0; i < 2; i++)
cin >> CD[i];
sort(begin(AB), end(AB));
sort(begin(CD), end(CD));
value = AB[0] + CD[0];
cout << value << "\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define A... | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <string>
#include <iomanip>
using namespace std;
int main(){
int h,w;
char c[400][400];
cin>>h>>w;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>c[i][j];
}
}
int dx[4]={-1,0,1,0};
int dy... | 1 |
#include<bits/stdc++.h>
#define ffr(i,a,b) for(i=a;i<b;i++)
#define ffrr(i,a,b) for(i=a;i<=b;i++)
#define ll long long int
#define pf printf
#define mp make_pair
#define mm(a,b) memset(a,b,sizeof(a))
#define pb push_back
#define MMAX 200005
using namespace std;
int minn(int a, int b)
{
if(a<b) return a; return b;... | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T>
bool chmin(T& a, T b) {
... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <utility>
#include <functional>
using namespace std;
#define LEN 1000000
char str[LEN];
int cnt[LEN];
int main() {
char ch;
int s = -1, ans = 0;
while (cin >> ch) {
if (str[s] != ch) {
s++;... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
using namespace std;
#define MAX 1000000010
int solve(string str){
int a[3] = {0, 0, 0}, ans = 0;
for(int i = 0;i < str.size();i++){
if(str[i] == 'J'){
if(a[1] || a[2])a[0] = a[1] = a[2] = 0;
if(!a... | 1 |
#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 all(x) (x).begin(),(x).end()... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<... | 1 |
#include <iostream>
using namespace std;
const int BASE = 6200;
int N, mod;
int dp[6009][12409][3];
long long ret[12409];
void solve(int p1, int p2) {
// 最大値を更新する場合
for (int i = 0; i <= 2; i++) {
int r = 0;
if (i == 0) r = -1;
if (i == 1) r = 1;
dp[p1][p2][0] += 1LL * dp[p1 - 1][p2 - r][i] % mod;
if (dp[p... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<int(n); i++)
using namespace std;
const int MAX = 7000;
// fac[]・・・a! finv[]・・・(a!)^(-1) inv[]・・・a^(-1)
long long N, M, ans, fac[MAX], finv[MAX], inv[MAX], two[MAX], six[MAX];
void pre_comb(void){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
tw... | 1 |
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <math.h>
#include <utility>
#include <algorithm>
#include <functional>
#include <vector>
#include <numeric>
#include <bits/stdc++.h>
// #include <atcoder/all>
#define int long long
struct edge {
int to;
int cost;
};
using namespace std;
// us... | #include<cstdio>
#include<iostream>
#include<ctype.h>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;
int main(){
int people[21], Total, Total2;
for (int i = 0; i < 20; i++){
cin >> people[i];
}
sort(people, people + 10,greater<int>());
sort(people + 10, people + 20,greater<int>());
T... | 0 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
... | 1 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr ll INF = (1LL << 60);
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
vector<ll> dp(2,... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a,b,c,k;
int64_t target;
int64_t remains;
cin >> a >> b >> c >> k;
target = max(a,max(b,c));
remains = a + b + c - target;
target = target * pow(2,k);
cout << target + remains << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll a;
cin>>a;
if(a==1){
cout<<"Hello World"<<endl;
return 0;
}
ll b,c;
cin>>b>>c;
cout<<b+c<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) pri... | 0 |
#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<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,x,n) for(ll i=x;i<n;i++)
#define sort(v) sort(v.begin(),v.end());
const ll mod = 1E9+7;
int main()
{
ll a,b,c;
cin>>a>>b>>c;
swap(a,b);
swap(a,c);
cout<<a<<" "<<b<<" "<<c;
} | #include <stdio.h>
#include <string.h>
int main (){
char d[14], e[14], f[14];
scanf ("%s %s %s", &d, &e, &f);
if ( d[strlen(d) - 1] == e[0] && e[strlen(e) - 1] == f[0]){
puts ("YES\n");
}else {
puts ("NO\n");
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
vector<string> a;
string hoge="hi";
a.push_back(hoge);
for(int i=0;i<4;i++){
hoge=hoge+"hi";
a.push_back(hoge);
}
for(int i=0;i<5;i++){
if(a[i]==s){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<en... | #include <bits/stdc++.h>
using namespace std;
char S[15];
int main(){
scanf(" %s", S);
int len = strlen(S);
if(len%2 != 0){
printf("No");
return 0;
}
for(int i = 0; i < len; i ++){
if(i%2 == 0 && S[i] != 'h'){
printf("No");
return 0;
}
... | 1 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main () {
int n;
vector<int> values;
cin >> n;
cin.ignore();
for (int i = 1; i <= n; i++){
string tmp_value;
if(i == n)
getline(cin, tmp_value);
else
getline(cin, tmp_value, ' ');
values.push_back(stoi(tmp_value... | #include<iostream>
using namespace std;
int main(){
int n, A[100];
cin >> n;
for ( int i = 0; i < n; i++ ) cin >> A[i];
for ( int i = n-1; i >= 0; i-- ) {
if ( i != n-1 ) cout << " ";
cout << A[i];
}
cout << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)... | 0 |
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main (void){
int r;
cin >> r;
if(2800 <= r){
cout << "AGC" << endl;
}else if(1200 <= r){
cout << "ARC" << endl;
}else{
cout << "ABC" << endl;
}
return 0;
}
| #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mi... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; ++i)
{
if (A % 2 == 1)
{
--A;
}
B += A / 2;
A = A / 2;
++i;
if (i >= K)
{
brea... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> AB(2);
for (int i=0;i<2;++i) cin >> AB[i];
int K; cin >> K;
for (int i=0;i<K;++i){
if (AB[i&1]&1) --AB[i&1];
AB[(i&1)^1]+=AB[i&1]/2;
AB[i&... | 1 |
#include <iostream>
//#include<stack>
#include<set>
#include<bits/stdc++.h>
using namespace std;
//int f[10005];
//int chazhao(int x)
//{
// if(x==f[x])
// return x;
// else
// return f[x]=chazhao(f[x]);
//}
int main()
{
set<int >ss;
int n,x;
cin>>n>>x;
ss.insert(x);
for(int i=1;i<n;i++)
{
cin>>x;
if(ss.cou... | #include <bits/stdc++.h>
#define Tayeb ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
using namespace std;
int main()
{
Tayeb;
int N,count=0;
cin >> N;
int arr[N];
for(int i=0; i<N; i++)
{
cin >> arr[i];
}
sort(arr,arr+N);
for(int i=1; i<N; i++)
{
i... | 1 |
#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... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n, i, a[210];
cin >> n;
n *= 2;
for (i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
int b = 0, c = 0;
for (i = 0; i < n; i += 2) {
b += a[i];
}
for (i = 1; i < n - 1; i += 2) {
c += a[i];
}
//c += a[0];
... | 0 |
#include <bits/stdc++.h>
using namespace std;
char s[101];
int main() {
int n;
while(scanf("%d",&n),n) {
vector<int> key;
for(int i=0;i<n;i++) {
int k;
scanf("%d",&k);
key.push_back(k);
}
scanf("%s",s);
for(int i=0;s[i]!='\0';i++) {
... | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S ... | 0 |
#include<stdio.h>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inc... | #include <iostream>
#include <sstream>
using namespace std;
int main(){
string result[3]={"HIT", "HOMERUN" , "OUT"};
string eventlist;
int inning,run;
int count = 0;
int score;
while(cin >> inning){
for(int i=0;i<inning;i++){
run = 0; score = 0;
for(count=0;count < 3;){
cin >> eventlist;
// cout ... | 1 |
#include<iostream>
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main(){
int n,sum=0;
cin>>n;
sum=n+(n*n)+(n*n*n);
cout<<sum;
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
int digit(long long int a)
{
int ans = 0;
while(a > 0){
a/=10;
ans++;
}
return ans;
}
int main() {
int i;
int count = 1;
long long int N, A = 1, B;
int ans = 15;
cin >> N;
while ((double)A <= sqrt((do... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pi M_PI
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(... | #include<bits/stdc++.h>
using namespace std;
const int MAX_N = 1 << 18;
#define int long long
typedef pair<int,int> P;
int n;
P dat[2*MAX_N-1];
void init(int n_){
n=1;
while(n<n_) n*=2;
for(int i=0;i<2*n-1;i++) dat[i].first=-1,dat[i].second=INT_MAX;
}
int query(int k){
k+=n-1;
P p=dat[k];
//cout<<k<<"/"<<da... | 1 |
#include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (ll i = 0; i < n; i++)
#define IREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define SENTINEL 2000000000
#define NIL -1
using namespace std;
typedef long long ll;
const ll MAX ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 1000000
#define MOD 1000000007
#define INF 100000000000000
vector<vector<pair<int,int>>> parent;
pair<int,int> find(pair<int,int> x){
pair<int,int> y=parent.at(x.first).at(x.second);
if(y!=x){
y=find... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
if(n == 0){
cout << 0 << '\n';
return 0;
}
int base = -2;
string ans;
while(n){
int r = n%base;
n = n/base;
if(r < 0) n++;
if(r < 0) r = r*(-1);
char x = r + '0';
ans = x + ans;
}
cout <<... | #include<iostream>
#include<cstring>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
#define MAX 500000
#define INF 2e9
int L[MAX/2+2],R[MAX/2+2];
long long cnt=0;
long long merge(int A[],int n,int left,int mid,int right)
{
long long cnt=0;
int n1=mid-left;
int n2=right-mid;
for(int ... | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <climits>
#include <utility>
typedef long long ll;
using namespace std;
const ll MOD = 998244353LL;
const ll MAX = 2000010LL;
ll fac[MAX], finv[MA... | #include <bits/stdc++.h>
#define arep(a,i,n) for(int i=(a);i<(n);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define cinf(x,n) for(int i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(int i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
... | 0 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1e6;
int n,s[N+1],t[N+1];
int hea=1,tai,que[N+1];
int res;
void input(int x[])
{
static char str[N+2];
scanf("%s",str+1);
for(int i=1;i<=n;++i) {
x[i]=str[i]-'a';
}
return;
}
bool check0()
{
for(int i=1;i<=n;++i) {
if(s[i]... | #include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
char s[N],t[N];
int n,ans,l=1,r,last,q[N];
int main(){
scanf("%d%s%s",&n,s+1,t+1),last=n;
for(int i=n;i;){
while(last&&(i<last||s[last]!=t[i])) --last;
if(!last) {puts("-1");return 0;}
while(l<=r&&q[l]-r+l-1>=i) ++l;
q[++r]=last;
if(i!=last) an... | 1 |
#define _DEBUG 1
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define dump3(x, y, z) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | 0 |
#include <cstdio>
#define my_abs(x) ((x) < 0 ? -(x) : (x))
int arr[3][100005], nxt[100005], rev[100005];
bool vis[100005];
int main()
try
{
// freopen("AGC006-E.in", "r", stdin);
int n;
scanf("%d", &n);
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < n; j++)
scanf("%d", arr[i] + j);
}
for (int i = 0; i < ... | #include<bits/stdc++.h>
using namespace std;
#define lowbit(x) (x&-x)
int num[4][100010],c0[300010],c1[300010],n;
inline int rd()
{
int x=0;char ch=getchar();
for (;ch<'0'||ch>'9';ch=getchar());
for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
return x;
}
inline void add0(int x) { for (;x;x-=lowbit(x)) c0[x]+... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int N;
cin >> N;
for (int i = N; i > 0; i--)
{
if (sqrt(i) == floor(sqrt(i))){
cout << i << endl;
return 0;
}
}
} | #include<iostream>
#include<string>
using namespace std;
int main(){
string str;
while(1){
getline( cin, str );
if( str.length()==0 ) break;
for( int i=0; i<=26; i++ ){
for( int j=0; j<str.length(); j++ ){
if( 'a'<=str[j] && str[j]<='z' ){
str[j]++;
if( str[j] == 'z'+1 )
str[j] = 'a';
... | 0 |
#include<cstdio>
#include<stdio.h>
#include<string>
#include<iostream>
#include<map>
using namespace std;
#include<algorithm>
bool two(int *a,int left,int right,int num){
while(left<right){
int mid=(left+right)/2;
if(a[mid]==num){
return true;
}
else if(a[mid]>num){
right=mid;
}
else if(a[mid]<num... | #include <algorithm>
#include <bits/stdc++.h>
#include <deque>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define INF 1LL << 40;
#define ll long long
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define prique priority_queue
typedef pa... | 1 |
#include<iostream>
#include<algorithm>
#include<cstring>
#define INF 111111111
using namespace std;
long int cost[1000][1000],ans[1000];
int memo[1000];
int n,k,m,a,b,c;
void solve(int s){
ans[a] = 0;
while(true){
int k = -1;
for(int i=1;i<=n;i++){
if(!memo[i] && (k == -1 || ans[i] < ans[k])) k = ... | #include<atcoder/all>
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<cmath>
#define REP(i,n) for (int i = 0; (i) < (n); ++ (i))
#define FOR(i,n) for (int i = 1; (i) <= (n); ++ (i))
#define dump(x) cout... | 0 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | //list index out of rangeエラー表示用
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep1(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main(){
int n;
cin >> n;
vector<int> l(n);
rep1(i, n){
cin >> l[i];
}
int ans = 0;
... | 0 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include <iostream>
#include <iomanip>
#include <map>
#include <list>
#include <set>
#include <vector>
#include <utility>
#include <algorithm>
#include <queue>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef unsigned long l... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
int ans=0;
cin >> A >> B;
for(int i=0;i<2;i++){
ans+=max(A,B);
if(max(A,B)==A){
A--;
}
else{
B--;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long n,ans=0,r[4001]={},g[4001]={},b[4001]={};;
string s;
cin >> n >> s;
rep(i,n){
if(s[i]=='R') r[i+1] = r[i] + 1;
else r[i+1] = r[i];
if(s[i]=='G') g[i+1] = g[i] + 1;
... | 0 |
#include <stdio.h>
int main(){
int year=0;
char str[5];
scanf("%d/%s",&year, &str);
printf("2018/%s", str);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; } //numの桁数を求める
int main()
{
string s;
cin >> s;
string ans;
rep(i, s.length()){
if(i == 3) ans += '8';
else ans += s[i];
... | 1 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
typedef pair<int,int> P;
#define MAX 10000
int is_prime[MAX+5];// 1:prime 0:not prime
int ans[MAX+5];
void eratos()
{
int i,j;
for(i=2;i<=MAX;i++)is_prime[i]=1;
for(i=2;i*i<=MAX;i++)if(is_prime[i]==1)
{
for(j=i*2;j<=... | #include <cstdio>
#include <cmath>
#define buf 10000
using namespace std;
int k=0;
int B[buf];
void Answer(int n);
int PrimeNumber(int n);
int main(void){
int i,n;
char str[buf];
for(i=2;i<buf;i++)
PrimeNumber(i);
for( ;fgets(str,sizeof(str),stdin)!=NULL; ){
sscanf(str,"%d",&n);
if(n==0) break;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
static const ll mod=1000000007;
ll modpow(ll x,ll y){
if(y==0)
return 1;
else if(y%2==0){
ll z=modpow(x,y/2);
return (z*z)%mod;
}else{
ll z=modpow(x,y/2);
return (x*((z*z)%mod))%mod;
}
}
ll H,W,A,B;
ll fac[200005];
ll rev[200005];
in... | #include <cstdio>
#include <algorithm>
#include <vector>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ... | 1 |
#include<bits/stdc++.h>
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define FOR(i, a, b) for (int i=a; i<b; i++)
#define F0R(i, a) for (... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n, m, dep[maxn];
bool vis[maxn];
vector<int> G[maxn];
int main() {
scanf("%d %d", &n, &m);
for (int i = 1, u, v; i <= m; i++) {
scanf("%d %d", &u, &v);
G[u].push_back(v), G[v].push_back(u);
}
long long s1 = 0, s... | 0 |
#include <cstdio>
#include <vector>
#include <map>
using namespace std;
#define N 8
int board[N][N];
vector< pair<int,int> > queen;
vector< pair<int,int> > sol_queen;
bool check(int k, int x, int y)
{
for(int i=0;i<k;i++)
{
int tx = queen[i].first;
int ty = queen[i].second;
if(x == tx) return false;
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N;
int A,B,C,D;
vector<pair<int,int> > P;
vector<int> R;
cin >> N;
P.push_back({1000000000,-1});
R.resize(N+1);
for(int i=1; i<=N; ++i) P.push_back({0,i});
for(int i=0; i<N*(N-1)/2;... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
constexpr ll mod = ll(1e9 + 7);
int main () {
ios::sync_with_stdio(0); cin.tie(0);
int TT = 1;
// cin >> TT;
while (TT--) {
ll n,h,w;
cin >> n >> h >> w;
--h;
--w;
cout << max(ll(0), ((n-h)*(n-w))) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e18;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N,H,W;
cin >> N >> H >> W;
cout << (N-H+1)*(N-W+1) << endl;
}
| 1 |
#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>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
#define int long long
int dp[6006], n, m, x, y, res;
pair<int, int> p[3003];
int32_t main() {
DAU
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> p[i].first >> p[... | 0 |
//#include "debug.h"
#include <string.h>
#include <limits.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
const long long M=1000000007;
//typedef long T;
//#include "math/mod.h"
//#include "math/modulo.h"
template<class T, long long M>
struct modulo {
T n;
T gcd_ext(T a... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
inline void normal(ll &a) { if (a >= MOD) a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) {normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) {normal(a), normal(b); return (a+b)%MOD; }
inli... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map... | 0 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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 int mod=1000000007;
const int INF=1001001001... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | 1 |
#include <bits/stdc++.h>
#define P pair<int, int>
using namespace std;
const int INF=1e5;
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int main(){
int h,w,a[1009][1009];
string s[1009];
cin >> h >> w;
memset(a, -1, sizeof(a));
for(int i=0;i<h;i++)cin >> s[i];
queue<P> q;
for(int i=0;i<h;i++){
for(i... | //BISMILLAHIR RAHMANIR RAHIM
//BY THE NAME OF ALLAH
//FAISAL AHAMMED SHAWON
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include... | 0 |
// 2020-07-15 23:41:12
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const ll oo = 1e18;
const int MOD = 1000000007;
const int N = 300010;
#define x first
#define y second
#define pb push_back
#define mp make_pair
int n , m , dp[1 << 16][16], comp[1 << 16], cost[16][... | 0 |
#include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, h, w, a, b;
scanf("%lld%lld%lld%lld", &h, &w, &a, &b);
for(i = 0; i < h; ++i) {
for(j = 0; j < w; ++j) printf("%d", (i < b) ^ (j < a));
printf("\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int H, W; cin >> H >> W;
int A, B; cin >> A >> B;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if ((i < B && j < A ) || (B <= i && A <= j)) cout << '0';
else cout << '1';
... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.