code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
#include<functional>
#include<deque>
#include<list>
using namespace std;
typedef long long ll;
typedef pair<int,int... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | 0 | 13,942,791 |
#include <iostream>
using namespace std;
int main() {
int n, k; cin >> n >> k;
if (n == k) { cout << "0\n"; return 0; }
int h[n]; for (int i = 0; i < n; i++) cin >> h[i];
long long dp[n+1][n+1];
const long long INF = 1LL<<60;
long long ans = INF;
dp[0][0] = 0;
for (int i = 1; i <= n; i++... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
int main(){
ll n,k;
ll v[56];
int i;
ll sum = 0;
int p = 0;
int m = 0;
scanf("%lld %lld", &n, &k);
for(i = 0;i < n;i++){
scanf("%lld", &v[i]);
}
ll limit = min(n,k);
ll a,b;
vecto... | 0 | 99,760,626 |
#include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) reverse((a).begin(),(a).end())
#define REP(i, n) for(int i = 0; i < n; i++)
const int MOD = 1e9+7;
typedef long long ll;
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
template<class T> inline... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x;
cin >> n >> m >> x;
vector<vector<int>> v(n, vector<int>(m+1));
for(int i=0; i<n; i++) for(int j=0; j<m+1; j++) cin >> v[i][j];
int ans = 10000000;
vector<int> data(m, 0);
for(int bit=0; bit<(1<<n); bit++) {
int sum = 0;
for(i... | 0 | 9,021,068 |
#include <bits/stdc++.h>
using namespace std;
#define R (long long)(1e9 + 7)
#define INF (long long)(1e16L + 5)
#define ll long long
#define grid vector<vector<ll>>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
int main(){
int a,b;
string s;
cin >> a >> b >> s;
bool f = true;
if (s[a] == '-') f = true;
else f = false;... | 0 | 26,288,241 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n, m;
cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
for(int i=0; i < n; i++){
cin >> a.at(i);
}
for(int i=0; i < m; i++){
cin >> b.at(i);
}
re... | #include "bits/stdc++.h"
using namespace std;
int main(){
string s;
getline(cin,s);
int i;
for(i=0;i<s.length();i++){
if(s.at(i)>='a'&&s.at(i)<='z'){
cout << char(s.at(i)+'A'-'a');
}
else if(s.at(i)>='A' &&s.at(i)<='Z'){
cout << char(s.at(i)+'a'-'A');
... | 0 | 42,741,759 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin>>n;
vector<int>a(n);
vector<int>ans(n);
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
ans[a[i]-1]=i+1;
}
for(int i=0;i<n;i++)cout<<ans[i]<<" ";
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int n;
int count=0;
cin>>n;
char ar[100000];
for(int i=0; i<n; i++)
{
cin>>ar[i];
}
for(int i=0; i<n; i++)
{
if(ar[i]==ar[i+1])
{
continue;
}
count++;
}
cout<<count;
} | 0 | 20,429,199 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
string s;
cin >> s;
rep(i, 3) {
if (s[i] == '1')
cout << 9;
else if (s[i] == '9')
cout << 1;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n)... | 0 | 2,180,441 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define maxn 200005
LL s[maxn],ans;
map<int,int>mp;
int main(){
int n,x,k;scanf("%d%d",&n,&k);
mp[0]++;
for(int i=1;i<=n;i++){
scanf("%d",&x),s[i]=s[i-1]+x;
if(i>=k)mp[(s[i-k]-i+k)%k]--;
ans+=mp[(s[i]-i)%k]++;
}
printf("%lld",ans);
return 0;... | #include <stdio.h>
#include<stdlib.h>
#define MAX 2000000
#define VMAX 10000
using namespace std;
int main()
{
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = (unsigned short *)malloc(sizeof(unsigned short) * n + 1);
B = (unsigned short *)malloc(sizeof(unsigned short) *... | 0 | 67,050,659 |
#include "iostream"
#include "string"
#include <stack>
#include <queue>
#include <sstream>
#include <cstring>
using namespace std;
void A()
{
stack<int> stack;
string str;
while (cin >> str)
{
if (str == "+" || str == "-" || str == "*")
{
int b = stack.top();
stack.pop();
int a = stack.top();
stack.... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
i... | 0 | 85,820,418 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 0 | 28,629,511 |
#include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll inf = 1e18;
const int nax = 2e6 + 7;
const ll mod = 1e9 + 7;
int main()
{
int a , b , c;
cin >> a >> b >> c;
if(c >= a && c <= b){
cout... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
string s;
cin>>s;
int n=s.size();
if(s=="zyxwvutsrqponmlkjihgfedcba"){
cout<<-1<<endl;
... | 0 | 90,171,202 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string o, e;
cin >> o >> e;
string ans;
for(int i=0; i<e.size(); i++){
ans+=o.at(i);
ans+=e.at(i);
}
if(o.size()>e.size()){
ans+=o.at(o.size()-1);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | 0 | 75,149,115 |
#define _GLIBCXX_DEBUG
#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();
typedef long ... | #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)... | 0 | 31,706,824 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std;
#define rep(i,a,b) for(int i=... | 0 | 34,055,318 |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e11;
using Graph = vector<vector<int>>;
signed main(){
int N, X, M;
cin >> N >> X >> M;
vector<int> kou;
set<int> num;
kou.push_back(X);
num.insert(X);
int ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << e... | 0 | 97,190,444 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int tmp,i = 0,j,k = 0,f[11];
vector<int> ans;
while(cin>>tmp){
if(tmp == 0){
ans.push_back(f[i-1]);
f[i-1] = '\0';
i--;
k++;
}
else{
f[i] = tmp;
i++;
}
}
for(j = 0;j < k;j++){
cout<<ans[j]<<endl;
}
return 0;
} | #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 Graph = vector<vector<int>>;
int main(void) {
int n, k;
cin >> n >> k;
ll ans1 = 0;
ll ans2 = 0;
for(int i = 1; i <= n; ++i) {
if(i%k == 0) a... | 0 | 34,298,800 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k=1,m=0;
scanf("%d",&n);
while (k*k<n)
{
m=(n/k-k)*2+m+1;
if (n%k==0) m-=2;
k++;
}
printf("%d",m);
return 0;
} | #include <cstdio>
int main( void )
{
while ( true )
{
int h, w;
scanf( "%d %d", &h, &w );
if ( ( h == 0 ) && ( w == 0 ) ) break;
for ( int j = 0; j < w; j++ ) { printf("#"); }
printf("\n");
for ( int i = 1; i < ( h - 1 ); i++ )
{
printf(... | 0 | 30,841,492 |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
double answer,x1,x2,y1,y2,a,b;
cin >> x1 >> y1 >> x2 >> y2;
a = pow(x1 - x2, 2.0);
b = pow(y1 - y2, 2.0);
answer = sqrt(a + b);
printf("%lf\n",answer);
return 0;
} | #include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
typedef long long int lint;
using namespace std;
template <typename T>
struct cumulative_sum {
vector<T> data;
vector<long long int> sum;
cumulative_sum(const int n) {
data.assign(n, 0);
}
T& operator[](const int k) {
ret... | 0 | 8,717,574 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int K,N;
cin >> K >> N ;
vector<int>A(N);
vector<int>B(N);
int maxB;
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N-1; i++){
B[i] = A[i+1]-A[i];
}
B[N-1] = A[0]+K-A[N-1];
maxB = B[0];
for(int i=0; ... | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()... | 0 | 92,748,425 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a[3], minv;
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
for (int i = 0; i < 3; i++) {
for (int j = 2; j > i; j--) {
if (a[j - 1] > a[j]) {
swap(a[j - 1], a[j]);
}
}
}
for (int i = 0; i < 3; i++) {
cout << a[i];
if (i ... | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <math.h>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ull unsigned long long
#define ... | 0 | 72,411,667 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define _GLIBCXX_DEBUG
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_ele... | #include <bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
bool posible=false;
int data[x+1];
for(int i=0;i<=x;i++){
data[i]=(4*(x-i)+(i*2));
}
for(int i=0;i<x+1;i++){
if(data[i]==y)
posible=true;
}
if(posible){
cout<<"Yes";
}
else{
cout<<"No";
}
} | 0 | 7,389,806 |
#include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int> ;
using vi = vector<int> ;
using vvi = vector<vector<int>> ;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for(int i = s;i < (int)(n);i++)
typedef long long ll;
int main(){
ll n,m;
priority_queue <int> PQ;
pair <int,int> a[100006];
scanf("%lld %lld", &n ,&m);
int i;
for(i = 0;i < n;i++){
scanf("%d %d", &a[i].first, &a[i].second);
}
sort(a,a... | 0 | 6,287,396 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int size = s.size(), cnt = 0;
bool flg = true;
if (s.at(0) != 'A') flg = false;
for (int i=1; i<size; i++){
if (s.at(i) == 'C'){
cnt++;
if ((i < 2) || (i>=(size-1)) || (cnt!=1)){
... | #include <bits/stdc++.h>
#include <boost/foreach.hpp>
using namespace std;
#define pi 2*asin(1.0)
#define MAX 10000000
#define MOD 1000000007
#define _GLIBCXX_DEBUG
vector<long> fac(MAX);
vector<long> finv(MAX);
vector<long> inv(MAX);
vector<long> Primelist;
void Prinit(){
long PR=10000001;
vector<long> P(PR,0);
for(lo... | 0 | 78,247,731 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string a;
while(cin>>a){
if(a=="#") break;
int len=a.size();
int k=0,m=2;
for(int i=0;i<len;i++){
if(a[i]=='q'||a[i]=='w'||a[i]=='e'||a[i]=='r'||a[i]=='t'||a[i]=='a'||a[i]=='s'||a[i]=='d'||a[i]=='f'||a[i]=='g'||a[i]=='z'||a[i]=='x'||a[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | 0 | 244,192 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-... | 0 | 85,487,351 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
typedef long long lint;
template< typename T > void modMul(T& a, T b, T m) { a = (a*b)%m; }
template< typename T > void modAdd(T& a, T b, T m) { a = (a+b+m)%m; }
class Combination {
private:
const int MAX_NUM;
vector< lint > fa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 15,794,435 |
#include <stdio.h>
int main()
{
int A, P;
int slice = 0, pie = 0;
scanf("%d %d", &A, &P);
while (A>0){
slice += 3;
A--;
}
slice += P;
while (slice >= 2){
slice -= 2;
pie++;
}
printf("%d", pie);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223... | 0 | 49,569,712 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int,int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve()
{
}
int main()
{
... | 0 | 35,251,070 |
#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 <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i <... | #include <iostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdexcept>
#include <algorithm>
#include <set>
#include <map>
#include <stdlib.h>
#include <cctype>
#include <bitset>
using namespace std;
int ... | 0 | 39,899,671 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | #include <iostream>
#include <cstdlib>
#include <cmath>
#include <string>
#include <vector>
#include <ctype.h>
using namespace std;
int m,mmin,mmax,check;
int psa,sa;
vector<int> mem;
int main() {
while(1) {
sa = 0;
cin >> m >> mmin >> mmax;
if(m==0) break;
vector<int> mem(m,0);
... | 0 | 59,541,524 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int N, M; cin >> N >> M;
int a[N];
vector<vector<int>> G(N);
int v1,v2;
for (i... | #define _GLIBCXX_DEBUG
#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 Graph vector<vector<int>>
typedef long long ll;
const int INF = 1000000007;
int main(){
int N;
ll K;
cin >> N >> K;
map<int, ll> A;
rep(... | 0 | 28,669,873 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <math.h>
using namespace std;
int main(){
int n,m,f=0,sum=0;
cin>>n>>m;
vector<int>a(1000000);
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
sort(a.begin(),a.end(),greater<>());
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin>>S>>T;
int N=S.size();
for(int i=0;i<N;i++){
bool bo=false;
for(int j=0;j<N;j++){
if(S[(j+i)%N]!=T[j]){
bo=true;
break;
}
}
if(bo)
continue;
cout<<"Yes"<<endl;
return 0;
}
cout... | 0 | 13,276,091 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if ((N / 1000 == N % 1000 / 100 && N % 1000 / 100 == N % 100 /10) || ( N % 1000 / 100 == N % 100 /10 && N % 100 /10 == N % 10) ) {
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #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;
using P = pair<int, int>;
using ll = long long;
int main()
{
string s;
cin >> s;
int sz = s.size();
rep(i, sz){
if(s[i] != s[sz - i - 1]){
cout... | 0 | 73,000,526 |
#include <bits/stdc++.h>
using namespace std;
typedef struct _dot{
int a;
int b;
}Dot;
int Distance(Dot a,Dot b){
return abs(a.a-b.a) + abs(a.b - b.b);
}
int main(void){
int N,M;
cin >> N >> M;
Dot student[N];
Dot CheckPoint[M];
for(int i=0;i<N;i++){
cin >> student[i].a;
cin >> ... | /* {:i:i:|i:i:/l/l-- --l/li:i:i|i:i:i:i}
{:rx|:i:i ィi芥ミ .ィi芥ミｉ:ｉ|ﾍ:i:i:}
. ｛ﾏ|ｉ: {::’:} {:‘::} :ｉ:i:|〉｝:/
乂|:i:| ｀¨¨¨¨´ ｀¨¨¨´ :i:ｉ:|ｼ/
ﾉ:|:i| ′ |:i:i:|ﾂ
/:/|:i:| ､ _ _ |:i:i:|
/:/ .|:i:|/ ＼ ｨ〔|:i:/
... | 0 | 13,704,339 |
#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 k, a, b;
cin >> k >> a >> b;
for (int i = a; i <= b; i++) {
if (i % k == 0) {
cout << "OK" << endl;
return 0;
... | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define f first
#define s second
#define pb push_back
#define pp push
#define RETURN exit(0)
#define pow(x,y) (int)(pow(x,y))
#define ceil(... | 0 | 1,807,940 |
#include<bits/stdc++.h>
using namespace std;
namespace FastIO
{
static char c;
static int top,buf[12],f;
template<typename T>
inline void read(T& x)
{
x=0,c=getchar(),f=1;
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();x*=f;
}
template<typename T>
inline void wri... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,sum=0,ans=0;
cin >> N;
vector<int> A(100001,0);
for(int i=0;i<N;i++){
int a;
cin >> a;
A[a]++;
}
for(int i=0;i<100001;i++){
if(A[i]!=0){
ans++;
if(A[i]!=1){
sum... | 0 | 72,170,702 |
#include<iostream>
int main(){
long int n,M;
M = 100000;
std::cin >> n;
for(int i=0;i<n;i++){
M = M * 1.05;
if(M%1000!=0){
M = M - (M%1000) + 1000;
}
}
std::cout << M << std::endl;
} | #include<iostream>
#include<cstdio>
#include<deque>
#include<string>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,i,x;
string s;
deque<int> intlist;
cin >> n;
for(i=0;i<=n-1;i++){
cin >> s;
if (s=="insert"){
cin >> x;
intlist.push_front(x);
}else if(s=="delete"){... | 0 | 88,937,473 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,sum=0;
cin>>n>>m;
int arr[m];
for(int i=0;i<m;i++) {
cin>>arr[i];
sum+=arr[i];
}
if(sum>n) cout<<-1<<endl;
else cout<<n-sum<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | 0 | 31,254,612 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define FASTIO cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false);
#define loop(i,a,b) for(int i=a; i<b; i++)
#define INF 10000000000099ll
#define mod 1000000007
#define prDouble(x) cout<<fixed<<setprecision(10)<<x
ll solve(vecto... | #include<cstdio>
#include<string>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<complex>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
typedef vect... | 0 | 60,780,468 |
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define print(ele) cout << ele << endl
#define print... | # pragma GCC target("avx")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
# include <iostream>
# include <vector>
# include <algorithm>
# include <string>
# include <sstream>
# include <cmath>
# include <queue>
# include <stack>
# include <map>
# include <iomanip>
# include <stdexcept>
# inclu... | 0 | 97,356,590 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll match[10] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
string dp[11000];
const string MINUSINF = "-";
void chmax_str(strin... | #include<iostream>
#include<stdio.h>
using namespace std;
int main() {
int H,a[250],i;
cin>>H;
for (i = 1;i <= H;i++)cin>>a[i];
for (i = 1;i <= H;i++) {
if (i / 2 == 0) {
printf("node %d: key = %d, left key = %d, right key = %d, \n", i,a[i], a[2 * i], a[2 * i + 1]);
}
else if (2 * i > H) {
printf("node ... | 0 | 13,420,470 |
#include <stdio.h>
int main( void )
{
int A,B,C ;
scanf("%d %d %d", &A, &B, &C ) ;
printf("%s\n", (A==B&&A==C) ? "Yes" : "No" ) ;
return 0 ;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#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 all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 2,297,563 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
vector<int> Solve() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> xs(n);
for (int i = 0; i < n; i++) {
xs[i] = s[i] == 'x';
}
vector<int> ys(n + 2);
for (int y0 = 0; y0 < 2; y0++) {
for (int y1... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | 0 | 46,445,592 |
#include<iostream>
#include<utility>
#include<algorithm>
using namespace std;
int main(){
int n,money;
while(cin >>n>>money &&( n>0||money>0)){
pair<int,int> PD[10010];
int p,d;
for(int i=0;i<n;i++){
cin >>d>>p;
PD[i]=make_pair(p,d);
}
sort(PD,PD+n);
int need;
int ans=0;
... | #include<stdio.h>
#include<string.h>
int main(){
char s1[101],s2[101];
int n,i,taro=0,hana=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %s",s1,s2);
if(strcmp(s1,s2)==0){
taro++;
hana++;
}
if(strcmp(s1,s2)>0){
taro=taro+3;
}
if(strcmp(s1,s2)<0){
hana=hana+3;
... | 0 | 22,377,919 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
#include <unordered_map>
#inc... | #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 N; cin >> N;
vector<int> h(N);
int ans = 0;
rep(i, N){
cin >> h[i];
if(i == 0){
ans += h[i];
} else {
... | 0 | 40,626,559 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define endl '\n'
#define mod 1000000007
#define modd 998244353
#define inf 1e18
#define ff first
#define ss second... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 18,824,190 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 1000005
bool vis[N];
int ret[N];
void solve() {
int m,k;scanf("%d %d ", &m,&k);
int r = (1<<m)-1;
if(k<=r) {
if(k==0) {
for(int i=0;i<=r;++i) {
printf("%d %d ", i,i);
}
putchar('\n');
return;
} if(... | #include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#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())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | 0 | 37,298,178 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
ll N,M;
scanf("%lld %lld",&N,&M);
if(N >= M/2){
printf("%lld\n",M/2);
}else{
ll an... | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define maxim INT_MAX
#define fi first
#define se second
#define INF 1e16
#define mod 1000000007
int main()
{
ll n,m;
cin>>n>>m;
ll dp[n+1][m+1];
memset(dp,... | 0 | 98,619,167 |
#include <iostream>
#include <iomanip>
using namespace std;
const int mxN = 2e5 + 5;
long long a[mxN], cnt[mxN];
int main() {
double l;
cin >> l;
cout << fixed << setprecision(7) << l * l * l / 27;
} | #include<bits/stdc++.h>
using namespace std;
#define oo (long long)1e18
#define ll long long
#define setdp memset(dp,-1,sizeof(dp))
const ll mod = 1e9+7;
void _IOS(){ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);}
#define PI 3.14159265359
int sx,sy,tx,ty;
struct threeElements{
int _1st,_2nd,_3rd... | 0 | 45,536,227 |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
cout << 10-(N/100)/2 << endl;
} | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define rep0(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep(i,x,y) for(int i=x;i<=y;i++)
#define reprev1(i,n) for(int i=n;i>0;i--)
#define reprev0(i,n) for(int i=n-1;i>=0;... | 0 | 14,528,869 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
void File(){
freopen("1.in","r",stdin);
freopen("2.out","w",stdout);
}
#define REP(i,a,b) for(register int i=a;i<=b;++i)
#define DREP(i,a,b) for(register int i=a;i>=b;--i)
#define MREP(i,x) for(register int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll MOD = 1000000007;
struct UnionFind {
vector<int> d;
UnionFind(int n=0): d(n,-1) {}
int find(int x) {
if (d[x] < 0) return x;
return d[x] = find(d[x]);
}
bool unite(int x, int y) {
... | 0 | 21,324,708 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m1(x) memset(x,-1,sizeof(x))
const int INF = 1000000001;
const ll MOD = 1000000007;
int main(){
int a[3];
rep(i, 3) cin >> a[... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 88,572,997 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
int n;
cin>>n;
vector<long long int> v(n+1,1);
for(int i=2;i<=n;i++){
for(int j=i;j<=n;j+=i){
v[j]++;
}
}
long long sum=0;
for(int i=1;i<=n;i++){
sum+=v[i]*i;
}
cout<<sum<<en... | #include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;
const int INF = 1 << 25;
const LL MOD = 1000000007LL;
using namespace std;
int dp[1 << 26];
int main() {
string s;
cin >> s;
int bit = 0, opt;
fill(dp, dp + (1 << 26), INF);
dp[0] = 0;
rep(i, ... | 0 | 1,484,252 |
#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 N; cin >> N;
map<int, int> m;
rep(i, N){
int a; cin >> a;
m[a]++;
}
ll ans1 = 0;
ll ans2 = 0;
for(auto p : m){
... | #include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
#define revrep(i,n,g) for (int i = n; i >= g; i--)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int m,k;
cin >> m >> k;
if (m <= 1) {
if (m == 0 && k == 0) {
cout << "0 0" << endl;
} else if... | 0 | 41,905,209 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
string ans;
string kekka = "";
bool chk = false;
cin >> str >> ans;
if (str.size() < ans.size()) {
cout << "UNRESTORABLE" << endl;
return 0;
}
reverse(str.begin(), str.end());
reverse(ans.begin(), ... | 0 | 45,776,195 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define drp(i,st,ed) for (int i=st;i>=ed;--i)
const int N=1011111;
int fa[N],d[N];
int read() {
int x=0,v=1; char ch=getchar();
for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
for (;ch<='9'&&ch>='0';x=x... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n, k;
cin >> n >> k;
map<int, int> mp;
for(int i=0; i<n; i++){
int a;
cin >> a;
mp[a]++;
}
int typs = 0;
priority_queue<int, vector<int>, greater<int>> pq;
... | 0 | 35,557,033 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
cin >> a >> b >> c;
int ax = a.size();
int bx = b.size();
int cx = c.size();
string flag = "NO";
if(a.at(ax-1) == b.at(0)){
if(b.at(bx-1) == c.at(0)){
flag = "YES";
}
}
cout << flag;
} | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
LL p[100005], q[100005];
int main() {
LL w, h;
cin >> w >> h;
for (int i = 0; i < w; i++) {
cin >> p[i];
}
p[w] = 999999999;
sort(p, p + w);
for (int i = 0; i < h; i++) {
... | 0 | 44,280,597 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n;
cin >> n;
int ans = 0;
int cur_H = 0;
rep(i, n){
int a;
cin >> a;
cur_H = max(cur_H, a);
if(a == cur_H) ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 19,535,897 |
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#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>
#... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ar array
#define db double
#define pi 3.14159265358979323846
#define pow pw
int pw(int a,int b){
int ans=1;
while(b){
if (b%2) ans*=a;
a*=a;
b/=2;
}
return(ans);
}
signed main()
{
ios_base::sync_with_stdio(false);... | 0 | 16,147,699 |
#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;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( co... | #include <cstdio>
#define MAX(a, b)((a) < (b) ? (b) : (a))
using namespace std;
int pow32(int base, int exp)
{
int ret = 1;
while (exp) {
if ((exp & 1) == 1) ret *= base;
exp >>= 1;
base *= base;
}
return ret;
}
void YES()
{
printf("YES\n");
}
void NO()
{
printf("NO\n");
... | 0 | 86,072,285 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
scanf("%d",&n);
queue <ll> q;
for(int i=1; i<10; i++) q.push(i);
ll ans = 0;
while(!q.empty()){
ll a = q.front();
q.pop();
n--;
if(n==0){
ans = a;
break;
... | 0 | 58,779,356 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
string N; cin >> N;
int su = 0;
for (int i = 0; i < N.size(); i++) {
su += N[i] - '0';
}
if (su%9) cout << "No\n";
else cout << "Yes\n";
} | #include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
const int inf=1e9+7;
int N,A,B,C;
int l[8];
int dfs(int cur,int a,int b,int c){
if(cur==N){
if(a==0||b==0||c==0) return inf;
return abs(A-a)+abs(B-b)+abs(C-c)-30;
}
int r0,r1,r2,r3;
r0=dfs(cur+1,a,b,c);
r1=df... | 0 | 2,353,405 |
#include <cstdio>
using LL = long long;
const int MAXN = (int)1e5;
LL a[MAXN];
struct LinearBasis {
static const int MAXL = 64;
LL a[MAXL];
LinearBasis() {
for (int i = 0; i < MAXL; ++i) a[i] = 0;
}
void Add(LL vec) {
for (int j = MAXL - 1; j >= 0 && vec > 0; --j) {
if (((vec >> j) & 1) == 0) co... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll inf=1000000000;
int main() {
int h,n;
cin>>h>>n;
ll dp[1010][10010];
ll a[n];
ll b[n];
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
}
for(int i=0;i<1010;i++){
for(int j=0;j<10010;j++){
dp[i][... | 0 | 9,061,117 |
#include<iostream>
using namespace std;
int goban[18][18] = { 0 };
int ans;
void check(int x,int y,int a,int b) {
if (x == a&&y == b) { ans++; }
else {
if (goban[x + 1][y] == 1) {
check(x + 1, y, a, b);
}
if (goban[x][y + 1] == 1) {
check(x, y + 1, a, b);
}
}
}
int main(void) {
while (1) {
ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n,sum=0;
cin>>n;
vector<long long> v(n), l(n);
for(long long &i:v)cin>>i,sum+=i;
long long g=n*(n+1)/2;
if(sum%g){
cout<<"NO";
return 0;
... | 0 | 62,195,059 |
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
#define pb push_back
#de... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> groups;
char key = '1';
int cnt_key = 0;
for(int i=0;i<N;i++){
if(S.at(i)==key){
cnt_key++;
}
else{
... | 0 | 43,478,438 |
#include <bits/stdc++.h>
int main(void)
{
int K, S;
std::cin >> K >> S;
int ans = 0;
for (int x = 0; x <= K; x++) {
for (int y = 0; y <= K; y++) {
int z = S - x - y;
if (z >= 0 && z <= K) {
ans++;
}
}
}
std::cout << ans << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | 0 | 31,339,028 |
#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... | #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat... | 0 | 76,341,594 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
if(x>=400&&x<600)
cout << "8" << endl;
if(x>=600 && x<800)
cout << "7" << endl;
if(x>=800 && x<1000)
cout << "6" << endl;
if(x>=1000 && x<1200)
cout << "5" << endl;
if(x>=1200 && x<1400)
cout << "4" << endl;
if... | #include <bits/stdc++.h>
using namespace std;
int mod=1e9+7;
int main()
{
int n,k;
cin >> n >> k;
int a[n+1];
for(int i=1;i<=n;i++)
{
cin >> a[i];
}
int dp[n+1][k+1];
dp[0][0]=1;
for(int i=1;i<=k;i++)
{
dp[0][i]=0;
}
for(int i=1;i<=n;i++)
{
... | 0 | 55,922,726 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll l1[10];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b,c,d,x=0,y=0,x2=0,y2=0;
string s;
cin>>s;
a=s[0]-'0';
b=s[1]-'0';
c=s[2]-'0';
d=s[3]-'0';
if(a+b+c+d==7){
cout<<a;cout<<"+";
... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"GREATER":"LESS")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x <<... | 0 | 69,196,441 |
#include <iostream>
#define FLAME_MAX 10000
#define REP(i, n) for(int i = 0; i < (n); i++)
#define linear(x, A, B, C) ((A) * (x) + (B)) % (C)
using namespace std;
int main()
{
while(1){
int N, A, B, C, X;
cin >> N >> A >> B >> C >> X;
if(N == 0 && A == 0 && B == 0 && C == 0 && X == 0){
break;
}e... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string O,E,p;
cin>>O>>E;
int a=O.length();
int b=... | 0 | 83,104,245 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin >> n;
cout << n * (n+1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> students, pos;
for (int i = 0; i < N; i++) {
int... | 0 | 39,301,758 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxv = 11;
int d[maxv][maxv];
int V;
int x[maxv];
void warshall_floyd()
{
for(int k=0; k<V; k++)
for(int i=0; i<V; i++)
for(int j=0; j<V; j++)
d[i][j] = min(d[i]... | 0 | 13,248,538 |
#include<bits/stdc++.h>
using namespace std;
long long int k;
#define MAX 50
long long int ans[MAX];
int main(){
scanf("%lld", &k);
long long int rest = k / MAX;
for (int i = 0; i < MAX; i++){
ans[i] += rest*MAX;
ans[i] -= rest*(MAX-1);
ans[i] += 49;
}
k %= MAX;
for (int i = 0; i < k; i++){
ans[i] += MAX;... | #include <stdio.h>
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int N, A;
int rest;
cin >> N >> A;
rest = N % 500;
if((rest==0)||(rest<=A)){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 0 | 68,305,954 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, x;
cin >> n >> d >> x;
int cnt = x;
int tmp;
for (int i = 0; i < n; i++) {
cin >> tmp;
cnt += (d-1) / tmp + 1;
}
cout << cnt << endl;
return 0;
} | # include <stdio.h>
int main(void)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a<=b){
if(b<=c){
printf("%d %d %d\n",a,b,c);
}else if(b>c){
if(a<=c){
printf("%d %d %d\n",a,c,b);
}else if(a>c){
printf("%d %d %d\n",c,a,b);
}
}
}else if(a>b){
if(a<=c){
printf("%d ... | 0 | 3,130,818 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = n; i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
ll n; cin >> n;
ll ans = n*(n-1)/2;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdi... | 0 | 25,350,449 |
#include <bits/stdc++.h>
using namespace std;
int SumDigit(int i) {
int res=0;
int tmp, digit;
for (int n=4; n>=0; n--) {
digit=pow(10,n);
tmp=i/digit;
i-=tmp*digit;
res+=tmp;
}
return res;
}
int Calc(int i, int a, int b) {
int x=SumDigit(i);
if (a <= x && x <=b) return i;
return 0;
}
in... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int n,k[100]={0},max=0;
while(cin>>n){
k[n]++;
if(max<k[n]){
max=k[n];
}
}
for(int i=0;i<100;i++){
if(k[i]==max){
cout<<i<<endl;
}
}
} | 0 | 43,312,990 |
#include <bits/stdc++.h>
#include <cassert>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int, int>;
using vvi = v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define INF 1000000000000
#define MOD 10000007
#define PI 3.14159265359
#define dij priority_queue<pair<int,int>,vector<pa... | 0 | 26,711,205 |
#include <iostream>
using namespace std;
int main(void){
int n;
cin>>n;
int h[n];
for (int i=0;i<n;i++){
cin>>h[i];
}
int mx = 0;
int ans = 0;
for (int i=0;i<n;i++){
if (mx<=h[i]){
ans++;mx=h[i];
}
}
cout<<ans;
} | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n;
cin >> n;
ll a[n+1];
for(int i=0;i<n+1;i++)cin >> a[i];
ll b[n];
for(int i=0;i<n;i++)cin >> b[i];
ll c=0;
for(int i=0;i<n;i++){
if(a[i]>=b[i]){
c+=b[i];
}
... | 0 | 89,764,891 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rep1(i,n) for(int i=1;i<=(int)(n);++i)
#define rep11(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define repm(i,n) for(int i=(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 + 5;
int n, m, k, ans;
int main() {
cin >>... | 0 | 12,344,984 |
#include "bits/stdc++.h"
using namespace std;
#define PB push_back
#define MP make_pair
#define REP(i,n) for(int i=0;i<(n);i++)
int main(){
long long sum=0;
int n;
long long a[200100];
cin>>n;
REP(i,n){
cin>>a[i];
sum+=a[i];
}
long long s1=0;
long long ans=1e18;
for(i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define fill(a,b) memset(a,b,sizeof(a))
#define f first
#define s second
#define pb push_back
#define inf 1e17
#define ninf -1*1e17
#define mod 1000000007
#define N 500005
#define Ns... | 0 | 29,698,791 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, B;
string op;
cin >> A >> op >> B;
if(op == "+")
cout << A + B << endl;
if(op == "-")
cout << A - B << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | 0 | 68,222,339 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define y... | #include <iostream>
#include <fstream>
#include <string>
using namespace std;
int main(){
while (1) {
int steps, count=0;
cin >> steps;
string leg1, leg2;
if (steps == 0){ break; }
int loops;
if (steps % 2 == 1) { loops = (steps + 1) / 2; }
else { loops = steps / 2; }
for (int i = 0; i < loops; i++)
... | 0 | 59,218,049 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <bitset>
using namespace std;
typedef long long int lli;
int main(void)
{
int a[3];
for (int i = 0; i < 3; i++)
{
cin >> a[i];
}
sort(a... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <ite... | 0 | 48,623,608 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
if (a + b >= k)
{
cout<<min(a, k);
}
else
{
cout<<a-(k-a-b);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 86,972,717 |
#include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute()
{
int N;
cin >> N;
if (N < 1200)
cout << "ABC" << endl;
else
cout << "ARC" << e... | #include<iostream>
#include<vector>
#include<cstring>
#include<sstream>
#include<algorithm>
#include<iomanip>
using std::cout;
using std::endl;
using std::flush;
using std::cin;
namespace Util{
using StringVector = std::vector<std::string>;
StringVector split( const std::string &s, const std::string &delim = st... | 0 | 10,665,521 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n-1);i>=0;i--)
#define FOR(i,n,m) for(int i=n;i<=(int)(m);i++)
#define RFOR(i,n,m) for(int i=(int)(n);i>=m;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
typedef long long ll;
const int INF = 1... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5 + 200;
typedef long long ll;
typedef pair<int, int> pii;
int n, siz[MAX_N], id[MAX_N], fa[MAX_N], head[MAX_N], current;
ll D[MAX_N];
set<ll> st[2];
map<ll, int> mp;
struct edge
{
int to, nxt;
} edges[MAX_N << 1];
void addpath(int src, int dst)
{
... | 0 | 25,111,382 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll MOD = (ll) 1e9 + 7;
const double PI = 3.141592653589793238463;
const int MAXN = 1000005;
int main() {
FAST
int n;
cin>>n;
... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 94,620,466 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,aa=0,bb=0;
string a,b;
cin >> n;
while(n--){
cin >> a >> b;
if(a>b)aa+=3;
else if(a<b)bb+=3;
else aa++,bb++;
}
cout << aa << ' ' << bb << endl;
} | #include <cstdio>
#include <iostream>
#include <cstring>
#include <set>
#include <algorithm>
#define FOREVER for (;;)
#define FOR(i,a,b) \
for (int (i)=(a);(i)<(b);(i)++)
#define REP(i,a,b) \
for (int (i)=(a);(i)<=(b);(i)++)
#define log(exp) \
printf(#exp" = %d\n", exp)
#define INF 100000000
using namespace std;
const ... | 0 | 90,732,718 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define SZ(x) ((int)(x).size())
#define rep(i,n) for(int i=0;i<(n);++i)
#define fore(i,a) for(auto &i:a)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
#define Yes cout << "Yes" << endl;
#define No cou... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<long long,int> P;
int main(){
int n;
cin >> n;
vector<pair<int, int>> r(n), b(n);
rep(i, n... | 0 | 70,314,204 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(){
int a,b,c,max;
cin>>a>>b>>c;
if(a>=b && a>=c){
max=a;
printf("%d",max*10+b+c);
}
else if(b>=a && b>=c){
max=b;
printf("%d",max*10+a+c);
}
else{
max=c;
printf("%d",max*10+a+b... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 0 | 95,938,719 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<l... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 0 | 28,892,012 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 0 | 5,316,731 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
S.insert(4, " ");
cout << S << '\n';
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
typedef long long ll;
typedef unsigned long long ull;
... | 0 | 92,969,483 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define ll long long
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define pii pair<int... | 0 | 52,894,746 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll n; cin >> n;
vector<ll> a(n), b(n);
... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int INT;
typedef unsigned long long LONG;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 1e5 + 10;
const int mod = 998244353;
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define FW freopen("data2.txt", "w", stdout);
template <class T... | 0 | 46,503,171 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;j<=(n);++i)
#define all(x) (x).begin(),(x).end()
using pii = pair<int,int>;
constexpr int INF = 0x3f3f3f3f;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
string s;
int main()
{
_FastIO;
cin >> s;
for(int i = 0; i < s.size(); i++){
if(s[i] == '1')
cout << '9'... | 0 | 26,585,606 |
#include <vector>
#include <string>
#include <iostream>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <functional>
#include <map>
#include <array>
#include <cmath>
#include <set>
#include <numeric>
using namespace std;
template <typename T>
using TABLE = vector<vector<T>>;
using LONG = long long;
us... | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
string s, t;
cin >> s >> t;
int a = t.size();
string p = t.erase(a - 1);
if(s == p){
cout << "Yes" << '\n';
}
else{
cout << "No" << '\n';
}
return 0;
} | 0 | 26,051,549 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
void solve() {
string s;
cin >> s;
int len = s.size() - 2;
while (s.substr(0, len/2) != s.substr(len/2, len/2)) {
len -= 2;
}
cout << len;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath... | 0 | 78,011,060 |
#include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include<stack>
using namespace std;
int main()
{
int A, B,C;
cin >> A >> B >> C;
if (A == B && B == C)
{
cout << "Yes";
}
else
{
cout << "No";
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define... | 0 | 15,729,356 |
#include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> plus, minus;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a > 0)plus.push_back(a);
else minus.push_back(a);
}
sort(plus.begin(), plus.en... | 0 | 75,936,378 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.