code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
long H,W,M;
cin>>H>>W>>M;
vector<long>K(M);
vector<long>O(M);
long h=H+1;
long w=W+1;
int m=max(h,w);
vector<long>A(m,0);
vector<long>B(m,0);
vector<long>a(m,0);
vector<long>b(m,0);
vector<long>D(m,0);
vector<long>d(m,0);
for(long i=... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... | 0 | 94,969,579 |
#include<bits/stdc++.h>
using namespace std ;
int main() {
long long N , A ,B ;
cin >> N >> A >> B ;
long long i = N % (A+B);
long long j = N/(A+B) ;
if(i <= A ){
j = j*A + i ;
}
else {
j = j*A + A ;
}
cout << j << endl ;
} | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <list>
#include <map>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <bitset>
#include <utility>
#include <complex>
#include <assert.h>
#include <limits... | 0 | 47,885,219 |
#include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typ... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 13,303,283 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
string A ,B ;
cin >> A >> B ;
if(A.size() > B.size()){
cout << "GREATER" << endl ;
}
else if (A.size() < B.size()){
cout << "LESS" << endl;
}
else{
for(int i = 0 ; i < A.size() ; i++){
if(A.at(i) > B.at(i)){
cout << "GR... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int mod = 2019;
int main() {
ll l, r;
cin >> l >> r;
ll ans = mod;
if (r-l+1<mod) {
for (ll i = l; i <= r-1; i++) for (ll j = i+1; j <= r; j++) {
... | 0 | 85,425,614 |
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2,tune=native")
#include <x86intrin.h>
#include <bits/stdc++.h>
using namespace std;
vector<int> l;
int N, A, B, C;
const int INF = 1000000007;
int dfs (int index, int a, int b, int c) {
if (index == N)
return (a && b && c) ? abs(a - A) + abs(b - B) + abs(c - ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
ll l=1000000007;
string alphabet="abcdefghijklmnopqrstuvwxyz";
int main() {
string s; cin>>s;
if(s.size()!=26){
cout<<s;
rep(i,26){
if(count(s.begin(),s.en... | 0 | 46,028,480 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
const int INF=1001001001;
int main() {
string S;
int64_t K;
cin>>S>>K;
int N=S.size();
auto ans= [&](string T){
int64_t cnt=1,ans=0;
int n=T.size();
for(int i=0;i<n;i++){
if(T[i]==T[i+1]){cnt++;}
if(i==n... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN... | 0 | 17,007,298 |
#include<cstdio>
#include<string>
#include<queue>
using namespace std;
int main(){
priority_queue<int> p;
int x;
char com[20];
while(1){
scanf("%s", com);
if(com[2]=='s'){
scanf("%d", &x);
p.push(x);
}
else if(com[2]=='t'){
printf("%d\n",p.top());
p.pop();
}
else ... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
struct Graph{
Graph(int n):E(n),d(n){}
vector<vector<P>>E;
vector<int>d;
void add_edge(int a,int b,int c){
E[a].push_back({b,c});
}
void dijkstra(int s){
priority_queue<P,vector<P>,greater<P>>q;
fill(d.begin(),d.end(),1e9);
... | 0 | 25,636,624 |
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << ": " << x << endl
typedef long long ll;
const int M = 1e9 + 7;
const int INF = 1e9;
typedef pair<int, int> P;
bool comPair(const P &firstElof, const P &secondElof) {
return firstElof.first < secondElof.first;
}
int dx[4] = {1, 0, -1, 0};
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#pragma region Deb... | 0 | 38,687,389 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265
#define int long long
const int MAXN = 2e5 + 1;
const int MOD = 1e9 + 7;
int fak[MAXN], inv[MAXN];
int binpow (int a, int n) {
int res = 1;
while (n) {
if (n & 1)
res *= a;
a *= a;
n >>= 1;
}
return res;
}
int C(int k, int n){
return fak[... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loop(i,a,b) for(i=a;i<b;i++)
#define rloop(i,a,b) for(i=a;i>=b;i--)
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
const int inf=1000000001;
const ll INF=... | 0 | 45,264,969 |
#include<bits/stdc++.h>
#define lld long long int
#define pb push_back
#define in insert
#define mod 1000000007
#define pi 3.14159265358979
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin>>s;
lld len=s.size();
char t[len],u[len];
for(lld i=0;i<le... | #include <bits/stdc++.h>
using namespace std;
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL);
#define Fix( x ) setprecision( x ) << fixed
#define mem( a , x ) memset( a , x , sizeof( a ) )
#define bug( a , b ) cerr<< #a <<" = "<<a<<" , "<< #b <<" = "<<b<<"\n";
#define pb push_back
#define mp make_pair
... | 0 | 43,550,154 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
int S = s.length();
vector<int> num(S + 1);
s = '>' + s + "<";
rep(k, 2) {
rep(i, S) {
if (s.substr(i, 2) == "><") {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define inf 1000000100
int main()
{
int n;
cin >> n;
map<char ,int> mp;
while(n--)
{
string str;
cin >> str;
vi alpha(26);
for(int i = 0; str[i]; i++)
... | 0 | 485,710 |
#include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; ret... | 0 | 40,159,378 |
#include <iostream>
using namespace std;
int main(){
int n,k;string s;cin>>n>>s>>k;k--;
for(int i = 0; n > i; i++){
if(s[k] != s[i]){
s[i] = '*';
}
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9 + 7;
using Graph = V<V<int>>;
Graph g;
V<bool> seen;
int n, m;
int ans = 0, cnt = 0;
void dfs(int v) {
seen[v] = true;
cnt++;
if(c... | 0 | 41,643,577 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string S; cin >> S;
reverse(S.begin(), S.end());
long long pos = 0;
while (pos < S.size()) {
if (pos < S.size() - 4 && S.at(pos) == 'm' && S.at(pos + 1) == 'a' && S.at(pos + 2) == 'e' && S.at(pos + 3) == 'r' && S.at(pos + 4) == 'd') {
pos += 5;
}
e... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
using... | 0 | 49,515,635 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
double total = 0;
while(n--){
double x; string s;
cin >> x >> s;
if(s=="JPY") total += x;
else total += 380000.0*x;
}
cout << fixed << setprecision(5) << total;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin>>n;
string s;
std::deque<string> deq(n,"00000000000000000000000000");
std::map<string, long long int> map;
for (int i=0;i<n;i++) {
cin>>s;
for (int j=0;j<s.size();j++) {
string tmp=deq[i];
... | 0 | 98,147,957 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
int X=S.size();
vector<char>A((X-1)/2);
vector<char>B((X-1)/2);
for(int i=0; i<(X-1)/2; i++){
A.at(i)=S.at(i);
}
for(int i=0; i<(X-1)/2; i++){
B.at(i)=S.at(i+(X+1)/2);
}
bool a=true;
for(int i=0; i<(X-1)/2; i++){
if(A.at(i)!=B.at(i)... | #include<bits/stdc++.h>
#include<algorithm>
#include<string>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using namespace std;
#define FASTER ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#defi... | 0 | 76,725,554 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespac... | #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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
typedef long double ld;
#define int long long
typedef pa... | 0 | 35,860,206 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int inf = 1e9;
const ll linf = 1e18;
class UnionFind
{
protected:
vector<int> par;
vector<int> rank;
vector<int> sz;
int _count;
public:
UnionFind(int n) : par(n), rank(n, 0), sz(n, 1), _count(n) {
iota(par.begin(), pa... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
int frag;
cin >> S;
for (char c = 'a'; c != '{'; c = (char)(c + 1)){
frag = 0;
for (int i = 0; i < S.size(); i++){
if(S.at(i) == c){
frag = 1;
}
}
if(frag == 0){
cout << c << endl;
return 0;
}... | 0 | 43,400,843 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <deque>
#include <numeric>
#include <utility>
#define sign(a) ((a>0)-(a<0))
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define LL long long
#define INF (LL)(1LL<<60)
#define all(a) a.begin(), a.end()
#define gr greater<LL>()
using namespa... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <ctime>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | 0 | 95,605,746 |
#include<bits/stdc++.h>
using namespace std;
int main() {
cout.tie(0)->sync_with_stdio(0);
int a, b, c;
cin >> a >> b >> c;
cout << min({a + b, b + c, a + c}) << '\n';
} | #include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.... | 0 | 31,570,754 |
#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;
const int N = 1e5 +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N,M;
cin >> N >> M;
vector<int>A(N);
priority_queue<int,vector<int>,less<int>> que;
for(int i = 0; i < N; i++) {
cin >> A[i];
que.push(A[i]);
}
while(M != 0) {
M--;
int X =... | 0 | 62,675,137 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define rep(x,y,z) for(int x=y;x<z;x++)
#def... | 0 | 55,131,000 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i<n;i++)
#define vv(Type, n,m,d)vector<vector<Type>> vv(n, vector<Type>(m, d));
using namespace std;
using ll = long long;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
char c;
cin >> c;
c = c + 1;
cout << c << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
... | 0 | 36,333,709 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s;
cin>>s;
int c0 = 0, c1 = 0;
for(int i=0; i<s.size(); i++){
if(s[i]=='0'){
c0++;
}else if(s[i]=='1'){
c1++;
}
}
cout<<min(c0,c1)*2<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
class Osa_k {
private:
int n;
vector<int> factor;
void dfs(int val, int idx ,vector<int>& ans, map<int,int>& mp,const vector<int> &facts) {
if(idx == (int)facts.size()) {
ans.push_back(val);
return;
}
int v = facts[idx];
for(int i = 0; ... | 0 | 68,486,302 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
char s[11];
cin >> s;
char t[11]; int j = 0;
for (int i = 0; i < 11; i++) {
if(s[i] == 'B') {
if (j > 0)
t[--j] = ' ';
else
;
} else {
t[j++] = s[i];
}
}
cout << t << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i < n; i++)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll INF = 1e18;
int main(){
int N;
cin >> N;
do... | 0 | 94,512,725 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using si = set<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
#define fastio ios::sync_with_stdio(0); cin.tie(0)
#define rep(i, n) for (int i = 0; i < n; i++)
#define dotc() int tcs; if (c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m1(x) memset(x,-1,sizeof(x))
const ll INF = 1e18 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main(){
... | 0 | 63,971,295 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (... | 0 | 52,552,929 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b, c;
cin >> a >> b >> c;
cout << (((a <= c) && (c <= b)) ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n, vector<int> (m, 0));
for (int i = 0; i < n; ++i) {
cin >> c[i];
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
}
... | 0 | 82,531,257 |
#include <bits/stdc++.h>
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];
long long sum = accumulate(A.begin(), A.end(), 0LL);
if(sum % (N * (N + 1) / 2LL)) {
cout << "NO" << endl;
return 0;
}
long long k... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
int64_t mod = 998244353 ;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
return a ;
}
}
vector<int... | 0 | 49,250,718 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
int main() {
int a,b,c,d,x;
double da,db;
string s,ss,sss;
int ans = 0;
string anss = "";
cin >> a >> b >> c >>... | #include<stdio.h>
#include<list>
int main(){
using namespace std;
int i;
char str[102];
list<char> ls;
do{
fgets(str,102,stdin);
if(str[0]=='.') break;
ls.clear();
for(i=0;str[i]!='.';i++){
switch(str[i]){
case '(':
ls.push_front('(');
break;
case ')':
if(ls.front()!='('){... | 0 | 54,832,183 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++ )
#define repf(i,m,n) for(int (i)=m;(i)<n;(i)++)
#define all(v) (v).begin(), (v).end()
#de... | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
string s;
int main() {
cin >> s;
string t;
for (int i = 0; i < s.length(); i++) {
if (s[i] != 'x') {
t.push_back(s[i]);
}
}
int m = t.length();
for (int i = 0; i < m - i - 1; i++) {
if (t[i]... | 0 | 83,775,167 |
#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(){
int N;cin>>N;
vector<double>a(N);
ll sum=0;
ll sek... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
int a,b,c,n;
int ans = 0;
while(cin>>n){
ans = 0;
for(a=0;a<=9;a++){
for(b=0;b<=9;b++){
for(c=0;c<=9;c++){
if(n-(a+b+c) <= 9 && n-(a+b+c)>=0)
ans++;
... | 0 | 62,488,956 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int n, x;
while(cin >> n >> x){
int count = 0;
if(n == 0 && x == 0) return 0;
for(int i=1; i<=n; i++){
for(int j=2; j<=n; j++){
for(int k=3; k<=n; k++){
if(i == j ||... | 0 | 21,546,729 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=9982... | #include<iostream>
using namespace std;
int main() {
int x, y, z, count = 0;
while( cin >> x >> y >> z ) {
for(int i=x;x<=y;x++)
if(z % x == 0)
count++;
cout << count << "\n";
count = 0;
}
return 0;
} | 0 | 45,088,619 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <queue>
#include <queue>
#include <thread>
#include<bits/extc++.h>
using namespace __gnu_pbds;
#pragma GCC optimize("Ofast")
#define... | #include <bits/stdc++.h>
using namespace std;
int h,w,m;
int a,b;
map<pair<int,int> ,bool> mp;
int x[300010],y[300010];
vector<int> v;
vector<int> t;
int mx=0,mx2=0;
int main(){
cin>>h>>w>>m;
for(int i=0;i<m;i++){
cin>>a>>b;
x[a]++;
y[b]++;
mp[make_pair(a,b)]=1;
mx=max(mx,x[a]);
mx2=max(mx2,y[b]);
}
for... | 0 | 88,427,542 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPD(i,n) for(int i=(n)-1;i>=0;--i)
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 70,097,568 |
#include<iostream>
using namespace std;
int main()
{
long long n,a,b,i,s=0;
cin>>n;
cin>>a>>b;
for(i=a;i<=b;i++)
{
if(i%n==0)
{
s++;
break;
}
}
if(s==0)
{
cout<<"NG"<<endl;
}
else
{
cout<<"OK"<<endl;
}
re... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | 0 | 5,972,487 |
#include<iostream>
#include<iomanip>
#include<string>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
int H, W;
int table[20][20];
int cnt;
void calc(int current_y, int current_x) {
table[current_y][current_x] = 3;
if(current_y > 0 && table[current_y-1][current_x] == 1)
calc(current_y-1, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define endl '\n'
#define all(a, n) for (int i = 0; i < n; i++) cout << a[i] << " "; cout << endl;
#define IOS ios_base::sync_with_stdio(... | 0 | 2,212,021 |
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
int main() {
int n; scanf("%d", &n);
std::vector<int> a(n), vec(n + 1, 0);
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
vec[a[i]]++;
}
sort(begin(a), end(a));
b... | #include <iostream>
#include <string>
using namespace std;
int main() {
char d[5] = { '.', ',', '!', '?', ' ' };
int m[10] = { 5, 3, 3, 3, 3, 3, 4, 3, 4 };
int h[10] = { 0, 0, 3, 6, 9, 12, 15, 19, 22 };
long long int n;
cin >> n;
for ( long long int i = 0; i < n; i++ ) {
string in;
cin >> in;
... | 0 | 5,760,905 |
#include<bits/stdc++.h>
#include<vector>
#define inf 1000000
#define ll unsigned long long
#define boostUP ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define fsr(i,n) for(ll i=0;i<n;i++)
#define fcr(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define sz(arr) sizeof(arr)/sizeof(arr[0])
using namespace std;... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<vector<int>> graph(N + 1);
vector<bool> discovered(N + 1, false);
vector<int> sign(N + 1);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
graph[a].push_back(b);
... | 0 | 83,086,619 |
#include<cstdio>
int main(){
int a,b,c;
int cnt=0;
scanf("%d %d %d", &a, &b, &c);
for(int i=a; i<=b; i++){
if(c%i == 0) cnt++;
}
printf("%d\n", cnt);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
return v... | 0 | 89,673,891 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define FOR(i,l,r) for( li i = l-(l>r); i != r-(l>r); i += 1-2*(l>r) )
int main() {
li m,k; cin>>m>>k;
li u = (1ll<<m)-1;
if( k > u || ( k == 1 && m <= 1 ) ) {
cout<<"-1\n";
return 0;
}
if( k == 0 ) {
FOR(... | 0 | 46,009,132 |
#include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(),in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main(){
string s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
... | 0 | 44,075,893 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int A, B, a, b;
cin >> A >> B >> a >> b;
cout << a-(b-B) << endl;
cout << b+(a-A) << endl;
cout << a-(b-B)-(a-A) << e... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H;... | 0 | 47,123,189 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i<n;++i)
using ll = long long;
using P = pair<int,int>;
int main(){
vector<int> A(4);
rep(i,4) cin >> A[i];
sort(A.begin(),A.end());
if(A[0] == 1 && A[1] == 4 && A[2] == 7 && A[3] == 9){
puts("YES");
}
else puts("NO");
retur... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
vector<string> ans(2 * H);
for (int i = 0; i < H; i++)
{
string r;
cin >> r;
ans[2 * i] = r;
ans[2 * i + 1] = r;
}
for (int i = 0; i < ans.size(); i++)
cout << ans[i] <... | 0 | 21,631,620 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double rating_from,rating_to;
int performance;
cin >> rating_from >> rating_to;
performance = rating_to * 2 - rating_from;
cout << performance << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string s, t;
cin >> s >> t;
int res = 10000000;
for (int i = 0; i < N; i++){
bool flag = false;
for (int j = 0; j < N; j++){
if (i + j >= N){
res = min(i + N, res);
break;
}
if ... | 0 | 2,539,135 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
bool a,b,c;
a = false;
b = false;
c = false;
for (int i=0;i<s.length();i++){
if (s[i] == 'a') a =true;
if (s[i] == 'b') b =true;
if (s[i] == 'c') c =true;
}
if (a && b && c) cout << "Yes" << endl;
else cout << "... | #include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
vector<vector<int>>v;
vector<int> temp;
int n, m, k[12], p[12], s[12][12], ans = 0;
void solve(int idx){
if(idx >= n){
v.push_back(temp);
return;
... | 0 | 92,927,990 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define rep(x, a, b) for(int x = (a); x <= (b); ++x)
#define rop(x, a, b) for(int x = (a); x < (b); ++x)
#define per(x, a, b) for(int x = (a); x >= (b); --x)
using namespace std;
typedef long long LL;
typedef double DB;
int n... | 0 | 99,056,112 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;
cin >> N;
A=N/4,B=N/7;
bool a=false;
for(int i=0;i<A+1;i++){
for(int j=0;j<A+1;j++){
if(4*i+7*j==N){
a=true;
break;
}
}
}
if(a){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int H[n+1];
for(int i=0;i<n;i++)cin>>H[i+1];
for(int j=1;j<n+1;j++){
cout<<"node "<<j<<": key = "<<H[j]<<", ";
if(j/2 > 0){
cout<<"parent key = "<<H[j/2]<<", ";
}
if(2*j < n+1){
cout... | 0 | 40,701,803 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e5 + 5;
#define INF 1000000000
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | 0 | 21,877,912 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> v1(n);
vector<bool> ok(n,true);
int mx = 0;
REP(i,n){... | #include <iostream>
constexpr long long MOD = 1'000'000'007;
long long comb(long long n, long long r) {
if (n <= 0 || r < 0) return 0LL;
if (n < r) return 0LL;
r = std::min(r, n - r);
if (r == 0LL) return 1LL;
if (r == 1LL) return n;
int inverse[r + 1];
for (long long i = 1LL; i <= r; ++i) {... | 0 | 86,177,235 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin >> n;
cin >> s;
if(n%2 != 0){
cout << "No" << endl;
return 0;
}
for(int i=0; i<s.size()/2; i++){
if(s.at(i) != s.at(i+s.size()/2)){
cout << "No" << endl;
return 0;
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vec... | 0 | 92,134,843 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main(){
int n, p;
cin >> n >> p;
int one = 0;
rep(i,n) {
int a;
cin >> a;
if(a%2) one++;
}
if(one==0) ... | #include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
void one_case() {
int n, k;
cin >> n >> k;
map<int, int> mp;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
++mp[a];
}
vector<p... | 0 | 99,603,746 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <string>
#include <sstream>
#include <stack>
#include <iomanip>
#include <numeric>
#include <queue>
#include <climits>
#include <bitset>
#include <set>
#include <complex>
#include <cmath>
#include <cstring>
#include <map>
using namespac... | 0 | 7,236,042 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <string>
#define BIG 1000000000
#define SIZE 40
#define PI 3.14159265359
using namespace std;
struct Point {
dou... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define bn(n) (n).begin(), (n).end()
#define FOR(n) for(int i = 0; i < (int)n; i++)
void solve() {
int a, b, c;
cin >> a >> b >> c;
for (int i = 1; i <= b; i++) {
if (a*i % b == c) {
... | 0 | 85,655,788 |
#include<iostream>
using namespace std;
unsigned long Factorial(unsigned long n){
if(n!=1){
return n*Factorial(n-1);
}else{
return 1;
}
}
int main(){
unsigned long n;
cin >> n;
cout << Factorial(n) << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <ctime>
using namespace std;
void solve()
{
int N,K; cin >> N >> K;
map<int,int> M;
for (int i = 0; i < N; ++i){
int a; cin >> a;
M[a]++;
}
vector<int> Mvalue;
for(auto m: M) Mvalue.emplace_back(m.... | 0 | 74,580,320 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long int ll;
int main(){
ll n, k;
cin >> n >> k;
vector<ll> a(n), b(n);
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i];
}
ll ans = 0;
for(int i = 0; i <= 30; i++){
if(i != 0 && (k & (1L... | #include <iostream>
using namespace std;
int main() {
int K, S;
cin >> K >> S;
int pattern = 0;
for (int x=0; x<=K; ++x) {
for (int y=0; y<=K; ++y) {
int z = S - (x + y);
if ((z >= 0) && (z <= K)) {
++pattern;
}
}
}
cout << patt... | 0 | 85,500,662 |
#include<bits/stdc++.h>
using namespace std;
const int N=1005;
int n,x[N],y[N];
string ans;
vector<int>v;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d%d",&x[i],&y[i]);
for(int i=2;i<=n;i++)
if((abs(x[i])+abs(y[i]))%2!=(abs(x[i-1])+abs(y[i-1]))%2)
{
printf("-1\n");... | #include<iostream>
#include<string>
typedef struct dictionary{
struct dictionary *A, *C, *G, *T;
bool a, c, g, t;
} dictionary;
void insert(void);
void find(void);
void init(dictionary*);
dictionary *Dic;
int main(){
int n;
std::string func, ins="insert", fin="find";
init(Dic = new dictionary);
std::cin >> ... | 0 | 75,305,604 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1e9+7;
#define INF 1e9+9;
#define ps(x,y) fixed<<setprecision(y)<<x
# define PI 3.14159265358979323846264338327950 L
typedef long long ll;
typedef unsigned long long ull;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ON... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d",&x);
const int MAX = 1000;
const int INF = 1e9;
int ... | 0 | 19,623,238 |
#include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string s;
cin>>s;
if(s[0] == s[1] && s[1] != s[2] && s[2] == s[3]){
cout<<"Yes";
}
else if(s[0] == s[2] && s[2] != s[1] && s[1] == s[3]){
cout<<"Yes";
}
else if(s[0]... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)
#define FORCLS(i,a,b) for(int i = (a); i <= (b); i++)
#define REPCLS(i,n) FORCLS(i,1,n)
const int NMAX = 10000005;
int isOKsMemo[NMAX];
const in... | 0 | 21,835,687 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = n-1; i >= 0; i--)
#define FOR(i, n, m) for(int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()... | #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;
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#def... | 0 | 66,373,591 |
#include <iostream>
using namespace std;
int main(void){
int H,W;
while (cin >> H >> W){
if(H==0&&W==0) break;
if(H>300||W>300||H<0||W<0) continue;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(i==0||i==H-1||j==0||j==W-1) cout << "#" ;
else cout << "." ;
}
cout << endl;
}
cout << endl;
}
... | #include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main() {
int x, n; cin >> x >> n;
int *p = new int[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
sort(p, p+n);
int a = 9999;
int ans;
for (int k = -1; k <= 101; k++) {
if (a > abs(x-k)... | 0 | 26,505,723 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int lld;
const lld mod = 1e9+7;
const lld INF = 1e9;
int fib[45] = {0};
int f(int n)
{
if (n == 0 || n == 1)
{
fib... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 0 | 64,382,893 |
#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(2*a>b||4*a<b)
{
cout<<"No"<<endl;
}
else if(b%2==1)cout<<"No"<<endl;
else cout<<"Yes"<<endl;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 50,686,304 |
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9+7;
bool print_space_enable = false;
void print() {
cout << '\n';
print_space_enable = false;
}
template <class Head,... | 0 | 69,577,953 |
#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(){
int N;cin>>N;
vector<int>d(N);
ll ans=0;
rep(i,N){... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | 0 | 35,546,998 |
#include <iostream>
#include <map>
#include <queue>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)
int main() {
long long X, Y;
cin >> X >> Y;
if (X % Y == 0) cout << "-1" << endl;
else cout << X << endl;
return 0... | #include <iostream>
using namespace std;
#define START 1
#define INIT 0
#define TRUE 1
int main() {
int iCounter = START;
int x = INIT;
while (TRUE) {
cin >> x;
if (x == INIT) {
break;
}
else {
cout << "Case " << iCounter << ": " <... | 0 | 19,035,555 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
ll sum = 0;
ll mn = 1LL << 60;
if(a == b) {
cout << 0 << endl;
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = (long long)... | 0 | 27,325,158 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main(){
int n,k;
cin>>n>>k;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
int idx=0,temp=n;
while(temp>0){
if(temp==k){
idx++;
break;
}
else
{
temp=temp-(k-1);
idx++;
}
}
cout<<idx<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
int n, m, p[12];
vector<int> x[12];
cin >> n >> m;
rep(i, m) {
... | 0 | 249,024 |
#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;
const int MAX_N = 100005;
const ll MOD = 1e9+7;
ll dp[MAX_N][2];
int main()
{
string L;
cin >> L;
int N = L.size();
dp[0][0] = 2; dp[0][1] = 1;
rep(i,N-1)
{
if (L[i+1] == '1')... | #include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <cmath>
#include <queue>
#include <unordered_map>
using namespace std;
int main() {
int n,a;
cin >> n;
unordered_map<int, int> m;
for (int i = 0; i < n; i++) {
cin >> a;
if (m.find(a) == m.end()) { m.emplace(a, 0); }
... | 0 | 54,480,637 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using llint = long long int;
using namespace std;
int dist(const vector<int> x, const vector<int> y) {
int sum = 0;
for (size... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) repv(i,0,N)
#define reps(i,N) repvs(i,0,N)
#define repv(i,a,b) for(int i=a;i<b;i++)
#define repvs(i,a,b) for(int i=a+1;i<=b;i++)
#define repr(i,N) for(int i=N-1;i>=0;i--)
#define reprs(i,N) for(int i=N;i>0;i--)
#define d(a) if(isDebugMode) cout<<#a<<"="<<a<... | 0 | 55,120,594 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | 0 | 54,736,100 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <queue>
#include <list>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main()
{
int A,B,C;
cin >> A >> B >> C;
if(A == B && A == C) cout << "Yes";
else cout << "No";
} | #include <bits/stdc++.h>
int main(){
int A, B, C, K;
std::cin >> A >> B >> C >> K;
bool ok = false;
for(int i=0; i<K; i++){
if(B <= A){
B *= 2;
}else if(C <= B){
C *= 2;
}
if(B > A && C > B){
ok = true;
break;
}
... | 0 | 76,659,035 |
#include <cstdio>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int n,u,k,p;
bool adm[105][105];
int main()
{
memset(adm,false,sizeof(adm));
cin>>n;
for(int i=0;i<n;i++)
{
scanf("%d%d",&u,&k);
while(k--)
{
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 60,300,178 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s;cin>>s;
rep(bit,1<<3){
int cnt=s[0]-'0';
string t;
t+=s[0];
rep(i,3){
if(bit&(1<<i)){
cnt+=s[i+1]-'0';
t+='+'... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 41,507,069 |
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for(int i =(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
#define REPm(i,n) for(int i=(n)-1;i>=0;i--)
#define REP1(i,n) for(int i=1;i<=(n);i++)
#define mp make_pair
typedef long long ll;
vector<int> ans;
void solve(int n){
if(n == 0) return;
... | #include <stdio.h>
int H,W,i,j;
int main(){
for(;;){
scanf(" %d %d",&H,&W);
if(H==0&&W==0){
return 0;
}
for(i=0;i<H;i++){
for(j=0;j<W;j++){
printf("#");
}
printf("\n");
}
printf("\n");
}
} | 0 | 78,974,570 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
ll n,k;
ll ans=0;
ll a=1e9+7;
cin>>n>>k;
for(ll i=k;i<=n+1;i++){
ans+=((n-i+1)*i+1)%a;
}
cout<<ans%a<<endl;
} | #include <cstdio>
#include <iostream>
#include <vector>
#include <math.h>
using namespace std;
int H, M, N;
int go[4][2];
bool K[1002][1002];
int score[1002][1002];
int C[11][2];
int ans = 0;
void saiki(int sx, int sy, int s){
if(K[sx][sy]){
if(score[sx][sy] > s){
score[sx][sy] = s;
for(int i = 0; i <... | 0 | 97,152,278 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_v... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | 0 | 51,174,161 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,ans=0; cin>>n;
long long sumD=0,lack=0;
long long a[n],b[n],diff[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
cin>>b[i];
diff[i]=b[i]-a[i];
sumD+=diff[i];
}
sort(diff,diff+n);
if(sumD<=0){
... | #include<iostream>
using namespace std;
int main(){
int H,N;
cin >> H >> N;
int A[N+1], B[N+1];
int i,j;
for(i=1; i<=N; i++){
cin >> A[i] >> B[i];
}
int dp[N+1][H+1];
for(i=0; i<=N; i++){
dp[i][0] = 0;
}
for(j=1; j<=H; j++){
dp[1][j] = (j/A[1] + (j%A[1]>0)... | 0 | 85,959,366 |
#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(void){
string s;
cin >> s;
if(s == "AAA" || s == "BBB") cout << "No" << endl;
else cout << "Yes" << endl;
return 0;
} | #include<bits/stdc++.h>
#include<queue>
using namespace std;
int main () {
int N;
cin >> N;
vector<queue<int>>tree(N + 1);
vector<queue<int>>length(N + 1);
vector<long long>Le(N - 1);
for (int i = 0; i < N - 1; i ++) {
int a, b;
cin >> a >> b >> Le[i];
tree[a].push(b);
tree[b].push(a);
l... | 0 | 22,647,493 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin >> n >> a >> b;
long int sum;
long int ans=0;
int num;
for(int i=1; i<=n; i++){
sum=0;
num=i;
for(int j=0; j<5; j++){
sum+=num%10;
num/=10;
}
if(a<=sum && sum<... | #include <bits/stdc++.h>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
using ll = long long;
const int INF = 1e8+10;
int n;
int a[3];
vector<int> v,ans(3,INF);
bool ok(int i,int j,int k){
for(int u=0;u<n;++u){
bool x = (((1<<u)&i) != 0);
bool y = (((1<<u)&j) != 0);
... | 0 | 8,342,301 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
int dp[S.length()+1][T.length()+1];
int i,j;
for(i=0; i<=S.length(); i++){
dp[i][0]=i;
}
for(j=0; j<=T.length(); j++){
dp[0][j]=j;
}
for(i=1; i<=S.length(); i++){
f... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
const int M = 1000000007;
void add_self(int &a,int b){
a+=b;
if(a>=M){
a-=M;
}
}
int32_t main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdi... | 0 | 20,162,675 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<math.h>
#include<set>
#include<map>
#include<time.h>
#include<cstring>
#include<iomanip>
#include<numeric>
#include<list>
#include<stack>
#include<sstream>
#define lli long long int
#define h 100
#define pf push_front
#define pb push_bac... | #include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) f... | 0 | 84,485,536 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
ll n, m;
ll i, j, k;
ll ret = 0;
ll h, w;
cin >> h >>w;
if ( ( h == 1) || (w == 1) ) {
cout << 1 << endl;
}
else {
cout << (((h * w % 2) == 1) ? (h * w / 2 + 1) : h * w / 2) <<endl;
}
return 0;
} | #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 | 63,388,061 |
#include <stdio.h>
int main(){
int a, ap;
scanf("%d %d", &a, &ap);
a = a * 3;
int total = a + ap;
printf("%d", total/2);
return 0;
} | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define Q int tt,qq; cin>>tt ;for(qq=1;qq<=tt;qq++)
#define I ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main()
{
ll n,i,j,ans=0;
cin>>n;
ll a[n+1],b[n];
for(i=0;i<n+1;i++)cin>>a[i];
for(i=0;i<n;i++)cin>>b[i];
for(... | 0 | 70,261,563 |
#include <iostream>
#include <string>
int main(void) {
int n;
std::string s;
int count;
std::string now_status;
while (1) {
std::cin >> n;
if (n == 0) {
break;
}
count = 0;
now_status = "";
for (int i = 0; i < n; i++) {
std::cin... | #include <iostream>
using namespace std;
#include <string>
#include <cctype>
int main() {
string deck, subset1, subset2;
int m, h;
while (1){
cin >> deck;
if (deck == "-") break;
cin >> m;
for (int i = 1; i <= m; i++){
cin >> h;
subset1 = deck.substr(0... | 0 | 69,491,690 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | #include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <math.h>
#include <algorithm>
#include <deque>
#include <climits>
using namespace std;
#define ll long long
#define ve vector
#define umap unordered_map
int main() {
int n; cin >> n;
ve<int> a(n);
for(int& i:a) cin>>i;... | 0 | 48,573,971 |
#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 rep(i, n) f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using vi = vector<int>;
template <class T>
using Grid = vector<vector<T>>;
... | 0 | 99,568,170 |
#include <iostream>
#include <vector>
int main(){
std::vector<int> vehicle_order;
int input_data;
while(std::cin >> input_data){
if(input_data == 0){
std::cout << vehicle_order.back() << std::endl;
vehicle_order.pop_back();
}else{
vehicle_order.push_back(input_data);
}
}
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
std... | 0 | 62,806,178 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for (long long i=0; i < (n); ++i)
#define rep2(i,n,m) for(long long i=n;i<=m;i++)
#define rep3(i,n,m) for(long long i=n;i>=m;i--)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF=1e18 ;
inline void chmax(ll& a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define INF 1e8
typedef long long int ll;
const double PI = acos(-1);
using Graph = vector<vector<int>>;
int main() {
int a[3][3];
rep(i, 3) {
rep(j, 3) { cin >> a[i][j]; }
}
int n;
ci... | 0 | 89,554,156 |
#include <cstdio>
int a[100005];
int n, m, sum;
void solve(int n, int m, int sum) {
if (m == 0) {
int all;
if (sum == 1e9) {
all = sum / n - 1;
} else {
all = sum + 1;
}
for (int i = 0; i < n; ++i) {
a[i] = all;
}
} else {
if (sum - n + m > 0) {
for (int i = 0; i ... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rre... | 0 | 76,086,473 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
using lint = int64_t;
int main() {... | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for(long long int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main(){
ll N, a1 = 0, b1 = 0, a2 = 0, b2 = 0;cin >> N;
map<ll, ll> A;
map<ll, ll> B;
rep(i, 0, N/2){
ll a, b;cin >> a >> b;
... | 0 | 8,440,273 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#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... | #include<bits/stdc++.h>
using namespace std;
int n, d, A;
struct az
{
int x;
int h;
}q[200005];
int l[200005];
long long f[200005];
long long sum[200005];
bool cmp(az a, az b)
{
return a.x < b.x;
}
int main()
{
scanf("%d%d%d",&n,&d,&A);
for(int i=1;i<=n;++i)
scanf("%d%d",&q[i].x,&q[i].h);
sort(q+1,q+1+n,cmp)... | 0 | 34,577,557 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> w(n);
int sum = 0;
for(int i = 0; i < n; i++){
cin >> w[i];
sum += w[i];
}
int mini = sum;
int prefix_sum = 0;
for(int i = 0; i < n; i++){
cin >> w[i];
prefix_sum += w[i];
mini = min(mini,abs(prefix_sum - (sum - p... | 0 | 77,011,755 |
#include <cstdio>
using namespace std;
double nx[4], ny[4], a[3], b[3], c[3];
void line(double ax, double ay, double bx, double by, double *a, double *b, double *c)
{
if(ax == bx){
*b = 0;
*c = ax;
return;
}
if(ay == by){
*a = 0;
*c = ay;
return;
}
double aa = ax - bx;
double bb = ay... | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rp(i,n) for (int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define all_acc(x) (x).begin(), (x).end(), 0LL
#define int long long
#define absSort(v) sort(a.begin(), a.end(), [](int i, int j... | 0 | 58,189,685 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s; cin>>s;
ll r=s.size()-1, wc=0, ans=0;
rep(i,s.size()) if (s[i] =='W') wc++;
rep(l,wc) {
if (... | 0 | 5,881,685 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, A;
cin >> N >> K;
vector<int> cnt(N + 1);
while (cin >> A) cnt.at(A)++;
sort(cnt.rbegin(), cnt.rend());
cout << N - accumulate(cnt.begin(), cnt.begin() + K, 0) << "\n";
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mxn= 2e5+5;
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main(){
int n;
cin>>n;
int arr[mxn]=... | 0 | 68,031,789 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 0 | 27,926,440 |
#include <bits/stdc++.h>
#define REP( i , nn ) for(int i = 0 ; i < (int) nn; i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){... | #include <bits/stdc++.h>
const long long MOD = 1e9+7;
using namespace std;
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int A,B,C;
cin >> A >> B >> C;
if (A==B && B==C && C==A) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | 0 | 9,506,556 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main()
{
int D;
cin >> D;
string S = "Christmas";
string eve = " Eve";
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
... | 0 | 24,769,039 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.