code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 1 | 31,130,649 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
string S;
cin >> S;
rep(i, S.size()){
int count = 0;
rep(j, S.size()){
if (i == j) continue;
if (S.at(i) == S.at(j)) count += 1;... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#d... | 1 | 32,572,317 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
bool odd_digit(int n)
{
int cnt = 0;
while (n)
{
cnt++;
n /= 10;
}
return cn... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n; scanf("%lld", &n);
int Count = 0;
for(int i = 1; i <= n; i++)
{
int p = i;
int Coun = 0;
while(p)
{
Coun++;
p /= 10;
}
if(Coun%2 == 1)
{
Coun... | 1 | 89,793,902 |
#include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#defi... | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
int main()
{
string n;
cin >> n;
for (int i = 0; i < 3; i++)
{
if (n.at(i) == '1')
n.at(i) = '9';
else if (n.at(i) == '9')
n.at(i) = '1';
}
cout << n << endl;
} | 1 | 19,261,814 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int a;
set<int> ans, s;
rep(i,4) {
cin >> a;
s.insert(a);
}
ans.insert(1);
ans.insert(9);
ans.ins... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N[4];
for(int i=0;i<4;i++) cin>>N[i];
sort(N,N+4);
if((N[0]==1&&N[1]==4)&&(N[2]==7&&N[3]==9)) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
} | 1 | 27,016,636 |
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
using namespace std;
#define rep(i,a,n) for(int (i)=a;(i)<(int)(n);(i)++)
#define rrep(i,a,n) for(int (i)=(n)-1;(i)>=a;(i)--)
#define all(x) (x).begin(),(x).... | #include<iostream>
using namespace std;
int main(){
int count[5][4][11], n;
for ( int s = 1; s <= 4; s++){
for ( int t = 1; t <= 3; t++)
for ( int u = 1; u <= 10; u++)
count[s][t][u] = 0;
}
cin >> n;
for ( int i = 0 ; i < n; i++){
int b, f, r, v;
cin >> b >> f... | 1 | 17,707,537 |
#include<bits/stdc++.h>
using namespace std;
long long a[200000],l[200000];
signed main()
{
ios::sync_with_stdio(0);
long long n,i;
long long ans=0;
cin >> n;
for(i=1; i<=n; i++)
cin >> a[i];
for(i=1; i<=n; i++)
l[i]=max(a[i],l[i-1]);
for(i=1; i<=n; i++)
ans+=l[i]-a[i];
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vi = vecto... | 1 | 83,285,716 |
#include "bits/stdc++.h"
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl '\n'
#define all(V) (V).begin(), (V).end()
using namespace std;
typedef long long ll;
int main() {fio;
string s;
cin >> s;
vector <int> cnt(26, 0);
ll sm = 0, ans = 0;
for(int i = 0; i < 26; i++) {
cnt[i] = cou... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s;cin>>s;
ll n = s.size();
ll ans = n*(n-1)/2 + 1;
ll a[27];rep(i,27)a[i]=0;
rep(i,n){
ll tmp = s[i]-'a';
++a[tmp];
}
rep(i,27)if(a[i]>=2)ans-=a[i]*(... | 1 | 94,492,508 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
cons... | 1 | 92,969,613 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF = 1000000001;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main() {
int n;
cin >> n;
string s, t;
cin >> s >> t... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
stri... | 1 | 47,744,970 |
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_bac... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a, b, c;
int k;
vector<int> binary = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512};
cin >> a >> b >> c;
cin >> k;
bool flg = false;
for (int i=0;i<=k;i++){
for (int j=0;j<=k;j++){
if (a < b*binary[i] && b*binary[... | 1 | 3,523,407 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i>=(b);... | # include <bits/stdc++.h>
using namespace std;
int main() {
long long int n,a,b; cin >> n >> a >> b;
long long int ans = 0;
if(a > b) {
cout << 0 << endl;
return 0;
} else if(a == b) {
cout << 1 << endl;
return 0;
} else if(a < b) {
if(n == 1) { ans = 0; }
else if(n >= 2) { ans = (n-2)... | 1 | 30,286,780 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;
typedef p... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
int main() {
string a,b;
cin >> a >> b;
bool y=1;
if (a.length()>b.length()) {
cout << "GRE... | 1 | 71,409,797 |
#include <iostream>
#include <map>
using namespace std;
int main(){
long long N;
map<long long,char> price_for_double;
long long Q,H,S,D;
long long sum=0;
cin >> Q >> H >> S >> D;
cin >> N;
price_for_double.insert(make_pair(Q*8,'Q'));
price_for_double.insert(make_pair(H*4,'H'));
price_for_double.inser... | #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 PII pair<int, int>
#define SZ(x) int((x).size())
#define PB(x) push_back(x... | 1 | 96,613,334 |
#include <algorithm>
#include <iostream>
using namespace std;
int dp[10][10];
int main() {
for (;;) {
int n, m = 0;
cin >> n;
if (!n) return 0;
for (int i = 0; i < 10; i++)
fill(dp[i], dp[i]+10, 1<<20);
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
m = max(... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define FOR(i,l,r) for(int i = l; i <= r; i++)
#define TR(e,x) for(auto e = x.begin(); e != x.end(); e++)
#define DEBUG(x) cout << #x << "=" << x << endl;
#define SHOW1(A,n) { REP(i,n-1) printf("%d ", A[i]); printf("%d\n", A[n-1])... | 1 | 9,406,716 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> x;
int count = 1;
for (int i = 1; i < n; i++) {
if (s.at(i - 1) == s.at(i)) count++;
else {
x.emplace_back(count);
count = 1;
}
... | #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... | 1 | 94,930,712 |
#include <cstdio>
#define max(a,b) ((a)>=(b)?(a):(b))
int main() {
int s=0,t=0,p;
for(int i=0;i<4;i++)
scanf("%d",&p),s+=p;
for(int i=0;i<4;i++)
scanf("%d",&p),t+=p;
printf("%d\n",max(s,t));
} | #include<stdio.h>
int main()
{
int tensu[2];
int a,b,c,d,i;
for(i=0;i<2;i++)
{
scanf("%d %d %d %d",&a,&b,&c,&d);
tensu[i]=a+b+c+d;
}
if(tensu[0]<tensu[1])
{
printf("%d",tensu[1]);
}
else if(tensu[0]>tensu[1])
{
printf("%d",tensu[0]);
}
else
{
printf("%d\n",tensu[0]);
}
return 0;
} | 1 | 80,271,428 |
#include<stdio.h>
int main(){
int H[10000], W[10000];
int length;
int i=0, j, k;
do{
scanf("%d %d", &H[i], &W[i]);
i += 1;
}while(H[i-1]!=0 || W[i-1]!=0);
length = i;
for(i=0; i<length-1; i++){
for(j=0; j<H[i]; j++){
for(k=0; k<W[i]; k++){
... | #include<stdio.h>
int main(){
int a[100],b[100],i=0;
do{
scanf("%d %d",&a[i],&b[i]);
i++;
}while(a[i-1]!=0||b[i-1]!=0);
for(int x=0;x<i-1;x++){
for(int y=0;y<a[x];y++){
for(int z=0;z<b[x];z++){
printf("#");
}
printf("\n");
}
printf("\n");
}
} | 1 | 58,150,647 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
int h[n];
rep(i, n) cin >> h[i];
int a, b;
int cnt[n] = {0};
rep(i, m) {
cin >> a >> b;
a--; b--;... | #include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#define FOR(i,a,b) for (int i = a; i < b; ++i)
#define FORR(i,a,b) for (int i = b - 1; i >= a; --i)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) FORR(i,0,n)
int main() {
int N, M;
cin >> N >>... | 1 | 37,279,511 |
#include <stdio.h>
#include <string.h>
int i;
int m, n;
char table[256];
int main() {
while (1) {
scanf("%d", &n);
if (n == 0) return 0;
memset(table, 0, sizeof(table));
for (i=0; i<n; i++) {
char a, b;
scanf(" %c %c", &a, &b);
table[a] = b;
... | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
int m;
char before, after;
char ch;
while(cin >> n){
if(n == 0) break;
map<char , char> mp;
vector<char> vc;
for(int i = 0; i < n; i++){
cin >> before >> after;
mp[before] = after;
vc.... | 1 | 43,593,545 |
#include <iostream>
#include <vector>
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define FOR(i,n,m) for(ll i=n; i<(ll)m;i++)
#define FORa(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define FORr(i,m,n) for(ll i=n;... | #include <iostream>
#include <string>
using namespace std;
int mod = 1046527;
int genhash(string str){
int h = 0;
for(auto ch : str){
h *= 5;
if(ch == 'A'){
h += 1;
} else if(ch == 'C'){
h += 2;
} else if(ch == 'G'){
h += 3;
} else {
... | 1 | 97,341,409 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
long long h, w, a, b;
cin >> h >> w >> a >> b;
long long ans[h][w];
for(long long y = 0; y < h; y++){
for(long long x = 0; x < w; x++){
if(y < b){
if(x < a) ans[y][x] = 0;
else ans[... | #include<iostream>
using namespace std;
int main(){
int H, W, A, B;
cin >> H >> W >> A >> B;
for(int i=1; i<=H; i++){
for(int j=1; j<=W; j++){
if((i<=B && j<=A) || (i>B && j>A)){
cout << 0;
} else{
cout << 1;
}
}
cou... | 1 | 58,254,263 |
#include<iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b;
c=a+(b/2);
cout<<c;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll x,y;cin>>x>>y;
cout<<x+y/2;
} | 1 | 98,623,106 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long ;
int main()
{
int n;
cin>>n;
vector<int> a(n),b(n);
rep(i,n) cin>>a[i];
b=a;
sort(b.begin(),b.end());
rep(i,n){
if(a[i]==b[n-1]) cout<<b[n-2]<<endl;
else cout<<b[n-1]<<end... | 1 | 30,342,137 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n;cin >> n;
string s; cin >> s;
char temp = s[0];
vector<char> str;
str.push_back(s[0]);
for(int i = 1; i < n; i++){
if(temp == s[... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <cassert>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#d... | 1 | 29,983,968 |
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
#include <climits>
using namespace std;
#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)
typedef vector<int> vi;
int main()
{
int n;
while(sca... | #include <iostream>
using namespace std;
#define N_MAX 5000
int array[N_MAX];
int main(){
int n;
int num;
while(cin>>n&&n){
int ans=-100000*5000;
for(int i=0;i<n;i++){
cin>>num;
if(i==0)array[i]=num;
else{
array[i]=max(array[i-1]+num,num);
}
ans=max(ans,array[i]);
}
cout<<ans<<endl;
}
re... | 1 | 27,587,026 |
#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 <bits/stdc++.h>
using namespace std;
int N, M;
int WA[105000];
bool AC[105000];
void solve() {
cin >> N >> M;
int WAnum = 0;
int ACnum = 0;
for(int i = 1; i <= N; i++) {
WA[i] = 0;
AC[i] = false;
}
while(M--) {
int p;
string S;
cin >> p >> S;
... | 1 | 32,205,892 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<ll, ll> ii;
typedef pair<ll, ii> iii;
const ll mod = 1e9 + 7;
const ll siz = 1e5 + 10;
const ll base = 32;
const ll MAXX = 1e9;
ll n;
vector<ll> hold;
ll cnt[siz];
ll val[siz][2];
ll pre[siz];
ll qPow(ll a, ll b) {
if (b == 0) {
return... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
const ll INF = 1000000000000000000ll;
const ll MOD = 1000000007ll;
const double EPS = 1e-8;
const int MAX_N = 100005;
ll fact[MAX_N];
ll factinv[MAX_N];
long long mod_pow(long long x, long long n, long long mod){
long long... | 1 | 34,988,159 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define eb emplace_back
#define pb push_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | #include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <complex>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
int s[2005], t[2005];
const LL M = (LL)1e9 + 7;
LL r_... | 1 | 37,676,680 |
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int n, cnt = 0;
cin>>n;
for (int i = 1; i <= n/2; ++i)
{
if (i + (n - i) == n && i != (n - i))
{
cnt++;
}
}
cout<<cnt;
cin>>n;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i )
using namespace std;
int main(){
int x; cin >> x;
if(x % 2 == 0) cout << x/2 -1 << endl;
else cout << x/2 << endl;
return 0;
} | 1 | 92,089,288 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int swap = 0;
int count = 0;
char last = s[0];
for(int i = 1; i < s.size(); ++i){
char curr = s[i];
if(curr != last){
last = curr;
continue;
}
if(cur... | #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... | 1 | 43,318,263 |
#include <iostream>
#include <string>
#define MAX_LEN (100)
using namespace std;
int all_diff(int value[]);
class Dice {
private:
int value[6];
int top;
public:
Dice(int value[]) {
for (int i = 0; i < 6; i++) {
... | #include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
struct Dice{
vector<int> oginPostions;
vector<int> positions;
enum MOVE{
E = 0,
S,
W,
N
};
void Move_E(){
positions = oginPostions;
int temp1 = positions[0];
int tem... | 1 | 87,841,494 |
#include <bits/stdc++.h>
using namespace std;
#define rep(src,dst) for(int i=src; i<dst; i++)
#define rep2(src,dst) for(int j=src; j<dst; j++)
#define INF 1000000000000
#define MOD 10000007
#define PI acos(-1)
#define ll long long
template<typename T> inline void ChMin(T* a, T* b) {if(*a>*b) *a=*b;}
template<... | #include<bits/stdc++.h>
using namespace std;
int n;
string s,t,ans;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>s>>t;
for(int i=0;i<n;i++){
ans+=s[i];
ans+=t[i];
}
cout<<ans<<endl;
return 0;
} | 1 | 48,250,224 |
#include<cstdio>
using ll = long long;
int main(){
int N, K;
scanf("%d %d", &N, &K);
ll a[N], ruiseki[N + 1], absruiseki[N + 1];
ruiseki[0] = absruiseki[0] = 0;
for (int i = 0; i < N; ++i){
scanf("%lld", a + i);
ruiseki[i + 1] = ruiseki[i] + a[i];
absruiseki[i + 1] = absruiseki[i] + (a[i] > 0 ? a[i] : 0);
}... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
... | 1 | 7,645,277 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int ... | #include <iostream>
#include<bits/stdc++.h>
#define l long
using namespace std;
int solve(int idx , int n , vector<vector<int>>&dp ,vector<vector<int>>&act , int check)
{
if(idx >= n)
return 0;
if(dp[idx][check] != -1)
return dp[idx][check];
int op1 = -1e7;
int op2 = -1e7;
int op3 = -1e... | 1 | 40,457,595 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
string s;
string res="";
stack<char>br;
cin>>n>>s;
for(int i=0;i<n;i++)
{
if(s[i]=='('){
br.push(s[i]);
res=res+"(";
}
else if(s[i]==')')
{
if(br.size()==0){
res="("+res;
res=res+")";}
else
{
br.pop();
res... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | 1 | 43,773,366 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int f[50];
int main() {
int n; scanf("%d", &n);
f[0] = f[1] = 1;
for (int i = 2; i <= n; i++)f[i] = f[i - 2] + f[i - 1];
printf("%d\n", f[n]);
} | #include <iostream>
#include <sstream>
#include <fstream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
using namespace std;
long *memo;
long fib(long n){
if(n < 2) retur... | 1 | 16,112,711 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <set>
typedef std::pair<int, int> ii;
int H, W, M;
int SH[300005];
int SW[300005];
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
std::cin >> H >> W >> M;
for (int i = 0; i < H;... | #include <iostream>
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ll long long
#define li long ll
#define pp pair<ll, ll>
#define lb lower_bound
#define ub upper_bound
#define mk make_pair
#define pb push_back
#define llp(i, x, n) for (ll i = x; i < n; i++)
#define yes cou... | 1 | 61,790,594 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include<iostream>
int main(){
int X, A, B;
std::cin >> X >> A >> B;
if(B - A <= 0) std::cout <<"delicious";
else if(B - A > X) std::cout << "dangerous";
else std::cout<<"safe";
} | 1 | 89,776,191 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
int g[100010];
inline int gi() {
int x=0,o=1;
char ch=getchar();
while(ch!='-'&&(ch<'0'||ch>'9')) ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int x[N], d[N], ans[N];
int main() {
int n, l, t;
scanf("%d%d%d", &n, &l, &t);
vector<int> L, R;
for (int i = 0; i < n; ++ i) {
scanf("%d%d", &x[i], &d[i]);
(d[i] == 1 ? R : L).push_back(x[i]);
(d[i] == 1 ? R : L).push_back(x[i] - l);
(d[i... | 1 | 77,582,823 |
#include<cstdio>
#include<vector>
using namespace std;
int n, sum[1000001], isP[1000001];
vector<int> p;
int main() {
for (int i = 2; i * i <= 1000000; i++) {
bool ok = true;
for (int j = 0; j < p.size(); j++) if (i % p[j] == 0) {
ok = false;
break;
}
if (ok) p.push_back(i);
}
for (int... | #include<cstdio>
#define MAX 1000010
bool is_prime[MAX];
int sieve(int n) {
for (int i = 0; i <= n; ++i) is_prime[i] = true;
is_prime[0] = is_prime[1] = false;
int count = 0;
for (int i = 2; i <= n; ++i) {
if (is_prime[i]) {
++count;
for (int j = 2 * i; j <= n; j += i) {
is_prime[j] = false;
}
}
... | 1 | 12,082,742 |
#include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_;i--)
#define REP(i, n) ... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#incl... | 1 | 80,888,962 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000009
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
int n;
cin>>n;
vector<int> arr(100001,0);
for(int ... | #include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a[100010]={0};
int x;
int i,j;
int ans=1;
int max=1;
for(i=0; i<N; i++){
cin >> x;
if(x!=0){
for(j=-1; j<2; j++){
a[x+j]++;
}
}
else{
... | 1 | 7,265,310 |
#include <iostream>
#include <algorithm>
#include <complex>
#include <vector>
using namespace std;
int main(){
int n, a, b;
cin >> n;
bool flg_a = 0, flg_b = 0;
vector<int> data_a(n);
vector<int> data_b(n);
vector<int> pmt(n);
for (int i = 0; i < n; i++){
cin >> data_a[i];
pm... | #include <bits/stdc++.h>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> array(n),parray(n),qarray(n);
for(int i=0;i<n;i++) cin >> parray.at(i);
for(int i=0;i<n;i++) cin >> qarray.at(i);
int num = 1;
for(int i=0;i<n;i++){
ar... | 1 | 86,756,884 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<functional>
#include<cassert>
#include<numeric>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<queue>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef std::pair<int, int> P;
typedef vector<int... | #include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <deque>
#include <ctime>
using namesp... | 1 | 13,037,355 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s, w;
cin >> s >> w;
cout << (w>=s ? "unsafe" : "safe");
return 0;
} | #include"bits/stdc++.h"
using namespace std;
#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) REP((i),0,(n))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using tp3 = tuple<int, int, int>;
using Mat = vector<vector<ll>>;
constexpr int INF = 1 << 28;
constexpr ll INFL = 1l... | 1 | 71,143,054 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
char field[1000][1000];
class Data {
public:
int x, y, count;
Data() {}
Data(int x, int y, int count) : x(x), y(y), count(count) {}
};
int main() {
int h, ... | #include<iostream>
#include<queue>
using namespace std;
string s[1000];
int h,w,n;
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int bfs(int x,int y,int now)
{
int d[h][w]={};
queue<pair<int,int>>Q;
Q.push(make_pair(8,x*1000+y));
while(!Q.empty())
{
pair<int,int>a=Q.front();Q.pop();
int tx=a.second/1000,ty=a.sec... | 1 | 96,105,921 |
#include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
if (n % k > 0) {
ans = 1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 1 | 85,842,642 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
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 int64_t INF = 1LL << 60;
int main() {
int64_t N,A,B;
cin>>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b; scanf("%d%d%d", &n, &a, &b);
long long ret;
if (a>b) {ret = 0;}
else if (a!=b && n==1) {ret = 0;}
else if (a==b && n==1) {ret = 1;}
else {ret = (long long)(b-a)*(n-2)+1;}
printf("%lld\n", ... | 1 | 62,011,387 |
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("in","r",stdin);
freopen("out","w",stdout);
#endif
int n,z,w;
cin>>n>>z>>w;
vector<int> a(n);for(auto &i:a)cin>>i;
if(n==1){cout<<abs(w-a[0]);return 0;}
cout<<max(abs(a[n-1]-a[n-2]),... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD = 1000000007;
int main(){
int n,z,w; cin >> n >> z>> w;
vector<int> a(n);
for(int i = 0; i < n; ++i){
cin >>a[i];
}
if(n>1){
int ans =max(abs(... | 1 | 26,504,858 |
#include<iostream>
using namespace std;
#include<stdlib.h>
int main()
{
int i, n, d, p, q;
cin >> n;
int *P, *C, *S;
P = new int [n]; C = new int [n]; S = new int [n];
if(P == NULL || C == NULL || S == NULL) exit(EXIT_FAILURE);
for(i = 0; i < n; i++){ P[i] = -1; S[i] = -1; }
while(... | #include <cstdio>
using std::scanf;
using std::printf;
const int kNil = -1;
struct Node { int parent, left, right; };
void SetDepth(struct Node tree[], int cur_node, int cur_depth, int depth[]) {
depth[cur_node] = cur_depth;
if (tree[cur_node].left != kNil) {
SetDepth(tree, tree[cur_node].left, cur_depth + 1, d... | 1 | 56,338,621 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const int INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(int m,int n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;i++){
if(n & (... | #include <bits/stdc++.h>
using namespace std;
const int combination_max=1000000+1000000+2;
const int combination_modulo=1000000007;
vector<int64_t> factorials(combination_max);
vector<int64_t> factorials_inv(combination_max);
vector<int64_t> inverse(combination_max);
int combination_mod(int n, int k);
int prepare_combi... | 1 | 85,130,593 |
#include<bits/stdc++.h>
#define PI acos(-1.0)
#define eps 1e-67
#define pf printf
#define sf scanf
#define sd(n) scanf("%d",&n)
#define sd2(n1,n2) scanf("%d %d",&n1,&n2)
#define slf(n) scanf("%lf",&n)
#define slf2(n1,n2) scanf("%lf %lf",&n1,&n2)
#define sLf(n1) scanf("%Lf",&n1)
#define sLf2(n1,n2) scanf("%Lf %Lf",&n1,&... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string s;
cin >> s;
reverse(s.begin(), s.end());
string t = "";
for (int i = 0; i < s.length(); i++) {
if (s.substr(i, 5) == "maerd") {
t += "maerd";
i += 4;
}else if (s.substr(i, 7) == "remaerd") {
t += "rema... | 1 | 33,310,939 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define REV(i,a,n) for(int i=a;i>=n;i--)
#define all(a) a.begin(),a.end()
#define UB upper_bound
#define LB lower_... | #include<bits/stdc++.h>
using namespace std;
int mod = 1e9+7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin>>n>>k;
vector<int> candies(n+1,0);
for(int i=1;i<=n;i++) {
cin>>candies[i];
}
vector<vector<int>> dp(n+1,vector<int>(k+1));
dp[0][0] = 1;
for(int i=1;i<=k;i++) {
dp[0][i... | 1 | 41,526,828 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS ios_base::sync_with_stdio(0);cin.tie(0)
signed main(){
IOS;
int n; cin >> n;
vector<int> next(n + 1), ok(n + 1);
for(int i = 0; i < n; i++) {
cin >> next[i + 1];
}
int ans = 0, now = 1;
while(++ans) {
int... | 1 | 34,966,808 |
#include<bits/stdc++.h>
using namespace std;
int a,b,bj;
int main()
{
cin>>a>>b;
if((!((a+b)%3))||(!(b%3))||(!(a%3)))puts("Possible");
else puts("Impossible");
return 0;
} | #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... | 1 | 24,337,877 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdio>
#include<set>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define repn(i, n) for(int i = 1; i <= n; i++)
int main(){
int N; cin >> N;
int index[N+1];
repn(i, N){
int p; ci... | #include <bits/stdc++.h>
#include<algorithm>
#include<stdio.h>
#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll INF=1e13;
const ll maxn=1e6+5;
const int mod=998244353;
const double eps=1e-12;
ll n,m,p;
ll num[maxn];
int pre[maxn][2];
int cur[maxn][2];
struct no... | 1 | 2,534,017 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long div(long long a, long long b, long long c) { return b / c - (a - 1) / c; }
void print_binary(lo... | #include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <cstring>
#include <queue>
#include <assert.h>
#include <cmath>
#include <stack>
#include <deque>
#include <set>
#include <unordered_map>
#include <complex>
#include <fstream>
#include <map>
#include <numeric>
#include <functional>
... | 1 | 18,326,151 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
ll n;
cin >> n;
cout << n*(n-1)/2 << endl;
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>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define sz(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element... | 1 | 56,342,792 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using Graph = vector<vector<int>>;
using P = pair<int,int>;
using ll =long long;
const int MOD=(int)1e9+7;
const int INF=(int)1e9;
const ll LINF=(ll)1e18;
int main(){
ll n,m;
cin >> n >> m;
if(n>2 && m>2){
... | 1 | 74,399,703 |
#include <bits/stdc++.h>
using namespace std;
#define ENDL '\n'
#define io ios_base::sync_with_stdio(false);cin.tie(0);
#define sayy cout<<"YES"<<ENDL;
#define sayn cout<<"NO"<<ENDL;
string group(string s){
string result;
result += s[0];
for(int i(0); i<s.length() - 1; i++){
if(s[i] != s[i+1]){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 1 | 47,186,825 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int MAX = 100000;
static const int NIL = -1;
using namespace std;
int main() {
ll n,s,k; cin >> n >> k >> s;
ll p = 0;
ll c = s/k;
ll d = s-c*(k-1);
rep(i,n){
if(p < k){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,k,s;
cin>>n>>k>>s;
for(int i=0;i<k;i++){
cout<<s<<" ";
}
for(int i=0;i<n-k;i++){
if(s==1000000000)
cout<<s-1<<" ";
else{
cout<<s+1<<endl;
}
}
cout<<en... | 1 | 47,606,621 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n, tp = 0, hp = 0;
string tc, hc;
cin>>n;
for(int i=0;i<n;i++){
cin>>tc>>hc;
if(tc > hc) tp += 3;
else if(tc < hc) hp += 3;
else if(tc == hc){
tp++; hp++;
}
}
cout<<tp<<" "<<hp<<endl;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
int t,h,n;
cin >> n;
string tc,hc;
t = h = 0;
for (int i = 0; i < n; i++){
cin >> tc >> hc;
if(tc > hc) t += 3;
else if (hc > tc) h += 3;
else{
t++;
h++;
}
}
c... | 1 | 61,628,911 |
#include <iostream>
#include <string>
#include <math.h>
using namespace std;
int main()
{
int N,x,count=0;
cin>>N;
for ( int i = 1; i <= N; i++)
{
x=log10(i);
if ((x%2)==0){
count++;
}
}
cout<<count;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int M = N;
int d = 1;
while (M/ 10 > 0)
{
d++;
M /= 10;
}
int ans = 0;
for (int i = 1; i <= d; i++)
{
if (i % 2... | 1 | 94,025,141 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string numbers;
int a=0;
while (true) {
a=0;
cin>>numbers;
if(numbers=="0")break;
for (int i=0; i<numbers.length(); i++) {
a+=int(numbers[i])-48;
}
cout<<a<<endl;
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
int main()
{
std::string x;
int digitsSum;
while (1)
{
std::cin >> x;
if (!strcmp(x.c_str(), "0"))
{
break;
}
digitsSum = 0;
for (int i = 0; i < x.size(); i++)
{
digitsSum += x[i] - '0';
}
printf("%d\n", digitsSum);... | 1 | 92,500,622 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main(){
int N, K; cin >> N >> K;
vector<... | 1 | 36,004,281 |
#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... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll... | 1 | 42,272,356 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 1 | 93,139,618 |
#include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#de... | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x < 1200) {
cout << "ABC" << endl;
}
else if(1200 <= x && x <= 3000){
cout << "ARC" << endl;
}
} | 1 | 74,874,076 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <co... | #include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int score = 0, n, max = INT_MIN, min = INT_MAX, ava = 0, cnt = 0;
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; i++){
cin >> score;
ava += score;
if(score > max) max = score;
if(score < min) min = score;
... | 1 | 25,499,020 |
#include <iostream>
using namespace std;
int main()
{
int h,w;
for( ; ; ){
cin >> h >> w;
if(h==0 || w==0) break;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int H,W;
for(int c=0;;c++){
cin >> H >> W;
if(H+W==0)break;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cout << '#';
}
cout << endl;
}
cout << endl;
}
return 0;
} | 1 | 75,660,375 |
#include <iostream>
using namespace std;
main(){
string s,p;
cin>>s>>p;
cout<<((s+s).find(p)!=string::npos?"Yes\n":"No\n");
} | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int n, m;
string s, p;
int main(){
cin >> s >> p;
n = s.size();
m = p.size();
s += s;
rep(i, n){
if(p == string(s, i, m)){
cout << "Yes" << endl;
... | 1 | 13,600,122 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | #include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main()
{
string S;
cin >> S;
bool yes = false;
for (int i = 0; i < S.size() - 1; i++) {
if (S[i] != S[i + 1]) {
yes = true;
... | 1 | 91,253,793 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define len(a) (int)a.size()
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
struct UnionFind {
vector<int> parent;
UnionFind(int n) {
parent.assign(n, -1);
}
int find(int x) {
... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#inc... | 1 | 46,538,994 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
vector<int> C(M), D(M);
for (int i=0; i<N; i++){
cin >> A.at(i) >> B.at(i);
}
for (int i=0; i<M; i++){
cin >> C.at(i) >> D.at(i);
}
for (int i=0; i<N; i++){
int diff=400000000;
i... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
const ll INF = 1001001001;
int main()
{
int n, m;
cin >> n >> m;
vector<P> ab(n);
vector<P> cd(m... | 1 | 10,523,686 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define maxn 100
#define int long long int
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b)
{
return b ? gcd(b, a % b) : a;
}
int lcm(int a, int b) { return a / gcd(a, b)... | #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)
using ll = long long;
#define INF 1e9
int N;
vector<int> A, B;
vector<pair<int, int>> AB;
bool cmp(pair<int, int> l, pair<int, int> ... | 1 | 81,910,461 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll inf=1LL<<32;
ll dis[110][110],i,j,k,n,m,a,b,w,flag;
void Floyd()
{
for(k=0; k<n; k++)
for(i=0; i<n; i++)
for(j=0; j<n; j++)
if(dis[i][k]<inf&&dis[k][j]<inf)
dis[i][j]=min(dis[i][j],dis[i][k]+dis[... | #include<bits/stdc++.h>
using namespace std;
#define inf 1e12+1
typedef long long int ll;
typedef pair<ll,ll> mypair;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
ll v,e;
cin>>v>>e;
vector<vector<mypair> > g(v);
vector<vector<ll> > dp(v,vector<ll>(v,inf) );
ll s,t,d;
rep(i,e){
cin>>s>>t>>d,g[s].push... | 1 | 84,103,178 |
#include <iostream>
#include <cstring>
using namespace std;
struct edge{
int node;
edge *next;
}nodes[105];
int n,matrix[105][105];
int main()
{
memset(matrix,0,sizeof(matrix));
cin>>n;
int i,j;
for(i=1;i<=n;i++){
int ii,n_i;
cin>>ii>>n_i;
for(j=0;j<n_i;j++){
... | #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#i... | 1 | 16,186,735 |
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=1e6;
string s[maxn];
int main(){
int n,A=0,B=0,AB=0,sum=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>s[i];
int len=s[i].size()-1;
for(int j=1;j<=len;j++){
if(s[i][j]=='B'&&s[i][j-1]=='A') sum++;
}
if(s[i][0]=='B'&&s[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
ll b_a = 0;
ll b_x = 0;
ll x_a = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < s.length()-1; j++) {
if (s.at(j) == 'A' && s.at(j + 1) == 'B')ans++;
}
if (s.at(0) =... | 1 | 16,747,592 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string> ... | #include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <map>
#include <numeric>
#include <algorithm>
#include <iomanip>
#include <stdio.h>
int main(void){
long long h,w;
std::cin >> h >> w;
if(h==1||w==1) std::cout << "1";
else std::cout << (h*w+1)/2;
return 0;
} | 1 | 42,889,004 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <string>
#include <numeric>
#include <algorithm>
#include <functional>
#include <iterator>
#include <cstdio>
#include <c... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<deque>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#include<cstring>
#include<climits>
#include<cmath>
#include<iterator>
#include<set>
#define fileOut freopen("out.txt","w",stdout)
#define fileIn freopen("in.txt","r",stdout)
#define t... | 1 | 16,462,248 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#de... | #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 rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
typedef pai... | 1 | 71,756,201 |
#include <iostream>
using namespace std;
using ll = long long;
int main(void) {
ll A,B,K; cin >> A >> B >> K;
ll ans_A = 0, ans_B=0;
if(A+B < K) {
ans_A = 0;
ans_B = 0;
}
else if(A < K) {
ans_A = 0;
ans_B = B - (K - A);
}
else {
ans_A = A - K;
... | #include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ll long long
#define ld long double
#define pb push_back
#define MOD 1000000007
#define LLMN LONG_LONG_MIN
#define... | 1 | 67,000,461 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
const int maxn=2*300;
int n;
int a[maxn];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(int i=1;i<=n;i++)
{
printf("node %d: key = %d, ",i,a[i]);
... | #include <stdio.h>
#include <stdlib.h>
int main(){
int n;
scanf("%d", &n);
int a[n];
for(int i = 1; i <= n; i++){
scanf("%d", &a[i]);
}
for(int i = 1; i <= n; i++){
printf("node %d: key = %d, ", i, a[i]);
if(i/2 >= 1){
printf("parent key = %d, ", a[i/2]);
... | 1 | 44,162,248 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const double PI = acos(-1.0);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int Room[4][3][10] = {0};
for(int i = 0; i < n; i++) {
int a, b, c, num;
cin >> a >> b >> c >> num;
Room[a - 1][b ... | #include<iostream>
#include<iomanip>
using namespace std;
int main(){
int n,b,f,r,v,house[4][3][10];
for(int i=0;i<4;i++){
for(int j=0;j<3;j++){
for(int k=0;k<10;k++){
house[i][j][k]=0;
}
}
}
cin >> n;
for(int i=0;i<n;i++){
cin >> b >> f >> r >> v;
house[b-1][f-1][r-1]=house[b-1][f-1][r-1]+v;
}
... | 1 | 37,661,457 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main(){
ll n,m;cin>>n>>m;
if(n==1&&m==1){cout<<1;}
else if(n==1){cout<<m-2;}
else if(m==1){cout<<n-2;}
else{cout<<(n-2)*(m-2);}
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N,M;
cin>>N>>M;
long long N1=min(N,M);
long long M1=max(N,M);
if(N1==1&&M1==1) cout<<1<<endl;
else if(N1==1&&M1!=1) cout<<M1-2<<endl;
else cout<<(N1-2)*(M1-2)<<endl;
return 0;
} | 1 | 2,788,325 |
#include <bits/stdc++.h>
#define ll long long
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define lpri(n) printf("%lld ",n)
#define pri(n) printf("%d ",(int)n)
#define prin(n) printf("%d\n",(int)n)
#define lprin(n) printf("%lld\n",n)
#define rep(i,ini,n) for(int i=ini;i<(int)n;i++)
#define pb push_ba... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int input_num, num_list[100], cost, min_cost = -1, min_num, max_num;
cin >> input_num;
for (int i = 0; i < input_num; i++)
{
cin >> num_list[i];
}
min_num = max_num = num_list[0];
for (int i = 0; i < input_num; i++)
{
if (mi... | 1 | 31,813,739 |
#include<bits/stdc++.h>
#define lli long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
map<int,int>m;
lli n;
cin>>n;
lli a[n],i,flag=0;
for(i=0;i<n;i++)
{
cin>>a[i];
m[a[i]]++;
if(m[a[i]]>1)
... | #include <bits/stdc++.h>
int main() {
int n; std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; ++i) std::cin >> a[i];
std::sort(a.begin(), a.end());
bool ok = true;
for (int i = 0; i < a.size()-1; ++i) {
if (a[i] == a[i+1]) ok = false;
}
if (ok) std::cout << "YES" << std::endl;
else st... | 1 | 2,850,412 |
#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 < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | 1 | 43,824,518 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<pair<int,ll>>>;
using pp=pair<ll,pair<ll,ll>>;
#define MAX 1000000
#define MOD 1000000007
#define INF 1000000000000000000
vector<int> parent;
int find(int x){
int y=parent[x];
while(y!=parent[y]){
y=find(y);
}
return... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 1e7 + 7;
ll par[mx];
ll p_u, p_v;
ll find_parent(ll x) {
if(x == par[x]) return x;
return par[x] = find_parent(par[x]);
}
void join(ll u, ll v) {
p_u = find_parent(u);
p_v = find_parent(v);
if(p_u == p_v) return;
par[p... | 1 | 2,159,335 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
void bfs(int src, int n, vector<vector<int> > G);
int main() {
int n;
cin >> n;
vector<vector<int> > G(n, vector<int>(n, 0));
for (int i = 0; i < n; i++) {
int u, k;
cin >> u >> k;
for (int j = 0; j < k; j++) {
int v_j;
cin >> v... | 1 | 23,258,281 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int n;
int l,r;
int ans;
int main(void){
cin>>n;
while(n--){
cin>>l>>r;
ans+=(r-l+1);
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)x.size()
using namespace std;
int n,ans;
int main(){
cin>>n;
vector<pair<int,int>>v;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
if(!i){
v.push_back({a,b});
}
else{
bool ok=1;
for(int j=0;j<sz(v);j++){
if(v[j].first>b || v[j].seco... | 1 | 6,411,091 |
#include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using P = pair<int, int>;
#define BE(x) x.begin(), x.end()
const llong inf = llong(1e18)+7;
const llong mod = 1e9+7;
int main(){
llong H, W, N;
vector<P> black, masu;
cin >> H >> W >> N;
int h,w;
for(int i = 0; i < N; ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ... | 1 | 34,567,169 |
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a<=c)
{
if(b<=c)
{
cout<<"0";
}
else
{
if(b>=d)
{
cout<<(d-c);
}
else
... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typede... | 1 | 5,098,376 |
#include <iostream>
#include <cmath>
#include <string>
#include <cstdlib>
#include <iomanip>
#include <stdio.h>
using namespace std;
int main(){
int a,b;
scanf("%d %d",&a,&b);
if(a<b)
cout << "a < b" << endl;
else if(a>b)
cout << "a > b" << endl;
else
... | #include<stdio.h>
int main(void){
int a,b;
scanf("%d %d",&a,&b);
if(a>b){
printf("a > b\n");
}
else if(a<b){
printf("a < b\n");
}
else if(a==b){
printf("a == b\n");
}
return 0;
} | 1 | 82,428,536 |
#include <iostream>
#include <algorithm>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int high[10];
REP(i,10){
cin >> high[i];
}
sort(high,high+10);
cout << high[9] << endl;
cout << high[8] << endl;
cout << high[7] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#def... | 1 | 79,046,232 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
string S;
cin >> S;
int not0101 = 0;
int not1010 = 0;
rep(i, S.size()) ... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
int64_t size = S.size();
int64_t siro_count = 0;
int64_t kuro_count = 0;
for (int64_t i=0; i<size; i++) {
if (i % 2 == 0) {
if (S[i] == '0') {
... | 1 | 71,810,773 |
#include <iostream>
using namespace std;
int main(){
int H = 1;
int W = 1;
cin >> H >> W;
while(H != 0 & W != 0){
for(int h=0; h<H; h++){
for(int w=0; w<W; w++){
if(h == 0 | h == H-1) {cout << "#";}
else{
if(w == 0 | w == W-1) {cout << "#";}
else {cout << ".";}
}
}
cout << "" << end... | #include <iostream>
using namespace std;
int main()
{
int h,w;
while(1)
{
cin>>h>>w;
if((h==0)&&(w==0)) break;
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
cout<<(((i==0)||(i==h-1)||(j==0)||(j==w-1))?'#':'.');
cout<<endl;
}
cout<<endl;
}
} | 1 | 99,994,185 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string temp;
string A[N];
cout<<0<<endl;
cin>>temp;
if(temp=="Vacant"){
cout<<0<<endl;
return 0;
}
if(temp=="Male"){
A[0]="Male";
}
if(temp=="Female"){
A[0]="Female";
}
cout<<N-1<<endl;
cin>>temp;
if(t... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,... | 1 | 92,428,438 |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) ... | #include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main(){
int k , n;
cin >> k >> n;
if(k % n == 0)cout << 0 << endl;
else cout << 1 << endl;
} | 1 | 58,915,527 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.