code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int N,K;
ll ret;
cin >> N >> K;
ret = K;
if (N > 2)
{
rep(i, (N - 1))
... | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a,... | 0 | 53,601,699 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
const ll Mod = 1000000007;
int N;
vector<int> Graph[110000];
vector<int> Depth[110000];
vector<int> Deep(110000);
vector<int> Parent(110000);
vector<int> child[110000];
int root = 0;
void BFS()... | #include <stdio.h>
int main (){
char s[200];
char t[200];
scanf("%s %s", &s, &t);
printf("%s%s\n", t, s);
return 0;
} | 0 | 10,017,317 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans=0;
string s;
for(int i=1;i<=n;i++){
s=to_string(i);
if(s.size()%2==1)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
void solve_test() {
int n, x, t;
cin >> n >> x >> t;
cout << (n + x - 1) / x * t << '\n';
}
int32_t main() {
int T;
T = 1;
while (T--)
solve_test();
return 0;
} | 0 | 30,252,635 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int 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++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | #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 | 21,235,491 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <string>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);i++)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline vo... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long w,h;
cin>>w>>h;
long long p[w],q[h];
long long ans=0;
for(int i=0;i<w;i++){
cin>>p[i];
ans+=p[i];
}
for(int i=0;i<h;i++){
cin>>q[i];
ans+=q[i];
}
sort(p,p+w);
sort(q,q+h);
for(i... | 0 | 40,218,373 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N; cin >> N;
vector<bool> dp(100);
dp.at(0) = false, dp.at(1) = false, dp... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 83,365,034 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n,m;
cin >> n >> m;
priority_queue<ll,vector<ll>,less<ll>> q;
for(int i=0;i<n;i++){
ll a;
cin >> a;
q.push(a);
}
for(int i=0;i<m;i++){
ll b=q.top();
q.pop();
... | #include<bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
typedef long long int lli;
lli n,k,s,m,t,a,b,l,r,v,h,u,temp1,temp2,x,y,temp,q,d,mod=1e9+7,w,p,c,z;
lli grid[2000][2000],dp[2000][2000];
lli rec(lli i,lli j)
{
if(grid[i][j]==1)
{
dp[i][j]=0;
}
if(i==1&&j==1)
{
dp[i][j]=1;
... | 0 | 51,836,134 |
#include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true... | 0 | 18,496,728 |
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <vector>
#include <tuple>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <math.h>
#include <bitset>
#include <numeric>
#include <stack>
#include <cmath>
#include <queue>
#include <functional... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef... | 0 | 16,998,163 |
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{ char s[105][105];
int n,m,i,j;
scanf("%d%d",&n,&m);
getchar();
for(i=0;i<n;i++)
{for(j=0;j<m;j++)
scanf("%c",&s[i][j]);
getchar();
}
for(i=0;i<n;i++)
{for(j=0;j<m;j++)
printf... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
ll a[200005];
map<ll,ll> b;
int main(){
ll n;
cin >> n;
rep(i,n){
cin >> a[i];
a[i]... | 0 | 84,560,831 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(j, m) for (int j = 0; j < (int)(m); j++)
#define rep2(i, l, n) for (int i = l; i < (int)(n); i++)
int main() {
string S;
cin >> S;
rep2(i,'a','z' + 1) {
int flag = 0;
rep(j,S.size()) {
... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 1000005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) ... | 0 | 59,214,538 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<ll,double> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( ... | 0 | 45,242,589 |
#include <iostream>
using namespace std;
#include <string>
#include <cctype>
int main() {
string deck, subset1, subset2;
int m, h;
while (1){
cin >> deck;
if (deck == "-") break;
cin >> m;
for (int i = 1; i <= m; i++){
cin >> h;
subset1 = deck.substr(0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#ifdef LOCAL
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl
#define itrdebug(x) cerr << #x ... | 0 | 79,472,328 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define RFOR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define LL long long
#define INF INT_MAX
const double EPS = 1e-14;
const double PI = acos(-1.0);
LL mod... | #include<bits/stdc++.h>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
template<class... | 0 | 92,899,698 |
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
int comb(int n, int r){
int res = 1;
for(int i=0; i<r; i++){
res = res*(n-i)/(i+1);
}
return res;
}
int main(){
int n;
cin >> n ;
vector<int> vec(n);
for(int i=0; i<n; i++){
cin >> vec.at(i);
}
std::sort(vec.begin(), vec.end());
int resa = ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 51,199,117 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include<bits/stdc++.h>
using namespace std;
int main(){
double a,k;
cin >> a >> k;
double ans = 0;
for(int i=1;i<=a;i++){
if(i > k){
ans += 1 ;
}else{
double n = k/i;
int nn = 1;
while(n > 1){
n /= 2;
nn *= 2;
}
ans += 1.0 / nn;
}
}
double s =... | 0 | 12,474,578 |
#include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int main () {
int k, s ;
int ans = 0 ;
c... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i <... | 0 | 2,620,172 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
using namespace :: std;
const ll maxn=51;
const ll mod=1e9+7;
const ll inf=1e9+500;
ll sek[maxn];
int main(){
ll k;
cin>>k;
ll kk=k;
if(kk%50!=0){
kk+=50;
}
kk=(kk/50)*5... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#... | 0 | 45,011,038 |
#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,string>;
int main() {
string s;
cin >> s;
for(int i = 97; i <= 122; i++){
char x = i;
bool flag = true;
rep(j,s.size()){
if(x == s.at(j)) flag = false;
... | #include <iostream>
using namespace std;
int main(void){
string str, ins;
int n;
cin >> str >> n;
for (int i = 0; i < n; i++) {
cin >> ins;
if (ins == "print") {
int a, b;
cin >> a >> b;
for (int j = a; j <= b; j++) {
cout << str[j];
... | 0 | 84,182,434 |
#include<bits/stdc++.h>
typedef long long LL;
typedef double dl;
#define opt operator
#define pb push_back
const LL maxn=1e6+9,mod=998244353;
LL Read(){
LL x(0),f(1); char c=getchar();
while(c<'0' || c>'9'){
if(c=='-') f=-1; c=getchar();
}
while(c>='0' && c<='9'){
x=(x<<3ll)+(x<<1ll)+c-'0'; c=getchar();
}retur... | #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 Graph = vector<vector<ll>>;
ll dp[100100][2];
vector<ll> dist;
ll rec(int v, int color, const Gr... | 0 | 83,336,302 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <stack>
#include <functional>
#include <sstream>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=j;i>(n);i--)
type... | 0 | 70,980,552 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define pll pair<LL,LL>
#define x first
#define y second
#define pi acos(-1)
#define sqr(x) ((x)*(x))
#define pdd pair<double,double>
#define MEMS(x) memse... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 0 | 35,941,642 |
#include <cstdio>
int main(){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if (a<b && b<c) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
const double pi ... | 0 | 91,391,027 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll md = 1000000007;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
vl p, fac(2, 1), ifac(2, 1);
ll add(ll a, ll b, ll mod = md) {
return (a%mod + b%mod + mod) % mod;
}
ll mul(ll a, ll b, ll mod = md) {
retu... | 0 | 50,167,731 |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
void solve() {
ll N;
cin >> N;... | #include <bits/stdc++.h>
using namespace std; using ll = int64_t; using ull = uint64_t; const ll INF = 9e18;
void print() { cout << endl; }
template<typename Head,typename... Tail> void print(Head head,Tail... tail){cout<<head;if(sizeof...(Tail)>0)cout<<" ";print(tail...);}
void print0() {}
template<typename Head,typen... | 0 | 34,964,823 |
#include <iostream>
using namespace std;
int main()
{
int a, b;
char t;
cin >> a >> b;
if (a + b == 15)
t = '+';
else if (a * b == 15)
t = '*';
else
t = 'x';
cout << t << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
string s;
int k;
cin >> s >> k;
int dp[s.size()][k + 1][2];
for (int i = 0; i <= k; ++i) {
dp[0][i][0] = 0;
dp[0][i][1] = 0;
}
dp[0][0][0] = 1;
dp[0][1][0] = s[0] - '0' - 1;
dp[0][1][1] = 1;
for (int i = 1; i < s.size(); ++i) {
dp[i][... | 0 | 51,695,526 |
#include <stdio.h>
int main(int argc, char *argv[])
{
int t;
scanf("%d",&t);
int a[100000];
int count[100005]={0};
for(int i=0;i<t;i++){
scanf("%d",&a[i]);
if(a[i]==0){
count[a[i]]++;
count[a[i]+1]++;
}
else{
count[a[i]]++;
count[a[i]-1]++;
count[a[i]+1]++;
}
}
int max=count[0];
for(int... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;retur... | 0 | 100,230,832 |
#include <bits/stdc++.h>
using namespace std;
bool bubbleSort(vector<pair<char,int>>& A, int N)
{
bool flag = true;
while(flag){
flag = false;
for(int j = N-1; j >= 1; j--){
if(A.at(j).second < A.at(j-1).second){
swap(A.at(j), A.at(j-1));
flag = true;
}
}
}
return true;
}
bool select... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | 0 | 93,785,124 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; ++i)
#define rep(i, n) repl(i, 0, n)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define chmax(x,y) x = max(x, y)
#define chmin(x,y) x = min(x, y)
using namespace std;
usin... | #include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
int main(){
int H, W, N;
map<pair<int, int>, int> rect;
cin >> H >> W >> N;
for(int n = 0; n < N; n++){
int a, b;
scanf("%d %d", &a, &b);
for(int i = 0; i < 3; i++){
for(int j =... | 0 | 60,099,020 |
#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;
signed main(){
int n,k;
cin >> n >> k;
ll a[n];
... | #include <iostream>
#include <string>
using namespace std;
int main(void){
int h,w;
string str("#");
while(1){
cin>>h>>w;
if(h==0&&w==0){
break;
}
for(int i=0;i<h;i++){
for(int i=0;i<w;i++){
cout<<str;
}
cout<<endl;
... | 0 | 58,287,503 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
typedef pair<int, int> P;
const double EPS = 1e-10;
signed main(){
int n;
cin >> n;
double x[4], y[4];
r... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 0 | 3,945,550 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, N, x, y=0;
string ans = "No";
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> x;
y += x;
}
if (H <= y) ans = "Yes";
cout << ans << endl;;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K, answer = LLONG_MAX;
cin >> N >> K;
pair<int,int> xy[N];
for (int i = 0; i < N; i++) {
cin >> xy[i].first >> xy[i].second;
}
sort(xy,xy+N);
for (int i = 0; i < N; i++) {
for (int j = i+K-1; j < N; j++) {
int z[j-i+1];
... | 0 | 18,656,500 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int C[510], S[510], F[510];
for (int i = 0; i < N-1; i++){
cin >> C[i] >> S[i] >> F[i];
}
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = i; j < N-1; j++) {
if (sum < S[j]) {
... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
string s,t;
cin >> s >> t;
int n = s.size();
int m = t.size();
bool flag;
... | 0 | 34,949,037 |
#include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
li a[10100];
li b[10100];
li n;
inline bool check() {
cin >> n;
li sa = 0;
rep(i, n) {
cin >> a[i];
sa += a[i];
}... | #include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
int main() {
int N, abssum = 0, amax = -10001, amin = 10001;
cin >> N;
vector<int> A(N);
rep(i, N) {
cin >> A[i];
abssum += abs(A[i]);
amax = max(amax, A[i]);
amin = ... | 0 | 99,510,209 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char **argv)
{
ll A, B; cin >> A >> B;
ll res{1ll<<60};
if (A <= B) res = min(res, B-A);
if (B >= -A) res = min(res, A+B+1);
if (B <= -A) res = min(res, -B-A+1);
if (A >= B) res = min(res, -B+A+2);
std::cout << res << std::end... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
long long int arr[n];
int i;
long long int sum=0,count=0;
for(i=0;i<n;i++)
{cin>>arr[i];
sum+=arr[i];
}
for(i=0;i<n;i++)
{
if(arr[i]*4*m>=sum)
count++;
}
if(count>=m)
... | 0 | 19,789,036 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
ll n;
ll x,m;
cin >> n >> x >> m;
vector<pair<ll,ll>> ord(m);
ll a = x;
ll sum = 0;
for(ll i = 0; i < n; i++){
if(ord[a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<bool> vb;
#define pb push_back
#define fi first
#define se second
#define in insert
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x... | 0 | 41,247,195 |
#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
#define int long long
using namespace std;
main(){
int n;
cin>>n;
int l=0,r=n;
cout<<0<<endl;
string pre,now;
cin>>pre;
int P=l;
r(i,30){
int mid=(l+r)/2;
cout<<mid<<endl;
cin>>now;
if(now=="Vacant")break;
if(P<mid&&(abs(P-mid)%2==0&&now==pr... | #include <bits/stdc++.h>
#define maxn 301000
using namespace std;
int fa[maxn], du[maxn];
int fst[maxn], co[maxn];
int n, m, e;
long long a, b, c;
struct str { int v, nex; } edge[maxn << 1];
bool dfs(int u) {
for (int i = fst[u]; i; i = edge[i].nex) {
int v = edge[i].v;
if (co[v] == co[u]) return false;
if (co[v... | 0 | 47,899,567 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int li;
typedef long double ld;
typedef vector<li> vi;
typedef pair<li,li> pi;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define f(i,l,r) for(li i=l;i<=r;++i)
#define fr(i,l,r) for(li i=l;i>... | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <functional>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
... | 0 | 93,935,845 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = a; i < (b + a); i++)
#define W1 while (1)
#define COUT(x) cout << x << endl
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) x.begin(),x.end()
#define P pair<int,int>
#define mod 1... | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
bool is_d(char c) {
if('1' <= c && c <= '9') return true;
return false;
}
in... | 0 | 54,781,344 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) nu... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 85,783,571 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef ve... | #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 <size_t I, class H, class... T> struct TupleReaderWriter{static tuple<H,T...> r(istream&i){H v;i>>v;return tuple_cat(tuple<H>(v),TupleReaderWriter<sizeof...(T... | 0 | 49,207,451 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
while(true) {
ll n, m; cin >> n >> m;
if (n == 0 && m == 0) break;
vector<pair<ll, ll>> roads;
for(ll i = 0; i < n; i++) {
int d, p; cin >... | #include "bits/stdc++.h"
#define REP(i, n, N) for(ll i=(n); i<(N); i++)
#define RREP(i, n, N) for(ll i=(N-1); i>=(n); i--)
#define LREP(lst,itr) for(auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define MCP(a, b) memcpy(b,a,sizeof(b))
#defi... | 0 | 55,094,154 |
#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) ... | #include<bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
#define FOR(i , a , b) for(int i = (a) ; i < (b) ; i++)
#define REP(i , n) for(int i = 0 ; i < n ; i++)
#define REPR(i , n) for(int i = n ; 0 <= i ; i--)
#define ROP(i, n) for(int i = 1 ; i <... | 0 | 17,645,752 |
#include <iostream>
using namespace std;
#include <vector>
int main(){
int n;cin >> n;
vector<int> a(n),b(n),c(n);
for(int i=0; i<n; i++) cin >> a.at(i) >> b.at(i) >> c.at(i);
vector<vector<int>> dp(n,vector<int>(3));
dp[0][0] = a.at(0);
dp[0][1] = b.at(0);
dp[0][2] = c.at(0);
for(int i=... | #include <iostream>
#include <queue>
#include <vector>
#define MAXSIZE 100000
using namespace std;
void calculate(vector<long long int>& lunlun_num)
{
queue<long long int> lunlun_temp;
for (int i = 1; i <= 9; i++){
lunlun_temp.push(i);
lunlun_num.push_back(i);
}
int count = 9;
while (count <= MAXSIZE)... | 0 | 25,094,422 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double A, B;
cin >> A >> B;
cout << 2*B-A;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <ctime>
#include <map>
#include <queue>
using namespace std; using ll=long long; using P=pair<ll,ll>; const int INF=1e9; const ll LNF=1e18;
int main(){
int n; cin>>n;
int a[n]; for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
int ... | 0 | 61,023,837 |
#include<iostream>
#include<string>
#include<sstream>
using namespace std;
int main()
{
string original;
int n;
getline(cin, original);
cin >> n;
while (n--) {
string order;
cin >> order;
int a, b;
cin >> a >> b;
if (order == "print") {
cout << original.substr(a, b - a + 1) << endl;
}
else if (ord... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"<<endl;
long long modpow(long l... | 0 | 47,620,810 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | #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;
int main(void){
int N, V, P; ll M; cin >> N >> M >> V >> P;
ll A[N]; rep(i, N) cin >> A[i];
sort(A, A+N);
int ng = -1, ok = N;
int m = (ng+ok)/2;
while(abs(ng-o... | 0 | 10,428,742 |
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
typedef long long int lli;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<lli> vlli;
typedef vector<bool> vb;
long long int max(long long int a,long long int b){
if(a>b)
return a;
else
return b;
}
long long int ... | #include<bits/stdc++.h>
#include<atcoder/all>
#define ll long long
#define rep(A,B,C) for(A=B;A<C;++A)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define all(A) A.begin(),A.end()
using namespace std;
using namespace atcoder;
ll N, Q;
ll i, j, k;
int main(){
cin >> N >> Q;
... | 0 | 18,477,392 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
int main(){
int N ;
cin >> N ;
for(int i = N ;; i++ ){
if(i%10 == (i%100)/10 && (i%100)/10 == i/100 ){
cout << i << endl;
return 0 ;
}
}
} | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll,ll> P;
typedef pair<double,ll> Pd;
typedef pair<double,double> PD;
typedef priority_queue<P,vector<P>,greater<P> >... | 0 | 35,053,346 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B;
ci... | #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... | 0 | 85,908,886 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
long long int ans = 0;
int bnum = 0;
for(int i = 0; i+1 < s.length(); i++){
if(s[i] == 'B') bnum++;
if(s[i] == 'B' && s[i+1] == 'W'){
ans += bnum;
s[i+1] = 'B';
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define chmax(a, b) a = (a >= b ? a... | 0 | 76,301,445 |
#include <algorithm>
#include <cstdio>
#include <utility>
using namespace std;
typedef pair<int,int> P;
int W,H;
bool used[200020];
int restx,resty;
P costs[200020];
int main(int argc, const char * argv[]) {
scanf("%d%d", &W,&H);
restx = W+1;
resty = H+1;
for(int i=0;i<W;++i) {
int p;
scanf("%d", &p);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1000000000;
const ll LINF = (ll) 4000000000000000000;
const ll MOD = (ll) 1000000007;
const double PI = acos(1.0);
const int limit = 100010;
#define REP(i,m,n) for(int i = (int)m... | 0 | 42,907,707 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define DECIMAL(n) std::cout << std::fixed;std::cout << std::setprecision(n);
#define hell 1000000007
#define narak 998244353
#define PI 3.14... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> p;
for (int i = 2; i <= N; i++){
bool prime = true;
for (int j = 2; j * j <= i; j++){
if (i % j == 0){
prime = false;
}
}
if (prime){
int tmp = 0;
int N2 = N;
while (N2 > ... | 0 | 40,047,975 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int gcd(int a, int b){
if (b == 0){
return a;
}
return gcd(b, a%b);
}
int main(){
int n, X;
cin >> n >> X;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N,K;
cin >> N >> K;
vector<long long>A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
if (N == 1){
if (A.at(0) == K){
cout << "POSSIBLE" << endl;
}
else {
cout << "IMPOSSIBLE" <<... | 0 | 54,599,468 |
#include <math.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define PI 3.14159265358979323846264338327950L
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
int main() {
int X, A, B;
cin >> X >... | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | 0 | 1,200,295 |
#include<iostream>
using namespace std;
int main(){
string s1, s2;
cin >> s1 >> s2;
cout<<(s1[0]==s2[2]&&s1[1]==s2[1]&&s1[2]==s2[0] ? "YES" : "NO")<<endl;
return 0;
} | #include<iostream>
#include<utility>
#include<algorithm>
using namespace std;
int main(){
int N,M;
while(cin>>N>>M && !(N==0 && M==0)){
pair<int,int>* road=new pair<int,int>[N];
for(int i=0;i<N;++i){
cin>>road[i].second>>road[i].first;
}
sort(road,road+N);
re... | 0 | 12,736,029 |
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>... | #include "bits/stdc++.h"
using namespace std;
void Main() {
long long N, K;
cin >> N >> K;
vector<pair<long long, long long>> ps(N, make_pair(0, 0));
vector<long long> X(N, 0), Y(N, 0);
for (long long i = 0; i < N; ++i) {
long long x, y;
cin >> x >> y;
ps[i].first = x;
... | 0 | 14,244,401 |
#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int N, M;
cin >> N >> M;
vector<std::pair<int, int>> cans(N);
rep(i... | #include<bits/stdc++.h>
using namespace std ;
int main () {
int n ;
cin >> n ;
string S ;
cin >> S;
int64_t cnt = 0 ;
vector<int64_t> A(3) ;
for(int i = 0 ; i < n ; i++){
if(S.at(i) == 'R') A.at(0)++ ;
if(S.at(i) == 'G') A.at(1)++ ;
if(S.at(i) == 'B') A.at(2)++ ;
}
int64_t max_... | 0 | 27,624,710 |
#include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
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; }
int main()
{
int N;
cin >> N;... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
#define int long long
typedef pair<int,int>pii;
const int mxN=1e5+10,M=1e9+7;
int n,k;
int mod(int a,int M){int ret=a%M;if(ret<0)ret+=M;return ret;}
int exp(int a,int b,int M){
if(b==0LL)return 1LL;
... | 0 | 84,117,064 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a, b, x, y;
scanf("%d%d%d%d", &a, &b, &x, &y);
printf("%lf %d\n", double(a)*double(b) / 2, x + x == a&&y + y == b);
} | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 0 | 91,730,273 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define MAX 1000001
ll prime[MAX];
long long mod;
ll rec(vector<vector<ll> >& dp,vector<ll>& arr,int n,int i,int k,int w)
{
ll ans=0;
if(i>=n)
return 0;
if(dp[i][k]!=-1)
return... | 0 | 14,838,540 |
#include<cstdio>
#include<math.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
int main()
{
ll n;
scanf("%lld",&n);
ll k=sqrt(n)+1;
while(n%k!=0)k--;
printf("%lld",k+n/k-2);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int a,b,c,d,maps[20][20];
void da(int x,int y){
if(x>a || y>b) return;
if(maps[y][x]==2) return;
if(x==a && y==b){d++;return;}
da(x+1,y);
da(x,y+1);
}
int main(){
while(1){
d=0;
cin>>a>>b;
if(a+b==0)break;
cin>>c;
int x,y;
f... | 0 | 97,758,421 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include<bits/stdc++.h>
#define ROCK 0
#define SCISSORS 1
#define PAPER 2
using namespace std;
int n,k,r,s,p;
string arr;
int dp[100005][4];
int f(int curr,int shape){
if(curr>=n) return 0;
int&ret=dp[curr][shape];
if(~ret) return ret;
for(int i=0; i<3; i++){
if(i!=shape) ret = max(ret,f(curr+k,i));
}
if(arr[c... | 0 | 63,216,648 |
#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 pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
using namespace std;
#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(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#defin... | 0 | 21,501,281 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define N 100005
#define ll long long
#define ull unsigned long long
#define loop1(i, j, k, step) for (int i=j; i<k; i+=step)
#define loop(i, j, k) for (int i=j; i<k; i++)
#define rloop1(i, j, k, step) for (int i=j; i>=k; i-=step)
#define rloop(i, j,... | #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;
using P = pair<int,int>;
using graph = vector<vector<char>>;
const int dx[4]... | 0 | 9,213,946 |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | #ifdef _WIN32
#pragma warning(disable:4996)
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <unordered_map>
using namespace std;
FILE* _fin = stdin;
FILE* _fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399375105820974
#define ten5... | 0 | 50,724,960 |
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
int n;
string b, c;
cin >> n;
for (int i = 0; i < n; i++){
int a[1010][1010] = {};
cin >> b >> c;
for (int x = 1; x <= b.size(); x++){
for (int y = 1; y <= c.size(); y++){
if (b[x - 1] == c[y... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec;
int H,W,d;
int main(int argc, char *argv[])
{
scanf("%d%d%d",&H,&W,&d);
int stride = (W/d+1)*d;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
int x,y;
x = strid... | 0 | 24,123,422 |
#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<bits/stdc++.h>
using namespace std;
#define INF 1000000000
int main(void){
int n; cin >> n;
for(int i = 0; i < n; i++){
string a, b; cin >> a >> b;
int num;
int a_num = 0, b_num = 0;
for(int i = 0; i < a.size(); i++){
int temp;
if('2' <= a[i] && a[i] <= '9'){
... | 0 | 69,775,409 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,l;cin>>n>>l;
string s;vector<string>v;
for(int i=0;i<n;i++)
{
cin>>s;
v.push_back(s);
}
sort(v.begin(),v.end());
for(auto w:v)
{
cout<<w;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define all(v) v.begin(),v.end()
#define pb push_back
#define endl '\n'
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vl... | 0 | 89,698,651 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(a - c) > d)
{
... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <random>
#include <tuple>... | 0 | 80,398,266 |
#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>;
vector<ll> divisor(ll n) {
vector<ll> f(n+1);
for (ll i = 2; i <= n; i++) f[i] = 2*i;
f[1] = 1;
for (ll i = 2; i <= (n+1)/2; i++) {
for (ll j = i * 2; j <= n; j += i) {... | #include <iostream>
#include <algorithm>
#include <string>
#include <limits.h>
using namespace std;
int main()
{
int n, a, b;
cin >> n >> a >> b;
if ((a ^ b) & 1) {
cout << "Borys" << endl;
}
else {
cout << "Alice" << endl;
}
return 0;
} | 0 | 91,741,209 |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,a,n) for(i=a;i<n;i++)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> dp(2001, 0);
dp[0] = 1;
for (int i = 3; i <= n; ++i) {
for (int j = 3; j <= i; ++j) {
if (dp[i - j]) {
... | 0 | 8,710,205 |
#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, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
int now = 1;
int cnt = 0;
rep(i, n) {
if (s[i] == (now + '0')) {
++cnt;
} else {
v.push_ba... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();... | 0 | 76,995,558 |
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
int map[15][15];
void floyd(int n)
{
for(int k=0;k<=n;k++)
{
for(int i=0;i<=n;i++)
{
for(int j=0;j<=n;j++)
{
map[i][j]=min(map[i][j],map[i][k]+map[k][j]);
}
}
}
}
int main()
{
int n,i,j,a,b,t;
wh... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | 0 | 9,596,972 |
#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>;
int main(){
string C[2];
cin >> C[0] >> C[1];
reverse(C[0].begin(),C[0].end());
if(C[0]==C[1]) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 9,597,780 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
vector<int> a(n+1), b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
ll save=0;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define vii vector<int>
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pdd pair<double,double>
#define pldld pair<long long double, long long double>
#define ff first
#define ss second
#define pb pu... | 0 | 1,064,789 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
map<int, int> mp;
rep(i, n){
int a;
... | 0 | 42,623,474 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
... | 0 | 21,454,525 |
#include <bits/stdc++.h>
using namespace std;
void Main()
{
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 0; i < k; i++)
{
vector<int> p1(n), p2(n+1);
for (int j = 0; j < n; j++)
{
p1[max(0... | #include<bits/stdc++.h>
#define ll long long int
#define vl vector<ll>
#define pb push_back
using namespace std;
int main()
{
ll t,tp,mx=0,c=0,n,i,j,k;
cin >> n;
vl v(n+1,0);
for(i=1;i<=n;i++)
cin >> v[i];
set<ll> s;
s.insert(1);c=0;
i=1;
while(true)
... | 0 | 18,678,769 |
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
#define MAXL 8005
char S[MAXL];
vector<int> v[2];
bool dp[MAXL][MAXL];
int main() {
int L;
int x[2];
scanf("%s%d%d", S, x, x + 1);
for(L = 0; S[L]; L++);
int c = 0, lt = L;
for(int i = L - 1; i >= 0; i--) if(S[i] == 'T') {
v[c].push_... | #include <iostream>
using namespace std;
int main( void )
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << ( ( a + b ) > ( c + d )
? "Left"
: ( ( a + b ) < ( c + d ) ? "Right" : "Balanced" ) )
<< endl;
return 0;
} | 0 | 51,158,723 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define sz(x) (int)(x... | #include<cstdio>
#include<algorithm>
#define N 200005
#define LL long long
using namespace std;
struct node
{
int s,nxt;
}p[N<<1];
int h[N],t[N];
LL f[N];
int n,tot;
void adeg(int x,int y)
{
p[++tot].s=y; p[tot].nxt=h[x]; h[x]=tot;
}
int main()
{
int i,j;
scanf("%d",&n);
for(i=1;i<n;i++)
{
int u,v;
scanf("%d%... | 0 | 48,980,959 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a[5]={0};
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a,a+5);
cout << a[4] << " "<< a[3]<< " "<< a[2] <<" "<< a[1] <<" "<< a[0] << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | 0 | 96,061,867 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using Pll = pa... | #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;
bool ok = true;
if (s[0] != 'A')
ok = false;
int cnt = 0;
for (int i = 2; i <= s.size() - 2; i++)
{
i... | 0 | 43,887,223 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) (x).begin(),(x).end()
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } r... | #include <iostream>
#include <utility>
static void bsort(char c[][3], int n) {
for (int i = 0; i < n; ++i) {
for (int j = n - 1; j > i; --j) {
if (c[j][1] < c[j - 1][1]) {
std::swap(c[j], c[j - 1]);
}
}
}
}
static void ssort(char c[][3], int n) {
for (... | 0 | 61,801,775 |
#include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
cout << ++c;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#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)
vector<ll> takahashi;
vector<ll> aoki;
bool custom_1(int a, int b) {
if(takahashi[a] - aoki[b] == takahashi[b... | 0 | 82,984,833 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
vector<int> ve[N];
priority_queue<int> qe;
int main()
{
int n,m,sum=0;
cin>>n>>m;
int a,b;
for(int i=1;i<=n;i++)
{
cin>>a>>b;
if(m-a+1>0)ve[m-a+1].push_back(b);
}
for(int i=m;i>0;i--)
{
for(int j=0;j<ve[i].size();j++)qe.push(ve[i][j]);
if(q... | #include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ll long long
#define sl set<ll>
#define vs vector<string>
#define pb push_back
#define vl vector<ll>
#define vi vector<int>
#define PI 3.14159265
#define mod 998244353
void solve(int a[],int st,int anth)
{
for(int i=st;i<anth;i++)
{
... | 0 | 34,301,041 |
#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main() {
double a, b, c;
while( cin >> a >> b >> c ) {
double area = a * b * sin(c * M_PI / 180) / 2;
double d = sqrt(a * a + b * b - 2 * a * b * cos(c * M_PI / 180 ));
double premeter = a + b + d;
double h = area * 2 / a;
cout << fix... | #include<bits/stdc++.h>
typedef long long int ll;
#define ull unsigned long long int
#define lld long double
#define endl "\n"
#define fi first
#define sec second
#define sp setprecision
#define lb lower_bound
#define ub upper_bound
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b)... | 0 | 79,658,618 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <cassert>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <vector>... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
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;}
using namespace std;
using ll = long long;
using P = pair<in... | 0 | 63,332,936 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#define rep(i,n) for (long long int i = 0; i < (n);... | #include<bits/stdc++.h>
using namespace std;
#define gc getchar
#define gcu getchar_unlocked
#define pc(x) putchar(x);
#define pcu(x) putchar_unlocked(x);
#define ll long long int
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll gcd(ll a, ll b)
{
if(b==0)
return a;
else
... | 0 | 90,457,046 |
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<set>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) scanf("%d%d%d",&a... | #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;
cin >> n;
ll ans=0;
ll a=10;
ll b=0;
if(n%2==1)
cout << ans << endl;
else{
while(n>=a){
... | 0 | 78,786,239 |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
#define N 1010
#define Max 0x3f3f3f3f
int n, m, x;
int maps[N][N], dis[N], vis[N];
int dij(int x)
{
int i, j, pos, Min, sum=0;
for(i=0; i<=n; i++)
{
dis[i]=maps[i][x]... | #include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;r... | 0 | 13,363,130 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll mkval(string s){
if(s=="Vacant"){
return 0;
}else if(s=="Male"){
return 1;
}else{
return 2;
}
}
signed main(){
ll n,now,left,right,m,fi;
string s;
cin >> n;
cout << 0<... | #include <cstdio>
#include <algorithm>
#define max_n 100000
using namespace std;
int a[max_n+1];
int main(){
int n;
scanf("%d",&n);
for(int i=0; ++i<=n; scanf("%d",a+i));
stable_sort(a+1,a+n+1),a[0]=0;
int t=lower_bound(a+1,a+n+1,a[n]>>1)-a;
printf("%d %d\n",a[n],a[n]>a[t]+a[t-1]?a[t]:a[t-1]);
return 0;
} | 0 | 37,781,037 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout << #x << " = " << (x) << endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using M = map<int,int>;
using PQ = priority_queue<int>;
using ... | #include <iostream>
#include <cstring>
using namespace std;
char s[100000000];
int main()
{
int n, m, i, j, k;
char a[80], b[80], c;
bool f = false;
while (cin >> n && n)
{
for (i = 0; i < n; i++)
{
cin >> a[i] >> b[i];
}
cin >> m;
strcpy(s, "");
for (i = k = 0; i < m; i++)
{
cin >> c;
for (... | 0 | 16,919,048 |
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | #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;
#define all(q) (q).begin(),(q).end()
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)
#de... | 0 | 27,494,119 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string str;
getline(cin,str);
for ( int i = 0 ; str[i] != '\0' ; i++){
if ( (str[i] >= 'a') && (str[i] <= 'z')){
str[i] -= 32;
}else if ( (str[i] >= 'A') && (str[i] <= 'Z')){
str[i] += 32;
}
}
cout << str << end... | #include <stdio.h>
int main() {
int H[50] = {};
int W[50] = {};
int n = 0;
for (;;) {
scanf("%d %d", &H[n], &W[n]);
if (H[n] == 0)break;
n++;
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < H[k]; i++) {
for (int j = 0; j < W[k]; j++) {
if (i == 0 || j == 0 ||
i == H[k] - 1 || j == W[k]-1)
... | 0 | 72,707,221 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
string str = to_string(N);
string res;
if(str.find("7") != string::npos){
res = "Yes";
} else {
res = "No";
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cstring>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, int> ll_i;
struct edge {... | 0 | 72,193,416 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e3 + 5, mod = 1e9 + 7;
int dp[N][N][3];
int a[N], b[N];
int n, m;
int solve(int i, int j, int s) {
if (i == n || j == m) return s == 0;
int &ret = dp[i][j][s];
if (ret != -1) return ret;
ret = 0;
if (s == 0) {
... | #include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <algorithm>
using namespace std;
#define forn(i, n) for(int i = 0; i < (int)(n); i++)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define forab(i, a, b) for(... | 0 | 36,667,214 |
#include <cstdio>
int main(){
int n;
int a[6] = {500,100,50,10,5,1};
while(scanf("%d",&n), n!= 0){
int t = 0;
n = 1000 - n;
for(int i = 0; i < 6; i++){
t += n / a[i];
n %= a[i];
}
printf("%d\n",t);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, X, Y; cin >> N >> M >> X >> Y;
int x=-101,y=101;
int curr;
for(int i = 0; i < N; ++i) {
cin >> curr;
if(curr > x) x = curr;
}
for(int i = 0; i < M; ++i) {
cin >> curr;
y = curr < y ? curr : y;
... | 0 | 72,952,722 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 1000000000000000;
double sqrtNum = sqrt(n);
sqrtNum += 0.5;
int i = 0;
whil... | #include <iostream>
using namespace std;
#define MAX_SIZE 300
int T[MAX_SIZE];
int parent(int i) { return i / 2; }
int left(int i) { return i * 2; }
int right(int i) { return i * 2 + 1; }
int main() {
int H;
cin >> H;
for (int i = 1; i <= H; i++) cin >> T[i];
for (int i = 1; i <= H; i++) {
cout ... | 0 | 43,321,616 |
#include <iostream>
#include <complex>
using namespace std;
int main()
{
const double EPS = 1e-10;
const double PI = 4.*atan(1.);
int n;cin>>n;
for ( int i=0; i<n; i++ )
{
double x1,y1,x2,y2,x3,y3,x4,y4;
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
complex<double> A(x1,y1),B(x2,y2),C(x3,y3),D(x4,y4);
double a = ar... | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int main() {
int n,k;
cin>>n>>k;
int A[n];
for(int i=0;i<n;i++)
{
cin>>A[i];
}
int dp[n][k+1];
int presum[k+1];
for(int i=0;i<n;i++)
{
for(int j=0;j<=k;j++)
{
if(i==0)
{
if(j>A[i])
dp[... | 0 | 39,079,918 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.