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;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rep(i,l,r) for(int i=(l);i<(r);++i)
char ch;
int qry(ll n) {
cout << "? " << n << endl;
fflush(st... | #include <bits/stdc++.h>
using namespace std;
#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++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a... | 0 | 66,924,345 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int N,K;
cin >> N >> K;
vector<int> A(N);
rep(i,N){
cin >> A[i];
}
while(K>0){
bool flg = true;
vector<int> B(N,0);
for(int i=0; i<N; i++){... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define P pair<long long,long long>
#define all(a) a.begin(),a.end()
#define INF 10000000000000000
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } r... | 0 | 56,916,051 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x, S = 0, min = 10e7;
bool c = true;
cin >> n >> m >> x;
vector<vector<int>> v(n, vector<int>(m + 1));
for(int i = 0;i < n;i++) {
for(int j = 0;j <= m;j++) {
cin >> v[i][j];
}
}
for(int i = 0;i < (1 << 12);i++) {
bitset... | #include <cstdio>
#include <cstdint>
#include <vector>
#include <algorithm>
using namespace std;
uint64_t n;
vector<uint64_t> a;
void solve() {
vector<uint64_t> sorted_a(n);
copy(a.begin(), a.end(), sorted_a.begin());
sort(sorted_a.begin(), sorted_a.end());
for (auto i : a) {
if (i == sorted_a[n... | 0 | 98,833,930 |
#include <stdio.h>
#include <ctype.h>
#define MAX 1202
#define alphaNum 26
int main(void){
int i;
char str[MAX];
int count[alphaNum] = {0};
while(fgets(str, MAX, stdin) != NULL){
for(i = 0; str[i] != '\n'; i++){
if(isalpha(str[i])){
if(isupper(str[i])){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
list<int> lst;
ios_base::sync_with_stdio(false);
int n;
cin >> n;
string query;
int key;
list<int>::iterator itr;
while(n--){
cin >> query;
if(query == "insert"){
cin >> key;
lst.push_front(key);
}
if(query == "delete"... | 0 | 67,549,054 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
using namespace std;
#define N 500000
int n;
int A[N+1];
int parent(int i){
return i/2;
}
int left(int i){
return 2*i;
}
int right(int i){
return 2*i+1;
}
int inside(int i){
if(i>=1&&i<=n) return 1;
else return 0;
}
int mai... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n,h;
h = 0;
cin >> n;
int n_cn = n;
for (int i = 0; i < 8; i++)
{
h += n_cn % 10;
n_cn /= 10;
}
if (!(n % h)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 0 | 92,348,000 |
#include <cstdio>
#include <algorithm>
using namespace std;
int n;
int main(){
scanf("%d",&n);
int a[n];
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
sort(a,a+n);
printf("%d",a[0]);
for(int i=1;i<n;i++) printf(" %d",a[i]);
printf("\n");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>v(n+1);
int dp[n+1]={INT_MAX};dp[1]=0;
for(int i=1;i<=n;i++)
cin>>v[i];
for(int i=2;i<=n;i++){
dp[i]=INT_MAX;
for(int j=1;j<=2;j++){
if(i>j){
dp[i]=min(dp[i],abs(v... | 0 | 54,758,626 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | #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 ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | 0 | 43,189,602 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t i64;
i64 calc(i64 K) {
if (K <= 9) return K;
deque<i64> q;
i64 v;
for (i64 i = 1; i <= 9; i++) {
q.push_back(i); K--;
}
while (true) {
v = q.front();
q.pop_front();
if (q.empty()) break;
i64 w = v % 10;
if (w >= 1 && K > 0... | #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 | 35,152,570 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <bits/stdc++.h>
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
#define check cout<<"?\n";
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main(){
io();
int n; cin >> n;
int ans = 0;
for(int i =... | 0 | 47,346,646 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;string S;cin>>N>>S;
if(S.substr(0,N/2)==S.substr(N/2,N/2+1))cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
int N, Q;
cin >> N >> Q;
vec<vec<int>> G(N);
rep(i, N - 1) {
int a, b;
c... | 0 | 16,495,514 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#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 per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | 0 | 17,077,520 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using namespace std;
pair<int,int> root (int x, vector<int> &g, int t) {
if (x == g.at(x)) {
return pair<int,int>(x,t);
}
else {
pair<int,int> k = root(g.at(x),g,t+1);
g.at(x) = k.first;
return k;
}
}
void connect(int a, int b, vector<int> &g) {
pair<int,int> m = root... | 0 | 92,678,637 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
namespace BasicMath {
static UInt GreatestCommonDivisor(UInt a, U... | 0 | 58,363,098 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int C[1001][1001];
string N1, N2;
int lcs()
{
int m = N1.size();
int n = N2.size();
int maxl = 0;
N1 = " " + N1;
N2 = " " + N2;
for (int i = 1; i <= m; i++)
C[i][0] = 0;
for (int i = 1; i <= n; i++)
C[0][i] = 0;
for (int i = 1; i <... | #include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
vector<int> A(N+1);
vector<int> B(N);
for(int i=0;i<N... | 0 | 71,216,228 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | #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 | 31,590,390 |
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int n;
typedef long long ll;
ll ans,a[60];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i){
cin>>a[i];
}
ll* p;
while(*(p=max_element(a+1,a+n+1)) >= (ll)n){
for(int i=1;i<=n;++i){
if(a+i!=p){
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2>... | 0 | 1,249,046 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
ll N,K;
ll a[100005];
int main(){
while(scanf("%lld%lld", &N,&K) && N||K){
for(int i=0;i<N;i++) scanf("%lld", &a[i]);
ll sum = 0, res;
for(ll i=0;i<K;i++) sum += a[i];
res = sum;
for(ll i=K;i<N;i++... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 47,833,364 |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define vi vector<ll>
#define pb push_back
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define pii pair<ll,ll>
#define vii vector<pii>
#defin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MS... | 0 | 76,800,590 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = 3 * max(max(a, b), c) - a - b - c;
cout << (d % 2 ? d / 2 + 2 : d / 2);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N, K;
cin >> N >> K;
vector<ll> a(N), sum(N+1, 0);
vector<ll> b;
for (int i = 0; i < N; i++) cin >> a[i];
for (int i = 0; i < N; i++) sum[i+1] = sum[i] + a[i];
for (int i = 1; i <= N; i++) {
for (int j... | 0 | 93,412,822 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
sort(arr,arr+n);
cout<<arr[n-1]-arr[0]<<endl;
} | #include<iostream>
#include<cmath>
#include<numeric>
#include<functional>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<iomanip>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n;i++)
#define ll long long
#define INF 2147483647
using namespace std;
us... | 0 | 95,231,790 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m, min, max, a[300], ans;
while (1){
int t = 0;
cin>>m>>min>>max;
if(m == 0 && min == 0 && max == 0){
break;
}
for(int i = 1; i <= m; i++){
cin>>a[i];
}
for(int i = min; i <= max; i++){
if(a[i] - a[i + 1] >= t){
t = a[i ] - a[i + ... | #include <iostream>
#include <algorithm>
using namespace std;
const int INF = 100000000;
int main()
{
while(true){
int n;
cin >> n;
if(n==0)
break;
int T[10][10];
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
if(i==j){
T[i][j] = 0;
}
else{
T[i][j] = INF;
}
}
}
int m... | 0 | 92,562,098 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include "bits/stdc++.h"
#include <unordered_set>
#define rep(i,n) for(ll i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define vll vector<vector<long long>>
#define vl vector<long long>
#define vi vector<int>
#define vii vector<vector<int>>
#define pb push_back
#define p... | 0 | 49,443,109 |
#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= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
bool flg=true;
ll k,x;
cin >>k>>x;
if(500*k<x)flg=false;
if(flg)puts("Yes")... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | 0 | 67,873,503 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int N = S.size();
vector<bool> a(26, false);
rep(i, N) {
a[S[i] - 'a'] = true;
}
rep(i, 26) {
if (a[i]) continue;
cout << S << (c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
#define pb push_back
#define ff first
#define ss second
#define SIZE 200001
#define INF int(2e9 + 9)
#define BIG_INF 1e18 + 9
#define acmpIN "input.txt"
#define acmpOUT... | 0 | 95,817,761 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define MOD 1000000007
const int N = 100005;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.ti... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
int main() {
int N ,K;
cin >> N >>K;
vector<int>A(N+1, 0);
rep(i, 0, N){
int index = 0;
cin >> index;
... | 0 | 99,955,994 |
#include <bits/stdc++.h>
namespace org{
template<class T>
T make_value(){
T tmp;
return tmp;
}
template<class T>
T VALUE(){
T tmp;
std::cin >> tmp;
return tmp;
}
template<class T>
std::vector<T> make_vector(long long size){
std::vector<T> t... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int N_MAX = 100;
typedef pair<int,int> P;
int main()
{
int n,i,j=0,res=0;
P r[N_MAX],b[N_MAX];
vector<int> v={};
vector<int>::iterator it;
cin >> n;
for(i=0;i<n;i++)
cin >> r[i].first >> r[i].second;
for(i=0;i<n;i++)
cin ... | 0 | 44,097,681 |
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
ll a,b,c,d; cin >... | #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(){
string N;
int K, l;
cin >> N >> K;
l = N.size();
vector<int> n(l);
rep(i,l) n[i] = N.at(i) - '0';
vector... | 0 | 97,600,442 |
#include <iostream>
using namespace std;
int main(void){
int a, b;
while(1){
cin >> a >> b;
if(a == 0 && b == 0){
break;
}
cout << min(a,b) << " " << max(a,b) << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const int MAX = 100005;
long long X[MAX], Y[MAX];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) scanf("%lld", &X[i]);
for (int i = 0; i < m; i++) scanf("%lld", &Y[i]);
long long x, y;
x =... | 0 | 10,048,106 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=s; i<=(long long)(n);i++)
#define repr(i,s,n) for(long long i=s;i>=(long long)(n);i--)
typedef long long ll;
const ll inf = 1e9+7;
const ll mod = 1e9+7;
int ma... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define mod 998244353LL
#define IN freopen("C.in","r",stdin)
#define OUT freopen("output.txt","w",stdout)
#define ... | 0 | 59,831,049 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <valarray>
#include <algorithm>
#include <time.h>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <random>
int main(void) {
std::vector<int> dice1(6);
for (int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout<<#var<<"="<<var<<endl;
#define dup(x,y) (((x)+(y)-1)/(y))
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int,int... | 0 | 63,110,951 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
#define vt vector
#define pq priority_queue
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
const int MOD =... | #include<bits/stdc++.h>
#define N 400005
#define ll long long
using namespace std;
int n,m;
int head[N],ver[N],nxt[N],tot;
void add(int a,int b)
{
tot++;nxt[tot]=head[a];head[a]=tot;ver[tot]=b;return ;
}
int v[N];
int cnt,flag,sz,szz,tp;
void dfs(int x,int c)
{
cnt++;v[x]=c;
for(int i=head[x];i;i=nxt[i])
... | 0 | 1,997,719 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, T;
cin >> n >> T;
vector<int> t(n);
rep(i, n) cin >> t[i... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#define MAX_N 50
using namespace std;
int C[MAX_N][26];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
for (int j = 0; j < s.size(); ++j) {
++C[i][s[j] - 'a'];
}
}
string res = ... | 0 | 60,469,012 |
#include <bits/stdc++.h>
#define N 200010
using namespace std;
typedef long long ll;
char *p1, *p2, buf[100000];
#define nc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1 ++ )
int rd() {
int x = 0, f = 1;
char c = nc();
while (c < 48) {
if (c == '-')
f = -1;
c = nc();
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
#include <chrono>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
typedef long long ll;
typedef pair<ll, ll> pii;
typedef tree<int, null_type,less<int>, rb_tree_tag, tree_order_sta... | 0 | 81,441,803 |
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, X, T;
cin >> N >> X >> T;
for (int i = 1; i < 1e5 + 5; i++) {
if(N <= X * i) {
cout << T * i;
break;
}
}
return 0;
} | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long N, M;
int main(int argc, char* argv[... | 0 | 80,597,747 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int const INF = 1e9;
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int H, N; std::cin >> H >> N;
std::vector<int> A(N), B... | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, a) for(int i=0;i < (int)(a); i++)
#define rep(i, a, b) for(int i=(a);i < (b); i++)
int main(){
int N, M, i,j, a, b;
cin >> N >> M;
vector<vector<int>> to(N+1, vector<int>(N+1, 0));
rep0(i, M){
cin >> a >> b;
to[a][b] = 1;
to[b][a] = 1;
... | 0 | 7,972,247 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N, M; cin >> N >>... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define debug(a) cout << #a << " = " << a << endl;
#define endl "\n"
#define MOD (int) 1e9+7
#define inf (int) (1e18)
void solve(){
ll n;
cin>>n;
... | 0 | 87,831,971 |
#include<bits/stdc++.h>
#define prArr(Arr,n) for(int _=0;_<n;_++) cout<<(Arr)[_]<<" ";
#define f first
#define s second
using namespace std;
const int INF=(int)0x3f3f3f3f;
const int MOD=(int)1e9+7;
const double eps=1e-9;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int cnt2=0;
ve... | #include<cstdio>
#include<iostream>
using namespace std;
bool judge(string s1, string s2) {
for (int i = 0; i < s1.size(); i++) {
if (s1[i] < s2[i]) {
return true;
} else if (s1[i] > s2[i]) {
return false;
}
}
return false;
}
int main(void) {
int N, L;
scanf("%d %d", &N, &L);
string S[100];
for (int ... | 0 | 49,513,694 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc129_c.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | #include <iostream>
#include <vector>
using namespace std;
struct UnionFind {
vector<int> par;
vector<int> sizes;
UnionFind(int n) : par(n), sizes(n, 1) {
for (int i = 0; i < n; i++) par[i] = i;
}
int find(int x) {
return x == par[x] ? x : par[x] = find(par[x]);
}
void unite(int x, int y) {
x ... | 0 | 80,176,994 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define int ll
#define _GLIBCXX_DEBUG
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define REPD(i,n) for (int i = (n-1); i >= 0; --i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define debug(x) cerr << #x <<... | 0 | 43,851,148 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
int x,t; cin >> x >> t;
if(x<t){
cout << "0" << "\n";
return 0;
}
else{
cout << (x-t) << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> l4;
typedef pair<double, double> dd;
#define mp make_pair
#define pb push_back
#define debug(x) cerr << #x << " = " << x << " "
ll product(l4 a, l4 b)
{
return a.first*b.second-a.second*b.first;
}
ll le... | 0 | 12,922,441 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed power(int x, int n)
{
if(n==0)
return 1;
else if(n%2==0)
return pow((x*x),n/2);
else
return (x*pow((x*x),n/2));
}
signed main()
{
int n,k;
cin>>n>>k;
cout<<k*power(k-1,n-1);
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double... | 0 | 94,425,058 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
ll ans = 0;
for (ll i = 1; i < N+1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
struct Node {
int key;
Node *next, *prev;
};
Node *nil;
void init() {
nil = new Node;
nil->prev = nil;
nil->next = nil;
}
void insert(int key) {
Node *node = new Node;
node->key = key;
nil->next->prev = node;
node->next = nil->next;
... | 0 | 7,479,993 |
#include <stdio.h>
#include <stack>
#include <math.h>
using namespace std;
int main(){
int n,tmp;
scanf("%d",&n);
int L[n],length = 0;
for(int i=0; i < n; i++){
scanf("%d",&tmp);
if(i == 0){
L[0] = tmp;
}else{
if(L[length] < tmp){
length++;
L[length] = tmp;
}else{
for(int k = 0; k <= leng... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
template<class T>
constexpr T INF = ::numeric_limits<T>::ma... | 0 | 13,903,334 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
long long int a;
cin >> a;
cout << a * (a-1) /2 ;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout<<#var<<"="<<var<<endl;
#define dup(x,y) (((x)+(y)-1)/(y))
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int,int... | 0 | 84,744,450 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int x = 1;
for (int i = 0; i < N; i++) {
if( x * 2 <= x + K ){
x *= 2;
}
else {
x += K;
}
}
cout << x <<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | 0 | 17,343,839 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(V) (V).begin(),(V).end()
#define MOD 1000000007
#define mod 998244353
int rw[100010];
vector<int> W[100010];
int main(){
for (int i = 0;i < 100010;i++)rw[i] = -1;
ll N, L;
cin >> N;
vector<ll> X(N);
for (int i = 0;i < N;i++)
cin >> X[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const ... | 0 | 82,643,647 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cmath>
using namespace std;
namespace Solver {
int N;
vector<string> a, b;
inline void Read() {
cin >> N;
a.resize(N);
b.resize(N);
for (int i = 0; i < N; i++) cin >> a[i] >>... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int MAXN = (int)1e5 + 5;
vector<int> adj[MAXN];
int arr[MAXN];
int n;
bool dfs(int v, int pr) {
vector<int> vv;
ll k = arr[v... | 0 | 74,605,085 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
for(int i = 0; i <= n / 4; i++) {
for(int j = 0; j <= n / 7; j++) {
if(4 * i + 7 * j == n) {
printf("Yes\n");
return 0;
}
}
}
printf("No\n");
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using lint = long long;
const lint INF = 1e18;
int N, K;
vector<lint> a, asum, bsum;
int main() {
cin >> N >> K;
a.resize(N + 1);
asum.resize(N + 1);
bsum.resize(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i]... | 0 | 47,364,703 |
#include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#defi... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
typedef long long ll;
typedef long double ld;
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define P... | 0 | 85,372,147 |
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <list>
#include <queue>
#include <set>
using namespace std;
bool check[30][30] = { false };
int movex[] = { 0, 1, 0, -1 };
int move... | #include <bits/stdc++.h>
using namespace std;
int connectedCount(int node, vector<set<int>>& graph, vector<int>& visited)
{
if(visited[node])
return 0;
int ret = 1;
visited[node] = 1;
for(auto& child: graph[node])
{
if(visited[child] == 0)
ret += connectedCount(child, graph, visited);
}
return ret;
}
int... | 0 | 57,468,436 |
#include <iostream>
using namespace std;
int main() {
string stra;
cin >> stra;
for(int i=0;i<5;i++){
cout << stra[i];
}
cout << " ";
for(int i=6;i<13;i++){
cout << stra[i];
}
cout << " ";
for(int i=14;i<=18;i++){
cout << stra[i];
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int N, K, s;
ll sum, ans;
#include <bits/stdc++.h>
using namespace std;
string to_string(string s)
{
return '"' + s + '"';
}
string to_string(const char *s)
{
... | 0 | 52,965,352 |
#include<iostream>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, m, a[2009], b[2009];
ll dp[2009][2009], mod=1e9+7;
int main()
{
IO;
cin>>n>>m;
for(int i=1; i<=n; i++)
cin>>a[i];
... | #include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <limits>
#include <string>
#include <bitset>
#include <functional>
using namespace std;
using lint = long long;
using pii = pair<int, int>;
using vec = vector<int>;
usin... | 0 | 60,770,001 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 800;
int c[maxn], s[maxn], f[maxn];
int main() {
int n;
cin >> n;
for(int i= 0; i < n - 1; ++i) cin >> c[i] >> s[i] >> f[i];
for(int i = 0; i < n - 1; ++i){
long long now = s[i] + c[i];
for(int j = i + 1; j < n - 1; ++j){
long long need = max( (l... | #include <bits/stdc++.h>
#define int long long
#define gcd __gcd
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define deci(x,y) fixed<<setprecision(y)<<x
#define PI 3.141592653589793238
... | 0 | 56,039,097 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 1e6 + 7... | #include <cstdio>
using namespace std;
int W, H;
const int SIZE = 20;
char f[SIZE + 1][SIZE + 1];
bool c[SIZE][SIZE];
int dfs(int x, int y){
if(x < 0 || y < 0 || x >= W || y >= H) return 0;
if(c[y][x] || f[y][x] == '#') return 0;
c[y][x] = true;
return 1 + dfs(x + 1, y) + dfs(x, y + 1) + dfs(x - 1, y) + dfs(x, y - ... | 0 | 34,357,665 |
#include<bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#define Scll3(x,y,z) scanf("%llu%llu%llu",... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
const ll INF = 1000000009;
int main() {
ll N;
ll D;
ll A;
cin >> N >> D >> A;
vector<pair<ll, ll>> Monster(N);
re... | 0 | 77,927,386 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using ll = long long;
using namespace std;
void solve() {
string s, t;
cin>>s>>t;
for (int i =0;i<s.size();i++) {
if(s==t){
cout<<"Yes"<<'\n';
return;
}
s = s.substr(... | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<... | 0 | 99,379,566 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(vec) vec.begin(), vec.end()
#define tmax(x,y,z) max((x),max((y),(z)))
#define tmin(x,y,z) min((x),min((y),(z)))
typedef long long ll; ll MM = 1000000000;ll mod = MM + 7; ll MMM=9223372036854775807;
ll GCD(ll x, ll y) {if (y =... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B... | 0 | 83,244,559 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<iomanip>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#define debug(x) cout<<(#x)<<"="<<(x)<<", ";
#defin... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 0 | 70,392,514 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
int main()
{
int n, x;
while (true) {
std::cin >> n >> x;
if (n == 0 && x == 0) {
break;
}
int ret = 0;
for (int i = 1; i <= n - 2; ++i) {
for (int j = i + 1; j <= n - 1;... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
#include<queue>
#include<bitset>
using namespace std;
int main() {
int a, b, c, d;
cin >>... | 0 | 76,687,679 |
#include <stdio.h>
int main(void)
{
int H, W;
while (1) {
scanf("%d %d", &H, &W);
if (H == 0 && W == 0) break;
else {
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (j == W - 1) printf("#\n");
else printf... | #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, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> nums;
int now = 1;
int cnt = 0;
rep(i,n) {
if (s[i]-'0' == now) cnt++;
... | 0 | 9,638,038 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, K, R, S, P, ans = 0;
string T;
cin >> N >> K >> R >> S >> P >> T;
vector<char> A(N);
map<char, char> mp = {{'r', 'p'}, {'s', 'r'}, {'p', 's'}};
map<char, int> score = {{'r', R}, {'p', P}, {'s', S}};
for (int i = 0; i < N; i++)
{
i... | #include <bits/stdc++.h>
#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 mp make_pair
typed... | 0 | 72,627,373 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long>X(N);
vector<long long>Y(N);
vector<long long>Z(N);
for (int i = 0;i<N;++i) {
cin >> X[i] >> Y[i] >> Z[i];
}
long long ans = 0;
for (int i = 0;i <(1<<3);++i) {
vector<long long>P(N);
for (int j = 0;j<N;++... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
int i=0,j=0;
int cnt=0;
while(i<3 && j<3)
{
if(s[i]==t[j])
cnt++;
i++;
j++;
}
cout<<cnt;
} | 0 | 36,083,394 |
#include<iostream>
#include<queue>
#include<string.h>
using namespace std;
char map[1005][1005];
char map1[1005][1005];
int a[1005][1005];
int m,n,q,num=0;
int main()
{
int x,y;
cin>>m>>n>>q;
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
cin>>map[i][j];
if(map[i][j]=='S')
{
x=i;
y=j;
ma... | #include<bits/stdc++.h>
using namespace std;
#define FastRead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl "\n"
#define sq(x) ((x)*(x))
#define pi acos(-1.0)
#define NUM 1000005
typedef long long ll;
int main()
{
FastRead
ll n, k,mx = -1, gcd;... | 0 | 3,940,272 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
vector<int> a(n);
for ( int i=0; i<n; i++ ) cin >> a[i];
sort(a.rbegin(),a.rend());
int ans=0;
for ( int i=0; i<k; i++ ) ans+=a[i];
cout << ans << '\n';
return 0;
} | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 0 | 15,102,091 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string c ;
bool check = false ;
cin >> c ;
for ( int i = 0 ; i < c.size() ; i++ ){
if (c.at(i)!='a' && c.at(i)!='i' && c.at(i)!='u' && c.at(i)!='e' && c.at(i)!='o' ){
check = true ;
break;
}
}
if (check)
cout << "consonant" <... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | 0 | 74,451,875 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n,i;
cin>>n;
ll pow[33];
pow[0]=1;
for(i=1;i<33;i++){
pow[i]=pow[i-1]*2;
}
ll z[n],w[n];
int flag=-1;
for(i=0;i<n;i++){
ll x,y;
cin>>x>>y;
z[i]=... | #include <bits/stdc++.h>
using namespace std;
typedef long long llong;
#define MAX 200000
#define NIL -1
struct Node {int parent, left, right;};
Node T[MAX];
int n, Depth[MAX];
void rec(int node,int parent){
Depth[node] = parent;
if(T[node].right != NIL){
rec(T[node].right,parent);
}
if(T[node].... | 0 | 89,497,644 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long n,r=0,g=0,b=0;
string s;
cin >> n;
cin >>s;
for(int i=0;i<n;i++){
if(s[i]=='R') r++;
else if(s[i]=='G') g++;
else b++;
}
long long ans=r*g*b;
for(int i=0;i<n;i++){
for(int j=1;i+j*2<n;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, cnt = 0, ans = 0;
int a, b, k;
cin >> k >> a >> b;
for (int i = a; i <= b; ++i) {
if (i % k == 0) {
cout << "OK" << endl;
return 0;
... | 0 | 35,266,016 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3, y3, x4, y4;
int difx, dify;
difx = abs(x1-x2);
dify = abs(y1-y2);
if (x1 > x2){
if (y1 > y2){
x3 = x2 + dify;
y3 = y2 - difx;
x4 = x1... | #include "bits/stdc++.h"
#define REP(i,n) for(int i=0;i< (n);i++)
#define REPR(i, n) for(int i = (n);i >= 0;i--)
#define FOR(i, m, n) for(int i = (m);i < (n);i++)
#define FORR(i, m, n) for(int i = (m);i >= (n);i--)
#define SORT(v, n) std::sort(v, v+n);
#define VSORT(v) std::sort(v.begin(), v.end());
#define VRSORT(v) s... | 0 | 81,205,777 |
#include<iostream>
using namespace std;
static const int MAX = 2000000;
int n;
int C[MAX];
void CountingSort(int A[], int B[], int k) {
for (int i = 0; i <= k; i++) {
C[i] = 0;
}
for (int j = 1; j < n + 1; j++) {
C[A[j]] += 1;
}
for (int i = 1; i <= k; i++) {
C[i] = C[i - 1] + C[i];
}
for (int j = n; j > 0... | #include<iostream>
int cnt[100005];
const long long mod = 998244353;
int max_val = 0;
long long ans = 1;
long long mpow(int a, int b) {
if (!a) return 0LL;
if (!b) return 1LL;
return b%2 ? (long long)a * mpow(a, b-1) % mod : mpow((long long)a*a%mod, b/2);
}
int main(void) {
int n;
std::cin >> n;
for (int i = 0; i... | 0 | 94,896,474 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
A--; B--;
vector<string> res(100, string(50, '.') + string(50, '#'));
int i=0;
int j=0;
while(B>0){
res[i][j] = '#';
B--;
if(j==48){ j=0; i+=2;}
else { j+=2;}
}
i=0... | #include<iostream>
using namespace std;
int main(){
int N;
bool num[10];
for(int i=0;i<4;i++){cin>>N;num[N]=true;}
if(num[1]&&num[9]&&num[7]&&num[4])cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
} | 0 | 46,605,651 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | 0 | 2,621,216 |
#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, k;
cin >> n >> k;
if(n==1) {cout << k << endl; return 0;}
ll ans = k;
rep(i,n-1){
ans*=(k-1);
}
co... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
set<int> chair;
for(int i=0;i<n;i++){
int l,r;
cin>>l>>r;
for(int i=l;i<=r;i++){
chair.insert(i);
}
}
cout<<chair.size()<<endl;
return 0;
} | 0 | 16,316,971 |
#include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#pragm... | #include <bits/stdc++.h>
const int M = 1e4+10;
using namespace std;
int cnt;
vector<int> arr,vec[M];
set<int> st;
int in[M];
void go(){
while(!st.empty()){
int u=*st.begin();
st.erase(st.begin());
arr.push_back(u);
cnt++;
for(int i=0;i!=vec[u].size();i++){
in[vec[u][i]]--;
if... | 0 | 79,349,843 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,h[20],cnt=1;
cin>>n;
for(int i=0;i<n;i++) cin>>h[i];
for(int i=1;i<n;i++){
bool ok=true;
for(int j=0;j<i;j++) if(h[j]>h[i]) ok=false;
if(ok==true) cnt++;
}
cout<<cnt<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct Graph {
int n;
int time;
vector<vector<int>> g;
vector<int> num, low;
vector<vector<int>> scc;
stack<int, deque<int>> S;
vector<bool> inS;
Graph(int n) : n(n), g(n), num(n, -1), low(n, -1), inS(n, false) {}
void addEdge(int u, int v) {
g[u].push... | 0 | 53,290,091 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
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 rall... | #pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("-ffloat-store")
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for(i=0;i<(n);++i)
#define repA(i,j,n) for(i=(j);i<=(n);++i)
#define repD(i,j,n) for(... | 0 | 33,733,402 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#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 K, X;
cin >> K >> X;
if (500*K >= X) cout << "Yes" << endl;... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 0 | 86,026,982 |
#include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return re... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define F... | 0 | 7,102,820 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | #include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x)... | 0 | 98,549,587 |
#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, M;
cin >> N >> M;
vector<int> a(N), b(N), c(M), d(M);
rep(i,N) cin >> a.at(i) >> b.at(i);
rep(i,M) cin >> c.at(i) >> d.at(i);
rep(i,N) {... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
int n,sum=0;cin>>n;
vector<int> a(n);
rep(i,n){
... | 0 | 60,460,081 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define int long long
#define f0(n) for(int i=0;i<n;i++)
#define ms(x) memset(x,0,sizeof(x))
#define ms2d(x,m... | 0 | 83,744,076 |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<iomanip>
#include<set>
#include<unordered_map>
using namespace std ;
#define MAXN 300007
int n ;
long long a[ MAXN ] ;
pair < long long , int > b[ MAXN ] ;
lo... | 0 | 65,474,524 |
#include <algorithm>
#include <iostream>
using namespace std;
long long count(long long n) {
return n < 5 ? 0 : count(n / 5) + n / 5;
}
int main() {
long long n; cin >> n;
cout << (n % 2 == 0 ? count(n / 2) : 0) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pii;
typedef vector<ll> Vi;
typedef vector<Vi> VVi;
const double EPS = (1e-7);
const ll INF =(1e13);
const double PI = (acos(-1));
const ll MOD = ll(1e9) + 7;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ... | 0 | 79,104,606 |
#include <iostream>
using namespace std;
#define x 1000000
int main(){
bool q[x];
for(int i=2;i<x;i++) q[i] = true;
for(int i=2;i<x;i++) if(q[i]) for(int j=2;j<=x/i;j++) q[i*j] = false;
int n;
while(cin >> n){
int a = 0;
for(int i=2;i<=n;i++) if(q[i]) a++;
cout << a << endl;
}
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
int main() {
int h,w;
cin >> h >> w;
rep(i,h){
vector<char>c(w);
rep(j,w){
cin >> c[j];
... | 0 | 39,323,962 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
const string M = "Male", F = "Female", V = "Vacant";
string ask(ll i){
cout << ... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 | 72,670,979 |
#include<iostream>
#include<cstdlib>
#include<string>
#include<vector>
#include<map>
#include<unordered_map>
#include<queue>
#include<algorithm>
#include<iomanip>
#include<typeinfo>
#include<complex>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for(ll i = a;i < b; i++)
co... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define fill(a,b) memset(a,b,sizeof(a))
#define f first
#define s second
#define pb push_back
#define inf 1e17
#define ninf -1*1e17
#define mod 1000000007
#define N 500005
#define Ns... | 0 | 98,321,346 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
ll k;
cin>>k;
for(int i=0;i<s.size();i++){
if(s[i]=='1')k-=1;
else k=0;
if(k==0){cout<<s[i];return 0;}
}
} | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); ++i)
#define outl(x) cout<< (x) << '\n'
#define fi first
#define se second
using pii = pair<int,int>;
using ll = long long;
using vi = vector<int>;
i... | 0 | 49,056,125 |
#include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint n;
vector<int> u, v;
lint vertice_count() {
lint res = 0;
for (lint i = 0; i < n; i++) {
res += (i + 1 - 0) * (n - i);
}
return res;
}
lint edge_count(int l, int r) {
if (l > r) {
swap(l, r);
}
return ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int q; cin >> q;
while(q--) {
ll a, b; cin >> a >> b;
if(a > b) swap(a, b);
if(a == b || a + 1 == b) {
cout << 2 * a - 2 << endl;
} else {
ll c = sqrt(a * b);
if(c... | 0 | 44,264,677 |
#include <iostream>
using namespace std;
int main(int argc, char* argv[])
{
int a, b, c, d, n, count;
while(cin >> n){
count = 0;
for(a = 0; a <= 9; a++){
for(b = 0; b <= 9; b++){
for(c = 0; c <= 9; c++){
for(d = 0; d <= 9; d++){
if((a + b + c + d ) == n){
count++;
break;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | 0 | 11,824,930 |
#include <bits/stdc++.h>
using namespace std;
long long color(int n, int k) {
if (n == 1) return k;
else return color(n - 1, k) * (k - 1);
}
int main() {
int n, k;
cin >> n >> k;
cout << color(n, k);
} | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e9;
const long long int mod = 1e9+7;
typedef pair<ll,ll> pairs;
vector<pairs> p;
ll gcd(ll a,ll b){
if (a%b==0)return(b);
else return(gcd(b,a%b));
}
ll keta(ll N){
int tmp{};
while(... | 0 | 71,192,715 |
#include <cstdio>
#include <string>
#include <memory>
#include <array>
template<typename T>
class Data;
template<typename T>
using Data_ptr = std::unique_ptr<Data<T>>;
template<typename T>
class Data {
public:
Data(T value) :
value{ value },
nextData{},
prevData{} {
}
void insert(T v... | #include <iostream>
using namespace std;
int main() {
int n;
int a[5000];
while(cin >> n) {
if(n==0)
break;
for(int i=0; i<n; i++) {
cin >> a[i];
}
int max=a[0];
for(int i=0; i<n; i++) {
int t=0;
for(int j=i; j<n; j++) {
t+=a[j];
if(t>max)
max=t;
}
}
cout << max << endl;
}
... | 0 | 60,213,084 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
int main() {
int N, K;
cin >> N >> K;
cout << N-K+1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (... | 0 | 42,135,490 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | #include <bits/stdc++.h>
using namespace std;
const int N = 105;
long long memo[N][2][4];
string s;
long long solve (int i , bool less , int rem) {
if (rem == 0)
return 1;
if (i == s.size())
return 0;
long long &ret = memo[i][less][rem];
if (~ret)
return ret;
ret = 0;
int... | 0 | 23,365,409 |
#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... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | 0 | 73,607,894 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 100... | #include <iostream>
#include <stdlib.h>
using namespace std;
int oh[4][3][10]={};
int main(){
int n;
cin >> n;
int b,f,r,v;
for(int i=0; i<n; i++){
cin >> b >> f >> r >> v;
oh[b-1][f-1][r-1] += v;
if(oh[b-1][f-1][r-1] < 0){
oh[b-1][f-1][r-1] = 0;
}else if(oh[b-1][f-1][r-1] > 9){
oh[b... | 0 | 85,193,341 |
#include <iostream>
#include <string>
#include <queue>
int a[1005][1005];
bool tf[1005][1005];
int p[10][2];
int dirc[4][2] = {{-1 , 0} , {1 , 0} , {0 , -1} , {0 , 1}};
int w , h , n;
struct node{
int x , y , step;
};
int bfs(int st_y , int st_x , int en_y , int en_x){
for(int i = 0;i < h;i++){
for(int ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
if(n>=1800)
cout<<"1"<<endl;
else if(n>=1600)
cout<<"2"<<endl;
else if(n>=1400)
cout<<"3"<<endl;
else ... | 0 | 1,443,236 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.... | #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;
const int inf = 1000000000;
const int MOD = 1e9+7;
const double PI = 3.141592653589793238... | 0 | 34,053,908 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uni... | 0 | 21,488,258 |
#include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a,b,c,d;
cin >> a... | #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 | 55,668,762 |
#include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);
int x;
cin>>x;
if(x<600) cout<<8;
else if(x>=600&&x<800) cout<<7;
else if(x>=800&&x<10... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 76,882,192 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
int N;
vector<long long> A;
void solve() {
vector<long long> plus, minus;
for (int i = 0; i < N; ++i) {
if (A[i] >= 0) plus.push_... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | 0 | 6,075,879 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.