code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m,i,j,d[100005];
int main()
{
scanf("%d%d",&n,&m);
while(m--)
{
scanf("%d%d",&i,&j);
++d[i],++d[j];
}
for(i=1;i<=n;++i)
if(d[i]&1)
{
printf("NO");
return 0;
}
printf("YES");
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <assert.h>
#include <cstdio>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constex... | 0 | 61,693,225 |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
uint32_t n = 0;
std::cin >> n;
std::vector<uint32_t> mat(n + 1);
for (uint32_t i = 0; i < n; i++) {
std::cin >> mat[i] >> mat[i + 1];
}
std::vector<std::vector<uint32_t>> dp(n + 1,
std::vector... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N = 1e3 + 5, MOD = 1e9 + 7;
int a[N][N], h, w, dp[N][N];
void solve(){
cin >> h >> w;
string a[h] = {string(w, '_')};
for(int i = 0; i < h; ++i){
... | 0 | 47,666,764 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<long long int> v;
for (int x = 0; x < n; ++x){
long long int q; cin >> q;
v.push_back(q);
}
sort(v.begin(), v.end());
if (k >= v.size()){
cout << ... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
static const int MAX = 100000;
static const int WHITE = 0;
static const int GRAY = 1;
vector<int> adjList[MAX];
vector<int> out;
int colors[MAX];
int indeg[MAX];
void bfs(int vertexInd, int numVertex){
queue<int> Q;
Q... | 0 | 59,393,079 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9+7;
const int d... | #include <stdio.h>
#include <string.h>
int main()
{
char S[255], T[255];
scanf("%s%s", S, T);
int A,B;
scanf("%d%d", &A, &B);
char U[20];
scanf("%s", U);
int result1 = strcmp(S,U);
int result2 = strcmp(T,U);
if (result1 == 0)
{
A = A - 1;
}
if (result2 == 0)
{... | 0 | 75,973,181 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n+1;i++)
#define sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end())
typedef long long ll;
int main(){
int n;
cin >> n;
vector<pair<int,int>> r(n);
vector<pair<int,int>> ... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 0 | 19,667,427 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<iomanip>
typedef std::pair<double, double> point;
point hoge(point q2, point q4){
point q3;
point r = std::make_pair((q2.first + q4.first)/2, (q2.second + q4.second)/2);
point vec = std::make_pair(-(q4.second - q2.second), q4.fir... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
ll gcd(ll a, ll b){
if(a < b) return gcd(b, a);
ll r = a % b;
while(r != 0){
a = b;
b = r;
r = a % b;
}
return b;
}
ll lcm(ll a, l... | 0 | 29,464,581 |
#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 _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = vector... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,K;
cin >> A >> B >> K;
for(int k=0; k<K; k++){
if(k%2==0){
if(A%2 != 0){ A--; }
int diff= A/2;
A-= diff;
B+= diff;
}
else{
if(B%2 != 0){ B--; }
int diff= B/2;
B-= diff;
A+= diff;
}
}... | 0 | 52,554,656 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
using namespace std;
int main() {
long long a,b;
cin >> a >> b;
if (a == 1 || b == 1) {
cout << "1";
}
else {
cout << (a * b + 1) / 2;
}
} | #include<iostream>
#include<string.h>
using namespace std;
int main(){
char s[205], p[105];
char a[10000];
cin >> s;
cin >> p;
strcat(a, s);
strcat(a, s);
if (strstr(a, p) != NULL){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
} | 0 | 20,435,877 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m; cin >> n >> m;
vector<int>k(m);
vector<vector<int> >s(n);
vector<int>p(m);
for(int i=0;i<m;i++){
cin >> k.at(i);
for(int j=0;j<k.at(i);j++){
int S;
cin >> S;
s.at(S - 1).push_back(i);
}
}
for(int ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
int main(){
std::string s; std::cin >> s;
int K; std::cin >> K;
for (int i = 0; i < K; ++i) {
if (s[i] != '1') {
std::cout << s[i] - '0' << std::endl;
... | 0 | 52,824,662 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> l(n);
rep(i, n) {
cin >> l[i];
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
int n;
cin >> n;
int a[n];
int c[n];
rep(i,n) c[i]=0;
rep(i,n){
cin >> a[i];
c[--a[i]]++;
}
... | 0 | 69,258,049 |
#include<iostream>
#include<cmath>
using namespace std;
const long long size=2e5+1;
long long a[size],x[size];
long long n,s;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
x[i]=x[i-1]+a[i];
s+=a[i];
}
long long min=2e10+5,result;
for(int i=1;i<n;i++)
{
result=abs(2*x[i]-s);
if(min>res... | #include <iostream>
#include <math.h>
using namespace std;
bool p[1000000];
void primes() {
for (int i = 0; i < 1000000; i++) {
p[i] = true;
}
p[0] = p[1] = false;
for (int i = 2; i < sqrt(999999); i++) {
if (p[i]) {
for (int j = i * 2; j < 1000000; j += i) {
... | 0 | 59,316,742 |
#include<bits/stdc++.h>
#define rep(i,N) for(ll (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;
typedef pair<int,int> P;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<ll> ch(26);
rep(i, n) {
... | #include <stdio.h>
#include <iostream>
using namespace std;
long long a[100010];
long long mask[61];
int main()
{
int n;scanf("%d",&n);
for (int i=0;i<n;++i)
scanf("%lld",&a[i]);
long long ans=0;
long long tmp=0;
for (int i=0;i<n;++i)
tmp^= a[i];
ans=tmp;
tmp= (1LL << 61)-1-t... | 0 | 16,495,576 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int A, B, a, b;
cin >> A >> B >> a >> b;
cout << a-(b-B) << endl;
cout << b+(a-A) << endl;
cout << a-(b-B)-(a-A) << e... | #include <bits/stdc++.h>
const int MAXN = 100010;
int head[MAXN], to[MAXN << 1], nxt[MAXN << 1], tot;
void addedge(int b, int e) {
nxt[++tot] = head[b]; to[head[b] = tot] = e;
nxt[++tot] = head[e]; to[head[e] = tot] = b;
}
int dfs(int u, int b = 0, int fa = 0) {
int sc = 0;
for (int i = head[u]; i; i = nxt[i]) if (... | 0 | 47,583,431 |
#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;
static const int INF (1<<30);
ll get_min(ll h, ll w) {
ll y = INF;
for (int x = 1; x <= w-2; x++) {
ll s1 = x * h;
ll s2, s3;
if (w-x % 2 == 0) {
... | #include<bits/stdc++.h>
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define ff first
#define ss second
#defin... | 0 | 55,996,555 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#in... | #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;
int cnt = 1;
int now = 10;
int n = N;
int ans = 0;
while(n / now != 0){
if(cnt % 2 == 1){
int x = pow(10,... | 0 | 24,438,525 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define f first
#define s second
#define go ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int main()
{
ll t;
map<string,ll>mp;
cin>>t;
t--;
string str;
cin>>str;
char ch=str[str.size()-1];
m... | 0 | 62,418,447 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const ll MOD = 1e9 + 7;
int n, x, y;
vector<int> G[100009];
ll dp[100009][2];
int vis[100009];
void solve(int v)
{
vis[v] ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
llong n;
llong ans = 0;
int main() {
... | 0 | 41,371,232 |
#include<stdio.h>
int main(){
int a;
scanf("%d",&a);
long long int b=1;
for(int i=0;i<a;)b*=++i;
printf("%lld\n",b);
} | #include <bits/stdc++.h>
using namespace std;
#define LL long int
#define ULL unsigned long int
#define LD long double
LL MOD = 1000000007;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; ++i) cin >> a[i];
sort(a.begin(),a.end());
int ans = 0;
vector<int> num(a.back() + ... | 0 | 33,509,266 |
#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 inf 1e18
typedef tree<int, null_type, less<int>, rb_tree_tag, tree... | #include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<deque>
#include<map>
#include<queue>
using namespace std;
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define pb push_back
#define fi first
#define se second
type... | 0 | 35,118,527 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define debug(x) cerr<<#x<<'='<<x<<'\n'
long long a[66];
const long long n=50;
int main(void) {
long long k;
cin>>k;
for (int i=1; i<=n; i++) {
a[i]=i+k/n-1;
}
k%=50;
for (int i=1; i<=k; i++) {
a[i]+=n+1;
}
pu... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using nam... | 0 | 36,503,125 |
#include <cstdio>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++){
char mcxi_a[128];
char mcxi_b[128];
int sum = 0;
scanf("%s %s", mcxi_a, mcxi_b);
int i = 0;
while (mcxi_a[i] != '\0'){
switch (mcxi_a[i]){
case 'i':
if (i > 0 && mcxi_a[i - 1] >= '2' && mcx... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
const ll MOD = 1000000007;
int main(){
ll n,k;
cin >> n >> k;
double sum;
for(int i=1;i<=n;i++){
ll now = i;
double p;
if(now>=k) p=1;
else{
p=1;
while(n... | 0 | 35,123,692 |
#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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | #include<bits/stdc++.h>
using namespace std;
#define ANSWER(x) cout<<x<<endl
#define debug(x) cout<<#x<<": "<<x
typedef pair<int,int> P;
void bfs(int sx,int sy);
int H,W,N,a;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
int cheese_x[10];
int cheese_y[10];
char ch[1001][1001];
int al[1001][1001];
int S_x,S_y,hp = 1,d... | 0 | 47,992,819 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
ll n, k, a, b;
cin >> n >> k;
a = n / k;
b = (n + k / 2) / k;
... | #include <bits/stdc++.h>
#define ll long long int
#define rep(i,a,b) for(long long i=a; i<b; i+=1)
#define repr(i,a,b) for(long long i=a; i<=b; i+=1)
#define vec vector<ll>
#define map map<char,int>
#define repa(p,A) for(auto p:A)
#define pb push_back
#define sort(a) sort(a.begin(),a.end())
#define reverse(a) reverse(a... | 0 | 21,054,816 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define For(i, a, b) for(int i = (a); i < (b); i++)
#define Rep(i, n) For(i, 0, (n))
const int inf = 999999999;
const ll m... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
vector<pair<int,int>> work;
for(int i=0; i<n; i++){
int a,b;
cin >> a >> b;
pair<int, int> p = make_pair(a,b);
work.push_back(p);
}
sort(work.begin(), work.end()... | 0 | 12,697,627 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
const int MOD = 1000000007;
int main() {
string s; cin >> s;
for(int i = 0; i < s.length();i++){
if(i % 2 == 0){
cout << s[i];
}
}
} | #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 | 28,608,004 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reprl(i, n) for(ll i = n; i >= 0; i--)
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
int countBits(int in){
int res=0;
for(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;... | 0 | 4,365,450 |
#include<iostream>
using namespace std;
int main(){
string s;
cin>>s;
for(int i=0;i<s.length();i++){
if(s[i]=='1') s[i]='9';
else if (s[i]=='9') s[i]='1';
}
cout<<s<<endl;
} | #include<iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(){
int N, A, B_prev, B;
long long ans = 0;
std::cin >> N;
vector<int> Bs(N);
for(int i = 0; i < N-1; i++){
std::cin >> B;
if(i == 0){
ans = ans + B;
}else{
ans = ans + mi... | 0 | 75,762,720 |
#pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define sz(x) (int)(x).size();
#define all(x) x.begin(), x.end()
#define trav(i,a) for(auto &i:a)
inline int in(){int x;scanf("%lld",&x);return x... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define MOD 1000000007
#define P... | 0 | 79,814,521 |
#include <bits/stdc++.h>
using namespace std;
const long long md=1e9+7;
long long a[505][505],n,h,w;
void show(){
for(int i=0;i<h;++i,cout<<'\n')
for(int j=0;j<w;++j)
if(a[i][j]==1) cout<<'R';
else if(a[i][j]==2) cout<<'Y';
else if(a[i][j]==3) cout<<'G';
else if(a[i][j]==0) cout<<'B';
}
int main(){
long... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int A[n];
for (int i = 0; i < n; ++i) {
int v;
scanf("%d", &v);
A[i] = v;
}
int L[n];
L[0] = A[0];
int length = 1;
for (int i = 1; i < n; ++i) {
if (L[length - 1] < A[i]) {
L[length++] = A[i];
} else {
... | 0 | 45,743,561 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}... | #include <iostream>
#include <string>
#include <string.h>
using namespace std;
int main(){
int n;
cin >> n;
for(int i=0;i<n;i++){
string str1, str2;
string ans;
cin >> str1 >> str2;
int str_i=0, str_x=0, str_c=0, str_m=0;
char c1[9],c2[9];
strcpy(c1, str1.c_str());
strcpy(c2, str2.c_st... | 0 | 90,925,461 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> broken(N + 1);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(N + 2);
dp[N] = 1;
for (int i = N - 1; i >= 0; i--) {
if (broken[i... | #include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using ll = long long;
usi... | 0 | 3,840,890 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string str[10] = {
".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"
};
int n;
cin >> n;
while( n-- ){
string s;
cin >> s;
for(int i = 0; i < s.size(); i++){
if(s[i] == '0') continue;
int j = 0;
while( s[i+j] !... | #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);
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 yes c... | 0 | 73,242,281 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
int main()
{
string s;cin>>s;
int i,j;
if(s.size()==26)
{
bool ok=false;
vector<char> suf(0);
suf.emplace_back(s[25]);
for(i=24;i>=0;i--)
{
if(s[i]<s[i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
int main()
{
cin.tie(0);
ios_ba... | 0 | 13,603,261 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
ll digit_sum(ll a){
ll ans=0;
wh... | #include<stdio.h>
int main(void)
{
int mansions[4][3][10];
int m,w,h,d;
int n;
int i,j,k;
for(m = 0;m < 4;m++){
for(h = 0;h < 3;h++){
for(w = 0;w < 10;w++){
mansions[m][h][w] = 0;
}
}
}
scanf("%d",&n);
for(i = 0;i < n;i++){
... | 0 | 41,337,143 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <cstdlib>
#inclu... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vec vector<int>
#define map map<int,int>
#define scn(t) scanf("%d",&t);
#define lscn(t) scanf("%lld",&t);
#define mod 1000000007
#define rep(i,a,b) for(int i=a;i<b;i++)
#define endl "\n... | 0 | 98,005,456 |
#include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
int kyu[] = {2000, 1800, 1600, 1400, 1200, 1000, 800, 600, 400};
for (int i = 0; i < 9; i++) {
if (X >= kyu[i]) {
cout << i << endl;
break;
}
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
map<int, int> mp;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
sort(a.begin(), a.end());
if (a[a.size() - 1] != a[a.size() - 2]) {
puts("Imp... | 0 | 58,407,887 |
#include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const int maxn=2e5+10;
int f[maxn];
int q(int a, int b){
int ans = 1;
while(b){
if(b&1)ans = 1ll*ans*a%mod;
a=1ll*a*a%mod;
b>>=1;
}
return ans;
}
int main(){
ll ans, n, k;
cin >> n >> k;
ans=0;
for(ll i=k;i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,i,j,k=0,l,x;
scanf("%lld\n",&n);
x=n+1;
for(i=0;i<n;i++)
{
scanf("%lld",&j);
if(j<x)
{
k++;
x=j;
}
}
printf("%lld",k);
return 0;
} | 0 | 96,462,024 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string szo;
cin >> szo;
if (szo[2] == szo[3]) {
if (szo[4] == szo[5]) {
cout << "Yes";
} else {
cout << "No";
}
} else {
cout << "No";
}
return 0;
} | #include <iostream>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int x, y;
cin >> x >> y;
int firstB[2] = {-1, 1}, secondB[2] = {-1, 1};
int ans = 2000000000;
int tmpx, tmpy;
rep(i, 2){
rep(j, 2){
int tmp = 0;
tmpx = x*firstB[i];
if(firstB[i] == -1)
tmp++;... | 0 | 94,540,531 |
#include <cstdio>
#include <string>
using namespace std;
int main(void){
int n, m, i, j;
char org[257], x, y;
while(1){
scanf("%d%*c",&n);
if(!n){
break;
}
for(i = 0;i < 256;i++){
org[i] = (char)i;
}
for(i = 0;i < n;i++){
scanf("%c%*c%c%*c",&x,&y);
org[x] = y;
}
scanf("%d%*c",&m);
for(i... | #include<stdio.h>
int main()
{
int N;
scanf("%d",&N);
char S[100];
int total;
scanf("%s",&S);
for (int i=0;i< N/2;i++){
if (S[i] == S[i + N/2]){
total++;
}
}
if (N % 2 == 1) {
printf("No");
return 0;
}
total == N/2 ? printf ("Yes\n") : printf ("No\n");
return 0;
} | 0 | 66,421,930 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
cin.sync_with_stdio(false); cin.tie(... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | 0 | 9,710,070 |
#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 <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0);
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> a(3, vector<int>(n));
fo... | 0 | 62,964,470 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int n, x;
bool a[105];
int main() {
cin >> x >> n;
for (int i=0; i<n; i++) {
int t; cin >> t; a[t]=1;
}
int d=0;
while (true) {
if (!a[x-d]) {cout << x-d; return 0;}
if (!a[x+d]) {cout << x+d; return 0;}
d++;
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
int main(){
ll n ; cin >> n;
vector<ll> a(n);
rep(i,n... | 0 | 79,934,027 |
#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 A, B;
cin >> A >> B;
int ans = -1;
rep(i,1500) {
int tax8 = i * 8 / 100.0;
int tax10 = i * 10 / 100.0;
if (tax8 == A && tax... | #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;
const long long MOD = 1000000007;
#define SET(x) memset(x, 0, sizeof(x))
#define SET2d(x,m,n) memset(x, 0, sizeof(x[0][0]) * m * n)
#define SETBOOL(x) memset(x,false,siz... | 0 | 68,359,052 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
const int INF = 1e9+7;
int n;
cin>>n;
vector<vector<int>> inp(n,vector<int>(3)), dp(n,vector<int>(3,0));
for(int i=0;i<n;++i){
cin>>inp[i][0]>>inp[i][1]>>inp[i][2];
}
dp[0][0] = inp[0][0];
dp[0][1] = inp[0][... | #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 | 14,218,372 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
ll x;
... | # include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | 0 | 74,751,802 |
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
char a[H][W];
for ( int i = 0; i < H; ++i){
for ( int j = 0; j < W; ++j){
cin >> a[i][j];
}
}
int hcount = 0;
bool flg = true;
vector<int> h(H,0);
for ( int i = 0; i < H; +... | 0 | 70,186,722 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define MAX_C 1000000001
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
ll cost = 1000000000LL * 30;
for (int i = 0; i < (1 << (n-1)); i++) ... | #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 | 59,656,768 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
const double INFD = 1e100;
const ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -... | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | 0 | 51,296,839 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n, r1, r2, r3, r4, r5, r6, r7, r8, r9, sum;
cin >> n;
r1 = n%10;
r2 = (n%100)/10;
r3 = (n%1000)/100;
r4 = (n%10000)/1000;
r5 = (n%100000)/10000;
r6 = (n%1000000)/100000;
r7 = (n%10000000)/1000000;
r8 = (n%100000... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 0 | 91,203,850 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
#include <numeric>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#d... | 0 | 29,678,560 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typename T> using VV = vector<vector<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#defi... | 0 | 68,224,174 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll A,B; cin >> A >> B;
if(A%2==... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<typename T>
using vector2d = vector<vector<T>>;
template <typename X>
X BinSearch(X left, X right, function<bool(X)> judge, bool lower = true, X eps = 1) {
... | 0 | 20,083,847 |
#include<iostream>
using namespace std;
#include <ctype.h>
int main(){
char c; cin >> c;
if (isupper(c)) c = 'A';
else c = 'a';
cout << c << endl;
} | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int main()
{
int n, k;
cin >> n;
string s;
cin >> s;
cin >> k;
for(int i = 0; i < s.size(); i++... | 0 | 53,887,426 |
#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(ll i=(a);i<(b);++i)
#define rep(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typed... | #include<bits/stdc++.h>
using namespace std;
int n,b[105];
int ans;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n-1;++i)
scanf("%d",&b[i]);
for(int i=2;i<=n-1;++i)
ans+=min(b[i-1],b[i]);
ans+=b[1]+b[n-1];
printf("%d\n",ans);
return 0;
} | 0 | 27,319,371 |
#include <bits/stdc++.h>
using namespace std;
long long x[10000010], y[10000010];
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i < (n)i++)
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define int long long
#define setout(n, x) setw(n) << setfill(x)
#define Fixed... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using pint = pair<int,int>;
using pll = pair<ll,ll>;
using Graph = vector<vector<int>>;
int main(){
... | 0 | 21,486,324 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,ma,mi; cin>>n>>a;
ma=a; mi=a;
for(int i=1; i<n; i++){
cin>>a;
ma=max(ma,a),mi=min(mi,a);
}
cout<<ma-mi;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
int d[] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
signed main(){
i... | 0 | 49,904,738 |
#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 <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FO... | 0 | 68,817,652 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
using namespace std;
int N, i;
int main() {
ci... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int GCD(ll a, ll b){
if(a<b){swap(a,b);}
if(a%b==0){return b;}
else{return GCD(a%b,b);}
}
int main(){
ll n;cin>>n;
vector<ll> vec(n+1);
rep(i,n+1){cin>>vec.... | 0 | 61,284,521 |
#include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int main(){
long long n;
cin >> n;
long long m = n;
int sum = 0;
while(true){
sum += n % 10;
n /= 10;
if(n == 0) break;
}
if( m % sum == 0) ... | #include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <queue>
#include <queue>
#include <stack>
#include <sstream>
#include <set>
typedef long long ll;
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
const... | 0 | 35,731,495 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define data pair<int,pii>
int N;
vector<data> V;
signed main()
{
cin >> N;
rep(i, N)
{
int a, b;
cin >> a >> b;
V.push_back({a + b, {a, b}});
}
... | #include<algorithm>
using namespace std;
#define MAXN 100000
int AC[MAXN] = {};
int WA[MAXN] = {};
int main()
{
int ACCount = 0;
int WACount = 0;
int n,m;
scanf("%d %d",&n,&m);
for(int i = 0; i < m; i++)
{
int curNum;
char first, second;
scanf("%d %c%c", &curNum, &first, ... | 0 | 41,267,289 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n;
cin >> n;
vector<ll> T(n, 0);
vector<ll> A(n, 0);
for(ll& val... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin>>S>>T;
for(int i=S.size()-T.size();i>=0;i--){
bool bo=false;
for(int j=0;j<T.size();j++)
if(T[j]!=S[i+j] && S[i+j]!='?'){
bo=true;
break;
}
if(bo)
continue;
for(int j=0;j<S.size();j++){
... | 0 | 96,399,898 |
#include <iostream>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
#include<string>
#include<cassert>
#include<cmath>
#include<climits>
#include<iomanip>
#include<bitset>
using namespace std;
#define MOD 1000000007
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
const int MAX = 1000001;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
fo... | 0 | 95,624,744 |
#include <bits/stdc++.h>
using namespace std;
#define INF (1<<31)-1
#define LINF (1LL<<63)-1LL
#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;}
#defi... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | 0 | 20,126,838 |
#include <iostream>
#include <cstdio>
#include <deque>
#define int long long
using namespace std;
bool vis[100005];
signed main() {
int n; cin >> n;
deque<pair<int, int> > q; q.push_front(make_pair(1, 1));
while (!q.empty()) {
pair<int, int> p = q.front(); q.pop_front();
if (vis[p.first]) continue; vis[p.first] ... | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
long long int a,b,k;
cin>>a>>b>>k;
for(int i=1;i<=k;i++)
{
if(i%2==0)
{
if(b%2==0)
{
a=a+(b/2);
b=b-(b/2);
}
... | 0 | 43,959,940 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll n;
cin >> n;
map<ll,ll> rec;
vector<ll> c(n);
vector<ll> v(0);
for(long long i = 0; i < n; i++){
cin >> c[i];
}
for(long long i = 0; i < n;... | 0 | 32,101,640 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> p;
typedef unsigned long long i... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N; cin >> N;
for (int i = N; i <= 999; i++) {
int num = i;
int a = num / 100;
num = num % 100;
int b = num / 10;
num = num % 10;
if (a == b && b == nu... | 0 | 61,222,335 |
#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<ll, ll>;
const int INF = 0x3f3f3f3f;
int main() {
int k, x;
cin >> k >> x;
if (k * 500 < x)
cout << "No" <<... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 35,814,963 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
string s;
ll k;
cin >> s >> k;
for (ll i = 0; i < k; i++) {
if (s[i] != '1') {
cout << s[i] << endl;
return 0;
}
}
cout << 1 << endl;
return 0... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
#define rept(_i,iv,n,type) for(type _i=(type)(iv);_i<(type)(n);++_i)
#define rept0(_i,n,type) rept(_i,0,n,type)
#define repi0(_i,n) rept(_i,0,n,int)
#define repl0(_i,n) rept(_i,0,n,ll... | 0 | 99,566,349 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
long long L,R;
cin >> L>>R;
long long min = 2019;
for(long long i = L;i<=R;i++){
for(long long j = L;j<=R;j++){
if(i==j) continue;
if((i*j)%2019== 0){
... | #include <bits/stdc++.h>
#include <vector>
#include <cmath>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP2(i, m, n) for (int i = (m); i < (int)(n); ++i)
#define REPR(i, n) for (int i = (n)-1; i >= 0; --i)
#define REPR2(i, m, n) for (int i = (n)-1; i >= (m); --i)
#define REPx(x, a) for(auto x : a)
#de... | 0 | 46,029,839 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
using ll = long long;
int main() {
ll s,c; cin >> s >> c;
ll a = min(s, c / 2);
ll b = (c - (a*2)) / 4;
cout << a+b << endl;
return 0;
} | #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{
... | 0 | 53,277,719 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n; cin >> n;
long long L[100];
L[0] = 2; L[1] = 1;
for(int i=2;i<=n;++i) {
L[i] = L[i-1] + L[i-2];
}
cout << L[n] << endl;
} | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 62,111,845 |
#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 0 | 89,120,152 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int enum_divisors(int N)
{
vector<int> res;
for (int i = 1; i * i <= N; ++i)
{
if (N % i == 0)
{
res.push_back(i);
if (N ... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
t... | 0 | 50,016,002 |
#include <iostream>
template<class T> T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a%b);
}
int main() {
long long a, b; std::cin >> a >> b;
long long g = gcd(a, b);
long long ans = a * b / g;
std::cout << ans << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int dx[4] = {0,-1,0,1};
int dy[4] = {-1,0,1,0};
ll gcd(ll a,ll b){
if(b>a) swap(a,b... | 0 | 88,070,069 |
#include<bits/stdc++.h>
using namespace std;
int main() {
priority_queue<int>num;
string command;
int n;
while(1){
cin>>command;
if(command.compare("insert") == 0){
cin>>n;
num.push(n);
}
if(command.compare("extract") == 0){
cout<<num.top()<<endl;
num.pop();
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
templat... | 0 | 89,786,834 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
using namespace std;
const long long MOD = 1000000007;
struct WBK {
int x;
int y;
int m;
};
int main(){
int A,B,M;
cin >> A >> B >> M;
vector<int> a(A),b(B);
WBK m[M];
int a_min=999999;
for(int i=0;i<A;i++... | #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... | 0 | 18,693,077 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int X[3];
int main() {
for (int i = 0; i < 3; ++i) {
cin >> X[i];
}
sort(X, X + 3);
int ba = X[1] - X[0];
int ca = X[2] - X[0];
int cb = X[2] - X[1];
if (cb % 2 == 0 && ca % 2 == 0) {
printf("%d\n", (ca + cb) / 2);
... | #include<bits/stdc++.h>
using namespace std;
#define rg register
#define rep(i,a,b) for (rg int i=(a);i<=(b);i++)
#define per(i,a,b) for (rg int i=(b);i>=(a);i--)
#define pb push_back
#define lowbit(x) (x&(-x))
#define replow(i,a,b) for(rg int i = (a);i<=(b);i+=lowbit(i))
#define perlow(i,a,b) for(rg int i = (b);i>=(a)... | 0 | 95,832,346 |
#include <iostream>
#include <vector>
#define VERTEX_NUM_MAX 101
using namespace std;
typedef vector<int> Vertex;
int n;
Vertex vs[VERTEX_NUM_MAX];
int ds[VERTEX_NUM_MAX];
void _bfs(vector<int>& targets, int distance) {
vector<int> next_targets;
for(auto it = targets.begin(); it != targets.end(); it++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int main(... | 0 | 46,600,379 |
#include <string.h>
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n = 0, taro_point = 0, hanako_point = 0;
char taro_card[100 + 1] = { 0 },
hanako_card[100 + 1] = { 0 };
cin >> n;
for (int i = 0; i < n; i++) {
cin >> taro_card >> hanako_card;
int result = strcmp(taro_card, hanako... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n){
vector<pair<string,bool> >v;
string a,b;
for(int i=0;i<n;i++){
cin>>a>>b;
v.push_back(make_pair(a,1));
v.push_back(make_pair(b,0));
}
sort(v.begin(),v.end());
int ans=0,k=0;
string ts;
... | 0 | 36,899,891 |
#include <bits/stdc++.h>
using namespace std;
#define froop1(a,n) for(int i = a;i < n;i++)
#define froop2(a,n) for(int i = a;i > n;i--)
int main(){
long long N;
cin >> N;
vector<long long> a;
froop1(1,sqrt(N) + 1){
if(N % i == 0){
a.push_back(N / i);
}
}
sort(a.begin(),a.end());
int count = ... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e9;
const long long int mod = 1e9+7;
typedef pair<ll,ll> pairs;
vector<pairs> p;
ll gcd(ll a,ll b){
if (a%b==0)return(b);
else return(gcd(b,a%b));
}
ll keta(ll N){
int tmp{};
while(... | 0 | 18,383,389 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 5, mod = 1e9 + 7;
int N;
vector<int> adj[MAXN];
ll dp[MAXN][2];
ll rec(int u, int p, int c)
{
if (dp[u][c] != -1)
return dp[u][c];
ll tot = 0, ways = 1;
for (int v : adj[u])
{
if (v == p)
continue;
ways = ways * rec(... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N;
cin>>N;
vector<int> A(N);
int a=0,b=0;
for(int &i:A){
cin>>i;
if(i>0)a++;
else b++;
}
sort(A.begin(),A.end());
vector<pair<int,int>> B;
if(a==N){
for(int i=2;i<N;i++){
B.push_back({A[0],A[i]}... | 0 | 89,169,077 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <list>
using namespace std;
int main() {
list<int> ls; char c[21];
int n; cin >> n;
while (n--) {
scanf("%s", c);
if (c[0] == 'i') { int t; scanf("%d", &t); ls.push_front(t); }
else if (c[6] == 'F') ls.pop_front();
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) cin >> S[i];
int ans = 0;
for (int i = 0; i < N; i++) {
bool check = true;
for (int j = 0; j < N; j++) {
for (int k = j; k ... | 0 | 89,079,322 |
#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>
using namespace std;
#pragma region
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {c... | 0 | 65,965,544 |
#include <bits/stdc++.h>
int main(){
int N;
std::cin >> N;
std::vector< int > cnt(N+1, 0);
for(int i=2; i<=N; i++){
int cur = i;
for(int j=2; j*j<=N; j++){
while(cur % j == 0){
cur /= j;
cnt[j]++;
}
if(cur == 1){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll N, K;
vector<ll> gems;
ll maxi = 0;
cin >> N >> K;
gems.resize(N);
for(ll i = 0;i < N;i++) cin >> gems[i];
for(ll a = 0;a <= min(N, K);a++) {
... | 0 | 40,560,799 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
using namespace std;
int syc(long i,long Min,long Max){
if(Min <= i && i <= Max){
return 1;
}else{
exit(1);
}
}
int main(){
int n,m,x,y;
cin >> n >> m >> x >> y;
syc(n,1,100);
syc(m,1,100);
syc(x,-1... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
#define mx 100009
ll ar[mx][3];
ll mem[mx][3];
ll n;
ll dp(ll ind,ll f){
if(ind>=n) return 0;
else if(mem[ind][f]!=-1) return mem[ind][f];
ll ans=0;
if(f==0){
ll x=ar[ind+1][1]+dp(ind+1,1);
ll y=ar[ind+1][2]+dp(ind+1,2);
... | 0 | 64,331,426 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool alphabets[26];
fill(alphabets, alphabets + 26, false);
for (int i = 0; S[i] != '\0'; i++) alphabets[S[i] - 'a'] = true;
for (int i = 0; i < 26; i++) {
if (alphabets[i] == false) {
cout << (char)(i + 'a') << endl;
... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typ... | 0 | 82,408,696 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int A, B, C;
cin >> A >> B >> C;
for(int i = 0; i < B; ++i){
if((A*i)%B==C) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
const int N = 102, K = 4;
ll dp[N][K][2];
char s[N];
int k, n;
ll rec(int x, int cnt, int f) {
if (x == n) {
return cnt == k;
}
if (cnt > k) return 0;
ll &ret = dp[x][cnt][... | 0 | 83,235,047 |
#include <stdio.h>
int main(){
int array[10][10];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
scanf("%d", &array[i][j]);
}
}
int brpKali;
scanf("%d", &brpKali);
int percobaan[100];
for(int k=0;k<brpKali;k++){
scanf("%d", &percobaan[k]);
}
for(int l... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#define ffor(_a,_f,_t) for(int _a=(_f),__t=(_t);_a<__t;_a++)
#define all(_v) (_v).begin() , (_v).end()
#define sz size()
#define pb push_back
#define SET(__set, val) memset(__set, val, sizeo... | 0 | 56,308,221 |
#include<bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
long gcd(long a,long b){
if (a%b==0){
return(b);
}
else{
return(gcd(b,a%b));
}
}
long lcm( long m, long n ){
if ( ( 0 == m ) || ( 0 == n ) )
return 0;
return ((m / gcd(m, n)) * n);
}
int main(){
long ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define int long long
#define f0(n) for(int i=0;i<n;i++)
#define ms(x) memset(x,0,sizeof(x))
#define ms2d(x,m... | 0 | 62,486,634 |
#include<iostream>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
int c=0;
for(int i=0;i<s.length();i++)
{
if(s[i]==t[i])
c++;
}
cout<<c;
} | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define prec(n) fixed<<setprecision(n)
#define n_l '\n'
#define gcd... | 0 | 92,141,981 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
bool compPair(const pair<int, int>& arg1, const pair<int, int>& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a =... | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cstdio>
#include <cctype>
#include <queue>
#include <cmath>
#include <stack>
using namespace std;
const int inf = 0x3f3f3f3f, N = 20;
int e[N][N];
void floyd(int n)
{
for(int k = 0; k <= n; k++)
for(i... | 0 | 8,892,146 |
#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... | #include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
char c[1001][1002];
int d[1000001];
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%s",c[i]+1);
queue<int>q;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(c[i][j]=='#'){
q.push((i-1)*m+j);
d[(i-1)*m+j]... | 0 | 75,176,590 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, c, k;
cin >> n >> c >> k;
vector<ll> t(n);
rep(i, n) cin >> t[i];
sort(t.begin(), t.end());
vector<bool> done(n, false);
ll cnt = 0;
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
sort(a.begin(),a.end());
int x = 1;
vector<int> cards;
for(int i=0; i<n; i++){
if(a[i] == a[i+1]) x += 1;
if(a[i] != a[i+1]){
... | 0 | 76,019,556 |
#include <bits/stdc++.h>
using namespace std;
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 (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define re... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | 0 | 80,480,389 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<en... | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
#define MAX 505
typedef long long ll;
int main(int, char**)
{
int n, m;
cin >> n >> m;
int ofs = 0;
int fst, snd;
rep(i,m) {
fst = i + ... | 0 | 64,345,015 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a , b ,c, d ;
cin >> a >> b >> c >> d ;
if ( abs(a-c)< abs(c-b)){
cout << " Yes";
}
else if ( abs(a-b)<= d && abs( b-c)<=d ) {
cout<<"Yes";
}
else {
cout<< "No";
}
return 0 ;
} | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] =... | 0 | 49,715,143 |
#include<stdio.h>
int N,S;
int f(int n,int m,int s){
if(m==10){
if(S==s&&N==n)return 1;
return 0;
}
return f(n,m+1,s)+f(n+1,m+1,s+m);
}
int main(void){
while(1){
scanf("%d%d",&N,&S);
if(N==0&&S==0)break;
printf("%d\n",f(0,0,0));
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) ((in... | 0 | 79,345,961 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
int prev = 0; long long ans = 0;
for (int i = 0; i < n; i++) {
int t = prev + 1;
int s = v[i] - t;
if (s > 0) {
ans += (s + t-1) ... | 0 | 76,843,007 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int ans =1;
while(n>0){
if(ans > k){
ans += k;
}else{
ans *=2;
}
n--;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using ll = long long;
#include<bits/stdc++.h>
void solve(long long N, long long K, std::vector<long long> A){
for(int i = 0;i < K;i++){
vector<ll> B(N);
for(int i ... | 0 | 58,298,207 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int k,n;
cin >> k >> n;
vector<int> l(k);
int i;
for(i=0;i<k;i++) cin >> l[i];
sort(l.begin(),l.end());
int cnt = 0;
for(i=0;i<n;i++) cnt += l[k-i-1];
cout << cnt << "\n";
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define N 200010
using namespace std;
inline int read()
{
int x=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
int n,m,v,p;
int a[N],tmp[N],add[N];
inline int check(int... | 0 | 74,859,182 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.