code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll A[5005];
bool dpL[5005][5005];
bool dpR[5005][5005]... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#inc... | 1 | 78,180,830 |
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string S;
cin >> S;
sort(S.begin(), S.end());
for(int i=0; i+1<S.size(); i++){
char a = S[i];
char b = S[i+1];
if(a==b){
cout << "no" << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | 1 | 82,478,107 |
#include<bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
int main() {
ULL Z = 0;
ULL s[100000];
int n; cin >> n;
for (int i = 0; i < n; i++) {
ULL a; cin >> a;
s[i] = a; Z ^= a;
}
for (int i = 0; i < n; i++) {
s[i] &= ~Z;
}
for (int i = 59; i >= 0; i--) {
ULL m = 1ull << i;
int p =... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
uint64_t a[100'000], b[100'000];
uint64_t x = 0;
cin >> n;
for(int i=0;i<n;++i) cin >> a[i];
for(int i=0;i<n;++i) x ^= a[i];
for(int i=0;i<n;++i) b[i] = a[i] & (~x);
int st = 0;
for(int i=59;i>=0;--i){
for(int j... | 1 | 66,680,700 |
#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>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
using namespace std;
int main() {
int n,a,b,c,d;
cin >> n;
a = n/1000;
n %= 1000;
b = n/100;
n %= 100;
c = n/10;
d = n%10;
if(a == b && b == c) cout << "Yes" << endl;
else if(b... | 1 | 99,209,354 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n;
cin >> n;
bool checker = true;
ll sum = 0;
ll mini = INF;
for(int i = 1; i <= n; i++){
ll a, b;
cin >> a >> b;
sum += b;
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<cstdint>
#include<cassert>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int N; std::cin >> N;
std::vector<std::pai... | 1 | 74,832,399 |
#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... | #include <iostream>
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3, y3, x4, y4;
x3 = x2 - (y2 - y1);
y3 = y2 + (x2 - x1);
x4 = x1 - (y2 - y1);
y4 = y1 + (x2 - x1);
printf("%d %d %d %d\n", x3, y3, x4, y4);
} | 1 | 15,734,065 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int a, b, c;
string s = "NO";
cin >> a >> b >> c;
for(int i = 1; i < b; i++){
if(a*i % b == c){
s = "YES";
break;
}
}
cout << s << endl;
} | #include<iostream>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = 1; i <= b; i++) {
if (i*a % b == c) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO"... | 1 | 73,964,608 |
#include<cstdio>
using namespace std;
int main()
{
int a,b;
scanf("%d%d",&a,&b);
if(a%b)
printf("%d",a);
else
printf("-1");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll a,b;
cin >> a >> b;
if(a%b==0)
{
cout<<-1<<endl;
return 0;
}
else
{
cout<<a<<endl;
}
} | 1 | 59,201,153 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,n) for(int i=l; i<n; ++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using mii = map<int,int>;
using pii = pair<int,int>;
using vpii = vector<pair<int,int>>;
using ti3 = tuple<int... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
int main(){
int s; cin >> s;
int cnt = 0;
vector<int> a;
a.push_back(s);
while(true){
cnt++;
if(s % ... | 1 | 95,965,294 |
#pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int 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++)
#define rev(i, n) for(int i = (... | #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>;
using Graph = vector<vector<int>>;
const int INF = 2e9;
int main(){
int n,m;
cin >> n >> m;
Graph g(n + 1);
rep(i,m){
int a,b;
cin >> a >> b;
... | 1 | 71,014,101 |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n -... | #include <bits/stdc++.h>
using namespace std;
main(){
int N,L;
cin >> N >> L;
vector<string> S(N);
for(int i=0;i<N;i++) cin >> S[i];
sort(S.begin(),S.end());
string ans;
for(int i=0;i<N;i++) ans+=S[i];
cout << ans <<endl;
} | 1 | 61,095,875 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define f first
#define s second
#define go ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mem(arr,v) memset(arr,v,sizeof(arr))
int main()
{
ll t,kk=INT_MAX,v,mn,sum=0;
for(int i=0;i<5;i++)
{
cin>>v;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n = 5;
int a[n];
rep(i, n) cin >> a[i];
int ans = 0;
int mx = 0;
rep(i, n) {
ans += (a[i] + 9) / 10 * 10;
if (a[i] % 10 == 0) continue;
mx = max(mx, 10 - (a[i... | 1 | 95,045,424 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | 1 | 100,091,352 |
#include <iostream>
int main()
{
int x;
std::cin >> x;
std::cout << ((x>=1200)?"ARC":"ABC") << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int x;
cin >> x;
(x < 1200)?cout << "ABC" : cout << "ARC";
return 0;
} | 1 | 9,335,016 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
vector<int> p(n),q(n);
for(int& i :p) cin>>i;
for(int& i: q) cin>>i;
vector<int> r(p);
sort(r.begin(),r.end());
auto eq=[&](vector<int> a,vector<int> b,int n){ int flag=1; for(int i=0;i<n;i++) flag&=(a[i]==b[i]); return flag; };
int cnta=0;
while(... | #include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
int a[12134],b[12345];
int main() {
int n;
cin>>n;
for (int i=1;i<=n;i++)
... | 1 | 61,874,099 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll cnt = 0;
for (auto mpp : mp) {
if (mpp.second == 1) continue;
ll m = mpp.... | #include<iostream>
#include<unordered_map>
#include<bitset>
#include<math.h>
#include<vector>
#include<set>
#include<algorithm>
#include<ctype.h>
#include<unordered_set>
#include<string>
#include<iomanip>
#include<queue>
#include<limits>
#include<map>
#include<stack>
#include<iterator>
#include<cstring>
#include<deque>... | 1 | 69,465,948 |
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main(void){
double a,b,x;
cin >> a >> b >> x;
x = x / a;
if(a*b/2 >= x){
double c = (2*x)/b;
cout << std::fixed << std::setprecision(15) << 90 - atan(c/b)/ M_PI * 180.0 << endl;
}else{
do... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
const int maxn=2e5+10;
const int mod=1e9+7;
const double pi=3.1415926535;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
double a,b,x;
cin>>a>>b>>x;
double v=a*a*b;
double... | 1 | 98,190,594 |
#include <iostream>
#include <string>
using namespace std;
int num[] = {1000, 100, 10, 1};
char chr[] = {'m', 'c', 'x', 'i'};
int frommcxi(string x){
int res = 0, n = 1;
for(int i=0; i<x.size(); i++){
int j;
for(j=0; j<4; j++){
if(x[i] == chr[j]){
res += n*num[j];
... | #include<iostream>
#include<string>
using namespace std;
int summ(string,string);
int NtoM(string);
void MtoN(int);
int main(){
int n,ans;
string a,b;
cin >> n;
for(int i=0;i<n;i++){
cin >> a >> b;
ans=summ(a,b);
MtoN(ans);
}
return 0;
}
int summ(string a,string b){
return NtoM(a)+NtoM(b);
}
... | 1 | 73,050,072 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e3 + 5, mod = 1e9 + 7;
int dp[N][N][3];
int a[N], b[N];
int n, m;
int solve(int i, int j, int s) {
if (i == n || j == m) return s == 0;
int &ret = dp[i][j][s];
if (ret != -1) return ret;
ret = 0;
if (s == 0) {
... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main(void){
int N, M;
cin >> N >> M;
vector<int> S(N, 0);
vector<int> T(M, 0);
for(int i=0; i<N; i++)cin >> S[i];
for(int i=0; i<M; i++)cin >> T[i];
vector<vector<long long>> dp(N, vector<long long>(M,... | 1 | 66,672,035 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> X(N);
for (auto& v : X) {
cin >> v;
}
int ans = 2000000000;
for (int P = 1; P <= 100; ++P) {
int tmp = 0;
for (const auto v : X) {
tmp += (v - P) * (v - P);
}... | #include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
int ans=1e18;
int n;
vector<int> a(n);
... | 1 | 46,133,174 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int n, k;
cin >> n >> k;
... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
#include <numeric>
using lint = long long;
int main()
{
lint n, k;
scanf("%lld", &n);
scanf... | 1 | 21,899,568 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long N, K;
long long R, S, P;
string T;
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using str = string;
using ss = stringstream;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n,k;cin>>n>>k;
int r,s,p;cin>>r>>s>>p;
str t;cin>>t;
map<char,ll> m;
m['r']=p;
m['s']=r;
m['p']=s;
m['b']=0;
... | 1 | 99,484,033 |
#include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
string S;
cin >> S;
string ans = "yes";
for (int i = 0; i < S.size(); i++) {
for (int j = i + 1; j < S.size(); j+... | 1 | 67,202,026 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1e9 + 7;
int main() {
int h, w;
cin >> h >> w;
vector<char> g(h * w);
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> g[w * i + j];
}
}
bool bingo... | 1 | 97,211,152 |
#include <bits/stdc++.h>
using namespace std;
#define MODNUMBER 1000000007
int main() {
int N;
char s;
scanf("%d", &N);
scanf("%c", &s);
vector<int> c_num(26, 0);
for (int i = 0; i < N; i++) {
scanf("%c", &s);
c_num[s - 'a']++;
}
long long result = 1;
for (int i = 0; i < 26; i++) {
result = (result * (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
#define mod (1000000007)
void solve()
{
ll n;cin>>n;
string s;cin>>s;
map<int,int>g;
REP(i,n)g[s[i]]++;
ll ans=1;
REP(i,26)(ans*=g['a'+i]+1)%=mod;
... | 1 | 24,108,650 |
#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 repp(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647;
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
temp... | 1 | 18,646,284 |
#include <bits/stdc++.h>
#define append push_back
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e18 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {1, 0,... | #include <bits/stdc++.h>
using namespace std;
int main(){
int M, S, J, I;
int A, B;
cin >> A >> B;
int c = 0;
for(int i = A; i <= B; i++){
M = i / 10000;
I = i % 10;
S = i % 10000 / 1000;
J = i % 100 / 10;
if ( M == I && S == J){
c++;
}
}
cout << c << endl;
} | 1 | 26,490,854 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (int)b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
int in[n] = {};
rep(i, 0, m) {
... | #include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>
using namespace std;
static const int MAX=100000;
static const int INFTY=(1<<29);
vector<int> G[MAX];
list <int> out;
bool V[MAX];
int N;
int indeg[MAX];
void bfs(int s){
queue<int> q;
... | 1 | 49,849,673 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
const ll mod = 1e9+7;
int inf = 1000000000;
int main() {
ll H, W;
cin >> H >> W;
ll ans = 0;
if(H==1 || W==1){
ans = 1;
}else{
ans = (H*W+1)/2;
}
cout << ans << e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (int)1e9+7
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int,int>
#defin... | 1 | 91,245,042 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define YES cout<<"YES"<<"\n";
#define NO cout<<"NO"<<"\n";
#define ld long double
#define yes cout<<"yes"<<"\n";
#define no cout<<"no"<<"\n";
#define No cout<<"No"<<"\n";
#define Yes cout<<"Yes"<<"\n";
#define f(i,a) for(i=0;i<a;i++)
#define fo... | 1 | 81,029,075 |
#include <stdio.h>
int main(void)
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int small, midium, large;
if ((a >= b) && (b >= c)) {
small = c;
midium = b;
large = a;
} else if ((a >= c) && (c >= b)) {
small = b;
midium = c;
large = a;
} else if (... | #include <iostream>
using namespace std;
int main (int argc, const char * argv[])
{
int a, b, c , i;
cin >> a >> b >> c;
if (a>b ) {
i = a;
a = b;
b = i;
}
if (b>c) {
i = b;
b = c;
c = i;
}
if (a>b ) {
i = a;
a = b;
b = ... | 1 | 5,131,654 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
int main() {
cin>>n;
ll u[n], v[n];
vector <ll> point[n+1];
for (int i=1; i<n; i++) {
cin>>u[i]>>v[i];
if (u[i]>v[i]) point[u[i]].push_back(v[i]);
else point[v[i]].push_back(u[i]);
}
for (int i=1; i<=n; i++) {
sort(point[i].begin(),... | 1 | 82,413,714 |
#include <iostream>
using namespace std;
int main(void)
{
int a = 100000, n;
cin >> n;
for (int i = 0; i < n; ++i) {
a = a * 1.05;
if (a % 1000 != 0)
a += (1000 - a % 1000);
}
cout << a << endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
double r=0.05;
int y = 100000;
cin >> n;
for(int i=0;i<n;i++){
y = ( 1 + r ) * y;
if(y%1000 != 0){
y = y - y%1000;
y = y + 1000;
}
}
cout << y << endl;
} | 1 | 20,911,465 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, N1, N2, N3, N4;
cin >> N;
if (N / 10 % 111 == 0) {
cout << "Yes" << endl;
}
else if ((N - (N / 1000) * 1000) % 111 == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;cin >> S;
if(S[0]==S[1]&&S[1]==S[2]){
cout << "Yes" << endl;
}else if(S[1]==S[2]&&S[2]==S[3]){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | 1 | 80,581,981 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long K;
cin >> K;
long long N = 50;
cout << N << endl;
for(int i=0; i<N; ++i) {
cout << (i - (K % N) + N + 1) % (N + 1) + (K / N) << (i + 1 == N ? '\n' : ' ');
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1e9+7;
const LL LINF=1LL<<62;
int main(){
LL K;
cin >> K;
puts("50");
LL t=K/50+49;
for(int i=0;i<50;i++){
if(i>=50-K%50) cout << t+1 << (i==49?"\n":" ");
else cout << t-K%50 <<" ";... | 1 | 38,562,760 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<((int)n); i++)
#define REP(i,n) for(int i=0; i<=((int)n); i++)
#define srep(i,a,n) for(int i=a; i<((int)n); i++)
#define SREP(i,a,n) for(int i=a; i<=((int)n); i++)
#define rrep(i,n) for(int i=n-1; i>=0; i--)
#define RREP(i,n) for(int i=n; i>=0; i--)
#define INF 1... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int N;
long long int mod = 1e9+7;
cin >> N;
string s;
cin >> s;
if(s[0] == 'W'||s[2*N-1]=='W'){
cout << 0 << endl;
}
else{
long long int l=1,r=0;
long long int sum = 1;
char a = 'L';
for(int i = 1; i < 2*N; i++){
... | 1 | 48,417,068 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef pair <int,int> pi;
typedef tuple <int,int,int> ti;
#define forn(i,a,n) for(int i = a; i < n ; i++)
#define mem(str,a) memset(str, a, sizeof(str));
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(nullptr)
con... | #include <iostream>
using namespace std;
int main(){
int n,dev,result;
cin>>n;
dev=n/15 *200;
result=800*n;
cout<<result-dev;
} | 1 | 100,137,026 |
#include <iostream>
#include <algorithm>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = { 1,0,-1,0 }, dj[4] = { 0,1,0,-1 };
int main(void) {
int l, r, i, j, ans;
scanf("%d%... | #include<bits/stdc++.h>
using namespace std;
int main() {
long long l, r; cin >> l >> r;
if(r - l + 1 >= 2019) {
cout << "0" << endl;
return 0;
}
set<long long> s;
for (int i = l; i <= r; i++)
{
s.insert(i % 2019);
}
vector<long long> a;
for (auto p : s)
{
a.push_back(p);
}
long long res = 10000;
f... | 1 | 9,184,648 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
long long int res = 0;
long long int n;
cin >> n;
for(long long int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
long long int a = i - 1;
long long int b = (n/i) - 1;
if(a==b)
{
if(a!=0)
{
i... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define mrep(i,j,n) for(int i = j; 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 mreps(i,j,n) for(int i = j; i <= n; i++)
#define rreps(i,n) for(int i = n; i >= 1; i--)
#define co(x) ... | 1 | 39,641,658 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
int main(void) {
while (true) {
int m, min, max;
cin >> m >> min >> max;
if (m == 0 && min == 0 && max == 0) break;
int p[m];
for (int i = 0; i < m; i++)
cin >> p[i];
vector<pair<int,int> >... | #include<bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v).... | 1 | 46,797,858 |
#include<bits/stdc++.h>
using namespace std;
int size(int n,int k){
int ans=1,s=k;
while(s<n){
ans++;
s+=k-1;
}
return ans;
}
int main(){
int n,k;
cin >> n >> k;
int ans=1,tmp;
for(int i=0;i<n;i++){
cin >> tmp;
if(tmp==1){
tmp=i;
break;
}
}
if(tmp+k-1>n-1 || tmp-k+1<0... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 1 | 90,825,736 |
#include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.e... | #include <iostream>
#include <vector>
#include <algorithm>
#define INF 1e9
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N, M, R;
cin >> N >> M >> R;
vector<int> r(R);
rep(i, R) cin >> r[i];
vector<vector... | 1 | 75,176,184 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | 1 | 74,365,822 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,c,i,B = 0,ans = 1000000000,now,g;scanf("%d%d%d%d",&n,&a,&b,&c);
int l[n],t[4];
for(i=0;i<n;i++) scanf("%d",&l[i]);
while(B<(1<<(n*2))){
t[0] = t[1] = t[2] = t[3] = now = 0;
for(i=0;i<n;i++){
g = bool(B&(1<<(i*2)))+bool(B&(1<<(i*2+1... | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <string>
using namespace std;
int main(){
int n,a,b,c;
int l[8];
cin>>n>>a>>b>>c;
for(int i=0;i<n;i++){
cin>>l[i];
}
int mi=1e9+7;
for(int i=0;i<(1<<(2*n));i++){
int now=0;
int hoge=i;
vec... | 1 | 7,044,981 |
#define _GLIBCXX_DEBUG
#include <iostream>
using namespace std;
int main(void){
int a, b, c, k;
cin >> a >> b >> c >> k;
if(k <= a) cout << k << '\n';
else if(k <= a+b) cout << a << '\n';
else cout << a-(k-a-b) << '\n';
return 0;
} | #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
#define int long long int
#define double long double
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define rep(i,a,b) for (int i = a; i < b; ++i)
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL);
#ifnd... | 1 | 60,036,692 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
int sum = 0;
for (int i=0; i<10; i++){
for (int j=0; j<10; j++){
for (int k=0; k<10; k++){
for (int l=0; l<10; l++){
int digit_sum = i + j + k + l;
... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LONG... | 1 | 10,634,010 |
#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... | #include<bits/stdc++.h>
#define endl "\n"
#pragma GCC optimize(3)
using namespace std;
int r,l,ans; string s;
signed main()
{
ios::sync_with_stdio(false);
cin>>s;
r=s.length()-1;
while(l<=r)
{
if(s[l]==s[r]) l++,r--;
else
if(s[l]=='x'||s[r]=='x')
{
ans++;
s[l]=='x'?l++:r--;
}
else
{
... | 1 | 99,045,687 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[1050];
while(cin>>n,n){
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
int mn=1000000;
for(int i=1;i<n;i++){
mn=min(mn,a[i]-a[i-1]);
}
cout<<mn<<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 <fstream>
#include <iomanip>
#include <cstdio>
#include <c... | 1 | 56,322,400 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll<<60)
#else
#define inf (1<<30)
#endif
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define rev(i,n) for(int i=(n)-1;i>=0;i--)
#defin... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <string.h>
using namespace std;
#define pie 3.141592653589... | 1 | 57,772,272 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
ll count = 0;
ll pre = -1;
rep(i, n){
if... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define rep0(a,b) for(int a=0;a<b;a++)
#define rep1(a,b) for(int a=1;a<=b;a++)
#define repp(a,b,c) for(i... | 1 | 49,507,233 |
#include <iostream>
#include <vector>
typedef std::vector<int> Ints;
void CountingSort(const Ints& A, Ints& B, int k)
{
Ints C(k + 1, 0);
for(unsigned int j = 0; j < A.size(); j++){
C[A[j]]++;
}
for(int i = 1; i <= k; i++){
C[i] += C[i-1];
}
for(int j = A.size() - 1; j >= 0; j--){
B[C[A[j]] - 1] = A[j];
C... | #include <iostream>
#include <cstdio>
#include <string>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
int main()
{
int N,num;
int so[10000]={};
cin>>N;
for(int i=0;i<N;i++){
cin>>num;
so[num]++;
}
for(int j=0,i=0;j<N;i++){
if(so[i]){
if(j){
for(int k=0... | 1 | 71,984,198 |
using namespace std;
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#i... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define mem(a, n) memset(a, n, sizeof(a))
#define repeat(n) for(int i=0; i<n; i++)
#define Unique(n) (n).erase(unique(all(n)), (n).end())
#define isPowerOfTwo(n) (n && !(n & (n - 1)))
#define NumofDigits(n) ((int)log10(n)+1)
#... | 1 | 54,836,508 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX;
#define INFL LLONG_MAX;
typedef long long ll;
using namespace std;
int main(){
ll n; cin >> n;
vector<ll> a(n);
vector<ll> b(n)... | 1 | 95,762,422 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'a' ||c == 'e' ||c == 'i' ||c == 'o' ||c == 'u'){
string vowel = "vowel";
cout << vowel << endl;
} else {
string consonant = "consonant";
cout << consonant << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
char n;
int main() ... | 1 | 4,269,158 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#... | #include <iostream>
#include <cstdio>
#define N 2005
using namespace std;
typedef long long ll;
ll M = 1e9 + 7;
ll n, m, a[N], b[N], d[N][N];
int main()
{
ll i, j;
cin >> n >> m;
for (i = 1; i <= n; i++) scanf("%lld", &a[i]);
for (i = 1; i <= m; i++) scanf("%lld", &b[i]);
for (i = 0; i <= n; i++) d[i][0] = 1;
for... | 1 | 5,260,919 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i<n;i++)
#define vv(Type,Name, n,m,d)vector<vector<Type>> vv(n, vector<Type>(m, d));
using namespace std;
using ll = long long;
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 * b / gcd... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
ll gcd(ll a,ll b) {
return b?gcd(b,a%b):a;
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
int f(int x){
int res = 0;... | 1 | 81,321,439 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M,X;
cin >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N,vector<int> (M));
for(int i=0;i<N;i++){
cin >> C.at(i);
for(int j=0;j<M;j++){
cin >> A.at(i).at(j);
}
}
int mincost=100000000;
for(int bit=0;bit<(1<<N);bit+... | #include <bits/stdc++.h>
using namespace std;
bool next_term(vector<int> &f){
f[0]++;
for(int i=0; i<f.size() - 1; i++){
if(f[i] == 2) f[i+1]++;
f[i] %= 2;
}
return (f.back() != 2);
}
bool satisfied(vector<int> &s, int x){
for(auto si : s){
if( si < x ) return false;
}
... | 1 | 49,243,928 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<char>s(S.size());
for(int i=0; i<S.size(); i++)s.at(i)=S.at(i);
sort(s.begin(), s.end());
string ans = "yes";
for(int i=0; i<S.size()-1; i++){
if(s.at(i)==s.at(i+1))ans = "no";
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
bool x[30];
int main(void){
string s; cin>>s;
for(int i=0;i<s.size();i++){
if(x[s[i]-'a']){
cout<<"no"<<endl;
return 0;
}else{
x[s[i]-'a']=true;
}
}
cout... | 1 | 14,494,698 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, a, b;
int main()
{
scanf( "%d%d%d", &n, &a, &b );
if( a + b > n + 1 || ll(a) * b < n ) {
printf( "-1\n" ); return 0;
}
for( int i = n-a+1; i <= n; i ++ )
printf( "%d ", i );
b --; n -= a;
while( n )
{... | 1 | 36,556,388 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(){
vector<P> ans;
ll N;
cin >> N;
vector<ll> v(N);
for(int i=0;i<N;i++) cin >> v[i];
sort(v.begin(),v.end());
for(int i=1;i<N-1;i++){
if(v[i] > 0){
ans.push_back({v[0],v[i]... | 1 | 244,864 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
const int m=1000000007;
int main(){
int n,h;
cin >> n >> h;
vi a;
int mx=0;
rep(i,n){
int x,y;
cin >> x >> y;
mx=max(mx,x);
a.push_back(y);
... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_bac... | 1 | 48,475,176 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include "bits/stdc++.h"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/pb_ds/assoc_container.hpp"
using namespace std;
#define x first
#define y second
#define LEN(x) ((int)(x).size())
#define ALL(x) x.begin(), x.end()
using ll = long long;
using llu = long long unsigned;
using ld = long double;
using pii = pair<i... | 1 | 8,217,451 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Hea... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | 1 | 88,041,002 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D;
cin >> A >> B >> C >> D;
if(A+B > C+D)
cout << "Left" << endl;
if(A+B == C+D)
cout << "Balanced" << endl;
if(A+B < C+D)
cout << "Right" <<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int A,B,C,D; cin >> A >> B >> C >> ... | 1 | 52,001,042 |
#include <iostream>
using namespace std;
int main()
{
string s;
cin >> s;
if (s[0] == s[1] && s[1] == s[2] && s[0] == s[2]){
cout << "No";
}else{
cout << "Yes";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<ll,ll>;
using grid = vector<vector<int>>;
const int dx[2] = {... | 1 | 41,121,535 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string int_to_string(int x) {
stringstream ss;
ss << x;
string ni = ss.str();
return ni;
}
int mod = 1e9 + 7;
ll power(ll a, ll b) {
ll ans = 1;
while (b) {
if(b & 1) {
ans = (ans * a) % mod;
}
a = (a * ... | 1 | 26,633,492 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | #include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
ll a;
ld b;
void input() {
cin >> a >> b;
}
void solve() {
cout << (a * (ll)round(b * 100)) / 100ll << '\n';
}
int main() {
ios_b... | 1 | 1,535,233 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <tuple>
#include <cstring>
#include <map>
#include <iomanip>
#include <ctime>
#include <complex>
#include <cassert>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long lon... | 1 | 40,480,425 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
type... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | 1 | 39,468,210 |
#include<iostream>
#include<cstdio>
#include<cstring>
#define Nil -1
#define maxn 100005
using namespace std;
int n,root;
int dep[maxn];
struct node
{
int parent;
int left_son;
int right_brother;
node():parent(Nil),left_son(Nil),right_brother(Nil) {}
};
node t[maxn];
void build()
{
for(int i=0; i<n... | #include <stdio.h>
#include <stdlib.h>
#define N 100000
#define M 100000
int parentSearch(int);
int depthSearch(int);
char *Treejudge(int);
int n,node;
int k[N];
int *c[M];
int parent[N];
int depth[N];
char *Tree[N];
int main(){
int i,j;
scanf("%d",&n);
if(n>N)exit(8);
for(i=0 ; i<N ; i++){
parent[i]=-1;
... | 1 | 56,132,398 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b)... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) r... | 1 | 88,031,367 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for ... | #include <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#includ... | 1 | 68,503,647 |
#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 SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
const int MOD=1e9+7;
vecto... | 1 | 51,581,538 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E18;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
int ls=s.length();
int lt=t.length();
int ans=INT_MAX;
for(int a=0;a<ls-lt+1;a++)
{
int different=0;
for(int b=0;b<lt;b++)
{
if(s[a+b]!=t[b])
different++;
}
ans=min(ans,different);
}
cout<<... | 1 | 14,509,099 |
#include<bits/stdc++.h>
using namespace std;
signed main(){
string s,c[4]={"dream","dreamer","erase","eraser"};
bool f;
int p,ans=0,l;
cin>>s;
for(int i=0;i<s.size();i++){
for(int j=0;j<4;j++){
f=1;
p=0;
for(int k=0;k<c[j].size();k++){
if(s[s.size()-1-i-k]!=c[j][c[j].size()-1-k])... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
unsigned int i = 0;
while (i < S.size())
{
if (S.substr(i, 8) == "dreamera")
{
i += 5;
}
else if (S.substr(i, 7) == "dreamer")
{
i += 7;
}
el... | 1 | 70,406,604 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VVL vector<vector<ll>>
int main(){
ll N, M;
cin >> N >> M;
VVL a(N, VL(2,0));
VL c(N);
rep(i,0,N){
cin >> a[i][0] >> a[i][1];
}
... | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int N;
int M;
cin >> N >> M;
vector<P> ab(N);
rep(i, N) {
cin >>... | 1 | 60,749,675 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N;
cin >> N;
int B[N-1];
rep(i,N-1) cin >> B[i];
int ans = B[N-2] + B[0];
for (int i = 0; i <= N-3; i++) {
ans += min(B[i],B[i+1]);
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n;
cin>>n;
int b[n-1];
FOR(i,n-1){
cin>>b[i];
}
vector<int>a;
a.push_back(b[0]);
for(int i=1;i<n-1;i++){
if(b[i]>=b[i-1])
a.push_back(b[i-1]);
else
a.push_back(b[i]);... | 1 | 11,065,944 |
#include<stdio.h>
#include<algorithm>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <functional>
#include <time.h>
using namespace std;
clock_t fi, endtime;
const int r_c = 0;
const int r_t = 1;
const int MAX_V = 10;
const int MAX_E = 45;
const int MAX_D... | #include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
#define MAX_V 11
#define INF (INT_MAX/2)
void floydwarshall(int V, vector< vector<int> > &dist){
for(int k = 0; k < V; k++){
for(int i = 0; i < V; i++){
for(int j = 0; j < V; j++) dist[i][j] = min(dist[i][j], ... | 1 | 30,240,830 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int getSecond(vector<pair<int,int>> vec, int def)
{
if(vec.size() <= 1)
{
return def;
}
return vec[1].first;
}
int main()
{
int n;
cin >> n;
map<int,int> odd;
map<int,int> even;
for... | #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<int, int>;
ll GCD(ll a, ll b) { retur... | 1 | 28,533,250 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <ctime>
#define INF 999999999
#define mod 1000000007
#define rep(i,n) for(int i=0;i<int(n);i++)
#... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
#include <stack>
#include <tuple>
#include <array>
using namespace std;
#define rep(i,n) for (int... | 1 | 80,493,026 |
#include <bits/stdc++.h>
using namespace std;
int yakusuu(int N){
int count=0;
for(int i=1;i<N+1;i++){
if(N%i==0){
count++;
if(N/i==i){
count++;
}
}
}
return count;
}
int main(){
int N,count=0;
cin >> N;
for(int i=1;i<N+1;i+=2){
if(yakusuu(i)==8){
count++;
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> yakusu(201, 0);
for (int i = 1; i <= 200; i++) {
for (int j = 1; j <= i; j++) {
if (i % j == 0) yakusu[i]++;
}
}
int ans = 0;
for (int i = 1; i <= n; i += 2) {
if (yakusu[i] == 8... | 1 | 6,957,406 |
#include <iostream>
using namespace std;
int main() {
int n,x,y;
while(true)
{
y=0;
cin>>n>>x;
if(n==0 && x==0) break;
for(int i=n;i>=3;i--)
{
for (int j = i-1; j>=2; --j)
{
for (int k = j-1; k >=1; --k)
{
if (i+j+k==x) y=y+1;
}
}
}
cout<<y<<endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int n = 0, x = 0;
cin >> n >> x;
while ((n != 0) | (x != 0)) {
int t = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
for (int k = j + 1; k <= n; k++)
if ((i + j + k) == x)
t++;
}
}
cout << t << endl;
cin >> n ... | 1 | 38,398,085 |
#include <bits/stdc++.h>
#define N 100010
#define INF 100000010
using namespace std;
int main(){
long long n,k,i,j,l,a[N],qdh[N],pos[N],unpos[N],maxs=-INF,mins=INF,tem,tem2;
cin>>n>>k;
qdh[0]=0;
a[0]=0;
pos[0]=0;
unpos[0]=0;
for(i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]>0)
{
pos[i]=pos[i-1]+a[i];
unpos[i]=... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
using namespace std;
#define rip(i, n, s) for (int i = (s);i < ( int )( n ); i++)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
vector<ll> da(n);
rip(i,n,0){
cin >> da[i];
}
... | 1 | 30,483,164 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int N;
int x[110000],y[110000];
vint G[110000];
int dfs(int from, int to)... | #include<bits/stdc++.h>
#include<vector>
#define N 100005
using namespace std;
vector<int> G[N];
int n,f[N];
void dfs(int t,int fa)
{
int i;
for(i=0;i<G[t].size();i++)
if(G[t][i]!=fa)
dfs(G[t][i],t),f[t]^=(f[G[t][i]]+1);
}
int main()
{
int i,x,y;
scanf("%d",&n);
for(i=1;i<n;i++){
scanf("%d %d",&x,&y);
G[x... | 1 | 79,196,563 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int x;
cin >> x;
int y = x;
int z = y % 10;
while (y != 0) {
y = y / 10;
z += y % 10;
}
if (x % z == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | 1 | 99,113,182 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<int> t(n+1), x(n+1), y(n+1);
t[0] = 0;
x[0] = 0;
y[0] = 0;
for(int i=1; i<=n; i++) cin >> t[i] >> x[i] >> y[i];
for(int i=1; i<=n; i++) {
int ... | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
ll N; cin >> N;
ll t,x,y;
ll now_x = 0;
ll now_y = 0;
ll now_t = 0;
ll cost = 0;
ll point = 0;
string ans = "No";
for (int i = 0; i < N; i++) {
cin >> t >> x >> y;
cost =... | 1 | 37,667,079 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s, p;
cin >> s >> p;
s += s;
if(s.find(p) != -1){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | #include <iostream>
#include <string>
int main(int argc, char** argv)
{
std::string s;
std::getline(std::cin, s);
std::string p;
std::getline(std::cin, p);
for (int si = 0; si < (int)s.size(); ++si)
{
if (s[si] == p[0])
{
bool match = true;
for (int pi = 0; pi < (int)p.size() && match; ++pi)
{
ma... | 1 | 92,384,100 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
typedef int64_t ll;
template<class T> inline bool chmax(T & a, T b) { if ... | # include <iostream>
using namespace std;
int main() {
string s, t, ans = "No";
cin >> s >> t;
for (int i = 0; i < s.size(); ++i) {
string rotate_s = s.substr(s.size() - i, i) + s.substr(0, s.size() - i);
if (rotate_s == t) {
ans = "Yes";
break;
}
}
cout << ans << endl;
return 0;
} | 1 | 55,357,986 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N;
string s,t;
cin >> N >> s >> t;
for (int i = 0; i < N; i++) {
int ans = N * 2;
for (int j = 0; j < N-i; j++) {
if (t.at(j) == s.at(i+j)){
ans--;
if (j == N-i-1){
cout << ans << endl;
return 0;
... | #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;
string s,t;
cin >>n >>s >>t;
int ans = 0;
for(int i = n; 0<=i; i--){
if(s.substr(n-i)==t.substr(0,i)){
ans = 2*n-i;
break;
}
}
cout << ans << endl;
re... | 1 | 100,010,675 |
#include <vector>
#include <iostream>
using namespace std;
vector<vector<int> > adj;
int solve(int i, int p) {
int g = 0;
for (int j : adj[i]) if (j != p) g ^= 1 + solve(j, i);
return g;
}
int main() {
int n; cin >> n;
adj.resize(n);
for (int i = 1; i < n; i++) {
int u, v; cin >> u >> v;... | #include<bits/stdc++.h>
#define reg register
#define maxn 1000001
using namespace std;
inline int read() {
reg int s = 0, t = 0; reg char ch = getchar();
while(ch > '9' || ch < '0') t |= ch == '-', ch = getchar();
while(ch >= '0' && ch <= '9') s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
return... | 1 | 30,793,770 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
ty... | #include <iostream>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
int a;
map<int, int> count_map;
for (int i = 0; i < n; ++i) {
cin >> a;
++count_map[a];
}
int ans = 0;
for (pair<int, int> element : count_map) {
if (element.first > element.seco... | 1 | 73,023,386 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,l,r,count=0;
cin >> n;
while(n>0){
cin >> l >> r;
count += (r-l)+1;
n --;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int t;
int u=0;
for (int i = 0; i < N; i++){
int l,r;
cin >> l >> r;
t=r-l+1;
u+=t;
}
cout << u << endl;
} | 1 | 93,333,687 |
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
int main()
{
int n,m;
cin >> n >> m;
int max = 0,min = 1e9;... | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for(int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main() {
ll N, M;cin >> N >> M;
vector<ll> A(M);
vector<ll> B(M);
rep(i, 0, M)cin >> A[i] >> B[i];
if(*min_element(ALL(B)) - *max_element(AL... | 1 | 28,698,951 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
vector<int> a(5),b(5);
rep(i,0,5) {cin >> a[i]; b[i] = i;}
sort(a.begin(), a.end());
int ans = 1000;
do {
int k = 0;
rep(i,0,5) {
k += a[b[i]... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define maxll pow(10,18)
int main(){
vector<ll> dish(5);
for(int i = 0;i < 5;i++)cin >> dish[i... | 1 | 10,574,089 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
cout << (800*N) - (N/15)*200 << endl;
} | #include<iostream>
using namespace std;
int main()
{
int n,x,y;
cin >> n;
cout <<n*800-(n/15)*200<< endl;
} | 1 | 18,243,890 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 1 | 52,353,320 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int N, A, B, C;
vector<int> L;
void chmin(int& a, int b) {
if (a > b) a = b;
}
int rec(int i, int a, int b, int c) {
if (i == N) {
if (!a || !b || !c) re... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
int N, A, B, C;
int l[10] = {0};
int getDigit4... | 1 | 82,897,287 |
#include<iostream>
#include<stack>
using namespace std;
int main(void)
{
stack<int> s;
int x;
while(cin >> x)
{
if(!x)
{
cout << s.top() << endl;
s.pop();
}
else
s.push(x);
}
return 0;
} | #include <iostream>
#include <stack>
using namespace std;
int main()
{
int buf;
stack<int> st;
while(cin >> buf)
if(buf==0)
{
cout << st.top() << endl;
st.pop();
}
else
st.push(buf);
return 0;
} | 1 | 54,491,666 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long
#define el '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repi(i, a, b) for (int i = a; i >= b; i--)
#define V... | 1 | 51,776,035 |
#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) rep2(i,0,n-1)
int MOD=1000000000+7;
int INF=1e6;
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");
bool func(char x){
if(x=='Y') return 1;
else return 0;
}
bool check(ll int y){
pri... | #include <bits/stdc++.h>
#define db double
#define ls rt << 1
#define rs rt << 1 | 1
#define pb push_back
#define ll long long
#define mp make_pair
#define pii pair<int, int>
#define X first
#define Y second
#define pcc pair<char, char>
#define vi vector<int>
#define vl vector<ll>
#define rep(i, x, y) for(int i = x; i ... | 1 | 61,009,951 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.