code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
bool x_dp[4010][16100] = {};
bool y_dp[4010][16100] = {};
int ori = 8050;
int main(){
string s;
int x, y;
cin >> s >> x >> y;
vector<int> h, v;
int cnt = 0;
bool m = true;
for(int i = 0; i < s.size(... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
c... | 0 | 28,012,038 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
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 ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string a, b;
cin >> a >> b;
if (a.size() > b.size()) {
cout << "GREATER" << endl;
return 0;
} else if (a.size() < b.size()) {
c... | 0 | 13,712,869 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | #include <iostream>
#include <cstring>
using namespace std;
int dp[1001][1001];
int main(){
int q,xl,yl;
char X[1001],Y[1001];
cin >> q;
for (int i=0;i<q;i++){
cin >> X >> Y;
xl=strlen(X);
yl=strlen(Y);
for (int i=1;i<=xl;i++)dp[0][i]=0;
for (int i=1;i<=yl;i++)dp[i][0]=0;
for (int i=0;i<... | 0 | 34,792,081 |
#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... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,T;
cin>>N>>T;
vector<int>t(N);
for(int i=0;i<N;i++){
cin>>t[i];
}
int a=N*T;
for(int i=1;i<N;i++){
if((T-(t[i]-t[i-1]))>0){
a-=(T-(t[i]-t[i-1]));
}
}
cout<<a<<endl;
return 0;
} | 0 | 26,337,655 |
# include <iostream>
# include <cstring>
# include <queue>
using namespace std;
# define pii pair<int,int>
int R, C;
char grid[1005][1005];
int dis[1005][1005];
int dx[] = {-1,0,1,0};
int dy[] = {0,-1,0,1};
bool inside(int r, int c){
return 1 <= r && r <= R && 1 <= c && c <= C;
}
int main(){
cin >> R >> C;
queue<... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define Pause system("pause")
using namespace std;
typedef long long ll;... | 0 | 29,162,010 |
#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(){
int n;
cin>>n;
int x[100];
double sum;
rep(i,n){
cin>>x[i];
sum+=x[i];
}
int p=round(sum/n);
int ans=0;
rep(i,n){
int diff=p-x[i];
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
const int N = 1e5 + 10;
const ll M = 998244353;
int main() {
ll n, x, m;
cin >> n >> x >> m;
map<ll, int> p... | 0 | 14,297,608 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define vl vector
#define ff first
#define ss second
using namespace std;
int main()
{
ll a,b,i,j,n,t;
cin>>n;
ll arr[n],brr[n]={0};
for(i=0;i<n;i++) cin>>arr[i];
for(i=0;i<n-1;i++) if(arr[i]>=arr[i+1]) brr[i]=... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | 0 | 10,961,722 |
#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;
string s;
int main(... | #include <iostream>
#include <algorithm>
#include <string>
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
while(true){
std::string str;
std::cin >> str;
if(str=="-") break;
int m;
std::cin >> m;
int cnt = 0;
for(int i=0; i<m; ++i){
... | 0 | 8,148,239 |
#include <bits/stdc++.h>
using namespace std;
int h, w;
int n;
bool ng[16][16];
int dp[16][16];
int search(int x, int y)
{
if (x > h - 1 || y > w - 1) return 0;
if (ng[x][y]) return 0;
if (x == h - 1 && y == w - 1) return 1;
if (~dp[x][y]) return dp[x][y];
return dp[x][y] = search(x + 1, y) + search(x, y + 1);
}
i... | #pragma region header
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#inc... | 0 | 73,760,552 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s;
cin >> s;
int n = s.size();
int zero = 0;
int one = 0;
for(int i=0 ; i<n; i++){
if(s.at(i) == '0') zero++;
else one++;
}
cout << 2*min(zero,one) << endl;
} | #include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<ll,int> pii;
... | 0 | 94,992,595 |
#include<iostream>
using namespace std;
int Consecutive_Integers(int n,int k){
return n-k+1;
}
int main(){
int N,K;
cin >> N >> K;
cout << Consecutive_Integers(N,K) << endl;
return 0;
} | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <tuple>
#include <cstdio>
#include <math.h>
#include <c... | 0 | 40,718,676 |
#include <bits/stdc++.h>
#include <random>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define o cout<<"BUG"<<endl;
#define IOS ios_base::sync_with... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> l4;
typedef pair<double, double> dd;
#define mp make_pair
#define pb push_back
#define debug(x) cerr << #x << " = " << x << " "
const int N = 5e3+2;
bitset<N> bl[N], br[N];
int n, k;
void print(bitset<N> ... | 0 | 67,987,612 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=1005,INF=1000;
ll gcd(ll a,ll b){
if(b==0) return a;
return gcd(b,a%b);
}
int main(){
ll N,X;cin>>N>>X;
if(gcd(N,X)==1) cout<<(N-1)*3<<endl;
else cout<<(N/gcd(N,X)-1)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
c... | 0 | 77,383,808 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
const int MOD = 1000000007;
long long solve(vector<long long> &V, int n) {
long long res = 0;
rep(i, 0, n) {
res += V[i] * (i - n + i + 1);
res %= MOD;
}
return res;
}
int main() {
int N, M... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
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(a,b);
}
ll pow(ll x,ll y){
ll tmp=x,res=1;
w... | 0 | 6,079,825 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int N,M;
vector<vector<int>> neighbor;
int res = 0;
void dfs(int now, int reached){
if(reached == (1<<N)-1)res++;
else{
for(int neigh : neighbor.at(now)){
if((1<<(neigh-1)) & reached)continue;
else dfs(neigh, reached + (1<<(neigh-1)));... | 0 | 3,899,663 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#de... | #include <iostream>
using namespace std;
template<typename T>
class Dice {
private:
void Init() {
upId = 0;
frontId = 1;
rightId = 2;
}
public:
Dice() :
number{1, 2, 3, 4, 5, 6}
{
Init();
}
Dice(T (&n)[6]) :
number{n[0], n[1], n[2], n[3], n[4], n[5]}
{
Init... | 0 | 23,963,976 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,y;
cin >> x >> y;
bool can = false;
for (int i = 0; i < x+1; i++) {
for (int j = 0; j < x+1; j++) {
if (i * 2 + j * 4 == y && i + j == x) {
can = true;
}
}
}
if (can) {
cout << "Yes" << endl;
} else {
cout... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main(){
int n,m;
cin >> n >> m;
const int max_n = 1e5;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
for(int i = 0; i < m; i++){
int left = 0;
int righ... | 0 | 46,516,176 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<numeric>
using namespace std;
using ll = long long;
#define int ll
signed main(){
int N; cin >> N;
vector<int>A(N);
for(auto & e : A) cin >> e;
int sum = A.front() - 1;
int crt = 2;
for(int i = 1; i < A.size(); ++i){
if(crt... | #include <bits/stdc++.h>
int main(){
int X, Y, Z, K;
std::cin >> X >> Y >> Z >> K;
std::vector< long long > A(X);
std::vector< long long > B(Y);
std::vector< long long > C(Z);
for(int i=0; i<X; i++){
std::cin >> A[i];
}
for(int i=0; i<Y; i++){
std::cin >> B[i];
}
... | 0 | 82,519,942 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;n>i;++i)
#define MOD 1000000007
using namespace std;
using ll=int64_t;
using pii=pair<int,int>;
using vi=vector<int>;
using VI=vector<ll>;
using vis=vector<string>;
using vvi=vector<vi>;
int gcd(int a,int b){
if(a%b==0)
return b;
return gcd(b,a%b);
}
int ... | #include <iostream>
#include <cstring>
#include <stack>
#include <algorithm>
using namespace std;
int N,A[100005],L[100005];
int main()
{
L[0]=0;
cin>>N;
int i,j;
for(i=1;i<=N;i++){
cin>>A[i];
}
int len=1;
L[0]=A[1];
for(i=1;i<=N;i++){
if(L[len-1]<A[i])L[len++]=A[i];
... | 0 | 26,528,790 |
#include <iostream>
#include <map>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)
long long N, A[1 << 18], D[1 << 18];
long long S;
int main() {
cin >> N;
for (int i = 1; i <= N; i++) cin >> A[i];
f... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
const int INF = 1e9;
co... | 0 | 94,442,899 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
int ans = 0, K = 1;
for (int i = 1; i < N; i++) {
if (A.at(i) == A.at(i - 1)) {
K++;
}
else {
ans += K / 2;
K = 1;
}
}
ans += K / 2;... | #define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _ov... | 0 | 5,517,721 |
#include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <bitset>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define re... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii... | 0 | 15,224,766 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
int main()
{
int W, H, N;
int x, y, a;
cin >> W >> H >> N;
int minx = 0, maxx=W;
int miny = 0, maxy=H;
rep(i, N){
cin >> x >> y >> a;
if(a==1){
minx = max(mi... | 0 | 86,572,459 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s[26][26];
int h,w;
cin>>h>>w;
int number;
char c;
for (int i = 0; i < h; i++){
for (int j = 0; j < w; j++){
cin>>s[i][j];
if(s[i][j]=="snuke"){
c='A'+j;
number=i+1;
}
}
}
cout<<c<<number<<endl;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | 0 | 47,522,470 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#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_... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i... | 0 | 46,389,005 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<cstdio>
#include<string>
typedef long long int ll;
using namespace std;
string back(string s){
string ret="";
for(int i=s.size()-1;i>=0;i--){
ret+=s[i];
}
return ret;
}
int main(){
string s;
cin>>s;
cout<<back(s)<<endl;
return 0;... | #include "bits/stdc++.h"
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define li long int
#define ld long double
#define lld long long double
#define pb push_back
#define mk make_pair
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
... | 0 | 63,436,032 |
#pragma GCC optimize(3)
#define ADD_STACK int size = 512 << 20;\
char *pp = (char*)malloc(size) + size; \
__asm__("movl %0, %%esp\n" :: "r"(pp))
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<fstream>
#include<queue>
#include<map>
#include<stack>
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ... | 0 | 25,925,466 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define ll long long
int main()
{
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i].first >> v[i].second;
}
sort(v.begin(), v.end());
ll ans = 0, ind = 0;
... | 0 | 14,374,785 |
#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 ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define endl "\n"
#define nl cout<<endl
#define pb push_back
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define txti freopen("input.txt", "r", stdin);
#de... | 0 | 1,967,869 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int num[5];
for ( int i = 0; i < 5; i++ ) cin >> num[i];
sort(num,num+5);
reverse(num,num+5);
cout << num[0] << " " << num[1] << " " << num[2] << " " <<
num[3] << " " << num[4] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template <typename T> using V = vector<T>;
template <typename T> using VV = vector<vector<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#defi... | 0 | 46,362,751 |
#include <stdio.h>
int main(void)
{
int r,K,x,i;
scanf("%d%d%d",&r,&K,&x);
for(i=0;i<10;i++){
x=x*r-K;
printf("%d\n",x);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define nl '\n'
#define st first
#define nd second
#define ins insert
#define pb push_back
#define mp make_pair
#define hashmap unordered_map
#define hashset unordered_set
signed main(){
int x, y; cin >> x >> y;
bool flag = false;
for (int i = 0; i <... | 0 | 53,743,940 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if(A <= 8 && B <= 8) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a... | 0 | 11,338,322 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#include <numeric>
#include <set>
#include <map>
#define rep(i, j) for(int i = 0; i < j; i++)
#define all(i) i.begin(), i.end()
#define ll long long
#define bl bool
#define nn printf("\n"... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int N,M;
int DFS(vector<vector<int>> &load, int now, vector<bool> visited){
bool end=true;
for(int i=1; i<=N; i++){
if(visited[i]==false){
end=false;
}
}
if(end) r... | 0 | 25,013,356 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ss second
#define all(c) c.begin(),c.end()
#define endl "\n"
#define test() int t; cin>>t; while(t--)
#define fl(i,a,b) for(int i = a ; i <b ;... | #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... | 0 | 50,058,695 |
#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;
int par[100005];
int rnk[100005];
int cnt[100005];
void init(int n) {
for (int i=0; i<n; i++) {
par[i]=i;
rnk[i]=0;
cnt[i]=1;
}
}
int find(int x) {
if (par[x]==x) {
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n,m;
cin >> n >> m;
vector<string> res(m,"");... | 0 | 59,753,158 |
#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;
int main(){
string s;
cin >> s;
cout << s.substr(0,5) << " " << s.substr(6,7) << " " << s.su... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se secon... | 0 | 99,868,849 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#define ll long long
using namespace std;
template <class T>
inline void rd(T &x)
{
x=0; char c=getchar(); int f=1;
while(!isdigit(c)){if(c=='-')f=-1; c=getchar();}
while(isdigit(c)) x=x*10-'0'+c,c=getchar(); x*=f;
}
const int N=2e5+10,mod... | #include<iostream>
using namespace std;
int main()
{
long long min, max;
long long sum = 0;
int n;
cin >> n;
int num[n];
for( int i = 0; i < n; i++ )
{
cin >> num[i];
sum += num[i];
}
min = num[0];
max ... | 0 | 57,427,903 |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
for (a=1; a<10; a++){
for (b=1; b<10; b++){
c=a*b;
cout << a <<"x"<< b <<"="<< c <<"\n";
}
}
return 0;
} | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utili... | 0 | 46,756,597 |
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#incl... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#define int long lo... | 0 | 55,581,840 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,x[1010],y[1010];
int ansa[40],ansb[40];
void work(int w,int ans[])
{
int f=1;
if(w<0)f=-1,w=-w;
for(int i=30,j;i>=0;--i)
if(!(w>>i&1))
{
j=i-1;
while(~j&&!(w>>j&1))--j;
if(~j)
{
for(int k=j;k<i;++k)ans[k]=-1;ans[i]=... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
const double PI = 3.1415926535897932384;
const int INF = 1000000000;
const ll LINF = 1000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
int ctoi(char c){
if (c == '0') {
return... | 0 | 65,167,898 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) int a; cin >> a;
#define inputInt2(a,b) int a; int b; cin >> a >> b;
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a;
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){ci... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char **argv)
{
string str;
int count = 0, h[100] = { 0 };
while(cin >> str) {
if(str == "-") break;
cin >> count;
for(int i = 0; i < count; i++) cin >> h[i];
for(int i = 0; i < count; i++) {
for(int j = 0; j < h[i]; j++) str+= s... | 0 | 45,923,941 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
#define INF 1e9
#define LINF __LONG_LONG_MAX__
int main() {
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
ll n, k, ans = 0;
cin >> n >> k;
vector<ll> a(n); vector<vector<ll>> b(n, vector<ll>(n, 0));
queue<pair<int, int>> cur, nxt;
for (int i = 0; i < n; i++) cin >> a[i];
for (int l = 0; l < n; l++) for (int r = l; r ... | 0 | 21,763,547 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()... | 0 | 99,965,685 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstr... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (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 vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;... | 0 | 72,596,988 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
int main() {
int N; cin >> N;
ll L[100];
L[0] = 2;
L[1] = 1;
for(int i = 2; i <= N; i++){
L[i] = L[i-1] + L[i-2];
}
cout << L[N] << endl;
return 0;
} | # include <bits/stdc++.h>
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x... | 0 | 5,283,405 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
map<int,int> mp;
int MAX = 0;
int MIN = 1e9;
for(int i=0; i<N; i++){
int x;
cin >> x;
mp[x]++;
MAX = max(MAX,x);
MIN = min(MIN,x);
}
bool flag = true;
int now = MIN-1;
for(auto itr = mp.begin(); itr != mp.e... | 0 | 22,673,468 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, w;
scanf("%d%d", &s, &w);
if (w >= s) printf("unsafe\n");
else printf("safe\n");
} | #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 < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 1000000007;... | 0 | 18,198,615 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
string s;
int main(){
cin >> s;
int n = s.size();
if(n == 26 && s == "zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
}else if(n == 26){
string t = s;
next_permutation(s.begi... | 0 | 25,874,993 |
#include<iostream>
#include<cstdio>
#include<cctype>
using namespace std;
int main(){
string a;
while(1){
cin>>a;
if(a=="0")break;
int b=0;
for(int i=0;i<a.size();i++){
b += a[i]-'0';
}
cout<<b<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define N 100010
using namespace std;
int main(){
int n,a[N],i,j,ansa,ansb;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
ansa=a[n-1];
for(i=n-2;i>=0;i--)
{
if(!i)
ansb=a[i];
if(min(a[i],a[n-1]-a[i])>=min(a[i-1],a[n-1]-a[i-1]))
{
ansb=a[i];
break;
}
}
cout<<ansa... | 0 | 96,668,661 |
#include<iostream>
using namespace std;
int main(void){
char str[21]="";
cin >> str;
for(int i=20; i>=0; i--){
if(str[i]!='\0') cout << str[i];
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define mp make_pa... | 0 | 72,842,037 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 0 | 79,786,537 |
#include <iostream>
#include <stack>
int main()
{
std::stack<int> cars;
int in_car;
while (std::cin >> in_car) {
if (in_car == 0) {
std::cout << cars.top() << std::endl;
cars.pop();
} else {
cars.push(in_car);
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th... | 0 | 61,447,029 |
#include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
long long k,a,b;
cin>>k>>a>>b;
if(b-a<=1){
cout<<k+1;
return 0;
}
if(k+1<a+2){
cout<<k+1;
return 0;
}
k++;
k-=(a+2);
cout<<b+(k/2)*(b-a)+k%2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for (int i=0 ; i<N ; i++)
cin >> A.at(i);
vector<int> height(N-1);
for (int i=0 ; i<N-1 ; i++){
if (A.at(i) > A.at(i+1)){
height.at(i) = A.at(i) - A.at(i+1);
A.at(i+1) = A.at(i);
}
else
... | 0 | 70,587,788 |
#include<bits/stdc++.h>
using namespace std;
int guusuu[100005],kisuu[100005],mx1,mx2,x1,x2;
#define int long long
signed main() {
int n;
cin >> n;
int u;
for(int i = 0; i < n; i++) {
cin >> u;
if(i%2 == 0) {
guusuu[u]++;
if(mx1 < guusuu[u]) {
mx1... | #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 | 44,444,892 |
#include<bits/stdc++.h>
#define fo(i,a,b) for(register int (i)=(a);(i)<=(b);++(i))
#define rd read()
#define maxn 200001
#define gc getchar()
#define mem(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define pb push_back
#define db double
#define pu puts(" ")
using namespa... | #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 | 37,328,223 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(lo... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int... | 0 | 83,061,500 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
vll r[200005];
ll points[200005];
mll finished;
vo... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
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) { ... | 0 | 28,727,040 |
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a[N];
for(int i = 0; i < N; i++){
cin >> a[i];
}
int min= a[0];
int max= a[0];
long long sum= a[0];
for(int i = 1; i < N; i++){
sum += a[i];
if(a[i] < min) min = a[i];
if(a[i] > max) max = a[i];
}
cout << min << " " << max << " " << sum << end... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 73,667,189 |
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
int mt[100][100];
int w,h;
vector<pair<int,int> > block;
void saiki(int y,int x){
rep(i,block.size())
if(y==block[i].first && x==block[i].second){
mt[y][x]=0;
return;
}
if(x-1>=0 && y-1>=0)mt[y]... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | 0 | 31,925,312 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1001001001
#define LINF 1001001001001001001
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LLP;
bool check(vector<int> d, int x) {
int sum =... | #include <stdio.h>
#define N (2000)
char s[N], ans[N], s2[N];
int main(){
int len = 0;
s[0] = '1';
for (int i = 1; i < 12; i++){
s[i] = '0';
s[i + 1] = 0;
printf("? %s\n", s);
fflush(stdout);
scanf("%s", ans);
if (ans[0] == 'N'){
len = i;
... | 0 | 11,211,744 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
using namespace std;
int arr[101];
int main(){ int x, n;
cin >> x >> n;
for (int i=0; i<n; i++){ int x;
cin >> x;
arr[x]++;
}
int min = 2e9, ans;
for (int i=0; i<=102; i++){
if(arr[i] == 0)... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
long long patty_num(const int l,
const long long x,
const vector<long long>& patty,
const vector<long long>& bun,
const vector<long long>& all){
if(l == 0){
... | 0 | 83,029,190 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
const int MOD = 1000000007;
int main()
{
string a, b, x;
int m, n;
cin >> a >> b >> m >> n >> x;
if(x == a) cout << m - 1 << " " << n << endl;
else if(x == b) cout << m << " " << n -1 << endl ;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | 0 | 17,944,089 |
#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(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL<<60;
using ll = long long;
using P = pair<int, int>;
#define vi vector<int>
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
typedef long long ll;
#define press_F_to_pay_respect ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn for(int i=0;i<n;i++)
#define form for(int j=0;j<n;j++)
#define fore(i,a,b) for(int i = a; i < (b); i++)
#define pb push_back
#de... | 0 | 42,177,255 |
#include <iostream>
#include <vector>
int main()
{
long long int n;
std::cin>>n;
std::vector<long long int> p(n);
for (int i=0; i<n; i++) std::cin>>p[i];
long long min=p[0],count=1;
for (int i=1; i<n; i++)
{
if (p[i]<min)
{
count++;
min=p[i];
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
ll N;
cin >> N;
ll ans = 0;
for(ll i=1;i*i<=N;i++){
if((N-i)/i > i && (N-i)%i == 0){
ans += (N-i)/i;
}
... | 0 | 62,352,848 |
#include<iostream>
using namespace std;
int main()
{
int A , P , x , pie;
cin>>A;
cin>>P;
x = 3*A;
pie = (x+P)/2;
cout<<pie;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void takahasi(int &x, int &y){
if(x%2 ==1){
x -= 1;
x /= 2;
y += x;
}
else{
x /= 2;
y += x;
}
}
void aoki(int &x, int&y){
if(y%2 ==1){
y -= 1;
y /= 2;
x += y;
}
else{
y /=2;
... | 0 | 54,869,078 |
#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,m;
cin >> n >> m;
vector<int> a(n);
rep(i,n) cin >> a[i];
int s = 0;
rep(i,n) s += a[i];
int cnt = 0;
rep(i,n) {
if(s <= a[i]*(4*m)) cnt++;
}
if... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | 0 | 5,324,927 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int flag = 1;
if (s.size() + 1 == t.size()) {
for (int i = 0; i < s.size(); i++) {
if (s[i] != t[i]) {
flag = 0;
}
}
}
flag == 1 ? cout << "Yes" : cout <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define UNIQUE(v... | 0 | 99,182,259 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i >= 0; i--)
#define be(v) (v).begin(), (v).end()
#define dc... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(void){
ll h, w;
cin >> h >> w;
ll a, b, c;
ll mi = 100000000;
for(int i = 1; i < h ; i++){
a = i * w;
b = ceil((h - i) / 2.0) * w;
c = floor((h - i) / 2.0)... | 0 | 58,461,505 |
#include <iostream>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
long long MOD = 1000000007;
int main(){
long long N;
string S;
cin >> N >> S;
long long cnt[26] = {0};
rep(i, N){
cnt[ S[i]-'a' ]++;
}
long long ans = 1;
rep(i, 26)
ans = ( ans*(cnt[i]+1) )%MOD;
cout << ans-1 << ... | #include <iostream>
#include <vector>
std::vector<int> UFT;
int Find(int a);
void Unite(int a,int b);
int main() {
int N,M;
std::cin >> N >> M;
UFT.resize(N+1,0);
for(int i=0;i<M;i++){
int a,b;
std::cin >> a >> b;
int small,large;
if(a>b){
small = b;
... | 0 | 49,697,149 |
#include<iostream>
using namespace std;
int main(void){
int i,a[3],tmp,b,c;
for(i=0;i<3;i++)cin>>a[i];
for(b=0;b<3;b++){
for(c=b+1;c<3;c++){
if(a[b]>a[c]){
tmp=a[b];
a[b]=a[c];
a[c]=tmp;
}
}
}
cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<endl;
return 0;
} | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define fst first
#define snd se... | 0 | 74,331,942 |
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int n,taro=0,hanako=0;
char t[100],h[100];
string tarostr,hanakostr;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s %s",&t,&h);
tarostr=t;
hanakostr=h... | #include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
struct UnionFind {
vector<ll> par;
vector<ll> vSize;
... | 0 | 10,364,548 |
#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 srep(i,n,s) for(int i = s; i < (n); ++i)
#define rsrep(i,n,s) for(int i = (n)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int t[100010],x[100010],y[100010];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> t[i] >> x[i] >> y[i];
}
bool f = 1;
for (int i = 1; i <= n; i++) {
int tt = t[i] - t[i-1];
int xx = abs(x[i] - x[i-1]);
i... | 0 | 74,960,180 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yay!":":(")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define println(x) cout << x << endl;
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
yorn(a <= 8 && ... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 0 | 36,458,571 |
#include <bits/stdc++.h>
using namespace std;
char g[10][10];
int h,w;
int getbit(int x,int pos){
return (x >> pos) & 1;
}
int fun(int row,int col){
int cnt = 0;
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
if(g[i][j] == '#'){
if(getbit(row,i) == 0 && getbit(col,j) == 0 ... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 70,942,045 |
#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>
... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).... | 0 | 7,078,439 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc135_c.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 93,503,542 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int mod = 1000000007;
int main(void){
int s;
cin >> s;
int dp[2020];
memset(dp, 0, sizeof(dp));
dp[0] = 0;
dp[1] = 0;
dp[2] = 0;
dp[3] = 1;
for(int i = 4; i <= s; i++){
dp[i] = d... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int k;
int x;
int y;
int m;
cin>>n>>k>>x>>y;
if ((n - k) > 0)
{
m = k*x+(n-k)*y;
cout<<m<<endl;
}
else
{
m =n*x;
cout<<m<<endl;
}
return 0;
} | 0 | 37,331,686 |
#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cer... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
pair<int, int> r[n], b[n];
for (int i=0; i<n; i++) cin>>r[i].first>>r[i].second;
for (int i=0; i<n; i++) cin>>b[i].first>>b[i].second;
sort(r, r + n);
sort(b, b + n);
bool used[n];
for (int i=0; i<n; i++) used[i] = false;
int ... | 0 | 20,561,714 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
sort(v.rbegin(), v.rend());
int j = 0;
ll x = 1;
for (int i = 0; i < n; i++) {
if (v[i] == v[i+1]) {
x *= v[i];
j++;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
long long MAX = 1000000000000000000;
int main(){
cout << setprecision(10);
int N;
ll K;
cin >> N >> K;
vector<ll> A(N);
for(int i = 0; i < N; i++){
cin >> A.at(i);
}
vector<l... | 0 | 49,258,211 |
#include<cstdio>
#include<cmath>
int main()
{
long long x,y;
scanf("%lld %lld",&x,&y);
printf(fabs(x-y)<2 ? "Brown" : "Alice");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define FOR(i,a,b) for (int i=(a); i < (b); ++i)
#define FORR(i,a,b) for (int i=(a); i > (b); --i)
#define FOR_ALL(i,c) for (__typeof((c).begin()) i=(c).begin(); \
... | 0 | 69,154,283 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main(void){
for(;;){
int n;
int a[10000]={0};
cin>>n;
if(n==0)break;
long long int sum=0;
long long int ans=-1000000;
for(int i=0;i<n;i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define PI 3.141592653589793
#define MOD 1000000007
#define ALL(obj) (obj).begin(),(obj).end()
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... | 0 | 34,574,683 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 100100100;
int main(void){
int n;
cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
int ans = INF;
rep(i,105) {
int cnt = 0;
rep(j,n) {
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll H,W,D;
cin >> H >> W >> D;
vector<vector<ll> > grid(H, vector<ll>(W));
vector<pair<... | 0 | 18,089,703 |
#include <iostream>
#include <vector>
using namespace std;
vector<string> myhash(10000000);
void set(string& a){
int x = 0;
for(int i=0; i<a.size(); i++){
x *= 11;
x += a[i];
x %= 10000000;
}
while(true){
if(myhash[x].empty()){
myhash[x] = a;
break;
}
else if(myhash[x].compar... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a.at(i);
deque<int> b;
if (n%2 == 0) {
rep(i,n) {
if (i%2 == 0) b.push_b... | 0 | 6,593,471 |
#pragma GCC optimize (3)
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<algorithm>
#include<unordered_map>
#define ll long long... | #include <bits/stdc++.h>
#define MAXN 100001
#define inf 1<<30
using namespace std;
struct node {
int x, dist;
node(int _x, int _dist) {
x = _x;
dist = _dist;
}
};
vector<node> G[MAXN];
int cost[MAXN];
bool viz[MAXN], flag = false;
int N, M;
void dfs(int node) {
int next;
if (flag ==... | 0 | 72,733,146 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k, nn;
cin >> n >> k;
if(k == 1){
cout << 0;
return 0;
}
nn = n;
n -= k;
cout << n;
return 0;
} | #include <iostream>
#include <stack>
#include <algorithm>
#include<string.h>
using namespace std;
typedef pair<int,int>pa;
int ma[42][42];
int main(){
while(true){
int a,b,x,y;
int n;
cin>>a>>b;
if(a==0)break;
cin>>n;
memset(ma,0,sizeof(ma));
while(n--){
... | 0 | 61,934,067 |
#include <iostream>
using namespace std;
void Show_message(char button, int num)
{
switch(button)
{
case '1':
switch(num % 5)
{
case 1:
cout << '.'; break;
case 2:
cout << ','; break;
case 3:
cout << '!'; break;
case 4:
cout << ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define llu long long unsigned int
#define pii pair<int,int>
#define PII pair<ll,ll>
const ll MAX=1e18+100;
const ll sz=1e5+100;
const ll mod=1e9+7;
ll n,tar;
PII dp[sz];
vector<ll> ad[sz];
void DFS(ll p,ll par)
{
dp[p].first=dp[p].second=1ll;
... | 0 | 99,162,044 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=998244353;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return fal... | #include <iostream>
#include <algorithm>
using namespace std;
void SelectSort(int x[], int N);
void BubbleSort(int x[], int N);
void InsertSort(int x[], int N, int num);
void ShellSort(int x[], int N);
void Trace(int x[], int N);
int gCount = 0;
int main() {
int N;
cin >> N;
int x[N];
for (int i = 0; i ... | 0 | 76,104,799 |
#include <stdio.h>
int main()
{
long int n,a,e;
scanf("%ld %ld",&n,&a);
if(n<500 && n>a)
{
printf("No\n");
}
else if(n>=500)
{
e=n%500;
if(e==0 || e<=a)
{
printf("Yes\n");
}
else if(e>a)
{
printf("No\n");
}
}
else if(n<=a)
{
printf("Yes\n");
}
return 0;
} | #include<iostream>
#include<cstring>
using namespace std;
struct Node
{
int data;
Node* next;
Node* prev;
};
class List
{
private:
Node* mother;
public:
List()
{
mother = new Node;
mother->data = -1;
mother->next = this->mother;
mother->prev = this->mother;
}
~List()
{
N... | 0 | 90,731,625 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> plan(n,vector<int>(3));
for (int i = 0; i < n; i++){
for (int j = 0; j < 3; j++){
cin >> plan.at(i).at(j);
}
}
bool ans=true;
int nx=0;
int ny=0;
int nt=0;
for (vector<int> v: plan){
int... | 0 | 32,501,423 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int v,e;cin>>v>>e;
vector<vector<long long>> dist(v,vector<long long>(v,1e12)) ;
for (int i = 0; i < v; i++) {
dist[i][i] = 0;
}
for (int i = 0; i < e; i++) {
int s,t,d;cin>>s>>t>>d;
dist[s][t] = d;
}
for (int mid = 0; mid < v; mid++)
... | #include<iostream>
#include<algorithm>
#define inf 1000000000
using namespace std;
int main(){
while(1){
int n;
int in1[100];
int in2[100];
int in3[100];
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
cin>>in1[i]>>in2[i]>>in3[i];
}
int maxi=0;
for(int i=0;i<n;i++){
maxi=max(maxi,in1[i]);
max... | 0 | 46,819,501 |
#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 <string>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using pint=pair<int,int>;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define el '\n'
#def... | 0 | 92,836,431 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define... | #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();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | 0 | 49,978,974 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s, ans=""; cin>>s;
for (int i=0; i<s.length(); i += 2) ans += s[i];
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
int c=0;
if(s.length()==t.length())
{
for(int i=0;i<s.length();i++)
{
if(s[i]!=t[i])
c++;
}
}
cout<<c;
} | 0 | 48,756,849 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <bitse... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define... | 0 | 1,235,562 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> D(N - 1);
for (int i = 0; i < N - 1; i++){
cin >> D.at(i);
}
int sum = 0;
sum += D.at(0);
for (int i = 1; i < N - 1; i++){
sum += min(D.at(i - 1), D.at(i));
}
sum += D.at(N - 2);
cout << sum << endl;
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
ll combination(ll n, ll r) {
if (n / 2 <= r) {
r = n - r;
}
ll res = 1;
for (ll i = 0; i < r; ++i) {
res *= (n - i);
}
for (ll i = r; i > 0; --i... | 0 | 94,443,577 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#define debug(x) cout<<(#x)<<"="<<(x)<<", ";
#define debug1(x) debug(x) cout<<'\n';
#define debug2(x1... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <queue>
#include <math.h>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using vvll = vector<vll> ;
using vc = vector<char> ;
using vvc = vector<vc> ;
using pll =... | 0 | 72,575,782 |
# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define repp(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#de... | 0 | 11,020,080 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
string s1,s2,s3;
cin>>s1>>s2>>s3;
if(s1[s1.size()-1]==s2[0]&&s2[s2.size()-1]==s3[0])co... | #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <iterator>
#include <numeric>
#include <cstdint>
#include <cmath>
#include <bitset>
#include <string>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define N_... | 0 | 76,058,437 |
#include<bits/stdc++.h>
int N;
int A;
using namespace std;
int main() {
cin >> N >> A;
if (N%500 <= A) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
#include <iterator>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <numeric>
#include <iomanip>
#include <limits>
#include <set>
#include <map>
#include <type_traits>
#include <cstdint>
#include <queue>
#define _USE_MATH_DEFINES
#include <math.h... | 0 | 1,191,900 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | #include<iostream>
#include<bits/stdc++.h>
#include<vector>
using namespace std;
int main()
{
int n,l;
cin>>n;
vector<int>v;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int d=a[0];
int c=0;
for(int i=0;i<n;i++){
if(a[i]<=d){
c++;
v.push_back(a[i]);
d=a[i];
... | 0 | 31,635,087 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.