code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin >> s;
for (size_t i = 0; i < s.size(); i++)
{
if (s.at(i)!='x')
{
t += s.at(i);
}
}
for (size_t i = 0; i < t.size()/2; i++)
{
if (t.at(i)!=t.at(t.size()-1-i))
{
cout << -1;
return 0;
}
}
vector<int> spot(t.size() + ... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i... | 1 | 55,781,794 |
#include<iostream>
using namespace std;
#define MAX 16
int a,b,n,x,y,cnt;
bool field[MAX][MAX];
void rec(int x,int y)
{
if(field[x][y]==false)return;
if(x==a-1&&y==b-1){
cnt++;
return;
}
if(x+1<a)rec(x+1,y);
if(y+1<b)rec(x,y+1);
return;
}
int main()
{
int i,j;
while(cin>>a>>b>>n,a|b){
for(i=... | #include <cstdio>
#include <cstring>
using namespace std;
#define MAX_L 16
int table[MAX_L + 1][MAX_L + 1];
bool wall[MAX_L + 1][MAX_L + 1];
int a, b, n;
int main(){
while(1){
scanf("%d%d", &a, &b);
if(a == 0 && b == 0) return 0;
scanf("%d", &n);
int in_x, in_y;
memset(wall, 0, sizeof(wall));
for(int i = 0... | 1 | 83,943,015 |
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<cmath>
#include<ctime>
#include<complex>
using namespace std;
#define ... | #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 a;
while (scanf("%d", &a), a) {
int coin[] = { 500,100,50,10,5,1 };
a = 1000 - a;
int cnt = 0;
rep(i, 6) {
while (a - coin[i] >= 0) {
a -= coin[i];
cnt++;
}
if (a == 0)bre... | 1 | 36,577,757 |
#include <algorithm>
#include <iostream>
using namespace std;
int ch(int n, int k) {
return n < k ? 0 : k == 0 ? 1 : ch(n - 1, k - 1) * n / k;
}
int power(int a, int k) {
return k == 0 ? 1 : power(a, k - 1) * a;
}
int main() {
string s; cin >> s;
int n = s.length();
int k; cin >> k;
int cnt = 0;
for (int i = 0; ... | #include "bits/stdc++.h"
#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++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
long long calc1(string N) {
return (long long)9 * (N.size() - 1) + ((l... | 1 | 18,840,688 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++){
cin>>a[i];
a[i]--;
}
set<int> st;
int ans=0;
int pos=0;
bool ok=1;
st.insert(pos);
while(true){
ans++;
if(a[po... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> visited;
visited.push_back(1);
int now = 1;
int output = 1;
while (1) {
n... | 1 | 55,995,841 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main()
{
string S1, S2;
cin >> S1 >> S2;
reverse(all(S1));
if (S1 == S2)
... | #include <bits/stdc++.h>
using namespace std;
string a, b;
int main () {
cin >> a >> b;
reverse (a.begin(), a.end());
if (a == b){
cout << "YES";
} else {
cout << "NO";
}
} | 1 | 51,645,219 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,y;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>x>>y;
if(abs(x-y)<=1)
cout<<"Brown"<<endl;
else
cout<<"Alice"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
#define INF 1007654321
#define PI 3.14159265358979
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repp(i, s, e) for(int i = (s); i <= (e); ++i)
#define sz(x) ((int)x.size())
#define all(x) x.... | 1 | 38,937,319 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
using ll = int64_t;
using namespace std;
int64_t n,m;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
using P = pai... | 1 | 63,454,744 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a,... | #include <bits/stdc++.h>
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin()
#define UB(a,x) ub(all(a),x)-a.begin()
#define mod 1000000007
#def... | 1 | 17,605,057 |
#include <iostream>
#include <string>
#include <queue>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
string s;
cin >> s;
if (s.size()>=4 &&
... | #include<iostream>
#include<complex>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
using namespace std;
typedef long long int llint;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
char s[110];
cin >> s;
if (strlen(s) < 4) {
cout << "No" << endl;
return 0;
}
if (s[0] == 'Y'&&s[1] ... | 1 | 51,404,232 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
using namespace std;
int main(void){
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++){
cin >> a[i];
}
map<ll, ll> b, c;
for (int i = 0; i < n; i++){
if (i % 2)... | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4]={1,0,-1,0};
int dx[4]={0,1,0,-1};
vector<vector<int>> graph;
bool sort_sec(const pair<int,int> &a,const pair<int,int> &b){
if(a.second<b.second){
return true;
}
return false;
}
void swap(int *a,int *b){
int temp=*a;
*a=*b... | 1 | 58,282,180 |
#include <bits/stdc++.h>
using namespace std;
int main (void) {
string s;
cin >> s;
int s_len = s.size();
deque<char> dq;
for ( int i = 0; i < s_len; i++ ) {
if ( s.at(i) != 'B' )
dq.push_back(s.at(i));
else if ( !dq.empty() )
dq.pop_back();
}
while ( ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 1 | 15,594,531 |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i=0; i<(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) {... | #include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
#define Cout(s) cout << s << endl
string Yes(bool b) {if(b){return "Yes";} else {return "No";}}
string YES(bool b) {if(b){return "YES"... | 1 | 54,437,491 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
int main(){
string L;
cin >> L;
int n =... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 1 | 51,513,121 |
#include <iostream>
#include <string>
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
using namespace std;
int k;
string s;
int main() {
cin >> k >> s;
int sl = s.length()... | #include<bits/stdc++.h>
using namespace std;
int main(){
int K;string S;cin>>K>>S;
int l=S.size();
string ans;
if(l<=K) ans=S;
else {
ans=S.substr(0,K);
ans = ans+"...";
}
cout<<ans<<endl;
} | 1 | 29,340,309 |
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a,... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A;
int main() {
scanf("%d", &N);
A.resize(N);
for(int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
int mn = 2;
ll ans = (A[0] - 1);
for(int i = 1; i < N; i++) {
if(A[i] == mn) {
mn... | 1 | 37,536,614 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=1e9+7;
int main() {
int x,t;
cin>>x>>t;
cout<<max(x-t,0)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll a,b;
cin>>a>>b;
if(a-b>0){
cout<<a-b<<endl;
}else{
cout<<"0"<<endl;
}
return 0;
} | 1 | 86,267,663 |
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
ll h,w,n;
cin... | #include <iostream>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef unordered_set<ll> pset;
ll pii(int y, int x) {
return ll(y-1) * 1000000000LL + ll(x-1);
}
int neighbor_search(const pset& bs, int y, int x) {
int r = 0;
for(int i=y-1; i<=y+1; i++) for(int j=x-1; j<=x+1; j++) {
... | 1 | 52,864,667 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
const int MAXN = 100005;
const int mod = 998244353;
bool query(lint x){
printf("? %lld\n", x);
fflush(stdout);
char str[10]; cin >> str;
return *str == 'Y';
}
int main(){
if(query(1e10)){
lint cur = 9;
for(int i=1; ; i++){
if(query(cur) =... | #include <stdio.h>
#include <iostream>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <time.h>
using namespace std;
long double esp=1e-11;
#d... | 1 | 80,704,795 |
#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>... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#inclu... | 1 | 61,636,730 |
#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 main()
{
int a,b,c;
cin >> a >> b >> c;
set<int> s;
s.insert(a);
s.insert(b);
s.insert(c);
cout << s.size() << endl;
return 0;
} | #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 long>::max();
template<class T> inline bool chmax(... | 1 | 64,956,596 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 100001
int A[MAX];
vector<int> v[MAX];
void dfs(int root, int parent) {
if(v[root].size() == 1) return;
ll mx = -1, sum = -A[root];
for(int vv : v[root]) {
if(vv != parent) {
dfs(vv, root);
sum +=... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_set>
#include <complex>
#include <valarray>
#include <cmath>
#include <functional>
#include <iomanip>
#in... | 1 | 57,767,238 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int64_t n;
cin >> s >> n;
int64_t k=s.size(),cnt=0;
if(s==string(k,s[0]))cout << n*k/2 << endl;
else{
for(int64_t i=0;i<k;i++){
if(s[i]==s[i+1] && s[i+1]==s[i+2]){
cnt++;
i++;
}else if(s[i]==s[i+... | #include<bits/stdc++.h>
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define ff first
#define ss second
#defin... | 1 | 57,051,148 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main(){
string s;cin>>s;
int result=0;
int l=0, r = s.size()-1;
while(r>l){
if(s[l]==s[r]){
l++;
r--;
continue;
}
if(s[l]!=s[r]){
if(s[l]=='x'){
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;
string s;
int main(){
cin >> s;
string left = s, right = s;
reverse(right.begin(), right.end());
int res = 0;
for(int i = 0; i < (left.size() + 1) / 2; i++){
char r = right.at(i), l ... | 1 | 55,637,111 |
#include<bits/stdc++.h>
using namespace std;
vector<int>g[200010];
int ans[100010];
bool vis[100010];
void bfs(int rt)
{
vis[rt]=1;
queue<int>q;
q.push(rt);
while(!q.empty())
{
int adj=q.front(); q.pop();
for(auto x: g[adj])
{
if(vis[x]==0)
{
... | #include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define F first
#define S second
#define db double
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
using namespace std;
ll mod=1e9 +7;
ll expo(ll base,ll exponent,ll mod){
ll ans=1;
while(exponent!=... | 1 | 32,650,435 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define dl double long
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rrep(i, m, n) for(ll i = (ll)(m); i > (ll)(n); --i)
const ll MOD = 1000000007;
const double pi = 3.14159265358979323846;
int n;
void countingsort(int a[], int b[], ... | #include <iostream>
#include <algorithm>
#include <vector>
#define MAXV 10000
using namespace std;
int main() {
int n;
cin >> n;
vector<int> cnt(MAXV, 0);
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
cnt[temp]++;
}
int count = 0;
for (int i = 0; i < cnt.size()... | 1 | 80,400,430 |
#include <iostream>
#include <cstdio>
using namespace std;
long long a, b, k, c;
int main() {
cin >> a >> b >> k;
for(int i=0; i<k; i++) {
if(i%2==0) {
if(a&1) a--;
c = a/2;
a -= c;
b += c;
} else {
if(b&1) b--;
c = b/2;
b -= c;
a += c;
}
}
cout << a << ' ' << b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
LL A, B;
void recursive(int k, bool b){
if(k == 0) return;
if(b){
if(A & 1) A--;
A >>= 1, B += A;
}else{
if(B & 1) B--;
B >>= 1, A += B;
}
recursive(k - 1, !b);
}
int main(){
int K;
scanf("%ll... | 1 | 25,003,875 |
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
string s;
vector<int> v;
ll calc(ll x, ll y) {
if(x < y) swap(x,y);
return x*(x+1)/2 + y*(y-1)/2;
}
int main() {
cin>>s;
int N = s.size();
int cnt = 0;
if(s[0] != '<') {
v.pb(0);
}
for(int i=0;i<N;++i) {
++cn... | #include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
vector <int> vec;
long long calc(){
long long res = 0;
for(int i = 0; i < vec.size(); i++){
res += vec[i];
}
return res;
}
void solution(string s){
for(int i = 0; i < s.size(); i++){
if(s[i] == '<')
vec[i+1]... | 1 | 91,220,221 |
#include<iostream>
using namespace std;
#define MAX 100005
#define HN -1
struct Node{
int p,l,r;
};
Node Ta[MAX];
int num,Da[MAX];
void express(int d){
int i,o;
cout << "node "<< d <<": ";
cout << "parent = "<< Ta[d].p << ", ";
cout << "depth = "<<Da[d] <<", ";
if(Ta[d].p == HN){
cout << "root, ";
}
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i)=0; (i)<(n); i++)
#define pb push_back
using veci = vector<int>;
using ll = long long;
using G = vector<vector<int>>;
struct Node{
int id;
int parent;
int depth;
veci children;
void addChild(int num){
children.pb(num);... | 1 | 75,662,985 |
#include <bits/stdc++.h>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, B, X;
cin >> A >> B >> X;
int total = A *... | #include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
#define PI 3.14159265
int main(){
double a, b, x; cin >> a >> b >> x;
double s = a * a * b;
cout << fixed << setprecision(6);
if (x <= s / 2) cout << 90 - atan(x / (a * b * b) * 2) * 180.0 / PI << '\n';
else cout << atan((s - x)/(a * a *... | 1 | 35,801,076 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N+1],B[N+1],answer=0;
A[0] = 0;
B[0] = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
B[i] = B[i-1]^A[i];
A[i] += A[i-1];
}
for (int r = 1, l = 1; r <= N; r++) {
while (A[r]-A[l-1] != (B[r]^B[l-1]) &&... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | 1 | 4,322,987 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c; cin >> a >> b >> c;
if (a + b >= c){
puts("Yes");
}else {
puts("No");
}
} | #include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | 1 | 1,047,693 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include <cctype>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
int main(){
vector<char> s(19);
rep(i,19){
cin >> s[i];
if(s[i]==',') s[i]=' ';
}
rep(i,19) cout << s[i];
... | #include <stdio.h>
int main (){
char str [20];
scanf ("%s", str);
for (int i = 0; i < 19; i++) {
if (i == 5 || i == 13) {
printf(" ");
continue;
}
printf("%c", str[i]);
}
puts("");
return 0;
} | 1 | 54,999,116 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int x;
cin >> x;
int hundred = x / 100;
int have = hundred * 5;
int need = x - hundred * 100;
if(have >= need) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} | 1 | 67,806,567 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <utility>
#include <deque>
#include <stack>
#include <bitset>
using namespace std;
typedef long ... | #include<cstdio>
#include<algorithm>
#include<vector>
#define N_ 101000
using namespace std;
int n, C[N_];
vector<int>E[N_];
struct point {
long long x;
int num;
bool operator<(const point &p)const {
return x != p.x ? x < p.x : num < p.num;
}
}w[N_];
long long sum;
void DFS(int a, int d) {
sum += d;
for (auto &... | 1 | 77,549,276 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int A;
cin >> A;
int G = A, M = A;
for (int i = 1; i < N; i++) {
int a;
cin >> a;
G = __gcd(a, G);
M = max(a, M);
}
if (K <= M && K % G == 0) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << end... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++){
cin >> A[i];
}
int g = 0;
int mx = 0;
for (int i = 0; i < N; i++){
g = __gcd(g, A[i]);
mx = max(mx, A[i]);
}
if (K > mx || K % g != 0){
cout << "IMPOSSIBL... | 1 | 10,122,237 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#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(n) begin(n),end(n)
#define IN(a, x, b) (a<=x && x<b... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define fore(i,x,n) for(int i=x;i<n;i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define ordenar(a) sort(all(a))
typedef long long ll;
typedef vector<int> vi;
int n, h, pre = 0, co... | 1 | 83,161,469 |
#include <iostream>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cfloat>
#include <algorithm>
#include <numeric>
#include <vector>
#include <iterator>
#include <set>
#include <map>
using namespace std;
const double PI=acos(-1);
int main(){
long n;
string s, t;
cin >> n >> s >> t;
long... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
int N;
string s,t;
cin >> N >> s >> t;
int ans;
rep(i,N+1) {
... | 1 | 72,637,456 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, t, r;
cin >> x >> t;
r = x - t;
if (r < 0) {
cout << 0 << '\n';
} else {
cout << r << '\n';
}
} | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;
int main() {
ll x,t;cin >>x>>t;
ll ans=max(x-t,0LL);
cout<<ans <<e... | 1 | 46,974,328 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <stack>
#include <queue>
#include <math.h>
using namespace std;
int main(void){
string s1,s2;
cin>>s1>>s2;
int dp[1010][1010];
for(int i=0;i<=s1.size();i++){
dp[0][i]=i;
}
for(int i=0;i<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(string& s1, string& s2){
vector<vector<ll> > dp(s1.length()+1, vector<ll>(s2.length()+1,INT_MAX));
dp[0][0] = 0;
for (ll i = 0; i < s1.length(); i++)
{
dp[i+1][0] = i+1;
}
for (ll i = 0; i < s2.length(); i++)... | 1 | 9,697,591 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
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
#define mt make_tuple
#define... | #include <bits/stdc++.h>
using namespace std;
int main()
{int A, B, C, D; cin >> A >> B >> C >> D;
cout << max(0, min(B, D) - max(A, C));} | 1 | 17,338,529 |
#include <iostream>
#include <sstream>
#include <string>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <iomanip>
using name... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#defi... | 1 | 54,580,343 |
#include <iostream>
#include <cstring>
#include <cctype>
using namespace std;
int McxiTen (char *c) {
int i = 0;
int n = 0;
while(i < strlen(c)) {
int tmp = 1;
if(isdigit(c[i])) {
tmp = c[i] - '0';
i++;
} else {
}
switch(c[i]) {
case 'i' : n += tmp; break;
case 'x' : n += tmp * 10; break;
c... | #include <iostream>
#include <string>
using namespace std;
void solve()
{
int n;
cin >> n;
while(n--)
{
string s1, s2;
cin >> s1 >> s2;
int num1 = 0, num2 = 0;
if(s1.size() == 1)
{
if(s1[0] == 'm')
{
num1 = 1000;
}
else if(s1[0] == 'c')
{
num1 = 100;
}
else if(s1[0] == 'x')
... | 1 | 2,882,552 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
char x,a;
while(1){
scanf("%c",&x);
if(islower(x)){
a = toupper(x);
cout << a;
}else if(isupper(x)){
a = tolower(x);
cout << a;
}else{
cout << x;
}
if(x == '\n'){
break;
}
}
return 0;
} | #include <cstdio>
#include <cctype>
int main() {
char ch;
while (1) {
scanf("%c", &ch);
if (isalpha(ch)) {
if (isupper(ch)) {
printf("%c", tolower(ch));
} else {
printf("%c", toupper(ch));
}
} else {
printf("... | 1 | 91,028,822 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(), v.end());
if(v[0] == v[1]) {
cout << v[2] << "\n";
} else {
cout << v[0] << "\n";
}
} | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
int arr[3];
int main(){
for(int i=0;i<3;i++){cin>>arr[i];}
sort(arr,arr+3);
if(arr[0]!=arr[1]) cout<<arr[0];
else cout<<arr[2];
return 0;
} | 1 | 68,881,381 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c)... | #ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <qu... | 1 | 39,280,540 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
string str;
bool flag=false;
cin >> str;
sort(str.begin(),str.end());
if(str.at(0)==str.at(1)){
if(str.at(2)==str.at(3)){
if(str.at(1)!=str.at(2)){
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define int long long
signed main() {
string s;
cin >> s;
bool flag = false;
if(s[0] == s[1] && s[2] == s[3]) flag = true;
if(s[0] == s[2] && s[1] == s[3]) flag = true;
if(s[0] == s[3] && s[1] == s[2]) flag = ... | 1 | 20,368,251 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S, T;
int cnt = 0;
cin >> S >> T;
for (int i = 0; i < S.size(); i++){
if (S[i] == T[i]) cnt++;
}
if (T[S.size()] >= 'a' && T[S.size()] <= 'z') cnt++;
if (cnt == T.size()) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s,t;
cin >> s >> t;
t.pop_back();
if (s==t)cout << "Yes" << endl;
else cout << "No" <<endl;
return 0;
} | 1 | 99,500,733 |
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define Debug(x) cout << #x " = " << (x) << endl
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(... | #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 ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
signed main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int ... | 1 | 82,753,597 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,i,cnt=0;
cin>>n>>k;
int a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
if(a[i]>=k)
{
cnt++;
}
}
cout<<cnt<<endl;
} | 1 | 32,372,688 |
#include<iostream>
#include<string>
#include<cctype>
using namespace std;
string Shf(string s, int n){
string t = s.substr(0,n);
s.erase(0,n);
s += t;
return s;
}
int main(){
string s;
int m,n;
while(1){
cin >> s;
if (s == "-") break;
cin >> m;
for(int i = 0;i... | #include<iostream>
#include <cstdio>
#include<cctype>
#include <algorithm>
#include<string>
using namespace std;
int main(){
string card,ans;
int m,h,total_h,act_h;
while(1){
cin >> card;
if(card == "-") break;
cin >> m;
total_h = 0;
for(int i = 0; i < m; i++){
cin >> h;
total_h += h;
}
int n = c... | 1 | 78,673,488 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string c;
cin >> c;
if(c.at(0) == 'a' || c.at(0) == 'i' || c.at(0) == 'u' || c.at(0) == 'e' || c.at(0) == 'o'){
cout << "vowel" << endl;
}
else{
cout << "consonant" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
const int MOD = 1e9 + 7;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(o... | 1 | 15,888,147 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define pii pair<int,int>
#define all(a) a.begin(),a.end()
const ll mod=1e9+7,di=998244353,N=3e5+1;
bool IsQuery=false;
ll q=1,a[N];
map<int,vector<int>> edge;
map<int,bool> occ;
int dx[] = {1, -1... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define vl vector<ll>
#define pl pair<ll,ll>
#define vpl vector<pl>
#define vvl vector<vl>
using namespace std;
const ll N = 1e5 +5;
vl t;
ll frog(vl& v,ll n,ll k)
{
ll cst;
t [0] = 0;
for(ll i = 1;i <= n;i++)
{
ll m... | 1 | 32,700,506 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define mod 1000000007
#define maxN 200015
int n, m, cnt;
vector<int> visited(maxN, 0);
vector<int> adj[maxN];
void dfs(int s) {
visited[s] = 1;
cnt++;
for (auto i : adj[s]) {
if (visited[i] == 0) {
dfs(i);
}
}
}
int mai... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define set_bits(a) __builtin_popcount(a)
#define pb push_back
#define pf push_front
#define mod 1000000007
#define M 998244353
#define mp unordered_map
#define fi first
#define se second
#define endl '\n'
#define I... | 1 | 44,072,995 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a,b,c,k;
cin>>a>>b>>c>>k;
long long t=0;
long long m=0;
if(k%2==0){
t=k*a+(k-1)*(b+c);
m=k*b+(k-1)*(a+c);
}
else{
t=(k-1)*a+k*(b+c);
m=(k-1)*b+k*(a+c);
}
if(abs(t-m)>1000000000000000000){
cout<<"Unfair"<< endl;
... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define FOR(i,a,b) for ... | 1 | 44,060,519 |
#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++){
if (i == 0 || i == H -1){
for (int j = 0; j < W; j++){
cout << "#";
}
... | #include <iostream>
using namespace std;
int main(){
int H, W;
int i = 1;
while (1){
cin >> H >> W;
if (H == 0 && W == 0)break;
if (i)i = 0;
else cout << endl;
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
if (i >0 && i <H-1){
if (j>0 && j<W-1)
cout << '.';
else cout << '#... | 1 | 8,752,488 |
#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 <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
string s, res; cin >> s;
ll cl{0}, c... | 1 | 80,370,926 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int h,w;
string data;
cin>>h>>w;
while(getline(cin,data)){
cout<<data<<endl;
cout<<data<<endl;
}
} | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
using namespace std;
int main() {
int H, W;
string *C;
cin >> H >> W;
C = new string[H];
for (int i = 0; i < H; i++) {
cin >> C[i];
}
for (int i = 0... | 1 | 97,081,703 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <list>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>
#include <bitset>
using namespace std;
typedef long lon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int v, e;
vector<int> g[10000];
bool visited[10000];
vector<int> ans;
void dfs(int now)
{
if (visited[now]) return;
visited[now] = true;
for (auto &nxt: g[now]) {
... | 1 | 46,707,731 |
#include<bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
const ll N = 100005;
ll n, d[N], cnt[N], rd[N];
map<ll,ll> dti, itd;
vector<ll> adj[N];
vector<pll> ans;
void dfs1 (ll I) {
for(auto &T : adj[I]) {
dfs1(T);
rd[I] += rd[T] + cnt[T];
}
}
voi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define VEC(TYPE, A, NAME, INIT) vector<TYPE> NAME(A, INIT)
#def... | 1 | 3,374,114 |
#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;
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; }
r... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define rev(v) reverse(v.begin(), v.end());
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned l... | 1 | 77,770,033 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using pii = pair<int, int>;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n) {
for (int i = 0; i < n; i++) par[i] = i;
}
int root(int x) {
return par[x] == x ? x : par[x] = root(par[x]);
}
bool same(int ... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define INF LLONG_MAX
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp... | 1 | 69,163,989 |
#include<iostream>
using namespace std;
int main(){
int n, x, i, j, k, cnt;
cin>>n>>x;
while(n!=0 || x!=0){
cnt=0;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
for(k=1;k<=n;k++){
if(i!=j && j!=k && i!=k){
if(i+j+k==x){
cnt++;
}
}
}
}
}
cnt /= 6;
cout << cnt << endl;
ci... | #include <iostream>
using namespace std;
int main(void) {
int N, X, cnt;
while(true) {
cin >> N >> X;
if(N == 0 && X == 0) break;
cnt = 0;
for(int i=1; i <= N; i++)
for(int j=i+1; j <= N; j++)
for(int k=j+1; k <= N; k++)
if((i + j +... | 1 | 83,275,862 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, X, Y;
cin >> N >> K >> X >> Y;
int sum;
if (N<=K) {
sum = X*N;
}
else{
sum = X*K + Y*(N-K);
}
cout << sum <<endl;
} | #include<iostream>
using namespace std;
int main(){
int N , K , X , Y;
cin >> N>>K>>X>>Y;
if( X>Y && X<=10000 && N>=K){
X*=K;
Y=Y*(N-K);
cout<<X+Y<<endl;
}
else if(K>N && X>Y &&( X <=10000)){
K=N;
X*=K;
Y=Y*(N-K);
cout<<X+Y<<endl;
}
} | 1 | 94,557,675 |
#include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> ostream& operator<<(os... | #include<bits/stdc++.h>
#define ll long long
ll mod = 1e9+7;
using namespace std;
int main(){
int H,W ;
cin>>H>>W;
char arr[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin>>arr[i][j];
}
}
ll dp[H][W];
memset(dp, 0, sizeof(dp));
dp[H-1][W-1]=1;
for(int i=W-2;i>=0;i--) {
if(arr[H-1][i]=='.'){
... | 1 | 99,321,509 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
int result = 4000000;
for (int i = -100; i <= 100; i++) {
int adder = 0;
for (int j = 0; j < N; j++) {
int tmp = (a.at(j) - i) * (a.at(j) - i);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 1e9;
for (int i = -100; i < 101; i++) {
int calc = 0;
for (int j : v) {
calc += pow(j - i, 2);
}
... | 1 | 32,871,721 |
#include<iostream>
using namespace std;
int main(){
int n,b,f,r,v,a[4][3][14]={0};
cin>>n;
for(int i=0;i<n;i++){
cin>>b>>f>>r>>v;
a[b-1][f-1][r-1]=a[b-1][f-1][r-1]+v;
}
for(int k=0;k<4;k++){
for(int j=0;j<3;j++){
for(int s=0;s<10;s++){
cout<<" "<<a[k][j][s];
}
cout<<endl;
}
if(k==0||k==1||k==... | #include <iostream>
using namespace std;
int main() {
int n;
int b, f, r, v;
int room[4][3][10];
for (int j = 0; j < 4; j++){
for (int k = 0; k < 3; k++){
for (int l = 0; l < 10; l++){
room[j][k][l] = 0;
}
}
}
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> b >> f >> r >> v;
room[b-1][f-1][r-1]... | 1 | 43,394,758 |
#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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using nam... | 1 | 29,642,582 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll a,b,k;
cin >> a >> b >> k;
if(a>=k){
a-=k;
cout << a << " " << b << endl;
}
else {
k-=a;
a=0;
b-=k;
if(b<0)b=0;
cout << a << " " << b << endl;
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
ll a,b,k;
cin >> a >> b >> k;
if(a >= k){
cout << a-k << " " << b << endl;
return 0;
}
else if((... | 1 | 98,125,763 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
ll GCD(ll a,ll b){
if(b==... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
ll gcd(ll a, ll b){
if(b==0)
retur... | 1 | 81,691,639 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | #include <stdio.h>
int main()
{
char character;
do
{
scanf("%c", &character);
} while (character == 122);
printf("%c", character + 1);
return 0;
} | 1 | 83,773,302 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
int a[100005];
P A[100005];
int main() {
int n;
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
sort(a,a+n);
if(a[n-1] < 0) {
for(int i = 0; i < n - 1; i++) {
A[i] = P(a[n... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | 1 | 57,409,016 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int long long
signed main() {
int n;
cin >> n;
int x = n;
int answer = 0;
for (int d = 2; d * d <= n; d++) {
int cnt = 0;
while(x % d == 0) {
cnt++;
x /= d;
}
int sub = 1;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool prime(ll n){
bool x = true;
for(ll k=2;k*k<=n;k++)
if(n%k==0) x = false;
if(n==1) x = false;
return x;
}
int main(){
ll N,i,ans;
ans = 0;
cin >> N;
for(i=2;i*i<=N;i++)
if(N%i==0 && prime(i)){
ll count = 0;
ll a =... | 1 | 63,459,270 |
#include<iostream>
#include<vector>
#include<map>
using namespace std;
int main(){
int N,M;cin>>N>>M;
vector<long long>A(N);
for(int i=0;i<N;i++)cin>>A[i];
map<long long,long long>nums;
long long sum=0;
nums[sum]++;
for(int i=0;i<N;i++){
sum+=A[i];
nums[sum%M]++;
}
lo... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ld long double
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rrep(i, a, b) for(ll i = a; i >= b; --i)
#define pii pair<i... | 1 | 55,542,027 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include<cstdio>
using namespace std;
int main(){
int a,b,c,d;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
int ans = 0;
if (a > b) ans += b;
else ans += a;
if (c > d) ans += d;
else ans += c;
printf("%d\n", ans);
} | 1 | 36,669,579 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P=pair<int,int>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
int ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T>
void cout_vec(const vector<T> &vec){
for(auto itr:ve... | 1 | 6,429,019 |
#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#incl... | #include <iostream>
using namespace std;
#include <stdio.h>
#include <string>
int main(void)
{
string word_T;
string word_H;
int n;
int point_T=0;
int point_H=0;
cin >> n;
for (int i=0; i< n; i++ ){
cin >> word_T >> word_H ;
if( word_T > word_H ){
point_T =point_T + 3 ;
} else if... | 1 | 94,282,498 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
vector <ll> primes;
ll divi[1000005];
vector <ll> fact;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i,j,k,l,m,n,t;
cin >> n;
if(n == 1)
{
cout << 0 << '\n';
return 0;
}
for(i=2;i<1000005;i++)
{
for(j=i+i;j<1000005... | #include <iostream>
#include <vector>
#include <cstdint>
using namespace std;
int main() {
int64_t n; cin >> n;
vector<int> pf;
for (int64_t i = 2; i * i <= n; ++i) {
if (n % i) continue;
int cnt = 0;
while (n % i == 0) {
++cnt;
n /= i;
}
pf.pu... | 1 | 98,081,646 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<cstring>
#include<set>
#include<queue>
#include<map>
#include<math.h>
#define FASTREAD ios_base::sync_with_stdio(0);cin.tie(nullptr);
#define ll long long
#define dd double
#define scl(n) scanf("%lld",&n)
#define scd(n) ... | #include <iostream>
#include <vector>
#include <cmath>
#define inf 999999999
using namespace std;
int num;
int main()
{
int a,b;
int temp;
vector<int> cost(1e5+1);
vector<int> dp(1e5+1);
while(cin>>a>>b){
fill(cost.begin(),cost.end(),0);
fill(dp.begin(),dp.end(),inf);
for(int... | 1 | 37,161,738 |
#pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn=2e5+10;
int a[8005];
int dp[8005][8005];
int sum[8005];
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a>b){
swap(a,b);
}
if(a>c){
swap(a,c);
}
if(b>c){
swap(b,c);
}
int x=(c-b);
i... | 1 | 95,724,138 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+10;
int main()
{
int n,m;
cin>>n>>m;
if(n%2){
for(int i=1;i<=m;i++){
cout<<i<<" "<<n-i<<endl;
}
}
else{
int r=n;
for(int i=1;i<=m;i++){
if(i==n/4+1)... | #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... | 1 | 99,696,077 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<map>
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vec... | 1 | 8,272,407 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int N;
cin >> N;
if(N<1200) cout<<"ABC"<<endl;
else cout<<"ARC"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
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... | 1 | 88,369,692 |
#include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if(a>b){
int tmp = a;
a = b;
b = tmp;
}
if(b>c){
int tmp = b;
b = c;
c = tmp;
}
if(a>b){
int tmp = a;
a = b;
b = tmp;
}
cout << a << ' ' << b << ' ' << c << '\n';
return 0;
} | #include <iostream>
int main(){
int data[3];
int tmp;
std::cin >> data[0] >> data[1] >> data[2];
for (int i = 0; i < 3; i++){
for (int j = 2; j > 0 + i; j--){
if (data[j] < data[j - 1]){
tmp = data[j];
data[j] = data[j - 1];
data[j - 1] = tmp;
}
}
}
std::cout << data[0] << " " << data[1] << ... | 1 | 68,742,075 |
#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... | #include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
ty... | 1 | 56,581,038 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")... | 1 | 10,125,175 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int k =n*n;
cout<<k<<endl;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | 1 | 26,346,913 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, count = 0;
cin >> N >> K;
for (int i=0; i<N-K+1; i++)
count++;
cout << count << endl;
} | 1 | 82,554,042 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pii;
typedef vector<pii> vpii;
int main() {
ll N;
cin >> N;
vi X(N), Y(N);
for (ll i = 0; i < N; i++) cin >> X[i] >> Y[i];
for (ll i = 0; i < N - 1; i++) {
if ((X[i] + Y[i] + X[i + 1] + Y[i + 1]... | #include<bits/stdc++.h>
#include<bits/extc++.h>
#define file(s) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define go(x, i) for(register int i = head[x]; i; i = nxt[i])
#define For(i, a, b) for(register int i = (a), i##_end_ = (b); i <= i##_end_; ++ i)
#define FOR(i, a, b) for(register int i = (a), i##_... | 1 | 64,540,023 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, do... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | 1 | 80,526,189 |
#include<stdio.h>
int main(void){
int A,B,C;
scanf("%d%d%d",&A,&B,&C);
if(A==B && B==C){
printf("Yes");
}
else{
printf("No");
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int A,B,C;
cin >> A >> B >> C;
if(A == B && B== C){
std::cout << "Yes" << std::endl;
}
else{
std::cout << "No" << std::endl;
}
return 0;
} | 1 | 22,966,126 |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | 1 | 42,732,532 |
#include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
string s;
string p;
cin>>s;
cin>>p;
s+=s;
int loc=s.find(p,0);
if(loc!=string::npos)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
re... | #include <iostream>
#include <string>
int main(int argc, char** argv)
{
std::string s;
std::getline(std::cin, s);
std::string p;
std::getline(std::cin, p);
for (int si = 0; si < (int)s.size(); ++si)
{
if (s[si] == p[0])
{
bool match = true;
for (int pi = 0; pi < (int)p.size() && match; ++pi)
{
ma... | 1 | 25,165,667 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(c) c.begin(), c.end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define DB(a) cerr << #a << " = " << (a) << endl;
#define OUT( a , n ) for( int J = 0; J < (n); J++ )cout<< (a)[J] << " \n"[J == (n) - 1 ]
#define WAIT cout << flush ... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
char s[10];
void query(ll x)
{
printf("? %lld\n",x);
fflush(stdout);
scanf("%s",s);
}
int main()
{
int x=1000000000;
query(x);
if(s[0]=='Y')
{
for(int... | 1 | 35,302,882 |
#include<bits/stdc++.h>
using namespace std;
long long max_(long long a,long long b)
{
if(b>a)
return b;
else
return a;
}
int main()
{
long long a,b,c,d;
cin>>a>>b>>c>>d;
long long a1=a*c,a2=a*d,a3=b*c,a4=b*d;
long long ans=max_(a1,max_(a2,max_(a3,a4)));
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i,n) for(int i=0;i<(int)(n);i++)
#define foi(i,k,n) for(int i=(k); i<(int)(n); i+=1)
#define fod(i,n,k) for(int i=k; i>=(int)n; i-=1)
#d... | 1 | 35,580,406 |
#pragma GCC optimize(3)
#pragma comment(linker,"/stack:16777216")
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<list>
#include<stack>
#include<queue>
#include<deque>
#include<functional>
#include<utility>
#include<algorithm>
#include<sstream>
#include<cstring... | #include<stdio.h>
#include<algorithm>
#include<vector>
#define fst first
#define snd second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int MN = 1e5 + 1;
int N, M, V, P;
int A[MN], B[MN];
bool check(int p) {
for(int i = 0; i < N; i++) B[i] = A[i];
ll total_points = (ll)M * V;
... | 1 | 91,575,294 |
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
int main(){
int n;
cin >> n;
map<int, int> m;
m[n]++;
int count=1;
while(1){
if(n&1){
n = (3*n)+1;
}
else{
n = n/2;
}
m[n]++;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int s;
cin >> s;
int m = 0;
vector<int> a;
a.push_back(s);
for (int i=1 ; ; i++){
if (a.at(a.size()-1)%2 == 0)
a.push_back(a.at(a.size()-1)/2);
else
a.push_back(3*a.at(a.size()-1) + 1);
for (int j=0 ; j<a.size()-1 ; j++){
... | 1 | 20,430,140 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
ll MOD = 1000000007;
int N, M;
cin >> N >> M;
vector<ll> s(N);
vector<ll> t(M);
for (int i = 0; i < N; i++)
cin >> s[i];
for (int i = 0; i < M; i++)
cin >> t[i];
vector<vector<ll>> dp(N+1,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
int main() {
int n, m;
cin >> n >> m;
ll s[n], t[m];
rep(i, n) { cin >> s[i]; }
rep(j, m) { cin >> t[j]; }
ll dp[n + 1][m ... | 1 | 72,436,996 |
#include <iostream>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
typedef pair<int,int> pint;
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};
string mp[1000];
int visit[1000][1000];
int main(){
int h,w,n,cx,cy,ans=0;
cin>>h>>w>>n;
for(int i=0;i<h;++i){
cin>>mp[i];
... | #include <iostream>
#include <stdio.h>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <string.h>
#include <set>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;
struct node
{
int x;
int y;
int dist;
node(int x , int y , int dist)
{
this -> x = x;
this ->... | 1 | 60,617,469 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,A,B; cin>>N>>A>>B;
if((N==1&&A!=B)||A>B){cout<<0<<endl; return 0;}
if(N==1){cout<<1<<endl; return 0;}
cout<<B*(N-1)+A-A*(N-1)-B+1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
ll n, a, b;
cin >> n >> a >> b;
if (a > b) {
cout << 0 << endl;
return 0;
}
if (a != b && n == 1) {
cout << 0 << endl;
return 0;
}
ll min = b + a * (n - 1);
ll max = a + b * (n - 1);
ll ans = max - min + 1;
... | 1 | 10,456,970 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.