code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
int N, M;
Graph G;
void solve() {
vector<int> dist(N, -1);
vector<int> prev(N, -1);
queue<int> que;
que.push(0);
dist[0] = 0;
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto nv : G[v]) {
if (... | 0 | 10,393,401 |
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
cin >> s;
for(int i=1; i<s.size(); i++) {
if(s[i-1] == s[i]) {
cout << i << ' ' << i+1 << endl;
return 0;
}
}
for(int i=2; i<s.size(); i++) {
if(s[i-2] == s[i]) {
... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.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;
}
templ... | 0 | 82,186,057 |
#include <bits/stdc++.h>
using namespace std;
double relative(double ax,double ay,double bx,double by){
return ax*by-ay*bx;
}
int main(void){
double x1, y1, x2, y2, x3, y3, xp, yp;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&xp,&yp)!=EOF){
double r1=relative(x1-x3, y1-y3, ... | #include<bits/stdc++.h>
using namespace std;
#define mem(a,b) memset((a),b,sizeof((a)))
#define fpre(x) cout<<fixed<<setprecision(x)
#define clr(v) (v).clear()
#define pii pair<int,int>
#define pdd pair<double,double>
#define pli pair<ll,int>
#define pll pair<ll,ll>
#define mp make_pair
#define eb emplace_back
#define ... | 0 | 12,395,086 |
#include <iostream>
using namespace std;
int main()
{
unsigned int n;
cin >> n;
unsigned long long fractal = 1;
do
{
fractal *= n;
}
while(--n > 0);
cout << fractal << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
vector<ll> a(n);
for(i = 0;i < n;++i){
cin >> a.at(i);
}
ll INF = 1e14;
... | 0 | 15,586,342 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(ll i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#de... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define tr... | 0 | 83,887,992 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
char buffer[51];
bool IsPalindromic(const int32_t num) {
snprintf(buffer, sizeof(buffer), "%d", num);
const string str = string(buffer);
const int32_t length = static_cast<int32_t>(str.length());
int32_t start... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using pint=pair<int,int>;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define el '\n'
#def... | 0 | 52,734,352 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.... | #include <bits/stdc++.h>
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000... | 0 | 86,490,877 |
#include<iostream>
#define N 10
using namespace std;
int main(){
int i, j;
for(i = 1; i < N; i++){
for(j = 1; j < N; j++){
cout<<i<<"x"<<j<<"="<<i * j<<endl;
}
}
return 0;
} | #include <stdio.h>
int main() {
long long int r[100005], n, calc = 1;
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &r[i]);
}
for (int i = 0; i < n; i++) {
if (r[i] == 0) {
printf("0");
return 0;
}
}
for (int i = 0; i < n; i++)... | 0 | 63,037,508 |
#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 <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <map>
using namespace std;
using ll = long long int;
int main(){
int N;cin>>N;
vector<int> A(N);
map<int,int> m... | 0 | 45,839,091 |
#include <bits/stdc++.h>
using namespace std;
#define NIL -1
#define MAX 250
int heap[MAX+1];
int parent(int i) { return i/2;}
int left(int i) {return 2*i;}
int right(int i){return 2*i + 1;}
int main(){
int H;
scanf("%d", &H);
for(int i=1; i<=H; i++){
scanf("%d", &heap[i]);
}
for(int i=1; i<=H; i++){
... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize "O3"
#define rep(i,a,n) for(long long i=a; i<n; i++)
typedef long long ll;
typedef pair<int,int> P;
const ll MOD = (int)1e9+7;
const ll INF = MOD*MOD;
const double EPS = 1e-9;
const ll powll = 1LL<<1;
int main(void){
int h,w; cin >> h >> w;
stri... | 0 | 2,111,227 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz size()
#define pb(x) push_back(x)
#define bg begin()
#define ed end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define mp(x,y) make_pair(x,y)
const ll MOD=1000000007;
const ll INF=1000000000000000;
vector<l... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rep1(i,n) for(int i=1;i<=(int)(n);++i)
#define rep11(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define repm(i,n) for(int i=(in... | 0 | 12,550,109 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define println(x) cout << x << endl;
using namespace std;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
rep... | 0 | 23,149,685 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, k;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
vector<ll> a(n);
for (auto& i : a) cin >> i;
sort(a.begin(), a.end());
if (k > a[n - 1]) {
cout << "IMPOSSIBLE";
return 0;
}
ll gc... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | 0 | 67,726,018 |
#include<stdio.h>
int main(){
char str[21];
int i,j;
scanf("%s",str);
for(i = 0; str[i] != '\0'; i++){
}
for(j = i-1; j > -1; j--){
printf("%c",str[j]);
}
puts("");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int num = 1, cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] == num) {
... | 0 | 27,482,643 |
#include <bits/stdc++.h>
using namespace std;
int n;
int MAXIMUM=100005;
long INF = 1e15;
int W=0,G=1,B=2;
vector<pair<int,int>> adj[100005];
long d[100005];
void dijkstra(int K){
priority_queue<pair<int,int>> PQ;
int u,minv;
int color[MAXIMUM];
for(int i=0;i<n;i++){
d[i]=INF;
color[i]=W;
}
d[K]=0;
... | #include<iostream>
#include<cmath>
using namespace std;
double ts(double x1,double x2,double x3,double y1,double y2,double y3){
return fabs(((x1*y2+x2*y3+x3*y1)-(x3*y2+x2*y1+x1*y3))/2);
}
int main(){
double x1,x2,x3;
double y1,y2,y3;
double xp,yp;
while(cin>>x1){
cin>>y1>>x2>>y2>>x3>>y3>>xp>>yp;
double S,s1,s2... | 0 | 97,831,729 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <stdio.h>
#define rep(i,o,u) for(int i = o;i <= u; i++)
typedef unsigned long long ll;
using namespace std;
struct point{
double x;double y;
};
void solve(int n,point a,point b){
if(n == 0) return ;
point s,t,u;... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | 0 | 10,925,959 |
#pragma region
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
using namespace std;
typedef long long ll;
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define all(x) ... | #include<bits/stdc++.h>
#define ll long long
#define fornum(A,B,C) for(A=B;A<C;++A)
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
#define INF (ll)1e18
ll N,A[202020];
ll mk[202020];
ll i, j, k,ans;
void no(){
printf("-1\n");
exit(0);
}
pll calc(ll d,ll mx){
if(d==N){
if(mx<A... | 0 | 72,704,101 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin>>n>>m;
vector<vector<int>> job(m+1);
rep(i,n){
int a,b;
cin>>a>>b;
if(a<=m) job[a].pb(b);
}
int ans = 0;
priority_queue<int> q;
rep(i... | 0 | 47,708,962 |
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ar array
#define ll long long
#define ld long double
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#defi... | #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#define mp make_pair
#... | 0 | 71,022,840 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
string n; cin >> ... | #include <stdio.h>
int main(void)
{
int array[9][9];
int i,j;
for(i=0;i<9;i++){
for(j=0;j<9;j++){
array[i][j]=(i+1)*(j+1);
printf("%dx%d=%d\n",i+1,j+1,array[i][j]);
}
}
return 0;
} | 0 | 63,376,182 |
#include <bits/stdc++.h>
using namespace std;
int N, A[100000];
vector<int> edges[100000];
int64_t up[100000];
void fail(){
cout << "NO" << endl;
exit(0);
}
void dfs(int i, int par){
if(par >= 0 && edges[i].size() == 1){
up[i] = A[i];
return;
}
vector<int64_t> vs;
int64_t s = 0, ... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<map>
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; } retu... | 0 | 99,586,795 |
#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 m... | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
long long i, cnt=0, ans=0;
cin>>s;
for(i=0; i<s.size(); i++)
{
if(s[i]=='B')
cnt++;
else
ans+=cnt;
}
cout<<an... | 0 | 12,949,917 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100100;
int n;
ll dp[N][2], rem[N][2], a[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1][0] = a[1] / 2;
rem[1][0] = a[1] % 2;
for (int i = 2; i <= n; i++) {
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]) ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <math.h>
#include <complex>
using namespace std;
#define rep(i,n) for (int i=0; i < (n); i++)
typedef double D;
typedef complex<D> P;
typedef pair<P, P> L;
typedef vector<P> VP;
const D EPS = (1e-10);
#define X real()
#defi... | 0 | 3,285,570 |
#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... | #include <iostream>
#include <string>
using namespace std;
int main(void){
string num, sub;
int m, h;
while(cin >> num){
if(num == "-") break;
cin >> m;
for(int i = 0; i < m; i++){
cin >> h;
sub = num.substr(0, h);
num = num.erase(0, h);
num += sub;
}
cout... | 0 | 30,559,024 |
#include<iostream>
using namespace std;
int main(){
char a;int b,sum=0;
while(1){
a=cin.get();
b=(int)a-48;
if(b>=10||b<0)break;
sum+=b;
}
if(sum%9==0)cout<<"Yes";
else cout<<"No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int main(){
int n;
cin>>n;
string s,t;
while(n--){
cin>>s>>t;
int si=0;
rep(i,s.size()... | 0 | 15,404,392 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cstring>
typedef long long llong;
using namespace std;
int main() {
char strin[1010];
int a, b;
int q;
char querin[10];
char repin[1100];
char revin[1100];
scanf("%s", strin);
getchar();
cin >> q;
for (int i = 0; i < q; i++... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
#define fore(i,a) fo... | 0 | 19,872,202 |
#include<bits/stdc++.h>
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define pi(x) printf("%d",x)
#define pl(x) printf("%lld",x)
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define re register
#define rep(i,m,n) for(int i=m;i<=n;i++)
#define per(i,n,... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 | 92,486,955 |
#include<cstring>
#include<algorithm>
#include<cstdio>
#define N 100005
using namespace std;
struct ab{
int a,b;
};
ab a[N];
int cmp(ab x,ab y){
return x.a<y.a;
}
int n;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i].a);
a[i].b=i;
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++){
printf("%d ",a[i].b);
... | #include <iostream>
#include <string>
#include <math.h>
#include <stdio.h>
#include <ctype.h>
using namespace std;
int main() {
string E[1000];
int n=0;
while(cin>>E[n]){
n++;
}
int B[1000]={0};
for(int i=0; i<n; i++){
for(int j=i; j<n; j++){
if(E[i]==E[j]){
... | 0 | 1,932,095 |
#include <bits/stdc++.h>
#define FOR(i, a, n) for(int (i) = (int)(a); (i) < (int)(n); ++(i))
#define FORe(i, a, n) for(int (i) = (int)(a); (i) <= (int)(n); ++(i))
#define rFOR(i, a, n) for(int (i) = (int)(n)-1; (i) >= (int)(a); --(i))
#define rFORe(i, a, n) for(int (i) = (int)(n); (i) >= (int)(a); --(i))
#define REP(i,... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ll = long long;
int const NMAX = 200 + 11;
ll const INF = 1e15;
int n, m, g[NMAX][NMAX];
ll dist[NMAX][NMAX];
void floyd_warshall(void)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (i... | 0 | 97,197,984 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N,M;
cin >> N >> M;
vector<pair<int,int> > vec(N);
rep(i,N){
cin >> vec[i].... | 0 | 77,484,680 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | #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()
#define mod 1000000007
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> flowers(n);
rep(i, n) cin >> flowers[i];
int cnt = 0;
for(int i=1; i<=100; i++){
bool s =... | 0 | 72,299,416 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k,a,b;
cin >> k >> a >> b;
cout << (b-(b%k)>=a?"OK":"NG");
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>;
void solve() {
ll n;
cin >> n;
if (n & 1) {
cout << 0 << endl;
return;
}
n /= 2;
ll k = 5;
ll ans = 0;
while (k <= n) {
ans ... | 0 | 21,691,570 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n,m,c;
cin>... | #include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <set>
using ll = long long;
using namespace std;
int monmo(char ms){
if(ms=='R')return 3;
else if(ms=='G')return 2;
else if(ms=='B')return 1;
else co... | 0 | 9,666,144 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
using namespace std;
const int MAX = 13;
int n;
string cmd;
string s;
set<string> S;
int main() {
ios:... | #include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>
#include <math.h>
#include <cmath>
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include<bitset>
#in... | 0 | 97,356,411 |
#include <bits/stdc++.h>
using namespace std ;
int main()
{
int a ;
cin >> a ;
if(a%10==7){cout<<"Yes" ;}
else {a=a/10 ;
if(a%10==7){cout << "Yes" ;}
else {a=a/10 ;
if(a%10==7){cout << "Yes" ;}
else cout << "No" ;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX_N 100
#define MAX_T 200
#define MAX_V 100
double dp[MAX_T*MAX_N*2+2][MAX_V*2+2];
ll ttov[MAX_T*MAX_N*2+2];
ll nowt = 0, sumt;
int main(){
long long N;
scanf("%lld",&N);
vector<long long> v(N-1+1);
vector<long long> t(N-1+1);
for(int i... | 0 | 13,128,756 |
#include <stdio.h>
int main(){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a<b)
{
if(b<c)printf("%d %d %d\n",a,b,c);
}
if(a==b)
{
if(b==c)printf("%d %d %d\n",a,b,c);
}
if(b<a)
{
if(a<c)printf("%d %d %d\n",b,a,c);
if(a==c)printf("%d %d %d\n",b,a,c);
}
if(c<a)
... | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
#include<unordered_set>
#inclu... | 0 | 31,214,090 |
#include<bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define F first
#define S second
#define pb push_back
const int N=1e5+5, INF=1e9;
using namespace std;
int n, ans = 0;
vector<int> v;
signed main()
{
bool flag=false;
cin >> n;
for(int i = 0; i < n; i++)
{
int a, b;
... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par, size;
UnionFind(int x) {
par.resize(x);
size.resize(x, 1);
for (int i = 0; i < x; i++) {
par[i] = i;
}
}
int find(int x) {
if (par[x] == x)
return x;
... | 0 | 29,942,167 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #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 dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> a(h, vector<char>(w));
rep(i, h) rep(j, w) cin >> a[i][j];
vect... | 0 | 58,988,662 |
#include <algorithm>
#include <array>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <utility>
#include <vector>
#define FOR(i,a,b) for (int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for (int i=(a);i>=(b);--i)
#define REP(i,n) for (int i=0;i<(n);i++)
#d... | #include <bits/stdc++.h>
#define int long long
#define S second
#define F first
#define pb push_back
#define sz size()
using namespace std;
const int N=1e6+7;
const int mod=1e9+7;
int b[N],c[N],dp[2000][2000] ;
int n,x=1,ans,k,w,m ;
char a[2000][2000] ;
vector < int > vec ;
vector < int > pos ;
multiset < int > st ;
ma... | 0 | 61,137,422 |
#include<iostream>
using namespace std;
int main(){
int a, b, c, x, y = 0; ;
cin >> a >> b >> c;
for ( x = a; x <= b; x++ ){
if ( c % x == 0 ){
y = y + 1;
}
}
cout << y << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | 0 | 36,153,525 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | #include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vecto... | 0 | 99,051,458 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <list>
#include <numeric>
#include <stack>
#include <unordered_map>
#include <map>
#include <set>
using namespace std;
#define sz(a) int((a).size())
#define all(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
const int A = 1000005;
int main()
{
int n;
cin >> n;
vector<int> a(n);
vector<int> b(A);
rep(i,n){
cin >> a[i];
++b[a[i]];
}
bool ispw = true;
for(int i=2; i<A; ++i){
int cnt = 0;
fo... | 0 | 43,909,709 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
int main() {
int n, d, x;
cin >> n >> d >> x;
rep(i,n) {
int a;
cin >> a;
x += (d+a-1)/a;
}
cout << x << endl;
} | #include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i... | 0 | 65,988,131 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n,i,l,j,k,p;
string s,t="";
cin>>s;
n=s.size();
for(i=0;i<n;i++)
{
if(s[i]=='B')
{if(!t.empty()) t.pop_back();}
else t+=s[i];
}
cout<<t;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using pq =... | 0 | 63,732,519 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int main() {
int N, L;
cin >> N >> L;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<int> b(N - 1);
rep(i, N - 1) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll INFF = 1e18;
const int MAXN = 510;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double INFD = 1E9;
const double EPS = 1e-9;
vector< pair<int,int> > adj[100010];
ll sum[100010];
void dfs(int u,ll curSum,int ... | 0 | 17,520,166 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define ET cout << "\n"
#define SZ(a) ((int)a.size())
#define... | 0 | 34,806,829 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B... | #include<iostream>
#include<climits>
using namespace std;
int main()
{
int n,i,an=0,j,s=0;
cin>>n;
int m[n];
for(i=0;i<n;i++)
{
cin>>m[i];
}
int ma=m[0];
int mi=m[0];
for(i=1;i<n;i++)
{
ma=max(ma,m[i]);
mi=min(mi,m[i]);
}
int p=(ma+mi)/2;
an=IN... | 0 | 84,162,439 |
#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()
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> n(4), x{1, 4, 7, 9};
rep(i, 4) cin >> n.at(i);
sort(all(n));
cout << (n == x ? "YES" : "NO") ... | #include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <limits>
#include <climits>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std;... | 0 | 58,610,332 |
#include <stdio.h>
int main(){
int ans=0,i,r=0,l=0;
char c;
for(;;){
for(;;){
scanf("%c",&c);
if(c=='#'){
break;
}
if(c=='\n'){
break;
}
if(c=='q'||c=='w'||c=='e'||c=='r'||c=='t'||c=='a'||c=='s'||
c=='d'||c=='f'||c=='g'||c=='z'||c=='x'||c=='c'||c=='v'||c=='b'){
l=1;
... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define MAX 1e18
#define MIN -1e18
#define MOD 998244353
#define rep(i,a) for(int i=0;i<a;i++)
#define rep1(i,a) for(int i=1;i<=a;i++)
#define base 139
#define base2 31
#define memz(a) memset(a, 0, sizeof(a))
#define memn(a) memset(a, -1, sizeof(a))
#def... | 0 | 5,851,117 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,w,x,sum=0;
cin>>n>>m;
bool a[n+1];
for(int i=1;i<=n;i++)
a[i]=true;
for(int i=1;i<=m;i++)
{
cin>>x;
for(int i=1;i<=x;i++)
{
cin>>w;
a[w]=false;
}
}
for(int i=1;i<=n;i++)
if(a[i])
sum++;
cout<<sum<<endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define mod 1000000007
using namespace std;
ll binpow(ll x,ll y){ll res=1;while (y > 0){if(y&1)res=(res*x);y = y>>1;x=(x*x);}return res;}
ll binpowmod(ll x,ll y,ll p){ll res=1;x=x%p;while (y > 0){if(y&1)res=(res*x)%p;y = y>>1;x=(x*x)%p;}return ... | 0 | 73,729,654 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
int A, B, C;
cin >> A >> B >> C;
if(A + B >= C) cout << "Yes" <<endl;
else cout << "No" <<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
vector<int> parent(200005);
vector<int> s(200005);
int find_set(int v) {
if (v == parent[v])
return v;
return parent[v] = find_set(parent[v]);
}
void union_sets(int a,int b)
{
a = find_set(a);
b = find_set(b);
... | 0 | 1,524,049 |
#include <bits/stdc++.h>
using namespace std;
using ll= long long ;
void solve() {
int n; cin >> n;
vector<ll> a(n);
for (auto& x: a) {
cin >> x;
}
ll res = 0;
while (*max_element(a.begin(), a.end()) >= n) {
ll cnt = 0;
for (auto& x: a) {
cnt += x/n;
}... | #include <cstdio>
int main(void)
{
while (1) {
int h, w;
scanf("%d %d", &h, &w);
if (!h && !w)
break;
for (int y=0; y<h; y++) {
for (int x=0; x<w; x++) {
printf("#");
}
printf("\n");
}
printf("\n");
}... | 0 | 17,198,570 |
#include <iostream>
#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,res=-1;
cin >> n;
if(n/100%10==7){
res=1;
}else if(n/10%10==7){
res=1;
}else if(n%10==7){
res =1;
}
if(res==1)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | 0 | 20,526,985 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
string s;
ll wcnt = 0, ans = 0;
bool b = false;
cin >> s;
rep(i, s.size()) {
if (s[i] == 'B') b = true;
if (s[i] == 'W') {
ans += i - wcnt;
... | #include <cstdio>
#include <iostream>
using namespace std;
int Fibonatch(int result[], int num)
{
int ret = result[num];
if (ret == 0) {
if (num > 1) {
ret = Fibonatch(result, num - 1) + Fibonatch(result, num - 2);
}
else {
ret = 1;
}
result[num] =... | 0 | 58,671,336 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <bits/stdc++.h>
#define ll long long
#define maxn 100005
#define F first
#define S second
#define fi(i,a,b) for(int i=a; i<=b; i++)
#define fid(i,a,b) for(int i=a; i>=b; i--)
#define VanLoi "a"
#define gb(i, j) ((i >> j) & 1)
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#de... | 0 | 31,097,354 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
int n;
string s;
cin >> n >> s;
int ans = 1;
rep(i,n-1){
if (s.at(i) != s.at(i+1)) ans++;
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push_back
#define mp make_pair ... | 0 | 50,877,138 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=111;i<=999;i+=111){
if(i-n<=110&&n<=i){
cout<<i;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) ... | 0 | 43,577,602 |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int vc[1000000+5]={};
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
vc[a[i]]+=1;
}
int ans=0;
for(int i=0;i<n;i++)
{
bool ok=1;
vc[a[i]]--;
for(int j=1;j<=s... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define REP(i,n) for(ll i = 0;i < (ll)n;i++)
#define REPD(i,n) for(ll i = (ll)n - 1;i >= 0;i--)
#define ALL(x) (x).begin(),(x).end()
#define FILLl(n,first_dimension_size,value) fill((ll*)n,(ll*)(n+first_d... | 0 | 60,787,263 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e18;
int main(){
int X,A,B;
cin >> X >> A >> B;
if(A >= B){
cout << "delicious" <<... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 37,667,457 |
#include<iostream>
using namespace std;
int main(){
int X,Y,x,y,r;
int check=0;
cin>>X>>Y>>x>>y>>r;
if(y>Y){
check=1;
}
else if(x>X){
check=1;
}
else if(0>x){
check=1;
}
else if(0>y){
check=1;
}
else if(x-r<0){
check=1;
}
else if(y-r<0){
check=1;
}
else if(x+r>X){
check=1;
}
else if(y+r>... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end... | 0 | 6,098,228 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main() {
int N,K;
cin >> N >> K;
if(N%K==0){
cout << 0 << endl;
}
else{
cout << 1 << endl;
}
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#de... | 0 | 33,617,274 |
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
cons... | #include <iostream>
#include <vector>
class Point{
private :
int x;
int y;
int path;
bool roadWork;
public :
Point() : x(), y(), path(), roadWork() {}
~Point() = default;
void setX(int i) { x = i; }
void setY(int i) { y = i; }
void setPath(int i) { path = i; }
void setRoadWork(bool b) { roadWork = b; }... | 0 | 77,683,894 |
#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... | #define ALGORITHM 0
#define CLIMITS 0
#define CMATH 0
#define DEQUE 0
#define LIST 0
#define MAP 0
#define QUEUE 1
#define SET 0
#define DP 0
#define DIRECTIONS 0
#define _GLIBCXX_DEBUG
#include <iostream>
#include <string>
#include <utility>
#include <vector>
us... | 0 | 57,951,436 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int H,W,D; cin>>H>>W>>D;
vector<pair<int,int>> fie(100000);
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
int a; cin>>a;
fie[a].first=i;
fie[a].second=j;
}
}
vector<int> dist(fie.size());
dist[1]=0; dist[0]=0;
for(int i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
int N, K, R, S, P;
string T;
bool is_win[100100];
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> N >> K >> R >> S >> P >> T;
int ans = 0;
rep(i, N) {
... | 0 | 45,834,924 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+7;
int fr[MAXN];
int okay[MAXN];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
fr[a]++;
okay[a] = 1;
}
int ans = 0;
for (int a = 1; a < MAXN; a++) {
if (fr[a]... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 49,985,233 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long k;
cin >> k;
long long a = 49 + k / 50;
int m = (int) (k % 50);
cout << 50 << endl;
for (int i = 0; i < 50; i++)
{
if (i != 0)
cout << " ";
if (i < m)
cout << a + 50 - (m - 1);
... | #include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
const ll inf = 1e18+5;
ll n;
pair<string, ll> playlist[55];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin >> n;
for (ll i= 0; i< n; i++){... | 0 | 72,604,895 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin>>s>>t;
int sLen = s.size();
int tLen = t.size();
int ans = INT_MAX;
for(int i=0;i<sLen; i++) {
if(i+tLen <= sLen) {
string temps = s.substr(i, tLen);
int tempAns = 0;
for(int j=... | #include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0... | 0 | 68,589,695 |
#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(){
string s1, s2;
cin >> s1;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <math.h>
#include <queue>
#include <string>
#define ll long long
using namespace std;
int main() {
vector<ll> a;
vector<ll> ps;
int n; cin >> n;
ll ps_sum = 0;
for(int i=0; i<=n; i++){
ll x; cin >> x;
a.push_back(x);... | 0 | 94,530,100 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#d... | #include <bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
vector<vector<char>> s(h+2,vector<char>(w+2));
for(int i=1; i<h+1; i++){
for(int j=1; j<w+1; j++){
cin >> s.at(i).at(j);
}
}
string ans="Yes";
for(int i=1; i<h+1; i++){
for(i... | 0 | 2,119,748 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<queue>
#include<map>
#include<functional>
#include<cstring>
using namespace std;
int main() {
int n;
while(scanf("%d",&n),n){
n = 1000 - n;
int cnt = 0;
if(500 <= n){
n -= 500;
cnt++;
}
if(100 <= n){
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll a[200005];
ll _root(ll x)
{
while(a[x]!=x)
x=a[x];
return x;
}
void add(ll x,ll y)
{
ll xx=_root(x);
ll yy=_root(y);
a[yy]=xx;
}
int main() {
ll n;
cin>>n;
for(ll i=1;i<=n;i++)
a[i]=i;
ll q;
cin>>q;... | 0 | 39,575,115 |
#include <bits/stdc++.h>
using namespace std;
int n, m, h[100005], ans=0;
vector<int> r[100005];
int main() {
cin >> n >> m;
for (int i=1; i<=n; i++) cin >> h[i];
for (int i=0; i<m; i++) {
int a, b; cin >> a >> b;
r[a].push_back(b);
r[b].push_back(a);
}
bool ok=1;
for (in... | #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <unordered_set>
#include <map>
#include <unordered_map>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
... | 0 | 80,970,463 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(void){
int N,i;
cin >> N;
long long int array[N];
for(i=0; i<N; i++) cin >> array[i];
sort(array,array+N);
long long int sum;
sum = 0;
for(i=0; i<N; i++) sum += array[i];
int max,min;
min = array[0];
max = array[N-1];
cout << m... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 0 | 25,856,897 |
#include<iostream>
using namespace std;
int main() {
int x,m,n;
while(cin >> x){
n=0;
m = 600/x;
for(int i = 1;i<m;i++){
n += x*x*x*i*i;
}
cout << n << endl;
}
return 0;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int par[200000],siz[200000];
int find(int a) {
if (par[a]==a)
return a;
return par[a]=find(par[a]);
}
void unite(int a,int b) {
a=find(a);
b=find(b);
if (a==b)
return;
par[b]=a;
siz[a]+=siz[b];
}
int main() {... | 0 | 21,747,590 |
#include <iostream>
using namespace std;
int main(void) {
for(int i = 1; i <= 9; ++i) {
for(int j = 1; j <= 9; ++j) {
cout << i << "x" << j << "=" << i*j << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define inf 1000000100
int n, m;
bool done(vector<bool> visited)
{
for(int i = 1; i <= n; i++)
{
if(!visited[i]) return false;
}
return true;
}
int main()
{
cin >> n >> m;
vi ad... | 0 | 70,796,446 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(void)
{
int n,ans;
cin>>n;
ans=0;
if(n>=105)ans++;
if(n>=165)ans++;
if(n>=195)ans++;
if(n>=135){ans++;}
if(n>=189){ans++;}
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> v(N);
long sum = 0;
for(int i = 0; i < N; i++){
int a;
cin >> a;
v.at(i) = a;
sum += (long)a;
}
sort(v.begin(), v.end());
cout << v.at(0) << " " << v.at(v.size()-1) << ... | 0 | 98,931,875 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
lon... | #include <bits/stdc++.h>
#define for0(i, n) for (int i = 0; i < (ll)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (ll)(n); ++i)
#define forc(i, l, r) for (int i = (ll)(l); i <= (ll)(r); ++i)
#define forr0(i, n) for (int i = (ll)(n) - 1; i >= 0; --i)
#define forr1(i, n) for (int i = (ll)(n); i >= 1; --i)
#def... | 0 | 23,554,898 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
for (int i = 0; i < 4; i++) {
cout << s[i] << flush;
}
cout << " " << flush;
for (int i = 4; i < s.size(); i++) {
cout << s[i] << flush;
}
cout << endl;
re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int W, H, N;
cin >> W >> H >> N;
int xmin = 0, xmax = W;
int ymin = 0, ymax = H;
while (N--) {
int x, y, a;
cin >> x >> y >> a;
... | 0 | 78,560,725 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
string S; cin>>S;
int K; cin>>K;
int64_t ans;
bool allSame=true;
rep(i,0,S.size()) if(S.at(i... | 0 | 62,874,642 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,x;cin>>a>>b>>x;
if(a+b>=x&&x>=a) cout<<"YES";
else cout<<"NO";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const int N = 300005;
int a[N], b[N];
vector<int> c, d;
int main() {
int n, m, g;
scanf("%d%d%d", &n, &m, &g);
set<pair<int, int> > se;
for (int i = 0; i < g; i++) {
int x, y;
... | 0 | 29,149,970 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<double> v(N);
for(int i=0; i<N; i++){
cin>>v[i];
}
sort(v.begin(), v.end(), greater<double>());
while(v.size()>1){
double y = v.back();
v.pop_back();
double z = v.back();
v.pop_back();
v.push_back((y+z)... | #include<bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define ... | 0 | 1,378,230 |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(){
long long h ,w, D;
cin >> h >> w >> D;
long long px[90001], py[90001];
for(long long i = 0; i < h; i++){
for(long long j = 0; j < w; j++){
long long a;
cin >> a;
px[a] = j... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using ... | 0 | 77,856,414 |
#include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#define rep(i, n) f... | #include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorit... | 0 | 88,953,512 |
#include <iostream>
#include <string>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
string s; cin >> s;
int ans = 0;
for (int i = 0; i < n-1; i++)
{
if(s[i] == s[i+1]) continue;
ans++;
}
cout << ans+1 << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | 0 | 93,857,638 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> p;
for ( int i = 0; i < n; ) {
if ( s[i] == '0' ) {
p.push_back(i);
while ( i < n && s[i] == '0' ) { i++; }
}
if ( s[i] == '1' ) {
p.push_back(i);
while ( ... | #include <bits/stdc++.h>
using namespace std;
void dfs(vector<int>&add,vector<vector<int>>&g,vector<int>&ans,vector<bool>&find,int s){
ans[s] += add[s];
find[s] = 1;
for(int i = 0;i < g[s].size();i++){
if(find[g[s][i]])
continue;
ans[g[s][i]] = ans[s];
dfs(add,g,ans,find,... | 0 | 96,804,397 |
#include <iostream>
#include <queue>
const int MAX_N = 100;
const int INF = 999999999;
using namespace std;
int n;
int color[MAX_N];
bool adj[MAX_N][MAX_N];
int d[MAX_N];
void bfs(int s) {
queue<int> que; que.push(s);
for (int i = 0; i < n; i++) d[i] = INF;
d[s] = 0;
int u;
while (!que.empty()) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
int n,m;
vector<int> a;
bool isOK(int index, int x){
if(a[index] <= x) return 1;
else return 0;
}
int binarysearch(int x){
int ok = -1, ng=n-1;
while(ng-ok>1){
int... | 0 | 14,459,940 |
#line 1 "/mnt/c/Users/leafc/dev/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define ... | #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 all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 44,533,218 |
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define bye return 0
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,... | 0 | 94,823,709 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t-... | 0 | 81,144,292 |
#include<iostream>
#include<iomanip>
#include<cassert>
#include<math.h>
#include<complex>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<functional>
#include<vector>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int a=s[0]-'0';
int b=s[1]-'0';
int c=s[2]-'0';
int d=s[3]-'0';
if(a+b+c+d==7)cout<<a<<'+'<<b<<'+'<<c<<'+'<<d<<"=7"<<endl;
else if(a+b+c-d==7)cout<<a<<'+'<<b<<'+'<<c<<'-'<<d<<"=7"<<endl;
else if(a+b-c+d==7)cout<<a<<'+'<<b<<'-'... | 0 | 81,984,018 |
#include<bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
int n;
cin >> n;
while(1){
if(n%111 == 0) break;
n++;
}
cout << n;
} | #include<bits/stdc++.h>
#define prArr(Arr,n) for(int _=0;_<n;_++) cout<<(Arr)[_]<<" ";
#define f first
#define s second
using namespace std;
const int INF=(int)0x3f3f3f3f;
const int MOD=(int)1e9+7;
const double eps=1e-9;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long l,r,ans=... | 0 | 28,391,381 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #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>;
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T ... | 0 | 7,622,346 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
ll... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int a,b,k;
... | 0 | 75,441,463 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
#include<cmath>
#include<bitset>
#include<queue>
#define ll long long
#define itn int
#define co(ans) cout<<ans<<endl;
#define COYE cout<<"YES"<<endl;
#define COYe cout<<"Yes"<<endl;
#define COye cout<<"yes"<<endl;
#define ... | #include <bits/stdc++.h>
using namespace std;
#define ld double
#define ll long long
#define pb emplace_back
#define mk make_pair
#define mod 1000000007
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) x.begin(),x.... | 0 | 51,936,163 |
#include <bits/stdc++.h>
using namespace std;
struct Dice {
int s1, s2, s3, s4, s5, s6;
void turnN() {
int tmp = s1;
s1 = s2; s2 = s6; s6 = s5; s5 = tmp;
}
void turnS() {
int tmp = s1;
s1 = s5; s5 = s6; s6 = s2; s2 = tmp;
}
void turnW() {
int tmp = s1;
s1 = s3; s3 = s6; s6 = s4; s4 =... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
vector<int> h(n);
rep(i,n) cin>>h[i];
vector<int> g(n,0);
int ans=0;
... | 0 | 74,458,918 |
#include<iostream>
#include<vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> ln(n, vector<int>(n+1, 0));
vector<vector<int>> m(n,vector<int>(n,0));
vector<int> rem(n, 0);
for (int i = 0; i < n; i++)
{
cin >> ln[i][0];
cin >> ln[i][1];
for (int j = 2; j < l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 2005;
char s[N][N], t[4] = {'R', 'Y', 'G', 'B'};
int n, m, d;
void paint(int sx, int sy, int z, char letter) {
int k = sy, j = sx;
for (int i = 2; i <= z; i += 2, k--, j++) {
for (int... | 0 | 98,091,100 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#define INF 200... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
namespace IO {
#define gc getchar()
template <typename T>
inline void read(T& x) {
x = 0; bool f = 1; char ch;
... | 0 | 80,522,182 |
#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(_... | #include <bits/stdc++.h>
using namespace std;
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> (i)) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i... | 0 | 72,297,277 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
int main(){
ll n ; cin >> n;
vector<ll> a(n);
rep(i,n){
cin >> a.at(i);
... | #include <iostream>
#include <string>
using namespace std;
string t = "yuiophjklnm";
int main()
{
while(true){
string s;
cin >> s;
if(s == "#") break;
int n = s.size();
int ans = 0;
int lr = -1;
for(int i = 0; i < n; i++){
bool r = false;
... | 0 | 69,872,324 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B) cout << C << endl;
else if (B == C) cout << A << endl;
else cout << B << endl;
} | #include <iostream>
using namespace std;
int main(){
int n;
long min,max,sum;
cin >> n;
long work[n];
for(int i = 0; i < n;i++){
cin >> work[i];
}
max = sum = min = work[0];
for(int i = 1; i < n;i++){
if(max < work[i]){
max = work[i];
}
if(min ... | 0 | 67,874,518 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define ... | #include <bits/stdc++.h>
#define MOD 1000000007
#define ll long long
#define ull unsigned long long
#define ld long double
#define uint unsigned int
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pll pair<long long ,long long >
#defin... | 0 | 27,730,250 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.