code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef struct node{
int data;
struct node *pre, *next;
}Node;
Node *head;
void init()
{
head = (Node*)malloc(sizeof(Node));
head->next = head;
head->pre = head;
}
void insert(int key)
{
Node *x = (Node*)malloc(sizeof... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(x,n) for(int x=0;x<n;x++)
#define vei vector<int>
#define velli vector<long long int>
#define pb(x) push_back(x)
#define pb2 pop_back()
#define all(x) (x).begin(),(x).end()
#define be(x) (x).begin()
typedef pair<int,int> P;
int main()... | 0 | 28,381,448 |
#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
te... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF ... | 0 | 100,166,495 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
const ll MOD = 1e9 + 7;
ll pow_fast(ll n, ll k) {
if (k == 0) {
return 1LL;
}
if (k == 1) {
return n;
}
if (k % 2 == 0) {
ll tmp = pow_fas... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
... | 0 | 18,894,758 |
#include<bits/stdc++.h>
using namespace std;
const int N=200010;
int n,s,j,tmp,sum;
long long ans;
int a[N];
int main(){
cin>>n;
for (int i=1;i<=n;i++) cin>>a[i];
for (int i=1;i<=n;i++){
sum-=a[i-1];
tmp=tmp^a[i-1];
while(j+1<=n&&tmp^a[j+1]==sum+a[j+1]){
sum+=a[++j];
tmp=tmp^a[j];
if (sum!=tmp){
s... | #include<bits/stdc++.h>
using namespace std;
void dfs(vector<vector<int>> &graph, vector<int> &counter, int child, int parent = 0) {
for(int son : graph[child]) {
if(son == parent) {
continue;
}
counter[son] += counter[child];
dfs(graph, counter, son, child);
}
}
int ... | 0 | 3,186,984 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define eb emplace_back
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main() {
ll n;
cin >> n;
if (n... | 0 | 95,726,037 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main(){
ll n,m;
cin >> n >> m;
priority_queue<ll> data;
rep(i,0,n){
ll a;
... | 0 | 90,270,880 |
#include <iostream>
#include <algorithm>
int main()
{
int w, h, n;
std::cin >> w >> h >> n;
int x_l = 0, x_u = w, y_l = 0, y_u = h;
for (int i = 0; i < n; ++i)
{
int x, y, a;
std::cin >> x >> y >> a;
switch (a)
{
case 1:
x_l = std::max(x, x_l);
... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define LEN(x) (int)x.size()
#define ALL(x) x.begin(), x.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int,int>;
using vpii = vector<pii>;
template<t... | 0 | 87,091,622 |
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned un;
#define sf scanf
#define si(a) sf("%d",&a)
#define sc(a) sf("%c",&a)
#define sii(a,b) sf("%d %d",&a,&b)
#define siii(a,b,c) sf("%d %d %d",&a,&b,&c)
... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(... | 0 | 15,073,054 |
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int k=0;k<n;k++){
int y,m,d;
cin>>y>>m>>d;
int ans=0;
for(int i=y+1;i<1000;i++){
if(i%3==0){
ans+=200;
}else{
ans+=195;
}
}
for(int i=m+1;i<11;i++){
if(y%3==0){
ans+=20;
... | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <queue>
using namespace std;
const int nmax = 1e9 + 7;
const long long INF = 1e18;
const double PI = 2 * asin(1);
typedef long long ll;
int main(){
ll N; cin >> ... | 0 | 1,800,831 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int ok=0,c=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<i;j++)
{
if(a[i]<a[j])
{
ok=1;
break;
}
}
if(ok==0)
{
c++;
}
else
{
ok=0;
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PLL;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<string> VS;
template<class T> inline bool chmin(T &a, T b) {if (a > b){a = b; return true;} return false;}
template<c... | 0 | 69,605,374 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
string alp="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
cin>>a>>b;
vector<vector<string>> s(a,vector<string> (b));
for(int i=0;i<a;i++){
for(int j=0;j<b;j++){
cin>>s[i][j];
if(s[i][j]=="snuke"){
cout<<alp.at(j)<<i+1<<endl;
ret... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) 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()
#define put(x)... | 0 | 100,399,807 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int ans = 0;
vector<int> amari(0);
for (int i = 0; i < 5; i++) {
int tmp;
cin >> tmp;
ans += ((tmp+9)/10)*10;
tmp %= 10;
amari.push_back(tmp);
}
sort(amari.begin(), amari.end());
for (int i = 0; i < 5; i++) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | 0 | 17,044,843 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | 0 | 94,221,558 |
#include<bits/stdc++.h>
using namespace std;
int string_len(char str[]){
int len = 0;
while(str[len])
len++;
return len;
}
int main(void){
char S[50];
char T[50];
bool ans = true;
cin >> S >> T;
int len = string_len(S);
for(int i = 0; i < len; i++){
if(S[i] != T[i]){
ans = false;
b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n+1;i++)
#define sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end())
typedef long long ll;
int main(){
int n;
cin >> n;
vector<pair<int,int>> r(n);
vector<pair<int,int>> ... | 0 | 98,055,438 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++)
{
cin >> H.at(i);
}
int cnt = 0;
bool flg;
for (int i = 0; i < N; i++... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll h, w;
cin >> h >> w;
vector<string> S(h);
for (auto & s : S) cin >> s;
bool gok = true;
for (ll i = 0; i < h; ++i) {
for (ll j = 0; j < w; ++j) {
if (S[i][j] == '.') continue;
b... | 0 | 62,830,543 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define all(obj) (obj).begin(), (obj).end()
static const int dx[4] = {0, 1, 0, -1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'u', 'r', 'd', 'l'};
static const ll INF = 1 << 21;... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int,int> pii;
typedef p... | 0 | 28,636,993 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
while(getline(cin, s)) {
if(s[0] == '.') break;
bool b = true;
int x = 0, y = 0;
char c[1000];
int top = 0;
for(int i = 0; i < s.size(); i++) {
if(s[i] == '(') {
x++;
c[top] = s[i];
top++;
}
else if(s[i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
long n;
vector<long> a;
vector<long> l;
long asum = 0, bsum = 0;;
cin >> n;
for (long i = 0; i < n; i++) {
long t;
cin >> t;
a.push_back(t);
asum += t;
}
bool flag = false;
lo... | 0 | 41,574,202 |
#include <stdio.h>
#include <map>
using namespace std;
int main() {
map<int, int> cnt;
int x;
while (scanf("%d", &x) != EOF) cnt[x]++;
int m = 0;
for (map<int, int>::iterator it = cnt.begin(); it != cnt.end(); ++it) {
if (m < it->second) m = it->second;
}
for (map<int, int>::iterator... | #include <iostream>
#include <complex>
#include <vector>
#include <algorithm>
using namespace std;
const double EPS = 1e-10;
const double INF = 1e12;
#define X real()
#define Y imag()
typedef complex<double> P;
typedef vector<P> VP;
double dot(P a, P b){
return (conj(a)*b).X;
}
double cross(P a, P b){
return (c... | 0 | 95,979,704 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
#define ALL(a) (a).b... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<vi> vv... | 0 | 74,092,152 |
#include <bits/stdc++.h>
using namespace std;
void solve(std::string S, std::string T, long long A, long long B, std::string U){
if(S == U) A -= 1;
else B -= 1;
cout << A << " " << B << endl;
}
int main(){
std::string S;
std::cin >> S;
std::string T;
std::cin >> T;
long long A;
scanf... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 998244353
#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;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define p... | 0 | 70,207,666 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, a, b; cin >> n >> a >> b;
auto calc = [&](int x){
int res = 0;
while(x){
res += x % 10;
x /= 10;
}
return res;
};
int ans = 0;
for(int i = 1; i <= n; i++){
int t = calc(i);
if(t >= a && t <= b)ans += i;
}
... | #include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
const int MAX = 2000001;
const int VMAX = 10000;
int A[MAX], B[MAX];
int C[VMAX+1];
int main(){
ios::sync_with_stdio(false);
int n, i, j;
cin >> n;
for(i=0; i <= VMAX; i++) C[i] = 0;
for(i=0; i<n; i++){
cin >> A[i... | 0 | 41,703,053 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#... | #include <iostream>
using namespace std;
int main(){
int N,M;
cin >> N >>M;
if(N%2==1){
for(int i=1;i<=M;i++){
cout << M+1-i<<" " <<M+i <<endl;
}
}else{
if(N%4==0){
int l=N-1,h=N;
for(int i=1;i<=M;i++){
cout<< l<< " " <<h<<endl;
l--;
h++;
if(i==N/4)
... | 0 | 30,965,301 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end());
#define vecmin(A) *min_element(A.begin(),A.end());
#define vecmax(A) *max_element(A.begin(),A.... | #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 (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).... | 0 | 78,240,669 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int main() {
ll a, b, c, d, cd;
cin >> a >> b >> c >> d;
cd = c * d / __gcd(c, d);
ll ic = a + (c - (a % c));
if (a % c == 0)
ic -= c;
ll fc = b - (b % c);
ll diff_c = fc - ic;
ll tc = diff_c - diff_c / c;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
template<class T> inline T... | 0 | 84,627,518 |
#include<iostream>
using namespace std;
int main(){
int a;
cin >> a;
for(int i = 0 ; a != 0 ; i++){
cout << "Case " << i+1 << ": " << a << endl;
cin >> a;
}
return 0;
} | #include<iostream>
#include<string>
signed main() {
int h,w,a,b;
scanf("%d%d%d%d",&h,&w,&a,&b);
std::string s(a,'0');
std::string t(w-a,'1');
std::string ans=s+t;
std::string S(a,'1');
std::string T(w-a,'0');
std::string Ans=S+T;
for(int i=0;i<h;++i){
if(i<b){
printf("%s\n... | 0 | 40,195,188 |
#include <bits/stdc++.h>
#define int long long
#define N 100010
using namespace std;
const int INF = 1LL<<55;
const int mod = (1e9)+7;
const double EPS = 1e-8;
const double PI = 6.0 * asin(0.5);
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
vector<int> G[N];... | #include <bits/stdc++.h>
using namespace std;
long long f(int n) {
if (n < 2) return 1;
return n * f(n - 2);
}
long long d(long long n) {
if (n % 10) {
return 0;
}
return 1 + d(n / 10);
}
long long g(long long n) {
if (n % 2 == 1) return 0;
n /= 2;
long long ans = 0;
while (n... | 0 | 1,270,518 |
#include<iostream>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Max = 1e3 + 7;
int ls1[Max], ls2[Max];
int n;
int main()
{
int n, a, b;
cin >> n >> a >> b;
ll sum = 0;
for (int i = 1; i <= n; i++)
{
int t = i;
int s = 0;
while (t > 0)
{
s += t %... | #include <bits/stdc++.h>
#define mem(i,a) memset(i,a,sizeof(i))
#define PI acos(-1.0)
#define DMAX 100000+5
#define MOD 998244353
#define eps 1e-8
#define mp make_pair
#define pb push_back
#define INF 1000000000+9
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
inline void ... | 0 | 71,864,926 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 5e5 + 100;
typedef long long ll;
string s;
int a[N];
void expend(int pos) {
for(int i = 1; s[pos-i] == '>'; i++) {
a[pos-i] = max(a[pos-i], i);
}
for(int i = 1; s[pos+i-1] == '<'; i++) {
a[pos+i] = max(a[pos+i], i);
}
}
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
bool isprime(int n){
for(int i = 2;i*i <= n;i++)if(!(n%i))return false;
return true;
}
... | 0 | 82,346,713 |
#include<iostream>
using namespace std;
int main()
{
for(int i=1;i<=9;i++)
for(int j=1;j<=9;j++)
cout<<i<<'x'<<j<<'='<<i*j<<endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | 0 | 54,423,672 |
#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),... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
int main() {
ll n, k; cin >> n >> k;
V<ll> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
ll ans = 0;
ll comb = (k * (k ... | 0 | 54,210,960 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string str, o, p, m, str2;
int i, q, a, b, j, x, c;
cin >> str >> q;
for (i = 0; i<q; i++) {
cin >> o;
if (o == "print") {
cin >> a >> b;
for (j = a; j <= b; j++)
cout << str[j];
cout << endl;
}
else if... | #include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef int64_t ll; typedef vector<int> VI; typedef pair<int,int> pii;
t... | 0 | 43,214,294 |
#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;
cin>>N;
vector<int>A(N);
for(int i=0;i<N;i++){
cin>>A[i];
}
vector<int>B=A;
sort(B.rbegin(),B.rend());
for(int i=0;i<N;i++){
int a=B[0];
if(B[0]==A[i]){
a=B[1];
}
cout<<a<<end... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 52,584,240 |
#include<iostream>
#include<iomanip>
#include<cstdlib>
#include<stdio.h>
#include<time.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<map>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define FOR(i, a, b) for... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
map<ll,int>id;
int n;
ll d[101000];
#define pli pair<ll,int>
#define fi first
#define se second
priority_queue<pli>q;
int fa[101000], sz[101000]; ll sum[101000];
int main(){
cin>>n;
for (int i=1;i<=n;++i){
cin>>d[i]; id[d[i]]=i;
}
... | 0 | 83,720,141 |
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#defin... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 19,233,902 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define sz(s) (int)s.size()
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 9; i > 0; --i) {
int t = i * 111;
if (t >= n) ans = t;
}
cout << ans << '\n';
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | 0 | 55,699,934 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ln = (1+sqrt(8*n+1))/2;
int sm = (ln * (ln+1))/2;
for(int i=1;i<=ln;i++){
if(sm-n != i) cout << i << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
vector<bool> seen(4);
for (int i = 0; i < 3; i++) {
int x;
cin >> x;
seen[x] = true;
}
for (int i = 1; i <= 3; i++) {
if (!seen[i]) {
cout << i;
... | 0 | 2,319,441 |
#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>;
#define INF 100000000
const int MOD = 1000000007;
int main(){
int a,b,c;
cin>>a>>b>>c;
int x = a-b;
if(c-x>=0)
{
cout<<c-x<<endl;
}
else
{
... | #include <iostream>
#include <string>
using namespace std;
string O,E;
int main(){
cin >> O >> E;
int o = 0;
int e = 0;
string ans;
for(int i = 0;i < O.length() + E.length();i++){
if(i % 2 == 0){
ans += O[o];
o++;
}else{
ans += E[e];
e+... | 0 | 44,026,388 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
vector<int>a(27);
for(int i=0;i<s.length();i++)
{
a[s[i]-'a'+1]++;
}
if(s.length()!=26)
{
cout<<s;
for(int i=1;i<=26;i++)
{
if(!a[i])
{
char c='a'+i-1;
cout<<c<<endl;
break;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | 0 | 41,503,330 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x) ... | 0 | 56,010,239 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
using ml = boost::multiprecision::... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n,m;
cin >> n >> m;
vector<ll> a(n),b(n),c(m),d(m);
rep(i,n){
cin >> a.at(i) >> b.at(i);
}
rep(i,m){
cin >> c.at(i) >> d.at(i);
}
rep(i,n){
ll sum=1e9+7,ans;... | 0 | 95,065,434 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,a,i,c=0;
cin>>n>>k;
for(i=0;i<n;i++)
{
cin>>a;
if(a>=k)
c++;
}
cout<<c<<endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <set>
#include <utility>
#include <functional>
using namespace std;
typedef pair<int, int> pii;
typedef pair<string, int> P;
typedef ... | 0 | 37,219,112 |
#include<iostream>
#include<vector>
#include<string>
int main(){
int n, m;
std::cin >> n >> m;
std::vector<std::vector<int>> ship(n);
for(int i = 0; i < m; i++){
int a, b;
std::cin >> a >> b;
a--; b--;
ship[a].push_back(b);
ship[b].push_back(a);
}
int now... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main(){
int n, k, first;
cin >> n >> k >> first;
vector<int> a(n-1);
rep(i,n-1) cin >> a[i];
ll ans = 1e18;... | 0 | 62,936,606 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
const double PI=acos(-1);
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i,a,b) for (int i=(a);i<=(b);i++)
#define per(i,a,b) for (int i=(a);i>=(b);i--)
#define Rep(i,a,b) for (int i=(a... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i... | 0 | 45,355,293 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
#define ll long long int
int main(){
int n;
cin>>n; n++;
ll a[100001];
rep(i, n) cin>>a[i];
bool ng=true;
rep(i, n) if(a[i]!=0) ng=false;
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pl... | 0 | 73,641,712 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<l... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 85,580,171 |
#include<bits/stdc++.h>
#define lld long long int
#define vec vector<lld>
#define pll pair<lld,lld>
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
#define mod 1000000007
#define answer cout<<endl<<"answer : ";
#define maxn 100005
#define messi ios_base::sync_with_stdio(false);cin.tie(NULL)... | #include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
int main(){
LL n;
LL k;
LL ans;
vector<pair<LL, LL>> ab;
LL tmp_a;
LL tmp_b;
cin >> n >> k;
for(int i=0; i<n; i++){
cin >> tmp_a >> tmp_b;
ab.push_back(make_pair(tmp_a, t... | 0 | 25,517,713 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 205;
int n;
int a[Maxn];
int res;
int main()
{
scanf("%d", &n);
for (int i = 0; i < 2 * n; i++)
scanf("%d", &a[i]);
sort(a, a + 2 * n);
for (int i = 0; i < n; i++)
res += a[2 * i];
printf("%d\n", res);
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
ll n;
cin >> n;
vec a(n)... | 0 | 48,139,597 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #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;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
ll dp[100100];
int main() {
cin >> N;
vector<ll> v;
v.push_back(1);
int tmp = 6;
while (tmp <= N) ... | 0 | 33,029,160 |
#include <iostream>
using namespace std;
int main() {
int m, f, r;
cin >> m >> f >> r;
while(m!=-1||f!=-1||r!=-1){
if(m==-1||f==-1){
cout << "F" << endl;
}else if(m+f >=80){
cout << "A" << endl;
}else if(m+f < 80 && m+f >=65){
cout << "B" << endl;
... | #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>
#in... | 0 | 20,150,717 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int q,t,b;
cin >> q >> t;
map<int,bool>deta;
map<int,int>pena;
string s;
int ac=0,pe=0;
for(int i=0;i<t;i++){
cin >> b >> s;
if(!deta[b]){
if(s=="WA"){
deta[b]=false;
pena[b]++;
}else{
deta[b]=true;
... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
using namespace std;
int n;
struct node{
node* next;
node* prev;
long value;
};
void del(node* p){
p->prev->next = p->next;
p->next->prev = p->prev;
free(p);
return;
}
int main(){
scanf("%d",&n);
node* first = (node*)malloc(sizeo... | 0 | 5,400,536 |
#include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
int main(){
ll n,a,b; std::cin >> n >> ... | 0 | 65,330,862 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,A,B;
cin>>n>>A>>B;
int ans=B-A-1;
if(ans%2==0)
cout<<"Borys";
else
cout<<"Alice";
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N,M;
cin>>N>>M;
vector<vector<char>> A(N,vector<char>(N));
vector<vector<char>> B(M,vector<char>(M));
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
cin>>A[i][j];
}
}
for(int i=0;i<M;i++){
for(int j=0;j<M;j++){... | 0 | 83,233,953 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using graph = vector<vector<int>>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using pii = pair<int, int>;
int main() {
int n,k,s; cin>>n>>k>>s;
if(s!=1000000000){
rep(i,k){cout<<s<<" ";}
rep(i,n-k){cout<<s+1<<" ";}
}
else{
... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 0 | 10,189,075 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<l... | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<iterator>
#include<cmath>
#include<string>
#include<algorithm>
#include<sstream>
#include<queue>
#include<list>
#include<deque>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<chrono>
#include<iomanip>... | 0 | 34,976,283 |
#include<iostream>
using namespace std;
int a[1000];
int cnt[1000];
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i], cnt[a[i]]++;
int mx = 0, mn = 100000;
for (int i = 0; i < n; i++) mn = min(mn, a[i]), mx = max(mx, a[i]);
if (mx % 2 == 0)
{
if (cnt[mn] != 1) {
cout << "Impossible";
... | #include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace ... | 0 | 7,978,163 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <functional>
#include <climits>
#include <cstring>
using namespace std;
#define int long long
#define rep(i, n) for (int i=0;i<(int)(n);++i)
#define r... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define rep(i,N) for(int i=0;i<N;i++)
int main(){
ios::sync_with_stdio(false);
cin... | 0 | 45,333,785 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 998244353
#define INF 1<<30
#define LINF (ll)1<<62
#define MAX 510000
#define rep(i,n) for(ll i=0; i<(n); i++... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define erep(i, n) for (ll i = 0; i <= (ll)(n); ++i)
#define FOR(i,a,b) for (ll i = (a); i < (ll)(b); ++i)
#define EFOR(i,a,b) for (ll i = (a); i <= (ll)(b); ++i)
template<class T>bool chmax(T &a, const... | 0 | 28,249,378 |
#include<iostream>
using namespace std;
int main(void){
int n,a;
scanf("%d%d",&n,&a);
printf("%d",n*n-a);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long x[100005];
long long y[100005];
const ll mod = (ll)1e9+7;
ll mul(ll a, ll b)
{
return (a*b)%mod;
}
int main()
{
int n,m;
scanf("%d %d",&n,&m);
for(int i = 0 ; i < n ; i++)
{
scanf("%lld",&x[i]);
}
for(int i = 0 ; i < m ; i++)
{
sca... | 0 | 18,499,419 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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; }
int main(){
int N, K; cin >> N >> K;
vector<... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int n;cin >> n;
string s;cin >> s;
int ans = 0;
rep(num,1000){
string temp = "";
... | 0 | 64,347,799 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
mt... | #include<iostream>
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered... | 0 | 35,129,272 |
#pragma comment(linker, "/stack:20000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <stdio.h>
#include <bits/stdc++.h>
#include <x86intrin.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define ... | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
while (x != 0 || y != 0) {
cout << min(x, y) << " " << max(x, y) << endl;
cin >> x >> y;
}
return 0;
} | 0 | 48,870,861 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int a[100]={0},b,c=1;
while(cin>>b){
a[b-1]++;
if(a[b-1]>c)
c=a[b-1];
}
for(int i=0;i<100;i++){
if(a[i]==c)
cout<<i+1<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#include<cstring>
using namespace std;
int digit(int n)
{
int temp = 0;
while (n > 0)
{
n /= 10;
temp++;
}
return temp;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n; cin >> n;
int answer = 0;
for (int i = 1;... | 0 | 69,112,483 |
#include "bits/stdc++.h"
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define LOWER_BOUND(A, key) distance(A.begin(),... | #include <bits/stdc++.h>
using namespace std;
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long LL;
typedef pair<int, int> PII;
void f(){
int n;
cin >> n;
LL ans = 0;
LL b = 0, temp = 0;
... | 0 | 96,992,157 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
string S;
cin >> S;
bool flg = false;
for(int n = 0; n <= S.size()-1; n++){
for(int m = 0; m <= S.size()-n; m++){
string T = S;
if... | #include <iostream>
using namespace std;
int main()
{
int h,w;
for( ; ; ){
cin >> h >> w;
if(h==0 || w==0) break;
for(int i=0;i<h;i++){
if(i==0 && i==h-1){
cout << "#";
}
for(int j=0;j<w;j++){
if(j==0 || j==w-1){
cout << "#";
}else if(i==0 || i==h-1){
cout << "#";
}else{
... | 0 | 95,472,330 |
#include <iostream>
using namespace std;
int main(void)
{
int a,b,c,k,n;
cin >> a >> b >> c;
n=0;
for(k=a;k<=b;k++){
if(c%k == 0)
n=n+1;
}
cout << n << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
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;
}
void debug() { cerr << "\n"; }
t... | 0 | 16,020,271 |
#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 len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,N-1,0)
#define RREPS(i,n) RFOR(i,N,1)
#define int long long
#define mp make_pair
#define ... | 0 | 28,558,951 |
#include<bits/stdc++.h>
#define int long long int
#define endl "\n"
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t=1;
while (t--) {
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... | 0 | 8,594,416 |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#define _USE_MATH_DEFINES
#include<math.h>
#include<unordered_map>
#define min(a,b) (a)>(b)?(b):(a)
#define max(a,b) (a)>(b)?(a):(b)
using namespace std;
int main()
{
int n[30] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | 0 | 68,155,630 |
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (t... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
string ans = "None";
for( char a = 'a'; a <= 'z'; a++ ) {
if( S.find( a ) == string::npos ) {
ans = string( 1, a );
break;
}
}
cout << ans << endl;
} | 0 | 89,074,559 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int mtoi( string str );
string itom( int sumi );
int main(int argc, char const *argv[]) {
int n, sumi;
string first, second, sum_str;
vector<string> results;
cin>>n;
for (int i = 0; i < n; i++) {
cin>>first>>second;... | 0 | 12,363,660 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> light(N);
for(int i = 0; i < N ; i++){
cin >> light.at(i);
}
int next = 1;
bool check = false;
int counter = 0;
for(int i = 0; i < N ; i++){
counter++;
next = light.at(next - 1);
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n... | 0 | 38,888,089 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
int main(){
int n,m;
cin >> n >> m;
vector < vector <int> > s(m,vector <int>(0));
vector <int> p(m);
rep(i,m){
int k;
cin >> k;
rep(j,k){
i... | #include <iostream>
using namespace std;
static const int N = 100;
int main(int argc, char const *argv[])
{
int M[N][N];
int n, u, k, v;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
M[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >>... | 0 | 41,272,562 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i,0,n) cin >> h[i];
int ans = 1;
rep(i,1,n) {
bool flag = true;
rep(j,0,i) {
if (h[j] > h[i]) {
... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,N-1,0)
#define RREPS(i,n) RFOR(i,N,1)
#define int long long
#define mp make_pair
#define ... | 0 | 87,709,146 |
#include <iostream>
using namespace std;
int main(){
char c;
cin >> c;
cout << ((c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o') ? "vowel" : "consonant") << endl;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main( void )
{
while( 1 ){
int n, a;
cin >> n;
if( n == 0 ) break;
int minv = 1001;
int maxv = -1;
int s = 0;
for( int i=0; i<n; i++ ){
cin >> a;
s += a;
minv = min( minv, a );
maxv = max( maxv, a );
... | 0 | 62,979,158 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct csf {
int c;
int s;
int f;
};
int main() {
int n;
cin >> n;
vector<csf> a(n);
for (int i = 0; i < n - 1; ++i) {
cin >> a[i].c >> a[i].s >> a[i].f;
}
for (int i = 0; i < n - 1; ++i) {
... | 0 | 38,717,702 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int t,n,i,j,k,l=0,d,q,m,r,x,y,x1,y1;
cin>>n>>m>>d;
map<int,pair<int,int> > m1;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
cin>>l;
m1[l]={i,j};
}
}
int a[n*m+1];
memset(a,0,sizeof(a))... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<unordered_map>
#include<bitset>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long long int MOD = 1e9 + 7;
int main(){
string s;
cin >> s;
s = s + "T";
int x, y;
cin >>... | 0 | 27,968,989 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
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 ... | #include<cstdio>
#include<stack>
#include<iostream>
int main()
{
using namespace std;
int input;
stack<int> st;
while(~scanf("%d",&input))
{
if(input == 0)
{
cout<<st.top()<<endl;
st.pop();
}else
{
st.push(input);
}
}
return 0;
} | 0 | 62,089,992 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++)
{
int a;
cin >> a;
mp[a]++;
}
long long ans = 0;
for (auto p : mp)
{
int id = p.first;
int num = p.second;
if (num... | #include <iostream>
#include <vector>
#include<algorithm>
using namespace std;
int main(void){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0;i < n;i++){
cin >> a[i];
}
long ans = 0;
for(int i = 0;i < n;i++){
if(i == a[a[i] - 1] - 1)ans++;
}
ans /= 2;
cout <... | 0 | 42,354,591 |
#include <iostream>
using namespace std;
#define TIMES(cnt,s,e) for(int cnt=s; cnt<e; ++cnt)
int main(void){
int h,w;
string s;
cin >> h >> w;
TIMES(i,0,h) {
TIMES(j,0,w) {
cin >> s;
if(s == "snuke") {
cout << (char)(65+j) << i+1 << endl;
}
}
}
} | #include <bits/stdc++.h>
typedef long long ll;
#define mod 1000000007
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("outp.txt","w",stdout);
#endif
ll n;cin>>n;
string s;cin>>s;
if(n%2==1)
cout<<"No";
else
{
if(s.substr(... | 0 | 83,929,264 |
#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<bitset>
#include <climits>
#include<set>
#include<bitset>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
ty... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#d... | 0 | 71,228,193 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> h(n);
for(int i=0;i<n;i++)cin>>h[i];
int ans=0;
int res=0;
for(int i=1;i<n;i++){
if(h[i]<=h[i-1])res++;
else res=0;
ans=max(ans,res);
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1001001001;
const int MOD... | 0 | 96,412,247 |
#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 <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#d... | 0 | 73,830,026 |
#include "iostream"
using namespace std;
void sentaku(int a[100], char k[100][2], int num ) {
for (int i = 0; i < num; i++) {
int minj = i;
int s = 0;
for (int j = i; j < num; j++) {
if (a[j] < a[minj]) {
minj = j;
s = 1;
}
}
if (s == 1) {
int b = a[i];
a[i] = a[minj];
a[minj] = b;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }... | 0 | 62,653,423 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
void solve(){
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<min(a,b)+min(c,d)<<endl;
}
signed main(){
solve();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<string>> vvs;
typedef vector<vector<char>> vvc;
typedef vector<vector<bo... | 0 | 74,489,219 |
#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;
ll combination... | #include "bits/stdc++.h"
using namespace std;
#define Rep(i,n) for(int i=0;i<(int)(n);i++)
#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)
#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)
#define put(a) cout<<a<<... | 0 | 78,457,912 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF_LL 1LL << 60
#define INF 99999999
#define MOD (ll)1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, a, n) for(int i = a; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
void put_double(double obj){printf("%... | #include <iostream>
using namespace std;
int main(){
int n,m,p;
while(cin >> n >> m >> p && n){
int x[100];
int a=0,d,ans;
for(int i=0;i<n;i++){
cin >> x[i];
a+=x[i];
}
d=a*100*(100-p)/100;
if(x[m-1]==0)
ans = 0;
else
ans=d/x[m-1];
cout << ans << endl;
}
... | 0 | 85,072,930 |
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<set>
#include<iomanip>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(n);
for(int i = 0; i < n; ++i)
cin >> a[i];
sort(a.begin(), a.end());
for(int i = 0; i < n-1; ++i) {
a[i+1]=(a[i] + a[i + 1]) / 2.0;
}
c... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N,H;
cin >> N >> H;
vector<int>a(N);
vector<int>b(N);
for(int i = 0; i < N; i++) {
cin >> a[i] >> b[i];
}
sort(a.begin(),a.end());
sort(b.begin(),b.end());
reverse(b.begin(),b.end());
... | 0 | 79,244,301 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, a, b, c, d;
cin >> N;
a = N / 1000;
b = (N - 1000 * a) / 100;
c = (N - 1000 * a - 100 * b) / 10;
d = N % 10;
if ((a == b && b == c &&c == d) || (a == b && b == c) || (b == c && c == d))
cout << "Yes" << endl;
else
cout << "No" <<e... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int MOD=1000000007;
int main() {
int n,m,x;
cin >> n >> m >> x;
vector<vector<int>> data(n, vector<int>(m));
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> c.at(i);
for (int j = 0; j < m; j++) {
cin >> data.at(i).at(... | 0 | 30,523,896 |
#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>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 0 | 79,166,003 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
int w;
cin >> S >> w;
for(int i=0;i<S.size();i++){
if(i%w==0){
cout << S.at(i);
}
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | 0 | 82,495,906 |
#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() {
string s, t;
cin >> s;
char pre = s[0];
t.push_back(pre);
for (int i = 1; i < s.size(); i++) {
if (pre != s[i]) {
pre = s[i];
t.push_back(pre... | #include <iostream>
#include <array>
#include <algorithm>
int main()
{
std::array<int, 5> in;
for (auto i = 0; i < 5; i++) {
std::cin >> in.at(i);
}
std::sort(in.begin(), in.end());
for (auto i = 4; i >= 0; i--) {
if (i != 4) {
std::cout << " ";
}
std::cou... | 0 | 85,897,046 |
#include <iostream>
using namespace std;
class Solution{
public:
string process(const string& s){
string res = "";
for(char c: s)
if(c == 'B'){
if(res.size()) res.pop_back();
}
else res += c;
return res;
}
};
int main() {
string s;
... | #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 | 1,609,551 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char a; cin >> a;
if(a <= 'Z') cout << 'A';
else cout << 'a';
} | #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 | 49,560,518 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
int main() {
int A,B;
cin>>A>>B;
string S;
cin>>S;
bo... | #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;
typed... | 0 | 14,272,950 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
string s; cin >> s;
if(s == "snuke"){
cout << char('A'+j-1) << i << endl;
return 0;
}
}
}
return 0;
} | #include <iostream>
using namespace std;
#define ll long long int
ll max(ll a, ll b){
if(a > b) return a;
return b;
}
ll min(ll a, ll b){
if(a < b) return a;
return b;
}
ll Solve(int N, int R, int S, ll* H, ll* Kai){
ll ret = LLONG_MAX>>2;
if(R <= 0){
ret = 0;
}else if(S == 1){
ret = H[R];
}else... | 0 | 62,174,213 |
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int read(){
int x=0,f=1; char ch=getchar();
while (ch<'0'||ch>'9'){if (ch=='-') f=-1; ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
int f[N],d[N];
int find(int x){
if (x==f[x]) return x;
int fa=find(f[x]);
d[x]... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | 0 | 13,164,681 |
#include<iostream>
using namespace std;
int main(){
string a , b , c;
cin>>a>>b>>c;
putchar(toupper(a[0]));
putchar(toupper(b[0]));
putchar(toupper(c[0]));
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>;
int cnt[105];
int dp[105][80];
int main(){
int n;
cin>>n;
rep(i,105)cnt[i]=1;
for(int i=1; i<=n; ++i){
int x=i;
for(int j=2; j*j<=x; ++j){
w... | 0 | 26,941,209 |
#include <bits/stdc++.h>
using namespace std;
int exist[1000005];
int max1;
int min1=0x3f3f3f3f;
int end1;
bool flag[1000005];
void sieve()
{
for(int i=min1;i<=max1;i++)
{
if(exist[i]==1)
{
for(int j=2*i;j<=max1;j+=i)
{
if(exist[j]&&flag[j]==0)
... | #include<bits/stdc++.h>
using namespace std;
const long long INF = 1e7+1;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x)... | 0 | 99,530,019 |
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | #include <bits/stdc++.h>
using namespace std;
bool topologicalSort(const vector<vector<int>>& adj, vector<int>& ord) {
int N = adj.size();
vector<int> deg(N);
for(int i = 0; i < N; ++i)
for(int nv : adj[i])
++deg[nv];
ord.assign(N, -1);
int t = 0;
for(int v = 0; v < N; ++v)
... | 0 | 41,669,546 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int N;
cin >> N;
vector<ll> A(N), B(N);
ll asum = 0;
ll bsum = 0;
vector<ll> margin(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
asum += (ll) A[i];
}
for (int i = 0; i < N; i++)... | #include<bits/stdc++.h>
#define ll long long
#define P pair<ll ,ll>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int r,s,p;
cin >> r >> s >> p;
string t;
cin >> t;
ll ans = 0;
vector<char>was(n ,'x');
for(int i=0;i<n;i++){
if(i-k >=0){
if(was[i-k]!='r... | 0 | 15,084,430 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.