code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include "bits/stdc++.h"
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
#define FOR(i,init,a) for(int i=init; i<a; i++)
#define rep(i,a) FOR(i,0,a)
#define rrep(i,a)... | #include<bits/stdc++.h>
#define ll int
#define ld long double
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace :: std;
const ll maxn=2010;
char jad[maxn][maxn];
ll ava[maxn];
ll l[maxn];
ll r[maxn];
ll finds(ll n){
stack<ll> stk;
for(ll i=0;i<n;i++){
while(!stk.empty(... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
set<int> s;
s.insert(a);
s.insert(b);
s.insert(c);
if(s.size()==2){cout<<"Yes";}
else cout<<"No";
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <math.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x)... | 1 |
// writer: w33z8kqrqk8zzzx33
#include <bits/stdc++.h>
using namespace std;
// begin fast read template by CYJian (source: https://www.luogu.com.cn/paste/i11c3ppx)
namespace io {
const int __SIZE = (1 << 21) + 1;
char ibuf[__SIZE], *iS, *iT, obuf[__SIZE], *oS = obuf, *oT = oS + __SIZE - 1, __c, qu[55]; int __f, qr, ... | #include <string>
#include <vector>
using namespace std;
vector<int> border(vector<int> S)
{
int n = (int)S.size();
vector<int> B(n+1);
B[0] = -1;
int j = -1;
for (int i=1; i<=n; i++)
{
while (j>=0 && S[i-1]!=S[j])
j = B[j];
j++;
B[i] = j;
}
return ... | 1 |
#include <bits/stdc++.h>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
char str[3];
int rain=1,sun=0;
cin>>str;
int len = strlen(str);
for(int i = 0;i<len;i++)
{
if(str[i]=='R' && str[i+1]=='R')
{
rain++;
}
if(str[i]=='S')
{
sun++;
}
}
if(rain>1)
{
cout<<rain<<endl;
}
else... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF=INT_MAX/4;
const long long MOD=998244353;
const double EPS=1e-14;
const bool DEBUG=false;
const string YES = "YES";
const string NO = "NO";
const string Yes = "Yes";
const string No = "No";
templa... | //#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std:... | 0 |
#include <bits/stdc++.h>
#define For(i, j, k) for (int i = j; i <= k; i++)
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
int x[N];
LL w[N];
int S, n;
int main() {
scanf("%d%d", &n, &S);
For(i, 1, n) scanf("%d%lld", &x[i], &w[i]);
int l = 1, r = n, nxt = 0;
LL ans = 0;
while (x[l] < S &... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define SC(t,x) static_cast<t>(x)
#define AR(t) vector < t >
#define PII pair < int, int >
#define PLL pair < LL, LL >
#define PIL pair < int, LL >
#define PLI pair < LL, int >
#define MP make_pair
#define PB push_back
#define PF... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
#define task "tst"
using namespace std;
const ll N = 300 + 9;
const ll inf = 1e6 + 7;
typedef pair<ll,ll> LL;
ll t,n,a[N],i,j;
string s;
bool chk(){
vector<ll> v;
v.push_back(0);
for (i = n;i >= 1;i--){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF=1e18;
struct Node
{
long long h,p,su;
};
Node N[5005];
bool cmp(Node a,Node b)
{
if(a.su==b.su)
{
return a.h<b.h;
}
return a.su<b.su;
}
long long dp[5005];
int ans;
int main() {
int n;
scanf("%d", &n);
for(int i=0;i<n;i++)
{
scanf("%lld %lld... | #include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
#include <cctype>
#include <cstdio>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pll = pair<ll, ll> ;
using vs = vector<string>;
using vb = vector<bool>;
using vll = vector<long long>;
using vvll = vector<v... | 0 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#d... | 1 |
#include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
using namespace std;
int main(){
char s[105];
while(scanf("%s",s)!=EOF){
int len,n[105]={},ans=0;
len=strlen(s);
rep(i,0,len){
if(s[i]=='I') n[i]=1;
else if(s[i]=='V') n[i]=5;
else if(s[i]=='X') n[i]=10;
else if(s[i]=='L') n[i]=50;
... | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int hyou[102];
for (int i = 0; i < 102; i++) {
hyou[i] = i*i*i;
}
int e;
while (cin >> e) {
if (e == 0) {
break;
}
int a, b, c;
for (int i = 1; ; i++) {
if (hyou[i] > e) {
c = i-1;
break;
}
}
for (int i = 1; ;i+... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
typedef long long ll;
int main(){
int n = 5,k;
int a[n];
for(int i=0;i<5;i++)
cin>>a[i];
cin>>k;
for(int i=0;i<n-1;i++)
{
for(int j=i+1;j<n;j++)
{
if(a[j] - a[i] > k){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b,c,d,e,k;
cin >> a >> b >> c >> d >> e >> k;
if(e-a>k) cout << ":(" << "\n";
else cout << "Y... | 1 |
#include<iostream>
using namespace std;
int main()
{
int d;
while (cin >> d) {
int sum = 0;
for (int i = d; i <= 600 - d; i += d) {
sum += (d*i*i);
}
cout << sum << endl;
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
//const int mod=998244353;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;
int main() {
int n,x;cin >>n>>x;
vecto... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long N, K;
vector<long long> x;
lon... | 0 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | #include <iostream>
#include <queue>
using namespace std;
int main(){
while(1){
queue<int> Q;
int n,m,a[10000][2],b,i,j,k;
bool c[500]={};
cin >> n >> m;
if(n==0&&m==0){
return 0;
}
for(j=0, i=0;i<m;i++){
cin >> a[i][0] >> a[i][1];
if(a[i][0]==1){
c[a[i][1]-1]=true;
Q.push(a[i][1... | 1 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
string n;
cin >> n;
int len = n.... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <iomanip>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<l... | 1 |
#include<bits/stdc++.h>
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int&
#define I inline
#define W while
#define N 100000
#define LL long long
using namespace std;
int n,m,v,p,a[N+5];LL s[N+5];
I bool cmp(CI x... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) ... | 1 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_st... | #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>
#include <cctype>
#in... | 0 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if(s.size() == 2) {
cout << s << endl;
}
else if(s.size() == 3) {
for(int i = 2; i > -1; i--) {
cout << s[i];
}
cout << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
int main() {
std::vector<int> arr;
int len, num = 0;
std::cin >> len;
for(int i = 0; i < len; i++) {
std::cin >> num;
arr.push_back(num);
}
for(int i = len-1; i >= 0; i--) {
std::cout << arr[i];
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int w,h,sy,sx,gx,gy,n;
int color;
int c,d,x,y;
int dx[4]={1,0,-1,0};
int dy[4]={0,-1,0,1};
int maps[105][105];
int mem[105][105];
int dfs(int nowx,int nowy);
main(){
while(1){
cin>>w>>h;
if(w==0&&h==0)break;
cin>>sx>>sy>>gx>>gy;
cin>>n;
memset(maps,0,si... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
struct edge{int to, cost;};
const int MAX_M = 2e5 + 5, INF = 1e5;
int N, M, d[MAX_M * 3];
vector<edge> G[MAX_M * 3];
map<P, int> f;
void dijkstra(int s){
priority_queue<P, vector<P>, greater<P>> pq;
fill(d, d+MAX_M*3, INF); d[s] = 0;
p... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<vector<pair<int, bool>>> shougen(n);
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
for (int j = 0; j < a.at(i); j++) {
int... | //----------------------Shanu Garg here---------------------
//-------------Search on youtube : Shanu Garg---------------
//-Studying at National Institute of Technology Delhi(NITD)-
//---------------------From Delhi, India--------------------
#include<bits/stdc++.h>
using namespace std;
#define f(i,n) for(auto i=0;i... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <stack>
#include <limits>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <memory>
#include <numeric>
//#include <tuple>
constexpr long long mod = stati... | #include <string.h>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <map>
#include <vector>
using namespace std;
const int MAXV = 10010;
struct Edge {
int u;
int v;
Edge(int u, int v): u(u), v(v) {}
};
int v, e, source = 0, dfs_clock = 0, scc_count = 0;
vector<int> g[MAXV];
int pre[MAXV] = {... | 1 |
#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 f = 0;
int count = 0;
while(1){
for (int i = 0; i < N; i++){
if(A[i] % 2 == 0){
A[i] = A[i] / 2;
}else{
f= 1;
}
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define input freopen("input.txt","r",stdin)
#define output freopen("output.txt","w",stdout)
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d%d",&a,&b)
#define ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,i,n;
cin>>a>>b;
n=((a*2)-1)/2;
for(i=0;i<n;i++)
{
a--;
cout<<b-a<<" ";
}
cout<<b<<" ";
a=0;
for(i=n+1;i<2*n+1;i++)
{
a++;
cout<<b+a<<" ";
}
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using lint = long long;
using namespace std;
struct Sub {
lint b, l, r;
Sub(int b = 0, int l = 0, int r = 0) : b(b), l(l), r(r) {}
};
int main() {
lint N, X;
cin >> N >> X;
vector<Sub> subs(N);
for (auto& s : subs) {
cin >> ... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,st,ed) for(register int i=st,i##end=ed;i<=i##end;++i)
#define DREP(i,st,ed) for(register int i=st,i##end=ed;i>=i##end;--i)
typedef long long ll;
template<typename T>inline bool chkmin(T &x,T y){return (y<x)?(x=y,1):0;}
template<typename T>inline bool chkmax(T &... | 1 |
#include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
vo... | #include <iostream>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
if (X < 9 && Y <9){
cout << "Yay!" << endl;
return 0;
}
cout << ":(" << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define INF 1000000001
int U,V;
int dist_toU;
struct node{
vector<int> to;
int dist;
bool path_toU;
node(){
dist=0;
path_toU=false;
}
};
void dfs1(int v, int p, vector<node> &nodes){
for (int i = 0; i < nodes[v].to... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
const int maxn=1e6+10;
const int mod=1e9+7;
const double pi=3.1415926535;
int w[3005],v[3005];
int dp[3005][2];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,t;
cin>>n>... | 0 |
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAX_N = 10000;
const int V = 10000;
vector<int> G[MAX_N];
vector<int> rG[MAX_N];
vector<int> vs; //??°?????????????????????
bool used[MAX_N]; //?????§????????????????????????
int cmp[MAX_N]; //?±... | 1 |
#include <cstdio>
#include <vector>
#include <tuple>
#include <set>
#include <algorithm>
using namespace std;
int main() {
int N, Q;
scanf("%d %d", &N, &Q);
vector<tuple<int, int, int>> event;
for(int i = 0; i < N; i++) {
int s, t, x;
scanf("%d %d %d", &s, &t, &x);
event.push_back(make_tuple(s-x, 1, x));
e... | #include <cstdio> //{{{
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#define ALL(c) (c).begin(), (c).end()
#define DUMP(x) std::cerr << #x << ':' << x << '\n';
typedef long long ll;
// clang-format off
template<typename T,typename U>inline bool chmax(T&x,... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=1LL<<60;
ll MOD=1000000007;
int main(){
ll N;
cin >> N;
vector<ll> L(N,0);
vector<ll> R(N,0);
ll recL=0;ll MaxL=0;
fo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = (int)(j);i <= (int)(k);i ++)
#define debug(x) cerr<<#x<<":"<<x<<endl
#define fix cout<<fixed<<setprecision(20);
const int maxn=(int)2e6+5;
vector<int> E[maxn];
int vis[maxn],ind[maxn],dis[maxn];
int reach[maxn];//longest can reach
inline int i... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i ++)
#define MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int INF = 1e9 + 7;
struct ad_set
{
int tag;
deque<int> que;
void subt(int x)
{
... | #include<bits/stdc++.h>
constexpr auto MAXN = 1000000+500;
std::string s,t;
std::queue<int> que;
signed main(void)
{
int len,down,up; size_t ans = 0;
std::cin>>len>>s>>t;
if(s == t){ puts("0"); return 0; }
down = up = len-1;
while(down >= 0){
while(down && t[down-1]==t[down]) --down;
while(up... | 1 |
#include <stdio.h>
void dividing(int pm, int pe, int pj);
int main(void)
{
int students_number;
int pm[10000], pe[10000], pj[10000];
scanf("%d", &students_number);
while (1) {
if (students_number == 0) {
break;
} else {
for (int i = 0; i < students_number; ++i) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
struct edge{
int to,weight;
edge(int to,int weight):to(to),weight(weight){}
};
using Graph = vector<vector<int>>;
using GraphEdge = vector<v... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
for (int i = sy; i < ty; i++) cout << 'U';
for (int i = sx; i < tx; i++) cout <... | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main(){
int sx, sy, tx, ty;
cin >> s... | 1 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
bool check(string x, string y) {
int a = x.size()-1;
return x[a] == y[0];
}
int main() {
string a, b, c;
cin >> a >> b >> c;
if(check(a, b) && check(b, c)) cout << "YES" << endl;
... | #include <stdio.h>
#include <string.h>
int main (){
char a[100];
char b[100];
char c[100];
scanf("%s %s %s", a, b, c);
int A = strlen(a);
int B = strlen (b);
for (int i = 0; i < 10; i++){
if ( a[A - 1] == b[0] && b[B - 1]== c[0]){
puts ("YES");
break;
}
else{
puts ("NO");
break;
}
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<double> ps(n + 1);
ps[0] = 0;
double t;
for (int i = 0; i < n; ++i) {
cin >> t;
ps[i + 1] = (t + 1) / 2 + ps[i];
}
double result = 0;
for (int i = k; i <= n; ++i) {
result = max(result, ps[i] -... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n, k;
cin>>n>>k;
vector<int> p(n);
rep(i, n) cin>>p[i];
vector<int> ki2(n);
re... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int r, g;
cin >> r;
cin >> g;
cout << g - r + g << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// ここにプログラムを追記
int rating, next_rating, performance;
cin >> rating >> next_rating;
performance = 2 * next_rating - rating;
cout << performance << endl;
} | 1 |
/**
* @FileName a.cpp
* @Author kanpurin
* @Created 2020.08.21 02:11:21
**/
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;cin >> n;
vector<ll> x(n);
for (int i = 0; i < n; i++) {
cin >> x[i];
}
n++;
int l;cin >> l;
x.push_back(x[x... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 0 |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll, int> lli;
const int Maxn = 100005;
const int Maxm = 524288;
int n, x;
int b[Maxn], l[Maxn], u[Maxn];
lli seq[Maxn];
ll cur;
ll st[Maxm], cnt[Maxm];
ll res;
ll Get(int ind, int y)
{
if (y <= b[ind]) return ll(l[ind]) * y;
r... | 0 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int N;
const int MAX_E=100;
int label[MAX_E];
priority_queue<int,vector<pair<int,pair<int,int> > >,greater<pair<int,pair<int,int> > > > pq;
int main(){
cin>>N;
REP(i,N)
label[i]=i;
REP(i,N){
REP(j,N){
int a;c... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#inclu... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using Tup = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fl cout<<flush;
#define ... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define cmin(a,b) (a>b?a=b:a)
#define cmax(a,b) (a<b?a=b:a)
#define mem(a,k) memset(a,k,sizeof(a))
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t... | 1 |
#include<iostream>
#include<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bit... | #include<iostream>
using namespace std ;
int main()
{
int n ;
int a ,b ,c ,d ;
cin >> n ;
int t[ 101 ] = { 0 } ;
for( int i = 0 ; i < n * ( n - 1 ) / 2 ; i++ )
{
cin >> a >> b >> c >> d ;
if( c == d )
{
t[ a ]++ ;
t[ b ]++ ;
continue ;
}
t[ c > d ? a : b ] += 3 ;
}
for( int i = 1 ; i <= n... | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <array>
#include <vector>
#include <functional>
using namespace std;
int main() {
while( true ) {
int n, m;
cin >> n >> m;
if ( n == 0 && m == 0 ) break;
vector<int> xs( n );
for ( int i = 0; i < n; i++ ) {
cin >> xs[ i ];
}
sort( xs.beg... | #include <cstdio>
int main(){
int n, p;
int x[50];
while(scanf("%d%d", &n, &p)){
if(n == 0 && p == 0) break;
for(int i = 0; i < n; i++) x[i] = 0;
int t = 0;
int q = p;
while(true){
if(p > 0){
x[t]++;
if(x[t] == q){
printf("%d\n", t);
break;
}
p--;
} else{
p += x[t];
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)
#define DEBUG(x) cout<<#x<<": "<<x... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <vector>
//#define PI 3.141592653589
using namespace std;
int main()
{
int n;
int seisuu[5000];
int wa = 0;
int wa_max = -100001;
while (1)
{
wa_max = -100001;
cin >> n;
if (n == 0... | 1 |
#include <stdio.h>
int n, m, l, g, e;
int a[15], b[15];
int x[15][15], y[15][15];
int ans;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
for (int j = 0; j < a[i]; j++) {
scanf("%d%d", x[i] + j, y[i] + j);
x[i][j]--;
}
}
m = 1;
for (int i = 0; i < n; i++) {
m *= 2;
}... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
vector<vector<pair<ll,ll>>> vec(N,vector<pair<ll,ll>>(0));
for(ll i=0;i<N;i++) {
ll A;
cin>>A;
for(ll j=0;j<A;j++) {
ll x,y;
cin>>x>>y;
vec[x-1].push_back(make_pair(... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define P pair<int, int>
const int mod = 1e9+7;
inline int add(int a, int b) { int res = a + b; if(res >= mod) res -= mod; return res; }
inline int sub(int a, int b) { int res = a - b; if(res < 0) res += mo... | #include<bits/stdc++.h>
using namespace std;
inline void read(long long &x) {
char ch;
bool flag = false;
for (ch = getchar(); !isdigit(ch); ch = getchar())if (ch == '-') flag = true;
for (x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
x = flag ? -x : x;
}
inline void write(long long x... | 1 |
#include <bits/stdc++.h>
const int N = 108;
int n;
int a[N], b[N];
int main() {
int i, mid;
scanf("%*d%d", &n);
for (i = 0; i < n; ++i) scanf("%d", a + i);
if (n == 1) return *a == 1 ? puts("1\n1\n1") : printf("%d\n2\n1 %d\n", *a, *a - 1), 0;
mid = std::partition(a, a + n, [] (const int x) -> bool {return x % 2... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
void read(pp& x){ scanf("%d%d",&x.first, &x.second); }
void read(pll& x){ scanf("%lld%lld",&x.first, &x.second); }
template<ty... | 1 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
int N;
cin >> N;
vector<ll> A(N),S(N+1);
for(int i=0;i<N;i++){
cin >> A[i];
S[i+1] = S[i]+A[i];
}
ll ans = 1e18;
auto sum = [&](int l,int r){
return S[r]-S[l];
};
int l = 1,... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <list>
#include <limits>
#include <set>
#include <map>
#include <functional>
#include <inttypes.h>
#include <limits.h>
#include <stdint.h>
#include <s... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair < int , int >;
using i3 = pair < int , ii >;
using li = pair < ll , int >;
using lii = pair < ll , ii >;
using pll = pair < ll , ll >;
using vi = vector < int >;
using vl = vector < ll >;
us... | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define repr(i, n, m) for (int i = (int)(n) - 1; i >= (int)(m); i--)
using namespace std;
using ll = int64_t;
const int MOD = 1000000007; // 10^9+7
int main() {
double n, m, d;
cin >> n >> m >> d;
double ans;
if (d... | 0 |
#include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
#define pi 3.14159265358979
// 回文チェック関数
bool Pal(string a)
{
int size = a.length();
rep(i, size / 2) i... | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
//vector < vector<int>>a(0, vector<int>(0));二次元配列宣言
int main()
{
int a, b, ma;
cin >> a >> b;
ma = max(a + b, a - b);
ma = max(ma, a * b);
cout << ma << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>; using vvi = vector<vi>;
using vb = vector<bool>; using vvb = vector<vb>;
using vl = vector<ll>; using vvl = vector<vl>;
using vd = vector<double>; using vvd = vector<vd>;
#define REP(i,n) for(au... | #include<bits/stdc++.h>
#define inf 10000000
using namespace std;
int main(){
int n,d[101][101],a[101],ans=0,c[101]={};
cin>>n;
for(int i=0;i<n;i++)a[i]=inf;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++){
cin>>d[i][j];
if(d[i][j]==-1)d[i][j]=inf;
}
a[0]=0;
int s=0;
while(1){
c[s]=1... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOREQ(i, a, b) for (int i = (a); i <... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
template<typename T> bool chmax(T &a, T b) {if(a <= b){a = b; return true;}return false;}
template<typename T> bool chmin(T &a, T b) {if(a >= b){a = b; return true;}return false;}
#define ABC 001
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int r; cin >> r;
if(r < 1200){
cout << "ABC" << endl;
return 0;
}
else if(r < 2800){
cout << "ARC" << endl;
return 0;
}
else{
cout << "AGC" << endl;
retur... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int table[2][100005] = {0};
for(int i=0; i<n; i++){
int v; cin >> v;
table[i%2][v]++;
}
vector<pair<int, int>> ruia, ruib;
for(int i=0; i<1e5+5; i++){
if(table[0][i]) ruia.push_back({table[0][i], i});
if(tab... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
#define int ll
const ll MOD = 998244353;
ll cal(int a, int r){
int p = 1;
rep(i,r){
p*=a;
p%=MOD;
}
return p;
}
main(){
int n;
cin>>n;
map<int,int> mp... | 0 |
#include<bits/stdc++.h>
using namespace std;
int n, p, ans;
long long sum[100005], top, d, m, v, a[100005];
bool cmp(int a, int b) { return a > b; }
int main() {
cin>>n>>m>>v>>p;
v = n - v;
top = v*m;
for(int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
sort(a + 1, a + n + 1, cmp);
for(int i = 1; i <= n; i++)
... | #include <vector>
#include <iostream>
#include <algorithm>
#pragma warning(disable : 4996)
using namespace std;
int n, bit[262145];
vector<int> a, b;
void add(int i, int x)
{
while (i <= n)
{
bit[i] += x; i += i & -i;
}
}
int sum(int i)
{
int ret = 0;
while (i > 0)
{
ret += bit[i]; i -= i & -i;
}
r... | 0 |
#include <iostream>
#include <vector>
std::vector<int> BIT;//その位置までの良い石の数の区間和
std::vector<int> color;
std::vector<int> right;//色番号ごとの良い石の場所
int RegionSum(int l,int r);
int getSum(int r);
void addBIT(int idx,int value);
int main(){
int N,Q;
std::cin >> N >> Q;
BIT.resize(N+1,0);
color.resize(N+1,0);
... | #include<bits/stdc++.h>
using namespace std;
#define N 15
int n,m,sum,d[N][1<<N],e[1<<N],f[1<<N][N];
void upd(int &x,int y){x=max(x,y);}
int read(){
int x=0,f=1;char ch=getchar();
for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-f;
for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
return x*f;
}
int main(){
n=rea... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int n,k;
cin>>n>>k;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n,greater<int>());
int result{};
for(int i=0;i<k;i++)
result += arr[i];
cout<<result;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k,x; cin>>k>>x; k--;
for(int i=x-k;i<=x+k;i++) cout<<i<<" ";
} | 0 |
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<string>
#include<sstream>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
const int N = 2e6 +... | #pragma GCC optimize("O3")
//#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
#define io_init cin.tie(0);ios::sync_with_stdio(0);cout<<setprecision(20)
#include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
constexp... | 0 |
#include<iostream>
using namespace std;
bool search(int);
int q,T[500];
int main(){
int n,S[10000],counter=0;
cin >>n;
for(int i=0 ; i < n ; i++)cin >>S[i];
cin >>q;
for(int i=0 ; i < q ; i++)cin >>T[i];
for(int i=0 ; i < n ; i++)counter+=search(S[i]);
cout <<counter<<endl;
return 0;
}
bool se... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H,W; cin>>H>>W;
queue<int>A;
queue<int>B;
int ans=0;
vector<vector<char>>C(H+2,vector<char>(W+2,'#'));
for(int i=1;i<=H;i++){
string S;cin>>S;
for(int j=1;j<=W;j++){C[i][j]=S.at(j-1);if(C[i][j]=='#'){ans++;}}
}
A.push(1);
B.push(1);... | 0 |
#include <bits/stdc++.h>
using namespace std;
static const int INF = 99999;
int main(){
int n,array[100][100];
cin>>n;
for(int i=0; i<n; i++){
fill(array[i],array[i]+n,INF);
}
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
int tmp;
cin>>tmp;
if(tmp!=-1) array[i][j]=tmp;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ar[n];
int count=0;
for(int i=0;i<n;i++){
cin>>ar[i];
}
for(int i=0;i<n-2;i++){
for(int j=i+1;j<n-1;j++){
for(int k=j+1;k<n;k++){
if(ar[i]+ar[j]>ar[k] && ar[i]+ar[k]>ar[j] && ar[j]+ar[k]>ar[i] && ar[i]!=ar[j... | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<functional>
#include<climits>
#include<stack>
#include<queue>
#include<cmath>
#define int long long
#define INF 100000000000
#define EPS 0.0000000001
using namespace std;
signed main() {
int n, m;
int a[1010], b[1010];
int ans[1010] = { 0 };
int vot... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> vi;
typedef vector<vi> vvi;
typed... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
UL S[2001][2001] = {};
UL J1[2001][2001] = {};
UL J2[2001][2001] = {};
void Query() {
UL y1, y2, x1, x2; cin >... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int x,y,z;
while(cin>>x>>y>>z)
{
cout<<z<<' '<<x<<' '<<y<<' '<<endl;
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
void abc_160a();
void abc_161a();
int main()
{
//abc_160a();
abc_161a();
}
void abc_160a()
{
string S;
cin >> S;
if (S[2] == S[3] && S[4] == S[5]) cout << "Yes\n";
else cout << "No\n";
}
void swap(int& a, int& b)
{
int tmp;
tmp = a;
a ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
int n;
vector <long long> L;
void solve(){
sort(all(L));
int ans = 0;
for(int i=0; i<=n-3; i++){
for(int j=i+1; j<=n-2; j++){
for(int k=j+1; k<=n-1; k++){
... | #include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <de... | 0 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, a;
cin >> N;
a=(N-N%111)/111;
if (N%111==0) {
cout << N << endl;
}
else {
cout << 111*(a+1) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
long long n,i;
int main()
{
cin >> n;
for(i=111; i<=999; i+=111)
if(i>=n) {
cout<<i<<endl;
break;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin>>A>>B;
int sum=0;
for(int i=A;i<=B;i++){
if((i%10==i/10000)&&((i%100)/10==(i/1000)%10)){
sum+=1;
}
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
using namespace std;
int main() {
int a,b,num = 0;
cin >> a >> b;
for(int i = 0; a <= b; i++) {
bool flag = 0;
string s = to_string(a);
int n = s.size();
for(int j = 0; j < double(n/2); j++) ... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <numeric>
#include <algorithm>
using namespace std;
int N, Q;
int main() {
while(cin >> N >> Q, N||Q){
int num[101];
for(int i=0; i<101; ++i) num[i]=0;
for(int i=0; i<N; ++i){
int M; cin >> M;
... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const ll MMM = -1e18;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n;
cin >> n;
int a[n];
for (int i=0; i<n; i++) cin >> a[i];
int m = n/2;
if (n&1) {
ll ans = MMM;
vector<ll> suff(m+... | #include <iostream>
using namespace std;
const long long OO = (long long) 1e18;
const int N = 200008;
int n;
long long a[N];
long long dp[N][3];
// dp[i][j] is maximum possible sum choosing (i+1-j)/2 elements from first i
// elements. This is NOT a floor! So half the dp elements will be impossible
// solely because... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(v) v.begin(), v.end()
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
using ll = long long;
using PAIR = pair<int, int>;
using PAIRLL = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vi>;
us... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
long long n, m;
while (scanf("%lld %lld", &n, &m), n){
long long p[1024];
for (int i = 0; i < n; i++) scanf("%lld", p + i);
p[n++] = 0;
vector<long long> score;
for (int i = 0; i < n; i++){
for... | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<int,pair<int,int> > PP;
typedef pair<LL,int> LP;
const int INF=1<... | /* be name khoda */
// #define stream_enable
#define long_enable
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <queue>
// #include <bits/stdc++.h>
// #include <numeric>
// #include <iomanip>
// #include <cmath>
// #include <bit... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int>... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep0(n) for (int counter = 0; counter < (int)(n); counter++)
#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 rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define ALL(obj... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++) //0から
#define REP(i,N) for(int j=i;j<N;j++) //iから
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (rig... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int l, r, n , m =0;
cin>>n>>m;
int mi= n;
int ma=-1;
for(int i=0; i<m ; i++){
cin>>l>>r;
if(ma < l)ma= l;
if(mi > r)mi=r;
}
cout<<max(mi-ma+1,0);
return 0;
} | 1 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool ... | #include <cassert>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inc... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
ll ans = 0;
void merge(vector<int>& v, int left, int mid, int right)
{
int n1 = mid - left, n2 = right - mid;
vector<int> L(v.begin() + left, v.begin() + left + n1);
vector<int> R(v.begin() + mid, v.begin() + mid + n2);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
template <typename T>
struct BIT{
int n;
vector<T> d;
BIT(int sz){
n = sz+10;
d.resize(n);
}
void add(int i, T x){
while(i<=n){
d[i] += x;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin >> a >> b >> c >> d;
int L=a+b;
int R=c+d;
if(L>R){
cout << "Left" << endl;
}
if(L<R){
cout << "Right" << endl;
}
if(L==R){
cout << "Balanced" << endl;
}
}
| #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#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);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
u... | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
#define int ll
const ll mod=998244353;
ll dp[333][99999]={0};
ll dp2[333][99999]={0};
ll ar[305]={0};
ll pow(ll x,ll y){
if(y==0) return 1;
ll res=pow(x,y/2);
res*=res;
res%=mod;
if(y%2==1){
res*=x;
res%=mod;
}
retur... | #include <bits/stdc++.h>
using namespace std;
template <typename T>
T random(T lo, T hi) {
std::random_device rd;
std::uniform_int_distribution<T> uid(lo, hi);
return uid(rd);
}
class RollingHash {
private:
const uint64_t mod = (UINT64_C(1) << 61) - 1;
static inline uint64_t base = random(UINT32_C(10007),... | 0 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int max_len = 1005;
int dp[max_len][max_len];
char s1[max_len];
char s2[max_len];
void solve() {
int l1 = strlen(s1);
int l2 = strlen(s2);
for (int i = 0; i < max_len; i++) {
dp[i][0] = dp[0][i] = i;
}
for (int i = 0; ... | #include <stdio.h>
#include <string.h>
int main(){
char strA[100], strB[100], strC[100];
scanf("%s %s %s",&strA, &strB, &strC);
int lenA=strlen(strA);
int lenB=strlen(strB);
if (strA[lenA-1] == strB[0] && strB[lenB-1] == strC[0]){
printf("YES");
}
else{
printf("NO");
}
return 0;
... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | /*#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
*/
#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;
#define rep2(i, s, n) fo... | 0 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <algorithm>
#include <iomanip>
#include <functional>
#include <numeric>
#include <sstream>
#define REP(i, n) for(int i = 0;i < (n); i++)
#define REP2(i, x, n) for(int i = (x)... | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,a,b=0;
cin>>n;
a=n;
while(a>0){
b+=a%10;
a/=10;
}
if(n%b==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return(0);
... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fr first
#define sc second
#define pb push_back
const ll mod = 998244353;
const int N = 1e6+205;
ll cnt[N];
void solve(){
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
int x,y;
cin>>x>>y;
cnt[x]++;
cnt[y+1]--;... | #include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; ... | 0 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main() {
int N;
cin>>N;
string s;
cin>>s;
vector<string> tmp;
tmp.push_back("SS");
tmp.push_back("SW");
tmp.push_back("WS");
tmp.push_back("WW");
string ans;
bool aru = false;
for(int i=0;i<4;+... | #include <iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
string s1;
string s2;
cin >> s1;
cin >> s2;
int a = s1.size();
int b = s2.size();
vvi dp(a + 1, vi(b + 1, 0));
for (int i = 0; i <= a; i++)dp[i][0]... | 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#include <ctime>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 4e2 + 10;
const ll mod = 1e9 + 7;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// freopen("abc.inp", "r", stdin); freopen("abc.out", "w", stdout);
int l, r; cin >> l >> r;
if (r - l + 1 >= 2019) cout << ... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
const int inf=0x3f3f3f3f;
long long a[maxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
long long d;
cin>>d;
a[0]=1;
for(int i=1;i<=20;i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,T;
cin>>N;
T=N;
int sum=0;
while(N>0){
sum+=N%10;
N/=10;
}
if (T%sum==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | 0 |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define INF (1LL << 63)
struct edge{
size_t to;
size_t weight;
};
vector<size_t> dijkstra(vector<vector<edge>>& Graph, int& startPoint, int& vertexNum){
vector<size_t> minimumWeight(vertexNum,INF);
priority_queue<vector<pair<size... | /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | ... | 1 |
#include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1... | #include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m)
{
cout<<m/3<<endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define vvll vector<vll>
#define rep(i, n) for(i = 0; i < n; i++)
int main(){
int N, K;
int val = 1;
cin >> N >> K;
for (int i = 0; i < N; i++) {
val = min(val * 2, val + K);
}
cout << val << '\... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 0 |
//#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int __SIZE = 1 << 18;
char ibuf[__SIZE], *iS, *iT;
#define ge (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
#define ri read_int()
#define rl read_ll()
#define FILE(s) freopen(s"in", "r", std... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
typedef long long LL;
const LL mod = 1e9 + 7;
// head
int n, m, a[105], b[105], cnt;
int main() {
cin>>n>>m;
rep(i, 1, m) {
cin>>a[i];
if(a[i]&1) cnt++;
}
if(cnt > 2... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int n;
int p[N];
pair<pair<int, int>, int> c[N];
pair< int, pair<int, int> > e[N];
int group(int a) {
if (p[a] == -1) {
return a;
}
return p[a] = group(p[a]);
}
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif
scanf("%... | #include<bits/stdc++.h>
using namespace std;
inline void read(long long &x) {
char ch;
bool flag = false;
for (ch = getchar(); !isdigit(ch); ch = getchar())if (ch == '-') flag = true;
for (x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
x = flag ? -x : x;
}
inline void write(long long x... | 1 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
//*********************************************DO IT NOW****************************************************************
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if(a < c && c < b) cout << "Yes" << endl;
else if(b < c && c < a) cout << "Yes" << endl;
else cout << "No" << endl;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
ll d[2], k;
cin >> d[0] >> d[1] >> k;
int cnt = 0;
rep(i, k) {
int id = cnt % 2;
if (d[id] % 2 == 1)
--d[id];
d[id] /= ... | #include <iostream>
#include <unordered_map>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
int N,H,W;
cin >>N>>H>>W;
int ans = (N-H+1) * (N-W+1);
cout << ans << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
ll happiness = 0;
while(n >= 500){
happiness += 1000;
n -= 500;
}
while(n >= 5){
happiness += 5;
n -= 5;
}
cou... | #include<iostream>
using namespace std;
const int coin[2] = {5,500};
int main(){
int money,happy;
cin >> money;
int C[2] = {0,0};
for(int i = 1;i >= 0;i--){
C[i] = money / coin[i];
money -= coin[i]*C[i];
}
happy = C[0]*5 + C[1]*1000;
cout << happy << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll n,k;
ll a[20];
bool used[20];
ll ans;
map<ll,bool> mp;
void dfs(ll now, ll num){
if(now == k){
if(!mp[num]){
mp[num] = true;
ans++;
//cout << num << "num" << endl;
}
}
for (int i = 0;i < n;i++){
if(!use... | #include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).re... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.1415... | #include <iostream>
using namespace std;
int main() {
long long h[4];
int a, b, c, ab, cc;
int i, n;
long long j, minl, amari;
cin >> n;
for (i = 0; i < n; i++) {
cin >> h[i];
}
minl = h[0];
for (i = 1; i < n; i++) {
... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if(1)
#else
#define CIN_ONLY if(1)
struct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}
}star;
#define DEBUG if(0)
#endif
#define ALL(v) (v).begin(),(v).end()
#define REC(ret, ...) std::function<ret (__VA_AR... | #include<bits/stdc++.h>
using namespace std;
bool vis[603][603]; int N , D1 , D2;
void color(int dist){
int now = 0; while(!(dist & 3)){dist >>= 2; ++now;}
if(dist % 4 == 3) return;
for(int i = 0 ; i < 2 * N ; ++i)
for(int j = 0 ; j < 2 * N ; ++j)
vis[i][j] |= ((dist & 2) && (i >> now & 1)) || ((dist & 1) && (... | 1 |
#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++)
typedef long long Int;
const Int INF = 1e18;
int main() {
Int N;
cin >> N;
vector<Int> A(N);
rep(i,N) cin >> A[i];
vector<Int> dp0(N, -INF),... | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n,cur;
cin >> n;
long long ans = 0;
cin >> cur;
long long tot[3] = { 0,0,cur };
for (int i = 2; i <= n; i++) {
cin >> cur;
if (i % 2) {
tot[1] = max(tot[1], tot[2]);
tot[0] += ... | 1 |
#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++)
typedef int64_t Int;
typedef pair<int,int> P;
vector<int> num = {0,2,5,5,4,5,6,3,7,6};
string maxs(string S, string T){
if(S.length() > T.length()){
ret... | #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--)
#define rep2(i,s,n) for (int i = s; i < n; ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define tmax(a,b,c) max(a,max(b,c))
#define tmin(a,b,c) min(a,min(b,c))
#define pb pu... | 1 |
#include <iostream>
using namespace std;
int n;
int A[100000];
int main()
{
cin>>n;
for(int i=0;i<n;i++)cin>>A[i];
int x=A[n-1];
int j=A[0]<x?1:0;
for(int i=1;i<n-1;i++)
{
if (A[i]<=x)
{
int aj=A[j];
A[j]=A[i];
A[i]=aj;
j++;
}
}
A[n-1]=A[j];
A[j]=x;
for (int i=0;i<j;i++)
{
if (i) cout <<... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); ++i)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ELEM(array) (sizeof (array)/sizeof *(array))
#define MAX_N 100000
#define SAFE_FREE(ptr) if( ptr != NULL ){ free(ptr); ptr = NULL; }
typedef unsigned int UINT;
type... | 0 |
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
type... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#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 all(v) v.begin(), v.end()
#define endl "\n"
#defi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K,A,Z;
cin>>N>>K>>A;
Z=A;
for(int i=1;i<N;i++){
int b;
cin>>b;
A=gcd(A,b);
Z=max(Z,b);
}
if(K<=Z&&K%A==0){
cout<<"POSSIBLE"<<endl;
}
else{
cout<<"IMPOSSIBLE"<<endl;
}
}
| 1 |
#include <iostream>
#include <cstdlib>
#include <vector>
#include <string>
class Dice {
private:
std::vector<int> number;
std::vector<int> initialize();
std::string order_list;
std::string decide_order();
public:
std::string set_order();
void move(std::string or... | #include<iostream>
using namespace std;
class Dice{
int _num[6];
public:
void set(int num[6]){
for(int i = 0; i < 6; i++) _num[i] = num[i];
}
void N(){
swap(_num[0],_num[4]);
swap(_num[0],_num[5]);
swap(_num[0],_num[1]);
}
void S(){
swap(_num[0],_num[1]);
swap(_num[0],_num[5]);
swap(_n... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.