code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
#define debug(x) cout<<"The value of "<<#x<<" is "<<x<<endl;
typedef long long ll;
typedef unsigned long long ull;
int main()
{
cin.sync_with_stdio(0); cin.tie(0);
int k,a,b;
cin>>k>>a>>b;
if(a%k==0){
cout<<"OK"<<endl;
retu... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>> ;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++... | 0 | 20,905,515 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
const long long INF = 1LL << 60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
int a[n];
int cnt[101];fill(cnt,cnt+101,0);
for(int i=0;i<n;i++){
cin>>a[i];
cnt[a[i]]++;
}
sort(a,a+n);
bool ok=true;
if(cnt[a[n-1]]==1){
ok=false;
}
else{
if(a[n-1]%2==0){
for(int i=1;i<a[n-1];i++){
... | 0 | 58,083,375 |
#include <stdio.h>
#include<iostream>
using namespace std;
int main()
{
int a, b, i, j;
while (1) {
cin >> a >> b;
if (a == 0 && b == 0) { break; }
else {
for (i = 1;i <= b;i++) { printf("#"); }
printf("\n");
for (j = 2;j <= a-1;j++) {
printf("#");
{ for (i = 2;i <= b-1;i++) { printf("."); }
... | #include<cstdio>
#include<cctype>
int main(){
char ch;
while(1){
scanf("%c",&ch);
if(ch=='\n') break;
else if(islower(ch)) printf("%c",toupper(ch));
else if(isupper(ch)) printf("%c",tolower(ch));
else printf("%c",ch);
}
printf("\n");
return 0;
} | 0 | 68,391,814 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
bool prime[1000006];
ll d[1000006];
void sieve()
{
for(int i=1; i<=1000000; i++)d[i]= 1;
for(int i=2; i<=1000000; i++)
if(!prime[i])
{
d[i]*= 2;
for(int j=2*i; j<=1000000; j+= i)
{
prime[j]= 1;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
int m[(1<<('z'-'a' +1))];
vector<pair<int,int>> k;
signed main() {
string s;
cin>>s;
vector<int> hen[s.size()];
int sc[s.size()+1],b=0;
for(int i=0;... | 0 | 70,075,640 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a,b,c,h,i,j,k,l,m,n,x,y;
ll ans = 0;
string s;
cin >> a >> b;
ans = (a*3 + b ) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 | 73,779,407 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll w, h;
cin >> w >> h;
vector<ll> p(w), q(h + 1, 0);
ll ans = 0;
for (int i = 0; i < w; i++) {
cin >> p[i];
ans += p[i];
}
for (int i = 0; i < h; i++) {
cin >> q[i];
ans += q[i];
}
sort(p.begin(), p.e... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define FAST {ios_base::sync_with_stdio(false);cin.tie(NULL);}
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
#define rep(n) for(int i=0;i<(n);i++)
#define rrep(n) for(int i=(n)-1;i>=0;i--)
#define mem(a,b... | 0 | 1,833,704 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
int n, m, a, b;
cin >> n >> m;
vector< pair<ll, ll> > d(n);
for(int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<bool> > vvb;
typedef vector<vector<int> > vvi;
typedef map<int, bool> mib;
typedef long long ll;
typed... | 0 | 51,071,290 |
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <map>
#include <set>
#include <cmath>
#include <vector>
#include <ctime>
#include <queue>
#include <sstream>
#include <utility>
#include <bitset>
using namespace std;
#define MP make_pair
#define... | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cstring>
#include<queue>
#define INT_MAX 1<<30
using namespace std;
const int INF=100000;
char s[1111];
int maze[1111][1111];
int N,H,W;
int sx,sy,ans,aim;
int d[1111][1111];
int dx[4]={1,-1,0,0},dy[4]={0,0,1,-1};
typedef pair<int,int> P;
void bfs(int x,... | 0 | 28,867,450 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
ll ans=0;
void Main(){
int whi,hhi,n,wlo=0,hlo=0;
cin>>whi>>hhi>>n;
For(i,0,n){
int x,y,a;
cin>>x>>y>>a;
if(a==2){
whi=min(... | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n, d,x,cnt=0;
double nn = 0.0;
... | 0 | 18,935,409 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
struct Node {
int key;
struct Node *prev, *next;
};
Node *nil;
void initNode() {
nil = (Node *)malloc(sizeof(Node));
nil->prev = nil;
nil->next = nil;
}
void insert(int key) {
Node *node = (Node *)malloc(sizeo... | 0 | 24,021,578 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww
{
cww()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
bool is_int(vector<int> a, vector<int> b, int d) {
vector<int> temp(d);
in... | 0 | 46,520,384 |
#include <algorithm>
#include <iostream>
using namespace std;
const int N = 10000;
int d2c[] = { 0, 2, 5, 5, 4, 5, 6, 3, 7, 6 };
int dd[8];
int dp[N + 1];
int main() {
int n, m; cin >> n >> m;
while (m--) {
int d; cin >> d;
int c = d2c[d];
dd[c] = max(dd[c], d);
}
fill(dp, dp + n + 1, -1);
dp[0] = 0;
for (i... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) int a; cin >> a;
#define inputInt2(a,b) int a; int b; cin >> a >> b;
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a;
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){ci... | 0 | 64,892,515 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | #include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(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 > b) { a = b... | 0 | 15,771,563 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int N;
int L;
cin>>N>>L;
vector<string>S(N);
for(int i=0;i<=N-1;i++){
cin>>S[i];
}
sort(S.begin(),S.end());
for(int i=0;i<=N-1;i++){
cout<<S[i];
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < 10; ++i) {
for (int j = 0; j < 10; ++j) {
for (int k = 0; k < 10; ++k) {
int count = 0;
vector<int>X = {i,j,k};
for (int l = 0;l<S.size();++l) {
if ((X[count]+'0')... | 0 | 100,285,748 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
const int MaxN = 500;
using namespace std;
char s[10], res[MaxN + 5][MaxN + 5];
bool vis[4 * MaxN + 5][5];
int n, m, d;
string len = "RYGB";
int main()
{
while(~scanf("%d%d%d", &n, &m, &d)) {
for (int i = 0; i < n; i++) {
... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 0 | 36,693,990 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define MAXX 100005
#define INF INT_MAX
#define PI 3.14159265358979323846264338327950
#define PB push_back
#define PF push_front
#define F first
#define S second
#define fixx(n) fixed << setprecision(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n+1), b(n);
for (int i = 0; i <= n; i++) cin >> a[i];
for (int i = 0; i < n; i++) cin >> b[i];
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i];
... | 0 | 83,503,925 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define mrep(i,j,n) for(int i = j; i < n; i++)
#define mreps(i,j,n) for(int i = j; i <= n; i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define ERASE(x,val... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
string keyence = "keyence";
string s;
... | 0 | 33,087,079 |
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mo... | #include <bits/stdc++.h>
int main() {
long long int L, R;
std::cin >> L >> R;
if (R - L > 2019) {
std::cout << 0 << std::endl;
return 0;
}
long long int min = 10000;
for (long long int i = L; i < R; i++) {
for (long long int j = i + 1; j <= R; j++) {
min = std... | 0 | 26,257,419 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long pre[200005]={0};
const int mod = 1000000007;
int main()
{
int n,k;
cin >> n >> k;
long long num = 0;
for(int i=1;i<=n;i++)
pre[i]=i+pre[i-1];
pre[n+1]=pre[n];
long long ans =0 ;
for(int i=k;i<=n... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm( a, b ) (a)/__gcd((a),(b))*(b)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;
static const int INF = INT_... | 0 | 42,820,903 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
int n;
cin >> n;
int w[n];
int right = 0,left = 0;
for(int i=0;i<n;i++){
cin >> w[i];
right += w[i];
}
int ans = right;
for(int i=0;i<n-1;i++){
left += w[i];
right -= w[i];
ans = min(ans,abs(right - left));
}
cout << ans <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
double pi = 3.14159265359;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, ... | 0 | 38,871,776 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main(){
int H, W, M;
cin >> H >> W >> M;
vector<int> Hi(H, 0);
vector<int> Wi(W, 0);
set<pair<int,int>> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, keta = 1, keta_cnt = 1, cnt = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
keta = i;
while (keta >= 10) {
keta /= 10;
keta_cnt++;
}
if(keta_cnt % 2 == 1) {
cnt++;
}
keta_cnt = 1;
}
cout << cn... | 0 | 77,303,981 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int n;
string s,t;
int main(void){
cin>>n>>s>>t;
for(int i=n;i>=0;i--){
bool x=true;
for(int j=0;j<i;j++){
if(s[n-i+j]==t[j]){
}else{
x=false;
}
... | #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 | 49,367,905 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include<iostream>
using namespace std;
#include<vector>
#include<set>
#define int long long int
int32_t main()
{
int n;
cin>>n;
set<int> s;
for(int i=1;i*i<=n;i++)
{
if(n%i==0)
{
int f1=i;
int f2=n/i;
int factor=f2-1;
if(factor!=0&&... | 0 | 11,428,814 |
#include <bits/stdc++.h>
#define uni(x) (x).resize(unique(all(x)) - (x).begin())
#define fprint(v) for(auto x : v) cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
#define MP(x, y) make_pair(x, y)
#define SZ(x) int((x).size())
#define PB(x) push_back(x)
#define ll long long
#de... | #pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
#define ll long long int
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000... | 0 | 63,848,948 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string C1, C2;
cin >> C1 >> C2;
if ( C1[0] == C2[2]
&& C1[1] == C2[1]
&& C1[2] == C2[0] )
{
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,s,n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(bit)
template<class T> bool... | 0 | 73,197,810 |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n;
int fie[1001][1001];
int main(void){
int a=1;
for(int i=0;i<1000;i++){
for(int j=0;j<=i;j++){
fie[i][j]=a++;
}
}
scanf("%d",&n);
for(int i=1;i<=1000;i++){
if(i*(i-1)==n*2){
print... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 0 | 38,600,002 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string S;
cin >> S;
sort(S.begin(),S.end());
if(S.at(0)==S.at(1)&&S.at(2)==S.at(3)&&S.at(0)!=S.at(3))cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | 0 | 42,907,090 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n,k;
cin>>n>>k;
if (k==1)
{
cout<<"0\n";
}
else
{
cout<<n-k<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
if(K > (N - 1) * (N - 2) / 2) {
cout << -1 << endl;
return 0;
}
cout << (N - 1) + (N - 1) * (N - 2) / 2 - K << endl;
for(int i=2;i<=N;i++) {
cout << 1 << " " << i << endl;
}
int left = 2, right = 3;
... | 0 | 2,111,185 |
#include <iostream>
using namespace std;
int main(){
int b,f,r,v,i,j,n;
int a[12][10];
for (j=0;j<12;j++){
for (i=0;i<10;i++)a[j][i]=0;
}
cin>>n;
for (i=0;i<n;i++){
cin>>b>>f>>r>>v;
a[b*3+f-4][r-1]+=v;
}
for (j=0;j<12;j++){
if (j&&!(j%3))cout<<"####################"<<endl;
for (i=0;i... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n+1);
for(int i=0; i<n+1; i++){
cin >> a[i];
}
vector<long long> b(n);
for(int i=0; i<n; i++){
cin >> b[i];
}
long long ans=0;
long long tmp1, tmp2;
for(i... | 0 | 68,880,402 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
constexpr int inf=1000000000;
constexpr ll linf=1000000000000000000;
int main(){
ll n,k;
cin>>n>>k;
ll a[n+1];
a[0]=0;
rep(i,n){
cin>>a[i+1];
a[i+1]+=a[... | 0 | 43,972,770 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int k,n; cin>>k>>n;
vector<int> a(n),d(n);
for(int i=0; i<n; ++i) cin>>a[i];
int m=0;
for(int i=0; i<n; ++i){
if(i<n-1) d[i]=a[i+1]-a[i]; else d[i]=k-(a[i]-a[0]);
m=max(m,d[i]);
}
cout<<k-m;
return 0;
} | #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;
cin >> n;
ll a[n+10], b[n+10];
rep(i, n) cin >> a[i] >> b[i];
ll ans = 0;
for (int i = n-1; i >= 0; i--)
{
if ((a[i] + ans) % b[i] == 0) continu... | 0 | 68,556,875 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
string s;
cin>>s;
int n=s.size()+1;
int a[n];
for(int i=0;i<n;++i) a[i]=0;
for(int i=0;i<(n-1);++i)
{
if(s[i]=='<')
{
... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
long long N;
cin >> N;
long long max_count = 0;
long long count = 0;
long long H;
for(int i=0; i<N; i++){
long long H_tmp;
cin >> H_tmp;
if(i==0){H = H_tmp;continue;}
if(H... | 0 | 7,935,206 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <cstdio>
#include <cstdint>
using namespace std;
typedef int_fast64_t ll;
unsigned int M, i = 0;
ll d, c, sd = 0, sc = 0, A;
const int cm = 1 << 17;
char cn[cm], * ci = cn + cm, ct;
inline char readchar(... | #include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RRE... | 0 | 52,698,583 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int path[4][4]= {0};
for(int i = 0; i < 3; i++){
int a,b;
cin >> a >> b;
path[a - 1][b - 1] = path[b - 1][a - 1] = 1;
}
for(int i = 0; i < 4; i++){
int cnt = 0;
for(int j = ... | 0 | 73,572,317 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (long long)(1e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
int main(void)
{
ll n;
vector<ll> a;
cin >> n;
REP(i, n... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
template<class T> void chmax(T& a, T b) { if(a < b) a = b; }
vector<pair<char, int>> runlength(string s) {
int n = s.size();
vector<pair<char, int> > res;
char pre = s[0];
... | 0 | 81,890,202 |
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
ll stone[100010];
bool ch[100010];
ll dfs(int key, vector<vector<int>> &g){
ch[key]=1;
ll sum=0, mx=0;
int cnt=0;
for(int i=0; i<g[key].size(); ++i){
if(!ch[g[key][i]]){
++cnt;
ll p=dfs(g[key]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define int long long
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rrep(i,n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep2(i,s,n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#... | 0 | 98,443,145 |
#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... | #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>;
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n=1):n(n), f(n+1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i]) continue;
primes.push... | 0 | 56,267,738 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1LL<<50
#define pb push_back
#define mp make_pair
using namespace std;
typedef long l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); (i)++)
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e... | 0 | 82,189,277 |
#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n;
while(true){
cin >> n;
if(!n) break;
int min_diff = 1000000;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
const long long INF = numeric_limits<long long>:... | 0 | 25,980,403 |
#include<bits/stdc++.h>
using namespace std;
#define Ff(i,a,n) for(i=a;i<n;i++)
#define Fr(i,a,n) for(i=a;i>n;i--)
#define ll long long
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x,... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
for(int i = 0;i < n;++i){
string num;
cin >> num;
char m = '1';
for(int j = 0;j < num.size();++j){
int nn = num[j] - '0';
if(nn == 1){
if(m == '1' || m == ' ')
m = '.';
else if(m == '.')
m = ',';
else if(m == ',')
... | 0 | 29,379,934 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> a(N),b(N),c(N);
for(int i=0;i<N;i++) cin >> a.at(i) >> b.at(i) >> c.at(i);
int dp[3][N];
dp[0][0] = a.at(0);
dp[1][0] = b.at(0);
dp[2][0] = c.at(0);
for(int i=1;i<N;i++){
dp[0][i] = max(dp[... | 0 | 96,689,634 |
#include <iostream>
using namespace std;
int main() {
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
int a = r;
int b = W - r;
int c = r;
int d = H - r;
if (x >= a && x <= b && y >= c && y <= d) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
cin>>n;
set<string>t;
bool flag=true;
bool flag1=true;
string s1;
for(i=0;i<n;i++)
{
string s;
cin>>s;
if(flag==false)
{
if(s[0]!=s1[s1.size()-1])
{
flag... | 0 | 58,501,721 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll,ll> lll;
const ll MOD = 1000000007;
const ll INF = 1e9+5;
const double eps = 1e-7;
cons... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | 0 | 3,470,084 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
ll pow2(long long n) {
ll ret = 1;
ll x = 2;
while (n > 0) {
if (n & 1) ret *= x;
x *= x;
n >>= 1;
}
return ret;
}
int main() {
ll a,b,c,h,i,j,k,l,m,n,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, s;
int x, y, z;
int formas = 0;
cin >> k >> s;
for (int x = 0; x <= k; x++) {
for (int y = 0; y <= k; y++) {
z = s - x - y;
if (z >= 0 && z <= k) formas++;
}
}
cout << formas;
} | 0 | 52,453,728 |
#include<cstdio>
int main()
{
int a, b;
scanf( "%d%d", &a, &b );
printf( "%d %d %.5f\n", a/b, a%b, double(a)/b );
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
rep(i, 3)
{
if (s[i] == '1')
s[i] = '9';
else if (s[i] == '9')
s[i] = '1';
}
cout... | 0 | 7,915,234 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include<bits/stdc++.h>
using namespace std;
int main(){
int k,n;
cin>>k>>n;
int a[n], x;
for(int i=0;i<n;i++){
cin>>a[i];
}
int ans = k;
for(int i=1;i<n-1;i++) ans = min(ans,k-(a[i+1]-a[i]));
ans = min(ans,k-(a[0]+k-a[n-1]));
cout << ans;
} | 0 | 38,032,088 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <iostream>
#include <numeric>
#include <cmath>
#include <queue>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#inc... | 0 | 61,856,131 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<pair<ll,ll> >a;
for(ll i=1;i*i<=N;i++){
if(N%i==0){
a.push_back(make_pair(i,N/i));
}
}
ll sum=2*pow(10,12);
for(ll j=0... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL <<60;
int main(void){
long long res=0;
long long i,j,k;
long long l,m,h;
string s;
long long n_r=0,n_g=0,n_b=0;
long long n_max=4010;
long long n;
long r[n_max]={},g[n_max]={},b[n_max]={};
cin>>n;
cin>>s;
for(i=0;i<n;i++){
... | 0 | 50,078,743 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <string.h>
#include <algorithm>
using namespace std;
string s[1000];
int n,m;
int main()
{
while(~scanf("%d %d",&n,&m))
{
for(int i=0;i<n;i++)
{
cin>>s[i];
}
for(int... | #include<iostream>
using namespace std;
int main(){
string s;
cin>>s;
int cnt=0;
for(int i=0;i<=s.size()-1;i++){
if(s[i]==s[s.size()-i-1]){
continue;
}
else{
cnt=-1;
}
}
for(int i=0;i<=(s.size()-1)/2-1;i++){
if(s[i]==s[(s.size()-1)/2-i-1]){
continue;
}
else{
... | 0 | 73,465,069 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
if (s[0]==s[1] && s[1]==s[2]) cout << "No";
else cout << "Yes";
} | #include<stdio.h>
int main(){
long long n,ans=1;
scanf("%lld",&n);
long long arr[n+5],maks=1000000000000000000;
for(long long i=1;i<=n;i++){
scanf("%lld",&arr[i]);}
for(int i=1;i<=n;i++){
if(arr[i]==0){
printf("0");
return 0;
}
}
for(long long i=1;i<=n;i++){
if(maks/ans<a... | 0 | 45,794,197 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
ci... | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
int a[N];
int main()
{
int n; cin>>n;
ll cnt = 0;
for(int i = 0;i < n;i++)
{
cin>>a[i];
if(i){
if(a[i] < a[i-1]) cnt += a[i-1] - a[i],a[i] = a[i-1];
}
... | 0 | 16,049,145 |
#include<string>
#include<iostream>
#include<deque>
using namespace std;
using ulli = unsigned long long int;
int main() {
ulli r, d, x;
cin >> r >> d >> x;
for (int i = 1; i <= 10; i++) {
int temp = x;
x = r * temp - d;
cout << x << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define long long long int
using namespace std;
int main() {
ios::sync_with_stdio(false);
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<int> p(a);
for (int i = 0; i < a; i++) cin >> p[i];
vector<int> q(b);
for (int i = 0; i < b; i++) cin >> q[i];
vector... | 0 | 42,127,964 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dp[1000000];
int INF = 1001001001;
int main() {
int N; cin >> N;
rep(i, N+1){
dp[i] = i;
}
for (int i = 0; i < N; i++){
int now6 = 6;
w... | #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 REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define REPR(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define all(v) v.begin(), v.end()
tem... | 0 | 84,812,552 |
#include<iostream>
using namespace std;
int main(){
long N;
cin >> N;
long sum = 0,num[10000];
for (int i = 0; i < N; i++){
cin >> num[i];
sum = sum + num[i];
}
long max0=num[0], min0=num[0];
for (int i = 0; i < N; i++){
if (max0 < num[i]){
max0 = num[i];
}
if (min0 > num[i]){
min0 = num[i];
}
... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
string a, b;
cin >> a >> b;
if ... | 0 | 64,361,488 |
#include<bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef pair<double,double> P;
vector<P> ans;
void kohho(P b,P e,int c){
if(!c)return;
P s,u,t;
s.X=(-b.X+e.X)/3.0+b.X;
s.Y=(-b.Y+e.Y)/3.0+b.Y;
t.X=s.X+s.X-b.X;
t.Y=s.Y+s.Y-b.Y;
u.X=t.X-s.X;
u.Y=t.Y-s.Y;
double st = u.X;
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 69,141,195 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<ll,ll>
#define PP pair<P,P>
using namespace std;
int main(){
int s; cin >> s;
map<int,int> num;
in... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
vector<ll> C;
vector<vector<ll>> A;
int N,M; ll X;
ll MAX = 1000000000000000000;
ll min_val = MAX;
void solve(string S){
if(S.size() < N){
solve(S+"0");
solve(S+"1");
return;
}... | 0 | 17,408,148 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 56,227,916 |
#include<iostream>
using namespace std;
typedef long long ll;
bool check(ll x, ll y,char c,string s[100]){
for(ll i=-1;i<=1;i++){
for(ll j=-1;j<=1;j++){
if(i==0&&j==0) continue;
if(x+i<0||y+j<0||x+i>=100||y+j>=100) continue;
if(s[x+i][y+j]==c) return false;
}
}
return true;
}
signed main... | #include <iostream>
#include <cstdio>
#include <cctype>
#include <cstdlib>
#include <string>
using namespace std;
int main(void){
char ch;
int alp[26]={0};
while( cin >> ch){
ch = tolower(ch);
if(islower(ch)){
alp[ch-'a']++;
}
}
for(int i=0;i<26;i++){
cout<<(char)('a'+ i)<<" : "<<alp[i]<<endl;
}
retu... | 0 | 86,027,489 |
#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() {
ll l, r;
cin >> l >> r;
ll ans = 2018;
if (r - l >= 2 * 2019) {
rep(i, 2019) rep(j, 2019) ans = min(ans, (ll)i * j % 2019);
} else if (r - l >= 2019) {
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k,ans=0;
cin>>a>>b>>c>>k;
if(a<=k)
{
ans=a;
k-=a;
}
else
{
ans=k;
k=0;
}
if(b<=k)
k-=b;
else
k=0;
cout<<ans-k<<endl;
} | 0 | 48,151,878 |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P... | #include <iostream>
#include <cstdio>
using namespace std;
static const int N = 36 + 1;
class Card {
public:
int value;
char suit;
};
void bubbleSort(Card* c, int n);
void selectionSort(Card* c, int n);
void stable(Card* c1, Card* c2, int n);
void trace(Card* c, int n);
int main() {
Card c1[N], c2[N];
int... | 0 | 33,146,171 |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
typedef long long ll;
const ll MOD = 1e9+7;
const ll INF = 1e9+5;
int dp[100005];
int main() {
int n, k;
scanf("%d%d", &n, &k);
dp[0] = 1;
for (int i=0 ; i<n ; i++) {
int x;
scanf("%d", &x);
... | #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;
int main(){
int n,k; cin >> n >> k;
vector<ll> x(n),y(n),posx,posy;
rep(i,n){
... | 0 | 22,220,394 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 0 | 75,974,569 |
#include<iostream>
using namespace std ;
int main()
{
int ten ,a = 0 ,b = 0 ;
for( short i = 0 ; i < 4 ; i++ )
{
cin >> ten ;
a += ten ;
}
for( short i = 0 ; i < 4 ; i++ )
{
cin >> ten ;
b += ten ;
}
cout << ( a < b ? b : a ) << endl ;
return 0 ;
} | #include<iostream>
using namespace std;
int main()
{
int n,s,R;
while(cin>>n>>s&&n!=0||s!=0)
{
R=0;
if(s<=45)
{
for(int j=0;j<10;j++)
{
if(n>=2)
{
for(int k=j+1;k<10;k++)
{
if(n>=3)
{
for(int l=k+1;l<10;l++)
{
if(n>=4)
{
for(int m=l+1;m<10;m++)
... | 0 | 93,969,396 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T&... | 0 | 30,904,312 |
#include <iostream>
using namespace std;
int main (int argc, char **argv) {
int W, H;
int x, y, r;
cin >> W >> H >> x >> y >> r;
string Ans;
if ((x >= r) && (x <= (W -r)) && (y >= r) && (y <= (H - r))) {
Ans = "Yes";
} else {
Ans = "No";
}
cout << Ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define newl '\n'
#define TEST_CASE(fun) int tc; cin>>tc; while(tc--){ fun(); }
#define TEST_CASE_2 int tc; cin>>tc; for(int i=1;i<=tc;i++)
#define TEST_CASE_3(fun) int tc; cin>>tc; for(int i=1;i<=t... | 0 | 66,094,658 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n; cin>>n;
int i=n+1;
cout<<(i*n)/2<<endl;
} | #include <bits/stdc++.h>
using namespace std;
const int K = 10000;
bool XC[3*K], YC[3*K], XCN[3*K], YCN[3*K];
int main() {
string S; int N, X, Y;
cin >> S >> X >> Y;
N = S.size();
bool mode = 0;
vector<int> xs, ys;
int x = N, cnt = 0;
for(int i=0; i<N; i++) {
if(S[i] == 'T') {x = i; ... | 0 | 64,287,965 |
#include<bits/stdc++.h>
using namespace std;
int count( int n )
{
int ans =0;
while( n%2==0)
{
ans++;
n = n/2;
}
return ans;
}
int main()
{
int n ;
cin>>n;
int ans = INT_MIN;
int val =0;
for(int i=1;i<=n;i++)
{
int temp = count(i);
if( temp > ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | 0 | 27,386,884 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define REP1(i,n) for(int i=1;i<=(int)(n);i++)
#define RREP(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
int main(){
int N,M,ans=0;
string temp;
vector<string> str;
vector<int> num;
cin >> ... | #include <cstdio>
#include <iostream>
#include <queue>
#define ROP(i,n) for(int i=0;i<n;i++)
#define ROPP(i,n) for(int i=1;i<=n;i++)
#define NIL -1
using namespace std;
typedef pair<int,int> P;
int N,M,G,gx[10],gy[10];
char MAP[1005][1005];
int DX[4]={1,0,-1,0},DY[4]={0,1,0,-1},FAR[1005][1005];
int BFS(int u){
queue<... | 0 | 27,821,969 |
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <cmath>
#include <map>
#include <iomanip>
#include <unordered_map>
using namespace std;
typedef long long ll;
int main()
{
ll K;
string str;
cin >> str >> K;
ll cnt = 0;
char focus = str[0];
ll ans = 0;
for (size_t i = 0; i < s... | #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(... | 0 | 76,671,327 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 39,447,578 |
#include<bits/stdc++.h>
using namespace std;
const int N=105,INF=0x3f3f3f3f;
int n,v,ansNum,G[N][N],ans[N],Map[N];
signed main(void){
ios::sync_with_stdio(false);
while(cin>>n&&n!=0){
v=0;
ansNum=1;
memset(G,0x3f,sizeof(G));
memset(Map,0,sizeof(Map));
memset(ans,0,sizeof(ans));
for(int i=1,x,y,w;i<=n;i++)... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#inclu... | 0 | 31,568,741 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
int n;
ll r[111],c[111],d[111];
ll dp[111][111];
const ll oo = 1000000000000000LL;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 1; i <= n; i++)
cin >> r[i] >> c[i];
d[0] = r[1];
for(int i = 1; i ... | #include <iostream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <limits>
#include <algorithm>
#include <array>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <functional>
#include <numeric>
#include <map>
#include <set>
#include <cst... | 0 | 43,968,881 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define IN(type, n) type n; cin >> n
ll solve(int N, int K, vector<int> P, vector<int>C) {
vector<vector<int> > loops = {};
vector<ll> sum = {};
bitset<5000> flag_check;
ll max_score = LLONG_M... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
string print="RYGB";
int main(){
cin.tie(NULL); cout.tie(NULL);
ios_base:: sync_with_stdio(false);
ll h,w,d;cin>>h>>w>>d;
for(ll i=1;i<=h;i++){
for(ll j=1;j<=w;j++){
ll x = (w+i+j)/d;
x%=2;
ll... | 0 | 6,310,829 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintma... | #include "bits/stdc++.h"
using namespace std;
struct StronglyConnectedComponentDecomposition {
vector<vector<int>> graph, igraph, sccbucket;
vector<int> vs, sccid;
int nscc;
void dfs(int v) {
sccid[v] = 0;
for (int u : graph[v]) {
if (sccid[u] == -1) dfs(u);
}
... | 0 | 51,911,971 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <climits>
using namespace std;
int main(){
int entr[6], i, count, menor = INT_MAX;
for(i = 0; i < 5; i++)cin >> entr[i];
sort(entr, entr+5);
do{
count = 0;
for(i = 0; i < 5; i++){
while(count%10 != 0)count++;... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
int count_A=0,count_B=0;
cin>>S;
for(int i=0;i<S.size();i++){
if(S[i] == 'A'){
count_A++;
}else{
count_B++;
}
}
if(count_B == 0 || count_A == 0){
cout<<"No"<<endl;
... | 0 | 42,457,186 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define join(a, d) accumulate(a.begin() + 1, a.end(), a[0], [](string s, s... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | 0 | 50,213,441 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
uint N;
cin >> N;
vector<int> freq(1000000+1, 0);
for (size_t i=0; i<N; ++i) {
uint bin;
cin >> bin;
++bin;
++freq[bin-1];
++freq[bin];
++freq[bin+1];
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
bool le,ri,c;
string s;
cout << 0<<endl;
cin>>s;
if(s=="Vacant")return 0;
map<string,bool> mp;
mp["Female"]=0;
mp["Male"]=1;
ri=mp[s];
cout<<n-1<<endl;
cin>>s;
if(s=="Vacant")return 0;
le=mp[s];
int mi=0,ma=n-1,mid=... | 0 | 43,453,086 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,a[100005],ans1=0,ans2=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
for(int i=0;i<n;i++){
if(a[i]==a[i+1]){
ans1=ans2;
ans2=a[i];
i++;
}
}
if(ans1==0){
cout<<"0"<<endl;
}
else{
cout<<ans1*ans2<<endl;
}
ret... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
for(int i = 0; i + 1 < (int)s.size(); i++){
if(s[i] == s[i + 1]){
cout << i + 1 << " " << i + 2 << "\n";
return 0;
}
if(s[i] == ... | 0 | 6,710,907 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,N;
cin >> N >> A;
bool ok = false;
for (int X=0; X<=N; X+=500) {
if(N-X<=A){
ok = true;
}
}
if(ok == true) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#def... | 0 | 46,178,935 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | #include <bits/stdc++.h>
#define NIL -1
#define INF 1000000001
using namespace std;
struct node{
int key,parent,left,right;
};
int main(){
int size_of_H;
int temp;
scanf("%d",&size_of_H);
vector<node> heap_array(size_of_H+1,node{-1,-1,-1,-1});
for(int i = 1;i <= size_of_H;i++){
scanf("%d... | 0 | 80,827,912 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N = 0;
cin >> N;
vector<int> A(N,0);
int now = 1;
bool check = 0;
for(int i = 0; i < N; i++) {
cin >> A.at(i);
if(A.at(i) == now) {
now++;
check = 1;
}
}
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vd = vector<double>;
u... | 0 | 22,417,063 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#define F(x) for(int i=1;i<=(x);i++)
#define fer(i,n) for(int i=1;i<=(... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e9;
vector<long long int> a, b;
vector<vector<int>> graph;
bool flag = true;
int DFS(int v, int parent_v){
if(b[v] != -INF) return b[v];
long long int sum = 0;
for(int child_v : graph[v]){
if(child_v == parent_v) continue;
... | 0 | 99,485,001 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,ans;
string s,t;
cin>>n>>s>>t;
ans=n;
for(int i=0;i<n;i++){
if(s.substr(i)==t.substr(0,n-i))break;
ans++;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retu... | 0 | 55,760,662 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
ll dp[100010][3];
void show_table(ll I, ll J) {
... | #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 = 1001001001;
const int MOD = 1000000007;
typedef long long ll;
template <typename T>
void print(const T &v);
int main()
{
int X, Y;
cin >> X >> Y;
int a[4] = {1, 0, 1, 0};
... | 0 | 74,193,626 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 10;
const ll INFLL = 3e18;
int main(){
ios_base :: sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s;
cin >> t;
reverse(t.begin(), t.end());
if(t == s) cout << "YES\n";
else cout << "NO\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#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 MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b;... | 0 | 27,660,134 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<un... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <map>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> ... | 0 | 69,114,812 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char str;
cin >> str;
str++;
cout << str;
} | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 0 | 1,689,655 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using namespace std;
void solve(long long N, long long K, std::vector<l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int main()
{
int h, w;
cin >> h >> w;
vector<vector<char>> grid(h, vector<char>(w));
vector<vector<int>> dist(h, vector<int>(w, -1));
queue<P> q;
rep(i, h) rep(j, w)
{
cin >> gri... | 0 | 33,246,667 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int n;
ll a[maxn];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); ... | 0 | 44,046,400 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
void read();
template<typename First, typename... Rest> void read(Firs... | #include <iostream>
#include <algorithm>
#include <vector>
#include <climits>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repR(i, n) for(int i = (n) - 1; i > -1; i--)
#define rep1(i, n) for(int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n) for(int i = (n); i > 0; i--)
using namespace std;
int H = 0;... | 0 | 14,345,642 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int a,b,c;
int main(void){
cin>>a>>b>>c;
a=a%b;
int A=a;
while(true){
A=(A+a)%b;
if(A==c){
cout<<"YES"<<endl;
return 0;
}
if(A==a){
cout<<"NO"<<e... | 0 | 24,420,285 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
char S[105];int K,las=1;
vector<int> vec;
signed main(){
cin>>(S+1)>>K;
int n=strlen(S+1);
if(n==1) return cout<<n*K/2,0;
for(int i=2;i<=n;++i)
if(S[i]!=S[i-1]) vec.push_back(i-las),las=i;
else if(i==n) vec.push_back(i-las+1);
if(vec.size()==1)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<double, double>;
int main() {
int n;
cin >> n;
vector<int> t(n+1, 0);
vector<double> v(... | 0 | 6,258,137 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 302;
ll dp[MAXN][MAXN], h[MAXN];
int main()
{
int n, k; scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%lld", &h[i]);
n++;
for (int i = 1; i <= n; i++)
for (int j = 0; j <= k; j++)
{
... | #include <cstdio>
#include <iostream>
using namespace std;
struct dice{
int q1,q2,q3,q4,q5,q6;
};
void mN(dice &d){
int tmp=d.q1;
d.q1=d.q2;
d.q2=d.q6;
d.q6=d.q5;
d.q5=tmp;
}
void mE(dice &d){
int tmp=d.q1;
d.q1=d.q4;
d.q4=d.q6;
d.q6=d.q3;
d.q3=tmp;
}
void mW(dice &d){
int tmp=d.q1;
d.q1=d.q3;
d.q3=d.q6;
... | 0 | 52,335,687 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int m[10];
int main(){
int a,b;
cin>>a>>b;
m[a] = 1;
m[b] = 1;
if(m[1] == 0){
cout<<1<<endl;
}else if(m[2] == 0){
cout<<2<<endl;
}else{
cout<<3<<endl;
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef unsigned long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,... | 0 | 21,140,968 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int W, H, N;
cin >> W >> H >> N;
vector<vector<int>> rect(H, vector<int>(W, 1));
for (int i = 0; i < N; i++)
{
int x, y, a;
cin >> x >> y >> a;
if (a == 1)
{
for (int j = 0; j... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#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 ... | 0 | 37,498,179 |
#include<cstdio>
int a[100005], b[100005];
int main(){
int n,k;
scanf("%d%d",&n,&k);
for(int i = 1; i <= n; i++) scanf("%d%d",&a[i],&b[i]);
long long ans = 0;
for(int i = 1; i <= n; i++){
int left = a[i]&(~k);
if(left==0) ans += (long long)b[i];
}
int allOne = (1<<30)-1;
... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind{
vector<int> parent;
vector<int> size;
vector<int> rank;
UnionFind(int n){
parent.resize(n);
size.resize(n);
rank.resize(n);
for(int i=0; i<n; i++){
parent[i] = i;
size[i] = 1;
... | 0 | 89,259,057 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=500000;
int n,w[N],tmp[N];
int main()
{
scanf("%d",&n);int cnt=0;
for(int i=1;i<=n;i++)scanf("%d",w+i),tmp[i]=w[i];
sort(tmp+1,tmp+n+1);
for(int i=1;i<=n;i++)w[i]=lower_bound(tmp+1,tmp+n+1,w[i])-tm... | #include<iostream>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
bool check(int n, vector<int> a, int x) {
map<int, int> mp;
mp[a[1]-1] = 0;
for(int i=1;i<=n;++i) {
vector<int> to_erase;
if(a[i-1] < a[i]) {
for(auto itr=mp.begin();itr!=mp.end();++itr) ... | 0 | 11,471,761 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d",&x);
static const int MAX = 1e9 + 1;
int main(){
int n; sc(n)
int A[n];
map<int, int, greater<int>> mp;
for (int i = 0; i < n; i++) s... | #include<bits/stdc++.h>
using namespace std;
int main(){
int W,H,N;
scanf("%d%d%d",&W,&H,&N);
vector<int> X(N),Y(N),a(N);
for(int i=0;i<N;i++) scanf("%d%d%d",&X[i],&Y[i],&a[i]);
int l=0,r=W,d=0,u=H;
for(int i=0;i<N;i++){
switch(a[i]){
case 1:
l=max(l,X[i]);
break;
case 2:
... | 0 | 92,581,023 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int K,S,count=0;
cin >> K >> S;
for(int i=0;i<K+1;i++){
for(int j=0;j<K+1;j++){
if(0<=S-i-j && S-i-j<K+1){
count++;
}
}
}
cout << count << endl;
} | #include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
#include <numeric>
#include <string>
using namespace std;
class uni... | 0 | 9,123,532 |
#include <iostream>
using namespace std;
void writeRectangle(int w, int h)
{
for (int i=0; i<w; ++i)
{
for (int j=0; j<h; ++j)
{
cout << '#';
}
cout << endl;
}
}
int main()
{
int w=0, h=0;
while(true)
{
cin >> w >> h;
if (w == 0 && h ==... | #include<bits/stdc++.h>
using namespace std;
void solve()
{
string s;
cin >> s;
int n = s.size();
int sum = 0;
for (int i = 0; i < n ; i++){
sum+= (s[i] - '0');
}
if(sum % 9 == 0)
cout << "Yes";
else
cout << "No";
}
int main()
{
solve();
cout << "\n";
} | 0 | 87,147,608 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.