code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | #include <iostream>
#include <algorithm>
#include <map>
int main() {
using namespace std;
long long n, cnt=0;
cin >> n;
std::string si;
map<std::string, long long> m;
for (long long i=0; i<n; i++){
cin >> si;
sort(si.begin(), si.end());
if (m.count(si)) cnt+=m[si];
... | 0 | 33,982,802 |
#include <stdio.h>
#define N 100
struct pair{
int n;
char m;
};
int main(){
int n,i;
struct pair card[N];
char space;
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%c%d%c",&card[i].m,&card[i].n,&space);
}
struct pair bubble[N],sel[N];
for(i=0;i<n;i++){
bubble[i] = card[i];
}
int j;
struct pair tmp;
for(i... | #include <bits/stdc++.h>
using namespace std;
#pragma region
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {c... | 0 | 85,796,479 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B, ans;
cin >> N >> A >> B;
int64_t mod = N % (A + B);
cout << N / (A + B) * A + (A > mod ? mod : A) << endl;
} | #include<bits/stdc++.h>
#define ll long long int
#define ul unsigned long long int
#define mp make_pair
#define endl "\n"
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define lb lower_bound
#define forn(i,n) for(ll i=0 ; i<n ; i++)
#define arr(a,n) for(ll i=0;i<n;i++){ cin>>a[i]; }
#define ub upper_bound... | 0 | 32,620,178 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
ll T;
ll a, b;
int main()
{
scanf("%lld", &T);
while(T--)
{
scanf("%lld%lld", &a, &b);
ll x = sqrt((double)a * b);
if(a * b < x * x) x--;
if(a * b == x * x)
{
... | #include<algorithm>
#include<bitset>
#include<climits>
#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_... | 0 | 93,924,346 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i < n;i++)
#define INF 0x3f
int main(){
string set = "aeiou";
string c ;
cin >> c;
for(int i = 0;i < set.size() ;i++){
if(c.at(0) == set.at(i)){
cout << "vowel" << endl;
return 0;
}
}
cout << "consonant" << endl;
... | #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... | 0 | 39,535,296 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
const ll mod=1e9+7;
int main(void){
ll n,k;
cin>>n>>k;
vector<ll>v(n);
rep(0,i,n){
cin>>v[i];
}
ll ans=0;
rep(0,i,n){
ll r=0,a=0;
rep(i+1,j,n)if(v[i]>v[j])++r;
... | #include <iostream>
#include <map>
using namespace std;
map<long long, int> cnt;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
long long ans = 0, sum = 0;
long long num;
cnt[0] = 1;
for(int i=0; i<N; i++) {
... | 0 | 85,628,991 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define int long long
#define gcd __gcd
#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 *min_arr;
void updateMin(int i, int w)
{
if(w < min_arr[i])
{
min_arr[i] = w;
}
}
int main()
{
int n, k;
cin >> n >> k;
min_arr = new int[n];
int weight[n];
for(int i = 0; i < n; i++) {
cin >> weight[i];
}
for (int i = 0; i < n... | 0 | 3,483,420 |
#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>;
ll x = 1e9 + 7;
int main() {
int k, n;
cin >> k >> n;
int x = 0;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0) continue;
x = max(x,... | #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 N = 100;
... | 0 | 46,927,227 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin>>s>>t;
int S[26]={},T[26]={};
for(int i=0;i<s.size();i++){
S[s[i]-'a']++;
T[t[i]-'a']++;
}
sort(S,S+26);
sort(T,T+26);
for(int i=0;i<26;i++){
if(S[i]!=T[i]){
cout<<"No"<<endl;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
const ld pi = 3.14159265358979323846;
int main() {
... | 0 | 14,677,809 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int64_t> L(N + 1);
if (N == 1)
{
L.at(N) = 1;
}
else
{
L.at(0) = 2;
L.at(1) = 1;
for (int i = 2; i <= N; i++)
{
L.at(i) = L.at(i - 1) + L.at(i - 2);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
string s,t;
cin >> s >> t;
for(int i=0; i<s.size(); i++){
if(s[i]!=t[i]){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
ret... | 0 | 32,326,036 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string str;
int a[26] = { 0 };
char c;
while (cin >> str) {
int n = 0;
for (unsigned int i = 0; i < str.size(); i++) {
if (str[i] >= 'a' && str[i] <= 'z') {
n = str[i] - 'a';
a[n]++;
}
else if (str[i] >= 'A' && str[i] <= 'Z... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long int LL;
vector<int> v[101];
vector<int> dist;
queue<int> q;
int bfs() {
dist[1] = 0;
q.push(1);
while (!q.empty()) {
int c = q.front();
q.pop();
for (int i = 0; i < v[c].size(); i++) {
... | 0 | 48,868,387 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5;
int mod[N+100],cnt[10010];
char str[N+100];
ll ans;
int main()
{
int n,p;
scanf("%d%d%s",&n,&p,str);
if(p==2){
for(int i=n-1;i>=0;i--){
if(((str[i]-'0')&1)==0){
ans += (i+1);
}
}
}
else if(p==5){
for(int i=n-1;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 | 57,389,870 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define dob double
int main(){
int a,b;
cin>>a>>b;
if (a + b == 3){
cout<<3;
}
else if (a + b == 4){
cout<<2;
}
else{
cout<<1;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo LLONG_MAX
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool... | 0 | 47,769,304 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> vec(n+1);
rep(i, n+1) cin >> vec[i];
ll smallest = 0;
for(ll i=n; i>=0; i--){
if(i == n){
... | #include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
int main(){
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
int ans = 0, a = 0, b = 0, c... | 0 | 74,032,123 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll r[10],c[10];
ll cntr[(1<<10)],cntc[(1<<10)];
string s[10];
bool rr[10],cc[10];
int main() {
ll H,W,K;
cin>>H>>W>>K;
for(ll i=0;i<H;i++) cin>>s[i];
ll sum=0;
for(ll i=0;i<H;i++){
for(ll j=0;j<W;j++){
if(s[i][j]... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
vector<int> perm(N);
for(int i=0; i<N; i++){
cin >> perm.at(i);
perm.at(i)--;
}
vector<int64_t> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
int logK= 31- __builtin_clz(K);
vector<vector<int>> tra... | 0 | 49,484,602 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
ll f(ll a, ll b) {
if (a > b) swap(a, b);
if (b % a == 0) {
return (2 * (b / a) - 1) * a;
}
return 2 * (b / a) * a + f(b %... | #include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<char> vc;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
#de... | 0 | 45,903,449 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <cassert>
#include <random>
using namespace std;
using ll = long lo... | #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 repr(i,n) for(int i=(n);i>=0;--i)
#define cinv(n,vec) VL vec(n);rep(i,n)cin>>vec[i]
#define int long long
#define itn int
#define pb push_back
#define eb emplace_back
#define m_p make_p... | 0 | 91,564,716 |
#include<iostream>
using namespace std;
int main(){
for(int n;cin>>n;){
int ans=0;
for(int a=0;a<=9;a++){
for(int b=0;b<=9;b++){
for(int c=0;c<=9;c++){
for(int d=0;d<=9;d++){
ans+=a+b+c+d==n;
}
}
}
}
cout<<ans<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
double PI = M_PI;
double ER = 1e-8;
double calc(int a, int b, double theta){
double rad = theta*PI/180;
double ans;
if(a*tan(rad) <= b){
ans = a*a*b;
ans -= a*a*a*tan(rad)/2;
return ans;
}
else{
ans = ... | 0 | 18,285,984 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
int x = 0, y = 0, z = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (p <= a) x++;
else if (p <= b) y++;
else z++;
}
cout << min({x, y, z}) << '\... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#i... | 0 | 9,628,929 |
#include <iostream>
void exchange(int a, int *n_1000, int *n_5000, int *n_10000){
if (a == 1000)
{
*n_1000 -= 5;
*n_5000 += 1;
}
else if (a == 5000)
{
*n_5000 -= 2;
*n_10000 += 1;
}
else
{
std::cout << "Error" << std::endl;
}
}
int main(){
... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; ... | 0 | 9,290,131 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class Abel> struct UnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
UnionFind(int n = 1, Abel SUM_UNITY = 0) {
init(n, SUM_UNITY);
}
void init(int n = 1, Abel SUM_UNITY = 0) {
par.... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int main()
{
int h, w;
cin >> h >> w;
vector<vector<char>> a(h, vector<char>(w));
for(int i = 0; i < h;... | 0 | 82,421,840 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #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>
#include... | 0 | 95,325,936 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
int main() {
#ifdef MYLOCAL
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
int N, L ,T;
cin >> N >> L >> T;
vector<i... | #include <cstdio>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <cmath>
#include <iomanip>
#include <deque>
#include <queue>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <sstream>
typedef ... | 0 | 52,451,517 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | #include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int> ;
using vi = vector<int> ;
using vvi = vector<vector<int>> ;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define... | 0 | 35,112,067 |
#include "bits/stdc++.h"
using namespace std;
int main(){
int n=0,x=0,ans=0;
while(true){
cin>>n>>x;
if(n==0&&x==0){break;}
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){ans+=1;}
}
}
}
cout<<ans<<endl;
ans=0;
}
} | #include <bits/stdc++.h>
using namespace std;
string s, t;
int main () {
cin >> s >> t;
if (t.substr(0,s.length())== s){
cout << "Yes";
} else {
cout << "No";
}
} | 0 | 42,891,101 |
#include <bits/stdc++.h>
#include <string.h>
#define int long long
#define MAX (int)(1e7+5)
#define MAX2D (int)(1e3+5)
#define itn int
#define inf 5e18
#define MOD (int)(1e9 + 7)
#define pb push_back
#define mk make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define sitr set<int>::iterat... | #include<iostream>
#include<string>
using namespace std;
int main(){
string x;
int a,b;
while(1){
cin >> x >> a;
if(x == "-") break;
for(int i=0;i<a;i++){
cin >> b;
x=x.substr(b,x.size()-b)+x.substr(0,b);
}
cout << x << endl;
}
} | 0 | 39,755,127 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
int ctoi(char c){return (int)c-(int)'0';}
int main() {
string N;
cin>>N;
int d=N.size();
int K;cin>>K;
int ans=0;
if(K==1){
ans=9*(d-1);
ans+=ctoi(N[0]);
}else if(K=... | #include <bits/stdc++.h>
using namespace std;
#define len(s) int(s.size())
#define res(x) cout<<((x)?"Yes\n":"No\n")
#define all(v) v.begin(),v.end()
typedef long long ll;
typedef long double ld;
ll mod = 1e9+7;
void solution() {
string s, t;
cin >> s >> t;
bool ans = true;
for(int i = 0; i < len(s); ++i) {
if(s[... | 0 | 4,234,801 |
#include <bits/stdc++.h>
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) x.begin(),x.end()
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int d;
cin >> d;
if (d == 25) cout << "Christmas" << endl;
else if (d == 24) cout <<... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 61,531,017 |
#include<iostream>
#include<string>
#include<vector>
#include<cctype>
int main(void) {
std::string InputS, InputP;
std::cin >> InputS >> InputP;
bool Answer = false;
int count = 0;
while (count < InputS.size()) {
if (InputS[count] == InputP[0]) {
bool flag = false;
for (int i = 0; i < InputP.size(); ++i) {... | #include <iostream>
using namespace std;
int main() {
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
int s;
bool a = x >= r && x <= W -r && y >= r && y <= H - r;
if (a){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | 0 | 56,297,311 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin>>N;
int A,B;
cin>>A>>B;
vector<int> P(N);
for(int i=0;i<N;i++){
cin>>P[i];
}
int result[3]={0};
for(int i=0;i<N;i++){
if(P[i]<=A) result[0]++;
else if(A+1<=P[i]&&P[i]<=B) result[1]++;
else result[2... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | 0 | 22,691,684 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,wa=0,i;
cin>>a>>b;
int n[b];
for(i=0;i<b;i++){
cin>>n[i];
wa+=n[i];
}
a-=wa;
if(a<0){
cout<<-1;
}else{
cout<<a;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater... | 0 | 40,272,187 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
int MOD = 1e9+7;
#define mp make_pair
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<string>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<iomanip>
#define REP(i,n) for(int i=0;i<(n);i++)
#define EPS (1e-7)
#define INF (2e9)
using namespace std;
typedef long long int ll;
const ll ... | 0 | 72,861,382 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rr... | 0 | 81,867,249 |
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y, ll z){
if(y==0)
return 1;
else
{
ll p=power(x,y/2,z);
if(y%2==0)
return (p*p)%z;
else
return (x*((p*p)%z))%z... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, A, B, t = 1;
cin >> N >> A >> B;
while (A > 0 && B <= N)
{
if (t % 2)
{
if (A + 1 == B)
A--;
else
A++;
}
else
{
if (B - 1 == A)
B++;
else
B--;
}
t++;
}
co... | 0 | 9,205,512 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
int main() {
int N, K;
cin >> N >> K;
cout << (bool)(N%K) << endl;
} | #include <iostream>
#include <string>
using namespace std;
const int MAX = 5000000;
int H, A[MAX+1];
int parent(int i){
return i/2;
}
int left(int i){
return 2*i;
}
int right(int i){
return 2*i + 1;
}
void maxHeapify(int *A, int i){
int l = left(i);
int r = right(i);
int largest;
if (l <= H && A[l] > A[i]... | 0 | 51,404,110 |
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
int main() {
lli K;
scanf("%lld",&K);
printf("50\n");
lli ad=K/50,rem=K%50;
for(int i=0;i<rem;i++) {
printf("%lld ",49 + ad + 50 - rem + 1);
}
for(int i=rem;i<50;i++) {
printf("%lld ",49 + ad - rem);
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
int A, B, C;
cin >> A >> B >> C;
for(int i = 1; i < 1e5; i++) {
if(A * i % B == C) {
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
} | 0 | 100,157,929 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 0 | 15,614,940 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, ss, ee) for (int i = ss; i < ee; ++i)
int H, W, K;
vector<string> v;
void input() {
cin >> H >> W >> K;
v.resize(H);
for (auto &s : v) { cin >> s; }
}
void solve() {
int ans = 0;
for (int h = 0; h < (1 << H); h++) {
for (int w = 0; w < (1 << W);... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main()
{
while (true) {
int n, m;
cin >> n >> m;
if (n == 0 && m == 0) {
return 0;
}
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
... | 0 | 71,059,639 |
#include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define MOD (int)1e9+7;
using ll = long long;
using namespace std;
int main() {
int N;
ll ans = 0;
cin >> N;
vector<int> A(N+1);
A[0] = 0;
rep1(i, N)
cin >> A[i];
A.p... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <utility>
#include <algorithm>
#include <functional>
#include <deque>
#define INF 1e9
#define MAX_L 8001
using namespace std;
typedef long l... | 0 | 58,672,906 |
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
#define MAX_NUM 1000010
void do_calc(int *numPrime){
for(int i=2;i<=MAX_NUM;i++){
bool flag = false;
for(int j=2;j<=sqrt(i);j++){
if(i%j==0){
flag = true;
break;
}
}
if(flag){
numPrime[i] = numPrime[i-1];
... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 0 | 85,492,591 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 200010, M = 45;
int n;
int cnt[N][M];
LL a[N];
bool check(int x, int y)
{
for (int i = 0; i < M; i ++ )
if (abs(cnt[x][i] - cnt[y][i]) >= 2)
return false;
return true;
}... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
vector<int> dp(n, -1);
function<int(int)> calc_dp = [&] (int i) {
if (dp[i] != -1) {
return dp[i];
}
if (i ... | 0 | 7,299,110 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
const int MOD=1000000007;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;
int main() {
ll a , b , k; cin >> a >> b >> k ;
rep(i,k){
if(i%2==0){
if(a%2==1) a--;
b+=a/2;
a/=2;
... | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | 0 | 85,117,717 |
#include <math.h>
#include <iostream>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <string>
#define YES "YES"
#define NO "NO"
#define space ' '
using namespace std;
void init();
void func();
int main(void)
{
func();
return 0;
}
#define MAXIMUM 1000000
bool table[MAXIMUM];
int ... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#define CH(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a<=i;i--)
using namespace std;
map<... | 0 | 84,016,240 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end(... | 0 | 87,573,527 |
#include <bits/stdc++.h>
using i64 = long long;
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a == b && b == c ? "Yes" : "No") << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n,k,ans;
string s;
vector<long> a;
cin >> n >> k >> s;
if(s[0]=='0') a.push_back(0);
a.push_back(1);
for(long i=1;i<n;i++) {
if(s[i-1]==s[i]) a[a.size()-1]++;
else a.push_back(1);
}
if(s[n-1]=='0') a.push_back(0);
if(a.size()<=k... | 0 | 31,431,656 |
#include "iostream"
using namespace std;
int main()
{
int n;
cin>>n;
string s,t;
cin>>s>>t;
string result;
for(int i=0;i<n;i++)
{
result=result + s[i] +t[i];
}
cout<<result<<endl;
} | #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... | 0 | 100,168,168 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 3;
vector<ll>A(N);
rep(i,N){
cin >> A[i];
}
sort(A.begin(),A.end(),greater<ll>());
cout << A[0]*10 + A[1] + A[2];
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | 0 | 3,084,427 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,K,n,m;cin>>N>>M>>K;
for(n=0;n<=N;n++){
for(m=0;m<=M;m++){
if(N*m+M*n-2*m*n==K)break;
}
if(m!=M+1)break;
}
if(n!=N+1)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#inclu... | 0 | 69,856,835 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int k;
int a;
int b;
cin>>k>>a>>b;
if(b/k-(a-1)/k==0){
cout<<"NG"<<endl;
}else{
cout<<"OK"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < (n); i++)
#define REP(i, s, n) for (signed i = (s); i < (n); i++)
#define int long long
bool ok(int x, int sum, vector<int> v) {
int M = sum - abs(x);
if (M < 0) return false;
int N = v.size();
vector<bool> dp(M + 1);... | 0 | 4,706,198 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N;
cin>>N;
ll ans=N*(N+1)*(N+2)/6;
for (int i = 0; i < N-1; i++){
int u,v;
cin>>u>>v;
ll m=min(u,v);
ll M=max(u,v);
ans-=m*(N-M+1);
}
cout<<ans<<endl;
... | 0 | 76,033,679 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPD(i,n) for(int i=(n)-1;i>=0;--i)
... | #include <iostream>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(ll i=(a);i<(b);++i)
#define REP(i, n) for(int i=0;i<(n);++i)
#define ALL(v) (v).begin(),(v).end()
const int MOD = (int) 1e9 + 7;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
... | 0 | 58,899,484 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<c-(d-b)<<" "<<d+(c-a)<<" "<<a-(d-b)<<" "<<b+(c-a)<<endl;
} | #include <iostream>
#include <cmath>
using namespace std;
struct Point {
double x, y;
};
void printPoint(Point p) {
cout << fixed << p.x << " " << p.y << endl;
}
void KochCurve(Point p1, Point p2, int rec, int n) {
if (rec < n) {
Point s, t, u;
double deg = 60.0*(M_PI/180.0);
s.x = (2.0 * p1.x + 1.0 *... | 0 | 61,284,622 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define pv(val) cerr << #val << '=' << (val) << endl
const int INF = 1e9;
int main(void){
int N, M, K; cin >> N >> M >> K;
bool ok = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 0 | 67,859,274 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
#define rrep(i, j, n) for(int i = (n) - 1; (j) <= i; --i)
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
int main(... | #include <bits/stdc++.h>
using namespace std;
int main(void){
std::deque<long long int> deq;
int n;
cin>>n;
long long int a;
for (int i=0;i<n;i++) {
cin>>a;
deq.emplace_back(a);
}
sort(deq.begin(),deq.end(),greater<long long int>());
std::map<long long int, int> map;
... | 0 | 60,495,436 |
#include<bits/stdc++.h>
#include<boost/variant.hpp>
using namespace std;
typedef long long ll;
typedef vector<boost::variant<bool, ll, int, string, double, char*, const char*>> any;
template<typename T> inline void pr(const vector<T> &xs){
for(int i=0; i<xs.size()-1; i++) cout<<xs[i]<<" ";
(xs.empty()?cout:(cout<<xs[... | #include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#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;
char a[55][55],b[55][55];
signed main(){
ios_base::sync_with_stdio(0);
int... | 0 | 12,444,534 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <climits>
#include <complex>
#include <numeric>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RREP(i,n... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 87,179,813 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i< (n); ++i)
const long long INF = 1LL<<58;
template<class T> bool chmin(T &a, T b){ if(a>b) a = b; }
template<class T> void chmax(T &a, T b){ if(a<b) a = b; }
template<class T> int former(const vector<T> &v, T x){
... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begi... | 0 | 74,826,194 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
ll A,B,K;
cin >> A >> B >> K;
for(int i = 0; i < K; i++){
if(i%2==0){
ll tmpa;
if(A%2==0){
tmpa = A / 2;
A -= tmpa;... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#de... | 0 | 43,650,333 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <fstream>
#include <string>
#include <math.h>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define rep(i, n) for (l... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 | 24,688,853 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int x = A + B;
int y = C + D;
if (x > y){
cout << "Left" << endl;
}
else if (x == y){
cout << "Balanced" << endl;
}
else{
cout << "Right" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_in_out ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main()
{
fast_in_out;
string s;
cin >> s;
int c = 0;
if(s[0] == 'R')
{
c++;
if(s[1] == 'R')
{
c++;
i... | 0 | 100,404,374 |
#include <iostream>
using namespace std;
int main() {
int a, b; cin >> a >> b;
if ((a + b) % 2 != 0) printf("%d\n", (a + b) / 2 + 1);
else printf("%d\n", (a + b) / 2);
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
string S, T;
cin >> S >> T;
int m = -1;
rep(i, S.size() - T.size() + 1) {
bool ok = true;
rep(j, T.size()) {
if (S[j + i] != '?' && S[j + i] != T[j]) {
ok =... | 0 | 94,026,916 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 | 22,800,111 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;vector<pair<int,int>>A(N);
for(int i=0;i<N;i++){int t;cin>>t;A[i]=pair<int,int>(t,i%2);}
sort(A.begin(),A.end());
int ans=0;
for(int i=0;i<N;i++){
if(i%2!=A[i].second)ans++;
}cout<<ans/2;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define REP(i, a, b) for(int i = a; i >= b; i--)
#define maxN 200005
#define inf (int) 1e9
#define mode (int) 10000... | 0 | 43,208,389 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
void Digvijay()
{
int k;
cin>>k;
queue<int> q;
for(int i=1;i<10;i++)
{
q.push(i);
}
k--;
while(k)
{
int f=q.front();
q.pop();
if(f%10==9)
{
q.push(f*10+f%10-1);
q.push(f... | #include<iostream>
using namespace std;
int main(){
for (int i = 1; i < 9 + 1; i++){
for (int j = 1; j < 9 + 1; j++){
cout << i << 'x' << j << '=' << i * j << endl;
}
}
return 0;
} | 0 | 44,347,418 |
#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
typedef long long Int;
#define REP(i , x) for(int i = 0 ; i < x ; ++i)
int main()
{
int n;
int m;
while (cin >> n,n){
map<char, char> table;
string ans;
REP(i, n){
char a, b;
... | #include <bits/stdc++.h>
#define ll long long int
#define K 1000000007
using namespace std;
ll fact[2001];
ll invfact[2001];
ll power(ll x, ll y, ll m)
{
if (y == 0)
return 1;
ll p = power(x, y/2, m) % m;
p = (p * p) % m;
return (y%2 == 0)? p : (x * p) % m;
}
ll inverseMod(ll a)
{
re... | 0 | 55,334,848 |
#include <iostream>
using namespace std;
int main () {
int h, w, a, b;
cin >> h >> w >> a >> b;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if ((i < b) ^ (j < a)) {
cout << '1';
} else {
cout << '0';
}
}
cout << endl;
}
} | #include <iostream>
#include <set>
#include <vector>
#include <string>
using namespace std;
void fnDictionary(set<string> &a_rsesKey, vector<string> &a_rvsFind)
{
int iCommandCnt;
cin >> iCommandCnt;
for (int i = 0; i < iCommandCnt; i++)
{
string sCommand;
string sKey;
cin >> sCommand >> sKey;
... | 0 | 69,551,027 |
#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
int main() {
int N, M; cin >> N >> M;
vector<vector<int>> dist(N, vector<int>(N, INF));
for (int i = 0; i < M; ++i) {
int a, b, c; cin >> a >> b >> c;
dist[a - 1][b - 1] = c;
dist[b - 1][a - 1] = c;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, int> piipi;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define e... | 0 | 179,793 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define PI 3.14159265359
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
int main() {
string a, b;
cin >> a >> b;
if (a == "H") {
if (b == "H")
cout << "H"... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 0 | 50,396,509 |
#include<bits/stdc++.h>
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define REP(i, a, b) \
for (int i = int(a); i <= int(b); i++)
#define TRvi(c, it) \
for (vi::iterator it = (c).begin(); it != (c).end();... | #include <bits/stdc++.h>
using namespace std;
#define loop(x,n) for(int x = 0; x < n; ++x)
#define ed end()
#define bg begin()
# define ld long double
#define ll long long
#define ub(v,a) upper_bound(all(v),a)
#define lb(v,a) lower_bound(all(v),a)
#define sz(a) (int)(a.size())
#define pb push_back
#define mp make_pai... | 0 | 67,217,504 |
#include <iostream>
#include <fstream>
#include <vector>
#define FOR(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(){
cin.tie(NULL);
ios_base::sync_with_stdio(false);
cout.tie(NULL);
int n;
cin >> n;
int k = -1;
for (int i = 1; i <= n + 1; i++)
if ((long long)i * (i... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll n,k,cnt=1,sum=0;
cin>>n;
if(n%2==1){
cout<<0;
return 0;
}
n/=10;
while(n>0){
k=n%5;
sum+=k*cnt... | 0 | 74,759,032 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
long long a, b;
cin >> n >> a >> b;
if (n == 1) {
if (a == b) {
cout << 1 << '\n';
} else {
cout << 0 << '\n... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | 0 | 1,562,067 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <unordered_map>
#include <list>
#include <utility>
#include <set>
#include <bitset>
#define ls ... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long n,k;
scanf("%ld %ld", &n, &k);
vector<long> vix(n * n),viy(n * n);
for(long i = 0; i < n; i++){
long x,y;
scanf("%ld %ld", &x, &y);
for(long... | 0 | 54,886,051 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int cnt[210000];
for(int i = 0; i < N; i++) {
int a;
cin >> a;
cnt[a-1]++;
}
sort(cnt, cnt+N);
int ans = 0;
for(int i = 0; i < N - K; i++) {
ans += cnt[i];
... | 0 | 64,861,104 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
string s;
int w,i;
cin>>s;
cin>>w;
for (i=0;i<s.size();i+=w)
... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define double ld
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef... | 0 | 54,121,585 |
#include <bits/stdc++.h>
class Dice {
public:
int u;
int r;
int l;
int d;
int b;
int f;
void S(void) {
int temp;
temp = u; u = b; b = d; d = f; f = temp;
}
void N(void) {
int temp;
temp = u; u = f; f = d; d = b; b = temp;
}
void E(void) {
int temp;
temp = u; u = l; l = d; d... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 0 | 59,241,855 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll n, cn... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <cmath>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
#define rrep(i, j, n) for(int i = (n) - 1; (j) <= i; --i)
constexpr ll MOD = 100000... | 0 | 97,204,421 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, j, i;
cin >> a;
c=0;
vector<string> blue(100);
for(i=0;i<a;i++) {
cin >> blue.at(i);
}
cin >> b;
vector<string> red(100);
for(i=0;i<b;i++) {
cin >> red.at(i);
}
for(i=0;i<a;i++) {
d=0;
for(j=0;j<100;j++) {
... | 0 | 66,947,498 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <functional>
#include <numeric>
#include <iomanip>
#include <climits>
#include <cstring>
#include <cmath>
using namespace std;
#define int long long
#... | #include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
for(int a[5];scanf("%d%d%d%d%d",a,a+1,a+2,a+3,a+4)==5;){
sort(a,a+5);
reverse(a,a+5);
printf("%d %d %d %d %d\n",a[0],a[1],a[2],a[3],a[4]);
}
return 0;
} | 0 | 78,613,248 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1};
const int dx[4]={1,0,-1,0};
const ll INF=1e10;
vector<ll>a,p;
ll... | 0 | 90,322,715 |
#include <iostream>
#include <cmath>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <list>
#include <cctype>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
locale l = locale::class... | #include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>... | 0 | 99,178,854 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const int INF = 1e9;
int main(void){
int N, M, K; cin >> N >> M >> K;
string ans = "No";
REP(x,M+1){
REP(y,N+1){
if(x*N + y*M -... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i... | 0 | 69,050,739 |
#include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m>>n>>o>>p)
{
if(m+n>o+p)
cout<<"Left"<<endl;
else if(m+n<o+p)
cout<<"Right"<<endl;
else
cou... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
struct Point {
double x, y;
};
void koch(int n, Point a,... | 0 | 12,230,490 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
vector<int> ansvec;
for (;;){
int n;
cin >> n;
if (n == 0) break;
int tmpmin = 1001;
int tmpmax = -1;
int tmpans = 0;
for (int i = 0; i < n; i++){
int s;
cin >> s;
tmpmin = min(s, tmpmin);
tmpmax = ma... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
string s;
cin >> s;
vector<pair<int,int>> vp;
int idx=0;
while(idx < n){
int cnt = 0;
char c = s.at(idx);
while(... | 0 | 63,225,871 |
#include <iostream>
const std::string COMMAND_PRINT = "print";
const std::string COMMAND_REVERSE = "reverse";
const std::string COMMAND_REPLACE = "replace";
void print(const std::string &str, int a, int b);
std::string reverse(const std::string &str, int a, int b);
std::string replace(const std::string &str, int a, int... | #include<iostream>
using namespace std;
int main()
{
int N,M;
int A[10000];
int B=0;
cin>>N>>M;
for(int i=0;i<M;i++){
cin>>A[i];
B=B+A[i];
}
if(N>=B)
cout<<N-B<<endl;
else
cout<<-1<<endl;
} | 0 | 97,830,625 |
#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;
cin >> n >> s;
int ans = 0;
rep(i, 1000) {
int t = i;
int cnt = 0;
for (int j = n - 1; j >= 0; j--) {
if (s[j] - '0' == t % 10) {
cnt++;
t /= 10;
if ... | #include<stdio.h>
int n,m;
int main()
{
for(n=1;n<10;n++)
{
for(m=1;m<10;m++)
{
printf("%dx%d=%d\n",n,m,n*m);
}
}
return 0;
} | 0 | 458,840 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N,M;
cin >> N >> M;
if ((N==1)&&(M==1)){
cout << 1 << endl;
}
else if((N==1)||(M==1)){
cout << N*M-2 << endl;
}
else{
cout << (N-2)*(M-2) << endl;
}
} | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LC... | 0 | 7,842,467 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef... | #include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
while (true) {
string s;
getline(cin, s);
if (s == ".") break;
string ans = "yes";
std::stack<char> st;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(') {
st.push('(');
} else if (... | 0 | 60,672,243 |
#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
constexpr int mod = 1e9 + 7;
constexpr int32_t inf = 1001001001;
constexpr int64_t infll = 1001001001001001001ll;
constexpr... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;... | 0 | 94,716,676 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 2000000000;
int main(){
int x;
cin >> x;
if (x <... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 57,811,684 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
int x[100005];
... | #include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_back... | 0 | 35,497,481 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++... | #pragma GCC optimize ("O3")
#pragma GCC target ("avx2")
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr <<... | 0 | 76,215,461 |
#include<stdio.h>
int main(){
int a,b;
int i;
scanf("%d%d",&a,&b);
if(a>b){
for(i=0;i<a;i++){
printf("%d",b);
}
}else{
for(i=0;i<b;i++){
printf("%d",a);
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const long long int modu=1e9+7;
#define endl '\n'
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define inp(x) for(auto &t:x) cin>>t;
#define itr vector<int>::iterator
#define debug(a) cout << #a << "=" << a << ' '<<endl;
#define out(x) for(aut... | 0 | 60,440,867 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1e9+7;
int main(){
int n;
cin >> n;
vector<ll> t(n),a(n);
rep(i,n) cin >> t[i];
rep(i,n) cin >> a[i];
vector<ll> l(n,0),r(n,0)... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int a,b,i;
while(cin>>a>>b)
{
string s[1001];
for(i=0;i<a;i++)
{
cin>>s[i];
}
sort(s+0,s+a);
for(int j=0;j<a;j++)
cout<<s[j];
}
return 0;
... | 0 | 13,162,144 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pii;
#define int ll
#define LOCAL 0
#define dbg(x) cout << #x << " is " << x << "\n"
#define gll(x) scanf("%d",&x)
#define gll2(x,y) scanf("%d%d",&x,&y... | 0 | 74,318,422 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,l,r) for(int i = l; i < r; ++i)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<ll int> dp(n+1, 0);
vector<int> h(n+1, 0);
rep(i, 1, n+1) cin >> h[i];
dp[2] = abs(h[1]-h[2]);
for(int i = 3; i <= n; ++i) {... | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fore(i, l, r) for(int i = int(l); i < int(r); i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(a) int((a).size())
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
... | 0 | 63,672,515 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <cstring>
#include <string>
#include <queue>
#include <cmath>
#include <map>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define rev(v) (v).rbegin(), (v).rend()
#define MP make_pair
#define X fir... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
template<class T> inline T... | 0 | 13,619,607 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push_back
#define mp make_pair ... | #include <assert.h>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include... | 0 | 29,420,053 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int MAX_D = 10;
const int MAX_N = 10;
const int MAX_S = 100;
int memo[MAX_D + 1][MAX_N + 1][MAX_S + 1];
int sum_of_integers(int d, int n, int s)
{
if (memo[d + 1][n][s] != -1) return memo[d + 1][n][s];
if (n == 0) return s == 0;
if (... | #include<iostream>
#include<cstdio>
using namespace std;
#define PI 3.1415927
int main()
{
int i,max=0,n,ans=0,x;
cin>>n;
for(i=0;i<n;i++)
{
cin>>x;
if(x>=max)
{
max = x;
ans++;
}
}
cout<<ans;
return 0;
} | 0 | 28,173,269 |
#include <bits/stdc++.h>
using namespace std;
typedef long int lint;
typedef long long int llint;
#define INF 1073741824
#define LINF 4611686018000000000
#define MOD 1000000007
int win(char c) {
if (c == 'r') return 2;
if (c == 's') return 0;
return 1;
}
int main() {
int n, k;
cin >> n >> k;
int... | #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;
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)
#define inf 1000000000000000LL
#define F... | 0 | 3,748,940 |
#include<stdio.h>
int main(){
int a = 0;
int b = 0;
int c = 0;
int cnt = 0;
int x = 0;
scanf("%d %d %d",&a,&b,&c);
for( x = a; x <= b; x++){
if(c % x == 0)
cnt++;
}
printf("%d\n",cnt);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
int ans = 0,light = 1;
for (int i = 0; i < N; ++i)
{
++... | 0 | 30,378,992 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.