code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, k;
cin >> a >> b >> k;
int now = 0;
for (int i = 0; i < k; i++){
if (now == 0){
int tmp = a / 2;
a = tmp;
b += tmp;
now = 1;
}
else {
int tmp = b / 2;
... | #include<iostream>
using namespace std;
int sumer(int i) {
int sum = 0;
while (i > 0) {
sum += i % 10;
i /= 10;
}
return sum;
}
int main() {
int a, b, n, ans = 0;
cin >> n >> a >> b;
for (int i = 1; i <= n; i++) {
int sum = sumer(i);
if (sum >= a && sum <= b) ... | 0 | 93,199,576 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
bool bl = false;
if (s[0]==s[1] && s[2]==s[3] && s[0]!=s[2]) bl = true;
if (bl) puts("Yes");
else puts("N... | #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 | 67,118,597 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N; cin >> N;
int ans = 0;
for (int i = 1; ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
int n,a,b;
cin>>n>>a>>b;
vector<int>p(n);
rep(i,n)cin>>p[i];
int c1=0,c2=0,c3=0;
rep(i,n){
if(p[i]<=a)c1++;
else if(p[i]>=b+1)c3++;
else c2++;
}
... | 0 | 88,726,671 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int h,w,a,b;
int i,j,k;
cin>>h>>w>>a>>b;
vector<vector<int> > aux(h,vector<int>(w,0));
vector<int> fila(h+1,0);
vector<int> columna(w+1,0);
if(w-a<a || h-b<b)
{
cout<<"-1";
return 0;
}
a=w-a;
b=h-b;
for(i=0;i<h;i++)
{
for(j=0;j<w;j++)
{
if(fila... | #include <iostream>
#include <vector>
using namespace std;
int n, m;
vector<vector<int>> graph;
int cnt = 0;
vector<bool> seen;
void dfs (int now) {
for (int next: graph[now]) {
if (seen[next]) continue;
else {
seen[next] = true;
dfs(next);
seen[next] = false;
... | 0 | 70,097,670 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string s;
cin >> s;
string y = s.substr(0, 4);
string m = s.substr(5, 2);
string d = s.substr(8, 2);
int Y = stoi(y);
int M = stoi(... | #include <bits/stdc++.h>
using namespace std;
#define forn(i, x, n) for (int i = int(x); i <= int(n); ++i)
#define for1(i, n, x) for (int i = int(n); i >= int(x); --i)
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef long double ld;
typedef vector <ll> vi;... | 0 | 89,227,605 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
int n,a,b;
cin>>n>>a>>b;
int x;
vector<int> vec(3,0);
rep(i,n){
cin>>x;
if(x<=a)vec[0]++;
if(x>a&&x<=b)vec[1... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | 0 | 71,061,043 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
int main(void){
cin.tie(0);
ios::sync_with_stdio(0);
int n,m,k;
cin>>n>>m>>k;
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
if((n-i)*j+i*(m-j)==k){
... | #include <bits/stdc++.h>
using namespace std;
int height(int h1,int h2)
{
return abs(h1-h2);
}
int frogjumps(int n,int k,int *a)
{
if(n==2)
return height(a[0],a[1]);
int dp[n];
for(int i=0;i<n-1;i++)
{
dp[i]=INT_MAX;
}
dp[n-1]=0;
for(int i=n-1;i>0;i--)
{
for(i... | 0 | 18,626,378 |
#include <bits/stdc++.h>
#define int long long int
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define BOLT ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define X first
#define Y second
#define endl "\n"
using namespace std;
void solve() {
int n, m;
cin >> n >> ... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), ar... | 0 | 45,360,475 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
string str;
cin>>str;
int n;
cin>>n;
string q,repstr;
int a,b;
for(int i=0;i<n;i++){
cin>>q;
if(q== "print"){
cin>>a>>b;
for(int pos=a;pos<=b;pos++) cout<<str[pos];
cout<<endl;
}else if(q=="reverse")... | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
#include <iomanip>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (l... | 0 | 61,404,368 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, ... | #include <bits/stdc++.h>
using namespace std;
#define w(x) int x;cin>>x;while(x--)
#define ll long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define vi vector<int>
#define fr(a,b) for(int i=a;i<=b;i++)
#define inf 1e18
#define mod 1000000007
int main()
{
fast;
ll n;
... | 0 | 85,476,039 |
#include<iostream>
using namespace std;
#include<cstdio>
int main(){
double x,y;
for(;;){
cin>>x>>y;
if(x<y){
cout<<x<<" "<<y<<endl;
}
else if(x>y){
cout<<y<<" "<<x<<endl;
}
else if(x==y && x!=0){
cout<<x<<" "<<y<<endl;
}
else if( x== 0 && y == 0){
break;
}
}
return 0;
} | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=998244353;
#define INF (1<<30)
#define LINF (lint)(1... | 0 | 81,000,040 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, c, k;
cin >> n >> c >> k;
vector<int> t(n);
rep(i, n) cin >> t.at(i);
sort(t.begin(), t.end());
int cnt = 1;
int min_time = t.at(0);
int canPassenger = c;
for (int i = 0; i < n; i++) {... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descsort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
int main(void)
{
int x;
cin>>x;
int ans;
if(4... | 0 | 62,482,015 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c; cin >> a >> b >> c;
if(a+b>=c && !(a>c)) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_in_out ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main()
{
fast_in_out;
string s1,s2;
cin >> s1 >> s2;
if(s1.size() == s2.size())
{
if(s1 > s2)
{
cout << "GREATER";
}... | 0 | 44,155,526 |
#define rep(i, a, b) for(int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template<class T> inline void chmax(T &a, const T &b) {if(a < b) a = b;}
template<class T> inline void chmin(T &a, const T &b) {if(a > b) a = b;}
const long long INF = 1LL<<60;
const long long MOD ... | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = ... | 0 | 73,402,580 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<unordered_map>
#include<functional>
#include<map>
#include<iomanip>
#include<limits>
#include<unordered_set>
#include<cmath>
#include <numeric>
#include <array>
#include<utili... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#... | 0 | 57,866,762 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | 0 | 35,145,548 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int A[2*n+5];
for(int i = 0; i < 2*n; i++) cin >> A[i];
sort(A,A+2*n);
int ans = 0;
for(int i = 2*n-1; i >= 0; i-= 2){
ans += min(A[i],A[i-1]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
vector<ll>c(n,0),s(n,0),f(n,0);
for(ll i=0;i<n-1;i++){
cin >> c[i] >> s[i] >> f[i];
}
vector<ll>ans(n,0);
for(ll i=0;i<n;i++){
ll j=i+1;
ll time=c[i]... | 0 | 9,345,189 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
const double PI = 3.14159265359;
int main()
{
... | #include<bits/stdc++.h>
using namespace std;
#define read FILE *fp;\
fp=freopen("testcase.txt","r",stdin);
#define ll long long
#define ull unsigned long long
#define sf(n) scanf("%lld",&n)
#define pf(n) printf("%lld ",n)
#define loop for(long long i=0;i<n;i++)
#define lp(b,n) for(long long i=b;i<=n;i++)
#define pb(n) ... | 0 | 64,312,615 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std ;
int main(){
int n ; cin >> n ;
int a,b,ab,both ;
a = b = ab = both = 0 ;
for(int i=0;i<n;i++){
string s ; cin >> s ;
if(s.at(0)=='B') b++ ;
if(s.at(s.size()-1)=='A') a++ ;
if(s.at(0)=='B'&&s.at(s.size()-1)=='A') both++ ;
for(int... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> p(n), a(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
p[i]--;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = -5e18;
vector<bool> visit;
for... | 0 | 46,142,358 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 81,565,152 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n = 1;
int i;
while (cin >> i,i)
{
cout << "Case " << n << ": " << i<< "\n";
n++;
}
return 0;
} | #include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
int n;
#define Maxn 1005
int x[Maxn],y[Maxn];
bool flag=false;
bool ap[2];
int Move[Maxn][45];
bool in(int u,int d){
ll dis=(ll)abs(x[u])+(ll)abs(y[u]);
int up=((1<<d)-1)*2+1;
return d... | 0 | 2,415,435 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(),(a).end()
#define ALL(a,n) (a),(a)+n
#define vi vector<long long>
#define vd vector<long double>
#define vs vector<string>
#define INF 1010000000000000017LL
#define MOD 1000000007LL
#define EPS 1e-12
#define PI 3.14159265... | 0 | 91,914,670 |
#include<iostream>
#include<iomanip>
#include<cassert>
#include<stdexcept>
#include<utility>
#include<functional>
#include<numeric>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<array>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<complex>
#include<set>
#inc... | #include <bits/stdc++.h>
#define N (long long)(1e9 + 7)
#define MAX 500000
using namespace std;
long long factorial[MAX] = {0}, finverse[MAX] = {0},
inverse[MAX] = {0};
void smodfact() {
factorial[0] = factorial[1] = 1;
finverse[0] = finverse[1] = 1;
inverse[1] = 1;
for(int i = 2; i < MAX; ++i) {
... | 0 | 79,582,642 |
#include<iostream>
using namespace std;
int main(){
int x,y,z;
cin >> x >> y >> z;
if (x >= y && y >= z ){
cout << z << " " << y << " " << x << endl;
} else if ( x <= y && y <= z ){
cout << x << " " << y << " " << z << endl;
} else if (x >= z && z >= y) {
cout << y <<" " << z << " " << x << endl;
} else i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x, ll y) {return x/gcd(x,y)*y;}
int main() {
int n,k;
cin>... | 0 | 2,066,722 |
#include <cstdio>
using namespace std;
#define MAX 100001
#define NIL -1
struct Node
{
int parent, left, right;
};
Node TREE[MAX];
int n, DEP[MAX];
void print(int u)
{
int i, c;
printf("node %d: ", u);
printf("parent = %d, ", TREE[u].parent);
printf("depth = %d, ", DEP[u]);
if (TREE[u].parent == NIL)
pr... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, ans=0; cin >> N;
for (int n=1; n<=N; n++){
int cnt=0;
if (n%2!=0){
for (int i=1; i<=n; i++){
if (n%i==0) cnt++;
}
}
if (cnt==8) ans++;
}
cout << ans << endl;
} | 0 | 14,942,961 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll x,y;
int main(void){
cin>>x>>y;
if(x%y==0){
cout<<-1<<endl;
}else{
cout<<x<<endl;
}
} | #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 ... | 0 | 24,080,897 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define vl vector<ll>
#define pl pair<ll,ll>
#define vpl vector<pl>
#define vvl vector<vl>
using namespace std;
const int N = 1e5+5;
ll h[N], ans[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);... | #include<bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define ss second
#define ff first
#define pll pair<ll,ll>
#define vll vector<ll>
#define mll map<ll,ll>
#define mod 1000000007
#define w(x) ll x; cin>>x; while(x--)
#define ps(x,y) fixed<<setprecision(y)<<x;
#define fo(i, j, k, in) ... | 0 | 96,404,456 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++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 irep(i, m, n) for (int i = (... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
ll n,m;
cin>>n>>m;
vector<pair<ll,ll>> ab(n);
rep(i,n){
ll a,b;
cin>>a>>b;
ab[i]=make_pair(a,b);
}
sort(ab.begin(),ab.end());
ll num=m;
ll ans=0;
... | 0 | 34,932,004 |
#include <iostream>
using namespace std;
const int MAX = 1001;
short max(short a,short b) {
if (a > b) {
return a;
} else {
return b;
}
}
short solve(string str1,string str2) {
int len1 = str1.length();
int len2 = str2.length();
str1 = " " + str1;
str2 = " " + str2;
short LCS[MAX][MAX];
for (int i=0;i<=len... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
vector<ll> dp(n,0);
dp[0] = 1000;
for(i = 1;i < n;++i){
dp[i] = ... | 0 | 37,385,881 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vec... | #include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const int maxn = 1e6;
bool vis[maxn];
vector<int> Prms(maxn);
void seive(int... | 0 | 76,980,115 |
#include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 26,361,217 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
static const int INF = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> v;
ll sum = 0;
for (int i = 0; i < n; ++i) {
... | #include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#i... | 0 | 97,890,307 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t,n,m,c=0;
string s;
cin>>n;
cin>>s;
for(int i=0;i<n-1;i++)
{
if(s[i+1]!=s[i])
c++;
}
cout<<c+1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define RREP(i,n) for(int i = (n)-1; i >= 0; i--)
#define FOR(i, l, r) for(int i = l; i < r; i++)
#define RFOR(i, l,r) for(int i= (l)-1; i>= (r) ; i--)
#define int64 int64_t
#define uint64 uint64_t
#define uint unsigned
int main(... | 0 | 12,224,262 |
#include <iostream>
using namespace std;
int n,m,c[20];
int dp[20][50001];
int main() {
cin >> n >> m;
for(int i = 0;i < m;i++) cin >> c[i];
for(int i = 0;i < 20;i++)for(int j = 1;j < 50001;j++) dp[i][j] = 100000;
for(int i = 0;i < m;i++) {
for(int j = 0;j <= n;j++) {
if(i != 0)
dp[i][j] = min(dp[i-1][j],d... | #include <bits/stdc++.h>
#include <map>
using namespace std;
typedef long long ll;
#define vec vector<int>
#define vecll vector<ll>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=(int)0;... | 0 | 32,880,007 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mk make_pair
#define pb push_back
typedef pair<int, int> pii;
const int mod = 1000000007;
const int INF = 1000000009;
const long long INFL = 1000000000000000018ll;
int N, X[1010], Y[1010];
vector<int> v;
int abso(int a)
{
if(a > 0)return a;
... | #include <set>
#include <map>
#include <cmath>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define pb push_back
#define mp make_pair
#define x first
#define y second
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef ... | 0 | 3,535,574 |
#include <iostream>
using namespace std;
int main(void){
string s;
cin >> s;
int n = s.size();
string ans = "";
for(int i = 0;i < 1 << (n - 1);i++){
int x = s[0] - '0';
string t = s.substr(0,1);
for(int j = 1;j < n;j++){
if(i >> (j - 1) & 1){
... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | 0 | 51,152,502 |
#include <cstdio>
int main(){int x;scanf("%d",&x);printf(x<1200?"ABC":"ARC");} | #include<bits/stdc++.h>
using namespace std;
#define ll long
#define ld double
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define setpr(pp) fixed<<setprecision(pp)
#define FOR(I,N) for(I=0;I<N;++I)
#define MS0(x) memset(x,0,sizeof(x))
#define MS1(x) memset(x,-1,sizeof(x))
#define IOS ios... | 0 | 47,159,610 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
ll X, Y;
cin >> X >> Y;
ll ans = 0;
while (X <= Y)
{
ans++;
X *= 2;
}
co... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 0 | 33,354,494 |
#include<iostream>
#include<vector>
#include<map>
#include<cmath>
using namespace std;
int main() {
int H, W, D;
cin>>H>>W>>D;
map<int, pair<int, int> > A;
int tmp;
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cin>>tmp;
tmp--;
A[tmp] = make_pair(i, j);
... | #include <bits/stdc++.h>
using namespace std;
#define clr(arr,val) memset(arr,val ,sizeof arr)
typedef long long ull;
typedef long long ll;
ll const oo=1e9 ;
int const SZ= (int)1e3+3;
const ll mod=(ll)1e9+7;
string str[SZ];
ll dp[SZ][SZ];
int r,c;
ll solve(int i ,int j){
if(j<0 || j>=c)
return 0;
if(i<... | 0 | 3,619,000 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string a,b,c;
cin>>a>>b>>c;
cout<<(char)(a[0]-0x20)<<(char)(b[0]-0x20)<<(char)(c[0]-0x20);
} | #include <bits/stdc++.h>
int main() {
int A[5][4][11];
int N;
int b, f, r, v;
for(int i = 0; i < 5; ++i) {
for(int j = 0; j < 4; ++j) {
for(int k = 0; k < 11; ++k) {
A[i][j][k] = 0;
}
}
}
std::cin >> N;
for(int i = 0; i < N; ++i) {
std::cin >> b >> f >> r >> v;
A[b][f][r] += v... | 0 | 3,993,324 |
#include <cstdio>
#include <iostream>
using namespace std;
int counta;
void judge(char d[][20], int x, int y, int limitx, int limity) {
if (d[y][x] == '@' || d[y][x] == '.') {
d[y][x] = '#';
counta++;
if (x > 0) judge(d, x - 1, y, limitx, limity);
if (x <= limitx - 2)judge(d, x + 1, y, limitx, limity);
if (y... | #include<bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
ll dp[105][105];
vector<pair<ll,ll> >v;
ll mcm(int left,int right)
{
if(left>=right) return 0;
if(dp[left][right]!=INT_MAX) return dp[left][right];
ll ans=INT_MAX;
for(int i=left;i<right;i++)
{
ll res_left... | 0 | 79,677,336 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
map<int, int> cnt1, cnt2;
int N, a;
cin >> ... | 0 | 92,788,070 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n,d;
cin >> n >> d;
vector<vector<int>> x(n,vector<int>(d));
rep(i,n){
rep(j,d){
cin >> x[i][j];
}
}
int ans = 0;
for(int i=0; i<n; i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, v, w;
vector<int> a, p;
bool chk(int x){
if (x + w >= n) return true;
int r = v - w - x;
if (r < 0) {
for (int i = x + 1; i + w <= n; ++i)
if (a[p[x]] + m < a[p[i]]) return false;
... | 0 | 12,623,061 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
#define infinity (1<<30)
const int maxx=2000100;
int A[maxx];
int n;
void max_heap(int i){
int left=2*i,right=2*i+1,x;
if(left<=n && A[left]>A[i]) x=left;
else x=i;
if(right<=n && A[right]>A[x] ) x=right;
if(x!=i){
... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll... | 0 | 45,509,752 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
int vec[n];
for(int i=0;i<n;i++){
cin>>vec[i];
}
int z=500;
int ans=0;
for(int i=0;i<n-1;i++){
if(vec[i]==vec[i+1]){
ans++;
vec[i+1]=z;
z++;
}
}
cout<<ans<<endl;
} | #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<bitset>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.bigin(), a.end())
#define Srep(n) for(int i = 0; i < (n); i++)
#define rep(i,n) for(int i =... | 0 | 61,893,743 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | 0 | 34,889,268 |
#include<iostream>
using namespace std;
int main()
{
int n; cin >> n;
int n1 = n % 10; n /= 10;
int n2 = n % 10; n /= 10;
int n3 = n % 10; n /= 10;
int n4 = n % 10;
if(n1==n2&&n1==n3&&n2==n3||n2==n3&&n2==n4&&n3==n4||n1==n2&&n1==n3&&n1==n4&&n2==n3&&n2==n4&&n3==n4)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
string s;
... | 0 | 56,866,514 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll ans=0; string s; cin>>s;
char state = ' ';
ll rep = 0;
int n=s.size()+1;
vector<int> left(n,0);
vector<int> right(n,0);
for (int i=0; i<=s.size(); i++){
if(s[i]=='<'){
left[i+1]=left[i]+1;
... | 0 | 19,133,471 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main(void)
{
long long N, u, v, ans;
cin >> N;
ans = (N*(N+1)*(2*N+1)/6 + N*(N+1)/2) / 2;
for(int i = 0; i < N - 1; ++i)
{
cin >> u >> v;
if(u < v) ans -= u*(N-v+1);
else ans ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "[";
for (const auto i : v) {
os << i << " ";
}
os << "]";
return os;
}
int N, K;
bool necessary(int idx, co... | 0 | 6,069,837 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
#define A_P(n,a,d) (n/2)*(2*a + (n-1)*d)
using namespace std;
long nCr(int n, int r){
if(... | 0 | 100,330,144 |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <climits>
using namespace std;
static const int NVMAX = 100;
static const long long INF = (1LL<<32);
int NV, NE;
long long D[NVMAX][NVMAX];
void floyd() {
for (int k = 0; k < NV; k++) {
for (int i = 0; i < NV; i++) {
if (D[i][k] == INF) continue... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("unroll-loops, no-stack-protector")
#pragma GCC target ("avx")
#pragma GCC target ("avx2")
#pragma GCC target ("fma")
#define fastio ios_base::sync_with_stdio(0... | 0 | 94,481,325 |
#include <iostream>
int main(int argc, char const* argv[])
{
int n, x;
while (std::cin >> n >> x)
{
if( n == 0 & x == 0)
break;
int count = 0;
for (size_t i = 1; i <= n; i++)
for (size_t j = i + 1; j <= n; j++)
for (size_t k = j + 1; k <= n; k++)
if(x - k == i + j)
count++;
std::cout << ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S, T;
cin >> S >> T;
int N = S.size();
map<char, char> mp;
map<char, char> mp1;
string ans = "Yes";
for( int i = 0; i < N; i++ ) {
if( mp.count( S[i] ) ) {
if( mp[ S[i] ] != T[i] ) {
ans = "No";
break;
}
}
else mp[ S[i] ] = T[i... | 0 | 32,719,232 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
using Graph = vector<vector<int>>;
int main() {
int n, m; cin >> n >> m;
Graph G(n);
rep(i, m) {
int a, b; cin >> a >> b;
a--; b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> dist(n, -1);
queue... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using Vertex = std::uint32_t;
using Weight = std::uint32_t;
using Graph = std::vector<std::vector<std::pair<Vertex, Weight>>>;
const auto Inf = std::numeric_limits<Weight>::max();
std::vector<Weight> Dijkstra(const Vertex s, const Graph& g)
{
... | 0 | 81,699,523 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typ... | #include <iostream>
#include <stack>
using namespace std;
bool issame(char a,char b){
if(a=='(')return b==')';
if(a=='[')return b==']';
}
int main(){
while(1){
string str;
getline(cin,str);
if(str[0]=='.')return 0;
char in;
stack<char> sta;
bool iscorrect=true;
int count=0;
while(... | 0 | 22,459,237 |
#include <iostream>
int answer[101];
int main(int argc, char const* argv[])
{
int input;
for( int i = 0;i < 101;i++ ) answer[i] = 0;
while( std::cin >> input ){
answer[input]++;
}
int max = 0;
for( int i = 1;i < 101;i++ ){
max = std::max( answer[i], max );
}
for( int i = 1;i < 101;i++ ){
if( answer[i] == ... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define P pair<lli,lli>
sign... | 0 | 47,713,361 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n,m;
cin >> n >> m;
vector<int> x;
rep(i,m){
int a,b;
cin >> a >> b;
if(a == 1) x.push_back(b);
if(b == n) x.push_bac... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
using namespace std;
void solve(long long A, long long B){
vector<string> left(25*100), right(25*100);
auto cnt=B-1;
for(int i=0; i<25*100; i++){
if((i/25)%2==0 && cnt>0){
left[i]="#.";
cnt--;
}
e... | 0 | 59,587,650 |
#include<bits/stdc++.h>
#define MAXN 1e5
using namespace std;
long long l,a,b,c,n;
int main(){
cin>>n;
vector<long long>v(n+1,0);
vector<long long>l(n,0);
for (int i=0; i<n; i++){
cin>>l[i];
v[l[i]]++;
}
for (int i=1; i<=n; i++){
a+=(v[i]*(v[i]-1))/2;
}
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = ll(1000000000+7);
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = ans*x % MOD;
x = x*x % MOD;
n = n >> 1;
}
return ans;
}
int main(void)
{
ll N, K;
cin >> N >> K;
vector<ll> ans... | 0 | 13,818,520 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define reps(i, s, n) for(int i = (s); i < (n); i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, s, n) for(int i = (n) - 1; i >= (s); i--)
#define INF ~(1 << 31)
#define INFL ~(1LL... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 0 | 23,196,269 |
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main(){
int d;
while(cin){
cin >> d;
if(!cin) break;
int itg=0;
for(int i=1;i*d<600;i++) itg+=pow(i*d,2)*d;
cout << itg << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n, m;
cin>>n>>m;
ll a[n];
priority_queue<ll> pq;
for (int i=0; i<n; i++){
cin>>a[i];
pq.push(a[i]);
}
ll cnt = 0;
while(!pq.empty() && cnt<m){
ll x = pq.top();
pq.pop();
... | 0 | 68,316,844 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typede... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | 0 | 6,652,510 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<... | #include<iostream>
#include<iomanip>
#include<vector>
#include<cmath>
using namespace std;
void koch_curve(const int n, const pair<double, double>& begin, const pair<double, double>& end){
if(n == 0){
return;
}
pair<double, double> p1, p2, p3;
p1.first = (2.0 * begin.first + end.first) / 3;
... | 0 | 90,080,806 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <climits>
#include <set>
#include <map>
#include <stack>
#include <iomanip>
#include <tuple>
#define ll long long
using namespace std;
ll factorial(ll n){
if(n==0){
return 1;
}
els... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> s(h, vector<char>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) cin >> s[i][j];
}
string ans = "Yes";
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if(s[i][... | 0 | 11,107,907 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvv vector<vvl>
#define vvi vector<vector<int> >
#define vvl vector<vect... | 0 | 2,351,488 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m,nmin,nmax,dmax,num;
while(true){
cin >> m >> nmin >> nmax;
if(m == 0 && nmin == 0 && nmax == 0) break;
int *score = new int[m];
for(int i = 0; i<m; ++i)
cin >> score[i];
for(int i=nmin; i<nmax+1; ++i){
if(i == nmin) dmax ... | #include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) { cin >> A[i]; }
sort(A.begin(), A.end());
vector<pair<int, int>> xy;
for (int i = 1; i < N - 1; ++i) {
if (A[i] > 0) {
xy.emplace_back( A[0], A[i] );
A[0] -= A[i]... | 0 | 54,546,197 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define f(i) for(i=0;i<=9;i++)
int main(){
int a,b,c,d,n,s,k=0;
while(scanf("%d",&n)!=EOF){
k=0;
f(a)
f(b)
f(c)
f(d){
if(n==a+b+c+d)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n,k;
cin >> n >> k;
vector<ll>h(n);
for(ll i=0;i<n;i++) cin >> h[i];
vector<ll>dp(n+1,MOD);
dp[0]=0;
for(ll i=0;i<n;i++){
for(ll j=0;j<=k;j++){
if(i-j<0) continue;
... | 0 | 81,934,770 |
#include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <functional>
#include <map>
#include <math.h>
#include <list>
using namespace std;
#define ll long long int
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
queue<ll> q;... | #define _USE_MATH_DEFINES
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <utility>
#include <climits>
#include <vector>
#include <map>
#include <queue>
using namespace std;
#define ll long long
const int MOD = 1000000007;
const string SPACE = " ";
ll max(ll a, ll... | 0 | 70,623,202 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[(" << __LINE__ << ") " << (#x) << "]: " << x << endl;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long double l;
cin >> l;
cout << setprecision(10) << fixed << (l/3) * (l/3) * (l/3) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
template <typename T, typename = typename std::enable_if<
std::is_integral<T>::value, T>::type>
map<T, int> prime_factorize(T n) {
map<T, int> cnts{};
if (n == 1) {
return cnts;
}
T a = 2;
while (n >= a * a) {
int cnt = 0;
whi... | 0 | 35,624,536 |
#include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int N,K,X,Y;
cin >> N >> K >>... | #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(10);
}
signed ... | 0 | 72,292,616 |
#include<bits/stdc++.h>
using namespace std;
const int INF = 1e9+7;
int n,A,B,C;
vector<int> l;
int dfs(int dep, int a, int b, int c){
if(dep==n){
int ret = (min(min(a,b),c) > 0)? abs(a-A)+abs(b-B)+abs(c-C)-30: INF;
return ret;
}
int ret0 = dfs(dep+1, a, b, c);
int ret1 = dfs(dep+1, a+l[dep], b, c)+10;
int ret... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define cout(x) cout<<x<<endl
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
using P = pair<int,int>;
using Mat = vector<vector<int>>;
const ll inf = 1e18;
const int N = 2e5+10;
int main(){
int ... | 0 | 58,159,728 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, l;
cin >> n >> l;
vector<string> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
for (auto s : v)
cout << s;
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll LINF = 0x1fffffffffffffff;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
template<class T>bool chmax(T &a, const T &b) {if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) {if (b<a) { a=b... | 0 | 25,226,068 |
#include <iostream>
using namespace std;
int ans[1005][1005];
int main() {
int h,w,a,b;
cin >> h >> w >> a >> b;
for(int i = 0; i < h; i++) {
if(i < b) {
for(int j = 0; j < w; j++) {
if(j < a) ans[i][j] = 0;
else ans[i][j] = 1;
}
}
else {
for(int j = 0; j < w; j++) {
if(j < a) ans... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define nl "\n"
#define pb push_back
#define fi first
#define se ... | 0 | 49,561,660 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | #include <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)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 85,975,880 |
#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long U... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 6,012,494 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
string S, T;
cin >> S >> T;
vector<int> s(26, -1);
vector<int> t(26, -1);
int count_s = 0;
int count_t ... | #include <cstring>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
using namespace std;
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i]; if (i < len - 1) s << "\t";
}
return s;
}
template<typename ... | 0 | 48,478,905 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
int A = 0;
int B = 0;
int buf;
for(int a = 0; a < 4; a++){
scanf("%d", &buf);
A += buf;
}
for(int a = 0; a < 4; a++){
scanf("%d", &buf);
B += buf;
}
printf("%d\n", max(A, B));
ret... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long gcd(long long a, long long b);
int main()
{
int n, k;
cin >> n >> k;
int mx = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
mx = max(mx, a[i]);
}
if (mx < k) {
cout << "IMPOSSIBLE" << endl;
} else {... | 0 | 27,748,315 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int LGA = 60;
int main(){
ios::sync_with_stdio(false);
int n;
cin >> n;
ll a[n];
ll f = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
f ^= a[i];
}
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/arc103_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | 0 | 64,607,923 |
#include<iostream>
using namespace std;
int data1[] = {0,20,19,20,19,20,19,20,19,20,19};
int data2[] = {0,20,20,20,20,20,20,20,20,20,20};
int main(){
int n;
int y,m,d;
int millennium = 1;
int ans = 0;
for(int i = 1; i <= 1000-1; i++){
for(int j = 1; j <= 10; j++){
if(i%3 != 0) millennium += data1[j];
else mi... | #include<bits/stdc++.h>
using namespace std;
int main(){
char In;
cin >> In;
switch(In){
case 'A':
cout << 'T' << endl;
break;
case 'C':
cout << 'G' << endl;
break;
case 'G':
cout << 'C' << endl;
break;
case 'T':
cout << 'A' << endl;
break;
defau... | 0 | 54,275,790 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define printVector(v) rep(i, v.size()) cout << v[i] << endl;
int main()
{
int N, Z, W;
cin >> N >>... | #include<iostream>
#include <vector>
using namespace std;
int main(){
while (1){
int m, nmin,nmax;
cin >> m >> nmin >> nmax;
if(m==0) break;
vector<int> pt(m+1);
for(int i=1; i<=m; i++){
cin >> pt[i];
}
int dmax=0, mx=0;
for(int i=nmin; i<=nmax; i++){
if(dmax <= pt[i]-pt[i+... | 0 | 100,660,928 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
int main() {
char x,y;
cin >> x >> y;
if(x > y){
cout << ">";
} else if(x == y){
cout << "=";
} else{
cout << "<";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL<<60)
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define YES puts("YES")
#define Yes puts("Yes")
... | 0 | 99,186,116 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
int main(){
ll n, m, d;
cin >> n >> m >> d;
if(d == 0){
printf(... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#... | 0 | 51,497,018 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define powerof2 ()
#define mp make_pair
#define pi acos(-1)
using ll = long long;
const ll M = 1000000007;
const ll M1= 998244353;
using vl = vector<ll>;
using pll = pair<ll,ll>;
ll power(ll x,ll y){
if(y==0)
return ... | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uni... | 0 | 1,025,458 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int d,a;
a = 0;
while(cin >> d){
for(int i = 0;i!=600;i+=d){
a += i*i*d;
}
cout << a << endl;
a = 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 1000000007;
const ll MOD2 ... | 0 | 24,279,900 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b;
cin >> a >> b;
string s;
cin >> s;
bool ok = true;
for(int i = 0; i < a + b + 1; i++)
{
if(i == a)
{
if(s[i] != '-')
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<long long> a(n), nums(n+1);
for (int i = 0; i < n; i++) {
cin >> a[i];
nums[a[i]]++;
}
long long ans = 0;
for (int i = 1; i <= n; i++) ans += nums[i] * (nums[i] - 1)... | 0 | 83,699,871 |
#include "bits/stdc++.h"
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
long long sum=0;
for(auto i : s)sum+=i-'0';
if(sum%9)cout<<"No"<<endl;
else cout<<"Yes"<<endl;
} | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
string X,Y;
int l=0;
int point;
cin>>X>>Y;
int N[X.size()+1][Y.size()+1];
for(int i=0;i<=Y.size();i++){
N[0][i]=i;
}
for(int i=1;i<=X.size();i++){
N[i][0]=i;
}
for(int i=1;i<=X.size();i++){
for(int ... | 0 | 74,521,505 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#inc... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
char maze[100][100];
int main() {
int h, w;
cin >> h >> w;
vector<P> rec;
rep(i,h) rep(j,w) {
... | 0 | 47,844,373 |
#include<iostream>
main(){long long n,i;std::cin>>n;for(i=n;--n;)i*=n;std::cout<<i<<"\n";} | #include<iostream>
#include<algorithm>
using namespace std;
char tyle[30][30]={'0'};
int find_tyle(int i,int j){
if(tyle[i+1][j]=='.'){
tyle[i+1][j]='a';
find_tyle(i+1,j);
}
if(tyle[i][j+1]=='.'){
tyle[i][j+1]='a';
find_tyle(i,j+1);
}
if(tyle[i-1][j]=='.'){
tyle[i-1][j]='a';
find_tyle(... | 0 | 16,110,519 |
#include<bits/stdc++.h>
#define FRU freopen("out.txt","w",stdout)
#define FRO freopen("in.txt","r",stdin)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mem(ara,n) memset(ara,n,sizeof ara)
#define loop(i,j,n) for(i=j;i<n;i++)
#define rloop(i,j,n) for(i=n;i>=j;i--)
#define INF 21474... | #include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | 0 | 7,424,818 |
#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
const int INF = 1e9;
int n, q;
const int SIZE = 10010;
class Unionfind{
public:
int par[SIZE], cnt[SIZE];
void init(int n){
for (in... | #include <stdlib.h>
#include <iostream>
using namespace std;
int selection_sort(int *array, int n);
void print_array(int *array, int size);
int main(){
int n;
cin >> n;
int* array = (int*)malloc(n * sizeof(int));
if(n < 1){
return 0;
}
for(int i = 0; i < n; i++){
cin >> array[i];
}
int result = selection_so... | 0 | 63,336,327 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | #include<algorithm>
template<class T>
int mcm(T first, T last) {
const auto N = std::distance(first, last) - 1;
int dp[N][N];
std::fill(dp[0], dp[N], 1 << 28);
for (int i = 0; i < N; ++i) dp[i][i] = 0;
for (int L = 1; L < N; ++L)
for (int i = 0; i < N - L; ++i) {
int j = i + L;
... | 0 | 52,562,356 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N,K;
ll A[1001];
ll C[64];
bool ng[1000000];
int main(){
cin >> N >> K;
for(int i=1;i<=N;i++) cin >> A[i];
for(int i=0;i<N;i++) A[i+1] += A[i];
vector<ll> v;
for(int i=0;i<N;i++){
for(int j=i+1;j<=N... | #include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string s;
cin>>s;
if(s[0] == s[1] && s[1] != s[2] && s[2] == s[3]){
cout<<"Yes";
}
else if(s[0] == s[2] && s[2] != s[1] && s[1] == s[3]){
cout<<"Yes";
}
else if(s[0]... | 0 | 42,559,052 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> ac(n);
vector<int> wa(n);
int t_ac = 0;
int t_wa = 0;
... | 0 | 29,453,664 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
template <typename T>
istream& operator>>(istream& is, vector<T>& vec) {
for (T& x: vec) { is >> x; }... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
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;}
int ... | 0 | 65,919,518 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <db, db> pdd;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;
#define FOR(k,a,b) for(int k=(a); k... | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) r... | 0 | 96,945,875 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, max=0, s[100];
for(int i=0; i<100; i++) {
s[i]=0;
}
while(cin >> n) {
s[n-1]++;
}
for(int i=0; i<100; i++) {
if(s[i]>max)
max=s[i];
}
for(int i=0; i<100; i++) {
if(s[i]==max)
cout << i+1 << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define input freopen("1.txt","r",stdin);
#define output freopen("output.txt","w",stdout);
#define ll long long int
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define vi vector<int>
#define vii vector<vi>
... | 0 | 78,906,354 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define P pair<int, int>
#define fi first
#define se second
#define INF (1 << 30)
#define REP(i, n) for (int i = 0; i < n; i++)
const int MAX_V = 100000;
struct edge {
int to, cost;
};
int V;
vector<edge> G[MAX_V];
int d[MAX_V];
void bfs01(int s) {
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
int sum = accumulate(a.begin(), a.end(), 0);
int num = a.size();
int ave = sum ... | 0 | 11,612,184 |
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
#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 RRE... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i=0; i<(n); ++i)
#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)
#define SZ(x) ((int)(x).size())
#define all(x) begin(x),end(x)
#define... | 0 | 70,593,862 |
#include <bits/stdc++.h>
#define For(i, j, k) for (int i = j; i <= k; ++ i)
#define Forr(i, j, k) for (int i = j; i >= k; -- i)
using namespace std;
inline int read() {
int x = 0, p = 1; char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') p = -1;
for (; isdigit(c); c = getchar()) x = (x << 1) + (x <... | #include<iostream>
#include<string.h>
using namespace std;
int main(){
char kata[10];
cin >> kata;
if(kata[2] == kata[3] && kata[4] == kata[5]){
cout << "Yes" << endl;
}else{
cout <<"No"<<endl;
}
return 0;
} | 0 | 77,952,786 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
return b;... | 0 | 47,990,624 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
long long lcm = 1;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
long long gcd = __gcd(x, lcm);
lcm = x / gcd * lcm;
}
cout << lcm <... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define umap unordered_map
#define... | 0 | 57,571,160 |
#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) {
cout << (A==B ? C : B==C ? A : B) << endl;
}
int main() {
ll A;
cin >> A;
ll B;
cin >> B;
... | #include<iostream>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int c=0,u=0,d=0,l=-1;
string str;
for(int i=0;i<n;i++){
cin>>str;
if(str=="lu"||str=="ru"){
if(l==0)
c++;
l=0;
}
... | 0 | 85,681,216 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.