code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n... | #include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
fenwick_tree<ll> fw(n);
rep(i, n) {
ll a;
cin >> a;
fw.add(i, a);
}
... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0, A,B;;
cin >> N >> A >> B;
if(N == 1){
cout << "Hello World";
}
else{
cout << A + B;
}
}
| #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
if(n==1){
cout << "Hello World" << "\n";
return 0;
}
else{
int a,b;
cin >> a >> b;
cout << a+b << "\n";
return 0;
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
long long count;
cin >> N;
vector<int> a(N);
count = 0;
for(int i = 0;i < N;i++){
cin >> a.at(i);
if(i > 0){
if(a.at(i-1) > a.at(i)){
count += a.at(i-1) - a.at(i);
a.at(i) = a.at(i-1);
}
}
}
cout... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) ... | 0 |
#include <bits/stdc++.h>
#define lid id << 1
#define rid id << 1 | 1
using namespace std;
const int MAXN = 2e5 + 5;
const int INF = 1e9;
int h, w, a[MAXN], L[MAXN], R[MAXN], ans[MAXN];
template <class T>
void read(T &x, T f = 1, char ch = getchar()) {
x = 0;
while (ch < '0' || ch > '9') f = (ch == '-' ? -1 :... | /* 十 聖イシドールスよ、迷えるプログラマを導き給え！ 十 */
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
#include <deque>
#define rep(i, n) for(int i = 0; i < n; i++)
//const long long INF = 1LL << 60;
const int INF = 1e9;
using ll = long long;
int main()
{
int N, Q;
std::cin ... | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using name... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define INF 99999999
int main(){
int a,b;
int month[]={0,0,31,29,31,30,31,30,31,31,30,31,30,31};
for(int i=1... | 0 |
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
int main()
{
string times;
int x=0;
int n;
vector <int> number;
getline(cin,times);
stringstream s(times);
while(s>>n)
number.push_back(n);
x=(60*(number[2]-number[0])+(number[3]-number[1]))-number[4];
cout<<x<<end... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=b;i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
... | 1 |
#include <stdio.h>
int main() {
int H, W, N;
scanf("%d", &H);
scanf("%d", &W);
scanf("%d", &N);
if(W>=H){
for(int i=1;i<=H;i++){
if (W*i>=N) {
printf("%d", i);
return 0;
}
}
} else {
for(int i=1;i<=W;i++){
if (H*i>=N) {
... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int MAX_N = 200010;
const int MOD = 1000000007;
typedef long long Int;
Int fac[MAX_N + 1];
Int inv[MAX_N + 1], ifac[MAX_N + 1];
Int comb(int n, int r)
{
if (n < 0 || r < 0) return 0;
if (n < r) return 0;
Int ret = 1;
ret = (... | 0 |
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <utility>
#include <stdlib.h>
#include <fstream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <stack>
#include <assert.h>
#include <unordered_map>
#include <unordered_set>
#include <math.h>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w,a,b;
cin>>h>>w>>a>>b;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if((j<a && i<b) || (j>=a && i>=b)) cout<<0;
else cout<<1;
if(j==w-1) cout<<endl;
}
}
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <assert.h>
#include <numeric>
#include <math.h>
#include <climits>
#include <stack>
#include <iomanip>
#include <sstream>
using namespace std;
template <typename T>
inline bool sign(T A) {
return (A>... | #include <bits/stdc++.h>
#define For( i, j, k ) for( int i = j; i <= k; ++i )
using std::vector;
using std::pair;
using std::cin;
using std::cout;
typedef long long LONG;
typedef int INT;
const INT N = 100100;
char c[ N ];
INT n, ans[ N ];
void Print( )
{
For( i, 1, n )
cout << ( ans[ i ] ? 'W' : 'S' );
return;
}
v... | 1 |
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
queue<pair<int, int>> q;
int H, W;
int grid[1005][1005], shortestPath[1005][1005];
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
bool inside(int row, int col){
if (row < 0 || row >= H || col < 0 || col >= W) return false;
return true... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
vector<bool> a(h*w,false);
queue<int> que;
for(int i = 0; i < h; i++) ... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <stdlib.h>
#include <stdio.h>
#include <sstream>
using namespace std;
#define p 1000000
int main(void){
//FILE* fp_in = freopen("data.txt", "r", stdin);
while(1){
long long int n,tmp[3],cnt = 0;
vector<long long int> number;
vector<long long ... | #include <iostream>
#include <string>
using namespace std;
typedef struct{
string id;
long long sales;
} staff;
int main(void)
{
long long n;
while(cin>>n){
if(!n) break;
staff staff1[4001];
int pt = 0;
for(int i=0; i< n; i++){
string id;
cin >> id;
long long price;
int bnum;
cin >> price >>... | 1 |
#include<bits/stdc++.h>
#define N 105
using namespace std;
char s[N][N];
int n,m;
int Ex,Ey,ans;
int cnt[N][N];
void mmax(int &x,int v){
x=max(x,v);ans=max(ans,v);
}
int get(int x1,int y1,int x2,int y2){
return cnt[x2][y2]-cnt[x2][y1-1]-cnt[x1-1][y2]+cnt[x1-1][y1-1];
}
int dp[2][N][N][N];
int main(){
scanf("%d%d",&n... | #ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define sz(s) ((int) ((s).size()))
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#ifdef _WIN32
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
typedef long long... | 1 |
#include <bits/stdc++.h>
using namespace std;
int N,M,Q,m;
const int maxn=600000+5;
int siz;
int C[maxn],a[maxn],ret[maxn];
struct node{
int l,r,id;
bool operator<(const node& other)const{
return other.r > r;
}
}x[maxn],y[maxn];
void add(int x,int v){
for(int i=x;i<=m;i+=i&-i) C[i]+=v;
}
int sum(int x){
int r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,q;
cin >> n >> m >> q;
int a[505][505];
int c[505][505];
for(int i=0; i<=n; i++){
for(int j=0; j<=n; j++){
a[i][j]=0;
c[i][j]=0;
}
}
for(int i=0; i<m; i++){
int x,y;
... | 1 |
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
int J = 0, O = 0, I = 0;
void res()
{
J = 0;
O = 0;
I = 0;
}
int main()
{
string a;
cin >> a;
int ans = 0;
for (int i = 0; i < a.size(); i++)
{
switch (a[i])
{
case'J':
if (O != 0 || I != 0)
{
res();
J++;
}
... | #include <bits/stdc++.h>
#define FOR(i,n) for(int i=0;i<(int)(n);i++)
#define FORR(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define pb(a) push_back(a)
#define ZERO(a) memset(a,0,sizeof(a))
#define len(a) sizeof(a)
#define ll long long
#define INF 1<<29
#define MAX
using namespace std;
void solve(){
string s;
cin>>... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a)... | #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 st... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
typedef short int sh;
const int inf=0x3f3f3f3f;
const int MAX=1e5+10;
const int mod=1e9+7;
int position[26][MAX],Size[26];
char str[MAX];... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1000000000000000000
using namespace std;
int main(void){
string s;
cin >> s;
if (s.size() == 2){
if (s[0] == s[1])
cout << 1 << " " << 2 << endl;
else
cout << -1 << " " << -1 << endl;
}
else {
ll ... | 1 |
#include <bits/stdc++.h>
const long long MOD = 1e9+7;
using namespace std;
#define ll long long
#define ar array
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
cout << s.replace(0,4,"2018") << endl;
return 0;
}
| #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... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
vector<vector<int>>grid(h+2, vector<int>(w+2,0));
queue<pair<int, int>>black;
for (int i = 1; i < h + 1; i++) {
for (int j = 1; j < w + 1; j++) {
char x;
cin >> x;
if (x == '.')grid.at(i).at(j) = 1... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
int main(){
std::vector<string> d(3);
for(ll i=0;i<3;++i){
cin>>d[i];
}
ll a=0,b=0,c=0;
char now='a';
while(1){
switch(now){
case 'a':
if(a>=d[0].length()){
... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N=1010;
int n,t,cnt[N];bool flag=0;char a[N][N];
int b[4][10][10]={
{
{ 1, 2, 3, 3},
{ 1, 2, 4, 4},
{ 5, 5, 6, 7},
{ 8, 8, 6, 7}
},
{
{ 0, 0, 1, 2, 3},
{ 0, 0, 1, 2, 3},
{ 4, 4, 5, 6, 6},
{ 7, 7, 5, 0, 8},
{ 9, 9,10,10, 8}
},
{
{ 0, 0, 0, 1, 2, 3},
{ 0, 0, ... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n,m,r,s,k,c1,c2,c3,c4,i;
cin>>n;
cout<<pow(n,2)+pow(n,3)+n<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
string t1;
int main(){
for(int i = 0 ; i < 26 ; i++) t1 += 'a'+i,t1 += 'A'+i;
sort(t1.begin(),t1.end());
rotate(t1.begin(),t1.begin()+26,t1.end());
int n;
while(cin >> n && n){
vector<int> k(n);
string s;
for(int i = 0 ; i < n ; i++) cin >> k[i];
cin >> s;
... | #include<iostream>
#include<algorithm>
using namespace std;
int main(void){
int a,b,c,n,m,i,o,p,q,r,test[1000][3],num,chk[300];
cin >> a >> b >> c;
m = a+b+c;
while(m!=0){
for(i=0; i<m; i++){
chk[i] = 2;
}
cin >> n;
num = 0;
for(i=0; i<n; i++){
... | 0 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
int n;
int a[305];
ll dp[305][90005];
ll dp2[305][90005];
ll p(ll a, ll x) {
ll res = 1;
while(x > 0) {
if(x & 1) res = res * a % mod;
a = a * a % mod;
x >>= 1;
}
return res;
}
int main() {
cin >> n;
i... | #include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
int n;
long long tot=1,d[99001],e[99001],s=0;
int main()
{
cin>>n;
d[0]=e[0]=1;
for(int i=1,x;i<=n;i++)
{
cin>>x;
s+=x;
tot=tot*3%mod;
for(int j=s;j>=0;j--)
{
d[j]=(d[j]*2+(j>=x?d[j-x]:0))%mod;
e[j]=(e[j]+(j>=x?e[j-x]:0))%mod;
}... | 1 |
#include <bits/stdc++.h>
int main() {
int n; std::cin >> n;
std::vector<std::string> a(n);
for (int i = 0; i < n; ++i) std::cin >> a[i];
// int n = 5;
// std::vector<std::string> a{"7.5", "2.4", "17.000000001", "17", "16.000000000"};
/* ピリオドをすべての文字列に加える */
for (int i = 0; i < n; i++)
if (a[i].find('... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin()... | 0 |
#include<string>
#include<iostream>
using namespace std;
string replaceAll(string s, string f, string t) {
string r;
for (int p = 0; (p = s.find(f)) != s.npos; ) {
r += s.substr(0, p) + t;
s = s.substr(p + f.size());
}
return r + s;
}
int main(){
string s;
int n;
cin>>n;
getline(cin,s);
whil... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define int long long
#define pb push_back
#... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
int n,m;
cin >> n >> m;
if(n == m){
cout << 2*m;
}
else{
cout << 2*max(m,n)-1;
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int A,B;
cin >> A>>B;
int ans = 0;
for (int n = 0;n<2; ++n) {
if (A > B) {
ans += A;
--A;
}
else {
ans += B;
--B;
}
}
cout << ans<<endl;
return 0;
} | 1 |
#include <string>
#include <iostream>
#include <map>
class Baseball{
private:
int score;
int out;
int runner;
int inning;
public:
Baseball(); //コンストラクタ
int getScore() { return score; }
int addScore(int score) { score += score; }
int getInning() {... | #include<cstdio>
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
int point=0;
int base=0;
int out=0;
while(out!=3){
char s[8];
scanf(" %s",s);
switch(s[1]){
case 'I':
base++;
... | 1 |
#include<iostream>
#include<string>
#include<math.h>
using namespace std;
int main(){
int h,w,s;
while(true){
cin>>h>>w;
if(h==0&&w==0)
break;
bool t=true;
s=h*h+w*w;
h++;
while(true){
if(h*h>=s-h*h)
break;
if(s==h*h+(int)sqrt((double)s-h*h+0.0)*(int)sqrt((double)s-h*h+0.0)){
t=false;
break;
}
... | #include<bits/stdc++.h>
using namespace std;
struct rectangle{
int h, w;
bool operator<(const rectangle &a)const{
if(w*w + h*h == a.w*a.w + a.h*a.h)
return h < a.h;
return w*w + h*h < a.w*a.w + a.h*a.h;
}
};
int main(){
vector<rectangle> ans;
for(int i = 1; i <= 150; i++) {
for(int j = i ... | 1 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) ... | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... | 1 |
#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... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int, int>;
/* 大文字を小文字に変換 */
char tolower(char c) {return (c + 0x20);}
/* 小文字を大文字に変換 */
char toupr(char c) {return (c - 0x20);}
// if('A'<=s[i] && s[i]<='Z') s[i] += 'a'-'A';
/*
... | 0 |
#include "bits/stdc++.h"
using namespace std;
const int N=300005;
const int p=1e9+7;
inline void add(int& a,const int& b){
a+=b;
if(a>=p)a-=p;
}
int to[8][2]={{5,1},{3,2},{2,2},{4,1},{3,3},{7,6},{5,1},{5,5}};
char s[N];
int f[N][8];
int main(){
scanf("%s",s+1);
int n=strlen(s+1);
f[0][0]=1;
for(int i=1;i<=... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p; //vector<pair<ll, ll>> pairs(n) ,pairs.at(i) = make_pair(i*i, i)
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define RE... | 0 |
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
long long MOD = 1e9+7;
int MAX_INT = 1e9;
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int H, W, N;
cin >> H >> W >> N;
int max_len = max(H, W);
if... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int h, w, n; cin >> h >> w >> n;
int ans = IINF;
for... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = (int)1e5 + 5, LOG = 60;
int n, x[N], m, a[N], d[N], per[N], jump[N][LOG], finalPos[N], updPos[N], finalD[N];
ll K, ans[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", x + i);
scanf("%d %lld", &m, ... | // #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree... | 0 |
// you can use includes, for example:
#include <iostream>
#include <vector>
#include <algorithm>
#include <memory>
#include <unordered_map>
#include <algorithm>
#include <unordered_map>
#include <string>
#include <sstream>
#include <set>
#include <cassert>
#include <map>
using namespace std;
constexpr int64_t kMod = ... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#... | 0 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
int main() {
const int size = 21;
char str[size];
std::scanf("%s", &str);
for (int i = size - 1; i >= 0; i--)
if (48 <= str[i] && str[i] <= 57)
std::cout << str[i];
else if(97 <= str[i] && str[i] <= 122)
std::cout << str[i];
std::cout << std::en... | #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>
using namespace std;
int main()
{
string s,t;
cin >> s;
t = s;
for (int i = 0; i < s.size(); i++) {
t[i] = s[s.size() - i-1];
}
cout << t << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 7;
string w[] = { "SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN" };
for (unsigned int i = 0; i < 7; i++) {
if(s == w[i]) {
ans -= i;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
if(s[0]=='S'){
if(s[1]=='U') cout<<7;
else cout<<1;
}
else if(s[0]=='M') cout<<6;
else if(s[0]=='T'){
if(s[1]=='U') cout<<5;
else cout<<3;
}
else if(s[0]=='W') cout<<4;
else if(s[0]=='F') cout<<2;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = vec... | #include<iostream>
#include<string>
using namespace std;
int main(){
int m,a,b,t=0,s;
while(cin>>m>>a>>b){
t=0;
if(m==0){
break;
}
int p[m];
for(int i=0;i<m;i++){
cin>>p[i];
}
for(int i=a;i<=b;i++){
if(t<=p[i-1]-p[i]){
t=p[i-1]-p[i];
s=i;
}
}
cout<<s<<e... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y,i,j,n;
deque<int >v;
cin >> n;
for(i = 0 ;i<n ;i++)
{
cin >> x;
deque<int >:: iterator it;
it = upper_bound(v.begin(),v.end(),x);
if(v.begin()== it)
v.push_front(x);
else... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll,ll>;
using pi = pair<int,int>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, y;
cin >> n >> y;
int a = -1, b = -1, c = -1;
for (int i=0; i<=n; i++) {
for (int j=0; i+j<=n; j++) {
int k = n - i - j;
... | #include<bits/stdc++.h>
using namespace std;
const int MAXN = 300+10;
int dp[2][MAXN][2][2][MAXN];
char str[MAXN];
int main()
{
ios::sync_with_stdio(false);
cin>>str;
int K,N=strlen(str);
cin>>K;
int ans=0;
for(int i=0;i<N;++i)
{
int ii=i%2;
for(int j=N-1;j>=i;--j)
{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e6 + 5;
char s[maxn];
int sum[maxn];
int k[maxn];
vector<int> D;
vector<int> C;
int n;
ll slove(int k) {
if (C.empty() || D.empty())
return 0;
ll ans=0;
int j = 0;
queue<int> q;
int a, b;
ll temp=0;
... | #include <bits/stdc++.h>
#define repr(i,from,to) for(int (i)=(from);(i)<(to);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
// const bool debug=true;
const bool debug=false;
#define DEBUG if(debug==true)
#define vprint(x) for(auto a:(x)) cout << x << endl;
#define all(x) begin((x)), end((x))
using namespace std;
... | 0 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#define ll long long
#define LINF 0x3f3f3f3f3f3f3f3f
#define INF 0x3f3f3f3f
using namespace std;
const int MAX = 1e5 + 10;
const int MOD = 1e... | #include<bits/stdc++.h>
using namespace std;
int ans, X, Y, N, M, dp[2][102][102][102], s[102][102];
char sir[102][102];
void U (int &x, int val) {if (val > x) x = val;}
int get_sub (int a1, int b1, int a2, int b2)
{
if (a1 < 1) a1 = 1;
if (b1 < 1) b1 = 1;
if (a2 > N) a2 = N;
if (b2 > M) b2 = M;
... | 0 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 1000005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x... | #include <bits/stdc++.h>
#define DICE_SIZE 6
#define TOP 0
#define FRONT 1
#define RIGHT 2
#define LEFT 3
#define BACK 4
#define BOTTOM 5
using namespace std;
class Dice {
private:
int number[DICE_SIZE];
int work_space[DICE_SIZE];
void reset_number(int, int, int, int, int, int);
public:
Dice(i... | 0 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int part(int a[],int p,int r){
int x=a[r];
int i=p-1;
for (int j = p; j < r; ++j) {
if (a[j]<=x){
i+=1;
swap(a[i],a[j]);
}
}
swap(a[i+1],a[r]);
return i+1;
}
int main() {
... | #include <iostream>
#include <string>
#include <sstream>
int partition(int* arr, int n)
{
const int x = arr[n - 1]; //pivot value
int i = 0; //increment if swaped
int j = 0; //increment every loop
for (; j < n; ++j) { //scan start to end
if (arr[j] <= x) {
std::swap(arr[i], a... | 1 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int res,n,d,a[200010],dpl[200010],dpr[200010];
signed main()
{
ios::sync_with_stdio(false);
cin>>n>>d;
for(int i=1;i<=n;i++){cin>>a[i];res+=a[i];}
res+=(n-1)*d;
dpl[1]=a[1];
for(int i=2;i<=n;i++) dpl[i]=min(a[i],dpl[i-1]+d);
dpr[n]=a[n];
for(... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
for(int i=0;;++i){
int ans = 1 + (a - 1)*i;
if(b <= ans){
cout << i;
return 0;
}
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
ll x, y;
cin >> x >> y;
if(x == y)cout << 0 << endl;
else if(x... | 0 |
//Space Coconut Grab
#include<bits/stdc++.h>
using namespace std;
#define INF 10000000
typedef long long ll;
//x^t
ll mypow(ll x, ll t){
return (ll)pow((double)x, (double)t);
}
ll ans[1000001];
int main(){
for(ll i=0; i<=1000000; i++)ans[i]=INF;
for(ll z=0; mypow(z, 3)<=1000000; z++){
ll tmp;
for(ll y... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <map>
#include <numeric>
using namespace std;
#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define ALL(s) (s).begin()... | 0 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,l;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, l;
cin >> n >> l;
int ans = 0;
for(int i=l; i<l+n; ++i){
if(l+n-1 < 0 && i == l+n-1) continue;
if(l > 0 && i == l) continue;
ans += i;
}
cout << ans << endl;
} | 1 |
/*
author : nishi5451
created: 11.08.2020 00:36:47
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
string a,b,c;
cin >> a >> b >> c;
if(*a.rbegin()==*b.begin() && *b.rbegin()==*c.begin()){
cout << "YES" << endl... | #include<stdio.h>
int main(){
char a[100];
scanf("%[^\n]", a);
int ctr = 0;
for(int i= 0; a[i] != '\0'; i++){
if(a[i] == ' '){
if(a[i - 1] == a[i + 1]){
ctr++;
}
}
}
if(ctr == 2){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
int main() {
stri... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ss(x) (int) x.size()
#define cat(x) cerr << #x << " = " << x << endl
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define per(i, l, r) for (int i = r; l <= i; --i)
using ll = long long;
using namespace st... | 1 |
#ifndef VS
#include<bits/stdc++.h>
#endif
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if(1)
#else
#define CIN_ONLY if(1)
struct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}
}star;
#define DEBUG if(0)
#endif
#define ALL(v) (v).begin(),(v).end()
#define REC(ret, ...) std::fun... | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <iomanip>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
int main() {
int N; cin >> N;
string A, ... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e,k;
cin >> a >> b >> c >> d >> e >> k;
if(e-a>k){
cout << ":(" << endl;
}
else{
cout << "Yay!" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
if(s[0]=='R'&& s[1]=='R'&&s[2]=='R'){
cout<<"3"<<endl;
}
else if(s[0]!='R'&& s[1]!='R'&&s[2]!='R'){
cout<<"0"<<endl;
}
else if(s[0]=='R'&& s[1]=='R' || s[1]=='R'&&s[2]=='R'){
cout<<"2"<<end... | 0 |
#include<cstdio>
int main(){
int n;
bool a,b,c;
char event[20];
scanf("%d", &n);
for(int i=0; i<n; i++){
int score=0;
a=b=c=false;
int out =0;
while(1){
scanf("%s", event);
if(event[1]=='I'){
if(c)score++;
c=b;
... | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vec... | 1 |
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<string>
#include<cstring>
using namespace std;
const int inf=2e9+5;
const int maxn=100;
typedef vector<int> vi;
typedef long long ll;
#define fi first
#define se second
typedef pair<int,int> P;
int d[maxn+5][maxn+5];
int v,e;
void floyd()... | #include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
using s64 = int64_t;
constexpr s64 INF = 1'010'000'000'000'000'000LL;
template<typename T, typename U>
bool chmin(T& xmin, const U& x)
{
if(x < xmin) {
xmin = x;
return true;
}
else {
return false;
... | 1 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}... | 1 |
%:pragma GCC optimize("Ofast")
%:pragma GCC optimize("inline")
#include <bits/stdc++.h>
#define rint register int
#define fo(i, n) for(rint i = 1; i <= (n); i ++)
#define out(x) cerr << #x << " = " << x << "\n"
#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end();... | #include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>
#include <iomanip>
#define repeat(i,n) for (long long i = 0; (... | 1 |
#include<iostream>
using namespace std;
int main(){
int n,a;
long long sum=0;
int max=-1000000;
int min=1000000;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a;
if(a>max){
max=a;
}
if(a<min){
min=a;
}
sum+=a;
}
cout<<min<<" "<<max<<" "<<sum<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
#define ndl cout << '\n'
#define sz(v) int(v.size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define present(a, x) (a.find(x) != a.end())
#ifdef LOCAL
#define db(...) ({cout << "> Line " <<... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"YES"<<endl
#define cno cout<<"NO"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
template<class T> inline bool chmax(T& a, T b) { ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(m);
int odd = 0;
for (int i = 0; i < m; i++) {
cin >> a[i];
odd += a[i] & 1;
}
if (odd > 2) {
cout << "Impossible\n";
return 0;
}
for (... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ll N;
cin >> N;
ll sqrN = sqrt(N);
for (ll i = sqrN; i >= 1; i--) {
if (N % i == 0) {
ll ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll F(ll A, ll B){
string bufA = to_string(A), bufB = to_string(B);
return max(bufA.size(), bufB.size());
}
int main(){
ll N;
ll ans = to_string(N).size();
cin >> N;
for(ll i = 1; i <= sqrt(N); ++i){
if(N % i == 0) ans =... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#de... | 1 |
/* BISMILLAHIR RAHMANIR RAHIM */
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d", &x)
#define sll(x) scanf("%lld", &x)
#define ssll(x,y) scanf("%lld %lld", &x ,&y)
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll... | #include <string>
#include <iostream>
using namespace std;
int n;
string s;
bool match(int index, string pattern) {
if (index + pattern.size() > s.size()) return false;
for (int i = 0; i < pattern.size(); i++) {
if (s[index + i] != pattern[i])
return false;
}
return true;
}
int change() {
string after = "H... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
int main() {
int n; cin >> n;
string s, t; cin >> s >> t;
if(s == t) {
cout << n << endl;
return 0;
}
... | //Let's join Kaede Takagaki Fun Club !!
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef lon... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 110000;
vector<int> con[N];
int vis[N];
bool dfs(int u, int col) {
vis[u] = col;
for (int v : con[u]) {
if (vis[v] && 3 - col != vis[v]) return false;
if (!vis[v] && !dfs(v, 3 - col)) return false;
}
return true;
}
int main() {
ios::sync_with_st... | #include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define ... | 1 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5;
int n, a[4][maxn + 5], p[maxn + 5], num[2];
int main() {
scanf("%d", &n);
for (int i = 1; i <= 3; i++) {
for (int j = 1; j <= n; j++) {
scanf("%d", &a[i][j]);
if (i == 2) {
p[j] = (a[i][j... | 0 |
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserv... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i <= (int)(n); i++)
int main() {
int A, B;
cin >> A >> B;
int Xa, Xb, Xc;
int co = 0;
rep2(i, A, B) {
Xa = i % 10;
Xb ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#defi... | #include<bits/stdc++.h>
using namespace std;
int n, cnt = 2;
long long res[507][507];
map<int, int>a, b;
int nxt()
{
while (1)
{
bool ok = 1;
for (int i = 2; i * i <= cnt && ok; i++)
if (cnt % i == 0)ok = 0;
if (ok)return cnt++;
cnt++;
}
return 0;
}
long long gcd(long long a, long long b)
{
if (!b)retur... | 1 |
#include <cstdio>
double l[10],v1,v2;
int main(){
while(~scanf("%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf",l,l+1,l+2,l+3,l+4,l+5,l+6,l+7,l+8,l+9,&v1,&v2)){
double p=0;
for(int i=0; i<10; i++) p+=l[i];
p=p*v1/(v1+v2);
for(int i=0; i<10; i++){
if(p>l[i]) p-=l[i];
else{
printf("%d\n"... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1000000007;
int main(){
ll x;
cin >> x;
ll n = x / 11;
n *= 2;
ll m = x % 11;
if (m > 6) {
n += 2;
}
if(m > 0 && m <= 6) {
n++;
}
cout << n << endl... | 0 |
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define N 1100005
using namespace std;
typedef long long ll;
ll n, ans, kac, a[N], pre[N], dp[N], fen[N], of[N];
vector < int > g[N];
ll fe(ll a, ll us){
if(us <= 1)
return (us)?a:1ll;
ll ... | #include <bits/stdc++.h>
const int INF=1e9,MOD=1e9+7;
const long long LINF=1e18;
using namespace std;
#define int long long
//template
std::vector<int> dpa(1234567,0),dpb(1234567,1),memo(1234567,0);
int pw(int n,int k){
int res=1;
while(k){
if(k&1)res*=n;res%=MOD;
n*=n;n%=MOD;
k>>=1;
}
return res;
}... | 1 |
//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
type... | #include<iostream>
using namespace std;
int main()
{
int N;
cin>>N;
for(int i=40000;i>=1;i--)
{
if(i*i<=N)
{
cout<<i*i<<endl;
break;
}
}
}
| 1 |
// Problem : A - Painting
// Contest : AtCoder - Keyence Programming Contest 2020
// URL : https://atcoder.jp/contests/keyence2020/tasks/keyence2020_a
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_con... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define PRINT(a) cout << (a) << endl
#define RALL(v) rbegin(v), rend(v)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
... | 0 |
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI=acos(-1.0);
#define t1(x) cerr<<#x<<"="<<x<<endl
#define t2(x, y) cerr<<#x<<"="<<x<<" "<<#y<<"="<<y<<endl
#define t3(x, y, z) cerr<<#x<<"=" <<x<<" "<<#y<<"=... | #include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define re register
#define LL long long
// #define MOD 1000000007
#define MAXN 6005
using namespace std;
const int ST=6002;
LL n,ans,MOD,dp[MAXN][MAXN<<1];
LL rd(){
LL x=0,tp=1;char c;c=getchar();
while(c<'0' || c>'9'){if(c=='-')tp=-1;c=getchar();}
while(c>='0' && c<='... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
string ans;
int L = A + B, R = C + D;
if (L > R) {
ans = "Left";
} else if (L == R) {
ans = "Balanced";
} else {
ans = "Right";
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,a=-2,b;
cin>>n;b=n;
string s;
while(n!=0){
if((n%a)<0){s+=(2+(n%a))+'0';n/=a;n+=1;}
else {s+=(n%a)+'0';n/=a;}
}
... | 0 |
#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, int> 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 1; } re... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<
pair<int, int>,
null_type,
less_equal<pair<int, int>>,
rb_tree_tag,
tree_order_statistics_node_update>
order... | 0 |
#include<iostream>
using namespace std;
int s[10004];
int cnt,n;
void find(int s[],int num)
{
for(int i=0;i<n;i++)
{
if(s[i]==num)
{
cnt++;
break;
}
}
}
int main()
{
cin>>n;
for(int k=0;k<n;k++)
{
cin>>s[k];
}
int q;
cin>>q;
while(q--)
{
int nn;
cin>>nn;
find(s,nn);
}
cout<<cnt<<en... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n ;
vector<int> a(n);
for (int i = 0; i < n; i++){
cin >> a[i];
}
long long int sum=0;
for (int i = 0; i < n; i++){
sum += a[i];
}
long long int min = *min_ele... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdint>
using Int = std::int64_t;
constexpr Int MOD = 1e9 + 7;
int main() {
Int N, X;
std::cin >> N >> X;
std::vector<Int> S(N);
for (auto&& e : S)
std::cin >> e;
std::sort(S.begin(), S.end());
// dp[i][x] := 最初が x のときに i 個目まで見たときの総和
s... | #include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define LL long long
#define MAXN 210
#define MAXS 100010
#define mod 1000000007
using namespace std;
int n, x, w[MAXN];
int f[MAXN][MAXS];
template <typename T> void chkmin(T &x, T y){x = min(x, y);}
template <typename T> void chkmax(T &x, T y){x = max(x, y);}
template <... | 1 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int EditDistance(string s1,string s2){
int n=s1.size();
int m=s2.size();
int dp[n+1][m+1];
for(int i=0;i<n+1;i++){
dp[i][0]=i;
}
for (int j=0;j<m+1;j++){
dp[0][j]=j;
}
for (int i=1;i<n+1;i+... | #include <bits/stdc++.h>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector <ll> vi;
typedef vector <pi> vpi;
#define f first
#define s second
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end(... | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1000010;
int n;
int a[N];
int L, q, ans, lst;
int dp[N][21];
int pow[21];
int main() {
memset(dp, 0x3f, sizeof(dp));
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
scanf("%d", &L);
scanf("%d", &q);
pow[0... | 1 |
#include<iostream>
using namespace std;
static const int INF = 0x7fffffff;
static const int MAXN = 101;
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
int n, M[MAXN][MAXN];
int prim()
{
int node, minn; //记录当前状态权值最小的边和对应的节点
int d[MAXN], p[MAXN], color[MAXN]; //最小边权，父节点，访问状态
/*初始化... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
string line;
cin >> n;
getline(cin, line);
while(n--){
int p;
getline(cin, line);
while((p = line.find("Hoshino")) != -1){
line[p+6] = 'a';
}
cout << line << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } ret... | #include <bits/stdc++.h>
using namespace std;
// 参考資料：https://hiramekun.hatenablog.com/entry/2019/07/21/082628
#define N 100000
#define INF ((1<<31)-1)
multiset<int> setMaxNum; // 色ごとに仕分けされた集合の最大値を格納
int main() {
// 入力
int n;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++){
in... | 1 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int mod=1000000007;
inline void add(int &x,int y){(x+=y)>=mod?x-=mod:0;}
char s[300030];
int n,dp[300030][2][2][3],suf[300030],ans;
int main()
{
scanf("%s",s+1);
n=strlen(s+1);s[n+1]='1';
dp[0][0][1][0]=1;
suf[n+1]=suf[n+2]=1;
for(in... | #include <stdio.h>
int main() {
char kaping[14];
scanf("%s", kaping);
kaping[3] = '8';
printf("%s", kaping);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 998244353;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if... | #include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
#define rg register
void read(int &x){
char ch;bool ok;
for(ok=0,ch=getchar();!isdigit(ch);ch=getchar())if(ch=='-')ok=1;
for(x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());if(ok)x=-x;
}
const int maxn=2010,mod=1e9+7,... | 0 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | #include <algorithm>
#include <array>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> as(n);
int sum = 0;
for (auto& a : as)
{
cin >> a;
s... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string s;
cin>>s;
int er=0;
int ans=s.size();
rep(i,s.size()){
if(s[i]=='S') er++;
if(s[i]=='T' && er!=0){
er--; ans-=2;
}
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
long n,sum = 0;
cin >> n;
for(long i =... | 0 |
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int ans;
int f[25][25];
int w,h,sx,sy,gx,gy;
void dfs(int x,int y,int turn)
{
if(turn>10||turn>=ans)return;
for(int i=y+1;i<w;i++)
{
if(x==gx&&i==gy)
{
ans=min(ans,turn);
return;
}
if(f[x][i]==1)
{
if(i==y+1)break;
f... | // clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ll long long
long long min(long long x,long long y){return (x<y ? x:y);}
long long max(long long x,long long y){return (x>y ? x:y);}
#define ld long double
int stoi(string s) {return atoi(s.c_str());}
int k... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int a, b, k;
cin >> a... | 1 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int N,K;
scanf("%d %d",&N,&K);
if(N%K == 0){
printf("0\n");
}else{
printf(... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << min(1, a % b) << "\n";
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int w;
cin >> w;
for (int i = 0; i < s.length(); i = i + w)cout << s.at(i);
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<bool> prime(222220,true);
for(int i=2; i<=222220; ++i) for(ll j=(ll)i*i; j<=222220; j += i){
prime[j] = false;
}
vector<int> ans(n);
int num = 0;
for(int i=11; i<=55555; i += 5){
if(!prime.at... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
bool CheckPayable(int x, vector<int> D){
// x中にDが含まれていなければtrue,含まれていればfalse
while(x>0){
for(int i=0;i<D.size();i++){
if(x%10 == D[i])return false;
}
x /= 10;
}
return true;
}
int main(){
int N,K;
... | #include<stdio.h>
int main (){
int ha;
int wa;
int na;
int hasil;
scanf("%d", &ha);
scanf("%d", &wa);
scanf("%d", &na);
if(ha>=wa){
if(na%ha == 0) {
hasil = na/ha;
} else {
hasil = na/ha+1;
}
} else {
if(na%wa == 0) {
hasil = na/wa;
... | 0 |
// ref: https://img.atcoder.jp/arc093/editorial.pdf
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
//---
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inli... | #include <iostream>
#include <algorithm>
#define MAXN 100
#define WHITE 0
#define BLACK 1
using namespace std;
int D[MAXN][MAXN];
bool judge ( int color, int i, int j)
{
if ( i-1 >= 0 && j-1 >= 0 && D[i-1][j-1] == color ) return false;
if ( i-1 >= 0 && D[i-1][j] == color ) return false;
if ( i-1 >= 0 && j+1 <... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //GCC5.4.1で配列の範囲外アクセスをエラーにする
//cmdで g++ test.cpp とするとコンパイルできる
//制限1秒なら10^6は余裕 10^7は多分間に合う 10^8はよほど単純でないと厳しい
// https://github.com/atcoder/live_library
// cppdbg: test.exeのterminalに標準入力を打てる
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
int antennas[5];
for (int i = 0; i < 5; i++) cin >> antennas[i];
int k;
cin >> k;
string ans = "Yay!";
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++... | 1 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
bool ok = true;
if (n % 2) ok = false;
else {
REP(i, n) {
if (i % 2) {
i... | 1 |
#if 0
date +%Y.%m.%d
题解先咕着。
#endif
#include <cstdio>
#include <algorithm>
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
struct {
inline operator int () { int x; return scanf("%d", &x), x; }
} read;
const int maxn = 6005;
ll f[maxn][maxn << 1];
ll inv[maxn];
int main () {
int n = read * 3,... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using lint128 = __int128_t;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
//typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
t... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using nam... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii v... | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
//#define double long double
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0... | 1 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin>>A>>B;
int i=0;
int j=B-A;
int sum=0;
int C=A;
while(i<=j){
A=C;
int a=A%10;//A=12345の時5
A/=10;//A=1234
int b=A%10;
A/=10;//A=123
A/=10;//A=12
int d=A%10;
A/=10;//A=1
int e=A;
if(a==e&&b... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll a;
cin>>a;
cout<<((a-1)/111+1)*111<<endl;
return 0;
}
| #include <cstdio>
typedef long long LL;
const int MX = 10005, MP = 2005;
const int MN = 505;
bool ip[MX];
int p[MP], pc;
inline void Sieve(int N) {
for (int i = 2; i <= N; ++i) {
if (!ip[i]) p[++pc] = i;
for (int j = 1, k; j <= pc; ++j) {
if ((k = p[j] * i) > N) break;
ip[k] = 1;
if (i % p[j] == 0) brea... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main(){
ll N,K;
cin>>N>>K;
if(N%K==0)cout<<0;
else cout<<1;
return 0;
} | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | 0 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n,x,a[105],ans=0;
cin>>n>>x;
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
for(int i=0;i<n;i++){
if(x>a[i] && i!=n-1){
ans++;
x-=a[i];
}
else if(a[i]==x){
ans+... | 0 |
#include "bits/stdc++.h"
using namespace std;
template<typename Itr>
auto partition2(const Itr first, const Itr last){
auto i=first;
for(auto j=first; j!=last; ++j){
if(*j<=*last){
iter_swap(i, j);
++i;
}
}
iter_swap(i, last);
return i;
}
int32_t main(){
size_t n; cin>>n;
vector<uint32... | #include <iostream>
#define MAX 100001
using namespace std;
void Partition(int A[], int n, int& l) // l is the last index of smaller part
{
int x = A[n-1];
for (int i = 0; i < n-1; ++i)
{
if (A[i] <= x)
{
swap(A[i], A[l+1]);
l++;
}
}
l++;
swap(A... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
string S;
cin >> S;
bool m = regex_match(S, regex("(hi)+"));
cout << (m?"Yes":"No") << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main(void){
string S;
cin >> S;
if(S.length() % 2 == 0){
for(int i=0;i<S.length();i=i+2){
if(S[i] == 'h' && S[i+1] == 'i'){
continue;
}
else{
cout << "No" << endl;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N,K;cin>>N>>K;
if(N%K==0){
cout<<0<<endl;
... | #include <bits/stdc++.h>
using namespace std;
const int64_t INF=999999999;
int main() {
int N,K;
cin>>N>>K;
cout<<(N+K-1)/K-N/K<<endl;
return 0;} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.