code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S ... | 0 | 25,755,081 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int mod = 1e9+7;
int main(){
int H, W;
cin >> H >> W;
vector<vector<int>> dp(H, vector<int>(W,0));
vector<vector<char>> A(H, vector<char>(W));
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >> A[i][j];
}
}
dp[0][0] = 1;
for(i... | 0 | 33,135,396 |
#include <string>
#include <utility>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
string S;
cin >> S;
for (string::size_type i = 0; i < S.size() / 2; i++)
{
swap(S[i], S[S.size() - i - 1]);
}
for (string::size_type i = 0; i < S.size(); i++)
{
cout << S[i];
}
cout << endl;
ret... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
template<class T>
inline bool chmax(T &a, T b) {
... | 0 | 35,077,901 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef pair<int, int> p... | #include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define f(a,b) for(ll i = a ; i < b ; i++ )
#define fj(a,b) for(ll j = a ; j < b ; j++ )
#define fk(a,b) for(ll k = a ; k < b ; k++ )
#define fasthoja ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
vector<string> v;
void perm... | 0 | 93,031,097 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) r... | #include <bits/stdc++.h>
typedef long long int int64;
struct vertex {
int i;
int64 val;
int size;
int parent;
int next,child;
int depth;
} v[100003];
void dfs(int i)
{
for(int j = v[i].child;j != -1;j = v[j].next) {
v[j].depth = v[i].depth + 1;
dfs(j);
}
}
int n;
bool cmp1(const vertex &a,const vertex &b) {... | 0 | 79,820,066 |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k, m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(k<'0'|... | #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... | 0 | 43,688,300 |
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int h=1, w=1;
while (h != 0 && w != 0) {
cin >> h;
cin >> w;
if (h == 0 && w == 0) continue;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (i == 0 || i == h - 1) {
cout << "#";
}
else {
if (j ==... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
vector<int>A(N);
vector<int>cnt(N+1);
for(int i = 0; i < N; i++) {
cin >> A[i];
cnt[i+1... | 0 | 77,706,626 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll s[100009];
ll t[100009];
int main(){
int n,k;
int a[100009];
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
s[i]=s[i-1]+a[i];
t[i]=t[i-1]+max(a[i],0);
}
ll ans=s[n];
for(int i=1;i<=n-k+1;i++){
ans=max(ans,t[i-1]+(s[i+k-1]-s... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m;
cin>>n;
vector<int>a(n);
if(n%2==0){
for(int i=0;i<n;i++){
cin>>m;
if(i%2==1)a[n/2-i/2-1]=m;
if(i%2==0)a[n/2+i/2]=m;
}
}else{
for(int i=0;i<n;i++){
ci... | 0 | 91,437,620 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i++) {
int cnt = 0;
if (i % 2 == 0) continue;
for (int j = 1; j <= i; j++) {
if (i % j == 0) cnt++;
}
if (cnt == 8) ans++;
}
cout << ans << endl;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
while(cin >>n,n){
long long int d[10][10];
int m=0;
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
if(i == j) d[i][j] = 0;
else d[i][j] = 1000000000;
}
}
for(int i=0,a,b,c; i<n; i++){
cin >>a>>b... | 0 | 99,182,140 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int p,q,r; cin >> p >> q >> r;
int ans1=INF,ans2=INF;
ans1 = min(p+q,r+q);
ans2 = min(r+p,q+p);
int ans = min(an... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
ll MOD = po... | 0 | 45,949,582 |
#include <iostream>
using namespace std;
int main(){
int root[5][51], i, j;
for (i = 0; i < 5; i++) {
for (j = 0; j < 51; j++)
root[i][j] = 0;
}
for (i = 0; i < 10; i++) {
root[1][i] = 1;
}
for (i = 1; i < 5; i++) {
root[i][0] = 1;
}
for (i = 2; i < 5; i++) {
for (j = 1; j < 51; j++) {
for (int k ... | #include <bits/stdc++.h>
using namespace std;
vector<int> edge[1000010];
int n,poi[1000010],u,v;
void dfs(int u,int fa)
{
poi[u]=0;
for(auto v : edge[u])
{
if(v==fa) continue;
dfs(v,u);
poi[u]^=poi[v]+1;
}
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n-1;++i)
{
... | 0 | 99,000,096 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w,i,j;
cin>>h>>w;
vector<string> a(h);
vector<int> r,c;
for(i=0;i<h;i++){
cin>>a.at(i);
for(j=0;j<w;j++) if(a.at(i).at(j)=='#') break;
if(j==w) r.push_back(i);
}
r.push_back(h);
for(j=0;j<w;j++){
for(i=0;i<h;i++) if(a.at(i).a... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#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 pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int maxn = 6e5 + 5;
int main() {
ios_base::sync_with_stdio(0);
c... | 0 | 38,598,686 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
ll x,y;
cin >> x >> y;
int n = 1;
while(x>y || 2*x<=y){x += x; n++;}
cout << n << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << endl;
#define CFYN(... | 0 | 5,187,111 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int n;
ll k;
cin>>n>>k;
vector<pair<ll,ll>> v(n);
rep(i,n) cin>>v[i].first>>v[i].second;
sort(v.begin(),v.end());
... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i... | 0 | 75,302,711 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep... | 0 | 24,109,369 |
#include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr<<x<<END;
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int i = (b); i > (a); --i)
const int mod... | #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
int a,b,C;
cin >> a >> b >> C;
printf("%.4f\n%.4f\n%.4f\n"
,a*b*sin((double)C/180*M_PI)/2
,a+b+sqrt((double)pow(a,2)+pow(b,2)-2*a*b*cos((double)C/180*M_PI))
,b*sin((double)C/180*M_PI));
return 0;
} | 0 | 48,727,058 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | 0 | 96,810,081 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#inc... | 0 | 61,191,908 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #ifdef __APPLE__
# include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
# include <bitset>
# include <map>
# include <queue>
# include <ctime>
... | 0 | 20,869,571 |
#include <iostream>
using namespace std;
int main() {
int N, tmp, A[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> tmp;
A[i] = tmp - 1;
}
int index = 0, res = -1;
for (int i = 0; i < N; i++) {
index = A[index];
if (index == 1) {
res = i + 1;
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;n>i;++i)
using namespace std;
using ll=int64_t;
using vi=vector<int>;
using VI=vector<ll>;
using vis=vector<string>;
using vvi=vector<vi>;
int gcd(int a,int b){
if(a%b==0)
return b;
return gcd(b,a%b);
}
int main(){
int N,Y;
cin>>N>>Y;
for(int ... | 0 | 71,570,316 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep2(i,s,n) for (int i = s; i < n; ++i)
#define all(a) a.begin(),a.end()
#define tmax(a,b,c) max(a,max(b,c))
#define tmin(a,b,c) min(a,min(b,c))
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int,int>;
template<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 90,712,407 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
#define MODSIZE 1000000007
int main(){
char a[14],b[14],c[14];
int na,nb,nc;
int cnt[27] = {0};
scanf("%s %s %s", a, b, c);
na = strlen(a);
nb = strlen(b);
nc = strlen(c);
if(a[na - 1] == b[0... | #include <bits/stdc++.h>
using namespace std;
long long h,w,n,u,v,s,t,cs=0,kq[15],dem,p,q;
struct st{
long long x,y;
};
st a[1000010];
bool cmp(st c, st d){
if (c.x==d.x) return c.y < d.y;
else return c.x < d.x;
}
int main()
{
cin >> h >> w >> n;
for (long i=1;i<=n;i++){
cin >> u >> v;
... | 0 | 34,505,318 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; i++)
char a[510][510];
int main(){
rep(i,2) rep(j,3) cin >> a[i][j];
bool ok = true;
rep(j,3) if(a[1][j] != a[0][2-j]) ok = false;
cout << (ok ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n,a[1<<18],b[1<<18],ans,x,y;
int main(void){
cin>>n;
for(int i=0;i<1<<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
for(int j=0;j<1<<n;j++){
if(j&(1<<i)){
x=a[j^(1<<i)],y=b[j^(1<<i)];
if(a[j]<x)swap(a[j],x);
... | 0 | 58,706,980 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | #include <iostream>
#include <vector>
#include <map>
typedef long long LL;
using namespace std;
#define NIL -1
vector<LL> num_div={1,3,5,15,25,75};
vector<LL> num_list;
LL num_lim;
LL dfs(LL idx, LL x){
if(x==1){
return 1;
}else if(idx==num_lim){
return 0;
}
LL ans=0;
for(LL i=0; i<n... | 0 | 23,144,316 |
#include <iostream>
using namespace std;
int main() {
char b;
for(int i=0;i<5;i++){
char a;
cin>>a;
cout<<a;
}
cin>>b;
cout<<" ";
for(int i=0;i<7;i++){
char a;
cin>>a;
cout<<a;
}
cin>>b;
cout<<" ";
for(int i=0;i<5;i++){
char a;
cin>>a;
cout<<a;
}
cout<<endl;
} | #include <bits/stdc++.h>
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define iter_(i,n) for (int i = 0; i < int(n); i++)
#define for_n(i, n) for (int i = 1; i <= int(n); i++)
#define ... | 0 | 28,258,901 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MAXN = 100001;
const int MOD = 1000000007;
long fact[MAXN];
long long pw(long long a, int b) {
if (b == 0) return 1;
long long x = pw(a, b / 2);
x *= x;
x %= MOD;
if (b % 2 == 0) return x;
return x * a % MO... | #include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define ll... | 0 | 81,911,773 |
#include <iostream>
#include <numeric>
#include <iomanip>
#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 <uno... | #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... | 0 | 40,206,715 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int a,b; cin>>a>>b;
int c=a/0.08,d=b/0.1;
if(c>d) swap(c,d); --c; ++d;
while(c<=d){
if(floor(c*0.08)==a&&floor(c*0.1)==b) break;
else ++c;
}
if(c>d) cout<<-1; else cout<<c;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n,j=0,k=0;
cin>>n;
long a[n],b[n],c[200010];
for(long i=0;i<n;i++)cin>>a[i]>>b[i];
for(long i=0;i<n;i++)k+=a[i];
for(long i=0;i<200010;i++)c[i]=1000000001;
for(long i=0;i<n;i++){
if(a[i]>b[i]){
c[j]=b[i];
j++;
}
}
sort(c,c +n);
if(j>0){... | 0 | 2,564,430 |
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include<string>
using namespace std;
int main()
{
long long int n,m,y,p;
cin>>n>>m;
y=n*n+m*m-n-m;
p=y/2;
cout<<p;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int x, n;
cin >> x >> n;
int *p = new int[n];
for (int i = 0; i < n;i++)
{
cin >> p[i];
}
int sml = INT_MAX;
int lar = INT_MIN;
int flag = 0;
for (int i = 0; i <= n;i++)
{
flag = 1;
... | 0 | 86,976,294 |
#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main(){
double L, l, V;
std::cin >> L;
l = L/3.0;
V = pow(l, 3.0);
std::cout << std::fixed;
std::cout << std::setprecision(7) << V;
} | #include<stdio.h>
bool exist[244140625];
int getnum(char *s){
int i = 0;
while(s[i] != '\0')
i++;
i--;
int j = 0,k = 1;
while(i >= 0){
if(s[i] == 'A')
j += k;
else if(s[i] == 'C')
j += k * 2;
else if(s[i] == 'G')
j += k * 3;
... | 0 | 91,714,174 |
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<... | 0 | 93,625,908 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
string s;
int br0=0,br1=0;
cin >> s;
for (int i=0;i<s.size();i++)
{
if(s[i]=='0')
br0++;
else
br1++;
}
cout << 2*min(br0,br1);
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long a;
string b;
cin>>a>>b;
int ans;
ans+=(b[0]-'0')*100;
ans+=(b[2]-'0')*10;
ans+=(b[3]-'0');
long long d=a*ans/100;
cout<<d<<endl;
} | 0 | 24,789,389 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i<n;i++)
#define vv(Type,Name, n,m,d)vector<vector<Type>> Name(n, vector<Type>(m, d))
#define P pair
using namespace std;
using ll = long long;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
cout << 6 - a - b << endl;
retu... | #include <iostream>
#include <cmath>
using namespace std;
int main(){
double x1, y1, x2, y2, x3, y3, x4, y4;
int n;
cin >> n;
for(int p=0; p < n; p++){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
x1 -= x2; y1 -= y2; x3 -= x4; y3 -= y4;
cout << (abs(x1*y3-y1*x3) < 1e-10?"... | 0 | 81,789,835 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll res[100005];
ll niz[100005];
int main(){
ios_base::sync_with_stdio(false);
int n;
cin >> n;
for(int i=1; i<=n; i++){
cin >> niz[i];
}
deque <int> q;
for(int i=n; i>=1; i--){
while(!q.empty() && niz[q.back(... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr double EPS = 1e-12;
int main(){
int n;
cin >> n;
vector<int64> a(n);
for(int i = 0; i < n; ++i){
cin >> a[i];
}
for(int i = 0; i < n; ++i){
if(a[i] == 0LL){
cout << 0 << endl;
return 0;
}
}
double ke... | 0 | 14,123,395 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
map<char, int> cnt;
for(int i = 0; i < n; i++){
char now = s.at(i);
cnt[now]++;
}
long long ans = 1, mod = pow(10,9) + 7;
for(auto now : cnt) ans = ans * ++now.second % mod;
ans = (ans + mod -1) % mod;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
const int INF = 1e9;
int main() {
string S;
cin >> S;
int ans = 0, l = 0, r = S.size() - 1;
while (r - l > 0) {
if (S[l] == S[r])
++l, --r;
else {
if ... | 0 | 93,908,078 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #include<bits/stdc++.h>
#define lli long long int
using namespace std;
int ar[10005];
lli dp[10005][200][2];
lli getSum(int pos , int n , lli d, lli sum , bool flag)
{
if(pos > n) {
if(sum==d) return 1;
return 0;
}
if(dp[pos][sum][flag] != -1) return dp[pos][sum][flag];
int limit = 9;
if(!flag) limit = ar[pos]... | 0 | 72,474,998 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int k, a, b;
cin >> k >> a >> b;
if (a <= b / k * k)cout << "OK" << endl;
else cout << "NG" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
vector<ll> nums(N);
for (int i = 0; i < N; i++)
{
cin >> nums.at(i);
}
vector<ll> ruisekiMod(N + 1);
... | 0 | 56,864,107 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n, m;
cin >> n >> m;
vector<ll> x(n), y(n), z(n);
for(int i=0; i<n; i++){
cin >> x[i] >> y[i] >> z[i];
}
ll ans = 0;
for(int i=-1; i<=1; i+=2){
for(int j=-1; j<=1; ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
string s, t;
cin>>s>>t;
int ls = s.length(), lt = t.length(), i, j, k, c, maxval=0;
for(i=0; i<=(ls-lt); i++){
for(j=i, k=0, c=0; j<i+lt && k<lt; j++, k++){
if(t[k]==s[j]) c++;
}
maxval = ma... | 0 | 48,622,262 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <string>
#include <math.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<int,int> P;
#define M 1000000007
#define F first
#... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define REP(i,n) for(ll i = 0;i < (ll)n;i++)
#define REPD(i,n) for(ll i = (ll)n - 1;i >= 0;i--)
#define ALL(x) (x).begin(),(x).end()
#define FILLl(n,first_dimension_size,value) fill((ll*)n,(ll*)(n+first_d... | 0 | 76,965,603 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int,int> ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 87,052,894 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int,int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i,n) for(int i=0;i<(n);++i)
#define OREP(i,n) for(int i=1;i<=(n);++i)
#define RREP(i,n)... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define precise cout.precision(10); cout << fixed;
#define endl "\n"
#define int int64_t
#define ll long long
#define yes printf("Yes\n")
#define no printf("No\n")
#define push_back pb
int32_t main()
{
long ... | 0 | 16,595,152 |
#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... | #include <iostream>
#include <stdlib.h>
#include <math.h>
using namespace std;
int main() {
double x1, y1, x2, y2, x3, y3, xp ,yp,ss,s1,s2,s3;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>xp>>yp){
ss=fabs((x3-x1)*(y2-y1)-(x2-x1)*(y3-y1));
s1=fabs((x3-xp)*(y2-yp)-(x2-xp)*(y3-yp));
s2=fabs((x3-xp)*(y1-yp)-(x1-xp)*(y3-yp));
s3=fabs... | 0 | 64,100,228 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T1, typename T2>
istream& operator>>(istream& os, pair<T1, T2>& p) {
os >> p.first >> p.second;
return os;
}
int main() {
ll n, d, a;
cin >> n >> d >> a;
vector<pair<ll, ll>> v(n);
for (ll i = 0; i < n; ++i)cin >> v[i];
sort(v.b... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
priority_queue<ll> q;
ll all=0;
for(int i=0; i<n; i++){
ll a;
cin >> a;
q.push(a);
all += a;
}
ll discount = 0;
for(int i=0; i<m; i++){
ll use;
... | 0 | 24,501,409 |
#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include ... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 20,208,028 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
string s;
ll n,k; cin>>n>>s... | #include <algorithm>
#include <array>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
array<int, 3> counter{};
int a, b;
cin >> a >> b;
for (int i = 0; i < n; i++)
... | 0 | 23,117,947 |
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
#include<iomanip>
#include<math.h>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
typedef long long ll;
#define INF 1000000000000000LL
int main(){
ll N; cin >> N;
ll a[N+1];
ll node = 0;
rep(i, N+1){
... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | 0 | 80,412,973 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map... | #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 | 65,931,085 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if(n<=111)
cout<<"111\n";
else if(n>111 && n<=222)
cout<<"222\n";
else if(n>222 && n<=333)
cout<<"333\n";
else if(n>333 && n<=444)
cout<<"444\n";
else if(n>444 && n<=555)
cout<<"5... | #include<bits/stdc++.h>
#define N 100005
using namespace std;
int n,L,T;
int pos[N],v[N];
int main(){
scanf("%d%d%d",&n,&L,&T);
for(int i=1;i<=n;i++) scanf("%d%d",&pos[i],&v[i]),v[i]=v[i]==1? 1:-1;
vector<int> fin;
for(int i=1;i<=n;i++)
fin.push_back(((pos[i]+v[i]*T)%L+L)%L);
int pos1=fin[0]... | 0 | 56,723,248 |
#include <iostream>
using namespace std;
int main(void) {
int n;
int score, sum_score;
int max_score, min_score;
int i;
cin >> n;
while (n) {
sum_score = 0;
max_score = 0;
min_score = 1000;
for (i=0; i<n; i++) {
cin >> score;
sum_score += s... | #define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _ov... | 0 | 79,665,651 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define SF scanf
#define PF printf
#define MAXN 200010
using namespace std;
int n;
struct node{
int x;
node *nxt;
}edge[MAXN*2];
node *head[MAXN],*ncnt=edge;
void add_edge(int x,int y){
ncnt++;
ncnt->x=y;
ncnt->nxt=head[x];
h... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
string O, E, ans = ""; cin >> O >> E;
int e = E.length(), j = 0, k = 0;
for (int i = 0; i < 2 * O.length(); ++i) {
if (i % 2 == 0) {
ans += O[j];
j++;
}
... | 0 | 88,271,650 |
#include <bits/stdc++.h>
using namespace std;
int dp1[2][32010], dp2[2][32010], *DP1[2] = {(dp1[0]+16005),(dp1[1]+16005)}, *DP2[2] = {(dp2[0]+16005),(dp2[1]+16005)};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
int x, y, c = 0, cur = 0, t = 0;
vector<int> xmoves, ymoves;
cin >> s;
cin >> x... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(),(c).end()
template <class T, class U... | 0 | 20,002,790 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#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 <cst... | 0 | 36,440,971 |
#include<bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
long N,M; cin >> N >> M;
vector<pair<long,long>> drink(N,make_pair(0,0));
for (int i = 0; i < N; i++) {
long a,b; cin >> a >> b;
drink[i] = make_pair(a,b);
}
sort(dr... | #include <bits/stdc++.h>
using namespace std;
void Show(int s){
int i=1,l,r;
while(1){
if(i == 1){
l = 100;
r = 111;
}
else{
r = 100 * i + 10 * i + i;
l = r - 110;
}
if(l <= s && s <= r){
cout << i << i << i << e... | 0 | 23,207,226 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int W, H, N;
cin >> W >> H >> N;
... | #include <bits/stdc++.h>
#define REP(i,s,e) for(int i=(s); i<(e);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n)
#define repe(i,n) for(auto &&i:n)
#define all(v) (v).begin(),(v).end()
#define decimal fixed<<setprecision(20)
#define fastcin() cin.tie(0);ios::sync_with_stdio(false)
using LL = long long;
usi... | 0 | 4,090,549 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
string yes = "Yes\n";
string no = "No\n";
int main()
{
int a,b,c,d; cin >> a >> b >> ... | #include<iostream>
using namespace std;
int main(){
int n, x;
int S = 0;
while(1){
cin >> n >> x;
if((n == 0) && (x == 0))break;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
for(int k = 1; k <= n; k++){
if(((i + j + k) == x... | 0 | 79,442,518 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> button(n);
for (int i = 0; i < n; i++)
cin >> button.at(i);
int i;
bool meetTwo = false;
int num = button.at(0);
for (i = 0; i < n; i++){
if (num == 2){
meetTwo = true;
break;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 59,417,738 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int main(){
int n,h,m,s;
char str;
int temp;
while(1){
int t[86401]={0};
int max=t[0];
cin>>n;
if(n==0)
break;
for(int i=0;i<n;i++){
cin>>h>>str>>m>>str>>s;
temp=h*3600+m*60+s;... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};... | 0 | 65,795,622 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<l_l> vpl;
typedef vector<string> vs;
typedef pair<l_l,ll> lll;
#define pb push_back
#define sz... | bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x... | 0 | 40,277,713 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i =... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll k,a,b; cin >> k >> a >> b;
ll ans = 1;
ll dif = b-a;
if(a+2>=b) ans = 1 + k;
else if(1+k-2<a) ans = 1 + k;
else{
ans = a;
k = k - (a-1);
if (k%2!=0){
k--;
ans ++;
... | 0 | 28,813,366 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int a;
cin >> a;
int tmp = a;
int count=1;
int ans=0;
for(int i=1; i<N; i++){
cin >> a;
if(tmp==a) count++;
else{
ans += count/2;
count=1;
tmp = a;
}
}
ans+=count/2;
cout << ans << endl;
r... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
int main() {
int n, cnt = 0, ans = 0;
cin >> n;
rep2(i, n) {
rep2(j, i) {
if (i % j == 0)
cnt++;
}
... | 0 | 54,112,192 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
string s;
char res1;
int res2;
for(int i=1;i<=h;i++){
for(int j=0;j<w;j++){
cin >> s;
if(s=="snuke"){
res1=j+'A';
res2=i;
break;
}
}
}
cout << char(res1) << res2 << endl... | #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... | 0 | 88,038,271 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define ss... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r=0,g=0,b=0;
rep(i,n) {
if (s[i] == 'R') {
r++;
}
else if (s[i] == 'G') {
g++... | 0 | 89,917,659 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define int long long
signed main() {
int n, a, b;
cin >> n >> a >> b;
int cycle = a + b;
int loop = n / cycle;
int blue = a * loop;
int left = n - cycle * loop;
left = min(left, a);
blue += left;
cout <... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
using namespace std; using ll = long long; using ld = long double; ... | 0 | 94,281,243 |
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <set>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <string>
#include <sstream>
#include <cstdlib>
#include <ctime>
#include <cassert>
using namespace std;
typedef long long LL;
typedef pair<int,int>... | #include <bits/stdc++.h>
using namespace std;
int main(){
int k;
cin >> k;
vector<long long> A(k);
for (int i = 0; i < k; ++i){
cin >> A[i];
}
long long minv = 2, maxv = 2;
for (int i = k - 1; i >= 0; --i){
long long tmp1;
if (minv % A[i] == 0){
tmp1 = minv;
}else{
tmp1 = A[i]*(m... | 0 | 64,168,575 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, K;
cin >> N >> K;
vector<int64_t> A(N), S(N + 1, 0);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
A.at(i)--;
S.at(i + 1) = (S.at(i) + A.at(i)) % K;
}
map<int64_t, int64_t> mp;
for (int i = 0; i < min(K, N + 1); i++)
{
... | #include<bits/stdc++.h>
using namespace std;
#define speed() ios::sync_with_stdio(0);cin.tie(0);
#define file() freopen ("input.txt", "r", stdin);freopen ("output.txt", "w", stdout);
#define rep(i,a) for(ll i=0;i<a;i++)
#define rep1(i,begin,end) for(ll i=begin;i<=end;i++)
#define mem(dp,i) memset(dp,i,sizeof(dp))
#defi... | 0 | 36,215,224 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
int main(){
ll n; int x, m; cin>>n>>x>>m;
int mn = min(n, (ll)m);
vector<int> P;
ll sum_p = 0;
vector<bool> X(m, false);
rep(_i, mn){
if(X[x]){
int pre_len = find(P.begin(), P.end(), x) - P.begin... | #include<bits/stdc++.h>
using namespace std;
#define maxn 100005
#define base 1000000005
long long node[maxn*10],ans[10];
int h,w,n,x,y,nodecnt;
int main()
{
scanf("%d%d%d",&h,&w,&n);
while(n--)
{
scanf("%d%d",&x,&y);
for(int i=0;i<3;++i)
for(int j=0;j<3;++j)
if(1<=x-i&&x-i<=h-2&&1<=y-j&&y-j<=w-2)
no... | 0 | 1,220,762 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long double N, K;
cin >> N >> K;
long double ans;
ans = 0;
for (int i = 1; i <= N; i++)
{
if (i < K)
{
ans += pow(2, 17- ceil(log2(K/i)));
}
else
{
ans += 131072;
... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <iomanip>
#include <cstring>
using namespace std;
typedef long long ll;
typed... | 0 | 79,206,340 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
int k,x;
cin>>k>>x;
ll ans= 500*k;
if(x>ans)
{
cout<<"No";
}
else
cout<<"Yes";
} | #include <bits/stdc++.h>
#define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define P pair<int,int>
#define Abs(a,b) max(a,b)-min(a,b... | 0 | 28,650,277 |
#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 f(ll a, ll b)
{
ll mx = max(a, b);
int cnt = 0;
while (mx)
{
mx /= 10;
cnt++;
}
return cnt;
}
int main()
{
ll n;
cin >> n;
int nn = (int)sqrt(n) + 1... | #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 | 73,902,384 |
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <limits>
#include <climits>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std;... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 82,906,616 |
#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;
cin >>n;
vector<int> bricks(n);
bool flag = false;
rep(i,n) {
cin >> bricks[i];
if (bricks[i] == 1) flag = true;
}
if (!flag) {
cout << -1 <<... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <random>
#include <ioman... | 0 | 36,268,905 |
#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, A;
cin >> N >> A;
if (N % 500 <= A)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
int b[n][20]={};
for(int i=0;i<n;i++){
cin>>a[i];
for(int j=0;j<20;j++){
if(a[i]%2)b[i][j]++;
a[i]/=2;
}
}
int x[20]={};
int r=-1;
long long ans=0;
bo... | 0 | 19,082,478 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007;
int main() {
ll N,D,A;
... | 0 | 54,889,504 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
string order;
vector<int> num;
vector<char> word;
int n;
char button[9][5] = {{'.',',','!','?',' '},{'a','b','c'},{'d','e','f'},{'g','h','i'},{'j','k','l'},{'m','n','o'},{'p','q','r','s'},{'t','u','v'},{'w','x','y','z'}};
int main()
{
int... | #include <iostream>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
for(auto&& i : s){
if(i == s[k - 1]){
cout << i;
}else{
cout << "*";
}
}
cout << "\n";
} | 0 | 12,830,293 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x)
#define printl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
using namespace std;
using vi = vector<int>;
using vll = vect... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<ll> A(n);
rep(i,n) cin>>A[i];
ll mans=100100100100;
for(int bit=0;bit<(1<<(n-1));bit++){
... | 0 | 13,271,187 |
#include <iostream>
using namespace std;
const int INF = 1000000000;
int main()
{
while(true){
int n;
cin >> n;
if(n==0)
break;
int T[10][10];
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
if(i==j){
T[i][j] = 0;
}
else{
T[i][j] = INF;
}
}
}
int m = 0;
for(int i=0;... | #include <stdio.h>
#include <string.h>
int main(void) {
int n,i,c,k,prime[999999] = {0},t;
for(i = 2; 999999 >= i; i++){
if(!prime[i])
for(c = i*2; 999999 >= c; c += i)prime[c] = 1;
}
while(scanf("%d",&n) != EOF){
i = 0;
for(c = 2; n >= c; c++){
if(!prime[c]) i++;
... | 0 | 74,572,960 |
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | 0 | 98,631,932 |
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
void printIntInLine(vector<int> &arr) {
for(vector<int>::iterator itr=arr.begin(); itr!=--(arr.end()); ++itr) {
printf("%d ", *itr);
}
printf("%d\n", *(--(arr.end())));
}
int main() {
int n, tmp, nSwap;
vector<int> arr;
scanf("%... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
if (a < 0) a = -a;
if (b < 0) b = -b;
if (a < b) swap(a,b);
if (b == 0) return a;
return a%b == 0 ? b : gcd(b, a%b);
}
int lcm(int a, int b) { return a*b/gcd(a,b);}
int main() {
ios::sync_with_stdio(false... | 0 | 16,007,319 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0);
ll x, a, b;
cin >> x >> a >> b;
int c = b - a;
if(c <= 0) cout << "delicious" << endl;
else if(c <... | #include<bits/stdc++.h>
#define ll long long int
#define pragi(a,b) for(ll i = a;i<b;i++)
#define pragj(a,b) for(ll j = a;j<b;j++)
#define pragk(a,b) for(ll k = a;k>=b;k--)
#define all(v) (v.begin(),v.end())
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define MP make_pair
#define MT make_tuple... | 0 | 26,100,607 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int dp[100005];
int h[100005];
int main(){
int N;
cin >> N;
int h[N];
for(int i=1; i<=N; i++){
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[1]-h[2]);
for(int i=3; i<=N; i++){
dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]));
}
c... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | 0 | 78,882,797 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
int a,b,c,n;
int cmd(int q,int p)
{
int i;
if(q>p)
return q;
for(i=1;i<=n;i++)
{
q=q*2;
if(q>p)
break;
}
n=n-i;
return q;
... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 50,634,439 |
#include<stdio.h>
int main(void)
{
int w,h,x,y,r,a,b,c,d;
scanf("%d %d %d %d %d",&w,&h,&x,&y,&r);
a=x+r;
b=y+r;
if(a<=w && b<=h && x>=0 && y>=0){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 18,011,321 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typed... | #include <stdio.h>
#include <string.h>
int main (){
char kataA[11];
char kataB[11];
char kataC[11];
scanf("%s %s %s", &kataA, &kataB, &kataC);
int panjangA = strlen (kataA);
int panjangB = strlen(kataB);
if(kataA[panjangA-1] == kataB[0] && kataB[panjangB-1] == kataC[0]){
puts("YES");
}
else{
puts("NO");
}... | 0 | 57,347,330 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,k,mod=1e9+7,ans=0;
int a[100005];
int quick_power(int a,int b)
{
int res=1;
for (;b;b=b>>1,a=(a*a)%mod)
{
if (b&1) res=(res*a)%mod;
}
return res;
}
signed main()
{
cin>>n>>k;
for (int i=k;i>=1;i--)
{
a[i]=quick_power(k/i,n)%mod;
fo... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
vector<pair<long long,long long>> prime_factorize(long long p);
class Combi {
public:
Combi();
long long Combinat... | 0 | 60,578,711 |
#include <iostream>
using namespace std;
int ans,s,n;
void fanc(int sum,int i,int j){
if (sum==s&&i==n) {
ans++;
return;
}
if (sum>s||i>n||j>9) {
return;
}
fanc(sum+j,i+1,j+1);
fanc(sum,i,j+1);
return;
}
int main () {
while(1){
cin>>n>>s;
if (n==0&&s==0) {
break;
}
ans=0;
fanc(0,0,0);
cout ... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#ifdef DEBUG
#define debug(x) cerr << #x << " " << x << '\n'
#else
#define debug(x)
#endif
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int INF = 0x3f3f3f3f, N = 3e5 + 5;
int n, a[N], cnt[N], suf[N], cnt2[N], cnt3[N], pre[... | 0 | 89,515,341 |
#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typedef vecto... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | 0 | 11,081,163 |
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define rrep(i,m,n) for(lli i=m-1;i>=n;i--)
#defin... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
#define N 2000001
int heap_size=0;
int key[N];
int parent(int i){
return i/2;
}
int leftc(int i){
return 2*i;
}
int rightc(int i){
return 2*i+1;
}
void maxHeapify(int i){
int l,r,largest;
int st;
l=leftc(i);
r=rig... | 0 | 85,797,414 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s,... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 0 | 35,734,733 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int calc(int nowTime, int s, int f){
if(nowTime <= s) return s - nowTime;
else {
int div = (nowTime + f-1)/f;
return (div*f - nowTime);
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
ve... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for(int i=0; i<n; i++) {
cin >> a[i];
}
bool flag=true;
bool m=false;
int b=0;
int c=0;
for(int i=0; i<n; i++) {
for(int j=c; j<n; j++) {
if(a[j]==i+1) {
b++;
m=true;
break;
... | 0 | 40,952,275 |
#include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
usi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 0 | 81,519,820 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 4e3 + 13;
signed main()
{
#ifdef home
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#else
#endif
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<int> in(n);
int mx = 0;
map<int, int> uwu;
... | #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;
string s;
cin>>n>>s;
ll r=0,g=0,b=0;
rep(i,n){
if(s[i]=='R') r++;
els... | 0 | 89,445,428 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pint = pair<ll, ll>;
int main(){
ll N, M;
cin >> N >> M;
vector<pint> v(M);
for (int i = 0; i < M; ++i)cin >> v[i].first >> v[i].second;
ll L_max = 0, R_min = N+1;
for (int i = 0; i < M; i++){
L_max = max(L_max, v[i]... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define double ld
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef... | 0 | 28,533,850 |
#include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | #include <bits/stdc++.h>
#define int long long
const int MOD = 1e9 + 7;
using pii=std::pair<int,int>;
using namespace std;
const int maxn = 1e5 + 5;
int n, m, x[maxn], y[maxn];
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for(int i = 0; i < n; i++)
cin >> x[i];
... | 0 | 54,410,211 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define all(x) x.begin(), x.end()
#define SZ(x) (int)(x.size())
#define mem(x, y) memset(x, y, sizeof(x))
#define what_is(x) cerr << "Line " << __LINE__ << ": " << #x << " is " << (x) << endl;
#define suf_zero(x) __builtin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
const int MAX_N = 2006;
int N, M;
int a[MAX_N];
int b[MAX_N];
ll dp[MAX_N][MAX_N];
void solve()
{
for(int i=1;i<=N;++i)for(int j=1;j<=M;++j){
(dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]+MOD)%=MOD;
if(a[i-1]==b[j-1]) (dp[i][... | 0 | 17,702,059 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
cons... | #include <iostream>
using namespace std;
int main() {
int n,y;
cin >> n >> y;
int a= -1, b = -1, c = -1;
for (int i = 0; i < n + 1; i++) {
if (y < i * 10000) break;
for (int j = 0; j < n - i + 1; j++) {
int n_d = n - i - j;
int total = 10000 * i + 5000 * j + 1000 ... | 0 | 5,698,282 |
#include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for (int i=(n-1);i >= 0;i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)((v).si... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) FOR(i,0,b)
#define INF mugen
#define dump(x) cerr<<#x<<"="<<x<<endl
#define ALL(a) (a).begin(),(a).end()
#define EACH(e,v) for(auto& e:v)
#define SORT(v) sort(ALL(v))
#define PERM(v) SORT(v);for(bool c##p=1;c##p;c##p=... | 0 | 95,594,036 |
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
int main() {
int n;
cin >> n;
vector<int>w(n);
int all(0);
rep(i, n) {
cin >> w[i];
a... | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
#def... | 0 | 25,299,977 |
#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10;
int n,a,f;
int t[N],maxn=-N;
void hs(int x){
for(int i=2;i<=sqrt(x);){
if(x%i==0){
t[i]++;
while(x%i==0) x/=i;
}
else i++;
}
if(x>1) t[x]++;
}
int main(){
scanf("%d%d",&n,&a);
f=a;
fo... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll int
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | 0 | 67,013,154 |
#include <iostream>
using namespace std;
int main() {
int n;
int sum{0};
cin >> n;
for (int i = 1; i < n + 1; i++) {
sum += i;
}
cout << sum << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int main(){
int a;
while(cin>>a){
LL c=0;
... | 0 | 14,705,476 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
cons... | #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 | 59,351,939 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.