code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
template<clas... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b){
if(a==0) return b;
if (a < b) swap... | 0 | 9,770,267 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
... | 0 | 11,073,508 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int64_t INF = 1LL << 60;
int main() {
string s;
cin>>s;
for(i... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define DEBUG2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<... | 0 | 53,447,420 |
#include <bits/stdc++.h>
namespace UnionFindTree {
template<std::size_t N>
void Init(int (&ps)[N]) {
for(int i = 0; i < (int)N; ++i) ps[i] = i;
}
template<std::size_t N>
int Find(int (&ps)[N], int x) {
return ps[x] == x ? x : ps[x] = Find(ps, ps[x]);
}
template<std::size_t N>
void Unite(int (&ps... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | 0 | 57,580,248 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | #include <bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#define ff first
#define ss second
#define pp pair<l... | 0 | 5,532,758 |
#include<iostream>
#include<cstring>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
const double PI=acos(-1);
struct Point{
double x,y;
};
void koch(int n,Point a,Point b)
{
if(n==0)
return ;
Point s,t,u;
double th=PI*60.0/180.0,r;
s.x=(2.0*a.x+1.0*b.x)/3;
s.y=(2.0*a.y+1.0*b.y)/3;
t.x=(1.... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;... | 0 | 37,957,205 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T&... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
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;}
int ... | 0 | 36,440,854 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | 0 | 48,688,763 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll cur = 0;
ll l = 0;
ll ans = 0;
for (int r = 0; r < n; r++) {
while (cur & a[r]) {
cur ^= a[l];
l++;
}
cur ^= a[r... | #include <bits/stdc++.h>
#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define sz(v) int(v.size())
#define all(v) v.begin(), v.end()
#define y1 what
using namespace std;
const int N = (int) 4e5 + 10;
const int M = (int)... | 0 | 42,410,619 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
ll n, a, b;
cin >> n >> a >> b;
if(a > b) { cout << 0 << endl; return 0;}
if(n==1 && a!=b) { cout << 0 << endl; return 0;}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e+18;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end... | 0 | 73,299,407 |
#include<iostream>
using namespace std;
int main() {
int N, M; cin >> N >> M;
for (int i = 0; i < M; i++) {
int A; cin >> A;
N -= A;
}
if (N < 0) {
cout << -1 << endl;
} else {
cout << N << endl;
}
} | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 16,269,170 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, S = 0;
cin >> n;
vector<int> v(n);
for(int i = 0;i < n;i++) {
cin >> v[i];
}
for(int i = 0;i < n;i++) {
for(int j = i + 1;j < n;j++) {
S += v[i] * v[j];
}
}
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int H,W;
int dx[2] = {0,1};
int dy[2] = {1,0};
i... | 0 | 39,232,100 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
string s;
cin >> n >> s;
int cnt = 1;
for(int i = 0; i < n-1; i++){
if(s[i] == s[i+1]) continue;
cnt++;
}
cout << cnt << endl;
return 0;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll a,b,c,d,sum;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%lld%lld",&a,&b);
c=a*b;
d=sqrt(c);
if(d*(d+1)<c)
sum=d*2-1;
else if(d*d==c)
{
if(a==b)
... | 0 | 64,059,742 |
#include <bits/stdc++.h>
using namespace std;
#define range(i, m, n) for(int i = m; i < n; i++)
#define husk(i, m, n) for(int i = m; i > n; i--)
int n;
int main() {
cin >> n;
vector<vector<char>> a(n, vector<char>(n));
range(i, 0, n) {
range(j, 0, n) cin >> a[i][j];
}
int res = 0;
range(dif, 1 - n, n) {... | #include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define setbits(x) __builtin_popcount(x)
#define zerobits(x) __builtin_ctz(x)
#define setbitsll(x) __builtin_popcountll(x)
#define zerobitsll(x) __builtin_ctzll(... | 0 | 11,064,858 |
#include <bits/stdc++.h>
using namespace std;
#define BUF (100005)
#define ll long long
int k;
vector<int> v[BUF];
vector<int> v_[BUF];
int d[BUF];
int main(void){
cin >> k;
for(int i=1;i<k;i++){
v[i].push_back((i+1)%k);
v_[i].push_back((10*i)%k);
}
deque<int> q;
q.push_front(1);
d[1] = 1;
while(1){
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
#define PRYES(x) PR((x) ? "Yes" : "No")
const lo... | 0 | 35,600,662 |
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
#include <set>
using namespace std;
#define rep(i, n) for (int i=0; i<int(n); i++)
int main() {
int n, m;
cin >> n... | #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;
constexpr double PI = 3.14159265358979323846;
int m... | 0 | 97,409,869 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
#define fori(i,a,b) for(int i=(a);i<(int)(b);i++)
#define repi(i,n) fori(i,0,n)
#define forr(i,a,b) for(int i=int(b-1);i>=int(a);i--)
#define repr(i,n) forr(i,0,n)
#define all(x) (x).begi... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,... | 0 | 45,817,757 |
#include <iostream>
#define N 101
using namespace std;
void swap(int *x, int *y){
int z = *x;
*x = *y;
*y = z;
}
int selectionSort(int *A, int n){
int count = 0;
for(int i=0;i<n;i++){
int minj = i;
for(int j = i;j<n;j++)
if(A[j] < A[minj])
minj = j;
if(i != minj){
swap(A[i], A[minj]);
coun... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 0 | 16,118,738 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
void solve()
{
ll a,b,c;
cin>>a>>b>>c;
cout<<a+b+c-max({a,b,c});
return;
}
int main()
{
fast;
ll q;
... | #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... | 0 | 365,201 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int,int>
#define ppl pair<ll,ll>
#de... | 0 | 98,057,194 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1e18
#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 ps(x,... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 55,664,137 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n; cin >> n;
vector<int> vt(n);
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> vt[i];
if (vt[i] && i && vt[i - 1])
vt[i - 1]--, vt[i]--, ans++;
ans += vt[i] / 2;
vt[i] = vt[i] % 2;
}... | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20)
#define int long long
#define double long double
const int INF = 1e18, MOD = 1e9 + 7;
int n, m, a;
int cnt[111111] = {};
signed main() {
INCANT;
cin>>n>>m;
for (in... | 0 | 64,250,182 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
int main(){
string s;
cin >> s;
bool OK_A = false;
bool OK_C = false;
bool OK_lower = true;
int cnum;
if(s[0] == 'A') ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n)cin >> a[i];
rep... | 0 | 91,625,168 |
#include <bits/stdc++.h>
using namespace std;
#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++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a... | #include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debug cout<<"debugged\n";
#define minval... | 0 | 21,023,735 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i ,n) for(int i = 0 ; i < (n) ; i ++ )
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using vin=vector<int>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
int main(){
ll n,a,... | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for (int i = (int)(n - 1... | 0 | 46,944,289 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include<bits/stdc++.h>
using namespace std;
int func(int a){
int sum = 0;
while(a > 0){
sum += a % 10;
a /= 10;
}
return sum;
}
int main(){
int N, A, B;
cin >> N >> A >> B;
int ans = 0;
for(int i = 0; i <= N; i++){
if(func(i) >= A && func(i) <= B){
an... | 0 | 26,755,326 |
#include <iostream>
#include <string>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main()
{
int n,a = 0,b = 0;
cin >> n;
rep(i,n)
{
string s,s2;
cin >> s >> s2;
if(s > s2) a += 3;
else if(s < s2) b += 3;
else
{
a++;
b++;
}
}
cout << a << " " << b << endl;
return 0;
} | #pragma GCC optimization ("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#incl... | 0 | 48,529,892 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
typedef long long ll;
int main()
{
int n;
cin>>n;
int ans[n];
int arr[n-1];
for(int i=0;i<n-1;i++)
{
cin>>arr[i];
}
ans[0] = arr[0];
int sum = ans[0];
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll =long long;
using namespace std;
using graph=vector<vector<int>>;
using field=vector<string>;
using p =pair<int,int>;
const ll mod=1000000007;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
int main(){
ll n,Y;
cin>>n>>Y;
... | 0 | 50,744,135 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
const double PI = acos(-1);
const int Mod = 1e9+7;
const int MXS = 2e5+5;
const int MXI =... | #include <bits/stdc++.h>
#include <sstream>
#include <iomanip>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std... | 0 | 31,506,503 |
#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;
using M = map<int, int>;
int main()
{
int inf = 1000000000;
int n, m, x;
cin >> n >> m >> x;
int c[n], a[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int counter =0;
for (int i=1; i <= N; i++){
int K = i;
int tempAns = 0;
while(K > 1){
if (K%2 == 0){
K /= 2;
tempAns++;
}
else break;
}
if (tempAns > counter) counter ... | 0 | 89,424,524 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
ll d, a;
cin >> n >> d >> a;
vector<P> p(n);
rep(i, n){
cin >> p[i].first >> p[i].second;
}
sort(p.begin(), p.end());
d = d*2;
ll tot = 0;... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | 0 | 25,241,997 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rrep(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef ... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> time(5);
vector<int> wait(5);
int maxwait=0;
int sum=0;
for(int i=0; i<5; i++){
cin >> time.at(i);
wait.at(i)=time.at(i)%10;
if(wait.at(i)) wait.at(i)=10-wait.at(i);
maxwait=max(maxwait,wait.at(i));... | 0 | 351,426 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i,0,n) cin >> h[i];
int ans = 0, cnt = 0;
rep(i,0,n-1) {
if (h[i] >= h[i+1]) {
cnt++;
} else {
... | /* {: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 | 12,449,504 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int64_t> vec(100, 0);
vec.at(0) = 2;
vec.at(1) = 1;
for(int i=2; i<n+1; i++){
vec.at(i) = vec.at(i-1) + vec.at(i-2);
}
cout << vec.at(n) << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
int n;
cin>>n;
int a=0,b=0;
for(int i=0;i<n;i++){
string s,t;
cin>>s>>t;
if(s==t){
a++;
b++;
}else if(s>t){
a+=3;
}else{
... | 0 | 83,137,543 |
#include<bits/stdc++.h>
using namespace std;
const long P=1000000007;
int main(){
long N;cin>>N;string S;cin>>S;
vector<long>A(26,1);
for(char c:S)A[c-97]++;
long ans=1;
for(long x:A)ans=(ans*x)%P;
cout<<(ans-1+P)%P;
} | #include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int main() {
int n,m;
cin>>n>>m;
vector <vector <int>> answer(n,vector<int>(m));
vector <vector <int>> ans(n,vector<int>(m,0));
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
char input;
cin>>input;
... | 0 | 17,285,536 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | #include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functi... | 0 | 54,394,029 |
#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#includ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
using ll = long long;
using Graph = vector<vector<pair<int, int>>>;
const ll INF = 1001001001;
int main(){
string s; cin >> s;
ll k; cin >> k;
for(int i = 0; i < min((ll)s.size(), k); i++){
if(s[i] != '1'){
... | 0 | 42,790,063 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include<ext/pb_ds/detail/standard_policies.hpp>
#define pi acos(-1)
#define pb push_back
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define MAX 300005
#define INF 0x3f3f3f3f
tem... | 0 | 16,118,494 |
#include <iostream>
using namespace std;
int main() {
int a[5][4][11];
int n;
int b;
int f;
int r;
int v;
cin>>n;
for(int i=0; i<5; i++){
for(int j=0; j<4; j++){
for(int k=0; k<11; k++){
a[i][j][k]=0;
}
}
}
for(int i=0; i<n; i++){
cin>>b>>f>>r>>v;
a[b][f][r]+=v;
}
for(int i=1; i<4; i+... | #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#i... | 0 | 84,384,963 |
#include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
string S;
ll K;
cin >> S >> K;
if(K<S.size()) S=S.substr(0,K);
for(int... | #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long... | 0 | 92,891,803 |
#include <iostream>
#include <cstdio>
#include <string>
#include <deque>
#include <algorithm>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
deque<int> lst;
int main() {
int n, v;
string s;
cin >> n;
rep(i,n) {
cin >> s;
if(s == "insert") {
cin >>... | #include <iostream>
using namespace std;
int main(void){
int A, B, C, K;
cin >> A >> B >> C >> K;
while (A >= B) {
B *= 2;
K--;
}
while (B >= C) {
C *= 2;
K--;
}
if (K >= 0) cout << "Yes" << endl;
else cout << "No" << endl;
} | 0 | 79,507,342 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
vector<ll>A(5);
ll ans=0;
ll m=10;
rep(i,5){
cin>>A[i];
ll d=A[i];
d%=10;
if(d==0){
d+=10;
}
if(... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x... | 0 | 52,515,153 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define fi first
#define se second
#define inf (INT_MAX/2-1)
#define infl (1LL<<60)
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define sz(a) (int)(a).s... | 0 | 67,445,901 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a,b,c;
cin>>a>>b>>c;
set<int> nums;
nums.insert(a);
nums.insert(b);
nums.insert(c);
cout<<nums.size()<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
int c;
int d;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
int l = a + b;
int r = c + d;
if (l > r) {
cout << "Left" << endl;
}
else if (l < r) {
cout << "Right" << endl;
}
else if (l = r) {
cou... | 0 | 65,732,726 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using graph = vector<vector<int>>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main() {
int n;
string s,t;
cin>>n>>s>>t;
string ans=s+t;
for(int i=n; i>=1; i--){
string s_=s.substr(n-i, i);
string t_=t.substr(0,i);
if... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int sll;
typedef double ld;
#define A 1000000007ll
#define D 1000000000ll
#define B 998244353ll
#define C 1000000000000000000ll
#define FAST ios::sync_... | 0 | 58,379,479 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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 int INF=1001001001;
vector<pair<int64_t,int64... | #include<iostream>
#include<utility>
#include<queue>
#define INF 10000000000
using namespace std;
typedef pair<int, int>P;
char maze[20][20];
int H,W;
int sx,sy,gx,gy;
int d[20][20];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int bfs(){
int rel=1;
queue<P> que;
for(int i=0;i<H;i++)
for(int j=0;j<W;j++) d[i][... | 0 | 78,407,134 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <cmath>
#include <iomanip>
#include <bitset>
#include <string>
#include <stdlib.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
int main() {
ll a,b,c;
cin >> a >> b >> c;
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 54,478,062 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define oo 1000000000000000000
#define forr(i,n) for(ll i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0) ; cout.tie(0);
#define all(x) x.begin(),x.end()
#define eb emp... | #include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
int main(int argc, char **argv)
{
int n;
cin >> n;
vector<int> dp(n, INT_MAX);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
auto p = lower_... | 0 | 86,313,721 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,a;
map<int,int> b;
for (cin >> N; N; b[a]++, N--) {
cin >> a;
}
a = 0;
for (auto p : b) {
if (p.second >= p.first) {
a += p.second-p.first;
} else {
a += p.second;
}
}
cout << a;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int h,w;
cin >> h >> w;
vector<vector<string>> s(h,vector<string>(w));
for(int i=0;i<h;i++) for(int j=0;j<w;j++) cin >> s[i][j];
string alphabet = "ABCDEFGHIJKLMNOPQRSTUVW... | 0 | 24,976,546 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c,d,maxx;
cin>>a>>b>>c>>d;
maxx=max(a*c,a*d);
maxx=max(maxx,max(b*c,b*d));
cout<<maxx;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
const string YES = "Yes";
const string NO = "No";
void solve(long long H, long long W, std::vector<std::string> s) {
vector<pair<ll, ll>> dir{pair<ll, ll>(-1, 0), pair<ll, ll>(1, 0), pair<ll, ll>(... | 0 | 18,034,969 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <string>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <ctime>
using namespace std;
#define pb push_back
#define All(a) a.begin(), a.end()
#define met(a, b) memset(a, b... | #include<iostream>
#include<queue>
using namespace std;
static const int N=100;
static const int WHITE=0;
static const int GRAY=1;
int n,M[N][N],color[N];
int d[N];
void bfs(int s){
queue<int> q;
for(int i=0;i<n;i++){
d[i]=0;
color[i]=WHITE;
}
color[s]=GRAY;
q.push(s);
int u;
... | 0 | 622,280 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
ll man(ll x1, ll y1, ll x2, ll y2)
{
return abs(x1 - x2) + abs(y1 - y2);
}
int main()
{
int N, M;
cin >> N >> M;
vector<ll> a(N), b(N), c(M), d(M);
rep(i, N)
{
cin >> a[i] >> b[i];
}
r... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
const double EPS = 1e-9;
#define INF (1LL<<60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define RFOR(i,a,b) for(int i = (int)(b-1);i>=(int)(a);--i)
#define REP(i,n)... | 0 | 86,904,147 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll a,b,c;
cin >> a >> b >> c;
if(a+b>=c) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include<iostream>
using namespace std;
int SelectionSort(int*Array, const int Num) {
int SortNum = 0;
for (int i = 0; i < Num; i++) {
int minj = i;
int tmp = *(Array + i);
for (int j = i; j < Num; j++) {
if (*(Array + j) < *(Array + minj))minj = j;
}
if (i < minj) {
*(Array + i) = *(Array + minj);
... | 0 | 47,359,170 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main(){
string s;cin>>s;
long long ans=0;
int n=s.size(),cnt=0;
vector<long long>a(n+1),b(n+1);
a[0]=1;b[0]=1;
for(int i=1;i<n+1;++i){
a[i]=a[i-1]*3%MOD;
b[i]=b[i-1]*2%MOD;
}
for(int i=0;i<n;++i){
... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#defi... | 0 | 57,971,974 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for ( int i = 0; i < (n); i++ )
using Pii = pair<int, int>;
int cost(Pii a, Pii b) {
return abs(a.first-b.first) + abs(a.second-b.second);
}
signed main() {
int H, W, D;
cin >> H >> W >> D;
int A[H][W];
Pii P[H*W+1];
vecto... | 0 | 99,300,622 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.begin(),t.end(), greater<char>());
string ans;
if (s < t){
ans = "Yes";
}else{
ans = "No";
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
ll x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<ll> p(a), q(b), r(c);
rep(i,a) cin >> p[i];
rep(i,b) cin >> q[i];
rep(i,... | 0 | 96,037,136 |
#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<< ")... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 69,008,912 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <numeric>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define repr(i,n) for (int i = n; i > 0; --i)
using namespace std;
using ll = long long;
using P = pair<int,int>;... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 20,643,966 |
#include "bits/stdc++.h"
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define mt make_tuple
#define MOD 1000000007
#define fo(i,a,b) for(i=a;i<b;i++)
#define foe(i,a,b) for(i=a;i<=b;i++)
#define all(x) x.begin(), x.end... | 0 | 58,168,399 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t k,a,b;
cin>>k>>a>>b;
if(a+2>b||k<(a-1)+2)
cout<<k+1<<endl;
else{
int64_t wk1=b+(k-(a-1)-2)/2*(b-a)+(k-(a-1)-2)%2;
cout<<wk1<<endl;
}
return 0;
} | #include <stdio.h>
int main(){
int i;
int brpkali;
long long hasil=1;
unsigned long long Data = 1000000000000000000u;
scanf("%d", &brpkali);
long long arr[1000000]={};
for(i=0;i<brpkali;i++)
{
scanf("%lld", &arr[i]);
}
for(i=0;i<brpkali;i++)
{
if (arr[i]==0){
... | 0 | 16,722,929 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using P = pair<ll,ll>;
int main() {
ll N,K;
cin >> N >>K;
string S;
cin >> S;
vector<P> position0;
for(int i=0;i<N;i++){
int t= S[i]-'0';
if(t==0){
ll s = i;
while(i<N-1 &&S[i+1]-'0' ==0){
... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define f first
#define s second
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using ld = long double;
using ll = long long;
using pii = pair <int,int>;
using pll = pair <ll,ll>;
using vi = vector <int>;
using vll = vector <ll>;
using... | 0 | 81,629,739 |
#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 { \... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | 0 | 72,739,671 |
#include <math.h>
#include <bitset>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int l, c = 0;
string a;
cin >> a;
l = a.size();
for (int i = 0; i < l; i++) {
char d = a[i];
if (i % 2 == 0) {
if (d == '0') c++;
} else if (d == '1')
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int n=s.size();
bool ans=true;
while(n>0){
if(n>4&&s.at(n-5)=='d'&&s.at(n-4)=='r'&&s.at(n-3)=='e'&&s.at(n-2)=='a'
&&s.at(n-1)=='m'){
n-=5;
continue;
}
if(n>4&&s.at(n-5)=='e'&&s.at(n-4)=='r'&&s.at(n-3)==... | 0 | 13,760,995 |
#include<stdio.h>
int main(){
int i,a;
i = 0;
a = 1;
while(1)
{
i++;
scanf("%d",&a);
if (a == 0){break;};
printf("Case ");
printf("%d",i);
printf(": ");
printf("%d",a);
printf("\n");
};
return 0;
} | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#define INF 100000000000000
using namespace std;
typedef long long llong;
bool isprime(llong num){
if(num==1){
return false;
}
if(num==2){
return ... | 0 | 38,590,010 |
#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)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | 0 | 47,410,878 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, P;
cin >> N >> A >> B;
vector<int> vec(3);
for (int i = 0; i < N; i++) {
cin >> P;
if (P <= A) {
vec.at(0)++;
}
else if (A + 1 <= P && P <= B) {
vec.at(1)++;
}
else {
vec.at(2)++;
}
}
sort(vec.begin(), vec.end());
co... | #include<bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
int main(){
int h, w;
cin >> h >> w;
char s[h][w];
for(int i=0; i<h; ++i){
for(int j=0; j<w; ++j){
cin >> s[i][j];
}
}
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
int cnt = 0... | 0 | 12,568,242 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
vector<pair<int64_t,int64_t>>prime_factorize(int64_... | #include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)
long long N, K;
long long P[1 << 18];
long long C[1 << 18];
long long solve(int pos) {
vector<long long> vec; int cx =... | 0 | 69,390,655 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define modulo ll (1e9 + 7)
typedef long long ll;
typedef pair<int,int> pii;
void init(){
cin.tie(0);
cin.sync_with_stdio(0);
}
const int N = 1e5 + 9, M = 2e3 + 9, OO = 0x3f3f3f3f;
const ll llOO = 0x3f3f3f3f3f3f3f3f;
int main(){
... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | 0 | 85,857,440 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=1e5+5;
const int mod=998244353;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin>>n>>m;
if(n%2)
{
int i=1,j=n;
while(m--)
{
cout<<i<<" "<<j<<'\n';
i+... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 67,110,744 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<math.h>
#include<tuple>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
bool war(const vector <int >& x, const vector <int >& y) {
for (int Z = -100; Z <= 100; ++Z) {
bool is_ok = true;
for (... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H,W;
cin >> H >> W;
string A[1010];
for(int i=0; i<H; i++) cin >> A[i];
int dist[1010][1010]={};
queue<pair<int,int>> q;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(A[i][j]=='#'){
dist[i][j]=0;
q.push(make_pair(... | 0 | 25,825,370 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
#define FOUT(n, dist) cout<<fixed<<setprecision(n)<<(dist);
#define BR cout<<endl;
#define LEN(s) s.length();
template<class T>bool chmax(T &a, const ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
string s1,s2;
int l1,l2;
cin >> s1 >> s2;
l1=s1.size(), l2=s2.size();
vector<vector<int>> dp(l1+1, vector<int>(l2+1));
rep(i,l1)
dp.at(i+1).at(0) = i+1;
rep(i,l2)
dp.at(0... | 0 | 70,713,043 |
#include<bits/stdc++.h>
#define GO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
const int N = 16;
const int M = 1e3 + 5;
const int Mod = 998244353;
struct Base
{
int m;
vector <ll> A;
Base(int m = 0) : m(m)
{
A.assign(max(m, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #x... | 0 | 74,644,632 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<long, long> PLL;
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using P = pair<i64, i64>;
#define overload3(_1, _2, _3, name, ...) name
#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)
#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define all... | 0 | 57,108,896 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int N, i, ans;
cin >> N >> i;
ans = (N + 1) - i;
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string botun[] = {"", ".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int n;
cin>>n;
for(int i=0;i<n;i++){
string s;
cin>>s;
string ans="";
int btn=0,count=0;
for(int j=0;j<s.size();j++... | 0 | 38,907,659 |
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <stack>
#include <string>
#include <deque>
#include <map>
#include <algorithm>
using namespace std;
int gcd(int a, int b) {
return b == 0 ? a : gcd(b, a % b);
}
void func() {
int N, K;
cin >> N >> K;
if (N % ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
string s,res,ans;
cin>>s;
int n=s.size();
int small=0,c=0;
rep(i,n) {
if (s[i]>='a'&&s[i]<='z') small++;
}
... | 0 | 96,756,386 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 23,345,088 |
#define ll long long
#define ui unsigned int
#define ud unsigned double
#define mp make_pair
#define pii pair<int,int>
#define pci pair<char,int>
#define pic pair<int,char>
#define pdi pair<double,int>
#define pb push_back
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >>s;
int n=s.size();
int flag=0;
for(int i=0; i<n-1; i++){
if(s[i]==s[i+1]){
cout << i+1 << " " << i+2 << endl;
flag++;
break;
}
}
if(flag==0){
for(int i=0; i<n-2; i++){
if(s[i]==s[i+2]){
... | 0 | 87,932,435 |
#include<cstdio>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<set>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define reps(i,n) for(int i=1;i<=n;i++)
int main(){
while(1){
int n;
cin>>n;
if(n==0)break;
int dp[111][111]={0};
rep(i,111)rep(j,111)dp[i][j]=1000000000... | #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... | 0 | 44,806,433 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n = s.length();
int a = -1, b = -1;
for(int i=0; i<n; i++){
if(i <= n-2 && s[i] == s[i+1]){
a = i+1;
b = i+2;
break;
}
if(i <= n-3 && s[i] == s[i+2]){
... | #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 | 95,624,877 |
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
#include <fstream>
#include <iterat... | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <set>
typedef std::pair<int, int> ii;
int H, W, M;
int SH[300005];
int SW[300005];
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
std::cin >> H >> W >> M;
for (int i = 0; i < H;... | 0 | 77,680,634 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <map>
#include <queue>
#include <cmath>
#include <iomanip>
#include <functional>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
const int MAX = 510000;
long long fac[MAX]... | #include <bits/stdc++.h>
#define all(v) (v).begin(),(v).end()
using namespace std;
using LL = long long;
const LL INF = 1e17;
int main(){
int N, K;
cin >> N >> K;
vector<int> a(N);
for(int i=0; i<N; i++) cin >> a[i];
vector<LL> v(N+1, 0);
for(int i=0; i<N; i++) v[i+1] = v[i]+a[i];
vector... | 0 | 66,512,901 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S second
const in... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5;
int _w;
int n , m , f[N][N][2][2] , flag;
long long ans;
char str[N];
int main( void ) {
_w = scanf("%s%d",str+1,&m);
n = strlen( str + 1 );
if( str[1] != str[n] || m == 1 ) {
for( int i = 1 , r ; i <= n ; i = r + 1 ) {
r = i;
wh... | 0 | 1,736,260 |
# include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
# include <bitset>
# include <map>
# include <queue>
# include <ctime>
# include <stack>
# include <set>
# include <list>
# include <random>
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define fo(i,n) for(i=0;i<n;i++)
#define fo1(i,n) for(i=1;i<... | 0 | 6,710,386 |
#include<iostream>
#include<iomanip>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#include<numeric>
#define rep(i,p) for(long long int i=0;i<p;i++)
#define reep(i,p) for(long long int i=1;i<=p;i++)
#define ll long long
using namespace std;
int main(){
ll int N;
c... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MN = 305 + 5;
int N,K,a[MN];
ll dp[MN][MN];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
memset(dp,0x3f,sizeof(dp));
cin>>N>>K;
for(int i=1; i<=N; i++) ci... | 0 | 35,140,889 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0;
for(auto x : s) {
sum = (sum + x - '0')%9;
}
cout << (sum ? "No" : "Yes");
} | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
using names... | 0 | 3,255,933 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long a,b,c,d;
cin>>a>>b>>c>>d;
long long k=max(a*c,a*d);
long long j=max(b*c,b*d);
long long val=max(k,j);
cout<<val;
return 0;
} | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define Repr(i, n, a) for (int i = (n); i >= (a); i--)
#define rep(i, n) Rep(i, 0, n)
#define repr(i, n) Repr(i, n, 0)
#define all(a) a.begin(), a.end()
using namespace std;
typedef pair<int, int> P;
typ... | 0 | 91,044,975 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 2000000000;
int main(){
int a, b, c;
cin >> a >> b... | #include<iostream>
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered... | 0 | 70,222,426 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using P=pair<int,int>;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl '\n'
#defi... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 78,388,035 |
#include <bits/stdc++.h>
using namespace std;
int main (){
int a,b,c;
cin>>a>>b>>c;
if (c>a&&c<b||c==a||c==b)cout<<"Yes";
else cout<<"No";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n,k,R,S,P;
string t;
cin>>n>>k>>R>>S>>P>>t;
int ans=0;
string s="";
rep(i,n){
... | 0 | 52,698,555 |
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
void one_case() {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
reverse(t.begin(), t.end());
for (int i = 0; i < min(... | #include <iostream>
int main(){
int H,W;
while(true){
std::cin >> H >> W;
if(0 == H&&0 == W)break;
for(int a = 0;a < H;a++){
for(int b = 0;b < W;b++){
std::cout << "#";
}
std::cout <<std::endl;
}
std::cout <<std::endl; }
} | 0 | 68,348,139 |
#include <iostream>
#include <stack>
#include <list>
using namespace std;
int main (int argc, char const* argv[]){
stack<int> st;
int n;
int tmp;
list<int> list1;
while((cin >> n)){
if(n == 0){
list1.push_back(st.top());
st.pop();
}
else st.push(n);
... | #include <bits/stdc++.h>
using namespace std;
struct activity{
public:
int A,B,C;
};
int a[100000];
int dp[100000][3];
int solve(vector<activity> &ar,int n){
memset(dp, 0, sizeof dp);
dp[0][0]=ar[0].A;
dp[0][1]=ar[0].B;
dp[0][2]=ar[0].C;
for(int i=1;i<n;++i){
dp[i][0]= ar[i].A + max(dp[... | 0 | 17,460,490 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
ll const mod = 1e9+7;
int up(int i,... | #include "bits/stdc++.h"
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
using namespace std;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#de... | 0 | 54,730,864 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
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 int IN... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 10,014,122 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | #include <iostream>
using namespace std;
int main()
{
int num[5];
for(int i=0; i<5; i++)
cin >> num[i];
for(int i=0; i<4; i++)
for(int j=i+1; j<5; j++)
if(num[i]<num[j]){
int tmp = num[i];
num[i] = num[j];
num[j] = tmp;
}
for(int i=0; i<5; i++){
cout << num[i];
if(i<4)
cout << ' ';
el... | 0 | 82,213,709 |
#include<iostream>
using namespace std;
long long functorial(long long ll){
if(ll<=1) return 1;
else return functorial(ll-1)*ll;
}
int main(){
int n;
cin>>n;
cout<<functorial(n)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a(1,s);
for (int i = 1; i <= 1000000; i++) {
if (a[i-1]%2 == 0)
a.push_back(a[i-1]/2);
else
a.push_back(3*a[i-1]+1);
for (int j = 0; j < i; j++) {
if (a[i] ... | 0 | 85,860,021 |
#include <bits/stdc++.h>
using namespace std;
bool dp[4001][16001];
int x,y;
string s;
int ax[4001],ay[4001];
int tx,ty;
void dfsx(int t,int n){
if (dp[t][8000+n])return ;
if (t<tx){
dfsx(t+1,n+ax[t]);
dfsx(t+1,n-ax[t]);
}
dp[t][n+8000]=1;
}
void dfsy(int t,int n){
if (dp[t][8000+n])return ;
if (t<ty){
dfsy... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll int
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
... | 0 | 5,880,149 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<long long int, long long int>... | #include <bits/stdc++.h>
using namespace std;
string o,e;
int numo=0,nume=0;
int main() {
cin>>o>>e;
for(int i=0;i<o.length()+e.length();i++) {
if(i%2==0) {
cout<<o[numo++];
} else {
cout<<e[nume++];
}
}
} | 0 | 27,377,556 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i<n;i++)
#define vv(Type,Name, n,m,d)vector<vector<Type>> vv(n, vector<Type>(m, d));
using namespace std;
using ll = long long;
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return(b);
}
else
{
return(gcd(b, a % b));
}
}
ll lcm(ll a, ll b)
{
return a * b / gcd... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
int a,s,temp;
cin >> a >> s;
vector <int> b;
for(int i=0;i<s;i++){
cin >> temp;
b.push_back(temp-a);
}
sort(b.begin(),b.end());
temp = 0;
while(temp < s && b[temp]!=0) temp++;
if (temp >=s) ... | 0 | 80,557,529 |
#include <iostream>
using namespace std;
int main(){
int s,n;
while(cin>>n){
s = 0;
for(int i=9;i>=0;i--){
if(n-i>27) break;
for(int j=9;j>=0;j--){
if(n-i-j>18) break;
for(int k=9;k>=0;k--){
if(n-i-j-k>9) break;
if(n-i-j-k>=0) s++;
}
}
}
cout<<s<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,a=0,b=0,counter=0;
cin>>n;
vector<int>p(n),q(n),s(n);
for(int i = 0; i < n; i++) cin >> p[i];
for(int i = 0; i < n; i++) cin >> q[i];
iota(s.begin... | 0 | 31,897,088 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N,d;
string ans="No";
cin>>N;
while(N>0){
d=N%10;
N=N/10;
if(d==7){
ans="Yes";
}
}
cout<<ans;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,x,t;
cin>>n>>x>>t;
ll k=n/x,r=n%x;
if(r>0)r=1;
cout<<k*t+r*t;
} | 0 | 54,756,363 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.