code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int a,b,c;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
signed main(){
int h,w,n;
cin>>h>>w>>n;
set<pii> pos;
rep(i,n){
int x,y;
c... | 0 | 26,232,523 |
#define _USE_MATH_DEFINES
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <co... | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
rep(i, N) cin >> A[i];
long long ans = 0, digit = 0;
int r... | 0 | 86,841,397 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 500000000
#define IOS ios_base::sync_with_stdio(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) cout<<a[0];for... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
a[i] = min(a[i], k);
}
sort(a.begin(), a.end());
int l = 0,r = n;
while (l < r) {
int mid =... | 0 | 98,217,653 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int a[5];
for(int i = 0;i<5;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+5);
reverse(a,a+5);
for(int i = 0;i < 5;i++)
{
printf("%d",a[i]);
if(i <= 3) printf(" ");
}
printf("\n");
return 0;
} | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
double x1,y1,x2,y2,x3,y3,x4,y4;
int n;
cin >> n;
for(int i=0;i<n;i++){
scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4);
x2-=x1; y2-=y1;
x4-=x3; y4-=y3;
if(x2*y4-y2*x4==0) printf("YES\n");
else printf("NO\n");
}
... | 0 | 99,756,848 |
#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 vector<int> VI;
typedef vector<VI> VVI;
typedef ... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e+9 * 2;
double eps = 1e-10;
int main() {
string s, t(""), ans_c(""), ans_s("");
map<string, int> cnt;
getline(cin, s);
for(int i = 0; i < s.size(); ++i){
if(s[i] == ' '){
cnt[t]++;
if(ans_s.length() < t.length())
ans_s = t;
t = "";
}
... | 0 | 80,972,163 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
string s;
cin>>s;
int ans=0;
for(i=0;i<s.length();){
cerr<<"i:"<<i<<endl;
if((s[i]=='0... | #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>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
string s,t;
cin>>s>>t;
int start;
for(int i=s.s... | 0 | 92,930,324 |
#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 std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update> ordered_set;
typedef tr... | #include<bits/stdc++.h>
#define F first
#define S second
#define REP(i, a, b, c) for(int i = a; i <= b; i+=c)
#define pb push_back
#define int long long int
#define MOD 1000000007
using namespace std;
vector<int> tree[100001];
int dp[100001][2];
int solve(int u, bool constr, int pr)
{
if (dp[u][constr] != -1)
ret... | 0 | 82,021,679 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
int ans = k;
REP(i,n-1) {
ans *= (k-1);
}
cout << ans << endl;
} | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | 0 | 21,456,446 |
#include <bits/stdc++.h>
#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#in... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define pb push_back
const int maxn = 10000;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
const int mod... | 0 | 97,129,356 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
string s;
char b[26]={};
int a[26]={};
int j;
for(int l=0; l<26; l++){
b[l]='a'+l;
}
while(getline(cin, s)){
for(int i=0; i<s.size(); i++){
if(s[i]>='A'&&s[i]<='Z'){
s[i]=s[i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 6,892,048 |
#include <iostream>
#include <string>
using namespace std;
int main() {
char left[15] = {'q', 'a', 'z', 'w', 's', 'x', 'e', 'd', 'c', 'r',
'f', 'v', 't', 'g', 'b'};
char right[11] = {'y', 'h', 'n', 'u', 'j', 'm', 'i', 'k', 'o', 'l', 'p'};
while (true) {
string s;
cin >> s;
if (s[0] == '#') return 0;
in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
cin >> data.at(i).at(j);
}
}
vector<int> row;
vector<int> col;
for (int i = 0; i < H; i++) {
... | 0 | 69,934,193 |
#include<bits/stdc++.h>
using namespace std;
#define N 1111116
#define next nxt
int n,x[N],y[N],next[N],p[N],f[N];
int travel(int x){
int ans=0;
for (int t=p[x];t;t=next[t])
if (y[t]!=f[x])
f[y[t]]=x,ans+=travel(y[t]);
return ans^1;
}
int read(){
int x=0,f=1;char ch=getchar();
for (;!isdigit(ch);ch=getchar()) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007;
int main(){
int A,B;cin>>A>>B;
vector<vector<char>> S(100,vector<char>(100,'.'));
for(int i=50;i<100;i++){
for(int j=0;j<100;j++){
S[i][j]='#';
}
... | 0 | 60,538,377 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100005;
int n,size[N],fa[N];
map<ll,int> mp;
struct node{int id;ll dis;}p[N];
bool cmp(const node &A,const node &B){return A.dis>B.dis;}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%lld",&p[i].dis),p[i].id=i,mp[p[i].dis]=i;... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 78,700,392 |
#define _CRT_SECURE_NO_WARNINGS
#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 <numeric>
#include <ctime>
#include <complex... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
const ll MOD = 998244353;
const ll INF = 1e18;
using namespace std;
main(){
#ifdef XOX
freopen("D:\\V S Code\\cpp\\competitiveProgramming\\Input.txt", "r", stdin);
freopen("D:\\V S Code\\cpp\\competitiveProgramming\\OPT.txt... | 0 | 92,791,361 |
#include <iostream>
#include <vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<map>
#include<math.h>
#include<queue>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int mod = 1000000007;
con... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
Graph G;
vector<int> points;
vector<int> ans;
void dfs(int v, int sum, int p) {
ans[v] = sum + points[v];
for (auto nv : G[v]) {
... | 0 | 14,875,298 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include <iostream>
using namespace std;
int main() {
int height[10];
for (int i = 0; i < 10; i++) {
cin>>height[i];
}
for (int i = 0; i < 10; i++) {
for (int j = i; j < 10; j++) {
int max = height[i];
int c = i;
if (height[j] > max) {
... | 0 | 69,213,029 |
#include<iostream>
using namespace std;
int main(){
while(1){
int n,s,i,j,a,b,c=0;;
cin>>n>>s;
if(n==0&&s==0)break;
for(i=0;i<(1<<10);i++){
a=0;b=0;
for(j=0;j<=9;j++){
if((i>>j)&1!=0){
a+=j;b++;
}
}
if(a==s&&b==n){
c++;
}
}
cout<<c<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int md;
int add(int x, int y) {
x += y;
if (x >= md) {
x -= md;
}
return x;
}
int mul(int x, int y) {
return (int)((long long)x * y % md);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n >> md;
string s;
cin >> s;
map<int,... | 0 | 22,784,785 |
#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 vector<int> VI;
typedef vector<VI> VVI;
typedef ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int main(){
long long N;
cin >> N;
vector<long long> A(N);
for(int i = 0; i< N; i++) cin >> A[i];
map<long long, long long> m;
m[A[0]]++;
m[0]++;
for(int i = 1; i < N; i++){
A[i] += A[... | 0 | 53,195,085 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int MOD=1e9+7;
ll INF=1e18;
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int main(){
int n; cin>>n;
ll sum=0;
for(int i=1; i<=1e7; i++){
sum+=i;
if(n<sum){
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int N;
cin >> N;
vector<int> mon(N + 1);
rep(i, N + 1)
{
cin >> mon[i];
}
ve... | 0 | 95,085,800 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " " << (x + x == w && y + y == h) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 2e9;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, H;
cin >> N >> H;
vector<int> a(N),b(N);
for (int i=0;i<N;i++) cin >> a[i] >> b[i];
sort(a.rbegin(),a.rend());
sort(b.rbegin(),b.rend());
... | 0 | 52,038,837 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intput(i) cout << i << endl
#define ll long long
#define stringput(s) cout << (string)(s) << endl
int main(){
int N;
cin >> N;
if(N < 1200) cout << "ABC" << endl;
else if(1199 < N && N < 2800) cout << "ARC"... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
char buf[2];
scanf("%s",buf);
if(buf[0] == 'a' || buf[0] == 'i' || buf[0] == 'u' || buf... | 0 | 52,221,600 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
char b;
cin >> b;
if (b == 'A') {
cout << "T" << endl;
}
else if (b == 'T') {
cout << "A" << endl;
}
else if (b == 'G') {
cout << "C" << endl;
}
else if (b == 'C') {
... | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <string>
#include <map>
using namespace std;
int ChangeTimesFormat(string str){
int h = atoi(str.substr(0,2).c_str());
int m = atoi(str.substr(3,2).c_str());
int s = atoi(str.substr(6,2).... | 0 | 19,231,464 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define MAXX 500005
#define INF INT_MAX
#define PI 3.14159265358979323846264338327950
#define PB push_back
#define PF push_front
#define F first
#define S second
#define fixx(n) fixed << setprecision(... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int n;
vector<int> a;
void update(int i, int x);
int query... | 0 | 77,057,058 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int dp[1000000];
string S;
int main() {
cin >> S; dp[0] = 1;
for (int i = 0; i < S.size(); i++) {
if (dp[i] == 0)continue;
if (i + 5 <= S.size() && S.substr(i, 5) == "dream")dp[i + 5] = 1;
if (i + 7 <= S.size() && S.su... | #include<iostream>
#include<vector>
#include<utility>
using namespace std;
int main(){
int V, E;
cin >> V >> E;
vector<pair<int, int> > edge(E);
for (int i = 0; i < E; i++) {
cin >> edge[i].first >> edge[i].second;
}
vector<int> ans;
vector<int> state(V, 1);
for (int k = 0; k < V... | 0 | 58,897,190 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define rep1(i,n) for (int i=1; i<=(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define fst first
#define scd second
#define pb push_back
using namespace std;
using ll = long long;
u... | #include <cstdio>
#include <algorithm>
using namespace std;
int a[100009], b[100009];
int main(){
int n, k, mask;
scanf("%d %d",&n, &k);
for(int i = 0; i < n; i++){
scanf("%d %d", a+i, b+i);
}
k++;
long long ans = 0;
for(int bit = 30; bit >= 0; bit--){
if((k >> bit) & 1){... | 0 | 13,010,192 |
#include <iostream>
using namespace std;
int main(){
int money = 100000;
int n;
cin >> n;
while (n--)
{
money *= 1.05;
if (money % 1000 != 0)
{
money += 1000 - (money % 1000);
}
}
cout << money << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int n = 0, v = 0;
int a = 0;
int b = 0;
int c = 0;
int d = 0;
int s[5][4][11] = {0};
cin >> n;
for (int i = 0; i < n; i++){
cin >> a >> b >> c >> d;
s[a][b][c] = s[a][b][c] + d;
}
for (int j = 1; j <= 4; j++){
for (int k = 1; k <= 3; k++){
for (int ... | 0 | 1,531,116 |
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL;
#define pb push_back
#define mp make_pair
#define all(x) ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++){
int x;
cin >> x;
A.at(i) = x - i - 1;
}
sort(A.begin(), A.end());
int b = A.at(N / 2);
int64_t ans = 0;
for (int i = 0; i < N; i++){
... | 0 | 20,762,400 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define vv(T) std::vector<std::vector<T>>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main(void)
{
int n;
cin >> n;
string S;
cin >> S;
int ans =1;
int f = S[0];
for (int i = 0; i < ... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 0 | 78,867,308 |
#include<bits/stdc++.h>
using namespace std ;
#define endl '\n'
string make(string s,int k)
{
string ans="";
for(int i=0;i<k;i++)
ans+=s;
return ans;
}
int32_t main()
{
string s;
cin>>s;
int n=s.size();
if(n==1){
cout<<'0';return 0;
}
string f,se;
if(n&1){
f=make("01",n/2)+"0";
se=mak... | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), cout << fixed << setprecision(20);
#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) rep... | 0 | 57,856,579 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i, n) cin >> a[i];
map<int, int> mp;
mp[0] = 1;
long long ans = 0;
int sum = 0;
rep(i,n) {
(sum += a[i]) %= m;
an... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
bool flag = true;
int n,tong[maxn],maxx,minn;
int main()
{
scanf("%d",&n);
minn = n;
for (int i = 1; i <= n; i++)
{
int x;
scanf("%d",&x);
tong[x]++;
maxx = max(maxx,x);
}
if (tong[maxx] <= 1)
... | 0 | 17,875,179 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
long h, w, k;
cin >> h >> w >> k;
vector<vector<char>> corg(h, vector<char>(w));
for (long i = 0; i ... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 0 | 41,564,623 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typ... | #include <iostream>
using namespace std;
int main() {
string S;
string S_tmp_5 = "";
string S_tmp_6 = "";
string S_tmp_7 = "";
cin >> S;
do {
if (S.size() == 5 || S.size() == 6|| S.size() == 7){
if(S == "dream" || S == "erase" || S == "eraser" || S == "dreamer"){
... | 0 | 73,792,386 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include<iostream>
using namespace std;
int main(){
int A, B,N;
int sum,ans = 0;;
int cur =10;
cin >> N >> A >> B;
for(int i = 1;i <= N;i++){
sum = 0;
cur = i;
while(cur > 0){
sum += cur%10;
cur /= 10;
}
if( A <= sum && sum <= B)
... | 0 | 62,298,148 |
#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>
using namespace std;
#define ll long long
#define PI acos(-1.0)
#defin... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | 0 | 91,431,468 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = (int)1e7 + 7;
ll sum[MAX_N];
bool visit[MAX_N];
int main()
{
memset(sum, 0LL, sizeof(sum));
memset(visit, false, sizeof(visit));
io... | 0 | 85,330,596 |
#pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define REPS(i,n) for (ll i = 1; i<=(ll)(n); i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a... | 0 | 79,352,835 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
long long x, y;
scanf("%lld%lld", &x, &y);
puts(abs(x - y) <= 1 ? "Brown" : "Alice");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int> >, rb_tree_tag,tree_order_statistics_node_update>
#define standardVar ll n,m,k,num,num1,num2,flag=0
#define nn <<"\n"
#define __ <<" "<<
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ff... | 0 | 54,753,440 |
#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>
#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<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | 0 | 20,873,883 |
#include <bits/stdc++.h>
using namespace std;
const int64_t INF=999999999;
int main() {
int A,B;
cin>>A>>B;
if(A<=8&&B<=8){cout<<"Yay!"<<endl;}
else{cout<<":("<<endl;}
return 0;} | #include <iostream>
int main() {
int a;
int x[101];
int y[101];
for (int i = 0; i < 101; i++) {
x[i] = -1;
y[i] = -1;
}
bool bingo[3][3];
for (int j = 0; j < 3; j++) {
for (int i = 0; i < 3; i++) {
std::cin >> a;
x[a] = i;
y[a] = j;... | 0 | 43,705,122 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 1000000007
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,K;
ll x[55];
ll y[55];
int main(){
cin >> n >> K;
vector<ll> dx;
vector<ll> dy;
for(ll i=0;i<n;i++){
cin >> x[i] >> y[i];
dx.push_back(x[i]);
dy.push_back(y[i]);
}
sort(dx.begin(),dx.end());
sort... | 0 | 20,174,079 |
#include <bits/stdc++.h>
using namespace std;
long long n,m,i,j,ans,x,y;
int main(){
cin>>n;
while (n--){
cin>>x>>y;
if (x==1&&y==1){
cout<<"0\n";
continue;
}
if (x==y||abs(x-y)==1){
cout<<(min(x,y)-1)*2<<endl;
continue;
}
ans=((long long)(sqrt(x*y)));
if (ans*ans>=x*y) ans--;
if (ans*(a... | #include <iostream>
#include<array>
using namespace std;
int main() {
int n, k, sum = 0;
cin >> n >> k;
int p[n];
for(int i = 0; i < n; i++) {
cin >> p[i];
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n-1; j++) {
if (p[j] > p[j+1]) {
swap(p[j], p[... | 0 | 65,937,892 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int tc; tc=1;
while(tc--){
int a,b,c; cin>>a>>b>>c;
if(a == b) cout<<c;
if(a == c) cout<<b;
if(b == c) cout<<a;
cout<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#defin... | 0 | 66,104,000 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = min(A, B) + 1;
int cnt = 0;
while (K != 0) {
--i;
if (A % i == 0 && B % i == 0) {
--K;
}
}
cout << i << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
using P = pair<ll,ll>;
const ll dv = 1000000007;
vector<ll> dy = {1,0,-1,0};
vector<ll> dx = {0,1,0,-1};
int main(){
ll h,w;cin >> h >> w;
vector<string> a(h);
rep(i,h) cin >> a.at(i);
vector<vector<ll>> ... | 0 | 15,278,072 |
#include <stdio.h>
int main(){
int a, b;
scanf("%d", &a);
scanf("%d", &b);
int ans=1;
for (int i = 0; i<a; i++){
if(ans<b){
ans= ans*2;
}else{
ans= ans + b;
}
}
printf("%d", ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
bool a=true;
char C='a';
vector<string> W(N);
for(int i=0;i<N;i++){
cin >> W.at(i);
if(i!=0){
if(W.at(i).at(0)!=C){
a=false;
}
}
C=W.at(i).at(W.at(i).size()-1);
}
sort(W.begin(),W.end());
for... | 0 | 43,839,678 |
#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<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
int main() {
int n; cin >> n;
int tmp;
string s;
string ans = "";
vector<vector<int>> v(n,vector<int>(26,0));
... | 0 | 82,241,092 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int abs(int a) {
return a >= 0 ? a : -a;
}
int main() {
int n, z, w;
cin >> n >> z >> w;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 1) {
cout << abs(a[0] - w) << endl;... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 94,879,616 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
ll x, y;
cin >> x >> y;
int ans=0;
while(true){
ans ++;
y /=2;
if(x>y){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
struct edge{ll to,cost;};
const int inf = 1<<28;
const ll INF = 1LL<<53;
const int COMBMAX = 500005;
const ll MOD = 1e9+7;
#define _... | 0 | 12,468,807 |
#include <bits/stdc++.h>
using namespace std;
int cnt[200010];
main(void){
int n,k;cin >> n >> k;
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];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 0 | 7,865,056 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)
#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))
#define disl... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if(a == 1)
a += 13;
if(b == 1)
b += 13;
if(a > b)
cout << "Alice" << e... | 0 | 78,990,357 |
#include<bits/stdc++.h>
#include<cctype>
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 pi 3.1415926535897932384
#define E9 10000... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
int N,K; cin>>N>>K;
vector<int> A(N+1,0);
for(int i=0;i<N;i++){
int a; cin>>a;
A[a]++;
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
int count=0;
int ans=0;
for(int i=0;i<=N;i... | 0 | 85,643,644 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> s = a;
sort(s.rbegin(), s.rend());
rep(i, n) {
int ans = s[0];
if (s[0] == a[i... | #include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair... | 0 | 1,402,772 |
#include <iostream>
#include <cstring>
using namespace std;
int ans = 0, array[100],mini;
void BubbleSort(int A[], int n) {
for (int i = 0; i < n; i++) {
mini=i;
for (int j = i; j < n; j++) {
if (A[j]<A[mini])
mini = j;
}
swap(A[i],A[mini]);
if (i!... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
string s;cin>>s;
int ans=753;
rep(i,s.size()-2){
... | 0 | 50,334,009 |
#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... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int a, b, k;
cin >> a >> ... | 0 | 36,877,898 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char X,Y;
cin >> X >> Y ;
int x=(int)(X-'A'),y=(int)(Y-'A');
if(x>y) cout << '>' << endl;
else if(x<y) cout << '<' << endl;
else cout << '=' << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int64_t i=ini;i<n;i++)
#define _rep(i,ini,n) for(int64_t i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int64_t N,K; cin>>N>>K;
vector<int64_t> A(N);
rep(n,0,N) cin>>A.at(n);
vector<int64_t> L... | 0 | 96,379,291 |
#include <bits/stdc++.h>
#include <cstdlib>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
const int MOD = 1000000007;
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0) res += m;
return res;
}
bool is_prime(long long N) {
if (N == 1) return f... | #include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <cmath>
#include <iostream>
#include <stack>
#include <queue>
#include <climits>
#include <iomanip>
#define all(x) x.begin(), x.end()
#define MOD 1000000007
#define debug(x) ... | 0 | 16,951,556 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
using namespace std;
#define INT(x) int x; scanf("%d",&x)
#define LL(x) ll x; scanf("%lld",&x)
#define INPUT(x) cin >> x
#define REP1(x,n) for(int x = 0; x < n; x++... | 0 | 8,598,970 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int r,g,b,n;
cin >> r >> b >>g >> n;
int x=n/r;
int y=n/b;
ll ans =0;
rep(i,x+1){
rep(j,y+1){
ll m=... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=1000000007;
#define INF (1<<30)
#define LINF (lint)(... | 0 | 13,394,893 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int main()
{
ll n,a[200010],number[200010]={0};
ll sum=0;
cin>>n;
rep(i,n){
cin>>a[i];
sum+=number[a[i]];
number[a[i]]++;
}
rep(i,n)cout<<... | #include <bits/stdc++.h>
using namespace std;
#define times(n, i) uptil(0, n, i)
#define rtimes(n, i) downto((n) - 1, 0, i)
#define upto(f, t, i) for(int i##_to_ = (t), i = (f); i <= i##_to_; i++)
#define uptil(f, t, i) for(int i##_to_ = (t), i = (f); i < i##_to_; i++)
#define downto(f, t, i) for(int i#... | 0 | 49,169,255 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int A[N];
int B[N];
for(int i=0;i<N;i++){
cin>>A[i];
B[i]=A[i];
}
sort(A,A+N);
reverse(A,A+N);
for(int i=0;i<N;i++){
if(B[i]==A[0]){
cout<<A[1]<<endl;
}else{
cout<<A[0]<<endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
long h, w, k;
cin >> h >> w >> k;
vector<vector<char>> corg(h, vector<char>(w));
for (long i = 0; i ... | 0 | 47,433,508 |
#include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <tuple>
using namespace std;
int strtotime(string str){
int hour = stoi(str.substr(0,2));
int minute = stoi(str.substr(3,2));
int second = stoi(str.substr(6,2... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
using namespace std;
typede... | 0 | 49,844,262 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fo(i,s,e) for( i=s;i<e;i++)
#define rfo(i,s,e) for(i=s;i>e;i--)
#define LL long long int
const LL MOD=2019;
#define pb push_back
#define pob pop_back()
#define sp " "
#define ff first
#define ss second
LL l,r;
bool check(LL i){
LL x=l/2019;
x*... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | 0 | 94,564,169 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int kotae=0;
int ichi=0;
int zero=0;
int n=s.size();
for(int i=0;i<n;i++){
if(s[i]=='0')zero++;
else ichi++;
}
kotae=min(ichi,zero)*2;
cout<<kotae<<endl;
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <cmath>
#include <iostream>
#include <string>
#include <set>
#include <map>
#define SIZE 100005
using namespace std;
typedef long long int ll;
typedef pair <int, int> P;
int A[SIZE], B[SIZE];
int mai... | 0 | 11,950,762 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <queue>
#include <cmath>
#include <stack>
#define int64 long long int
using namespace std;
int main()
{
int i, n;
priority_queue<int> qu;
for(i=0; i<5; i++) {
cin >> n;
qu.push(n);
}
for(i=0; i<5; i++) {
cout << qu.top();
... | #include<bits/stdc++.h>
#define ll long long int
#define lld long double
#define pb push_back
#define pii pair<ll,ll>
#define mi map<ll,ll>
#define vec vector<ll>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define mod... | 0 | 25,990,486 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
getline(cin, s);
for (size_t i = 0; i < s.size(); ++i) {
const char c = s[i];
if (c >= 'a' && c <= 'z') {
printf("%c", c - 0x20);
} else if (c >= 'A' && c <= 'Z') {
printf("%c", c + 0x20);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | 0 | 27,188,142 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#de... | #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> pint;
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
int main() {
int n, m; cin >> n >> m;
vector<int> a(m); rep(i, m) cin >> a[i];
... | 0 | 64,166,476 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e3;
const long long MOD = (long long)1e9 + 7;
int data[N+5];
int datb[N+5];
long long dp[N+5][N+5];
int main() {
for (int i=0; i<N+3; i++) {
for (int j=0; j<N+3; j++) {
dp[i][j] = 1;
}
}
int n,m; scanf("%d %d", &n,... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int MAX =200005;
const int MOD =1000000007;
signed main(){
int... | 0 | 92,277,978 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
if (n % k == 0)
{
std::cout << 0 << endl;
return 0;
}
std::cout << 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define sz(a) int(a.size())
#define ll long long int
#define mod (long long)(1e9+7)
#define endl '\n'
#define ENGZ ios::sync_with_stdio(0);ios_base::sync_with_stdio(0);cin.tie(0) , cout.tie(0) ;
#define pi (acos(-1))
#define F first
#define S second
ll fp(ll n , ll p )
{
... | 0 | 51,432,875 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
float total = 0;
cin >>N;
for(int i=0;i<N;i++){
float x_i;
string u_i;
cin >> x_i >> u_i;
if(u_i == "JPY"){
total += x_i;
}
else{
total += (x_i * 380000.0);
... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <set>
#include <algorithm>
#define FOREVER for (;;)
#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 log(exp) \
printf(#exp" = %d\n", exp)
#define INF 100000000
using namespace std;
const ... | 0 | 93,167,107 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main()
{
int N, K, S;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e4 + 5;
const int maxm = 5e5 + 5;
const ll inf = 2147483647;
int n, m, k;
int a[101], b[101];
int main(){
int n;
cin>>n;
for(int i = 0; i < n; i++)cin>>a[i];
for(int i = 1; i < n; i++){
b[i] = a[i] - a[i - 1];
... | 0 | 922,494 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll a[4];
int main() {
for (int i=0; i<6; i++) {
int t; cin >> t; a[t-1]++;
} sort(a,a+4);
for (int i=0; i<4; i++) {
if ((i==2 || i==3) && a[i]>=2) continue;
if ((i==0 || i==1) && a[i]>=1) continue;
cout << "NO"; ret... | #include<bits/stdc++.h>
using namespace std;
int main() {
int N, P; cin >> N >> P;
long long A[N];
long long odd = 0, even = 0;
for (int i = 0; i < N; i++)
{
cin >> A[i];
if(A[i] % 2 == 1) odd++;
}
long long ans = 0;
if(odd == 0){
if(P == 0) ans = 1LL<<N;
... | 0 | 63,048,420 |
#include<bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef unsigned long long ull;
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 < ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1000000007;
int gcd(int a, int b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll... | 0 | 85,522,680 |
#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);
A.at(i)--;
}
int cnt = 0, temp = 0;
for(;;){
if(temp == 1){
cout << cnt << endl;
break;
}
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 45,821,592 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e7 + 1;
int n, m, k;
long long int cs[N];
int main(){
int n;
cin >> n;
long long int sum = 0;
for(int i = 1; i <= n; i++){
for(int j = i; j <= n ; j += i)
cs[j]++;
sum += 1LL * i * cs[i];
}
cout << sum << en... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,a;
cin>>n;
cin>>a;
if((n%500)>a){
cout<<"No";
}
else{
cout<<"Yes";
}
return 0;
} | 0 | 69,585,287 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define _FILE(s) freopen(#s".in", "r", stdin); freopen(#s".out", "w", stdout)
#define gi get_int()
int get_int()
{
int x = 0, y = 1; char ch = getchar();
while (!isdigit(ch) && ch != '-') ch = getchar();
if (ch == '-') y = -1, ch = getchar... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define mii map<int, int>
#define pii pair<int, int>
#define pq priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
... | 0 | 21,865,670 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
while(k>0){
vector<int> i... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) st... | 0 | 13,905,538 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const ll mod = 1000000007;
const ll INF = 1e+14;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
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... | 0 | 86,505,741 |
#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
int minSequenceSize(string x, string y)
{
int x_len = x.size();
int y_len = y.size();
int map[x_len][y_len] = {};
for (int i = 0; i < x_len; i++)
{
for (int j = 0; j < y_len; j++)
{
if (i == 0)
... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<set>
#include<ctime>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
inline void write(int a){
if(a>=10)write(a/10);
putchar('0'+a%10);
}
inline void writeln(int a){
write(a); puts("");
}
inline int read()
{
i... | 0 | 56,726,804 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
vector<ll>vec(3);
ll a=0;
for(ll i=0;i<3;i++){
cin>>vec.at(i);
a+=vec.at(i);
}
sort(vec.begin(),vec.end());
cout<<a-vec.at(2)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#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 vvi vector<vi>
#define all(x) x.begin(), x.end()
#de... | 0 | 62,507,698 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#def... | #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 | 12,240,642 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<iomanip>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
using namespace std;
int main()
{
int N, K; cin >> N >> K;
int tmp, cnt;
long double ans=0.0, t;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
#define pb push_back
#define ppp pop_back
#define pii pair<int,int>
#define fi first
#define se second
#define stie std::tie
#define vec vector
#define forn(i, l, r) for (int i=l; i<=r; i++)
#define emp empty... | 0 | 59,225,064 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;cin>>N;
vector<int>V(N+1);
for(int X=1;X<=N;X++){
cin>>V[X];
}
int I=0;
for(int X=1;X<=N;X++){
if(V[X]>V[X-1]){
I+=V[X]-V[X-1];
}
}
cout<<I<<endl;
} | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int main(){
int meter[10];
int a,i,j,temp;
char str[1024];
for(i = 0;i < 10;i++){
scanf("%d",&a);
meter[i] = a;
}
for (i = 0; i < 10; i++) {
for (j = 9; j > i; j--) {
if (meter[j - 1] < meter[j]) {
... | 0 | 15,971,516 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | 0 | 22,919,531 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int mod = 1000000007;
void solve();
int main(void){
int K; cin >> K;
ll A[K]; rep(i, K) cin >> A[i];
ll ulim = 2, dlim = 2;
for(int i = K-1; i >= 1; i--){
ulim = (ulim - (ulim % A[i]... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<int>> g(n,vector<int>());
for (int i = 0; i < n; i++)
{
int u,k;
cin >> u >> k;
for (int j = 0; j < k; j++)
{
int v;
cin >> v;
v--;
g[i].push_back(v);
}
}
vector<int> dist(n... | 0 | 69,856,073 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,l[52],i,j,sum=0;
cin>>n>>k;
for(i=0;i<n;i++){
cin>>l[i];
}
sort(l,l+n);
for(j=n-1;j>=n-k;j--){
sum+=l[j];
}
cout<<sum;
return 0;
} | #include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <c... | 0 | 62,606,203 |
#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<ll,ll>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | 0 | 38,977,091 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
int n, i, A, B, mid, mid2;
vector<int> data;
pair<int, int> best;
int main()
{
scanf("%d", &n);
data.resize(n);
... | #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... | 0 | 83,578,486 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
cout << (s < t ? "Yes" : "No") << endl;
return 0;
} | #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... | 0 | 87,222,464 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#defin... | 0 | 16,829,309 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD =1000000007;
ll modPow(ll a, ll n) {
if (n == 0) return 1;
if (n == 1) return a % MOD;
if (n % 2 == 1) return (a * modPow(a, n - 1)) % MOD;
ll t = modPow(... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>... | 0 | 50,757,177 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s,left,right;
int n,m;
while(1){
cin>>s;
if(s=="-")break;
cin>>n;
for(int i=0;i<n;i++){
cin>>m;
left=s.substr(0,m);
right=s.substr(m,s.length());
s=right+left;
}
cout<<s<<endl;
}
return... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(2);
int k;
cin >> a[0] >> a[1] >> k;
int times = 0;
int side = 0;
while(1){
if(a[side] % 2 == 1) a[side] -= 1;
a[side] /= 2;
a[(side+1)%2] += a[side];
side += 1;
side %= 2;
tim... | 0 | 38,033,175 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
int n,t,i,j;
string s;
int c[26],m[26];
cin >> n;
fill(m,m+26,50);
for(i=0;i<n;i++){
cin >> s;
fill(c,c+26,0);
for(j=0;j<s.size();j++)
c[(int)(s[j]-'a')]++;
for(j=0;j<26;j++)
m[j]=min(m[j],c... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <functional>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#define nmax_def 110000
#define Cmax_def 2200
#define mod 1000000007
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Inf 1000000000000... | 0 | 17,831,902 |
#include <iostream>
using namespace std;
const int nmax=100005;
long long sum,a[nmax],d[nmax];
int n,i;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
sum+=a[i];
}
if(sum%(1LL*n*(n+1)/2))
{
cout<<"NO";
return 0;
}
long long k=(sum/((1LL*n*(n+1)/2)));
... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace ... | 0 | 45,256,794 |
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
int a,b;
int main()
{while(1){
cin>>a>>b;
if(!a&&!b) return 0;
cout<<min(a,b)<<' '<<max(a,b)<<endl;
}} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | 0 | 84,958,510 |
#include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define all(v) v.begin(),v.end()
#define pb push_back
#define endl '\n'
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vl... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 56,452,689 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | #include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 2000005 ;
int pre[maxn];
int dis[maxn];
int Find(int x)
{
if(pre[x]==x)
return x;
int r=Find(pre[x]);
dis[x]=dis[pre[x]]+dis[x];
return pre[x]=r;
}
int Union(int x, int y, int z)
{
int fx = Find(x);
int fy = ... | 0 | 9,523,303 |
#include<iostream>
#include<string>
#include<vector>
#include<iterator>
using namespace std;
int main()
{
int n,ta=0,ha=0;
string a,b;
cin >> n;
vector<string> taro;
vector<string> hana;
for(int i=0;i<n;i++){
cin >> a >> b;
taro.push_back(a);
hana.push_back(b);
for(int j=0;j<10000;j++){
... | #include <bits/stdc++.h>
#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 repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 99,270,976 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
ll mod_pow(ll x, ll n){
ll ans=1;
x%=MOD;
while(n!=0){
if(n&1) ans=ans*x%MOD;
x=x*x%MOD;
n=n>>1;
}
return ans%MOD;
}
int main(){
int N,K; cin >> N >> K;
ll ans=0;
map<int,ll> m... | 0 | 41,041,167 |
#include <iostream>
using namespace std;
int n,banyak[100010],total,maks=0,a;
int main() {
cin>>n;
for(int i=1;i<=n;i++) {
cin>>a;
banyak[a]++;
}
for(int i=1;i<=100000;i++) {
total=banyak[i]+banyak[i+1]+banyak[i-1];
if(maks<total) {
maks=total;
}
}
cout<<maks<<endl;
} | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
string ans = "Yes";
int h, w;
cin >> h >> w;
vector<string> S(h);
for (int i = 0; i < h; ++i)
{
cin >> S[i];
}
int dx[... | 0 | 19,912,040 |
#include <iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if ((a < b) && (b < c)) {
cout << "Yes\n";
} else{
cout << "No\n";
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
#define M 16777216
#define L 14
int H[M][L] = { 0 };
int getChar(char ch) {
if (ch == 'A') return 0;
else if (ch == 'C') return 1;
else if (ch == 'G') return 2;
else if (ch == 'T') return 3;
}
long long getKey(string str) {
long long sum = 0, p = 1, i;
f... | 0 | 91,684,230 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<P> d;
rep(i, n) {
int a, b;
cin >> a >> b;
d.push_back({a, b});
}
sort(d.begin(), d.end());
ll ans = 0... | #include<bits/stdc++.h>
using namespace std;
int main(){
int m, k;
cin >> m >> k;
int power = 1;
for(int i = 1; i <= m; i++){
power = power * 2;
}
if(k >= power){
cout << "-1";
return 0;
}
if(m == 1 && k == 1){
cout << "-1";
return 0;
}
if(... | 0 | 96,716,878 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.