code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string S;
cin >> S;
sort(S.begin(), S.end());
for(int i=0; i+1<S.size(); i++){
char a = S[i];
char b = S[i+1];
if(a==b){
cout << "no" << endl;
return 0;
... | #include <stdio.h>
using namespace std;
class Node
{
public:
int key;
Node* previous;
Node* next;
};
class DoublyLinkedList
{
private:
Node* sentinel;
public:
DoublyLinkedList ()
{
sentinel = new Node;
sentinel->previous = sentinel;
sentinel->next = sentinel;
}
~DoublyLinkedList ()
{
Node* element = se... | 0 | 37,541,023 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
ll... | 0 | 39,367,724 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
vector <long long> a(n);
for(auto&i : a)
scanf("%d",&i);
sort(a.begin() ,a.end());
for(int i=1; i<n; i++)
a[i] += a[i-1];
for(int i=n-2; ~i; i--)
if(2*a[i] < a[i+1]-a[i]){
co... | #include <iostream>
#include <vector>
using namespace std;
vector<string> BubbleSort(vector<string> a);
vector<string> SelectionSort(vector<string> a);
void Show(vector<string> a);
void ShowStable(const vector<string> sa, const vector<string> a);
bool IsStable(const vector<string> sa, const vector<string> a);
int main(... | 0 | 75,145,036 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long N, long long K, std::vector<long long> a, std::vector<long long> b) {
vector<ll> bucket(1e5 + 1);
rep(i, N) { bucket[a[i]] += b[i]; }
ll prevcnt = 0;
for (ll i = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> Pil;
int N;
const int MAX_N = 2.0e5 + 10;
ll A[MAX_N];
int main() {
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
ll cnt = 0;
for (int i = 1; i < N; i++) {
if (A[i-1] > A[i]) {
cnt += A[i-1... | 0 | 24,999,271 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> SE... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <cstring>
#define LP(i,n) for(int i=0;i<n;i++)
#define Mset(x,v) memset(x,v,sizeof(x))
using namespace std;
using LL=long long;
int A[110][110];
int mai... | 0 | 28,848,196 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
int a[3];
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a, a + 3);
if (a[2] * a[2] == a[0] * a[0] + a[1] * a[1]) {
cout << "YES\n";
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl... | 0 | 50,583,952 |
#include <iostream>
#include <map>
using namespace std;
int x[10000];
int main() {
int n;
cin>>n;
int MAX;
for(int i = 0; i < n; i++)
{
cin>>x[i];
}
MAX = x[0];
int k = 1;
for(int i = 1; i < n; i++)
{
if(x[i] >= MAX)
{
k++;
MAX = x[i];
}
}
cout<<k;
return 0;
} | #include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#i... | 0 | 75,600,281 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int n;
cin>>n;
vector<int>a(n);
int min=1000000000;
int max=0;
... | 0 | 8,834,333 |
#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... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,t;
cin>>n>>x>>t;
for(int i=1;i>0;i++)
{
if(i*x>=n)
{
cout<<i*t;
break;
}
}
return 0;
} | 0 | 43,139,438 |
#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... | #include <algorithm>
#include <iostream>
#include <vector>
template <typename C>
void print_container(const C &c, const std::string &name)
{
std::cout << name << ": ";
std::for_each(c.cbegin(), c.cend(),
[](auto &x) { std::cout << x << ", "; });
std::cout << std::endl;
}
int get_GCD(int lhs, int r... | 0 | 65,917,632 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | #include <iostream>
using namespace std;
int main(){
int n,m,p;
while(cin>>n>>m>>p,n||m||p){
int c,g=0,x,i;
for(i=0;i<n;i++){
cin>>x;
g+=x;
if(i+1==m) c=x;
}
g*=(100-p);
if(c) cout<<g/c<<endl;
else cout<<0<<endl;
}
} | 0 | 67,766,963 |
#include<iostream>
#include<vector>
#include<algorithm>
#define INF 1e9
using namespace std;
int main(){
int n,m;
cin >>n>>m;
int dp[n+1];
int coin[m];
for(int i=0 ; i < m ; i++)cin >>coin[i];
for(int i=0 ; i < n+1 ; i++)dp[i]=INF;
dp[0]=0;
for(int i=0 ; i < m ; i++){
for(int j=coin[i] ; j <= n+1 ; ... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } retu... | 0 | 52,292,646 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int k, n;
cin >> k >> n;
vector<int> as(n);
for (int &a : as) cin >> a;
int mx = 0;
mx = k - as[n - 1] + as[0];
for (int i = 1; i < n; i++) {
mx = max(mx, as[i] - as[i - 1]);
}
cout << k - mx << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
int main(){
string s;
cin >> s;
if(s[0]==s[1]){
if(s[2]==s[3]){
if(s[1]!=s[2]){
cout << "Yes" << endl;
return 0;
}
}
}
if(s[0]==s[3]){
... | 0 | 6,874,863 |
#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 SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((&a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " <... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int n;
cin>>n;
int dp[n];
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
dp[n-1]=1;
int maxi=1;
for(int i=n-2;i>=0;i--)
{
if(arr[i]>=arr[i+1])
dp[i]=1+dp[i+1];
el... | 0 | 98,224,395 |
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<stack>
#include<iostream>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define MOD 1000000007
#define vec(a) vector<int>a
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("output.txt",... | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
int h, w;
int dy[] = {1, 0, -1}, d... | 0 | 81,332,289 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;
#define fo(i,s,e_ex) for(i=s;i<e_ex;i++)
#define Fo(i,k,n) for(i=k;k<n?i<=n:i>=n;k<n?i+=1:i-=1)
#define endl '\n'
#define MOD 1000000007
#define pbb push_back
#define mpp make_pair
#define ff first
#d... | #include <bits/stdc++.h>
using namespace std;
bool chk(string s,int i){
int mid = i/2;
for(int start = 0;start<mid;start++)
{
if(s[start]!=s[start+mid])
return false;
}
return true;
}
int main(void)
{
string s;
cin>>s;
int len = s.... | 0 | 11,690,922 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N; cin >> N;
ll res = to_string(N).size();
ll A,B;
for (ll A=1; A<=sqrt(N); A++){
if (N%A != 0) continue;
B = N/A;
res = min((ll)log10(B)+1, res);
}
cout << res << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1LL << 60;
int
main() {
int H, W;
cin >> H >> W;
vector<vector<char>> vec(H);
vector<vector<int>> up(H, vector<int>(W)), down(H, vector... | 0 | 35,076,225 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
int sum = 0;
vector<int> d(n);
rep(i,n) cin >> d[i];
rep(i,n)rep(j,n){
if(i == j) continue;
sum += d[i]*d[j];
}
cout << sum/2 << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define double long double
#define ull unsigned long long
#define mod 1000000007
#define vi vector<ll>
#define extrem... | 0 | 95,322,205 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n; cin >> n;
vector<long long> v(n, 0);
bool fail = false;
int tmp;
cin >> tmp;
if (tmp != 0) fail = true;
for (int i = 1; i < n; i++) {
cin >> tmp;
if (tmp == 0) fail = true;
v[tmp]++;
}
if (fail) cout << 0 ... | #include<bits/stdc++.h>
#define L long long
using namespace std;
int n,m,t,a[100010],b[100010],x[100010],w[100010];
int main()
{
int i,j,k;
scanf("%d%d%d",&n,&m,&t);
for(i=1;i<=n;i++)
{
scanf("%d%d",&a[i],&b[i]);
if(b[i]==1)
x[i]=(a[i]+t)%m;
else
x[i]=((a[i]-t)%m+m)%m;
... | 0 | 1,928,991 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 1001
int dp[MAX][MAX];
int lcs(string& s,string& t,int si,int ti){
int ret = 0;
if(si < 0 || ti < 0)return 0;
if(dp[si][ti] != -1)return dp[si][ti];
if( s[si] == t[ti] ){
ret = max(ret, lcs(s,t,si-1,ti-1) + 1);
}else{
if(si > 0)ret = max(ret, lcs(s,t,si... | #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) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | 0 | 37,703,851 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i< n;i++)cin >> a[i];
double ans = 0.0;
for(int i = 0; i< n;i++)ans += (double)(1.0 / a[i]);
ans = (double)(1.0 / ans);
printf("%.10f\n",ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
vector<vector<char>> s(h+2,vector<char> (w+2,'.'));
for ( int i = 1; i < h+1; i++){
for ( int j = 1; j < w+1; j++){
cin >> s[i][j];
}
}
for ( int i = 1; i < h+1; i++){
for ( int j = 1; j < w+1; j++){
i... | 0 | 68,458,360 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair <int, int> ii;
const int N = 1e5 + 5;
int n, m, d[N], tin[N], dfsTime;
vector <ii> adj[N];
bool mark[N];
void dfs(int u) {
tin[u] = ++dfsTime;
mark[u] = 1;
for (ii p : adj[u]) {
int v = p.first, w = p.second;
if (!mark[v]) {
d[v]... | #include<bits/stdc++.h>
using namespace std;
#define INF 1e9
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}... | 0 | 78,771,052 |
#include<iostream>
#include<map>
#include<string>
int main(){
std::string str;
std::string maxlen;
std::string maxocc;
std::map<std::string, int> occ;
while(std::cin >> str){
if(str.size()>maxlen.size()){
maxlen = str;
}
occ[str]++;
if(occ[str]>occ[maxocc]){
maxocc = str;
}
}... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 0 | 71,048,918 |
#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 rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X,Y;
cin>>X>>Y;
if(X%Y==0){
cout<<-1<<endl;
return 0;
}
for(int i=1;;i++){
if(i*X%Y!=0){
cout<<i*X;
return 0;
}
}
return 0;} | 0 | 19,774,816 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,k;
cin>>n>>k;
string s;
cin>>s;
s+='2';
ll l=0,r=0,cnt=0;
if(s[r]=='0'){
cnt++;
for(ll i=0;i<n;i++){
r=i;
if(s[i]=='1'&&s[i+1]=='0'){
break;
}
}
}
if(cnt!=k){
for... | #include <bits/stdc++.h>
#define ll long long
#define ulli unsigned long long int
#define ld long double
#define endl "\n"
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> v(n);
for (int& x: v) {
cin >> x;
}
sort(v.begin(), v.end());
int ans = v[n/2] - v[n/2 - 1];
... | 0 | 29,283,549 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n;
ll a[maxn];
ll b[maxn];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | 0 | 6,984,111 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, c, k;
cin >> n >> c >> k;
vector<int> t(n);
rep(i, n) cin >> t.at(i);
sort(t.begin(), t.end());
int cnt = 1;
int min_time = t.at(0);
int canPassenger = c;
for (int i = 0; i < n; i++) {... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | 0 | 45,380,658 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,x,t;
cin>>n>>x>>t;
int a;
if(n%x==0){
a=n/x;
}
else{
a=n/x +1;
}
cout<<a*t<<endl;
} | #include <iostream>
using namespace std;
int main()
{
long long n,m=0,sum=1000,r=0;
long long num[100];
cin>>n;
for(int i=0;i<n;i++)
cin>>num[i];
for(int i=0;i<n-1;i++)
{
if(m==0)
{
if(num[i]<num[i+1])
{
m=sum/num[i];
sum=sum-m*num[i];
}
}
else if(m>0)
{
if(num[i]<=num[i+1])
... | 0 | 73,902,796 |
#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(... | #include <bits/stdc++.h>
#define int long long
#define rng(i, l, r) for (size_t i = (l); i < (r); ++i)
#define rep(i, n) rng(i, 0, n)
#define gnr(i, l, r) for (size_t i = (r)-1; i >= (l); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
... | 0 | 69,813,687 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, a, b) for(int i = a, i##_len = (b); i < i##_len; ++i)
int graph[4][4];
bool visited[4];
bool all_vis(int cur) {
visited[cur] = true;
for(int i = 0; i < 4; ++i) if(graph[cur][i]) {
if(visited[i]) continue;
if(all_vi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int INF = 1000000000;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
rep(i, n) {
scanf("%d", &a[i]);
}
int len = 1;
vector<int> l(n+1, INF);
rep(i, n) {
if (i == 0) {
... | 0 | 81,662,646 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
using namespace std;
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vecto... | #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 | 82,977,316 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mod(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,a,b) for(int i = a; i < b; i++)
#define forr(i,a,b) for(int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long do... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
int mx = -1001001001;
for (int i = 0; i < n; ++i) {
int p;
cin >> p;
mx = max(mx, p);
}
int my = 1001001001;
for (int j = 0; j < m; ++j) {
... | 0 | 36,859,000 |
#include <iostream>
#include <map>
using namespace std;
int main(){
map<int, int> m, r;
int a[6], n, x, y;
int d[6][6]={{0,3,5,2,4,0},{4,0,1,6,0,3},{2,6,0,0,1,5},
{5,1,0,0,6,2},{3,0,6,1,0,4},{0,4,2,5,3,0}};
for(int i = 0;i < 6;i++){cin >> a[i];m[a[i]] = i;r[i] = a[i];}
cin >> n;
for(int i = 0;i < n;i++){
cin ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << 100 << ' ' << 100 << endl;
char g[100][100];
for(int i=0; i<50; i++){
for(int j=0; j<100; j++){
g[i][j] = '.';
g[i+50][j] = '#';
}
}
for(int i=0; i<b-1; i++){
... | 0 | 88,148,868 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.length(); i++) {
ans += s[i] - '0';
}
if (ans % 9 == 0) {
cout << "Yes\n";
return 0;
}
cout << "No\n";
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;... | 0 | 31,830,094 |
#include "bits/stdc++.h"
#define pb(x) push_back(x)
#define XX first
#define YY second
#define cst 1000000007
#define nor_rad(x) ( ( PI*x )/180)
#define rad_nor(x) ( (x/IP)*180 )
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x));
#define eps 1e-9
#define rev reverse
#define READ(f) freopen(f, "r"... | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
while(cin>>n){
int ans=0;
if(n>36)
cout << 0 << endl;
else{
int m = 10;
for(int i=0;i<m;i++){
for(int j=0;j<m;j++){
for(int k=0;k<m;k++){
... | 0 | 69,380,411 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main() {
string a, aa, aaa;
cin >> a >> aa >> aaa;
char l1 = a[0];
char l2 = aa[0];
char l3 = aaa[0];
l1-=32;
l2-=32;
l3-=32;
cout << l1 << l2 << l3 << "\n";
} | #include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
ll mod = 1e9 + 7;
ll dp[1000];
ll fastPow(ll base, ll expo)
{
ll ans = 1;
while (expo > 0)
{
if (expo & 1)
ans = ans * base % mod;
base = base * base % mod;
expo >>= 1;
}
return an... | 0 | 38,834,510 |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
using namespace std;
struct Node {
int key;
Node *prev, *next;
};
Node *nil;
void init() {
nil = (Node *)malloc(sizeof(Node));
nil -> next = nil;
nil -> prev = nil;
}
void insert(int key) {
Node *x = (Node *)malloc(sizeof(Node));
x... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <t... | 0 | 57,926,568 |
#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
double iabs(double x) {return x > 0 ? x : -x;}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
double T = a[n] / 2.0;
int t = 1;
for (int i = 1; i <= n; i++) {
if (iabs(... | #include <iostream>
#include <algorithm>
#include <utility>
using namespace std;
int main(){
long long n,i,b,mn[100010];
pair<long long,long long> a[100010];
long long ans[100010];
cin >> n;
for(i=1;i<=n;i++){
cin >> b;
a[i] = make_pair(b,i);
ans[i] = 0;
}
a[0] = make... | 0 | 76,085,698 |
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<functional>
#include <random>
#include<iostream>
#include<iomanip>
using namespace std;
int N;
pair<int, int> A[100000];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i].fir... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int myfind(int a, vector<int>& relation) {
if (relation[a] == a) return a;
int r... | 0 | 85,540,637 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<ll, ll>
#define PP pair<P,P>
using namespace std;
int main(){
int x,y,z,k; cin >> x >> y >> z >> k;
vector<ll> a(x),b(y),c(z)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); ... | 0 | 65,700,336 |
#define _CRT_SECURE_NO_WARNINGS
#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 sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define Cout(x) cout << (x) << endl
#def... | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cassert>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include <cstring>
#include <functional>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define IN... | 0 | 24,016,119 |
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define ff first
... | #include<stdio.h>
int main(void)
{
int a,b,c;
scanf("%d%d%d", &a, &b, &c);
if (a<b && b<c){
printf("Yes\n");
}
else {
printf("No\n");
}
return 0;
} | 0 | 53,852,751 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
vvi G(n);
rep(i,m){
int a, b;
cin >> a >> b;
... | #include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld"... | 0 | 27,357,923 |
#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>
#include<deque>
#include<iomanip>
#include<utility>
usi... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<list>
#include<stack>
using namespace std;
#define ll long long
#define dd cout<<endl
const long long int inf = 1e18+7;
const int mod = 998244353;
using namespa... | 0 | 4,154,420 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <numeric>
#include <bitset>
#include <fu... | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <iomanip>
#include <set>
template<typename T> bool chmax(T &a,T b){
if(a<b){
a=b;
return true;
}
return false;
}
template<typename T> bool chmin(T &a,T b... | 0 | 67,728,656 |
#include <bits/stdc++.h>
#include <iomanip>
#include <algorithm>
#define ll long long
#include <unordered_map>
using namespace std;
int main() {
ll n;
bool blank = 0;
cin >> n;
string S;
vector<ll> A(26, 0), B(26, 0);
for(ll i = 0; i < n; i++) {
cin >> S;
vector<ll> B(26, 0);
if(i == 0) {
... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 | 65,853,177 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i, k , n) for(int i = k; i <= n; i++)
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{... | #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;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned lo... | 0 | 4,109,250 |
#include <iostream>
using namespace std;
int main() {
long long a, b, c, k;
cin >> a >> b >> c >> k;
if(k%2 == 1) cout << b-a;
else cout << a-b;
} | #include <bits/stdc++.h>
int main() {
long long int L, R;
std::cin >> L >> R;
if (R - L > 2019) {
std::cout << 0 << std::endl;
return 0;
}
long long int min = 10000;
for (long long int i = L; i < R; i++) {
for (long long int j = i + 1; j <= R; j++) {
min = std... | 0 | 98,687,167 |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++)
cin >> height[i];
vector<int> minCost(n);
minCost[0] = 0;
minCost[1] = abs(height[0] - height[1]);
for (int i = 2; ... | #include<bits/stdc++.h>
using namespace std;
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)
#define F first
#define S second
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define PI 3.141592653589
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf(... | 0 | 60,039,697 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
const int MAX_NUM = 999999999;
void so... | #include<iostream>
#include<stdio.h>
using namespace std;
#define MAX 1000005
#define NIL -1
struct Node { int p, l, r; };
Node T[MAX];
int n, D[MAX];
void print(int u) {
int i, c;
printf("node %d: ", u);
printf("parent = %d", T[u].p);
printf(", ");
printf("depth = %d", D[u]);
printf(", ");
if (T[u].p == NIL) {
... | 0 | 46,625,879 |
#include <bits/stdc++.h>
using namespace std;
template<class C>constexpr int sz(const C&c){return int(c.size());}
using ll=long long;constexpr const char nl='\n',sp=' ';
template <class C> struct SegmentTreeBottomUp {
using Data = typename C::Data; using Lazy = typename C::Lazy;
int N; vector<Data> TR;
template <... | #include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mk make_pair
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define vl vector<long long int>
#define vvl vector<vector<ll> >
#define fo(i,a,b) for(int i=a;i<b;i++)
#define rof(i,a,b) for(int i=b;i>=a;i--)
using namespac... | 0 | 54,017,305 |
#include <iostream>
#include <cstdio>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (a+b<c ? "No" : "Yes");
return 0;
} | #include <iostream>
#include <utility>
#include <vector>
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
using namespace std;
using P=pair<ll, ll>;
vector<P> prime_factorize... | 0 | 47,601,087 |
#include <iostream>
using namespace std;
int A;
int B;
string S;
string T;
string U;
int main(){
cin >> S >> T >> A >> B >> U;
if(S == U) A--;
if(T == U) B--;
cout << A << " " << B;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
ll gcm(ll a, ll b) {
if(b == 0) return a;
retu... | 0 | 53,495,788 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
main()
{
int n;
cin >> n;
if(n <= 111){
cout << 111;
}
else if(n <= 222){
cout << 222;
}
else if(n <= 333){
cout << 333;
}
else if(n <= 444){
cout << 444;
}
else if(n <= 555){
... | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ld double
#define ll long long
#define int long long
using namespace std;
const int MAXN = 301 * 1001 , MOD = 1e9 + 7 , sq = 333 ;
int32_t main()
{
ios::sync_with_stdio(0);cin.tie(0);
int n ;
cin >> n ;
deque < int > d... | 0 | 88,758,934 |
#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(){
string s,t;
cin >> s >> t;
int count=0;
rep(i,3){
if(s[i]==t[i]) count ++;
}
cout << count <... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>
#include <ca... | 0 | 92,755,904 |
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
int main() {
int n, u, k, v;
cin >> n;
vector<int> ans(n,1000000000);
vector<vector<int>> adj(n);
for (int i = 0; i < n; i++) {
cin >> u >> k;
while (k--)cin >> v, adj[u-1].push_back(v-1);
}
queue<pair<int, int>> q;
... | #include <bits/stdc++.h>
#include <stdio.h>
#define ll long long
#define fr(i,p,n) for(ll i=p;i<n;i++)
#define fr1(i,p,n) for(ll i=p;i>=n;i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define PI 3.14159265358979323846
#define MOD 1000000007
#define MO... | 0 | 71,431,509 |
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#... | #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 < n; i++)
int main()
{
int n,m,ans=0;
cin >> n>>m;
vector<int> a(n);
vector<vector<int>> p(n,vector<int>(n,0));
rep(i,m){
int a,b;
cin>> a>>b;
a--;b--;
p[a][b]=p[b]... | 0 | 67,279,754 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int S,W;cin >> S >> W;
if(S<=W){
cout << "un";
}
cout << "safe" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int MOD=1000000007;
const int INF= int(1e9);
const int MAX=100007;
int dp[MAX],a[MAX],n;
int main()
{
ios_base::sync_with_stdio(false);
cin>>n;
for(int i=0;i<n;... | 0 | 24,743,668 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int m,k;
cin>>m>>k;
if(k>=(1<<m))
{
cout<<"-1\n";
return 0;
}
if(m==1)
{
if(k==1)
cout<<"-1\n";
else
{
cout<<"0 0 1 1\n";
}
return 0;
}
for(int i... | #include<iostream>
#include<map>
using namespace std;
int main()
{
int n;
cin>>n;
if(n<600)
cout<<"8\n";
else if(n<800)
cout<<"7\n";
else if(n<1000)
cout<<"6\n";
else if(n<1200)
cout<<"5\n";
else if(n<1400)
cout<<"4\n";
else if(n<1600)
cout... | 0 | 46,693,529 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define SUM(a) accumulate((a).begin(),(a).end(),0)
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define dump(x) cerr << #x << " = " << (x) << endl... | #include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long LL;
int fu[100020];
int dis[100020];
bool success;
int findfu(int i)
{
if (f... | 0 | 95,037,340 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | #include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
int ans[N], n, a, b;
pair <int, int> check() {
vector <int> f(n + 5, 0), g(n + 5, 0);
int c, d; c = d = 0;
for (int i = 1; i <= n; ++i) {
f[i] = g[i] = 1;
for (int j = 1; j < i; ++j) {
if (ans[i] > ans[j]) f[i] = max(f[i], f[j] + 1);
if (... | 0 | 44,929,015 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e,f;
cin >> a >> b >> c >> d;
e = a + b;
f = c + d;
if (e == f)
cout << "Balanced" << endl;
else if (e > f)
cout << "Left" << endl;
else
cout << "Right" << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define vi vector<ll>
#define mii map<ll,ll>
#define... | 0 | 97,257,982 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
string s;
vector<int> used(26, 0);
int cnt = 0;
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double Double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template<class T>
inline bool chmin(T &a, T b) {
... | 0 | 83,107,275 |
#include <bits/stdc++.h>
using namespace std;
int facctorialMethod(int k){
int sum = 1;
for (int i = 1; i <= k; ++i)
{
sum *= i;
}
return sum;
}
void solve(){
int n,m,x,count=0,r[2];
scanf("%d",&n);
int a[2][n];
for (int i = 0; i < n; i++)
{
scanf("%d",&a[0][i]);
}
for (int... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | 0 | 13,741,953 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
vector<ll> A(N);
for (int i=0;i<N;i++) cin >> A[i];
sort(A.begin(),A.end());
ll sum = 0;
ll last = -1;
for (int i=0;i<N-1;i++){
sum +=... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<int,P> P1;
#define fr first
#define sc second
#de... | 0 | 82,446,965 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <functional>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <cstdio>
using namespace std;
int main(){
int n,k, a;
cin >> n;
cin >> k;
for (int i = 0; i < n; i++){
cin >> a;
}
... | #include <iostream>
using namespace std;
int main(){
int N,K;
int A;
int snack[110]={0};
cin >> N >> K;
int i,j;
int d;
for(i=0; i<K; i++){
cin >> d;
for(j=0; j<d; j++){
cin >> A;
if(snack[A-1]==0) snack[A-1]=1;
}
}
int count=0;
... | 0 | 62,227,779 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int ans = 1;
if(n < 105) ans = 0;
else{
if(n >= 135 && n < 165) ans++;
if(n >= 165 && n < 189) ans += 2;
if(n >= 189 && n < 195) ans += 3;
if(n >= 195) ans += 4;
}
cout << ans << '\n';
} | #include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define mes(a,b) memset((a),(b),sizeof((a)))
#define syio std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0);
#define lson l, mid, rt << 1
#define rson mid+1, r, rt << 1 | 1
typedef long long ll;
typedef long double real;
typedef pair<... | 0 | 10,473,719 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
#define endl '\n'
int main() {
ios::sync_with_stdio(0); cin.tie(0);
ll n;
cin >> n;
vector<ll> A(n);
for (auto& _a : A) cin >> _a;
int j = 0;
for (int i = 0; i < n; ++i) {
if (A[i] == j+1) {
++j;
... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
int N=1000;
int LCS(string x,string y){
int c[N+1][N+1],LCSlen=0;
int m=x.size();
int n=y.size();
x=' '+x;
y=' '+y;
for(int i=1;i<=m;i++) c[i][0]=0;
for(int j=1;j<=n;j++) c[0][j]=0;
for(int i=1;i<=m;i++){
for(int j=1... | 0 | 61,394,252 |
#include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int main() {
Int N;
cin >> N;
vector<Int> a(N);
for (int i = 0; i < N; ++i) { cin >> a[i]; }
Int ans = 0;
while (true) {
Int sum = 0;
for (int i = 0; i < N; ++i) {
sum += a[i] / N;
}
if (sum == 0) { break; }
for (int i = 0; i < N; ++i)... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a, b; cin >> n >> a >> b;
int p1 = 0, p2 = 0, p3 = 0;
while (n--) {
int p; cin >> p;
p1 += p <= a;
p2 += a + 1 <= p && p <= b;
p3 += b + 1 <= p;
}
int ans = 0;
while (p1-- && p2-- && p3... | 0 | 63,465,142 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define fs first
#define sc second
const LL MOD = 1e9+7;
template<class T>bool chmax(T &a, const T &b) {
if (a < b) { a = b; return true; }
return false;
}
template<class T>bool chmin(T &a, const T &b) {
if (b < a) { a = b; return true; }
... | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).... | 0 | 38,545,625 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1... | #include <iostream>
#include "bits/stdc++.h"
#define ll long long int
using namespace std;
ll dfs(ll pos,ll n, bool flag,string s,ll count,vector<vector<vector<ll>>>& dp,ll k){
if(pos >= n) return(count == k);
if( count > k) return 0;
if(dp[pos][count][flag] != -1) return dp[pos][count][flag];
... | 0 | 67,485,216 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A;
cin >> N >> A;
if(N%500 > A) cout << "No" << endl;
else cout << "Yes" << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H,W,D;
cin >> H >> W >> D;
vector<pair<int,int>> Cood(H * W + 1);
rep(h, H) {
rep(w, W... | 0 | 66,338,872 |
#include<iostream>
using namespace std;
int main(){
for(int i=0; i<5; i++){
int C;
cin >> C ;
cout << (1000-C)/500 + (1000-C)/100-5*((1000-C)/500) +
(1000-C)/50-2*((1000-C)/100) + (1000-C)/10-5*((1000-C)/50) +
(1000-C)/5-2*((1000-C)/10) + (1000-C)-5*((1000-C)/5) << endl;
}
} | #include <iostream>
#include <map>
using namespace std;
map<char, char> conv;
main() {
int n, m;
while((cin >> n) && n) {
conv.clear();
for(int i = 0; i < n; ++i) {
char a, b;
cin >> a >> b;
conv[a] = b;
}
cin >> m;
for(int i = 0; i < m; ++i) {
char c;
cin >> c;
... | 0 | 99,041,228 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,s;
cin >> N;
cin >> A;
s = N%500;
if(s>A) cout << "No" << endl;
else cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long ul;
#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 FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x... | 0 | 100,057,003 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <algorithm>
#include <string>
#include <iomanip>
using namespace std;
#define pi 3.141592653589
#define repeat(i,n) for(int i=0;i<n;i++)
int main()
{
string array;
string right;
int n1,n2;
bool ans=false;
cin >> array;
cin >> right;... | #include "bits/stdc++.h"
#define REP(i, n, N) for(ll i=(n); i<(N); i++)
#define RREP(i, n, N) for(ll i=(N-1); i>=(n); i--)
#define LREP(lst,itr) for(auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define MCP(a, b) memcpy(b,a,sizeof(b))
#defi... | 0 | 32,564,845 |
#include <stdio.h>
#include <string>
#include <iostream>
using namespace std;
int main(){
string s1=" ";
int sum=0;
while(1){
cin >> s1;
if(s1=="0") break;
sum = 0;
for(int i=0;i<s1.length();i++){
sum += (int)s1[i] - '0';
}
cout << sum << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for (int (i)=0; (i) < (n); (i)++)
int main()
{
vector<vector<ll>> A(3, vector<ll>(3, 0));
rep(i,3) {
rep(j,3) {
ll tmp; cin >> tmp;
A[i][j] = tmp;
}
}
ll N... | 0 | 20,926,869 |
#include <iostream>
#include <iomanip>
#define pi 3.14159265358979323846
using namespace std;
int main()
{
int H,W,i,j;
while(true)
{
cin>>H>>W;
if(H!=0||W!=0){
for(i=1;i<=H;i++)
{
if(i==1||i==H)
{
for(j=1;j<=W;j++)
{
cout<<'#';
}
cout<<endl;
}
else
{
... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vec... | 0 | 44,688,233 |
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> mp;
int divideprime(long long n){
long long i=2;
for(i=2;i<=sqrt(n)+1;i++){
while(n%i==0){
n/=i;
mp[i]++;
}
}
if(n!=1) mp[n]++;
return 0;
}
int main(){
long long n, ans=0, cnt=1;
cin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<set<int>> light_bulbs(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
s--;
light_bulbs.at(i).insert(s);
}
... | 0 | 79,791,815 |
#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++)
typedef int64_t Int;
int main(){
vector<int> A(3);
rep(i, 3) cin >> A[i];
sort(A.begin(), A.end());
cout << A[2]-A[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<double, double> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() ret... | 0 | 44,494,844 |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <map>
#include <string.h>
using namespace std;
#define NMAX 100001
pair <long long, int> distances[NMAX];
long long v[NMAX], dist[NMAX];
int bij[NMAX], par[NMAX], cnt[NMAX];
vector <int> sons[NMAX];
map <long long, int> idx;
void dfs... | #include <bits/stdc++.h>
using namespace std;
int main(){
int K,n;
cin >> n >> K;
pair<long long,long long> p[n],q[n];
for(int i=0; i<n; i++){
long long x,y;
cin >> x >> y;
p[i] = make_pair(x,y);
q[i] = make_pair(y,x);
}
sort(p,p+n);
sort(q,q+n);
long long... | 0 | 2,200,896 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, z;
z = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++) {
if (c % i == 0) {
z++;
}
}
cout << z << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " <... | 0 | 4,476,912 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int mod = 1e9 + 7;
ll p = 5e5 + 100;
int main() {
vector<ll> com(p + 1);
vector<ll> inv(p + 1);
vector<ll> mul(p + 1);
com[0] = 1;
for (ll i = 1; i <= p; ++i) {
com[i] = (com[i - 1] * i) % mod;
}
inv[0] = 1;
inv[1] = 1;
for (ll i = ... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 41,268,737 |
#include <bits/stdc++.h>
using namespace std;
string s[7];
int R, C, k;
bool func(int x, int y) {
int cnt = 0;
for (int i = 0; i < R; ++i) {
for (int j = 0; j < C; ++j) {
if(x&(1 << i) || y &(1 << j))
continue;
if(s[i][j] == '#')
++cnt;
}
}
if(cnt == k)
return true;
return false;
}
int main()... | #include<iostream>
#include<map>
#include<vector>
#include<array>
const int DiceSizeFace = 6;
using namespace std;
using DiceSides = map<int, array<int, 4>>;
using Labels = map<int, int>;
int main() {
DiceSides sides = {
{1, {5, 3, 2, 4}},
{2, {1, 3, 6, 4}},
{3, {1, 5, 6, 2}},
{4, {1, 2, 6, 5}},
{... | 0 | 85,691,363 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
ll cal(ll x){
if(x%2==0){
return (x/2)%2;
}
else {
return cal(x-1)^(x-1);
}
}
int main(){
l... | #include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
string s;
cin >> s;
string t[20010];
string T;
int j = 0;
reverse(s.begin(), s.end());
int n = s.size();
for(int i = 0; i < n; i++){
t[j] += s[... | 0 | 8,227,448 |
#include<bits/stdc++.h>
using namespace std;
int n,a,b,p,problemone,problemtwo,problemthree;
int main(){
cin>>n>>a>>b;
for(int i = 1;i <= n;i++){
cin>>p;
if(p <= a){
problemone++;
}else if(p <= b){
problemtwo++;
}else{
problemthree++;
}
}
cout<<min(min(problemone,problemtwo),problemthree)<<endl;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define fi first
#define se second
#define mp make_pair
#define itrfor(itr,A) for(auto itr = A.begin(); itr !=A.end();itr++)
template <class... | 0 | 29,385,188 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <iostream>
#include <stdio.h>
#include <string>
#define MAX 100000000
#define INFTY (1<<30)
int n, H[MAX];
void maxHeap(int i) {
int left = i * 2;
int right = i * 2 + 1;
if (left > n) return;
int max = left;
if (right <= n) max = H[left] >= H[right] ? left : right;
max = H[i] >= H[max] ... | 0 | 62,260,330 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
int x[100005];
... | #include<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 | 83,067,723 |
#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 = 1e9 + 5;
#define INF 1000000000
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264... | #include <bits/stdc++.h>
# define ll long long
# define vi vector<int>
# define pii pair<int,int>
#define mp make_pair
#define pb push_back
# define PI acos(-1)
# define double long double
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL) ;
double a,b,x ;
cin >> a >> b >> x ;
d... | 0 | 16,626,882 |
#include<stdio.h>
int main()
{
int n,A,x;
scanf("%d %d",&n, &A);
if(n < 500)
{
if(n <= A)
printf("Yes\n");
else
printf("No\n");
}
else if(n >= 500)
{
x = n % 500;
if(x <= A)
printf("Yes\n");
else
printf("... | #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 | 18,904,759 |
#include <iostream>
using namespace std;
int main()
{
double debt = 100000;
int n;
cin >> n;
while (n--) {
debt *= 1.05;
debt /= 1000;
debt += 0.999;
debt = (int)debt;
debt *= 1000;
}
cout << (int)debt << '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define fi first
#define se second
#define pub push_back
#define mkp make_pair
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for(int ... | 0 | 84,676,072 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n);... | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#inc... | 0 | 6,548,875 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
de... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator... | 0 | 19,137,035 |
#include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
#include <vector>
using namespace std;
int P[10011];
void init(int N){
for(int i=0;i<N;i++)P[i]=i;
}
int root(int a){
if(P[a]==a)return a;
else return (P[a]=root(P[a]));
}
bool check(int a,int b){
return root(a)==root(b);
}
void unite(int a,i... | #include <stdio.h>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#include <cstring>
#include <cmath>
#include <iomanip>
class engine{
public:
double X, Y;
engine(double x, double y){
X = x;
Y = y;
}
};
int main(){
long long int N;
double tmp1, tmp2;
std::vec... | 0 | 34,348,710 |
#include <bits/stdc++.h>
#define ST_ARR_LEN(array) (sizeof(array)/sizeof(*array))
#define MOD 1000000007
using namespace std;
using ll = long long;
const ll MAX = LLONG_MAX;
const ll MIN = LLONG_MIN;
typedef stack<ll> llStack;
typedef queue<ll> llQueue;
typedef vector<ll> llVector;
typedef list<ll> llList;
typedef stru... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<bool> > vvb;
typedef map<int, bool> mib;
typedef long long ll;
typedef vector<long long> vl;
typedef p... | 0 | 95,579,702 |
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
int n,i; cin >> n;
for ( i = 1;; i *= 2)
{
if (i * 2 > n)
break;
}
cout << i;
} | #include <bits/stdc++.h>
#ifndef LOCAL
#pragma GCC optimize(3)
#endif
using namespace std;
typedef long long ll;
const int maxn=1e5+100;
int n;
int len[maxn];
bool inq[maxn];
int spfa() {
queue<int> q;
memset(len, 0x3f3f, sizeof(len));
memset(inq, 0, sizeof(inq));
inq[1] = 1, len[1] = 1;
q.push(1);
... | 0 | 95,673,662 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char s[3];
cin>>s[0]>>s[1]>>s[2];
if(s[0]=='R' && s[1]=='R' &&s[2]=='R')
cout<<"3";
else if(s[0]=='R' && s[1]=='S')
cout<<"1";
else if((s[0]=='S' && s[1]=='R' && s[2]=='R')||(s[0]=='R' && s[1]=='R' && s[2]=='S'))
cout<<"2";
el... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmd... | 0 | 72,014,388 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cmath>
#inc... | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
bool check(int r, int c, vector<string>& strs, int n) {
for(int i = 0; i < n; i++) {
for... | 0 | 71,454,014 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define mod 1000000007
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define setA0(a) for(ull i =0;i<n;i++){a[i] = 0;}
#define aout(a) for(auto x : a){cout<<x<<' ';}
#define a... | #include<iostream>
using namespace std;
int vis[25][25];
void inti(){
for(int i=0;i<25;i++){
for(int j=0;j<25;j++){
vis[i][j]=0;
}
}
}
void dfs(int i,int j){
if(vis[i][j]==0 || vis[i][j]==2)return;
vis[i][j]=0;
dfs(i-1,j);
dfs(i,j-1);
dfs(i,j+1);
dfs(i+1,j);
}
int main(){
int w,h... | 0 | 8,496,889 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll ans ... | #include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | 0 | 42,885,602 |
#include <bits/stdc++.h>
#include <bitset>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define LOG(variable) cout << #variable":\t" << (variable) << endl
#define LOGCON(i, container) for(int (i) = 0; (i) < (container).size(); ++(i)) cout << (i) << ":\t" << (container)[(i)] << endl
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define R... | 0 | 87,112,955 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.