code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<set>
#include<map>
using namespace std;
int main() {
int a;
cin >> a;
if(a == 25){
cout << "Christmas";
}
else if(a == 24){
cout << "Christmas Eve";
}
else if(a == 23){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,M; cin >> N >> M;
int num[10]={2,5,5,4,5,6,3,7,6};
int a[M];
for(int i=0;i<M;i++) cin >> a[i];
string dp[11000];
for(int i=0;i<=N;i++) dp[i]="-";
dp[0]="";
for(int i=0;i<=N;i++){
for(int j=0;j<M;j++){
if(d... | 0 | 12,518,044 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for( int i=a; i<b; i++ )
#define REP(i,n) rep(i,0,n)
#define INF 1000000
using lli = long long int;
using ulli = unsigned long long int;
typedef pair<int, int> P;
struct edge{ int u, v; lli cost; };
struct DirectedGraph
{
int vertex_num;
int edge_num;
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i,n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout<... | 0 | 3,091,207 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000
typedef... | 0 | 82,662,029 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
ll c[200100], d[200100];
int main() {
int m;
cin >> m;
rep(i,m) cin >> d[i] ... | #include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
int flag = 1;
int main(){
cin >> flag;
while(flag){
int temp = 0, score = 0;
int M = 0, m = 1000;
REP(i,flag){
cin >> temp;
score += temp;
M = max(temp,M);... | 0 | 84,030,331 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using ll = long long;
const int inf = 1e8;
int dp[105][105];
int main() {
int n;
cin >> n;
vector<int> p(n+1);
cin >> p[0] >> p[1];... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
int64_t Z=0;
cin>>N>>K;
vector<int> p(N);
for(int i=0;i<N;i++){
cin>>p[i];
p[i]--;
}
vector<int> q(N+1);
map<int,int> m;
m[0]=1;
for(int i=0;i<N;i++){
int j=i+1-K;
if(j>=0){
m[q[j]]--;
}
q[i+1]=(q[i]+p[... | 0 | 5,818,175 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<math.h>
using namespace std;
int main(){
int f=1,i;
int foot[2];
foot[0]=0;
foot[1]=0;
int ans=0,N;
string x;
while (1){
cin >>N;
ans=0;
f=1;
foot[0]=0;
foot[1]=0;
if(N==0)break;
for(i=0;i<N;i++){
cin >> x;
if(x... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template <class Abel> struct BIT {
vector<Abel> dat[2];
Abel UNITY_SUM = 0;
BIT(int n) { init(n); }
void init(int n) { for (int iter = 0; iter < 2; ++iter) dat[iter].assign(n + 1, UNITY_SUM); }
inlin... | 0 | 31,014,155 |
#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
if (x < 0 || y < 0 || x > W || y > H || x - r < 0 || y - r < 0
|| x+r>W||y+r>H){
cout << "No" << endl;
}
if (x > 0 && y > 0 && x < W && y < H && x - r >= 0 && y - r >= 0
&& x + r<=W && y + r... | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
using namespace std;
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;... | 0 | 53,084,124 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int n... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
#define REP(i,m,n) for(LL i=(m);i<(n);i++)
int main()... | 0 | 17,217,333 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using P =pair<ll,ll>;
const ll INF =ll(1e18)+5;
int main() {
ll N;
cin >> N;
vector<ll> v(N);
map<ll,ll> oddMp;
map<ll,ll> evenMp;
for(int i=0;i<N;i++){
cin >> v[i];
if(i %2 ==0){
oddMp[v[i]]++;
... | #include <iostream>
using namespace std;
class Dice{
private:
int top, bottom, north, east, west, south;
public:
void setNumber(){
int n1, n2, n3, n4, n5, n6;
cin >> n1 >> n2 >> n3 >> n4 >> n5 >> n6;
top = n1;
south = n2;
east = n3;
west = n4;
north = n5;
bottom = n6;
}
void roll(){
string command... | 0 | 34,401,028 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
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 ... | #include<vector>
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 100010
#define int long long
#define debug cout<<__LINE__<<" "<<__FUNCTION__<<"\n"
inline int read(){
int x=0,y=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')y=-1;ch=getchar();}... | 0 | 15,563,600 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF=1e9+7,MAXK=1e5+10;
int K;
bool vis[MAXK];
deque<pair<int,int> > dq;
int main(){
scanf("%d",&K);
dq.push_front(make_pair(1,1));
while(dq.size()){
pair<int,int> cur=dq.front();
dq.pop_front();
vis[cur.first]=1;
if(!cur.first){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 40,162,218 |
#include <stdio.h>
#include <stdlib.h>
int main(void){
int a;
int b;
int c;
int d;
scanf("%d %d %d %d",&a,&b,&c,&d);
if (abs(a-c)<=d){
printf("Yes\n");
}else if(abs(a-b)<=d && abs(b-c)<=d){
printf("Yes\n");
}else{
printf("No\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
const int MAXN = 100005;
int n, m;
vector<pi> gph[MAXN];
bool vis[MAXN], bad;
int col[MAXN];
void dfs(int x, int c){
if(vis[x]){
if(col[x] != c) bad = 1;
return;
}
vis[x] = 1;
col[x] = c;
for(auto &i : gph[x]) dfs(... | 0 | 91,757,169 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
string S, T;
cin >> S >> T;
int ans = T.size();
for (int i = 0; i <= S.size() - T.size(); i++) {
int diff = 0;
rep(j, T.size()) {
if (T[j] != S[i + j]) diff++;
}
a... | #include <iostream>
#include <string>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <stack>
#include <math.h>
#include <algorithm>
#define ll long long
#define add push_back
using namespace std;
ll fact(ll n){
ll answ = 1;
for( int i = 1; i <= n; i++){
ans... | 0 | 74,668,815 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int m... | 0 | 4,427,541 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
int main()
{
ll N; cin>>N;
vector<ll> vecA(N);
rep(i,N)
{
cin>>vecA.at(i);
}
sort(vecA.begin(),vecA.end());
reverse(vecA.begin(),vecA.end())... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N;
cin >> N;
f... | 0 | 16,133,656 |
#include <iostream>
#include <map>
using namespace std;
int main(){
int dx[] = {1,0,-1,0,1,1,-1,-1}, dy[] = {0,1,0,-1,1,-1,1,-1};
int H, W, N;
cin >> H >> W >> N;
int a, b;
map<pair<int,int>, int> M;
for(int i = 0; i < N; ++i){
cin >> a >> b;
if(a > 1 && a < H && b > 1 && b < W){
++M[make_pair... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
using namespace std;
constexpr int64_t MOD = 998'244'353;
int main(void) {
int N;
cin >> N;
vector<int> D(N);
for(int i=0; i<N; i++) {
cin >> D[i];
}
if(D[0] != 0) {
... | 0 | 51,910,371 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
int mx = A.at(0) + (K - A.at(N - 1));
for (int i = 1; i < N; i++) {
mx = max(mx, A.at(i) - A.at(i - 1));
}
cout << K - mx << "\n";
} | #include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
#define ll long long
const ll mod=1e9+7;
const int maxn=1e2+5;
const int maxk=1e5+5;
int a[maxn];
ll num[maxk],front[maxk];
void update(int k)
{
front[0]=num[0];
for(int i=1;i<=k;i++)
front[i]=(front[i-1]+num[... | 0 | 21,299,210 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string S;
cin >> S;
if (S.substr(0,4) == "YAKI") cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <fstream>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
#include <random>
#include <numeric>
using namespace std;
#define... | 0 | 5,263,933 |
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
struct Node {
int64_t value{0};
bool visited{false};
vector<int64_t> nexts;
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, Q;
cin >> N >> Q;
vector<Node> nodes... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
vector<... | 0 | 71,087,212 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double Double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template<class T>
inline bool chmin(T &a, T b) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using VPII = std::vector<std::pair<int... | 0 | 5,460,259 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
... | #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<... | 0 | 42,260,672 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main(){
int n; cin >> n;
unordered_map<string,int> str;
ll... | #include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
#define rep(i,a) for(int i=0; i<a; i++)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; ... | 0 | 58,638,218 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
int sum = 0;
ll ans = 0;
int r = 0;
for(int l = 0; ... | 0 | 66,638,807 |
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n;
while(1){
vector<int>vec;
int ans=-100000;
cin>>n;
vector<int>dp(n);
if(n==0)break;
for(int i=0;i<n;i++){
int a;cin>>a;
vec.push_back(a);
}
dp[0]=v... | #include <iostream>
using namespace std;
int main()
{
string s;
cin>>s;
if(s[0]=='R'&&s[1]=='R'&&s[2]=='R') cout<<3;
else if(s[0]=='R'&&s[2]=='R')cout<<1<<endl;
else if(s[0]=='R'&&s[1]=='R')cout<<2<<endl;
else if(s[1]=='R'&&s[2]=='R')cout<<2<<endl;
else if(s[0]!='R'&&s[1]!='R'&&s[2]=='R') co... | 0 | 77,493,465 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, T, U;
cin >> S >> T >> U;
cout << char(S[0] - 32) << char(T[0] - 32) << char(U[0] - 32) << endl;
} | #include <bits/stdc++.h>
#warning !!!check the size of arrayss!!!
#define INF 2000000000000000005
#define MOD 1000000007
#define newMOD 998244353
#define MAX 300006
#define pi 3.1415926535897932384626433832795
#define ll long long
#define int long long
#define P(gg) for(auto rax:gg){cout<<rax<<... | 0 | 52,420,991 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int c[20], dp[50001];
int main() {
scanf("%d%d",&n,&m);
for (int i=0; i<m; i++) scanf("%d", &c[i]);
sort(c, c+m);
for (int i=1; i<=n; i++) {
dp[i] = dp[i-c[0]]+1;
for (int j=1; j<m; j++) {
if (i < c[j]) break;
... | #include <bits/stdc++.h>
using namespace std;
void chmax (int &x, int a) {
x = max(x, a);
}
int h, w;
char s[2004][2004];
set < int > ver_bor[2004], hor_bor[2004];
signed main () {
cin >> h >> w;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
cin >> s[i][j];
if... | 0 | 53,828,608 |
#include <stdio.h>
#define MAX 100
int main(void)
{
int i, j;
char ring[MAX + 1];
char make[MAX + 1];
scanf("%s %s", ring, make);
char ring2[MAX * 2 + 1];
for (i = 0; (ring2[i] = ring[i]) != '\0'; i++){
;
}
int len_ring = i;
for (i = 0; (ring2[len_ring + i] = ring[i]) != '\0'... | #include <iostream>
#include <string>
#include <typeinfo>
struct Card {
char suit;
int value;
};
void traceALDS12C(Card arr[], int max) {
for (int i = 0; i < max; ++i) {
if (i)
std::cout << " ";
std::cout << arr[i].suit << arr[i].value;
}
std::cout << std::endl;
}
void BubbleSort(Card arr[], int N) {
for (... | 0 | 43,275,423 |
#include<iostream>
int main() {
int X,Y;
std::cin >> X >> Y;
std::cout << X + (int)(Y / 2) << std::endl;;;;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <class T>
usi... | 0 | 38,524,469 |
#include<iostream>
#include<vector>
using namespace std;
void primeCal()
{
const int N = 1000000;
vector<bool> prime(N, true);
prime[0] = prime[1] = false;
for (int i = 2; i*i < N; ++i)
{
if (!prime[i])
{
continue;
}
for (int j = i*i; j < N; j += i)
... | #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 | 62,660,911 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef pair<ll,ll> P;
#define fi first
#define se second
#define all(v) (v).begin(),v.end()
const ll inf=(1e18);
const ll mod=1000000007;
const ll mod2=998244353;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/gcd(c,d)*d;}
map<c... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main()
{
ll n, m, min, minNum;
pair<ll, ll> minP;
cin >> n... | 0 | 72,727,865 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
double x,T;
cin >> T >> x;
long double t=T/x;
cout << t << endl;
} | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 6,768,925 |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define pv(val) cerr << #val << '=' << (val) << endl
const int INF = 1e9;
int main(void){
int N, M, K; cin >> N >> M >> K;
bool ok = ... | 0 | 77,883,889 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c)... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define MOD 1000000007
#define INF (1<<30)
#define LINF (lint)(1LL<<56... | 0 | 74,117,035 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
char bef[1000001],aft[10000001],word[100000001];
int main(){
int n,m;
while(cin>>n,n){
for(int i=0;i<n;i++){
cin>>bef[i]>>aft[i];
}
cin>>m;
for(int i=0;i<m;i++){
cin>>word[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << ((c>=a)&&(c<=b)?"Yes":"No") << endl;
} | 0 | 69,283,434 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<vector<int>> A(3,vector<int>(3));
for(int i=0;i<3;i++){
cin >> A.at(i).at(0) >> A.at(i).at(1) >> A.at(i).at(2);
}
int n; cin >> n;
for(int i=0;i<n;i++){
int b; cin >> b;
for(int x=0;x<3;x++){
for(int y=0;y<3;y++){
if(A.... | 0 | 10,227,159 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, k, ans;
cin >> n >> k;
ans=n+2-k+(n+1)*((n+1)*(n+2)/2-(k-1)*k/2)-(n+1)*(n+2)*(2*n+3)/6+(k-1)*k*(2*k-1)/6;
ans%=((int)pow(10, 9)+7);
cout << ans;
return 0;
} | #include<bits/stdc++.h>
#define ford(i,a,b) for(int i=(a);i>=b;i--)
#define rep1(i,a,b) for(int i=(a);(i)<=(b);(i)++)
#define rep(i,a,b) for(int i=(a);(i)<(b);(i)++)
#define ll long long
#define N 105
#define pql priority_queue<ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define rev... | 0 | 43,684,914 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
int N,K;
cin>>N>>K;
int number = 1;
int number2 ;
rep(i,N){
number2 = number*2;
if(number2-number < K){
number = number2;
}else{
... | #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr bool c... | 0 | 46,635,133 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) for(ll i=0;i<n;++i)
#define rep2(i,n) for(ll i=0;i<n;++i)
#define rep3(i,a,b) for(ll i=a;i<b;++i)
#define rep... | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
... | 0 | 50,482,471 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int h,w,d;
cin >> h >> w >> d;
int a[h][w];
vector<pair<int,int>> p(h*w);
rep(i,h)rep(j,w){
cin >> a[i][j];
a[i][j]--;
p[a[i][j]] = make_pair(i,j);
}
vector... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> Cij(H, vector<char>(W));
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >> Cij[i][j];
}
}
for(int i=0; i<2*H; i++){
... | 0 | 42,557,801 |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<string> board(H);
rep(i,0,H-1) cin >> board[i];
string ans = "Yes";
rep(i,0,H-1) {
rep(j,0,W-1) {
if (board[i][j] == '.') continue;
bool ok = false;
if ... | #include <bits/stdc++.h>
#define INF 1000000000000000001
#define ll long long
#define pll pair<ll, ll>
using namespace std;
vector<bool> next(bool fir, bool sec, string& s)
{
vector<bool> res = {fir, sec};
ll N = s.size();
for (ll i = 0; i < N; ++i)
{
if (sec)
{
if (s[i] == 'o')
{
re... | 0 | 44,522,362 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
if(N % K == 0)
cout << 0;
else
cout << 1;
} | #include<iostream>
using namespace std;
int main() {
int a[4][3][10] = {0};
int num;
cin >> num;
int b,f,r,v;
while (cin >> b >> f >> r >> v) {
if (a[b-1][f-1][r-1] == 0) {
a[b-1][f-1][r-1] = v;
num--;
} else {
a[b-1][f-1][r-1] += v;
}
if (num == 0) break;
}
for (int i =... | 0 | 67,957,031 |
#include "bits/stdc++.h"
#define ll long long
#define mp(a, b) make_pair(a, b)
using namespace std;
typedef pair<ll, ll> pairs;
typedef pair<ll, pairs> tpl;
ll dp[101][100001], a[1001], sum, mod = (ll)1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, k;
cin >> n >> k;
for (ll i =... | #pragma GCC optimize ("Ofast")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define FOR(i,j,n) for (int i=(int)(j);i<(n);i++)
#define REP(i,n) for (int ... | 0 | 91,179,843 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll N, K, R, S, P;
cin >> N >> K >> R >> S >> P;
string T;
cin >> T;
ll ans = 0;
rep(i, 0, N){
if(i + K < N && T[i + K] == T[i]){
... | #include<iostream>
using namespace std;
int main(){
int h, w, k;
cin >> h >> w >> k;
char c[h][w];
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cin >> c[i][j];
}
}
int ans = 0;
for(int i = 0; i < 1<<h; i++){
for(int j = 0; j < 1<<w; j++){
... | 0 | 94,672,206 |
#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... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <numeric>
#include <deque>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <limits>
#def... | 0 | 80,073,657 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const double PI = acos(-1.0);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W;
while(1) {
cin >> H >> W;
if(H == 0 && W == 0) break;
for(int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
if(i... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii... | 0 | 91,944,755 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstddef>
#include<queue>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
int n, m, pin, ac = 0, wa = 0;
cin >> n >> m;
vector<vector<string>> p(n, vector<string>(0));
vector<string> s(m);... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;}
template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;}
using ll = l... | 0 | 30,565,578 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | #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_set>
#include<util... | 0 | 88,864,154 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
using namespace std;
const int MOD=1000000007;
const int MOD2=998244353;
const ll MAX=91... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | 0 | 86,455,377 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
void compress(vector<int> &a){
vector<int> b = a;
sort(b.begin(), b.end());
for(auto &x : a){
x = lower_bound(b.begin(), b.end(), x) - b.begin();
}
}
int main(){
ios::sync_with_stdio(false)... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<l... | 0 | 61,420,386 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define cint cpp_int
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPR(i,a,n) for(int i=a;i>n;--i)
#define RUP(a,b) (((a)+(b)-1)/(b))
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define mt make_tup... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | 0 | 39,412,204 |
#include<iostream>
#include<math.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define lrep(i,n) for(long int i=0;i<(n);i++)
using namespace std;
int main(){
double a;
cin >>a;
string b;
cin >>b;
unsigned long long int c=a,d=b[0]*100+b[2]*10+b[3]-111*'0';
cout<<(c*d/100);
} | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
template <class T, class U> ostream &operator<<(ostream &os,... | 0 | 1,738,308 |
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n == 1) n = 14;
if (m == 1) m = 14;
if (n > m) cout << "Alice\n";
else if (n < m) cout << "Bob\n";
else cout << "Draw\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll num = 998244353;
ll ex(ll x,ll n){
if(n==0)return 1;
else if(n%2==1)return ex(x,n-1)*x%num;
else return ex(x*x%num,n/2)%num;
};
int main(){
ll n;
cin >> n;
vector<ll> d(n);
unordered_map<ll,ll> mp;
ll ans = ... | 0 | 72,897,229 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#define rep(i, a) REP(i, 0, a)
#define REP(i, a, b) for(int i = a; i < b; ++i)
type... | #include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) for (int i=0;i<(n);++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
REP(i, N) cin >> S[i];
int result = 0;
REP(A, N) {
function<char(int, int)> T = [&](int i, int j) {
... | 0 | 27,298,238 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void)
{
int n;
string s1,s2;
string kurai = "mcxi";
vector<int> v1(4),v2(4);
vector<int> sum(4);
int temp;
char c;
int i,i1,i2;
cin >> n;
for(i=0; i<n; i++){
cin >> s1 >> s2;
for(i1=0; i1<4; i1++){
v1[i1] = 0;
v2[... | 0 | 80,831,871 |
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <stack>
#include <vector>
#include <stdio.h>
using namespace std;
int n;
string s;
char s1;
int k;
int main() {
cin >> n >> s >> k;
s1 = s[k - 1];
for (int i = 0; i < n; i++) {
if (s1 != s[i]) s[i] = '*';
}
cout << s << endl;
r... | #include <iostream>
#include <cstdio>
using namespace std;
const int MAX_N = 10000;
struct UnionFind
{
int par[MAX_N];
int rank[MAX_N];
void init(int n){
for(int i = 0; i < n; i++){
par[i] = i;
rank[i] = 0;
}
}
int find(int x){
if(par[x] == x) return x;
else return par[x] = find(pa... | 0 | 28,185,553 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 | 48,108,838 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(int)(n); i++)
int main(){
int i, N, M, a, b, ans=0; cin >> N >> M; vector<int> ar(N-1);
map<pair<int, int>, bool> C;
REP(i, M){ cin >> a >> b; a--; b--; C[make_pair(a, b)]=true; C[make_pair(b, a)]=true; }
REP(i, N-1){ ar[i]=i; }
do {
bool... | #include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_st... | 0 | 14,187,560 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a... | #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<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define _GLIBCXX_DEBUG
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_el... | 0 | 67,718,925 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define L 0
#define R 1
int main(){
lli n;
cin>>n;
n*=2;
string s;
cin>>s;
lli data[200010];
... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int... | 0 | 98,361,397 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sstream>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for ... | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
int m = (n-1) * (n-2) / 2 - k;
if (m < 0) {
cout << -1 << endl;
return 0;
}
cout << n-1+m << endl;
... | 0 | 93,580,180 |
#include <bits/stdc++.h>
using namespace std;
#define BROKE 1
int main() {
int64_t n,m;
cin>>n>>m;
vector<int64_t> broken(n+1);
for(int i=0;i<m;i++){
int wk=0;
cin>>wk;
broken.at(wk)=BROKE;
}
vector<int64_t> route(n+1);
route.at(0)=1;
for(int i=1;i<=n;i++){
int route1,route2;
if(brok... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, k;
while( cin >> n >> k, n+k ) {
int max_sum, sum = 0, data[100000];
for(int i=0; i<k; i++) {
cin >> data[i];
sum += data[i];
}
max_sum =sum;
for(int i=k; i<n; i++) {
cin >> data[i];
sum -= data[i-k];
s... | 0 | 12,758,431 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int a, b;
cin >> a >> b;
if (a == 1)
{
a *= 100;
}
if (b == 1)
... | #include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typedef vecto... | 0 | 46,972,209 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
sort(all(A), greater<>());
ll ans = 1;
int cnt = 0;
rep(i, ... | #include<bits/stdc++.h>
#define ll long long int
#define INF 0x3f3f3f3f
#define pb push_back
#define se second
#define fi first
using namespace std;
const int N=1e5+5;
int vis[N],grundy[N];
vector<int> g[N];
void dfs(int u){
vis[u]=1;
for(int v:g[u]){
if(vis[v]) continue;
dfs(v);
grundy[... | 0 | 69,914,153 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
ll gcd(ll x, ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x, ll y){
return x/gcd(x,y)*y;
}
ll f(ll x, ll c,... | #include<bits/stdc++.h>
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++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
typedef long long ll;
const ll MOD = 1e9+7;
const int MAX = 100005;
long long fac[MAX], finv[MAX], inv[MAX];
void CO... | 0 | 74,504,961 |
#include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define ll... | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespa... | 0 | 26,847,262 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main(){
int n;cin>>n;
vector<ll> a(n);
rep(i,n)cin>>a[i];
vector<ll> sum(n+1);
rep(i,n)sum[i+1]=sum[i]+a[i];
map<ll,ll> mp;
rep(i,n+1)mp[sum[i]]++;
ll an... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#defin... | 0 | 48,879,541 |
#include<bits/stdc++.h>
using namespace std;
string up = "QWERTYUIOPLKJHGFDSAZXCVBNM";
string down = "qwertyuioplkjhgfdsazxcvbnm";
signed main(){
char x;
cin>>x;
for(int i=0;i<26;i++){
if(x==up[i]){
cout<<'A';
return 0;
}
if(x==down[i]){
cout<<'a';... | #include <bits/stdc++.h>
#include<math.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 PI 3.14159265358979323846264338327950
#define INF 1e18
int main () {
int n ;
cin >> n;
int ans = 0;
for(int i = 1; i <= n; i++){
... | 0 | 74,175,351 |
#include<iostream>
#include <vector>
using namespace std;
int main() {
long long int n, a, b;
cin >> n >> a >> b;
long long int ans = 0;
ans += (n / (a + b)) * a;
if(n % (a + b) > a) {
ans += a;
}
else {
ans += n % (a + b);
}
cout << ans << "\n";
} | #include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#... | 0 | 85,565,355 |
#include<bits/stdc++.h>
using namespace std;
#define p pair<int,int>
int N, M;
char A[10];
int num[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
string dp[10010];
int main(){
cin >> N >> M;
for(int i = 0; i < M; i++){
cin >> A[i];
if(dp[num[A[i] - '0']] == ""){
dp[num[A[i] - '0']] = A[i];
... | #include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
typedef double ld;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0... | 0 | 89,075,864 |
#include <bits/stdc++.h>
#include <string.h>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
int main(){
string s;
cin>>s;
int a=0,b=0;
for(i... | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return re... | 0 | 38,882,367 |
#include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main()
{
int a,b,k;
cin >> a >> b >> k;
ll... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()... | 0 | 55,746,141 |
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
using namespace std;
int main(void)
{
string str;
getline(cin, str);
vector<string> vStr;
while (str.find(' ') != -1)
{
vStr.push_back(str.substr(0, str.find(' ')));
str.erase(0, str.find(' ') + 1);
}
vStr.push_back(str);
int a, b, c... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define mod 1000000007
#define pb emplace_back
#define mp make_pair
#define fi first
#define sec second
typedef long long ll;
ty... | 0 | 58,030,479 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (y % 2 == 1){
cout << "No" << endl;
}
else {
int min = (y / 4) + (y - 4 * (y / 4)) / 2;
int max = y /2;
if (min <= x && x <= max){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
... | #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 rep1(i,n) for (int i = 1; i <= (int)(n); i++)
int main()
{
int n,k;
cin >> n >> k;
ld p[n+1];
rep1(i,n)
{
int score = i;
if(score >= k)
{
w... | 0 | 33,478,410 |
#include <iostream>
#include <map>
#include <string>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,b) loop(i,0,b)
int f(string const & s){
int p = 0, res = 0;
while(p < (int)s.size()){
int n = 0;
while(isdigit(s[p])){
n *= 10;
n +=... | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
auto check = [&](int b) {
map<int, int> s;
for (int i = 0; i < n - 1; ++i) {
if (a[i] >= a[i + 1]) {
while (!s.empty() && s.rbegin(... | 0 | 91,378,828 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
const int INF = 1LL<<30;
char fi[1010][1010];
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int dist[1010][1010];
int main() {
int h,w;
cin>>h>>w;
rep(i,h) rep(j,... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <t... | 0 | 19,974,520 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
#define INF 1020304050
int main()
{
int n;
cin >> n;
vector<int> x(n-1);
vector<int> y(n-1);
int i;
rep(i,n-1)
{
cin >> x[i] >> y[i];
x[i]--... | #ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#define NDEBUG
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
int main()
{
int n, m;
cin >> n >> m;
struct Shop { large price, count; };
auto shop = vector<Shop>(n);
for (auto& i : sho... | 0 | 78,448,140 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll N, X, M;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> N >> X >> M;
ll curr = X;
vector < ll > path; path.push_back(curr);
set < ll > vis; vis.insert(curr);
ll hf, result = curr, req = N - 1;
for (int i = 2; i <= N; i ++){
cur... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
void a_hotel_easy(void) {
int n, k, x, y;
cin >> n >> k >> x >> y;
int sum = 0;
if (n > k) {
sum = x * k + y*(n-k);
}
else sum = x * n;
cout << sum << endl;
... | 0 | 88,724,486 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using vll = vector<ll>;
using vld = vector<ld>;
using vpl = vector<pll>;
using vvll = vector<vll>;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((... | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, n;
cin >> k >> n;
vector<int> v;
int result = k;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
if (i > 1) {
int d = (k - x) + v[i-1];
if (d < result) {
... | 0 | 67,946,875 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s = to_string(n);
int cnt = 1;
for (int i = 1; i < s.size(); ++i) {
if (s[i] == s[i-1]) {
++cnt;
if (cnt == 3) {
printf("Yes\n");
return 0;
}
... | 0 | 34,302,603 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
if (s.size() > 3 && s.substr(0, 4) == "YAKI")
cout << "Yes\n";
else
cout << "No\n";
ret... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
const double PI = 3.1415926535897932;
ll cnt[1010];... | 0 | 66,336,757 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <bitset>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ld... | #include <iostream>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
long long res=0;
for(int i=0;i<=N;i++){
int tmp=i, sum=0;
while(1){
sum+=tmp%10;
if(tmp/10 == 0) break;
else tmp/=10;
}
if(A<=sum && sum<=B) res+=i;
}
co... | 0 | 79,787,472 |
#include <bits/stdc++.h>
#define int long long
#define ci(m) for(int i=0;i<m;i++)
#define cj(m) for(int j=0;j<m;j++)
#define ck(m) for(int k=0;k<m;k++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
string a = "qwertasdfgzxcvb";
string b = "yuiophjklnm";
string s;
while (getline(cin, s)) {
if (s == "#") {
break;
}
if (s.size() == 1) {
cout << 0 << endl;
continue;
}
vector<int> c;
... | 0 | 40,614,190 |
#include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
#define vl vector<long long>
#define vvl vector<vector<long long>>
#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++)
using pll = pair<long long,long long>;
#... | 0 | 40,702,530 |
#include <iostream>
#include <queue>
using namespace std;
int main(int argc, char* argv[]) {
queue<int> q;
int x, y;
cin >> x >> y;
while(!(x == 0 && y == 0)){
q.push(x);
q.push(y);
cin >> x >> y;
}
while(!q.empty()){
x = q.front();
q.pop();
y = q.front();
q.pop();
for(int j ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N;
ll a[50];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = 0; i < 10000;... | 0 | 62,402,227 |
#include<bits/stdc++.h>
using namespace std;
#define pf printf
#define PF(a) printf("%d\n",(a))
#define PF2(a,b) printf("%d %d\n",(a), (b))
#define PF3(a,b,c) printf("%d %d %d\n",(a), (b), (c))
#define PFL(a) printf("%lld\n",(a))
#define PFL2(a,b) ... | #define _USE_MATH_DEFINES
#include <cmath>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <limits>
#include <cstring>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, ... | 0 | 72,259,744 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int INF = 2e9;
int main(){
int r,g,b,n;
cin >> r >> g >> b >> n;
int x,y,z;
int ans = 0;
x = n/r + 1;
y = n/g + 1;
rep(i,x){
rep(j,y){
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string n;
long long i,l,j,k,s=0;
cin>>n;
l=n.length();
for(i=0;i<l;i++){
s+=(n[i]-48);
}
if(s%9==0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 0 | 30,540,005 |
#include <iostream>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
int cnt[26];
for (int i = 0; i < 26; ++i) cnt[i] = 0;
for (int i = 0; i < n; ++i) cnt[s[i] - 'a']++;
long long ans = 1;
for (int i = 0; i < 26; ++i) {
ans *= (long... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | 0 | 100,595,780 |
#include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
int k, a, b;
cin >> k >> a >> b;
++k;
ll ans =... | #include<iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
using namespace std;
int gcd(int p, int q) {
if (p % q == 0)return q;
return gcd(q, p % q);
}
int main()
{
double l;
cin >> l;
double o;
if ((int)l % 3 == 0) {
o = (l / 3)*(l / 3)*(l / 3);
... | 0 | 68,961,432 |
#include <bits/stdc++.h>
using namespace std;
int ans = 0;
void OnestrokePath(int n,vector<vector<int>> &ABC,vector<bool> &ok) {
bool ok2 = true;
for(int i = 0; i < ok.size(); i++) {
if(ok[i] == false && i != n) {
ok2 = false;
}
}
if(ok2) {
ans++;
return;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define bit(k) (1LL<<(k))
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> X(N), Y(N);
for(int i = 0; i < N;i++)cin >> X[i] >> Y[i];
int wa = abs(X[0])+abs(Y[0]);
for(int i = 0; i < N;i++){
... | 0 | 71,870,950 |
#include <iostream>
int main(){
int n, debt = 100000;
std::cin >> n;
for(int i = 0; i < n; ++i){
debt *= 1.05;
if(debt % 1000 != 0){
debt += 1000;
debt -= debt % 1000;
}
}
std::cout << debt << std::endl;
return 0;
} | #include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <t... | 0 | 62,057,401 |
#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... | #include <bits/stdc++.h>
using namespace std;
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vector<vector<t>>;
typedef long long ll;
typedef vc<int> vi;
typedef vvc<int> vvi;
typedef pair<int, int> pi;
#define uset unordered_set
#define umap unordered_map
#define endl "\n"
#define fi first
#de... | 0 | 43,076,544 |
#include <iostream>
#include <array>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
for (int i = 0; i < n; i++){
array<int, 3> edge;
for (int i = 0; i < 3; i++){
cin >> edge[i];
}
sort(edge.begin(), edge.end());
if (pow(edge[0], 2) + pow(edge[1], 2) == pow(edge[2], 2)){
cout <... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, co... | 0 | 76,752,033 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); ... | 0 | 97,828,542 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
a=(a+11)%13;
b=(b+11)%13;
if(a>b){
cout << "Alice" << endl;
}else if(a<b){
cout << "Bob" << endl;
}else{
cout << "Draw" << endl;
}
} | #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--)
... | 0 | 1,381,345 |
#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
int main(){
string s;cin >> s;
if(s == "zyxwvutsrqponmlkjihgfedcba"){
cout << "-1\n";return 0;
}
int n = s.size(),i,j;
bool use[26] = {};
for(i=0;i<n;i++) use[s[i]-'a']... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
for (int i = 0; i < N; i++){
if (S.at(K - 1) == S.at(i)... | 0 | 41,829,361 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << min(p + q, min(q + r, r + p)) << endl;
} | #include <iostream>
#include <map>
#include <cmath>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <numeric>
using namespace std;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T1, cla... | 0 | 81,159,563 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n;
string s;
cin >> n >> s;
map<char,int> mp;
for(int i = 0; i < n; i++) mp[s[i]]++;
ll an... | 0 | 11,505,250 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> Pl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll A[101010];
ll n, s, k, c;
void die() { cout << "NO" << endl; exit(0); }
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
ll i, t;
cin >> n;
for(i=0; i<n; i++){
cin >> A[i];
s += A[i];
}
k = s / (n * (n + 1) / 2);
if(!k || s % k !... | 0 | 78,103,662 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define MAX 1e18
#define MIN -1e18
#define MOD 1000000007
#define base 139
#define base2 31
#define memz(a) memset(a, 0, sizeof(a))
#define memn(a) memset(a, -1, sizeof(a))
#define in1(a) scanf("%lld", &a)
#define in2(a, b) scanf("%lld%lld", &a, &b)
#def... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <list>
#include <numeric>
#include <map>
#include <cmath>
#include <string>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef l... | 0 | 3,797,570 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF 1000000007
#define mod 1005
#define ll long long int
const double mx = 2e6 + 5 ;
void solve()
{
ll ans = 0;
ll b = 0;
string s;
cin>>s;
REP(i, s.length())
{
if(s[i]=='B')
... | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
int main() {
in... | 0 | 31,797,864 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.