code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main()
{
int n, m, x, y; cin >> n >> m >> x >> y;
string ans = "No War";
int z = x + 1, xi, yi;
for(int i = 0; i < n; i++){
cin >> xi;
if(xi >= z) z = xi + 1;
}
for(int i = 0; i < m; i++){
cin >> yi;
if(yi < z) ans = "W... | #include<iostream>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int a[m];
int num=0;
for(int i=0;i<m;i++){
cin>>a[i];
num+=a[i];
}
if(n-num>=0)
cout<<n-num<<endl;
else
cout<<-1<<endl;
return 0;
} | 0 | 88,802,731 |
#include"bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (A == B && B == C ? "Yes" : "No") << endl;
return 0;
} | #include<bits/stdc++.h>
#include<string.h>
#define ll long long
#define pf printf
#define sf scanf
#define ff first
#define ss second
#define clr clear()
#define sz size()
#define pb push_back
#define mk make_pair
#define pi acos(-1)
#define inf 20000000000000000
#define mod 998244353
#define ull unsigned long long int... | 0 | 2,122,661 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll ans = 0, sum = 0;
rep(i, n) {
int a;
cin >> a;
sum += a;
if (a == 0) {
ans += sum / 2;
sum = 0;
... | 0 | 78,110,186 |
#include <iostream>
int main()
{
const int end_input = 0;
int case_count = 1;
while (1) {
int input;
std::cin >> input;
if (input == end_input) break;
std::cout
<< "Case " << case_count << ": "
<< input << std::endl;
++case_count;
}
return 0;
} | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LC... | 0 | 38,673,343 |
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int a[100005];
int main(){
std::ios::sync_with_stdio(false);
int a,b,k,cot=0;
cin>>a>>b>>k;
for(int i=min(a,b);i>=1;i--){
if(a%i==0&&b%i==0){
cot++;
}
if(k==cot){
... | #include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<iomanip>
#include<utility>
#include<string>
#include<map>
#include<unordered_map>
#include<queue>
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
tem... | 0 | 56,395,195 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define debug(x) cerr<<#x<<": "<<x<<endl;
#define MOD 1000000007ULL;
#define rep(i,n) for(int i=0;i<n;i++)
const int INF= 1001001001;
vector<i... | #include <iostream>
#include <stack>
#include <queue>
using namespace std;
#define MAX 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
int T;
int N;
int M[MAX][MAX];
int C[MAX],D[MAX];
void bfs(int s)
{
queue<int> *q = new queue<int>;
q->push(s);
D[s] = 0;
C[s] = GRAY;
while(!q->empty())
{
... | 0 | 24,594,578 |
#include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debugg cout<<"debugged\n";
#define minva... | #include<bits/stdc++.h>
using namespace std;
int main(){
int i, j, k, l;
int n, Y, M, D, x, count = 0;
cin>>n;
for(l = 0; l < n; l++){
cin>>Y>>M>>D;
count = 0;
for(i = Y; i < 1000; i++){
if(i == Y) j = M;
else j = 1;
for(; j <= 10;j++){
if(j%2 == 1) x = 20;
else x = 19;
if(i%3 == 0)x = 20... | 0 | 64,564,777 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int x[n][d];
for(int i = 0; i < n; i++){
for(int j = 0; j < d; j++){
cin >> x[i][j];
}
}
int out = 0;
for(int i = 0; i < n - 1; i++){
for(int j = i + 1; j < n; j++){
double distance = 0;
for(int k = 0; k < d; k++){... | #include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#in... | 0 | 50,621,906 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll ans=0; string s; cin>>s;
char state = ' ';
ll rep = 0;
int n=s.size()+1;
vector<int> left(n,0);
vector<int> right(n,0);
for (int i=0; i<=s.size(); i++){
if(s[i]=='<'){
left[i+1]=left[i]+1;
... | #include <stdio.h>
int main(void)
{
int a,b;
scanf("%d\n",&a);
scanf("%d\n",&b);
if(a < b){
puts("a < b");
}
else if(a > b){
puts("a > b");
}
else{
puts("a == b");
}
return 0;
} | 0 | 60,847,339 |
#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;
string s, t;
cin >> s >> t;
int cnt = 0;
rep(i, N) {
if (s[i] != t[cnt]) cnt = 0;
if (s[i] == t[cnt]) ++cnt;... | #include <iostream>
#include <cmath>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
typedef vector<vector<int> > Graph;
bool flag;
void dfs(Graph& g,int x,vector<int>& vec,int& count,int& ans){
vec[x]=1;
++count;
if(count==vec.size())++ans;
for(int i... | 0 | 51,636,984 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
long lon... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<ll, ll>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (ll i = begin; i < n; i++)
#define repe(i, begin, n) for (ll i = begin; i <= n; i++)
#define repr(i, begin, n) for (ll i = begin; i > begin - n; i--)
#define repre(i, begi... | 0 | 20,417,114 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
int dy[]={1,0,-1,0}... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x... | 0 | 77,996,475 |
#include <bits/stdc++.h>
using namespace std;
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
typedef long long ll;
typedef vector<int> vi;
ll mod = 1e9+7;
ll solve() {
int x, n, a; cin >> x >> n;
unordered_set<int> num_set;
rep(i, n) {
cin >> a;
num_set... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m; ... | 0 | 4,475,384 |
#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<bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)a, i##_len=(b); i<i##_len; i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define int long long
using namespace std;
using P = pair<int, int>;
using ll = long long;
... | 0 | 1,509,437 |
#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;
typedef long long ll;
typedef vector<long long> vl;
typedef vector<vector<long long>> vll;
typedef vector<char> vc;
typedef vector<vector<char>> vcc;
typedef vector<string> vs;
#define rep(i,n) for(ll i = 0; i < (ll) n; i++)
#define rep2(i,x,n) for(ll i = (ll) x; i < (ll) n... | 0 | 17,653,956 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(),... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX_A = 1e5+1;
int N, M;
void solve() {
cin >> N >> M;
vector<P> jobs(N);
for (int i = 0; i < N; ++i) {
int a, b;
cin >> a >> b;
jobs[i] = P(a, b);
}
sort(jobs.begin(), j... | 0 | 57,693,485 |
#include <bits/stdc++.h>
#define nl '\n'
using namespace std;
typedef long long ll;
void solve() {
int S;
cin >> S;
const int mod = 1e9 + 7;
vector<ll> dp(S + 1);
dp[0] = 1;
for (int i = 3; i <= S; i++) {
for (int j = 3; j <= i; j++)
dp[i] = (dp[i] + dp[i-j]) % mod;
}
cout << dp[S];
}
int main... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 998244353
using namespace std;
ll solve(vector<ll> &a) {
ll res = 0, n = a.size();
while(*max_element(all(a)) >= n) {
*max_element(all(a)) -= n + 1;
for(int i = 0; i < n; i++) {
a[i]++;
... | 0 | 68,848,439 |
#include <bits/stdc++.h>
#define rep2(i,m,n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
template <typename T>
T sq(T x){
return x * x;
}
signed main (){
string A,B,C;
cin >>... | #include <bits/stdc++.h>
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define RFOR(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define rep(i,n) FOR(i,0,(n))
#define REPS(i,n) FOR(i,1,(n)+1)
#define RREP(i,n) RFOR(i,0,(n))
#define rng(x) (x).begin(),(x).end()
#define rrng(x) (x).rbegin(),(x).rend()
#define debug(x) ... | 0 | 71,185,289 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define mod 1000000007
map<int,int> mi;
void bfs(list<int> v[],ll n,ll s)
{
vector<bool> visi(n+1,false);
queue<int> q;
q.push(s);
while(!q.empty())
{
s=q.front();
q.pop();
visi[s]=true;
list<int>::it... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long int> s(n);
s[0] = a[0];
long int result = 0;
long int temp = 0;
for (int i = 1; i < n; i++) {
i... | 0 | 54,934,701 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
#define re return
#define all(a) a.begin(),a.end()
#define int long long
using namespace std;
int a[10004],b[10004];
signed main()
{
int n;
cin>>n;
int m1=0,p2=0;
for (int i=0;i<n;i++){
cin>>a[i];
}
for (int i=0;i<n;i++){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#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 INF 1000000000
#define PB ... | 0 | 39,354,967 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
a.erase(unique(a.begin(), a.end()), a.end());
if(a.size() == n) ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#d... | 0 | 35,097,682 |
#include <iostream>
#include <queue>
using namespace std;
int main()
{
priority_queue<int> que;
int h;
for (int i = 0; i < 10; ++i) { cin >> h; que.push(h); }
int c = 0;
while (c < 3) {
cout << que.top() << '\n'; que.pop();
c++;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, odd, even;
cin >> n;
vi ocnt(100001);
vi ecnt(100001);
rep(i,n/2){
cin >> odd;
ocnt.at(odd) ... | 0 | 49,287,437 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int ctoi(char c) {return c-'0';}
int gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int lcm(ll a,ll b){return a*b/gcd(a,b);}
int main(){
int n;
cin >> n;
vector<int>a(n);
int ans =0 ;
for(int i=0;i<n;i++)cin >> a.at(i);
int che =1;
for(int i=1;i<n;i++){
if... | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a,... | 0 | 59,330,836 |
#include<bits/stdc++.h>
using namespace std;
char s[8008];
int ex, ey;
bool dp[2][16006];
vector<int> dv[2];
bool foo(int dist, vector<int> & mv) {
memset(dp,0,sizeof(dp));
int f = 0;
dp[0][8000] = true;
for(int x : mv) {
for(int i=0;i<=16000;i++) {
if(!dp[f][i]) continue;
dp[!f][i+x] = dp[!f][i... | #include<iostream>
using namespace std;
string rep(string s,int a,int b,string p);
string rev(string s,int a,int b);
void pri(string s,int a,int b);
int main(){
string code,k,p;
int n,a,b;
string haki;
getline(cin,code);
cin >> n;
getline(cin, haki);
for(int i = 0... | 0 | 26,040,518 |
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
int main()
{
string A,B;
cin>>A>>B;
ll lenA = A.size(),lenB = B.size();
if(lenA>lenB)puts("GREATER");
else if(lenA<lenB)puts("LESS");
else
{
for(int i=0; i<lenA; i++... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 68,664,181 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 84,206,758 |
#include <iostream>
int main() {
int n,i;
std::cin >> n >> i;
std::cout << n-i+1 << std::endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 10) + 1;
}
ll gcd(long long a,long long b) ... | 0 | 4,825,512 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, x;
cin >> n >> d >> x;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
while (cnt * a.at(i) + 1 <= d) {
cnt++;
}
ans += cnt;
}
cout <... | #include <bits/stdc++.h>
using namespace std;
long long m=1e9+7;
long long fact[1000001],inv[1000001];
long long modRecursive(long long a,long long b,long long c)
{
if(b == 0) return 1;
if(b%2 ==0) return modRecursive((a*a)%c,b/2,c);
else return ((a%c)*(modRecursive((a*a)%c,b/2,c)))%c;
}
int main()
{
string S;
... | 0 | 24,207,831 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n, k;
cin >> n >> k;
bitset<100000> bs;
cin >> bs;
vector<int64_t> p;
p.push_back(0L);
if (!bs[0]) ... | #ifdef BUILT_LOCAL
#include "niklib.h"
#endif
#include <iostream>
#include <utility>
#include <numeric>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <string>
#include <cstdio>
#include <map>
#include <cmath>
#include <set>
#include <list>
using namespace std;
typedef long long ll;
t... | 0 | 87,584,008 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#define REP(i,n) for(long long int (i)=0;(i)<(n);i++)
using namespace std;
int main(){
string str;
int n,h;
while(cin >> str){
if(str=="-")break;
cin >> n;
REP(i,n){
cin >> h;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 11,191,991 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
usi... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ld long double
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j ; i < k ; ++i)
#define rrep(i, j, k) for (int i = j; i > k; --i)
#define all(cont) cont.begin(), cont.end()
#define ra... | 0 | 59,540,580 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
vector<int> G[100 + 5];
int d[105];
bool travel[105];
int main()
{
cin.tie(0);
cin.sync_with_stdio(0);
int n;
cin >> n;
int u, k, now;
for (int i = 1; i <= n; ++i) {
cin >> u >> k;
wh... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(void){
int N,K,X,Y;
cin >> N >> K >> X >> Y;
int n=1;
int ans = 0;
while(n <= N){
if(n <= K){
ans += X;
}
else{
ans +... | 0 | 25,639,725 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
ll gcd(ll a,ll b){
if(a%b==0){return b;}
else{return gcd(b,a%b);}
}
ll lcm(ll a,ll b){
return a*b/gcd(a,b);
}
ll pow(ll x,ll y){
ll tmp=x,res=1;
w... | #include <bits/stdc++.h>
#include <ios>
#include <iomanip>
using namespace std;
long long MOD = 1e9+7;
int MAX_INT = 1e9;
long long gcd(long long a, long long b){
if(b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b;
}
long long modpow(long long x, long l... | 0 | 85,517,012 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll K,N,T;
void solve(){
cin>>N>>K;
ll ans = 0;
ll a[N];
for(ll i = 0 ; i<N ; i++){
cin>>a[i];
if(a[i] >= K)
ans++;
}
cout<<ans<<'\n';
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
} | #include <iostream>
#include <vector>
#include <set>
using namespace std;
int main(){
int N;
cin >> N;
vector<long long> a(N);
for(int i=0; i<N; ++i) cin >> a[i];
long long sum = 0;
long long xorsum = 0;
long long res = 0;
int right = 0;
for(int left=0; left<N; ++left){
while... | 0 | 67,899,204 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int t,x;
cin >> t >> x;
double ans;
ans = (double)t/x;
printf("%.12lf",ans);
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int m,f,r;
int sum;
while(cin >> m >> f >> r && (m != -1 || f != -1 || r != -1)) {
sum = m + f;
if(m == -1 || f == -1 || sum < 30)
cout << 'F' << endl;
else if(sum >= 80)
cout << 'A' << endl;
else if(sum >= 65 && sum < 80)
... | 0 | 52,474,090 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pii pair... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
vector<int64_t>a(N);
for(int i=0;i<N;i++)
cin>>a.at(i);
int64_t sum=0;
for(int i=0;i<N;i++)
sum+=a.at(i);
if(sum<K)
cout<<N<<endl;
else{
a.push_back(0);
sort(a.begin(),a.end());
int left=0;int right=N;
w... | 0 | 75,807,598 |
#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(); ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int fmt(string s)
{
int ret = 0;
... | 0 | 47,807,193 |
#include<stdio.h>
#include<string.h>
#include<ctype.h>
int main()
{
char a[1000],b[1000],c[10000];
int size=0,sp,i;
scanf("%s",&a);
scanf("%s",&b);
scanf("%s",&c);
a[0]=a[0]-32;
b[0]=b[0]-32;
c[0]=c[0]-32;
printf("%c",a[0]);
printf("%c",b[0]);
printf("%c",c[0]);
} | #include<bits/stdc++.h>
using namespace std;
int T;
long long a,b;
int main(){
ios::sync_with_stdio(false);
cin>>T;
while (T--){
cin>>a>>b;
if (b<a)swap(b,a);
long long l=sqrt(a*b-1);
long long r=l;
while (r&&r*(l+1)>=a*b)r--;
bool sig1=0,sig2=0,sig3=0;
... | 0 | 41,486,162 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i, n) for(int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
int ans;
bool sum = true;
if (s.size() <= t.size()) {
for (int i = 0; i < s.size(); i++) {
string st = s.substr(0, i) + t;
if (st.substr(0, s.size()) == s && st.substr(st.... | 0 | 74,877,862 |
#include <iostream>
#include <string>
int main() {
int a;
std::cin>>a;
if(a <1200){
std::cout<<"ABC";
}else if(a <= 3000){
std::cout<<"ARC";
}
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
#define inf 1e6+18
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define mod 1000000007
#define f1(i,n) for(i=1;i<=n;i++)
#define f0(i,n) for(i=0;i<n;i++)
#define w(x) while(x--)
const int maxn=100... | 0 | 3,992,823 |
#include <iostream>
#include <vector>
using namespace std;
void CountingSort(std::vector<int>& Input, std::vector<int>& Output, int Max);
int GetMax(std::vector<int>& Input);
void CountingSort(std::vector<int>& Input, std::vector<int>& Output, int Max)
{
Output.clear();
Output.resize(Input.size());
std::vec... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long li;
typedef pair<li, li> pii;
pii make_set(li x, li y) {
if (x < y) {
return make_pair(y, x);
} else {
return make_pair(x, y);
}
}
pii max_of(pii x, pii y) {
vector<li> vs = {x.first, x.second, y.first, y.second};
... | 0 | 30,255,030 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD=1000000000 + 7;
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(){
cout << setprecision(10);
int N;
... | 0 | 43,034,904 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i>=(b);... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000009
#define ll long long
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define set0(a) memset ((a), 0 , sizeof(a))
#define set1(a) memset((a),-1,sizeof (a))
#define pi pair<int, int>
#define ps pair<string, string>
#define pl... | 0 | 99,656,373 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
vector<int> a(5);
for(int i=0; i<5; i++){
cin >> a[i];
}
int p = 0;
int min = 10;
for(int i=0; i<5; i++){
if(a[i]%10 == 0){
p += a[i];
}
else{
if(a[i]%10 < min){
min = a[i]%10;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> as(n+1);
for(int i=0; i<n+1; i++) cin >> as.at(i);
vector<int> bs(n);
for(int i=0; i<n; i++) cin >> bs.at(i);
ll ans = 0;
for(int... | 0 | 11,319,261 |
#include <stdio.h>
#include <string.h>
int main() {
char a[11],b[11],c[11];
scanf("%s %s %s",&a,&b,&c);
int p = strlen(a), q = strlen(b);
if(a[p-1] == b[0] && b[q-1] == c[0]){
puts("YES");
}else{
puts("NO");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#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 fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
int main(void){
ll n, k;
cin >> n >> k;
ll a[n];
rep(i, 0, n){
... | 0 | 19,048,300 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 100 * 1000 + 100;
vector <int> adj[MAXN];
bool p = true;
int good[MAXN], mark[MAXN], cnt[3];
void dfs(int v, bool b) {
mark[v] = true;
good[v] = b;
for(int i : adj[v]) {
if(!mark[i])
dfs(i, !b);
else if(good[i] == good[v])
... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/format.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i =... | 0 | 66,028,025 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
int main() {
ll N,K; cin >> N >> ... | #include<bits/stdc++.h>
typedef long long int ll;
#define ull unsigned long long int
#define lld long double
#define endl "\n"
#define fi first
#define sec second
#define sp setprecision
#define lb lower_bound
#define ub upper_bound
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b)... | 0 | 35,744,300 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX;
#define INFL LLONG_MAX;
typedef long long ll;
using namespace std;
int main(){
string s;
cin >> s;
string ans = "NO";
for(int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int man(pii p1, pii p2) { return abs(p1.first - p2.first) + abs(p1.... | 0 | 46,706,353 |
#include<bits/stdc++.h>
#define int long long
#define dd second
#define ff first
#define mp make_pair
#define pb push_back
using namespace std;
int n;
int tab[100005];
int poz1,poz2;
int mod = 1e9+7;
int sil[100005];
int poww(int x, int y)
{
if(y == 0) return 1; if(y == 1) return x;
if(y & 1) return poww(x,y-1)*x % m... | #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 int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
... | 0 | 73,134,986 |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <cstdlib>
#define rep(i,o,u) for(int i = o;i < u; i++)
using namespace std;
struct node{
int key;
node *prev, *next;
};
node *nil;
void inti(){
nil = (node *)malloc(sizeof(node));
nil->next = nil;
nil->prev = n... | #include <bits/stdc++.h>
using namespace std;
long long n,m,c,x,y,a,b, hasil, tag;
int arr[200001];
bool mulai[200001];
bool sel[200001];
bool valid;
int main() {
cin >> m >> n;
for (int i = 1; i <= n; i++){
cin >> x >> y;
if (x == 1){
mulai[y] = true;
}
if (y == m){
... | 0 | 98,790,738 |
#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
typedef unsigned long long int ull;
typedef long long int ll;
#define deb(x) cout << "Value - " << x << "\n";
using namespace std;
void prime()
{
}
int main()
{
ios::sync_with_s... | #include<bits/stdc++.h>
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define REP(i, a, b) \
for (int i = int(a); i <= int(b); i++)
#define TRvi(c, it) \
for (vi::iterator it = (c).begin(); it != (c).end();... | 0 | 77,187,718 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define rep2(i, startValue, N) for (int i = (int)(startValue); i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll NUM = pow(10,9) + 7;
int main(){
int N;
cin >> N;
string S;
cin >> S;
for(int i(0);i<2*N;i += 2){
if(S[i] == 'B') S[i] = 'W';
else S[i] = 'B';
}
if(S[0] == 'B'){
cout << 0 << endl;
return 0;
}
int l_n(0);
ll ans(1);
for(int i(0);i... | 0 | 80,438,327 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int a,b,c,d;
cin>>a>>b>>c>>d;
int m1=min(a,b);
int m2=min(c,d);
cout<<m1+m2;
return 0;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 25,801,593 |
#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 REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define rreps(i,n) for(int i = n; i >= 1; i--)
#define co(x) cout << x <<endl
#define cs(x) cout << x <<" "
#define cer(x) cerr << x <<endl
#define ALL(x) (x... | 0 | 26,368,743 |
#include<iostream>
#include<utility>
#include<algorithm>
using namespace std;
int main(){
int n,m;
int d,p;
pair<int,int> v[10010];
while(cin >> n >> m, n||m){
for(int i=0;i<n;i++){
cin >> d >> p;
v[i] = make_pair(p,d);
}
sort(v,v+n);
int cnt = n-1;
while(0<=cnt && m){
if(v... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi0 for(ll i=0;i<n;i++)
string s;
string strd(int n){
string x;
while(n){
int d=n%10;
x+=(d+'0');
n/=10;
}
reverse(x.begin(),x.end());
return x;
}
void digit()
{
cin>>s;
ll sum=0;
for(int ... | 0 | 62,117,834 |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define hell 1000000007
#define PI 3.14159265358979323846
#include <fstream>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
while(t--) {
ll n,i,j,k;
cin>>n>>k;
ll arr[... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define frw(i, a, b) for(int i = a; i < b; i++)
#define fi first
#define se second
#define pb push_back
#define in insert
#defin... | 0 | 2,020,617 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long q, h, s, d;
cin >> q >> h >> s >> d;
long long n;
cin >> n;
long long ans = 0;
if (n % 2 == 0){
ans += min( 4*q*n, min( 2*h*n, min( n*s,d*n/2 ) ) );
}
else{
long long temp = n - 1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
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; } return 0; }
const int IN... | 0 | 14,031,085 |
#include<iostream>
using namespace std;
void BubbleSort(char C[36][2], int N){
for(int i = 1; i < N; i ++){
for(int j = N - 1; j >= i; j --){
if(C[j][1] < C[j - 1][1]){
char temp[2];
temp[0] = C[j][0];
temp[1] = C[j][1];
C[j][0] = C[j- 1][0];
C[j][1] = C[j- 1][1];
C[j - 1][0] = temp[0];
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
ll digit_sum(ll a){
ll ans=0;
wh... | 0 | 59,985,285 |
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 1e5 + 500;
const int MOD = 1e9 + 7;
int A[N], B[N], n;
ll sol = 0;
int main(){
scanf("%d", &n);
for(int i = 0;i < n;i++)
scanf("%d%d", A + i, B + i);
for(int i = n - 1;i >= 0;i--){
sol += (B[i] - (sol + A[i]) % B[i]) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A, X = 0;
cin >> N;
vector<string> blue(N);
for (int i = 0; i < N; i++){
cin >> blue.at(i);
}
cin >> M;
vector<string> red(M);
for (int i = 0; i < M; i++){
cin >> red.at(i);
}
for (int i = 0; i < N; i++){
A = 1;
for... | 0 | 52,101,130 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
ll N,L,T;
vector<ll> X;
vector<int> W;
int main(){
cin>>N>>L>>T;
vector<ll> place;
for(int i=0;i<N;i++)... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#include <bi... | 0 | 62,015,477 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long int;
using ld=long double;
using VI=vector<ll>;
using VD=vector<ld>;
using VVI=vector<VI>;
using VC=vector<char>;
using VB=vector<bool>;
using VVC=vector<VC>;
using VS=vector<string>;
using PLL =pair<ll,ll>;
using PLD=pair<ld,ld>;
using VPLL=vector<PLL>;
... | #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(){
string S;
cin >> S;
int a, i, l, sum;
l = S.length();
sum = 0;
for ( i = 0; i < l; i++){
a = S.at(i) - '0';
sum += a;
sum %= 9;
}
if (sum == 0) {
cout << "Yes";
} e... | 0 | 72,518,261 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
ll GCD(ll a, ll b) { return ... | 0 | 59,424,803 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,num[110]={},x,ans1=0,ans2=0;
vector<int> ans;
while(cin>>n) num[n]++;
for(int i=1;i<=100;i++){
if(num[i]>ans2){
ans.clear();
ans.push_back(i);
ans2 = num[i];
}
else if(num[i]==ans2) ans.push_back(i);
}
fo... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll i,j,x,y,z,a[1010],b[1010],c[1010],k;
cin >> x >> y >> z >> k;
for(i=0;i<x;i++){
scanf("%lld",&a[i]);
a[i]*=-1;
}
for(i=0;i<y;i++){
scanf("%lld",&b[i]);
b[i]*=-1;
}
for(i=0;i<z;i++){
... | 0 | 7,366,226 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
int main(){
int n;
cin >> n;
int64_t a[n];
int i,zero=0;
for (i=0;i<n;i++){
cin >> a[i];
if(a[i... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
signed main(){
int h,w,n; cin >> h >> w >> n;
set<pair<int,int>> st,table;
for(int i = 0; i < n; i++){
int a,b; cin >> a >> b;
a--,b--;
st.insert({a,b});
for(int dy : {-1,0,1})... | 0 | 19,449,515 |
#include <iostream>
#include <vector>
int main(void){
int N, M, ans=0;
std::cin >> N >> M;
std::vector<int> imos(N + 2, 0);
for (int i=0; i<M; ++i){
int l, r;
std::cin >> l >> r;
++imos[l];
--imos[r + 1];
}
for (int i=1; i<N+2; ++i){
imos[i] += imos[i - 1]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend();
#define isS... | 0 | 15,463,852 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep( i, n, m ) for(int i = ( n ); i < ( m ); i++)
#define rep_d( i, n, m ) for(int i = ( n ) - 1; i >= ( m ); i--)
#define sort_asc( X ) sort(( X ).begin(), ( X ).end())
#define sort_desc( X ) sort(( X ).begin(), ( X ).end(), greater <>())
... | 0 | 23,571,132 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
string s,t;
cin>>n>>s>>t;
if(s==t) {
cout<<n<<"\n";
return 0;
}
int l = 0;
for(int i=0; i<n; i++) {
if(s.substr(n-i)==t.substr(0,i)) l = max(l,i);
}
cout<<2*n - l<<"\n";
} | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <string>
#include <queue>
#include <iomanip>
#include <iterator>
#define MOD 1000000007
#define INF 1000000001
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
... | 0 | 470,620 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using P = pair<int, int>;
using ll = long long;
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) cin >> h[i];
int num = 0;
rep(i, n){
if(h[i] >= k) num++;
}... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
const int M = 30;
long long get(int vk[], int idx, vector<int>& a, vector<int>& b) {
long long res = 0;
for (int u = 0; u < (int) a.size(); u++) {
bool flag = true;
for (int i = idx; i < M; i++) {
if (!vk[i] && (a[u] & (1 << i))) ... | 0 | 97,982,975 |
#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){if(a>b){a=b;return true;}return ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> ... | 0 | 57,229,170 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int h,w,m;
cin >> h >> w >> m;
map<int,int> imp, jmp;
set<pair<int,int>>st;
rep(i,m){
int H, W;
cin >> H >> W;
st.i... | 0 | 67,736,431 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using pii = pair<int,int>;
#define FOR(i,a,b) for(ll i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(obj) (obj).begin(), (obj... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,... | 0 | 27,142,319 |
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define x first
#define y second
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define endl '\n'
int main()
{
int n,m,x,y;
cin>>n>>m>>x>>y;
vector<i... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
using namespace std;
int main(){
int N;
int H[1000];
cin >> N;
for (int i = 0; i < N; i++){
cin >> H[i];
}
int highest = 0;
int count = 0;
for (i... | 0 | 31,800,285 |
#include<bits/stdc++.h>
using namespace std;
#define dbg(a) cerr << __LINE__ << ": " << #a << " = " << a << '\n'
template<class T> inline istream& operator>>(istream& str, vector<T> &a) { for (auto &i : a) str >> i; return str; }
typedef long long ll;
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int n, k; cin ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct pos {
int x, y;
};
int h, w;
const vector<pos> moves{{1, 0},
{-1, 0},
{0, 1},
{0, -1}};
bool inRange(pos p) {
return 0 <= p.x && p.x < h && 0 <= p.y &... | 0 | 99,081,666 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define PI 3.141592653589793
using namespace std;
typedef long long ll;
template<class T> void chmax(T &a,T b) { if (a<b) a=b;}
template<class T> void chmin(T &a,T b) { if (a>b) a=b;}
int gcd(int a, int b){
if (a < b) gcd(b,a)... | #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 < ... | 0 | 31,292,474 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>
#include <queue... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int A, P;
cin >> A >> P;
int n = A * 3 + P;
n /= 2;
cout << n << endl;
} | 0 | 29,275,583 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) cin >> a.at(i);
int lighten = 1;
vector<int> route;
while (lighten != 2) {
route.push_back(lighten);
lighten = a.at(lighten - 1);
if (route.size() > N) break;
}
if (rou... | #include <iostream>
int main() {
int h, w;
for (std::cin >> h >> w; h != 0 || w != 0; std::cin >> h >> w) {
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
char c;
if (i == 0 || i == h - 1 || j == 0 || j == w - 1) {
c = '#';
... | 0 | 48,746,802 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
priority_queue<int> q;
vector<vector<int>> v(m);
rep(i, n) {
int a, b;
cin >> a >> b;
if (a > m) continue;
v[m-a].pus... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<double> v;... | 0 | 39,419,950 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
int main() {
int a,b;
string s;
long long ans = 0;
cin >> s;
s[5] = ' ';
s[13] = ' ';
cout << s << endl;
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int main(){
int N, M;
scanf("%d", &N);
scanf("%d", &M... | 0 | 9,335,064 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <deque>
#include <string>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <map>
#include <unordered_map>
#include <bitset>
#define _crt_secure_no_warn... | #include <stdio.h>
using namespace std;
int main(void) {
int sum;
while (scanf("%d", &sum)+1) {
if (sum > 36) {
printf("0\n");
continue;
}
int count = 0;
int a = 0;
int b = 0;
int c = 0;
int d = 0;
for (a = 0; a <= 9; a++) {
for (b = 0; b <=9; b++) {
for (c ... | 0 | 52,029,132 |
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
sort(a.begin(), a.end());
ll ans=0;
int j=0;
while(j<n){
ll now=a.at(j);
int count=0;
whi... | #include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
... | 0 | 87,750,766 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int k;cin>>k;
string s;cin>>s;
int n=s.length();
if(n<=k) cout<<s<<"\n";
else
{
string s1="";
for(int i=0;i<k;i++)
s1=s1+s[i];
s1=s1+"...";
cout<<s1<<"\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 17,640,683 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int x;
cin >> x;
for(int i = 0; ; ++i) {
int base = i * 100;
if(base > x) {
cout << 0 << endl;
break;
}
int mini = 0;
int maxi = 5 * i;
if(mini <= x-base && x-base <= maxi) {
cout << 1 << endl;
... | #include<bits/stdc++.h>
#define ll long long
#define int ll
#define fi first
#define si second
#define ... | 0 | 5,722,682 |
#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.b... | #include<iostream>
#include<cstring>
#include<map>
using namespace std;
typedef long long LL;
const int N = 1e5;
LL ans[N+1];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
map<LL,LL> freq;
map<LL,int> smallest;
LL total_on_board = 0;
int n; cin >> n;
for(int i = 0; i < n; i++)
{
LL x; ci... | 0 | 2,171,003 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll=long long;
int main(){
ll n,m;cin>>n>>m;
if(n==1||m==1){
if(n==1&&m==1)return cout<<1,0;
ll x=max(n,m);
cout<<max(ll(0),x-2);
}else cout<<max((n*m)-2*(n+m)+4,ll(0));
} | #include <bits/stdc++.h>
#define PB emplace_back
using namespace std;
const int N = 5e5+100;
int par[N], sz[N];
int fat(int x) {
while(x != par[x]) x = par[x];
return x;
}
void add(int u, int v) {
u = fat(u);
v = fat(v);
if(u != v) {
if(sz[u] < sz[v]) swap(u, v);
sz[u] += sz[v];
... | 0 | 88,492,863 |
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
string ans;
inline int query(ll x){
cout<<"? "<<x<<endl;
cin>>ans;return ans=="Y";
}
inline int solve1()
{
ll fac=1;
for(int i=1;i<=10;++i,fac*=10)
if(!query(fac)) return i-1;
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
int n; cin >> n;
vector<ll> v(n + 1, 0);
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j += i)v[j]++;
}
cout << accumulate(v.begin(), v.begin() + n , 0ll) << endl;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie... | 0 | 41,903,992 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> V(3);
cin >> V[0] >> V[1] >> V[2];
sort(V.begin(), V.end());
int ans, m;
m=2*V[2]-V[0]-V[1];
if (m%2==0) {
ans = m/2;
}
else {
ans = (m+3)/2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_ARGS_... | 0 | 20,455,877 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int main()
{
ll a,b;
cin>>a>>b;
if(a==13&&b==1)a=0;
if(a==1&&b==13)b=0;
if(a>b){
cout<<"Alice"<<endl;
}else if(a<b){
cout<<"Bob"<<endl;
}els... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 0 | 58,882,293 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <utility>
#include <iomanip>
#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
const int INF = 1e15;
const int MOD = 1... | 0 | 66,727,916 |
#include <bits/stdc++.h>
using namespace std;
#define Rep(i,N) for(int i = 0; i < N;i++)
typedef pair<int,int> Pi;
#define F first
#define S second
#define INF 1 << 28
inline void chmax(int &a,int b) {
a = max(a,b);
}
inline void chmin(int &a,int b) {
a = min(a,b);
}
int main()
{
int N, K;
while(cin >> N >> K,N... | #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... | 0 | 14,200,052 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th... | #include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS; typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII; typedef pair<LL, LL> PLL;
typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<VVI> VVVI;
typedef vector<LL> VLL; typedef vector<VLL> VVLL; t... | 0 | 9,642,316 |
#include <iostream>
using namespace std;
int main() {
int nofp,h,w,ans=0,arr[1002],arr1[1002];
cin>>nofp>>h>>w;
for(int i=1;i<=nofp;++i)
{
cin>>arr[i]>>arr1[i];
}for(int j=1;j<=nofp;++j)
{
if(arr[j]>=h&&arr1[j]>=w)
ans++;
}cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
const lint INF=1LL<<61;
int main(){
int n,k,h[301]={};
scanf("%d%d",&n,&k);
rep(i,n) scanf("%d",&h[i+1]);
lint dp[301][301];
rep(i,n-k+1) rep(j,n+1) dp[i][j]=INF;
dp[0][0]=0;
for(int t=1;t<=n;t++){
for(i... | 0 | 15,947,142 |
#include <bits/stdc++.h>
using namespace std;
long long n,dp[2005]={0,0,0,1,1,1};
const long long mod=1000000007;
int main()
{
scanf("%d",&n);
for(int i=6;i<=n;i++)
{
for(int j=0;j<=i-3;j++)
{
dp[i]=(dp[i]+dp[j])%mod;
}
dp[i]+=1;
dp[i]%=mod;
}
printf("%lld\n",dp[n]);
return 0;
} | #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 debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template... | 0 | 52,221,814 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<string>
#include<functional>
#include<set>
#include<unordered_map>
using namespace std;
vector<int>c[10000];
bool used[10000];
vector<int>V;
void DFS(int a) {
used[a] = true;
for (int i : c[a]) {
if (!used[i])DFS(i);
... | #include <bits/stdc++.h>
using namespace std;
struct Coordinate {
int x;
int y;
Coordinate() : x(0), y(0) {}
};
int main() {
int N, K;
cin >> N >> K;
vector<int64_t> X(N);
vector<int64_t> Y(N);
vector<Coordinate> coords(N);
for (int i = 0; i < N; i++) {
cin >> X.at(i) >> Y.at(i);
coords.at(i).... | 0 | 63,023,975 |
#include <cstdio>
int main() {
int a,b;
std::scanf("%d %d",&a,&b);
if(a > b) {
std::printf("a > b\n");
}
else if(a < b) {
std::printf("a < b\n");
}
else if(a == b) {
std::printf("a == b\n");
}
return 0;
} | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | 0 | 41,266,661 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A;
cin >> N;
cin >> A;
if ( 1<=N<=100 && 0<=A<=N*N ){
cout << N*N - A << endl;
}
else {
cout << "error" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int root(int a[] ,int i)
{
if(a[i] ==i )
{
return i ;
}
else
return root(a , a[i]);
}
void union_1(int a[] , int size[] ,int i , int j)
{
int root_A = root(a , i);
int root_B = root(a, j);
if(root_A ==root_B)
{
return ;
... | 0 | 14,216,863 |
#include <iostream>
#include <algorithm>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main()
{
int n,count_max,count_min,temp;
long long sum = 0;
cin >> n;
rep(i,n)
{
cin >> temp;
if(i == 0)
{
count_max = count_min = temp;
}
else
{
count_max = max(count_max,temp);
count_min =... | #include<bits/stdc++.h>
using namespace std;
#define Pi acos(-1)
#define _terminated return 0
#define endl "\n"
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define booster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef vecto... | 0 | 83,245,180 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = ll(1e9)+7;
int main(){
ll N;
cin >> N;
set<ll> detected;
vector<ll> T(N);
detected.insert(0);
for(int i=0;i<N;i++){
cin >> T[i];
if(i>0&&T[i]>T[i-1]){
detected.insert(i);
}
... | #include<iostream>
using namespace std;
class Dice{
public:
int f[6];
Dice(){}
void roll_x(){roll(1,4,6,3);}
void roll_y(){roll(1,2,6,5);}
void roll_z(){roll(2,3,5,4);}
void roll(int i,int j,int k,int l){
int t=f[i]; f[i]=f[j]; f[j]=f[k]; f[k]=f[l]; f[l]=t;
}
void move(cha... | 0 | 91,125,028 |
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define nl '\n'
#define AC ios_base::sync_with_stdio(0); cin.tie(NULL);
using namespace std;
const int MOD = 998244353;
const int N = 2*1e5;
int main(){
AC
int n, m;
cin>>n>>m;
if(n%2!=0){
for(int i=1; i<=m; i++){
cout<<i... | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n;cin>>n;
int h[n];
for(int i = 0;i<n;i++){
cin >>h[i];
}
int sai = h[0];
int k= 1;
for(int i= 1;i<n;i++){
if(h[i] >= sai){
k+=1;
... | 0 | 69,013,470 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep1(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main(){
int n;
cin >> n;
vector<long long> A(n), A_copy(n), data(n);
rep1(i, n){
cin >> A[i];
A_copy[i] = A[i];
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
const int inf=1e9+7;
const ll INF=1LL<<58;
const ll mod... | 0 | 22,649,773 |
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | #include <iostream>
#include <string>
#include <cstdlib>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdio>
#include <iomanip>
#include <utility>
#include <unordered_map>
... | 0 | 57,510,595 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.