code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <iostream>
#include<map>
using namespace std;
#define fin(ans) cout << (ans) << '\n'
int main()
{
int K,X;
cin >> K >> X;
if(K*500 >= X) fin("Yes");
else fin("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int N;
cin >> N;
ve... | 0 | 84,313,115 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
const ll inf = 1000000001;
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F fi... | 0 | 19,142,141 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool find(string s, string p)
{
for(int i = 0; i < s.size(); ++i){
for(int j = 0; j < p.size(); ++j){
if(i+j >= s.size() || s[i+j] != p[j]) break;
if(j == p.size() - 1) return true;
}
}
retur... | #include<stdio.h>
void right_triangle(int x, int y, int z);
int main(void)
{
int n;
scanf("%d", &n);
int i = 0;
int x, y, z;
while (i < n) {
scanf("%d %d %d", &x, &y, &z);
right_triangle(x, y, z);
i++;
}
return 0;
}
void right_triangle(int x, int y, int z)
{
int i, j, k;
i = x * x;
j... | 0 | 84,177,851 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main(){
int H, W, M;
cin >> H >> W >> M;
vector<int> Hi(H, 0);
vector<int> Wi(W, 0);
set<pair<int,int>> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int phi;
cin >> phi;
for (int i = 1; i <= 360; ++i) {
if ((i * phi) % 360 == 0) {
cout << i << "\n";
break;
}
}
return 0;
} | 0 | 93,207,451 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007
#define INF (1 << 30)
#define REP(i, m, n) for(int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i,k,n) for (int i = k; i < (int)(n); i++)
#define repd(i,n) for (int i = n-1; i >= 0; i--)
#define rrepd(i,k,n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y) x=... | 0 | 44,886,176 |
#include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | #include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
int getMaxKByO(const vector<int>& counts, const vector<int>& sums, int O) {
auto pos = lower_bound(counts.begin(), counts.end(), O);
int pos_idx = pos - counts.begin();
if (pos_idx == 0) {
return... | 0 | 43,173,946 |
#include<stdio.h>
int main(void){
int i;
for(i=1;i<10;i++){
printf("%dx1=%d\n",i,i*1);
printf("%dx2=%d\n",i,i*2);
printf("%dx3=%d\n",i,i*3);
printf("%dx4=%d\n",i,i*4);
printf("%dx5=%d\n",i,i*5);
printf("%dx6=%d\n",i,i*6);
printf("%dx7=%d\n",i,i*7);
printf("%dx8=%d\n",i,i*8);
prin... | #pragma region
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<cstring>
#include<string>
typedef long long ll;
template <typename T>void read(T &x){x=0;char ch=getchar();ll f=1;while(!isdigit(ch)){if(ch=='-')f*=-1;ch=getchar();}while(isdigit(ch)){x=x*10+ch... | 0 | 44,904,016 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | 0 | 21,426,916 |
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int M = 8000;
string s;
int X, Y;
vector<int> A[2];
int dp[2][16001];
int tmp[16001];
void solve(){
for(int idx=0;idx<2;idx++){
dp[idx][M] = 1;
for(int i=0;i<(int)A[idx].size();i++){
int d = A[idx][i];
memset( tmp, 0, sizeof... | 0 | 82,906,308 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
string L;
cin >> L;
ll n = L.size();
vector<ll> dp1(n + 1);
vector<ll> dp2(n + 1);
dp2[0] = 1;
for (ll i = 0; i < n; i++) {
if (L[i] == '0') {
dp1[i + 1] = dp1[i] * 3;
dp2[i + 1] = ... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5+5;
int n;
int k;
int main(){
scanf("%d%d" , &n , &k);
int xr = 0;
for(int i = 1; i < (1 << n); i++){
if(i == k)
continue;
xr ^= i;
}
if(k == 0){
for(int i = 0; i < (1 << n); i++){
printf("... | 0 | 56,952,905 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
#define IN... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int h,w;
cin >> h >> w;
vector<string> s(h);
for(int i = 0; i < h; i++) cin >> s[i];
int dy[4] = {0,0,1,-1};
int dx[4] = {-1,1,0,0};
for(int i = 0; i < h; i++){
for(int j = 0; j ... | 0 | 80,128,801 |
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, ... | 0 | 65,917,263 |
#include<bits/stdc++.h>
using namespace std;
const int N=1001;
long long n,x[N],y[N],q[N],t;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>x[i]>>y[i];
for(int i=1;i<=n;i++)
if((x[i]+y[i]+x[1]+y[1])&1)
{
cout<<-1;
return 0;
}
for(int i=30;i>=0;i--)
q[++t]=1<<i;
if((x[1]+y[1]+1)&1)
q[++t]=1;
cou... | #include <iostream>
using namespace std;
int main(){
int graph[101][101] = {0};
int num;
int hon;
int eda;
int ver;
cin>>num;
for(int i=0;i<num;i++){
cin>>eda;
cin>>hon;
for(int j=0;j<hon;j++){
cin>>ver;
graph[eda][ver]++;
}
}
for(int i=1;i<=num;i++){
for(int j=1;j<=num;j++){
cout<<graph[i][... | 0 | 49,286,665 |
#include <iostream>
#include <fstream>
using namespace std;
int main(){
int raw,j,a[100];
while (1) {
cin >> raw;
if (raw == 0) { break;
}
else {
for (j = 0; j < raw; j++) { cin >> a[j]; }
int min = a[0], max = a[0];
for (j = 0; j < raw; j++) {
if (a[j] < min) { min = a[j]; }
if (a[j] > max) { max = a[j... | #include<cstdio>
typedef long long ll;
const int mod=1000000007;
char s[200050];
bool d[200050];
int sum[200050];
int main(){
int n,i,ans=1,cnt=0;
scanf("%d%s",&n,s+1);
if(s[1]=='W'||s[n<<1]=='W'){
puts("0");
return 0;
}
for(i=2,d[1]=0,sum[1]=1;i<=(n<<1);++i)sum[i]=sum[i-1]+!(d[i]=d[i-1]^(s[i]==s[i-1]));
if(s... | 0 | 45,906,029 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
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 long long INF = 1LL << 60;
bool ... | #include<iostream>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<map>
#include<vector>
#define ll long long
using namespace std;
map<ll,int>mp;
struct DIAN
{
int bh;
long long d;
}ak[100010];
bool cmp(const DIAN&xx,const DIAN&yy)
{
return xx.d>yy.d;
}
vector<int>G[100010];
ll sz[100010];
ll dep[100... | 0 | 87,851,426 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int main(){
char c; cin >> c;
if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c ==... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
... | 0 | 99,344,142 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
struct edge{
int to,weight;
edge(int to,int weight):to(to),weight(weight){}
};
using Graph = vector<vector<int>> ;
using GraphEdge = vector<... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long i... | 0 | 45,688,129 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(),(x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector< vector<int> >
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main(){
int N;
cin >> N;
vector<int> A(N + 1), L(N + 1);
... | 0 | 7,780,481 |
#include<iostream>
using namespace std;
int main(void){
int n,cnt=1;
while(1){
cin>>n;
if(n==0)break;
cout<<"Case "<<cnt<<": "<<n<<endl;
cnt++;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX
int n, m;
vector<pair<int, int> > graph[100010];
int cost[100010];
bool flag = true;
void dfs(int idx, int num){
if(!flag) return;
cost[idx] = num;
for(int i = 0;i < graph[idx].size();i++){
if(cost[graph[idx][i].first] != INF){
... | 0 | 70,849,319 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#define test(x) cout << #x << " ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
vector<int> a(9);
for (int i = 0; i < 9; i++) {
cin >> a.at(i);
}
int n;
cin >> n;
int b = 0;
for (int i = 0; i < n; i++) {
int bi;
cin >> bi;
for (int i = 0; i < 9; i++) {
if (a.at(i) ... | 0 | 69,960,508 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double N, A;
cin >> N >> A;
double R = N * N - A;
cout << R << endl;
} | #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 equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 | 28,599,999 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define ff first
#define ss second
#define vll vector<ll>
#define vpll vector<pll>
#define eb emplace_back
#define MAX 999999999999999
int main(){
ll n, ans = 0;
cin >> n;
for (int i = 2; i <= 2000000; i++){
if (n % i == 0)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | 0 | 16,216,837 |
#include <stdio.h>
int main ()
{
int apel;
int potongan;
scanf("%d %d", &apel, &potongan);
int rumus = (((apel*3) + (potongan))/2);
printf("%d", rumus);
return 0;
} | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = '\n'... | 0 | 19,371,476 |
#include <stdio.h>
int main(void){
int t[19];
int n = 0;
int c = 0;
for(int i=0;i<19;++i){
t[i] = 0;
}
for(int i=0;i<=9;++i){
for(int j=0;j<=9;++j){
t[i+j]++;
}
}
while(scanf("%d", &n) != EOF){
c = 0;
for(int i=0;i<19&&i<=n; ++i){
if(n - i > 18){ continue; }
c += t[i] * t[n - i];
}
printf... | #define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.... | 0 | 21,469,333 |
#include<bits/stdc++.h>
using namespace std;
#define ll "%I64d"
const int max1=100010;
int main()
{
string s1,s2;
cin>>s1>>s2;
int k=0;
for(int i=0;i<s1.size();i++)
{
if(s1[i]==s2[i])
{
k++;
}
}
cout<<k<<"\n";
} | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#include <random>
#define REP(i,m,n) for(int i=int... | 0 | 37,603,498 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+5;
int a[MAXN]= {0};
map<int,int>mm;
int solve(int n) {
int f;
for(int j=1; j*j<=n; j++) {
if(n%j==0) {
f=0;
mm[n]--;
if(mm[j]|... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
string A, B;
cin >> A >> B;
if (A == B) {
cout << "EQUAL" << endl;
return 0;
}
if (A.size() > B.size()) {
cout << "GREATER" << endl;
}
else if (A.size() < B.size()){
cout << "LESS" << endl;
}
e... | 0 | 55,687,382 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base :: sync_with_stdio(0);
cin.tie(0);
string s; cin >> s;
map<char,int> m {};
for (char c : s)
m[c]++;
if (m.size() != 2)
cout << "No";
else
cout << "Yes";
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i, n){
int j = i+1;
while(s[i] == s[j]){
j++;
}
ans++;
i = j-1;
... | 0 | 37,894,321 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD 1000000007LL
bool dbgflag = false;
ll gcd(ll a, ll b) {
if (a < b) swap(a, b);
if (b == 0) re... | #include <iostream>
int count_pattern( unsigned int const& n )
{
int ans=0;
for ( unsigned int a = 0; a < 10; ++a )
{
for ( unsigned int b = 0; b < 10; ++b )
{
for ( unsigned int c = 0; c < 10; ++c )
{
for ( unsigned int d = 0; d < 10; ++d)
... | 0 | 85,228,463 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <string>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define endl '\n'
const int INF = (1 << 30);
using namespace std;
typedef long long int ll;
bool solve(){
int n, smax=0, smin=INF, sum... | 0 | 5,219,319 |
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 11451419194545;
int main(){
ll A, B;
cin >> A >> B;
cout << A * B - (A + B - 1) << endl;
} | #include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
bo... | 0 | 53,672,159 |
#define NUMBER_OF_DIGITS 6
#include <bits/stdc++.h>
#ifdef DEBUG
#include <chrono>
#endif
using namespace std;
int main()
{
#ifdef DEBUG
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
#endif
ios::sync_with_stdio(false);
int n;
string s;
cin >> n;
cin >> s;
int counter = 0;
ve... | #include <bits/stdc++.h>
using namespace std;
#ifdef ARTEM
#define deb(x) x
#else
#define deb(x)
const int inf = 1000500;
#endif
void solve();
int main() {
solve();
}
void solve() {
int n;
cin >> n;
cout << n * (n + 1) / 2 << endl;
} | 0 | 51,686,638 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for(int i = 0; i < 100; i++){
for(int j = 0; j < 100; j++){
if(N == 4*i + 7*j){
count++;
}
}
}
string ans;
if(count != 0){
ans = "Yes";
}else{
ans = "No";
}
cout << ans << e... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) std::cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) std::cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#def... | 0 | 1,504,226 |
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <math.h>
#include <list>
#include <set>
#include <queue>
#include <iterator>
#include <bitset>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#define ll long long
#define _ ios_base::sync_with_stdio(0);cin.tie(... | #include <bits/stdc++.h>
using namespace std;
#define print cout <<
#define printl(s) cout << s << endl;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
const ll modseed = pow(10,9) + 7;
template <typename T>
vector<T> getValues(int num){
vector<T> values(num);
for(int i=0;i<num;i++){
... | 0 | 9,191,241 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include<iostream>
using namespace std;
#include<algorithm>
int main() {
int n, m, x;
cin >> n >> m >> x;
int bk[n][m+1];
for(int i = 0; i < n; i++) {
for(int j = 0; j <= m; j++) {
cin >> bk[i][j];
}
}
int res = 100000000, sk[m], tempres;
bool flag;
for(int bit = 0; bit < (1<<n); bit++) {
... | 0 | 24,269,565 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n, k;
while (cin >> n >> k, n, k) {
int a[100005];
for (int i = 0;i < n;i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 0;i <= n - k;i++) {
int s = 0;
for (int j = 0;j < k;j++) {
s += a[i + j];
}
if (s > ans)ans ... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
vector<vector<ll>> g(100010);
vector<ll> dist(100010);
int main(){
ll... | 0 | 28,379,139 |
#ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define vi vector<int>
#define vll vector<ll>
#d... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <s... | 0 | 40,815,360 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
int main(){
int n,m,x;
cin >>n>>m>>x;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m));
rep(i, n){
cin >> c[i];
rep(j, m){
cin >> a[i][j];
}
... | 0 | 62,588,067 |
#include<iostream>
using namespace std;
int main(){
int n,m;
while(1){
cin>>n>>m;
if(n==0&&m==0) break;
if(n>m) cout<<m<<" "<<n<<endl;
else if(n<m) cout<<n<<" "<<m<<endl;
else cout<<n<<" "<<m<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)... | 0 | 27,786,020 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1LL << 60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
int n, k; cin >> n >> k;
vector<int> h(n + 1);
for (int i = 1; i <= n; i++) cin >> h[... | #include <bits/stdc++.h>
#define LOOP(n) for (int _i = 0; _i < (n); _i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, r, n) for (int i = (r); i < (n); ++i)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
template <class T>
vector<T> make_ve... | 0 | 94,349,072 |
#include <iostream>
#include <algorithm>
using namespace std;
char alph[26];
void solve() {
string s;
cin >> s;
for (char c: s) {
++alph[c - 'a'];
if (alph[c-'a'] > 1) {
cout <<"no";
return;
}
}
cout << "yes";
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(),s.end())
#define reverse(s) reverse(s.begin(),s.end())
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
const ll mod = 1e9+7;
ll gcd(ll a, ll b) {
return b ? gcd(b, a%b) : a;
}... | 0 | 14,534,484 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
#define MAX_H 250
const int INV = -2147483645;
int main(void)
{
int H, node, parent, left, right;
int ary_BinaryHeap[MAX_H + 1];
for(int i = 0; i ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<(n);i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> ... | 0 | 21,519,991 |
#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <math.h>
using namespace std;
string MCXI ="ixcm";
int main(int argc, char const *argv[])
{
string s1,s2;
int n;
string ans;
int d1,d2;
int temp,f;
cin>>n;
for(int i1=0;i1<n;i1++){
cin>>s1>>s2;
temp=1;
d1=0;
for(int i2=0... | #include <bits/stdc++.h>
const int MOD=1000000007;
const int INF=1000000000;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> P;
ll N;
string s;
string ans="";
void judgement(char zero,char one)
{
char animals[100005];
animals[0]=zero;
animals[1]=one;
... | 0 | 80,792,664 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
int ans = INTINF;
int tmp;
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<int > l;
REP(i, n) {
cin >>... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int>P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;
#define rep(i,n) for(int i=0;i<n;i++)
#d... | 0 | 38,687,504 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn= 100010;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int p=0,q=0,r=0;
cin>>p>>q>>r;
cout<<min({p+q,p+r,q+r})<<endl;
} | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
class Cycle {
private:
ll _index = 1;
ll _cyc... | 0 | 66,514,282 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct edge{ll to, cost;};
int main(){
ll n, i, a, b, c, q, k,x,y, f;
scanf("%lld", &n);
vector<edge> V[n];
ll d[n] = {};
for(i=0; i<n-1;i++){
scanf("%lld%lld%lld", &a, &b, &c);a--;b--;
V[a].push_back(edge{b, c});
V[b].push_back(ed... | #include<bits/stdc++.h>
using namespace std;
#define MAX 100
#define NIL -2
int n, G_list[MAX+1];
int G[MAX+1][MAX+1];
int d[MAX+1][2];
void init(void){
for(int i=0; i<=MAX; i++){
d[i][0]=-1;
}
}
void make_graph(void){
scanf("%d", &n);
for(int i=0; i<n; i++){
int cnt, num, m;
scanf("%d %d", &num, &c... | 0 | 28,064,773 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <iostream>
#include <numeric>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
int INF = 1e9;
int main(){
int n;c... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
for (;;) {
scanf("%d %d",&h,&w);
if (h==0) break;
for (int i=0;i<h;i++) {
for (int j=0;j<w;j++) {
printf("#");
}
printf("\n");
}
printf("\n");
}
r... | 0 | 65,428,408 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
const ll ATCODER_AMARI = 1000000007;
const ll INF = 10000000000000;
ll factorial(ll k){
ll sum = 1;
for(int i = 1 ; i < k + 1; i++) {
sum *= i;
}
return sum;
}
ve... | #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;
... | 0 | 26,332,575 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 100010;
const int MAXM = 200010;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for(; !isdigit(ch); ch = getchar()) if(ch=='-') f=-1;
for(; isdigit(ch); ch = getchar()) x = (x*10)+(ch^48);
return x * f;
}
int st[MAXN], ... | #include<bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define all(x) (x).begin() (x).end()
#define rall(x) (x).rbegin() (x).rend()
typedef long long ll;
int main(){
char a;
cin>>a;
if(isupper(a))cout<<"A"<<endl;
else cout<<"a"<<endl;
} | 0 | 90,790,439 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> cnt(26);
for (char c : s) {
++cnt[c - 'a'];
}
int res = 1;
const int md = 1e9 + 7;
for (int i = 0; i < 26; i++) {
res = (long long) res * (cnt[i] + 1) % md;
}
cout << (res + md - 1... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll h, w; cin >> h >> w;
char field[101][10... | 0 | 72,927,005 |
#include <bits/stdc++.h>
using namespace std;
bool lrp[2];
int lr[2];
void c(bool f,char s){
if(s=='u'){
if(lrp[f]==0){
if(lr[!f]>=lr[f])lr[f]++;
else lr[f]--;
}
lrp[f]=1;
}else {
if(lrp[f]==1){
if(lr[!f]>=lr[f])lr[f]++;
else lr[f]--;
}
lrp[f]=0;
}
}
int main(){
i... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 0 | 98,555,007 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int a,b;
signed main() {
cin>>a>>b;
cout<<a-b+1<<'\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,n) for (int i = a; i < (int)n; ++i)
#define REP(i,n) FOR(i,0,n)
#define whole(f,x,...) ([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
template<typename T> bool chmin(T &a, const T &b) {if (a > b) { a = b; return... | 0 | 43,830,302 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N = 1e6 + 5;
int n;
int a[N];
int have[N], mark[N];
void work()
{
for(int i = 1; i < N; i++)
{
if(have[i])
{
if(have[i] >= 2)
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define mod 1000000007
#define inf 1000000000000000
#define infty 1000000000000000000LL
#define md 998244353
#define PI acos(-1.0)
#define endl "\n"
#define rr return
#define br cout<<"\n";
long... | 0 | 66,471,961 |
#include<iostream>
using namespace std;
int main() {
long long int n, m;
cin>>n>>m;
cout<<n-m+1<< endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
void go(){
int n,k;cin>>n>>k;
int x=1;... | 0 | 59,942,993 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<iomanip>
#include<queue>
#include<stack>
#include<time.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define ggr getchar(); getchar();return 0;
using namespace std;
bool prime(ll n) {
if (n =... | #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 | 70,156,741 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
char pn;
ll nm, nx, nd, ans;
cin>>nm>>nx>>pn>>nd;
nx = (nx*100) + nd;
ans = (nm*nx)/100;
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 0 | 29,927,860 |
#include <bits/stdc++.h>
using namespace std;
const int LIM=1e5, MOD=1e9+7;
set<int> adjl[LIM+1];
vector<int> lvl(LIM+1,0);
long long int dp[LIM+1];
void dfs(int u)
{
long long int white_ways=1, black_ways=1;
for(int v: adjl[u])
{
if(lvl[v]==0)
{
lvl[v]=lvl[u]+1;
dfs(... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
ll time2sec(string time){
ll hour, min, sec;
hour = 10*(time[0]-'0')... | 0 | 62,589,528 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
int i = 0;
while(i < min((int)s.length(),(int)t.length())){
if(s[i]<t[i]){cout << "Yes"; return 0;}
if(s[i]>t[i]){cout << "No"; return 0;}
i++;
}
if(i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; 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 ALL(v) (v).begin(),(v... | 0 | 58,977,426 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s, t;
bool ok;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> s >> t;
int n = s.length();
for (int i = 0; i < n; ++i) {
int idx = i;
ok = true;
for (int j = 0; j < n; ++j) {
... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 0 | 68,316,370 |
#include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
#include<functional>
#include<deque>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 | 48,555,196 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a,b,x;
cin >> a >> b >> x;
bool ans = false;
if (a <= x && a+b > x) ans = true;
cout << ((ans) ? "YES" : "NO") << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 76,264,320 |
#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 a,b;
cin >> a >> b;
if(a%3==0 || b%3==0 || (a+b)%3==0)
cout << "Possible" << endl;
else cout << "Impossible" << endl;
return 0;
} | #include "bits/stdc++.h"
#define MOD 1000000007
#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()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... | 0 | 43,450,513 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) int a; cin >> a;
#define inputInt2(a,b) int a; int b; cin >> a >> b;
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a;
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){ci... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) {
cin >> l[i] >> r[i];
}
vector<int> left(m), right(m);
int ans;
bool flag = true;
rep(i, m) {
if (i == ... | 0 | 59,856,212 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a * b / 2 * 2 == a * b * 0.5 * 2 ) {
cout << "Even" << endl;
}
if (a * b / 2 * 2 != a * b * 0.5 * 2 ) {
cout << "Odd" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
#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(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i < (n); i... | 0 | 44,854,999 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,ans=INT_MAX;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++)
cin>>v[i];
for(int i=-100;i<=100;i++)
{
int cost=0;
for(int j=0;j<v.size();j++)
cost=cost+pow(i-v[j],2);
if(cost<ans)
ans=cost;
}
cout<<ans;
return 0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i < int(n); ++i)
#define repx(i, x, n) for (int i = int(x); i < int(n); ++i)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b) ((... | 0 | 4,099,388 |
#include <iostream>
#include <stack>
int main() {
std::stack<int> st;
int inp;
while (std::cin >> inp)
{
if (inp == 0) {
std::cout << st.top() << std::endl;
st.pop();
}
else {
st.push(inp);
}
}
return 0;
} | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include<set>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
... | 0 | 90,525,974 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> length(N);
for(int i = 0; i < N; i++) cin >> length.at(i);
sort(length.begin(), length.end(), greater<int>());
int sum = 0;
for(int i = 0; i < K; i++){
sum += length.at(i);
}
cout << sum << endl;
retu... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef pair<int,int> P;
#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;}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
in... | 0 | 11,648,524 |
#include <bits/stdc++.h>
#define int long long
#define INF 1e+9
using namespace std;
signed main(){
int n,a[100000],ma = 0,b = INF;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a[i];
ma = max(ma,a[i]);
}
bool flag = false;
for(int i = 0;i < n;i++){
if(!flag && a[i] == ma) flag = true;
else if(min(abs(b - ma... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + 7,... | 0 | 84,275,390 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s, e, ans = "NO";
cin >> s;
for(int i = 0; i < s.size(); i++){
for(int j = 0; j <= s.size() - i; j++){
e = s;
if(e.erase(i,j) == "keyence") {
ans = "YES";
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
const int MOD = 1000000... | 0 | 50,582,793 |
#include <stdio.h>
#include <string.h>
int main(){
char arry[20];
scanf("%s",&arry);
int ln=strlen(arry),i;
for(i=ln-1;i>=0;i--)
{
printf("%c",arry[i]);
}
printf("\n");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5+7;
int ans[N];
int visited[N];
int n, m;
vector<int> graph[N];
int main(){
ios::sync_with_stdio(false);
cin.tie();
cin>>n>>m;
for(int i = 0; i < m; i++){
int a, b;
cin>>a>>b;
a--; b--;
graph[a].push_back(b);
... | 0 | 75,450,804 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n,m; cin >> n >> m;
if(n % 2) {
rep(i,m) cout << 1+i << " " << n-1-i << endl;
return 0;
}
int a... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
using ll = long long;
using ld = long double;
using ull =... | 0 | 87,155,051 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
if(b==1){
cout<<0<<endl;
}
else{
cout<<a-b<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 13,340,251 |
#include <iostream>
using namespace std;
int main(){
char b;
cin >> b;
switch(b)
{
case 'A':cout << 'T';break;
case 'C':cout << 'G';break;
case 'G':cout << 'C';break;
case 'T':cout << 'A';break;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
long long n;
cin>>n;
if(n==1){
cout<<"0";
return 0;
}
long long a,count=0,i;
a=sqrt(n)+1;
map<int,int> mp;
for(i=2;i<=a;i++){
while(n%i==0){
... | 0 | 71,176,729 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr ll INF = (1LL << 55);
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>> g(n, vector<int>(n, 0));
rep(i,m) {
int a, b;
cin... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int N = 50;
int n, k, v[N];
int main() {
cin >> n >> k;
rep(i, n) cin >> v[i];
int ans = 0;
for (int l = 0; l <= n; l++) {
for (int r = 0; l + r <= min(n, k); r++... | 0 | 47,045,438 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
int a,b,c;
cin>>a>>b>>c;
if(c>=a && c<=b){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
}
signed main(){
solve();
} | #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;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define MOD 1000000007
#define ll long long int
#define u64 un... | 0 | 91,687,075 |
#include <iostream>
using namespace std;
int main(void)
{
int r, D, x;
cin >> r >> D >> x;
for (int count = 0; count < 10; count++)
{
x = r * x - D;
cout << x << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int N;
string s;
cin>>N>>s;
int l= 0;
int r = 0;
for (int i=0; i<N; i++){
if (s[i]=='(') l++;
else l--;
if (l<0){
l=0;
r++;
}
}
while(r--) cout<<'(';
cout << s;
while(l--) cout<<')';
} | 0 | 59,282,915 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, m, x; cin >> n >> m >> x;
vector<int> p(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i=0; i<n; i++) {
cin >> p[i];
for (int j=0; j<m; j++) {
cin >> a[i][j];
}
}
int mn = INT_MAX;
for (int i=0; i<(1<<n); i++) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | 0 | 18,216,589 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define rforn(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define fast ios_base::sync_with_stdio(0);ci... | 0 | 73,439,286 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define sayyes cout<<"Yes"<<endl;
#define sayno cout<<"No"<<endl;
#define vv(a,b) vector< vector<int> > v(a,vector<int>(b,0));
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int mod =1e9+7;
const int di[]={-1,0,1,0},dj[]={0,-1,0,1... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
void solve(long long H, long long W, long long A, long long B){
rep(i,H-B) {
rep(j,W-A) {
std::cout << 1;
}
rep(j,A) {
std::cout << 0;
}
std::cout << std::endl;
}
rep(i,B)... | 0 | 75,143,057 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)n; ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
std::vector<int> d(n);
rep(i,n) cin >> d.at(i);
int total = 0;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
total += d.at(i) * d.at(j)... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int l... | 0 | 75,375,727 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a[7],b,c,d;
for(int i=1;i<=6;i++){
cin>>a[i];
}
cin>>b;
for(int i=0;i<b;i++){
cin>>c>>d;
if(c==a[1]){
if(d==a[2])cout<<a[3]<<endl;
if(d==a[3])cout<<a[5]<<endl;
if(d==a[5])cout<<a[4]<<endl;
if(d==a[4])cout<<a[2]<<endl... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | 0 | 30,392,242 |
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
int main(){
string s,str1,str2;
map<string,int> mp;
while(cin >> s){
if(mp.find(s) == mp.end()) mp[s] = 1;
else mp[s]++;
if(mp[s] > mp[str1]) str1 = s;
if(s.size() > str2.size()) str2 = s;
}
cout << str1... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 21,105,769 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++){
cin >> a[i];
}
int pos = -1;
for (int i = 0; i < N - 1; i++){
if (a[i] + a[i + 1] >= L){
pos = i + 1;
}
}
if (pos == -1){
cout << "Impossible" << endl... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
int N=S.size();
string T="keyence";
int count=0;
for(int i=0;i<7;i++){
if(S.at(i)==T.at(i)){
count++;
}else{
break;
}
}
for(int i=6;i>=0;i--){
if(S.at(N-7+i)==T.at(i)){
count++;
}else{
... | 0 | 98,214,637 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
vector<int> A(M),B(M);
for(int i=0;i<M;i++)
cin >> A[i] >> B[i];
vector<vector<int>> G(N+1);
for(int i=0;i<M;i++){
G[A[i]].push_back(B[i]);
G[B[i]].push_back(A[i]);
}
queue<int> que... | #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 a[3][3];
rep(i,3) rep(j,3) cin >> a[i][j];
int n;
cin >> n;
rep(i,n){
int b;
cin >> b;
rep(j,3) rep(k,3) if(a[j][k] == b)... | 0 | 71,675,405 |
#include <stdio.h>
int main(void)
{
int a,b,c;
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&c);
if(a<b &&b<c){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
using namespace std;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
typedef long long ll;
typedef long double ld;
const ll SIZE = 1e7 * 2, S2 = 1e7 * 2;
... | 0 | 13,618,829 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
int n;cin>>n;
vector<int> a(n);
rep(i,n)cin>>a[i];
int ans=0;
rep(i,n){
a[i]--;
if(ans==a[i]){
ans++;
}
}
if(ans==0){
cout<<... | #include <iostream>
using namespace std;
int main ()
{
int n,x,c = 0;
while (1)
{
c=0;
cin >> n >> x;
for (int q = 1; q <= n; q++)
{
for (int e = q + 1; e <= n; e++)
{
for (int y = e + 1; y <= n; y++)
{
if (q + e + y == x)
{
c++;
}
}
}
}
if (n == 0 && x == 0)
{
break;... | 0 | 94,347,228 |
#include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORA(i, n... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
string S;
cin >> S;
vector<int> val(4);
for(int i=0; i<4; i++){
val[i] = S[i] - '0';
}
int target = 7;
int ans = val[0];
for(int i=0; i < 1<<3; i++){
ans = val[0];
int x0 ... | 0 | 15,883,278 |
#include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int MAXN = 100;
const int INF = 1e9;
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
in... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define ii pair<int,int>
#define Max 100000+5
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define f first
#define s second
#define pb push_back
int mo... | 0 | 84,961,689 |
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define vc vector
#define vi vc<int>
#define vl vc<ll>
#define dbg(x) cout<<x<<endl;
#define mp(x,y) make_pair(x,y)
#define yes dbg("YES")
#define no dbg("NO")
#define tst int t;cin>>t;while(t--)
#define srt(v) sort(v.begin(),v.end());
#define rsrt(v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[105][4][2];
int main(){
string n;
int K;
cin >> n >> K;
int digit = n.size();
dp[0][0][0] = 1;
for(int i=0;i<digit;i++){
for(int j=0;j<4;j++){
for(int k=0;k<2;k++){
int nd=n[i]-'0';
for(int d=0;d<10;d++){
... | 0 | 85,873,772 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000009
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
ll n ;
cin>>n;
ll ans =1000000000001;
for(ll i = 1... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, ... | 0 | 92,579,004 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
if (S.size() < T.size()) {
cout << "UNRESTORABLE" << endl;
}
else {
int F = S.size();
int D = T.size();
vector<char> ans(F);
for (int j = 0; j < F; j++) {
ans.at(j) = 'z';
}
bool ok = f... | #include<bits/stdc++.h>
#define pb(a) push_back(a)
#define ms(x,y) memset(x,y,sizeof(x))
#define sci(a) scanf("%d",&a)
#define scl(a) scanf("%lld",&a)
#define scd(a) scanf("%lf",&a)
#define ll unsigned long long
using namespace std;
namespace Fread{
const int SIZE=1<<20;
char buf[SIZE],*S,*T;
inline char getchar(){
... | 0 | 78,628,445 |
#include <iostream>
using namespace std;
int main()
{
int x,y,z;
cin >>x;
cin >>y;
cin >>z;
if(x<y && y<z)
cout <<"Yes"<<endl;
else
cout <<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define 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 | 87,929,847 |
#include<bits/stdc++.h>
using namespace std;
int i,j,bo,ans;
string st;
int main()
{
getline(cin,st);
i=0;j=st.size()-1;
while(i<=j)
{
if(st[i]==st[j]) {i++;j--;continue;}
if(st[i]=='x') {i++;ans++;continue;}
if(st[j]=='x') {j--;ans++;continue;}
bo=1;break;
}
if(bo!=1) cout<<ans<<"\n";
else cout<<-1<... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<priority_queue<ll>> S(N);
for (int i = 0; i < N; i++) {
int t;
ll d;
cin >> t >> d;
t--;
S[t].push(d);
}
vector<ll> top... | 0 | 73,167,249 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const ll INF = 1LL<<60;
int main(){
int n,m;
cin>>n>>m;
int L, R;
L = 1;
R = 100010;
rep(_, n){
int l, r;
cin >> l >> r;
L = max(L, l);
R=min(R... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | 0 | 43,391,290 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | #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 <set>
#include <deque>
#include <numeric>
using lint = long long;
int main()
{
lint h, w, a, b;
scanf("%lld", &h);
... | 0 | 84,590,082 |
#include <iostream>
#include <vector>
using namespace std;
#define C
#ifdef C
#define BIL 4
#define FLO 3
#define ROO 10
int main(void)
{
unsigned char rooms[BIL][FLO][ROO] = {};
int num;
cin >> num;
for (size_t i = 0; i < num; i++)
{
int b, f, r, v;
cin >> b >> f >> r >> v;
rooms[b - 1][f - 1][r - 1] += v;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | 0 | 56,735,749 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double n,m,d; cin >> n >> m >> d;
if (d==0) {
cout << std::fixed << std::setprecision(15) << (m-1) / n << endl;
}
else {
cout << std::fixed << std::setprecision(15) << 2 * (n-d) * (m-1) / pow(n,2) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n,l;
cin >> n >> l;
string a;
multiset<string> s;
while(n--){
cin >> a;
s.insert(a);
}
for(auto i=s.begin();i!=s.end();++i){
cout << *i;
... | 0 | 55,925,871 |
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
vector<vector<char> >ar(n,vector<char>(m));
vector<vector<long long int> >dp(n,vector<long long int>(m));
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>ar[i][j];
... | #include <iostream>
#include <algorithm>
using namespace std;
int n;
void countingSort(int a[], int b[], int k) {
int c[k + 1];
for (int i = 0; i < k + 1; i++) {
c[i] = 0;
}
for (int i = 0; i < n; i++) {
c[a[i]]++;
}
for (int i = 1; i < k + 1; i++) {
c[i] += c[i - 1];
}
for (int i = n - 1; i... | 0 | 93,857,833 |
#include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF=(ll)1e9;
const ll MOD=(ll)1e9+7;
const ll MAX=510000;
vector<int> dx={1,0,-1,0},dy={0,1,0,-1};
template<class T> inline bool chmax(T& a, T b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> inline bool ... | #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 | 31,449,850 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#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 / 1... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
signed main(){
Int n;
cin>>n;
vector<Int> xs(n),ys(n);
... | 0 | 51,973,583 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, val;
map<int, int> cnt;
cin >> n;
for(int i = 0; i < n; i++) {
... | #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 | 21,359,640 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.