code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<functional>
#include<iterator>
#include<iostream>
#include "bits/stdc++.h"
#define IO ios_base::sync_with_stdio(false);cin.tie(0);
#define mem(a,val) memset(a,val,sizeof(a))
#define pb push_back
using namespace std... | #include <bits/stdc++.h>
using namespace std;
int m[32005][4005];
vector <int> p;
bool solve(int val, int ind){
if(ind==p.size()){
return (val==0);
}
int mval=val+16002;
if(m[mval][ind]!=-1){
return m[mval][ind];
}
return m[mval][ind]=(solve(val-p[ind],ind+1) || solve(val+p[ind],... | 0 | 5,846,226 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 15,168,901 |
#include <iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if( a<0 || b<0 || c<0 || a>100 || b>100 || c>100 ){
cout << "error." << endl;
return 0;
}
if( a<b && b<c ){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>
#in... | 0 | 33,089,305 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n, k;
cin >> n >> k;
vector<bool> hasSweet(n);
for (long i = 0; i < k; i++) {
long d;
cin >> d;
for (long j = 0; j < d; j++) {
long a;
cin >> a;
hasSweet[a - 1] = true;
}
}
long total = 0;
for (long i = 0... | 0 | 86,965,296 |
#include <bits/stdc++.h>
#define int long long
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("avx,avx2,sse")
using namespace std;
bool pal(string s, int a, int b) {
a--;
b--;
int i = a;
int j = b;
while (i < j) {
if (s[i] != s[j]) return false;... | #include <cmath>
#include <iostream>
#include <algorithm>
#include <list>
struct Point
{
double x;
double y;
};
Point GetU(const Point& s, const Point& t)
{
const double thete = 60. / 180. * M_PI;
Point st = {t.x - s.x, t.y - s.y};
Point su = {st.x * std::cos(thete) - st.y * std::sin(thete), st.x * ... | 0 | 63,494,920 |
#include <string>
#include <iostream>
using namespace std;
int main (){
while(1){
string input = "";
int m = 0;
cin >> input;
if(input == "-") break;
cin >> m;
int *H = new int[m]();
for(int i=0; i<m; i++){
cin >> H[i];
}
for(int i=0; i<m; i++){
input = input.substr(H[i]) + input.substr(0, H[i]... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 41,673,741 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int n;
cin>>n;
for (int i=0; 4*i<=n; i++) {
for (int j=0; 7*j<=n; j++) {
if (4*i+7*j==n) {
... | #include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
typedef pair<int,int> P;
const int maxn=2e5+100;
int k;
bool vis[maxn];
int main()
{
while (scanf("%d",&k)!=EOF)
{
memset(vis,0,sizeof(vis));
deque<P> q;
q.push_front(make_pair(1,1));
... | 0 | 48,416,253 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define mod ((int)1e9+7)
#define lim 1000000000000000007
#define lim1 18446744073709551615
#define sq(a) ((a)*(a))
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mms(v,i) memset(v,i,sizeof(v))
#d... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define INF (1ll<<60)
#define mod 1000000007
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;} return false;}
template<class T> inline bool ... | 0 | 56,083,073 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s,t;
cin >> s >> t;
int count = 0;
rep(i,s.size()){
if(t.at(i) == s.at(i)){
count++;
}
}
if(count == s.size()){
cout << "Yes... | #include <iostream>
#include <cstdlib>
#include <map>
#include <utility>
#include <algorithm>
using namespace std;
int main()
{
map<int, int> iData;
int iBuff, maxCount = 0, maxElement[100];
pair<map<int, int>::iterator, bool> flag;
while(cin >> iBuff)
{
flag = iData.insert(map<int, int>::va... | 0 | 20,826,901 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (long unsigned int i=0; i<s.length()-2; i++){
if (s[i] == s[i+1]){
cout << i+1 << " " << i+2;
return 0;
}
if (s[i] == s[i+2]){
cout << i+1 << " " << i+3;
... | #include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
#include<map>
using namespace std;
#define int long long int
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define... | 0 | 76,363,447 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
typedef long double ld;
template <class T, class U>
bool contain(const std::basic_strin... | #include <stdio.h>
#include <string.h>
int main() {
int a,b;
char s[15];
int counter = 0;
scanf ("%d %d", &a, &b);
scanf ("%s", &s);
for (int i=0; s[i] != '\0'; i++){
if (s[a] != '-') {
printf ("No\n");
return 0;
}
if (s[i] >= '0' && s[i] <= '9'){
counte... | 0 | 25,398,981 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N/100-N/1000*10 != N/10-N/100*10){
cout << "No" << endl;}
else if ((N/1000 == N/100-N/1000*10) || (N/10-N/100*10 == N-N/10*10)){
cout << "Yes" << endl;}
else{
cout << "No" << endl;}
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 500000000
#define IOS ios_base::sync_with_stdio(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prll(a,sz) cout<<a[0];for(... | 0 | 24,628,173 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
typedef long double ld;
typedef long long ll;
using namespace std;
int main() {
string s, t, u;
int a, b;
cin >> s >> t;
cin >> a >... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
int main(){
ll N;cin>>N;
vector<pair<ll,int>> a(N);
REP(i, N){
cin >> a[i].first;
... | 0 | 57,628,493 |
#include<iostream>
using namespace std;
long long int kaizyo(int x){
if(x<2)return 1;
return x*kaizyo(x-1);
}
int main(){
int n;
long long int a;
cin>>n;
a=kaizyo(n);
cout<<a<<endl;
} | #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define INF 1<<30
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#... | 0 | 35,103,144 |
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define MAX 1000005
#define pb push_back
#define vi vector<int>
#define endl '\n'
using namespace std;
string b;
int k;
vi num;
int dp[105][4][2];
int call(int pos,int cnt,int f)
{
if(cnt>k)
return 0;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) m... | 0 | 7,821,984 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ull = unsigned long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<ull> a;
rep(i, n+1){
... | 0 | 22,055,860 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 13,666,983 |
#include <bits/stdc++.h>
using namespace std;
#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)):((m)-(n))),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define loop for(;;)
#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vll;
#define fi first
#define print(v) for(ll i:v) cout<<i<<ss
#define se second
#define pb push_back
#define nn "\n"
... | 0 | 75,376,613 |
#include<iostream>
using namespace std;
int main(){
int n, m, p;
int x[100];
while(1){
float ans = 0;
for(int i=0; i < 100; i++) x[i] = 0;
cin >> n >> m >> p;
if((n | m | p) == 0) break;
for(int i=0; i < n; i++){
cin >> x[i];
ans+= x[i];
}
if(x[m-1] == 0){
cout << 0 << endl;
continue;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<int> b(N - 1);
rep(i, N - 1) ... | 0 | 88,845,852 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include <bits/stdc++.h>
using namespace std;
const int N = (int)5005, mod = 1004535809;
int n, k;
int a[N];
int dp[2 * N];
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) cin >> a[i];
dp[0] = 1;
for(int i = 0; i < n; i++) {
if(a[i] >= k) continue;
for(int j = k - a[i]; j >= 0; j... | 0 | 91,976,599 |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
#include <iostream>
using namespace std;
int main ()
{
int a,b,c,d;
scanf("%i%i%i%i",&a,&b,&c,&d);
int r=0;
r+=min(a,b);
r+=min(c,d);
printf("%i",r);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, s;
cin >> n >> k >> s;
vector<int> a(n);
for(int i=0; i<k; i++) a[i] = s;
for(int i=k; i<n; i++){
if(s == 1e9) a[i] = s - 1;
else a[i] = s + 1;
}
for(int i=0; i<n; i++){
cout << a[i];
if(i == ... | 0 | 62,709,167 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
ll n;
cin >> n;
if(n % 2 == 1)
cout << 0 << endl;
else {
ll cnt = 0, fty = 10;
while(n >= fty) {
cnt += n / fty;
... | #include<iostream>
#include<stdio.h>
#include<cstring>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<cmath>
#define ll long long
#define d double
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
size_t n=s.size();
n=n-... | 0 | 13,729,539 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int h,w;
string al = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
cin >> h >> w;
vector<vector<string>> s(h, vector<string>(w));
rep(i,h... | #include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
#include<map>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int a,b;
int main(){
cin >> a >> b;
rep(i,10001){
if(i*8/100 == a && i*1/10 == b){
cout << i << endl;
... | 0 | 33,174,981 |
#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() {
int n,a,b;
cin>>n>>a>>b;
vector<int>... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string s;
cin>>s;
map<char,int>M;
M[')']=0;
M['(']=0;
for(int i=0;i<N;i++){
if(s.at(i)=='(')
M.at('(')++;
else{
if(M.at('(')==0)
M.at(')')++;
else
M.at('(')--;
}
}int R=M.at(')');
int L=M.at('... | 0 | 7,503,814 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
char A;
char B;
int C=1;
string S;
cin >> N >> S;
B = S.at(0);
for(int i=0; i<S.size() ; i++)
{
A = S.at(i);
if(A!=B)
{
C++;
B=A;
}
}
cout << C << endl;
} | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmat... | 0 | 21,276,175 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).... | #include<iostream>
using namespace std;
int main() {
int N, K; cin >> N >> K;
int A[N]; for (int i = 0; i < N; i++) cin >> A[i];
long min_cost = (1L<<60);
for (int b = 0; b < (1<<N); b++) {
long cost = 0;
int max_h = 0;
int color_num = 0;
int B[N]; for (int i = 0; i < N; i++) B[i] = A[i];
fo... | 0 | 100,596,926 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loopinc(i, a, b, inc) for(int i = a; i < (b); i += inc)
#define loop(i, a, b) for(int i = a; i < (b); i++)
#define rep(i, n) loop(i, 0, n)
#define rrep(i, n) for (int i = n-1; i >= 0; i--)
#define endl "\n"
#define all(c) (c).begin(),(c).end()
... | 0 | 93,367,386 |
#include "bits/stdc++.h"
using namespace std;
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin()... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<class T> inline b... | 0 | 68,751,906 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
int main(){
ll A;
string B;
cin >> A >> B;
ll B100 = (B[0] - '0') * 100 + (B[2] - '0') * 10 + (B[3] - '0');
cout << A * B100 / 100 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n1,n2,n3,n4;
cin>>n1>>n2>>n3>>n4;
int cnt1=0,cnt9=0,cnt7=0,cnt4=0;
if(n1==1)
cnt1++;
else if(n1==9)
cnt9++;
else if(n1==7)
cnt7++;
else if(n1==4)
cnt4++;
if(n2==1)
cnt1++;
else if(n2==9)
... | 0 | 69,418,275 |
#include <iostream>
using namespace std;
int main() {
int a[5][4][11];
for (int i = 1; i < 5; ++i)
{
for (int j = 1; j < 4; ++j)
{
for (int k = 1; k < 11; ++k)
{
a[i][j][k]=0;
}
}
}
int n,b,f,r,v;
cin>>n;
for (int i = 0; i < n; ++i)
{
cin>>b>>f>>r>>v;
a[b][f][r]+=v;
}
for(int j=1; j<=3... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 18,102,750 |
#include <bits/stdc++.h>
#define ll long long int
#define ii int
#define du double
#define jmp "\n"
#define vl vector<ll>
#define vvl vector<vl>
#define pb push_back
#define printv(v) \
for (auto x : v) \
cout << x << " "; \
cout << jmp;
#define vi vector<int>
#define vb vector<bool>
#define ump unordere... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int 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++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcountll(bit)
using namespace std;
template<class T> bool chmax(T &a, c... | 0 | 59,174,792 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll x,y;
cin>>x>>y;
ll ans=0;
vector<ll>v;
for(ll i=x;i<=y;){
v.push_back(i);
if(i*2<=y)i=i*2;
else break;
}
cout<<v.size();
} | #include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf ... | 0 | 14,316,606 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
vector<int> a(n);
rep(i,n)cin>>a[i];
int ans=0;
rep(i,n-1){
if(a[i]==a[i+1]){
ans++;
a[i+1]=0;
}
}
cout<<ans<<en... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int i=0,j,c=0,k;
string s;
cin >> s;
k=s.size();
if(s[0]!='A' || s[1]<'a' || s[k-1]<'a' )
{
cout << "WA" << endl;
return 0;
}
for(i=2;i<k-1;i++)
{
if(s[i]=='C')
{
c++;
... | 0 | 88,048,052 |
#include <iostream>
using namespace std;
int main(){
int N;
int A;
cin >> N >> A;
if ( N % 500 <= A) {
cout << "Yes" << endl;
}
if ( N % 500 > A) {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int a, b;
cin >> a >> b;
if(a == 1 && b == 1) {
cout << "Draw" << endl;
return 0;
}else if(a == 1){
... | 0 | 37,715,782 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, seisu) for(int i = 0; i < (int)(seisu); i++)
typedef long long ll;
int main(){
int r, g, b, n;
cin >> r >> g >> b >> n;
int rn, gn;
rn = n / r + 1;
gn = n / g + 1;
ll ans = 0;
rep(i, rn){
rep(j, gn){
ll rg = n - (i * r + j * g);
... | #include <algorithm>
#include <iostream>
#include <string.h>
#include <cstdlib>
#include <vector>
#include <string>
#include <bitset>
#include <math.h>
#include <queue>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7, INF = 1e18 + 1;
using namespace st... | 0 | 45,160,342 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
... | 0 | 9,139,594 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
string t;
cin >>s;
cin >>t;
if (t.substr(0,s.size())==s){
cout <<"Yes";
}
else {
cout <<"No";
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
#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 rall(a) (a).rbegin(),(a).rend()
#define ve vector
#define vi vector<int>
#d... | 0 | 25,459,379 |
#include <iostream>
using namespace std;
void countingSort(int *a, int *b, int k, int n){
int *c = new int[k+1];
for(int i=0;i<k+1;++i)c[i] = 0;
for(int j=0;j<n;++j)c[a[j]]++;
for(int i=1;i<k+1;++i)c[i] += c[i-1];
for(int j=n-1;j>=0;--j){
b[c[a[j]]-1] = a[j];
c[a[j]]--;
}
}
int max(int *a, int n){
int m = 0;... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int gcd(int a, int b) {
if(a<b) swap(a, b);
return b?gcd(b,a%b):a;
}
int lcm(int a, int b) {
ll ret=(ll)a... | 0 | 29,005,178 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... | 0 | 57,059,679 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(),(x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) {... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | 0 | 14,901,707 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> i_i;
const int MOD = 1e9 + 7;
const ll INF = LLONG_MAX / 2;
int main() {
ll x = 1;
int t;
for (t = 0; t < 12; t++) {
cout << "? " << x << endl;
string ans;... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 66,159,680 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int h = 2, w = 3;
vector<string> vs(h);
for (int i = 0; i < h; ++i) {
cin >> vs[i];
}
reverse(vs[0].begin(), vs[0].end());
if (vs[0] == vs[1]) {
cout << "YES" << '\n';
} else {
cout << "NO" << '\n';
}
re... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 86,080,428 |
#include <bits/stdc++.h>
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
int main(){
int n,ans = 0;cin >>n;
string s,t;cin >> s >>t;
if(s==t){
cout << n;return 0;
}
fo(i,n){
if((s.substr(n-1-i,i+1)==t.substr(0,i+1))&&(i+1 > ans)){
ans = i+1;
}
}
cout << 2*n... | #include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debugg cout<<"debugged\n";
#define minva... | 0 | 98,315,804 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
retu... | 0 | 7,032,661 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<math.h>
using namespace std;
int main(){
int ret=0;
int sum = 0;
while (scanf("%d", &ret) != EOF){
for (int i = 1; i*ret <= 600-ret ;i++){
sum += pow(i*ret,2) * ret;
}
cout << sum << endl;
sum = 0;
}
return 0;
} | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
using namespace std;
typedef long long LL;
ty... | 0 | 82,885,960 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef pair<int,int> P;
#define fi first
#define se second
#define all(v) (v).begin(),v.end()
const ll inf=(1e18);
const ll mod=1000000007;
const ll mod2=998244353;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/gcd(c,d)*d;}
ll ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<utility>
#include<cmath>
#include<assert.h>
#define int long long
using namespace std;
#define rep(i, n) for(int i=0;i<(n);++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound... | 0 | 70,132,330 |
#include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n); i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#define r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
#define PRYES(x) PR((x) ? "Yes" : "No")
const lo... | 0 | 61,190,033 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long int ll;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define MOD 1000000007
#define f firs... | #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... | 0 | 11,435,892 |
#include<iostream>
using namespace std;
int a[1000000];
int sum[1000000];
int n;
int main(){
for (int i=2;i<1000000;i++){
if (!a[i])
for (int j=i*2;j<1000000;j+=i)
a[j]=1;
}
for (int i=2;i<1000000;i++) sum[i]=sum[i-1]+(a[i]==0?1:0);
while (cin>>n)
cout<<sum[n]<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i < n; i++)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll INF = 1e18;
int main(){
int N;
cin >> N;
do... | 0 | 74,269,368 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <c... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 2000000000
typedef long long ll;
bool compare(pair<int, int> a, pair<int, int> b) {
if(a... | 0 | 19,149,522 |
#include <bits/stdc++.h>
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (m); --i)
template<class T, class U> void chmax(T &a, U b) { if (a < b) a = b; }
template<cl... | #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(){
int N, K;
cin >> N >> K;
int upper = (N - 1... | 0 | 9,100,238 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n;
cin >> n;
map<string,int> a;
rep(i,n){
string c;
cin >> c;
a[c]++;
}
int m;
cin >> m;
map<string,int> b;
rep(i,m){
string c;
c... | 0 | 45,624,837 |
#include <iostream>
#include <complex>
#include <cmath>
#include <cstdio>
using namespace std;
const double eps = 1e-12;
double cross(complex<double> a, complex<double> b) {
return a.real() * b.imag() - a.imag() * b.real();
}
int main() {
complex<double> t1, t2, t3, p;
while(cin >> t1.real() >> t1.imag() >>... | #include<iostream>
#include<string>
#include<stack>
int main(){
while(1){
std::stack<char>Cstr;
Cstr.push(' ');
std::string str;
int count=0;
std::getline(std::cin,str);
if(str==".")break;
for(int i=0;i<str.size();i++){
if(str[i]=='('||str[i]=='['){
count++;
Cstr.push(str[i]);
}else if(str[... | 0 | 83,533,086 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
template<class T... | 0 | 85,459,962 |
#include <iostream>
using namespace std;
int main(void) {
string s,p;
bool flag = false;
cin >> s;
cin >> p;
s += s;
if(s.find(p) != string::npos)
flag = true;
if(flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include<iostream>
#include<cstring>
#define rep(i,n) for(int i=0; i<n; i++)
int main(){
int n;
char m[5] = {'m','c','x','i'};
int num[4] = {1000,100,10,1};
std::cin >> n;
rep(h,n){
char str[2][9];
int ans[2] = {0,0}, answer;
rep(i,2){
memset(str[i],'0',8);
std::cin >> str[i];
char mjk;
rep(j,8){... | 0 | 55,514,507 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
const int INF = 999999999;
int main(){
ll Q, H, S, D, N;
cin >> Q >> H >> S >> D >> N;
if(Q * 2 <= H){
H = 2 * Q;
}
if(H * ... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n; cin >> n;
vector<int> a(n);
vector<int> c(n+1);
for (int _ = 0; _ < n; _++) {
int x; cin >> x;
a[x-1]++;
}
for (int x: a) c[x]++;
int sum = n;
int last = n;
cout << last << "\n";
int wasted = 0;... | 0 | 52,475,493 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#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 >... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
string s1;
string s2;
cin>>s1;
cin>>s2;
int l=s1.length();
int m=s2.length();
vector<vector<int>> Table(l+1,vector<int>(m+1));
for(int i=0;i<l+1;i++){
Table[i][0]=i;
}
for(int j=0;j<m... | 0 | 95,898,180 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <list>
#include <map>
#include <set>
using namespace std;
typedef unsig... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), c(n);
rep(i, n) cin >> a[i];
copy(a.begin(), a.end(), c.begin());
sort(c.begin(), c.end(), greater<int>());
... | 0 | 76,014,637 |
#include <bits/stdc++.h>
using namespace std;
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; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 49,588,968 |
#include <iostream>
#include <algorithm>
#define MAX_INT 100005
using namespace std;
#define MAX_X 22
#define MAX_Y 22
char field[MAX_X][MAX_Y];
int X, Y;
int px, py;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
void initialize_field() {
for (int y = 0; y < Y; y++ ) {
for (int x ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4;
struct node
{
int x, y;
} point[maxn];
bool cmp(node a, node b)
{
return atan2(a.x, a.y) < atan2(b.x, b.y);
}
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> point[i].x >> point[i].y;
}
long lo... | 0 | 87,553,700 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
int main() {
int n;
cin >> n;
vector<ll> a(n+1);
a.at(0) = 2;
a.at(1) = 1;
for(int i = 2; i <= n; i++){
a.at(i) = a.at(i-1) + a.at(i-2);
}
cout << a.at(n) << endl;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
string str;
string ttr;
cin >> str;
cin >> ttr;
int n;
n = str.size();
for(int i=0; i<n; i++){
if(str[i] != ttr[i]){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;... | 0 | 99,392,347 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 0 | 27,133,377 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<ll,null_type,less<ll>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define int ll
#define endl "\n"
#define all( x ) x.begin(), x.... | #include <iostream>
void checkTringle(int a,int b,int c){
if(a * a == b * b + c * c){
std::cout << "YES" << std::endl;
}else{
std::cout << "NO" << std::endl;
}
}
int main(int argc, char *argv[])
{
int dataSize;
std::cin >> dataSize;
int side[3];
for(int i=0; i<dataSize; i++){... | 0 | 79,548,647 |
#include <iostream>
#include <string>
#include <utility>
#include <map>
using namespace std;
typedef pair<int, char> P;
P bCards[36];
P sCards[36];
P iCards[36];
void bubbleSort(int n){
for(int i=0; i<n; ++i){
int x = bCards[i].first;
for(int j=n-1; j>i; --j){
if(bCards[j].first < bCards... | #include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pb push_back
#define mk mak... | 0 | 1,931,862 |
#include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
if(x&1) ans=ans*a%MOD;
a=a*a%... | #include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <tuple>
#include <numeric>
#include <assert.h>
#include <fu... | 0 | 62,239,140 |
#include <iostream>
using namespace std;
int main(){
int h,w,i;
string ans="",temp1="#",temp2="";
while(1){
cin>>h>>w;
if (h==0&&w==0)break;
else{
for (i=0;i<w-2;i++)temp1+=".";
temp1+="#\n";
for (i=0;i<w;i++)temp2+="#";
temp2+="\n";
ans+=temp2;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
using namespace std;
int main(){
int n, ans = 0;
cin >> n;
vector<int> vc;
for(int i=0; i<n; i++){
int a;
cin >> a;
vc.push_back(a);
}
sort(vc.begin(), vc.end());
vector<int>... | 0 | 16,655,477 |
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
int num[1000000]={0};
num[0]=1;
num[1]=1;
for(int i=2;i<1000000;i++){
if(num[i]==0){
for(int j=2;j*i<1000000;j++){
num[j*i]=1;
}
}
}
while(scanf(" %d",&n)!=EOF){
int cnt=0;
f... | #include <iostream>
#include <string>
#include <math.h>
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
string S, T;
int INF = 1e9+1;
int dp[1010][1010];
int main(void){
cin >> S >> T;
Fill(dp, INF);
dp... | 0 | 11,662,511 |
#include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
int main() {
ll n;
cin >> n;
vector<float> vect(n);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef map<int, int> mii;
typedef pair<int, int> ii;
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
#d... | 0 | 31,181,278 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string a,b;
cin >> a >> b;
if ((a == "H" && b == "H") || (a == "D" && b == "D")) {
cout << "H" << endl;
} else {
cout << "D" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main()
{
ll n; cin >> n;
vector<ll> a(n);
... | 0 | 58,076,726 |
#include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(),in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
ll GCD(ll a, ll b){
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef ... | 0 | 15,459,716 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
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() {
ll n, x; cin >> n >> x;
ll minx = x;
vector<ll> v(n + 1);
v[0] = x;
for (int i = ... | #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 name... | 0 | 71,423,973 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x,y) for(ll i=x;i<=y;i++)
#define imin INT_MIN
#define pll pair<ll,ll>
#define imax INT_MAX
int mod =1e9+7;
int main(){
cin.tie(NULL);
ios_base::sync_with_stdio();
ll d,t,k;
cin>>d>>t>>k;
if(k*t>=d) cout<<"Yes\n";
else cout<<"No\n... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ldb;
typedef pair <ll,ll> pll;
typedef pair <ll,string> pls;
typedef pair <string, ll> psl;
typedef vector <ll> vl;
typedef vector <pll> vll;
typedef vector <string> vs;
typedef vector <char> v... | 0 | 77,947,191 |
#include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#... | #include <stdio.h>
int main(void) {
int n[100000], x[100000], cnt[100000] = {0};
int i, j, k, l, num;
num = 0;
do {
scanf("%d %d", &n[num], &x[num]);
num++;
} while (!(n[num - 1] == 0 && x[num - 1] == 0));
i = 1;
j = 2;
k = 3;
for (l = 0; l < num; l++) {
for (i = 1; i < j; i++) {
for... | 0 | 80,281,358 |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, a;
cin >> n;
vector<int> slime(n);
for (int i = 0; i < n; ++i) cin >> slime[i];
int ans = 0;
for (int i = 0; i < n - 1; ++i) {
if (slime[i] == -1) continue;
if (slime[i] == slime[i + 1]) {
slime[i + 1] = -1;
++ans;
}
}... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main() {
string sa[1000];
int ia[1000] = {};
int cnt = 0;
string s, ss = "";
while(cin >> s) {
for(int i = 0; i < s.size(); i++) {
if('A' <= s[i] && s[i] <= 'Z') s[i] += 'a'-'A';
}
int p = -1;
for(int i = 0;... | 0 | 50,698,009 |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | 0 | 41,256,685 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vector>
#define fix(n... | #include <iostream>
#include<iomanip>
#include <vector>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main() {
double n,k;
cin>>n>>k;
double ans=0;
vector<double>p(n,1/n);
rep(i,n){
if(i<k-1)p[i]*=0.5;
double b=2;
while(b<(double)(k/(i+1))){
... | 0 | 18,269,122 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a[101][101];
int n,u,k,x;
memset(a,0,sizeof(a));
cin>>n;
for (int i=0; i<n; i++){
cin>>u>>k;
while (k--){
cin>>x;
a[u][x]=1;
}
}
for (int i=1; i<=n; i++){
cout<<a[i][1];
for (int j=2; j<=n; j++)
cout<<' '<<a[i][j];
cout<<'\n... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb emplace_back
signed main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, x;
cin >> n >> x;
int ans = n;
int a = x;
int b = n - x;
while (a != 0)
{
i... | 0 | 24,591,594 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K; cin >> N >> K;
long ans = 15000000000;
vector<long> a(N);
for (int i =0; i<N; i++) cin >> a[i];
vector<long> maxA(N); maxA[0] = a[0];
for (int i =1; i<N; i++)
maxA[i] = max(a[i-1],maxA[i-1]);
for (int i =0; i< (1<<(N-1)); i++) {
... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... | 0 | 85,758,836 |
#include <iostream>
#include <cmath>
#include <string>
#include <numeric>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <vector>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i_, __start, __end) for(ll i_=(ll)__start; i_<(ll)__end; i_++)
#define print(_a) cout << _a <<... | #include<bits/stdc++.h>
using namespace std;
long long gcd(long long a,long long b) {
if (a > b) {
swap(a,b);
}
if (b%a == 0) return a;
return gcd(a,b%a);
}
long long lcm(long long a,long long b) {
long long x;
x = a / gcd(a,b);
x *= b;
return x;
}
int main() {
long long N,M;
cin >> N >> M;
ve... | 0 | 66,499,882 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
string s, t;
cin >> s >> t;
int cnt = 0;
for(int i = 0; i < min(s.size(), t.size()); i++){
if(s[i] != t[i]) cnt++;
}
cout << cnt << endl... | #include<iostream>
#include<string>
using namespace std;
int main(){
string str;
while(cin>>str,str!="-"){
int n;
cin>>n;
char str2[1300];
for(int i=0;i<n;i++){
int shu;
cin>>shu;
for(int i=0;i<shu;i++)
str2[str.size()-shu+i]=str[i];
for(int i=0;i<str.size()-shu;i++)
str2[i... | 0 | 52,301,610 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n,m,ans=0;
cin >> n >> m;
string s;
for(int i=n; i<=m; i++)
{
s=to_string(i);
if(s[0]==s[4]&&s[1]==s[3])
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, C, K; cin >> N >> C >> K;
vector<int64_t> vec(N);
for (int i = 0; i < N; i++) cin >> vec[i];
sort(vec.begin(), vec.end());
int64_t timeMemo = vec[0] + K, passenger = 0, ans = 0;
for (int i = 0; i < N; i++) {
if (vec[i] <= timeMemo) {
... | 0 | 80,492,497 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int BUF = 200005;
int nNode, nEdge;
int edge[BUF][2];
void read() {
cin >> nNode;
nEdge = nNode - 1;
for (int i = 0; i < nEdge; ++i) {
cin >> edge[i][0] >> edge[i][1];
--edge[i][0];
--edge[i][1];
}... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main()
{
int N; cin >> N;
vector<Int> A(N); for (auto& a : A) cin >> a;
Int cnt = 0;
Int minimum = *min_element(begin(A), end(A));
for (auto& a : A) {
a -= minimum;
cnt += a / (N+1);
a %= N+1;
}
... | 0 | 96,540,290 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m; cin >> n; cin >> m;
int ans = 0;
if(n >= 2) ans += n*(n-1)/2;
if(m >= 2) ans += m*(m-1)/2;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
string S;
cin >> S;
string year = S.substr(0, 4);
string month = S.substr(5, 2);
string day = S.substr(8, 2);
auto F = [] (string year, string month, st... | 0 | 48,841,410 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n,y; c... | 0 | 43,635,970 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9+7; ll LLINF = 1LL << 60; int INF = INT_MAX;
int main(){
int a,b,c; cin>>a>>b>>c;
map<int,int> m;
m[a]++; m[b]++; m[c]++;
cout... | #include <iostream>
using namespace std;
#define MAX 1000000
struct Node {
int parent, left, right;
};
struct Node T[MAX];
int D[MAX];
int get_depth(int);
void setDepth(int, int);
int main() {
int n;
int n2;
int n3;
int node;
cin >> n;
for (int i = 0; i < n; i++) { T[i].parent = T[i].left = ... | 0 | 99,970,836 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | #include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostre... | 0 | 100,593,412 |
#include <iostream>
using namespace std;
int main()
{
int n, x, sum = 0, tmp;
cin >> n;
int arr[100000]{};
for(int i = 0; i < n; i++)
{
cin >> x;
arr[x-1]++;
if( arr[x-1] > 1 )
sum++;
}
tmp = sum/2;
tmp *= 2;
if( sum - tmp == 1 )
sum++;
cout << n - sum;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool compPair(const pair<int, int>& arg1, const pair<int, int>& arg2) {
return arg1.first > arg2.first;
}
int main(void) {
ll n;
cin >> n;
ll a, sum=0, ans=0;
for(int i=0;i<n+1;i++) {
if(i==n) a=0;
else cin >> a;
... | 0 | 46,589,669 |
#include <stdio.h>
int main(){
int a,b,c,k,sum=0;
scanf("%d%d%d%d",&a,&b,&c,&k);
if(k<=a)return 0*printf("%d\n",k);
if(k>a)sum+=a,k-=a;
if(k<=b)return 0*printf("%d\n",sum);
if(k>b)sum+=0,k-=b;
return 0*printf("%d\n",sum-k);
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void){
long long A, B, K;
cin >> A >> B >> K;
long long diff = K - A;
long long out_A, out_B;
if(diff > 0){
if(B-diff>0){
out_A = 0;
out_B = B - diff;
}else{
out_A = 0;
out_B = 0;
}
}else{
out_A = A -... | 0 | 88,681,020 |
#include<stdio.h>
#include <iostream>
#include <queue>
using namespace std;
#define MAX 101
#define WHITE 0
#define GRAY 1
#define BLACK 2
static const int INFTY = (1<<21);
int G[MAX][MAX],color[MAX],d[MAX],num;
void bfs(int s){
int u;
queue<int> Q;
for(int i=1; i<=num; i++) {
d[i] = INFTY;
}
Q.push(s);
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t X,Y,Z,K;
cin>>X>>Y>>Z>>K;
vector<int64_t>A(X);
for(int i=0;i<X;i++)
cin>>A.at(i);
vector<int64_t>B(Y);
for(int i=0;i<Y;i++)
cin>>B.at(i);
vector<int64_t>C(Z);
for(int i=0;i<Z;i++)
cin>>C.at(i);sort(A.begin(),A.end());sort(B.b... | 0 | 68,082,175 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int N;
vector<int> C, S, F;
void input() {
cin >> N;
C = S = F = vector<int>(N - 1);
rep(i, N - 1) cin >> C[i] >> S[i] >> F[i];
}
int main() {
input();
r... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
using namespace std;
const long long MOD = 1000000007;
struct UnionFind {
vector<int> par;
... | 0 | 23,654,629 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#include <iomanip>
#include <set>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int p[100000];
ll b[100001];
multiset<int> st;
int main()
{
int n;
ll ans=0;
cin>>n;
for(int i=0;i<n;i++... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
using namespace std;
const int MOD=1000000007;
const int MOD2=15000007;
const ll MAX=918... | 0 | 88,216,631 |
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define Rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int p, q, r;
cin >> p >> q >> r;
int min = p + q;
if (min > p + r) min... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | 0 | 75,323,251 |
#include <cstdio>
using namespace std;
#define MAX 10000
int *A, *B, C[MAX + 1];
void CountingSort(int n)
{
for (int i = 0; i <= MAX; i++) C[i] = 0;
for (int j = 0; j < n; j++) C[A[j]]++;
for (int i = 1; i <= MAX; i++)
C[i] += C[i - 1];
for (int j = n - 1; j >= 0; j--) {
B[C[A[j]] - 1] = A[j];
C[A[j]]--;
}
}... | #include<iostream>
using namespace std;
class dice
{
private:
int status[6];
public:
dice();
int showright(void);
bool is(int,int);
bool isfront(int);
void rotate(char);
};
dice::dice()
{
for(int i=0;i<6;i++)
cin>>status[i];
}
bool dice::isfront(int a)
{
if(status[1]==a) return true;
else retu... | 0 | 53,113,071 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
long long n,p;
cin >> n >> p;
string s;
cin >> s;
long long res =0;
if (p==2 || p == 5)
{
for (int i =0;i<s.length();i++)
{
if ((s[i]-'0')%p==0) res+= i+1;
}
... | #include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#i... | 0 | 44,279,842 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n); for (int i = 0; i < (int)(n); i++)
vector<int> input(int N) {
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
return vec;
}
int main() {
int x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << x2+y1-y2 << " " << y2-x1... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#inclu... | 0 | 23,915 |
#include <bits/stdc++.h>
#define int long long
#define counter(m) for(int i=0;i<m;i++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int len = s.length();
for(int i=1;i<len;i++)
{
string temp = s.substr(0 , len-i);
if( temp.length()%2== 1)
{
continue;
} else
{
int tl = temp.length();
... | 0 | 24,193,994 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define ALL(x) (x).begin(), (x).end()
#ifdef _DEBUG
#define PRE_... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 25,173,561 |
#include <iostream>
using namespace std;
int main(){
int a,b,x;
for(int j=1;j<=9;j++){
a=j;
for(int i=1;i<=9;i++){
b=i;
cout<<a<<"x"<<b<<"="<<a*b<<endl;
}
}
} | #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 = (... | 0 | 87,403,577 |
#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <ctime>
#include <iterator>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
struct fPoint
{
double x... | #include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector... | 0 | 9,995,371 |
#include <iostream>
using namespace std;
int main() {
int n, array[100];
int pointer = 0;
while (cin >> n) {
if (n == 0) {
cout << array[--pointer] << endl;
} else {
array[pointer++] = n;
}
}
return 0;
} | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(ll i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; ... | 0 | 73,974,329 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.