code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int A[N+1];
for(int i = 1; i <= N; i++) cin >> A[i];
int res = 0;
for(int i = 1; i < N; i++)
{
if(A[i] == A[i+1])
{
A[i+1] = -1;
res++;
}
}
cout << res << '\n';
... | #include <iostream>
using namespace std;
static void Sub_QuickSort(int* pnData, int nFirst, int nLast);
void QuickSort(int* pnData, int nNumOf)
{
Sub_QuickSort(pnData, 0, nNumOf - 1);
}
int main(void){
int n;
while(1){
cin >> n;
if(n==0){
break;
}else{
int a[n... | 0 | 62,100,542 |
#include <iostream>
using namespace std;
typedef long long llong;
void solve_test()
{
char a, b, c;
cin >> a >> b >> c;
if (a == b && a != c) cout << "Yes\n";
else if (a == c && a != b) cout << "Yes\n";
else if (b == c && b != a) cout << "Yes\n";
else cout << "No\n";
}
int main()
{
ios_base::sync_with_stdio(fals... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main() {
int N, K; cin >> N >> K;
string S; cin >> S;
vector<int> nums;
if (S[0] == '0') nums.push_b... | 0 | 93,398,959 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main() {
int k,s; cin >> k >> s;
... | #include <iostream>
#include <math.h>
#include <cstdio>
#include <utility>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
int array[4][3][10];
int main() {
int n;
cin>>n;
for(int i=0; i<n; i++){
int a,b,c,d;
cin>>a>>b>>c>>d;
array[a-1][b-1][c-1]+=d;
}
for(int i=0; ... | 0 | 26,301,752 |
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
#ifndef UTIL_HPP
#define UTIL_HPP
typedef ::std::int_fast64_t i64;
typedef ::std::uint_fast64_t u64;
typedef ::std::int_fast32_t i32;
typedef ::std::uint_fast32_t u32;
namespace tools {
template ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
set<char> set;
bool b = false;
for (char c : s) {
if (set.find(c) == set.end())
set.insert(c);
else {
b = true;
break;
}
}
cout << (b ? "no" : "yes") << ... | 0 | 64,832,749 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int,int> PI;
typedef pair<int,pair<int,int>> PII;
static const int INF=1010000000000000017LL;
static const double eps=1e-12;
static... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 7,117,599 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
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 PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int ma... | #include <iostream>
using namespace std;
int main(){
int n, now, count;
while(1){
cin >> n;
now = 0;
count = 0;
if(n==0) break;
while(1){
if(1000-n-now >= 500){
now += 500;
count++;
} else if (1000-n-now >= 100){
now += 100;
count++;
} else if (1... | 0 | 10,617,133 |
#include <iostream>
#include <vector>
using namespace std;
typedef unsigned long long u64;
typedef signed long long l64;
u64 binpow(u64 n, u64 x, u64 mod)
{
u64 tgt = 1;
u64 dig = n;
while (x > 0) {
if (x%2) {
tgt = (tgt * dig) % mod;
}
dig = (dig * dig) % mod;
x /= 2;
}
return tgt;
}
cl... | #include<cstdio>
#include<vector>
using namespace std;
int main(){
for(;;){
int a,b,n;
scanf("%d%d",&a,&b);
if(a==0&&b==0)break;
vector<vector<int> > ps(a,vector<int>(b,0));
scanf("%d",&n);
int x,y;
for(int ix=0;ix<n;ix++){
scanf("%d%d",&x,&y);
... | 0 | 98,914,032 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
double x1,x2,y1,y2,d;
cin>>x1>>y1>>x2>>y2;
d=sqrt(pow(x1-x2,2.0)+pow(y1-y2,2.0));
printf("%10f\n",d);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main()
{
FASTINOUT;
ll a,b,k;
cin>>a>>b>>k;
bool t=1;
while (k--)
{
if (t)
{
if (a&1)
... | 0 | 2,759,896 |
#include <bits/stdc++.h>
#define LL long long
#define PII pair<int,int>
using namespace std;
const int MAXN = 100000;
const int INF = 1e9 + 5;
int dist[10][10];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int M;
while (scanf("%d", &M) == 1 && M) {
for (int i = 0; i < 10; i++) {
fill(dist[i], dist[i] ... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
long long drops = 0;
scanf("%lld", &n);
long long onemove = n;
onemove *= n + 1;
onemove /= 2;
long long tal = 0;
long long val[n];
for(long long i = 0; i < n; i++){
scanf("%lld", &val[i]);
tal += ... | 0 | 91,537,540 |
#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 <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <limits.h>
using namespace std;
int N;
long long int K;
int P[5001];
long long int C[5001];
long long int Max=LLONG_MIN;
int main(){
cin >> N >> K;
for(int i=1;i<=N;i++)cin >> P[i];
for(int i=1;i... | 0 | 58,471,438 |
#include <stdio.h>
#include <math.h>
int main(){
double x1,y1,x2,y2;
scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
printf("%f\n",sqrt((pow(x2-x1,2.0)+pow(y2-y1,2.0))));
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 0 | 29,683,601 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 998244353
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N, M, R; cin >> N >> M >> R;
vect... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
int a,b,c,n;
int ans = 0;
while(cin>>n){
ans = 0;
for(a=0;a<=9;a++){
for(b=0;b<=9;b++){
for(c=0;c<=9;c++){
if(n-(a+b+c) <= 9 && n-(a+b+c)>=0)
ans++;
... | 0 | 3,833,132 |
#include<cstdio>
int a[100005], b[100005];
int main(){
int n,k;
scanf("%d%d",&n,&k);
for(int i = 1; i <= n; i++) scanf("%d%d",&a[i],&b[i]);
long long ans = 0;
for(int i = 1; i <= n; i++){
int left = a[i]&(~k);
if(left==0) ans += (long long)b[i];
}
int allOne = (1<<30)-1;
... | #include <bits/stdc++.h>
using namespace std;
#define vll vector<long long>
#define mll map<long long,long long>
#define max(a,b) ((a>b)?a:b)
#define min(a,b) ((a>b)?b:a)
#define pb push_back
#define prll pair<long long,long long>
typedef long long ll;
typedef long double ld;
#define rep(i,a,n) for(ll i=a; i<n; i++)
... | 0 | 54,233,286 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
int B[N-1];
for(int i=0; i<=N-2; i++) cin>>B[i];
long long ans=B[0];
for(int i=1; i<=N-2; i++){
ans += min(B[i-1], B[i]);
}
ans += B[N-2];
cout<<ans<<endl;
} | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
using base = complex<double>;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair... | 0 | 33,474,393 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s; cin >> s;
bool ok = true;
if (s[0] != 'A') ok = false;
int c = 0;
for (int i = 2; i < s.size()-1; ++i)
if (s[i] == 'C') c++;
if (c != 1) ok = false;
int d = 0;
for (int i = 0; i < s.size(); ++i)
if (s[i] < 97) d++;
if (d != 2) ok = false;
... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 0 | 38,067,892 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define mod 1000000007... | #include <bits/stdc++.h>
#define int long long
#define counter(m) for(int i=0;i<m;i++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 ... | 0 | 95,498,526 |
#include <iostream>
#include <string>
using namespace std;
constexpr int MAX=2000000;
constexpr int INFTY=(1<<30);
int H, A[MAX+1];
int left(int i){ return i*2; }
int right(int i){ return i*2+1; }
int parent(int i){ return i/2; }
void maxHeapify(int i){
int l=left(i);
int r=right(i);
int largest;
if(l<=H &&... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int n,m;
ll a[100001],b[100001];
int main(){
cin>>n>>m;
rep(i,n) cin>>a[i],b[i]=a[i];
int pre=__builtin_ctz(b[0]);... | 0 | 33,118,057 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int X, t;
int main() {
ios::sync_with_stdio(false);
cin... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int... | 0 | 89,213,832 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define In_The_Name_Of_Allah_The_Merciful ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define Alhamdulillah return 0;
#define debug(n) cerr << "[" << #n << " = " << n << "]" << endl
void Suhaib_Sawalha (){
int n , m;
cin >... | 0 | 10,609,585 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define maxn 100000
LL a[maxn],ans=0;
struct Base{
LL a[63];
void insert(LL x){
for(int i=62;~i;i--){
if(ans&(1ll<<i))continue;
if(x&(1ll<<i)){
if(!a[i]){a[i]=x;return;}
x^=a[i];
}
}
}
LL Max(){
LL ans=0;
for(int i=62;~i;i--)... | #include<cstdio>
#include<stack>
using namespace std;
struct Coord {
int row;
int col;
};
int solve (int W, int H);
int main () {
int W, H;
while(1)
{
scanf("%d%d", &W, &H);
if(W==0 && H==0) break;
printf("%d\n", solve(W,H));
}
}
int solve (int W, int H) {
int n=0;
char M[H+2][W+... | 0 | 58,225,383 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
string s,t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.begin(),t.end());
reverse(t.begin(),t.end());
string ans="No";
if(s<t){
ans="Yes";
}
cout << ans;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B;
cin >> A >> B;
if ((A <= 8) && (B <= 8)) {
cout << "Yay!" << endl;
}
else {
cout << ":(" << endl;
}
} | 0 | 6,707,187 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).beg... | #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
using namespace std;
bool is_palindrome(const string &s) {
bool res = true;
for (int i = 0; i < s.size() / 2; i++) {
if (s[i] != s[s.size() - i - 1]) {
res = false;
break;
}
}
return res;
}
int solve(string &s, int l, int r) {... | 0 | 44,434,507 |
#include <iostream>
#include <queue>
using namespace std;
int main(int argc, char* argv[]) {
queue<int> q;
int x, y;
cin >> x >> y;
while(!(x == 0 && y == 0)){
q.push(x);
q.push(y);
cin >> x >> y;
}
while(!q.empty()){
x = q.front();
q.pop();
y = q.front();
q.pop();
for(int j ... | #include <bits/stdc++.h>
const int MOD = 1000000007;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define copy(from, to) copy(from.begin(), from.end(), back_inserter(to))
#define sort(a) sort(a.begin(), a.end())
#define reverse(s) reverse(s.begin(), s.end())
#define p(s) cout << (s) << endl
typedef long long ll;... | 0 | 19,217,120 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <iostream>
using namespace std;
int n, m, p;
int x[100];
int main() {
while (cin >> n >> m >> p) {
if (!n) break;
for (int i = 0; i < n; i++) cin >> x[i];
m--;
int sumX = 0;
for (int i = 0; i < n; i++) sumX += x[i];
if (x[m] == 0) {
cout << 0 << endl;
}
else {
cout << sumX * (100 - p) * ... | 0 | 30,178,579 |
#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,... | #pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for(int i = (... | 0 | 85,154,901 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
string s;
cin >> s;
string sub_s = s;
reverse(sub_s.begin(), sub_s.end());
int l = s.size();
string a = s.substr(0, (l-1)/2);
string sub_a = a;
reverse(sub_a.begin(), sub_a.end());
string b = s.subs... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
typedef int64_t ll;
int main() {
int N, M, K;
cin >> N >> M >> K;
for (int i = 0; i <= M; i++){
for (int j = 0; ... | 0 | 53,928,045 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
const string alp="qwertyuiopasdfghjklzxcvbnm";
map<char,int>al;
for(int i=0;i<26;i++)
al[alp.at(i)]=0;
for(int i=0;i<s.size();i++)
al[s.at(i)]++;
string ans="None";
for(pair<char,int> x:al){
if(x.second==0){
a... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
using namespace std;
using ll = long long;
usin... | 0 | 21,731,063 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 1... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 5,273,381 |
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<map>
using namespace std;
typedef pair<int, int> T;
map<T, int>s;
int H, W, N;
int dir[9][2] = { -1,-1,-1,0,-1,1,0,-1,0,1,1,-1,1,0,1,1,0,0 };
void Fill(int x, int y)
{
for (int i = 0; i < 9; ++i)
{
int tx = x + dir[i][0], ty = y + dir[i... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
const int IINF = 1000000000;
template<class T> inline bool chmax(T& a, T b) { if (a ... | 0 | 59,241,984 |
#include <bits/stdc++.h>
#define rep(i, z, n) for(int i = z; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
const int64_t INF = 1LL << 60;
using namespace std;
int main(){
int64_t N, M, R;
cin >> N >> M >> R;
vector<int64_t> r(R), A(M), B(M), C(M);
rep(i, 0, R) cin >> r.at(i);
s... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<utility>
#include<vector>
#include<queue>
#include<functional>
#include<map>
#include<set>
#include<cstring>
#include<string>
#include<stack>
#include<malloc.h>
#include<math.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
typede... | 0 | 87,807,044 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >>s;
int n=s.size();
int zero=0;
int ichi=0;
for(int i=0;i<n;i++){
if(i%2==0&&s[i]!='1')zero++;
if(i%2==1&&s[i]!='0')zero++;
if(i%2==0&&s[i]!='0')ichi++;
if(i%2==1&&s... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define F... | 0 | 17,679,399 |
#include <bits/stdc++.h>
using namespace std;
using I = long long;
using U = unsigned long long;
using F = long double;
template <typename T> using Vec = vector<T>;
template <typename K, typename V> using HashMap = unordered_map<K, V>;
template <typename T> using HashSet = unordered_set<T>;
template <typename T> using ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
bool used[1000001];
void bfs(int x)
{
queue<int> q;
if (used[x])
return;
q.push(x);
used[x] = true;
while (q.size())
{
int u = q.front();
q.pop();
used[u] = true;
u += x;
if (u <= 1e... | 0 | 40,746,488 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> v;
string s;
void solve();
int main() {
cin >> n;
solve();
return 0;
}
void solve() {
long long l = 0, r = n - 1;
bool gend = 0;
v.assign(n, 0);
cout << 0 << endl;
cin >> s;
gend = s == "Male";
while(s != "Vacant") {
lo... | 0 | 27,529,900 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
#define task "tst"
using namespace std;
const ll N = 1e6 + 9;
const ll inf = 1e9 + 7;
typedef pair<ll,ll> LL;
queue<ll> q;
string s;
ll n,i,ans,cur = 0;
ll res[N];
int main(){
ios_base::sync_with_stdio(0);
cin... | #include <iostream>
#include <vector>
#include <string>
inline void chmin(int &x, int y) {
if(x > y) x = y;
}
int main() {
std::string s, t; std::cin >> s >> t;
int n = s.size(), m = t.size();
std::vector<std::vector<int>> dp(n+1, std::vector<int>(m+1, n+m));
dp[0][0] = 0;
for(int i = 0; i<n+1;+... | 0 | 61,041,442 |
#include <iostream>
using namespace std;
typedef long long ll;
ll n,a,b,ans=-1,tot;
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>a>>b;
ans+=b;
tot+=(a*b);
}
ans+=(tot-1)/9;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
const char nl = '\n' ;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int w, h, n; cin >> w >> h >> n;
int rong = w, cao = h;
int l = 0, r = 0, b = 0, t = 0;
for(int i... | 0 | 48,419,703 |
#include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorit... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void fin(T a){
cout<<a<<endl;
exit(0);
}
void Y(){
fin("YES");
}
void N(){
fin("NO");
}
template<typename T>
void chmax(T &a,T b){
if(a<b)a=b;
}
signed main(){
int n;cin>>n;
vector<int> v(n),edge[n];
for(int i=0;i<n;i++)cin>>v[i];
for(... | 0 | 90,344,899 |
#include <bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef uint32_t u32;
typedef int32_t i32;
#define MAX_NUM (1000000007)
#define PI 3.14159265358979323846
using namespace std;
template <typename T>
static inline void ArrayInput(vector<T>& A) {
for (auto itr = A.begin(); itr < A.end(); ++itr) cin >>... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<N;i++)
#define rep2(i,N) for(int i=1;i<=N;i++)
using namespace std;
long long INF=1e18;
long long mod=1e9+7;
int main(){
double n,m,d;
cin>>n>>m>>d;
double ans;
double tmp=n;
if(n>=2*d+1 && d>0){
tmp+=(n-2*d);
}
ans=(dou... | 0 | 100,590,540 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < a)... | #include<iostream>
#include<stack>
#include<cstdio>
using namespace std;
int main(){
int a;
char c;
bool f;
stack<int> p;
while(1){
c = getchar();
if(c == '.')break;
f = true;
while(!p.empty())p.pop();
do{
if(c == '(')p.push(1);
if(c == '[')p.push(2);
if(c == ')'){
if(p.... | 0 | 12,746,139 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
string s ; cin>>s ;
if(s.length()==6){
char x[7];
strcpy(x,s.c_str());
bool b = 0;
for(int i=0 ; i<2 ; i++){
if(int(x[i])<97||int(x[i])>122)
{b = 1;break;}
}
if(b==0&&x[2]==x[3]&&x[4]==x[5])
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
retu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i) = 0; (i) <(n); (i)++)
#define so(v) sort(v.begin(),v.end())
using ll = long long;
using vi=vector<int>;
using vii=vector<vi>;
const int MAX = 510000;
const int MOD = 1000000007;
ll gcd(ll a, ll b)
{
if (a%b == 0)
{
return(b);
}... | 0 | 91,089,764 |
#include <iostream>
using namespace std;
int main()
{
int i, n;
double x[4], y[4];
cin >> n;
for (i=0; i<n; i++) {
cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> x[3] >> y[3];
if (x[0] == x[1]) {
if (x[2] == x[3]) cout << "YES" << endl;
else cout << "NO" << endl;
} else {
if ((y[0] - y[1]) / ... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 0 | 63,524,923 |
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
#define dump(a) cout << (a) << endl;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<double> t(n+1, 0), v(n+2, 0);
for( int i = 1; i <= n; i++ ) c... | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bitset>
using namespace std;
#define PI 3.1415926535897932384... | 0 | 78,659,319 |
#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 vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int a;
cin >> a;
n -= a;
}
if(n... | #include<iostream>
#include<vector>
#include<algorithm>
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
char field[20][20];
int w, h;
int cnt = 0;
int dfs(int x, int y){
field[x][y] = '#';
cnt++;
for(int dx=-1; dx<=1; dx++){
for(int dy=-1; dy<=1; dy++){
if(dx!=0 && dy!=0) co... | 0 | 16,764,701 |
#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 ll long long
#define mod 1000000007
#define ... | #include<bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i,k,n) for (ll i = k; i <= (ll)(n); ++i)
#define MAX 500000001000000000
#define MOD 1000000007
typedef long long ll;
using namespace std;
ll ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll>... | 0 | 51,429,409 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;... | /*http:
#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(){
while(1){
int n,k;
cin >> n >> k;
if((n==0)&&(k==0)) break;
int s[n+1];
s[0]=0;
rep(i,n){
int a;... | 0 | 7,795,987 |
#include <stdio.h>
int n,k;
long long a[20];
long long b[20];
int cnt;
long long min(long long a, long long b){
return a<b?a:b;
}
long long f(int x){
long long res = 1e9;
res = res * res;
if(x==n+1){
if(cnt < k){
return res;
}
long long ans = 0;
long long max_height = a[1];
int cur_cnt = 1;
if(b[cur_... | #line 1 "/mnt/c/Users/leafc/dev/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define ... | 0 | 61,444,992 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#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 m, k;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> m >> k;
if (k > (... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
using ll = int64_t;
using namespace std;
int n,k;
int64_t v[100];
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
R... | 0 | 43,348,858 |
#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;
ll ans = 0;
cin >> n;
vector<ll>s(n);
rep(i,n){
ll a,b;
cin >> a >> b;
ans -= b;
s[i] = b+a;
}
sort(s.begin(),s.end());
reverse(s.begin(),s.end());
... | #include <bits/stdc++.h>
using namespace std;
typedef complex<long long> point;
#define EPS 1e-11
#define X real()
#define Y imag()
#define angle(v) (atan2((v).Y, (v).X))
int dcmp(const double &a, const double &b) {
if (fabs(a - b) < EPS)
return 0;
return ((a > b) << 1) - 1;
}
int main() {
#ifndef ON... | 0 | 2,502,416 |
#include<stdio.h>
int main(){
char input[25];
scanf("%s",input);
for(int i = 0; input[i] != '\0'; i++){
if(input[i] >= 'a' && input[i] <= 'z'){
printf("%c", input[i]);
}
else{
printf(" ");
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define M 100007
#define INF 1e9
#define INFL 1e18
#define PI acos(-1)
#define mp make_pair
int n;
int dp[100100];
int arr[100100];
int mydp(int i)
{
if(i>=n)
{
return... | 0 | 78,252,936 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
int n;
cin >> n;
vector<string> ss(n);
for (int i = 0; i < n; i++) cin >> ss[i];
map<string, ll> m;
for (int i = 0; i < n; i++) {
auto s = ss[i];
sort(s.begin(), s.end());
if (m.count(s) == 0) m[s] = 0;
m[s]++;
... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
int n,par[100000],typ[100000],dep[100000];
vector <int> chi[100000];
int depth(int now){
if(dep[now] != -1)return dep[now];
if(par[now]==-1)return 0;
return depth(par[now])+1;
}
int main(){
cin >> n;
for(int... | 0 | 83,589,598 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
using ll = long long;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int p[100000], y[100000];
vector<int> yd[100001];
rep(i, m) {
scanf("%d%d", &p[i], &y[i]);
yd[p[i]].push_back(y[i]);
... | 0 | 69,044,063 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define f(i) for(i=0;i<=9;i++)
int main(){
int a,b,c,d,n,s,k=0;
while(scanf("%d",&n)!=EOF){
k=0;
f(a)
f(b)
f(c)
f(d){
if(n==a+b+c+d)
... | #include<bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define fset(arr,n,val) for(int i=0;i<n;++i) arr[i] = val
#define deb(name,value) cout <<"->> "<<name<< "= " <<value<<" "
#de... | 0 | 68,484,638 |
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<iomanip>
#include<stack>
#include<string.h>
#include<cstring>
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define sz(a) (int)a.size()
using... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
type... | 0 | 43,885,581 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define loop(k) rep(author_is_masa,k)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<in... | #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>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for... | 0 | 6,922,594 |
#include <bits/stdc++.h>
using namespace std;
int solve(vector<int> &costs, int a, vector<int> &memo) {
if (a <= 0) {
return a == 0 ? 0 : -20000;
}
if (memo[a] == -1) {
int ans = solve(costs, a - costs[0], memo) + 1;
for (int i = 0; i < costs.size(); i++) {
ans = max(ans, solve(costs, a - costs[... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<deque>
#include<bitset>
#include<map>
#include<set>
#define inf 1e9
#define eps 1e-6
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
inline ... | 0 | 100,719,876 |
#include <iostream>
#include<string>
#include<cmath>
#include<ciso646>
#include<cstring>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<utility>
#include<map>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> a... | #include<iostream>
#include<algorithm>
#define MAX 100
#define INF (1 << 30)
using namespace std;
int n, p[103], m[102][102];
int matrixChainMultiplication(void);
int main() {
int i;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> p[i - 1] >> p[i];
}
cout << matrixChainMultiplication() << endl;
return 0;
}
int matr... | 0 | 46,259,630 |
# include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
cin.tie(NULL);
ios_base::sync_with_stdio(false);
string s;
cin>>s;
for(int i = 0; i< s.size(); i++){
if(s[i] == '1') cout<<'9';
else if(s[i] == '9') cout<<'1';
else cout<< s[i];
}
cout<<'\n';
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
string x;
cin>>x;
int len=x.length();
for(int i=0;i<len-1;i++){
if (x[i]==x[i+1]){
printf("%d %d\n",i+1,i+2);
return 0;
}
}
for(int i=0;i<len-2;i++){
if (x[i]==x[i+2]){... | 0 | 62,162,867 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPR(i,a,n) for(int i=a;i>n;--i)
#define RUP(a,b) ((a+b-1)/(b))
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define MOD 1000000007... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | 0 | 85,170,236 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
string s = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
string a;
cin >> a;
if (a == "snuke") {
cout << s[j] << i+1 << endl;
return 0;
}
}
}
} | 0 | 77,225,967 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> dist;
int levenshtein_distance(string a, string b) {
for (auto i = 0; i <= (int)a.size(); i++) dist[i][0] = i;
for (auto i = 0; i <= (int)b.size(); i++) dist[0][i] = i;
for (auto i = 1; i <= (int)a.size(); i++) {
for (auto j = 1; j <=... | #include <bits/stdc++.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <iostream>
#include <bitset>
#include <cassert>
#include <queue>
#include <random>
#include <stack>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repf(i, a, b) for ... | 0 | 9,764,787 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | #include<bits/stdc++.h>
#define ll long long
#define P pair<ll, ll>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>>G(n);
vector<int>p(m), y(m);
for(int i=0;i<m;i++){
cin >> p[i] >> y[i];
p[i]--;
G[p[i]].push_back(i);
}
vector<ll>ans(m);
... | 0 | 99,458,398 |
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n, ans;
double debt = 100000;
cin >> n;
for(int i = 0; i < n; i++)
{
debt = ceil((debt * 1.05) / 1000) * 1000;
}
ans = debt;
cout << ans << endl;
return 0;
} | #pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
using namespace std;
typedef long long ... | 0 | 73,721,854 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b,k;
cin>>a>>b>>k;
if(k==0)
{
cout<<a<<" "<<b;
}
else if(a+b<=k)
{
cout<<0<<" "<<0;
}
else if(a<=k && a+b>=k)
{
cout<<0<<" "<<abs(k-a-b);
}
else if(a>=k)
{
cout<<abs(a-k)<<" "<<b;
}
return... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n,x=0,y=0;
cin>>n;
for(int i=0;i<n;i++){
string a,b;
cin>>a>>b;
int r=a.compare(b);
if(!r)++x,++y;
else if(r>0)x+=3;
else y+=3;
}
cout<<x<<" "<<y<<endl;
return 0;
} | 0 | 53,906,649 |
#include <stdio.h>
main(){
int a,b;
scanf("%d%d",&a,&b);
if(-1000<=a&&b<=1000){
if(a<b){
printf("a < b\n");
}
else if(a>b){
printf("a > b\n");
}
else if(a==b){
printf("a == b\n");
}
}
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
using ll = long long;
int main() {
ll k; scanf("%lld", &k);
ll dp[100000];
for (ll i = 0; i < k; i++) dp[i] = 0x7FFFFFFFFFFFFFFFLL;
dp[1] = 1;
ll qv[100000] = {1};
ll qc[100000] = {... | 0 | 71,834,539 |
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | #include<cstdio>
#include<algorithm>
using namespace std;
int n;
long long a,b,t=1000000001,ans;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld%lld",&a,&b);
ans+=a;
if(a>b)
t=min(t,b);
}
if(t==1000000001)
printf("0");
else printf("%lld",ans-t);
} | 0 | 59,261,221 |
#include <stdio.h>
typedef long long ll;
int main() {
int k;
scanf("%d", &k);
ll a[100005];
for (int i = 0; i < k; i++) {
scanf("%lld", &a[i]);
}
ll mn = 2;
ll mx = 2;
for (int i = k - 1; i >= 0; i--) {
ll amn = (mn + a[i] - 1) / a[i] * a[i];
ll amx = mx / a[i] * a[i];
if (amn > mx) {
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int find_parent(int i, vector<int>& parent){
if (i == parent[i]) return i;
return parent[i] = find_parent(parent[i], parent);
}
int main(){
int n, m;
cin >> n >> m;
vector<int> adress(n);
for (int i=0; i<n; i++){
int p;
... | 0 | 56,411,558 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A), b(B);
for (int i = 0; i < A; ++i) cin >> a[i];
for (int i = 0; i < B; ++i) cin >> b[i];
int mina = INT_MAX;
for (int i = 0; i < A; ++i)
mina = min(mina, a[i]);
int minb =... | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
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;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | 0 | 31,054,724 |
#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<time.h>
#include<cstdlib>
typedef long long ll;
#define mm(a) memset(a,0,sizeof(a))
#define lr rt<<1
#define ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
constexpr int MOD = 1000000007;
void warshal_floyd(vvi& G) {
... | 0 | 79,734,781 |
#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... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
#define pi 3.14159265359
#define mk(arr,n,type) type *arr=n... | 0 | 39,305,786 |
#include<bits/stdc++.h>
using namespace std;
const int N = 3e5+10;
const int P = 1e9+7;
#define fr(i,low,up,st) for(register int i = low;i <= up;i += st)
#define nfr(i,low,up,st) for(register int i = low;i >= up;i -= st)
#define clr(a) memset(a,0,sizeof a)
#define SZ(a) (a.size())
int n,m,k;
char ch[N];
int a[N];
int c... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 0 | 2,484,959 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include <bits/stdc++.h>
#define mid ((l+r)>>1)
using namespace std;
typedef long long lnt;
template <class T> inline void read(T &x) {
x = 0; int c = getchar(), f = 1;
for (; !isdigit(c); c = getchar()) if (c == 45) f = -1;
for (; isdigit(c); c = getchar()) (x *= 10) += f*(c-'0');
}
int n; lnt a[55], s, tot;
bool c... | 0 | 29,102,998 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r);
template <class T1, class T2>
bool chmax(T1 &l, const ... | 0 | 81,996,420 |
#include <bits/stdc++.h>
#define f first
#define s second
#define MOD 1000000007
#define PMOD 998244353
#define pb(x) push_back(x)
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> plii;
typedef pair<int, pii> piii;
const int INF = 1e9+10;
const ll LINF = 1LL*INF*INF;
const i... | #include<stdio.h>
int f[100010],v[100010];
int fa(int a)
{
if(f[a]==a)
return a;
int t=f[a];
f[a]=fa(f[a]);
v[a]+=v[t];
return f[a];
}
bool connect(int x,int y,int d)
{
int fx=fa(x);
int fy=fa(y);
if(fx!=fy)
{
f[fy]=fx;
v[fy]=v[x]-v[y]+d;
}
else if(v[y... | 0 | 29,858,830 |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | #include<stdio.h>
#include<iostream>
#include<vector>
#include <fstream>
#include<math.h>
#include <numeric>
#include<algorithm>
#include <stdlib.h>
# include <map>
using namespace std;
int main(){
int n;
double tmp;
string tmp2;
double ans = 0;
cin >> n;
for(int i = 0 ;i < n ; i++){
cin... | 0 | 31,136,738 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
typedef long long ll;
ll mod_pow(ll x,ll n,ll mod){
if(n==0)return 1;
ll res=mod_pow(x*x%mod,n/2,mod);
if(n&1)res=res*x%mod;
return res;
}
signed main(){
int n;
cin>>n;
int a[111111]={};
int s,t;
for(int i=1;i<=n... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=2e9+7;
const ll longinf=1LL<<62;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=100010;
const ll mod... | 0 | 37,972,118 |
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i,n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin() , v.end()
#define inputv(v,n) rep(i,n){\
ll x;\
cin>>x;\
v.push_back(x);\
}
const ll INF = 999999999999999;
cons... | #include<iostream>
#include<vector>
#include<string>
const int MOD = 1000000007;
int main(){
int n, m;
std::cin >> n >> m;
std::vector<bool> notUsed(n + 1, false);
for(int i = 0; i < m; i++){
int a;
std::cin >> a;
notUsed[a] = true;
}
std::vector<int> dp(n + 1, 0);
dp... | 0 | 79,242,871 |
#include<iostream>
#include<math.h>
using namespace std;
int main(){
int n;
bool p[1000000];
while(cin>>n){
int n_sq = (int)sqrt(n);
for(int i=0; i<n; i++){
p[i] = true;
}
p[0] = false;
for(int i=1; i<n_sq; i++){
if(p[i]){
for(i... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n; cin >> n;
map<string ,int > mp;
string s; cin >> s;
mp[s]++;
for(int i=0;i<n-1;i++){
string t; cin >> t;
mp[t]++;
if(s[s.size()-1]!=t[0]){
cout << "No" << endl;
return 0;
... | 0 | 11,161,719 |
#include<iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = 0;
for (; a <= b; a++) {
if (c % a != 0) continue;
x++;
}
cout << x << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int K;
string S;
cin>>K;
cin>>S;
for(int i= 0; i < S.length(); i++){
if(i>=K){
cout<<"...";
break;
}else{
cout<<S[i];
}
}
} | 0 | 97,028,041 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string str;
int sum;
while(cin >> str && str!="0"){
sum=0;
for(int i=0,l=str.size();i<l;i++)sum += str[i] - '0';
cout << sum <<endl;
}
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<iomanip>
#include<stack>
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define sz(a) (int)a.size()
using namespace std;
int main() {
int a, ... | 0 | 50,547,405 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int x, y;
cin >> x >> y;
for (int i = 0; i <= 100; i++)
{
for (int j = 0; j <= 100; j++)
{
if (2 * i + 4 * j == y && i + j == x)
{
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 69,529,104 |
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << ": " << x << endl
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int n;
cin >> n;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
if (4 * i + 7 * j == n) {
cout << "Yes\n";
return 0;
... | #include<iostream>
using namespace std;
#include<cmath>
#include<math.h>
int main() {
double a, b, angle, rad, h, area, c, pi;
cin >> a >> b >> angle;
rad = angle * (M_PI / 180);
h = b*sin(rad);
c = sqrt(pow(a, 2) + pow(b, 2) - 2 * a * b * cos(rad));
area = ((a * b) / 2) ... | 0 | 50,193,613 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define lb lower_bound
#define ub upper_bound
#define srt(a) sort(a.begin(),a.end())
typedef vector<int> vi;
typedef vector<vi> vvi;
ty... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> C(N - 1);
vector<int> S(N - 1);
vector<int> F(N - 1);
for (int i = 0; i < N - 1; i++) {
cin >> C[i] >> S[i] >> F[i];
}
for (int i = 0; i < N - 1; i++) {
int time ... | 0 | 38,677,838 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
int main()
{
int n,i;
scanf("%d",&n);
lli a[n];
for(i=0;i<n;i++)
scanf("%lld",&a[i]);
lli ans[n]={0};
ans[n-1]=0;
ans[n-2]=abs(a[n-2]-a[n-1]);
for(i=n-3;i>=0;i--)
ans[i]=min(ans[i+1]+abs(a[i]-a[i+1]),ans[i+2]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false... | 0 | 73,122,964 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,x,n) for(int i=(x);i<(n);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define ub upper_bound
#define lb lower_bound
#define int long long
using namespace std;
const ... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll ... | 0 | 89,076,526 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
const int dx[] = { -1 , -1 , -1 , 0 , 0 , 0 , 1 , 1 , 1 };
const int dy[] = { -1 , 0 , 1 , -1 , 0 , 1 , -1 , 0 , 1 };
#define NN 8010000
#define TC int t;cin>>t;for(int T=1;T<=t;T++)
#define mod 1000000007
#define PI acos(-1)
#define a... | 0 | 50,767,484 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
int ans1 = 0, ans2 = 0;
rep(i,s.size()) {
if (i%2 == 0 && s[i] == '0') ans1++;
if (i%2 != 0 && s[i] == '1') ans1++;
... | #include<map>
#include<set>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<ctime>
#include<vector>
#include<bitset>
#include<string>
#include<cstdio>
#include<numeric>
#include<utility>
#include<sstream>
#include<cstdlib>
#include<iomanip>
#include<cstring>
#include<iostream>
#include<algorith... | 0 | 68,273,370 |
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll H, W;
int N;
cin >> H >> W >> N;
set<pair<int, int>> points, events;
for (int i = 0; i < N; i++) {
int y,... | #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | 0 | 90,821,804 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
string result = "";
for(int i = 0; i < str.size(); i += 2) {
result += str.at(i);
}
cout << result << endl;
} | #include <iostream>
using namespace std;
void func(int &points_A, int &points_B, string str1, string str2) {
int n;
int isLonger = 0;
if (str1.length() > str2.length()) {
n = str2.length();
isLonger = 1;
} else if (str1.length() < str2.length()) {
n = str1.length();
isLon... | 0 | 88,376,431 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long a,b,c,d;
cin >> a >> b >> c >> d;
long e = c*d/gcd(c,d);
a--;
cout << b-b/c-b/d+b/e-(a-a/c-a/d+a/e) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
const string possible = "POSSIBLE";
const string impossible = "IMPOSSIBLE";
int n, k, a[101010];
int main()
{
cin >> n >> k;
int m = 0;
rep(i, n)
{
... | 0 | 60,904,378 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n, m, d;
cin >> n >> m >> d;
long double unit = 0;
unit += (n - d) * 2;
if(d == 0)unit = n;
unit /= n * n;
cout << fixed <<setprecision(12) << unit * (m - 1) << endl;
} | #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];
}
int lower = 0, upper = n, mid;
while(upper - lower > 1){
mid = (upper + lower) / 2;
bool flag = true;
map<int, int> string_data;... | 0 | 65,359,639 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
const ll mk = 200055;
const ll logn = 29;
const ll mod = 1e9 + 7;
#define endl "\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0);
#define fi first
#define se second
#define pii pair<... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int main() {
int64_t S; cin >> S;
auto OK = [&](int64_t x) -> bool {
return x * 1e9 < S;
};
int64_t l = 0, r = 1e9;
while(r - l > 1) {
int64_t c = (l + r) / 2;
if(OK(c)) l = c;
... | 0 | 17,521,700 |
#include<stdio.h>
int main() {
int n, a, b;
scanf("%d %d %d", &n, &a, &b);
int count = 0;
for(int i= 0; i <= n; i++) {
int sum = 0;
for(int j = i; j != 0; j /= 10) {
sum += j % 10;
}
if(sum >= a && sum <= b) {
count += i;
}
}
printf("%d", count);
return 0;
} | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 21,495,346 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
string s, t;
cin >> s >> t;
int a, b;
cin >> a >> b;
string u;
cin >> u;
if (s == u)
{
a--;
}
if (t == u)
{
b--;
}
cout << a << " " << b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int N;
void solve() {
int num = 0;
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= N; ++j) {
if (i * 4 + j * 7 == N) {
num++;
break;
}
}
}
if (num > 0) {
printf("Yes\n");
... | 0 | 23,660,297 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define arep(x,n) for (int x: n)
using namespace std;
int main()
{
int64_t h, w; cin >> h >> w;
int64_t ans = 0,tmp;
if(h == 1 || w == 1) ans = 1;
else {
if(h%2 == 0) {
ans = w * h/2;
} else {
a... | #include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <cstring>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <s... | 0 | 39,696,312 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const string EMP = " ";
const ll INF = 1LL<<60;
const ll MOD = 1000000007;
int m... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int h,w,k;
cin>>h>>w>>k;
int x[h*w+1],y[h*w+1];
for(int i=0;i<h;i++)
for(int j=0;j<w;j++)
{
int ch;
cin>>ch;
x[ch]=i;
y[ch]=j;
}
int d[h*w+1];
memset(d,0,sizeof(d)... | 0 | 58,502,929 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <cmath>
#include <iomanip>
#include <numeric>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
t... | #include<bits/stdc++.h>
#include <iostream>
using namespace std;
int main()
{
#ifdef LOCAL_EXEC
#else
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#endif
vector<long long int>vt;
long long int i,n,j;
cin>>n;
long long int A[n+1];
bool ok=true;
vt.push_back(1);
for(i=... | 0 | 18,484,105 |
#include<iostream>
using namespace std;
long long int maximum(long long int a,long long int b)
{
long long int c=a>b?a:b;
return c;
}
main ()
{
long long int a,b,c,d,sum1,sum2,sum3,sum4;
long long int temp;
cin>>a>>b>>c>>d;
sum1=a*c;
sum2=a*d;
sum3=b*c;
sum4=b*d;
temp=maximum(su... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> p... | 0 | 54,784,930 |
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
void addself(int &a,int b){
a+=b;
if(a>=mod){
a-=mod;
}
}
void subself(int &a,int b){
a-=b;
if(a<0){
a+=mod;
}
}
int main(){
int n,k;
cin>>n>>k;
int dp[k+1]={0};
dp[0]=1;
int upto;
for(int i=0;i<n;i++){
cin>>upto;
int diff[k+1]={0};... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define REP(i,n) for(int i=0;i<int(n);i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long l... | 0 | 69,754,602 |
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int gcd(int a, int b){
if(b == 0) return a;
else return gcd(b, a % b);
}
void testCase(){
int n; cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
map<int, int> mp;
int pair = 1;
for(int i... | 0 | 67,551,229 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
int abs(int x){
if(x<0){
x=-x;
}
return x;
}
int main(){
int N;
cin>>N;
vector<int> A(N+2,0);
for(int i=1;i<=N;i++){
cin>>A.at(i);
}
vector<int> cost(N+1),skip(N+1);
int sum=0;
for(int i=0;i<... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
char a[105][105];
bool rr[105], cc[105];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n, m;
cin >> n >> m;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
... | 0 | 49,860,807 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l;
l.push_back(1);
l.push_back(1);
for (int i = 2; i <= n; i++) {
l.push_back(l[i-2] + l[i-1]);
}
cout << l[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
cin >> x >> y;
int j = 0;
for (int i = x; i >= 0 ; i--)
{
j = x - i;
if ((i*2 + j*4) == y)
{
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | 0 | 14,196,566 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.