code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int root(vector<int> &r, int a)
{
if (r[a] == a) return a;
else return r[a] = root(r, r[a]);
}
int main()
{
long long N, K, L;
scanf("%lld%lld%lld", &N, &K, &L);
vector<int> road, rail;
for (int i = 0; i <= N; i++) {
road.push_back(i);
... | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) _back
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
c... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
bool check(int a,int b,int c)
{
if((a+b)>c && (c+b)>a && (a+c)>b)
return true;
return false;
}
int main()
{
// freopen("input01.txt", "r", stdin);
// freopen("output01.txt", "w", stdout);
int n;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> L(N);
for(int i = 0; i < N; i++) cin >> L.at(i);
int total = 0;
if(N < 3) cout << "0" << endl;
else
{
for(int i = 0; i < N - 2; i++)
{
for(int j = i + 1; j < N - 1; j++)
{
for(in... | 1 |
#include <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#includ... | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int n,num;
while (scanf("%d",&n)&&n!=0) {
vector<int> ice(10,0);
for (int i=0; i<n; i++) {
scanf("%d",&num);
ice[num]++;
}
for (int i=0; i<10; i++) {
if (ice[i]==0) {
printf("-");
} else {
for (int j=0; j<ice[i]; j++) pr... | 0 |
#include<iostream>
#include<string>
using namespace std;
int main(void){
string str;
while(getline(cin, str)){
for(int i=0; i<26; i++){
for(int j=0; j<str.size(); j++){
if(str[j]!=' ' && str[j]!='.'){
str[j]++;
if(str[j]>'z') str[j]-=2... | #include<iostream>
#include<iomanip>
#include<memory>
#include<array>
#include<vector>
#include<queue>
#include<list>
#include<stack>
#include<algorithm>
#include<cmath>
using namespace std;
int chipher( string& s )
{
for ( auto& c : s )
{
if ( c >= 'a' && c <= 'y' )
++c;
else if ( c == 'z' ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
int main(){
// 1. 入力情報.
char X[202020];
scanf("%s", X);
int l = strlen(X);... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int main(){
string s;
cin >> s;
ll n = s.size();
reverse(s.begin(), s.end());
ve<int> b(n+1);
rep(i,n) b[i] = s[i] - '0';
b[n] = 0... | 0 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#defin... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<iomanip>
#include<sstream>
#include<map>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1;i <=n;i++)
#define rrep(i,n) for(int i = n -1;i >= 0;i--)
#define ALL(a... | 1 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <bitset> //UWAGA - w czasie kompilacji ... | #include <stdio.h>
int main() {
int n, row, col;
scanf("%d", &row);
scanf("%d", &col);
scanf("%d", &n);
int temp;
int count = 0;
if (row > col) {
temp = row;
} else {
temp = col;
}
for (int i = 0; i < n; i = i + temp) {
count++;
}
printf("... | 0 |
#include <iostream>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
int main() {
int N, Q;
cin >> N >> Q;
fenwick_tree<long long> t(N);
for (int i = 0; i < N; ++i) {
long long a;
cin >> a;
t.add(i, a);
}
for (int i = 0; i < Q; ++i) {
long long q, arg0, arg1;
cin... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#include<assert.h>
#include<chrono>
#include<random>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
main(){
int a,b,c;
cin >> a >> b >> c;
if(a<c){
if(c<b) cout << "Yes" << endl;
else cout << "No" << endl;
}else{
if(c>b) cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void){
int a, b, c;
cin >> a >> b >> c;
cout << ((c-a)*(b-c)>0?"Yes":"No") << endl;
return 0;
} | 1 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double EPS = 1e-10;
bool rec(int n, vector<int>& num, vector<bool>& isPlus) {
// ベースケース
if... | #include <iostream>
#include <vector>
#include <algorithm>
class Baseball {
private:
int out;
int runner;
int score;
public:
//constructor
Baseball() {
out = 0;
runner = 0;
score = 0;
}
//getter
int getOut() { return out; }
int getRunner() { return runner; }
int getScore() { return score; }
//input... | 0 |
#include <bits/stdc++.h>
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 = (int) (a)-... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long
const int md=998244353;
const int mx=4005;
int n,k;
ll exp(ll b, ll n){
ll res = 1;
for(;n;n>>=1,(b*=b)%=md)if(n&1)(res*=b)%=md;
return res;
}
ll fact[mx]={1},invf[mx];
inline void init(int n){
for(int i=1;i<=n;i... | 1 |
#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> p... | #include <iostream>
#include <cstdio>
using namespace std;
int S[1000000], cnt = 0;
int sor(int n, int g){
do{
g = (g - 1) / 3;
for(int i = g;i < n;i++){
int j = i - g, v = S[i];
while(j >= 0 && v < S[j]){
//printf("*%d*", j);
S[j + g] = S[j];
j -= g, cnt++;
}
S[j + g] = v;
}
}while... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
ll n,t,x; cin>>n>>t;
ll px=-1,ans=0;
for(ll i=0;i<n;i++){
cin>>x;
ans+=t;
if(px!=-1) ans-=max((ll)0,px-x+t);
px=x;
}
cout<<ans;
}
| #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
string s;
cin>>s;
if(s=="SUN")cout<<"7"<<endl;
if(s=="MON")cout<<"6"<<endl;
if(s=="TUE")cout<<"5"<<endl;
if(s=="WED")cout<<"4"<<endl;
if(s=="THU")cout<<"3"<<endl;
if(s=="FRI")cout<<"2"<<endl;
if(s=="SAT")cout<<"1"<<endl;
}
... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string x, y, z;
bool s = false;
bool t = false;
cin >> x >> y >> z;
if(x[x.size()-1] == y[0]){s = true;}
if(y[y.size()-1] == z[0]){t = true;}
if(s*t == 1){cout << "YES" << endl;}
else{cout << "NO" << endl;}
} | #if 1
#include <bits/stdc++.h>
#else
#include "../../bits/stdc++.h"
#endif
#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(i,0,(n))
#define RREP(i,n) RFOR(i,0,(n))
using namespace std;
typedef pair<int, int> P;
#define pb push_back
#define ... | 0 |
#include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n; cin >> n;
vector<int> a(n+2);
a[0] = 0;
a[n+1] = 0;
int sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += abs(a[i] - a[i-1]);
}
s... | 0 |
#include<bits/stdc++.h>
using namespace std;
// macro
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
// code starts
#define MOD 1000000007
int main()
{
int h,w,k;cin>>h>>w>>k;
vector<vector<ll>> dp(h+1,vector<ll>(w,0));
dp[0][0]=1;
int i,j,l;
for(i=1;i<=h;i++)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int MOD = 1e9 + 7;
int H, W, K;
vector<int> fib;
ll ans;
void input() {
cin >> H >> W >> K;
}
int solve(int n) {
if (n < 0) return 1;
return fib[n];
}
int main() {
input... | 1 |
#include<iostream>
#include<map>
#include<string>
using namespace std;
typedef pair<string, string> P;
P next_word(string sentence) {
if (sentence.empty()) return make_pair(string(""), string(""));
if (sentence[0] == ' ' || sentence[0] == '.') {
return make_pair("", sentence.substr(1));
} else {
P recur... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string stro, str;
while(getline(cin, stro)){
for(int i = 0; i < 26; i++){
str = stro;
for(int j = 0; j < stro.length(); j++){
if(str[j] >= 'a' && str[j] <= 'z')
if(str[j] + i > 'z')
str[j] += i - 26;
else
str[... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef map<ll,ll>::iterator itll;
typedef long double ld;
typedef map<ll,ll> mapll;
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define INF 1000000000000000000
#define all(vl)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> ... | 0 |
#include<iostream>
using namespace std;
int main(){
int n, q, count = 0;
cin >> n;
long int S[n];
for(int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
while(q--){
long int T;
cin >> T;
int i = n;
while(i--){
if(S[i] == T){
count++;
break;
}
}
}
cout << ... | #include<iostream>
using namespace std;
#include<stdio.h>
class dice {
private:
int temp_t;
int temp_e;
int temp_s;
int temp_b;
int temp_w;
int temp_n;
public:
int top;
int ea... | 0 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
int a[200005], b[200005];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
for (int i = n; i >= 1; --i) {
s... | #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),... | 0 |
#include <bits/stdc++.h>
using namespace std;
class Fruit {
public:
string name;
double efficiency;
Fruit(string _name, double _efficiency):
name(_name),
efficiency(_efficiency) {
}
};
int main() {
int N;
while(cin >> N, N) {
vector<Fruit> fruits;
for(int n = 0; n < N; ++n) {... | #include<iostream>
#include<algorithm>
using namespace std;
struct CROPS{
string name;
double total;
};
int main(){
int i,j,n;
double p,a,b,c,d,e,f,s,m,efficient;
CROPS crop[51];
while(1){
cin >> n;
if(n==0)break;
for(i = 0; i < n; i++){
cin >> crop[i].name >> p >> a >> b >> c >> d >>... | 1 |
#include<stdio.h>
main(){
int i,d,s;
while(scanf("%d",&d)!=EOF){
s=0;
for(i=0;i<600/d;i++){
s+=(d*((d*i)*(d*i)));
}
printf("%d\n",s);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
int n;
while (cin >> n, n){
vector<int> dp(n + 5);
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
for (int i = 4; i <= n; i++){
dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1];
}
cout << (((dp[n] + 9) / 10) + 364) / 365 << endl;
}
retur... | 0 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | #include<stdio.h>
int main(void)
{
for(;;){
int houkosu={0};
int comkosu={0};
int hou[21][21]={{0},{0}};
int zahyo[21][21]={{0},{0}};
int mypox={10};
int mypoy={10};
int x={0},y={0};
int i={0},j={0};
char dire={0};
int dis={0};
int hantei={0};
char dir[31]={0};
int ... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a, b, ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
for (int i = 0; i < 2; ++i) {
if (a > b) {
ans += a;
--a;
} else {
ans += b;
... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
int main(){
int H1, M1, H2, M2, K;
cin >> H1 >> M1 >> H2 >> M2 >> K;
int d=(H2-H1)*60+(M2-M1);
cout << d-K << endl;
return 0;
} | #include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <vector>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline cha... | 1 |
////////////////////////// Author
////////////////////////// Nasim Hossain Rabbi
////////////////////////// JU-CSE28
////////////////////////// CF - imnasim3.1415
////////////////////////// UVA - imnasim3.1415
////////////////////////// Mail - imnasim3.1415@gmail.com
#include<bits/stdc++.h>
using namespace std;
#define... | #include<algorithm>
using namespace std;
#define MAXN 100000
int AC[MAXN] = {};
int WA[MAXN] = {};
int main()
{
int ACCount = 0;
int WACount = 0;
int n,m;
scanf("%d %d",&n,&m);
for(int i = 0; i < m; i++)
{
int curNum;
char first, second;
scanf("%d %c%c", &curNum, &firs... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v)... | #include <bits/stdc++.h>
#define NO puts("No"),exit(0)
using namespace std;
const int N=100010;
int n,a[4][N],b[N],t[N],rev[2],swp[2];
void modify(int x){for (; x<=n; t[x]^=1,x+=x&-x);}
int ask(int x){int s=0; for (; x; s^=t[x],x-=x&-x); return s;}
void work()
{
scanf("%d",&n);
for (int i=1; i<=3; i++)
for (i... | 1 |
#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#define FOR(i,k,n) for(int (i) = (k); (i) < (n)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,n) for(ll i = (s); i < (n); i++)
#define rep0(i,n) rep(i,0,n)
#define rep1(i,n) rep(i,1,n+1)
#define repR(i,s,n) for(ll i = (n-1); i >= (s); i--)
#define repR0(i,n) repR(i,0,n)
#define repR1(i,n) repR(i,1,n+1)
#define BR "\n"
#define ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r;
int g;
int x;
cin >> r;
cin >> g;
x = 2*g - r;
cout << x << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G;
cin >> R >> G;
cout << G - R + G << endl;
} | 1 |
#include "bits/stdc++.h"
#define REP(i,num) for(ll i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,... | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
int main()
{
int num,i,j,x,y,z;
char a[20],b[20],c[20];
scanf("%s %s %s",a,b,c);
x = strlen(a);
y = strlen(b);
z = strlen(c);
if(a[x-1] == b[0] && b[y-1] == c[0]) cout << "YES";
else cout << "NO";
} | 0 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<list>
#include<stack>
#include<queue>
#include<cctype>
#include<iomanip>
#include<functional>
#include<numeric>
#include<map>
#include<set>
#define EPS 1e-10
using namespace std;
typedef long long... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main(){
string s; cin >> s;
int n = s.size();
for(int i = 0; i < n - 1; i++){
if(s[i] == s[i + 1]){
cout << i + 1 << " " << i + 2 << endl;
return 0;
}
if(i < n - 2 && s[i] == s[i + 2]){
cout << i + 1 << " "... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int a,b;
cin>>a>>b;
cout<<a-b+1<<endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#include<queue>
#include<tuple>
#include<utility>
#include<map>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long doub... | 0 |
///////////////////////////////////////////////////////////////////////////
// /*Dis = size of the program || TLE. */
/*
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
*/
// #pragma GCC target("avx,avx2,fma")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
sort(arr.begin(),arr.end());
for(int i=1; i<arr.size(); i++){
if(arr[i-1]==arr[i]){
cout<<"NO";
return 0;
}
}
cout<<"YES";
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.be... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define mp make_pair
#define pb push_back
#define endl "\n"
#define rep(i,a,n) for(int i=a;i<n;i++)
const int mod = 1e9 + 7;
void solve() {
int n, x, t;
cin >> n >> x >> t;
int s = 0, c = 0;
while (s < n) {
s += x;
c++;
}
cout << c*t;
}... | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define FOR(i, m, n) for(ll i = m; i < (n); i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vii = vector<vi>;
using pii = pair<int, int>;
using vl = vector<ll... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a < c && b > c) || (a > c && b < c)) puts("Yes");
else puts("No");
return 0;
} | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(){
int n;
while(cin >> n, n){
n++;
vector<int> t(n), v(n);
t[0] = 0;
for(int i = 1;i < n;i++){
cin >> v[i];
t[i] = max(t[i-1]+v[i], v[i]);
}
cout << *max_element(t.begin()+1, t.end()) << endl;... | #include <iostream>
using namespace std;
int n , now = 0;
int saiki(int now){
if( now == n )
return 1;
if( now > n )
return 0;
int res = 0;
res += saiki(now+1)+saiki(now+2)+saiki(now+3);
return res;
}
int main(){
while(1){
int x=0;
cin >> n;
if( n==0 ) break;
int count = saiki(0);
int co = count / 1... | 0 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-1; ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
ll N;
cin >> N;
if(N==0){
cout << 0 << endl;
return 0;
}
string S = "";
while(N!=0){
if(N%2==0){
... | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
using namespace std;
const int N=3e5+30,M=524288;
const int MAX=2e9;
const long long Mod=1e9+7;
int trans[8][2]={{2,1},{4,3}... | 0 |
#include <bits/stdc++.h>
using namespace std;
char s[10000];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> s;
int n = strlen(s);
for (int i = 0; i < n - 8; i++) cout << s[i];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
// macros
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,i; cin >> n >> i;
int ans = 1;
if(n%i == 0) ans = 0;
cout << ans << endl;
} | /*16D8103008D 西村 悠輝 ALDS10C*/
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
string X, Y;
int v[1001][1001];
int dp(string X, string Y) {
int n = X.size();
int m = Y.size();
for (int i = 0; i <= n; i++) {
v[i][0] = i; ///０のテーブル
for (int j = 0; j <= m; j++) {
v[0]... | 0 |
/*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#d... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pi 2*acos(0.0)
int main(void)
{
//ios_base::sync_with_stdio(false);
//cin.tie(0);
// cout.tie(0);
set<ll>s;
int n;
cin>>n;
bool flag = true;
while(n--)
{
ll x;
cin>>x;
if(s.count(x)>0)
{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
string S; cin >> S;
vector<i... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
int main() {
stri... | 0 |
#include<iostream>
using namespace std;
int main ()
{
int n, a, p, k;
cin >> n;
a = n / 100;
k = a * 100 + a * 10 + a;
p = (a + 1) * 100 + (a + 1) * 10 + a + 1;
if(n <= k)
cout << k;
else
cout << p;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
const int inf = 100100100;
//conbinatin (2002,2) =
int main(){
ll n,y;
cin >> n >> y;
rep(i,n+1){
rep(j,n+1-i){
int k = n-i-j;
if(10000*i+5000*j+10... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 |
#include <iostream>
#include <math.h>
int main()
{
int x;
std::cin >> x;
std::cout << int(pow(x, 3)) << std::endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int x;
cin >> x;
cout << x * x * x << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typenam... | #include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
int main() {
int a, b, k;
cin >> a >> b >> k;
rep(i, k) {
if(i % 2 == 0) {
a ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N;
vector<string> blue(N);
int MAX = 0;
for(int i = 0; i < N; i++){
cin >> blue.at(i);
}
cin >> M;
vector<string> red(M);
for(int i = 0; i < M; i++){
cin >> red.at(i);
}
int count;
string S;
fo... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
const int INF = 1e9 + 7;
int m;
int g1[100][100]; //cost
int g2[100][100]; //time
void floyd()
{
for (int k = 0; k < m; k++) {
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
g1[i][j] = min(g1[i][j], g1[i][k] + g1[k][j]);
... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
struct Graph{
Graph(int n):E(n),d(n){}
vector<vector<tuple<int,int,int>>>E;
vector<int>d;
void add_edge(int a,int b,int c,int d){
E[a].push_back(make_tuple(b,c,d));
}
void dijkstra(int s,int f){
priority_queue<P,vector<P>,greater<... | 1 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <set>
#include <cmath>
#include <algorithm>
using namespace std;
int day_of_week(int y,int m,int d){
static int t[]={0,3,2,5,0,3,5,1,4,6,2,4};
y-=m < 3;
return ( y + y/4 - y/100 + y/400 + t[m-1] + d) % 7 ;
}
int ma... | #include <stdio.h>
int main(void)
{
int day[13][32];
int i, j;
int n = 4;
int month;
int da;
for (i = 1; i <= 12; i++){
if (i == 1 || i == 3 || i == 5 || i == 7 || i == 8 || i == 10 || i == 12){
for (j = 1; j <= 31; j++){
day[i][j] = n;
n++;
if (n == 8){
n = 1;
}
}
}
else if (... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main() {
ll N, Y ; cin >> N >> Y;
rep(i,N+1){... | #include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int n,y;
int i,j,flg=0;
scanf("%d %d",&n,&y);
for(i=0;i<=n;i++){
for(j=0;j<=n;j++){
if(n-(i+j)<0) {
break;
}
if(i+j+n-(i+j)==n&&y==i*10000+j*5000+(n-(i+j))*1000){
flg=1;
break;
}
}
if(flg==1) break;
}
if(flg==... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const llint INF = 1<<21;
// static const llint MOD = 1e9 + 7;
bool compPair(const pi... | #include <bits/stdc++.h>
#define ln "\n"
#define SORT(X) sort(X.begin(), X.end())
#define SORTi(X) sort(X.begin(), X.end(), greater<ll>())
#define REP(x, a, b) for (auto x = a; x <= b; x++)
#define REPi(x, b, a) for (auto x = b; x >= a; x--)
#define REPit(x, A) for (auto x = A.begin(); x != A.end(); x++)
#define REPr(... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
const long long INF = 1LL << 60;
int main(){
int A,B,C;
cin>>A>>B>>C;
if(A<=C&&C<=B){
cout<<"Yes"<<endl;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
scanf("%d%d", &a, &b);
if(a <= 8 && b <= 8) printf("Yay!\n");
else printf(":(\n");
return 0;
} | 0 |
/*input
3
2
1 2
10
2
1 1
10
6
2 3 4 5 6 7
111000
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 1e6 + 5;
ll a[N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen("BONUS.INP", "r")){
freopen("BONUS.INP", "r", stdin);
freopen("BONUS.OUT", "w... | 1 |
#define NguyenDangQuan the_author
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define mset(x, i) memset(x,i,sizeof(x))
#define elif else if
#define heap priority_queue
#define fi first
#define se second
#define pb push_back
#define ld long double
#define ll long long
#define ull unsigned long long
#defin... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000... | 1 |
#include<bits/stdc++.h>
//ios::sync_with_stdio(false);
//cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
vector<int> d(10),e(10);
for(int i = 1;i<10;i++)
{
int now = i*2;
int num = 2;
int cnt = 1;
while(now != i)
{
if(now>9)
{
now = now%10+now/10;
cnt++;
if(now==i)break;
}
now += i;
num++;
cnt++;
... | #include <iostream>
using namespace std;
int m[124][124] = {{}};
int p[124] = {};
int n;
void chain(){
for(int i = 0 ;i < n;i++) m[i][i] = 0;
for(int l = 2;l <= n;l++){
for(int i = 1 ;i <= n - l + 1;i++){
int j = i + l - 1;
m[i][j] = (1 << 21);
for(int k = i;k <= j;k++){
m[i][j] = m... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define mod 1000000007
#define b1(n) __builtin_popcount(n)
vector<int>sie;
inline int gEd(int a, int b, int *ax, int *ay)
{
int x,y;
if (a==0)
{ *ax=0;
*ay = 1;
return b;
}
int g = gEd(b%a,a,&x,&y);
*ax=y-(b/a)*x;
*ay=x;... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <string,string> P;
int n;
string s;
map<P,ll> a,b;
int main(){
cin >> n >> s;
rep(U,0,1<<n){
string t,w;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int nb_min, nb_max, nb;
int count = 0;
string str, rev;
cin >> nb_min >> nb_max;
nb = nb_min;
while (nb <= nb_max)
{
str = to_string(nb);
rev = str;
reverse(rev.begin(), rev.end());
if (str == rev)
count++;
nb++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin>>n>>k;
int a=n/100,b=k/100;
int c=b-a-1;
int aaf=(a/10)/10,aab=(a/10)%10;
int bbf=(b/10)/10,bbb=(b/10)%10;
int af=(n%100)/10,ab=(n%100)%10;
int bf=(k%100)/10,bb=(k%100)%10;
if(aab*10+aaf>=n%100){
c+=1;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void cmin(T &x, const T &y)
{
if(y < x) x = y;
}
template <typename T> void cmax(T &x, const T &y)
{
if(y > x) x = y;
}
template <typename T> void read(T &x)
{
x = 0; char c = getchar(); bool f = 0;
while(!isdigit(c) && c... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string a;
getline(cin,a);
if(a.size()==2 && a[0]==a[1]){
cout<<"1 2"<<endl;
return 0;
}
long long i,flag=0;
for(i=0;i<a.size()-2;i++)
{
if(a[i]==a[i+1] || a[i]==a[i+2] || a[i+1]==a[i+2]){
cout<<i+1<... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;cin>>a>>b;
int ans=0;
if(a>=b){
ans+=a;
a-=1;
}
else{
ans+=b;
b-=1;
}
if(a>=b){
ans+=a;
a-=1;
}
else{
ans+=b;
b-=1;
}
cout<<ans<<endl;
} | //This Code was made by Chinese_zjc_.
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <set>
#include <ct... | 0 |
#include <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#includ... | #include <bits/stdc++.h>
using namespace std;
int main() {
while (true) {
int n, m;
cin >> n >> m;
if (n==0 && m==0) {
break;
}
int p[n];
int s = 0;
for (int i=0; i<n; i++) {
cin >> p[i];
s += p[i... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 10000000;
int main() {
string s;
cin >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i-1] == s[i]) {
cout << i << " " << i+1 << endl;
return 0;
}
}
for (int i = 0; i+2 < s.... | #include <bits/stdc++.h>
using namespace std;
string s;
int main () {
cin >> s;
for (char c = 'a'; c <= 'z'; c++){
if (s.find(c) == -1){
cout << c;
return 0;
}
}
cout << "None";
} | 0 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int n,ground,ou,point;
string s;
scanf("%d",&n);
for(int cas=0;cas<n;cas++){
ground = ou = point = 0;
while(1){
cin >> s;
if(s == "OUT"){
ou++;
if(ou == 3) break;
} else if(s == "HIT"){
ground<<=1;
ground|=1... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n=0,ct=0, score=0, out=0,run=0;
string x;
cin >> n;
while (1){
int score = 0, out = 0, run = 0;
while (1){
cin >> x;
if (x == "OUT"){
out++;
}
if (x == "HOMERUN"){
score+=run;
score++;
run = 0;
}
if (x ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main() {
int N,y;
cin >> N >> y;
for(int i = 0; i<= N; i++){
for(int j = 0; i+j<= N; j++){
if(1... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <bitset>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i = (a); i < (b); i++ )
#define REP(i, n) FOR(i,0,n)
typedef pair< ll, ll > cp2;... | 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) { std::cout << #a << " = " << a << "\n"; }
template<class T1, cl... | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
int min, max;
long sum;
cin >> a[0];
min = a[0];
max = a[0];
sum += a[0];
for(int i = 1; i < n; i++){
cin >> a[i];
if(min > a[i]){
min = a[i];
}else if(max < a[i]){
max = a[i];
}
sum += a[i];
}
cout << min << " "... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vp... | /*
* a.cc:
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functi... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
struct edge { ll s, t, x; };
typedef pair<ll, ll> P;
typedef pair<double, P> event;
const ll MAX = 510000;
const ll MOD = 1000000007;
#define INF (ll)10000000000000000
int main() {
ll N,Q;
cin>>N>... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
#define bit(n,k) ((n>>k)&1) //*... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back
using pii = pair<int, int>;
using vi = vector<int>;
using lint = long long;
const int inf = 100... | #include <iostream>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int MAXXYZ = 17;
int n,x,y,z;
inline bool hasXYZ(int a){
return (a >> (z - 1)) & (a >> (y + z - 1)) & (a >> (x + y + z - 1)) & 1;
}
signed main(){
ll dp[50][1 << MAXXYZ] = {};
cin >> n >> x >> y >> z;
dp[0][0] = 1;
... | 0 |
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
int n,s;
struct que
{
int x;
long long p;
}a[100005];
long long calc(int l,int r,int last)
{
if(a[l].x>=s) return a[r].x-s;
if(a[r].x<=s) return s-a[l].x;
if(a[l].p>=a[r]... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int n) :par(n) {
for (int i = 0; i < n; i++) {
par[i] = i;
}
}
int root(int x) {
return par[x] == x ? x : par[x] = root(par[x]);
}
bool same(int x, int y) {
return root(x) == root... | 0 |
#include <iostream>
using i64 = long long;
i64 abs(i64 x) {
return x < 0 ? -x : x;
}
const int N = 100000 + 7;
int n, s;
int x[N], p[N];
i64 dfs(int l, int r, i64 u, i64 v) {
if (s < x[l]) return x[r] - s;
if (s > x[r]) return x[l] - s;
if (u + p[l] >= v + p[r]) {
i64 t = dfs(l, r - 1, u + v + p[r], 0);
re... | #include <bits/stdc++.h>
using namespace std;
vector<bool> visited, exhausted;
stack<int> cycle;
int closing_point;
void DFS(const vector<vector<int>> &graph, int v, int previous_v){
visited[v] = true;
cycle.push(v);
for(auto next_v : graph[v]){
if(next_v == previous_v) continue;
if(exha... | 0 |
#include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define endl '\n'
int main()
{
fast;
int n; cin>>n;
int ans=0;
vector<int> v;
for(int i=0;i<2*n;i++)
{
int x; cin>>x;
v.push_back(x);
}
sort(v.begin(),v.end... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int k;string s;cin>>k>>s;
if(s.size()>k) {for(int i=0; i<k; ++i) cout<<s[i]; cout<<"..."<<endl;}
else cout<<s<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m; i<n; i++)
#define co(n) cout << n << endl
using namespace std;
int main(){
string s;
cin >> s;
char a[s.size()];
int c=0, d=0;
rep(i,0,s.size()-8) cout << s.at(i);
cout << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> primes;
vector<int> is_prime(55556, -1);
for (int i = 2; i <= 55555; i++) {
if (is_prime[i] != -1) continue;
primes.push_back(i);
is_prime[i] = 1;
for (int j = i+i; j <= 55... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
const int MAX = 55556;
vector<bool> ok(MAX, true);
signed main(void)
{
int n;
vector<int> vec;
cin >> n;
ok[0] = ok [1] = false;
rep(i, sqrt(MAX))
{
if (ok[i])
{
for (int j = 0; i * (j + 2) < MAX; j++)
{
o... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
using namespace std; using ll = long long; using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
const int N = 2e5 + 5, mod = 998244353;
int fact[N], rev[N];
int mult(int a, int b) {
return (1LL * a * b) % mod;
}
int pw(int a, int b) {
if(!b)
return 1;
int ans = pw(a, b / 2);
ans = mult(ans, ans);
if(b & 1)... | 0 |
#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(x) (ll)x.size()
#define F first
#define S second
#define FOR(i,a,b) for(ll i=a;i<=b;++i)
#define ROF(i,a,b) for(ll i=a;i>=b;--i)
typedef long ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair < int , int >
const int seed = 233 , MOD = 20190816170251;
int N; char str[43];
map < PII , int > cnt;
signed main(){
scanf("%d %s" , &N , str + 1);
for(int i = 0 ; i < 1 << N ; ++i){
int p = 0 , q = 0;
for(int j = 1 ; j <= N ; ... | 0 |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,K;
cin>>A>>B>>K;
int temp=1;
for(int i=0;i<K;i++){
if(temp==1){
if(A%2 == 1){
A--;
}
B+=A/2;
A=A/2;
temp=temp*(-1);
continue;
}
if(temp==(-1)){
if(B%2 == 1){
B--;
}
... | 0 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
int main() {
int N, x;
cin >> N >> x;
int a[N];
rep(i, N) cin >> a[i];
sort(a, a+N);
int ans = 0;
for (int i = 0; i < N; i++) {
i... | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | 0 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<stack>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define reps(i,n) for(int i=1;i<=n;i++)
vector<int> card[10];
map<stack<int> ,int> check;
int visit[10];
stack<int> ub;
int cont;
void saiki(int dep,int k,i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | 0 |
//Space Coconut Grab
#include<bits/stdc++.h>
using namespace std;
#define INF 10000000
typedef long long ll;
//x^t
ll mypow(ll x, ll t){
return (ll)pow((double)x, (double)t);
}
ll ans[1000001];
int main(){
for(ll i=0; i<=1000000; i++)ans[i]=INF;
for(ll z=0; mypow(z, 3)<=1000000; z++){
ll tmp;
for(ll y... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end()... | 1 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(... | #include<bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f40;
const long long mod=2... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<int> articulation_points;
vector<int> graph[100000];
int ord[100000],low[100000];
bool visited[100000];
int visit_time = 0;
void dfs(int v,int p){
visited[v] = true;
ord[v] = visit_time;
low[v] = ord[v];
visit_time++;
b... | #include <iostream>
#include <vector>
#include <set>
using namespace std;
static const int NIL = -1;
struct Vertex {
vector<int> link;
int parent = NIL;
int ord;
int lowlink;
bool is_visit = false;
};
class ArticulationPoint {
private:
int n;
vector<Vertex> graph;
int timer = 1;
publ... | 1 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
//#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <vector>
#define INF 0x3f3f3f
typedef long long ll;
const int maxn = 1e3 + 5;
const ll mod = 1e9 + 7;
const double pi = acos(-1.0);
int n, m;
int dis... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | 0 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(void) {
map<char,int> a = {{'I', 1}, {'V', 5}, {'X', 10}, {'L', 50}, {'C', 100}, {'D', 500}, {'M', 1000}};
string str;
while(getline(cin, str)) {
int b = 0, c = a[str[0]], d = a[str[0]];
for(int i = 1; i < s... | #include <iostream>
using namespace std;
int main()
{
int date[13][32];
for(int i = 1;i<=31;i++)date[1][i] = i;
for(int i = 1;i<=28;i++)date[2][i] = i+3;
for(int i = 1;i<=31;i++)date[3][i] = i+4;
for(int i = 1;i<=31;i++)date[4][i] = i;
for(int i = 1;i<=31;i++)date[5][i] = i+2;
for(int i = 1;i<=31;i++)date[6][i]... | 0 |
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
using namespace std;
#define NMAX 200001
int a[NMAX];
int imos[NMAX];
void reset(int n) {
for(int i = 0; i < n; i++) imos[i] = 0;
}
int max(int a, int b) {
if(a > b) retur... | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a[5001] = { 0 };
int n;
while (1) {
cin >> n;
if (n == 0)break;
// a[0] = 0;
int maxv = -100000;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = ... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, x;
cin >> N >> x;
vector<int> v(N);
for (int i = 0; i < N; i++)
{
cin >> v.at(i);
}
sort(v.begin(), v.end());
int cnt = 0;
if (x < v.at(0))
{
cout << 0;
}
else
... | 1 |
#include<bits/stdc++.h>
#define N 110
using namespace std;
char s[N][N];
int sum[N][N],h,w,eh,ew;
int dp[N*N/4][N*N/4];
inline int rg(int l,int r,int d,int u){
if(l>r||d>u) return 0;
return sum[r][u]-sum[l-1][u]-sum[r][d-1]+sum[l-1][d-1];
}
int solve(int ch,int cw){
if(!ch&&!cw) return 0;
if(dp[ch][cw]>=0) return d... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m,Ex,Ey,Ans,f[2][110][110][110];
int g[110][110],row[110][110],line[110][110];
inline int Row(int id,int L,int R) {return row[id][R]-row[id][L-1];}
inline int Line(int U,int D,int id) {return line[D][id]-line[U-1][id];}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
int sx,sy,tx,ty;
cin >> sx >> sy >> tx >> ty;
string ans;
int zyoge=abs(ty-sy);
int sayu=abs(tx-sx);
char rl,ud;
//1
if(tx-sx>=0){
rl='R';
}else{
rl='L';
}
if... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<n; i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> v(N);
rep(i, N) {
cin >> v.at(i);
}
int a=0, b=0, c=0, x, y, z;
rep(i, min(K,50)) {
vector<int> vv(N+1);
rep(j,... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
void solve() {
int n, k; scanf("%d%d", &n, &k);
int g = -1, m = 0;
for (int a, i = 0... | 0 |
#include<bits/stdc++.h>
#define N 1000006
using namespace std;
int f[N][2],n;
char s[N];
int main()
{
f[0][1]=1;
scanf("%s",s+1);
n=strlen(s+1);
for (int i=1;i<=n;i++)
f[i][0]=min(f[i-1][0]+(s[i]^48),f[i-1][1]+10-(s[i]^48)),
f[i][1]=min(f[i-1][0]+(s[i]^48)+1,f[i-1][1]+9-(s[i]^48));
printf("%d\n",min(f[n][0],f[n... | #include<bits/stdc++.h>
#define ll long long int
#define mod 998244353
#define ld long double
#define pb push_back
#define inf INT_MAX
#define N 1000000
using namespace std;
int n,m,k;
ll ans=0;
ll inv[N+3];
ll fact_inv[N+3];
ll fact[N+3];
//modulo inverse
void inverse(){
inv[1]=1;//MMI
int i;
for(i=2;i<=N;i++){
... | 0 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve() {
int n;
cin >> n;
map<pair<int, int>, int> cnt;
for (int i = 1; i <= n; ++i) {
long double ai;
cin >> ai;
ll val = (ll) (ai * 1000000000.0 + 0.5);
ll cnt2 = 0;
ll cnt5 = 0;
wh... | 1 |
//
//AtCoder Beginner Contest 125
//D
//https://atcoder.jp/contests/abc125/tasks/abc125_d
//
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int a[int(1e5+10)];
ll dp[100010][2];
int main() {
int n;
cin >> n;
rep(i,n)... | 1 |
#include <iostream>
#include <string>
#include <vector>
enum face {
TOP,
FRONT,
RIGHT,
LEFT,
BACK,
BOTTOM
};
class dice {
public:
dice();
void setDice(int spot, int eye);
int getSpot(int top);
void rollNorth();
void rollSouth();
void rollEast();
void rollWest();
void roll... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N, Q;
while(cin >> N >> Q, N){
vector<int> cnt(101, 0);
for(int i=0;i<N;i++){
int M; cin >> M;
for(int j=0;j<M;j++){
int d; cin >> d;
cnt[d]++;
}
}
int res = 0;
for(int i=0;i<=100;i++){
if(cnt[res] < cnt[i]) res... | 0 |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
using namespace std;
#define MAX 256
#define S(x) (x*x)
int f(int z){
if (z < 10)return 1;
return 1 + f(z / 10);
}
int main(void){
int ans[MAX];
for (int i = 0; i < MAX; i++){
ans[i] = 0;
}
int d;
int i = 0;
while (scanf("%d", &d)... | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int f(int x)
{
return pow(x, 2);
}
int main()
{
int n;
while (cin >> n) {
long long int sum = 0;
for (int i = n; i <= 600 - n; i += n)
sum += f(i)*n;
cout << sum << endl;
}
return 0;
} | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int A,B;
const int c[5]={0,300000,200000,100000,0};
i... | #include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <float.h>
#include <iomanip>
#include <iostream>
using namespace std;
int main(){
int A,B,ans=0;
cin>>A>>B;
for(int i=1;i<=3;i++){
if(A==i)ans+=(4-i)*100000;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
cin.tie();
cout.tie();
int i;
int n;
cin>>n;
int a[n],b[n];
for (i = 0 ; i < n ; i++) cin>>a[i];
for (i = 0 ; i < n ; i++) cin>>b[i];
int s[3*n+2];
s[0] = -2;
for (i = 1; i < n+1 ; i++)... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int>D(N);
for(size_t i = 0; i < N; i++)
{
cin >> D[i];
}
for(size_t i = 0; i < N; i++)
{
cout << D[N - i - 1] << ( i == N - 1 ? "\n" : " " );
}
} | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int w,h;
int ans;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool canmove(int x,int y){
return (0 <= x && x < w && 0 <= y && y < h);
}
struct Map{
int map[20][20];
int s,g;
int cnt;
int cur;
Map(int m[20][20]){
for(int i=0;i<h;i++){
f... | #include <map>
#include <cmath>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 105;
const int mod = 1e9 + 7;
short dp[maxn][maxn][maxn][maxn];
short row[maxn][maxn], col[maxn][maxn];
char mp[m... | 0 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
string S; cin>>S;
vector<int>E(N);
vector<int>W(N);
for(int i=0;i<N;i++){
if(S.at(i)=='E')E[i]++;
else W[i]++;
if(i!=0){E[i]+=E[i-1];W[i]+=W[i-1];}
}
vector<int>ans(N);
for(int i=0;i<N;i++){
if(i!=0)ans[i]+=W[i-1];
... | 1 |
#include<bits/stdc++.h>
using namespace std;
int gcd(int a,int b){return b%a ? gcd(b%a,a) : a;}
int main(){
int N;
cin>>N;
int a,b,c;
cin>>a>>b;
if(N==3) cin>>c;
int tmp=gcd(a,b);
if(N==3) tmp=gcd(tmp,c);
for(int i=1;i<=tmp;i++){
if(tmp%i==0) cout<<i<<endl;
}
return 0;
}
... | #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(){
ll l,r;
cin>>l>>r;
ll ans=3000;
for(int i=l;i<=min(r,l+3000);i++){
for(int j=i+1;... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(int argc, char **argv)
{
string n;
ll k;
cin>>n;
cin>>k;
set <ll> arr;
for(ll i=0;i<k;i++){
ll x;
cin>>x;
arr.insert(x);
}
// checking for the case when the n is fine
ll flag=1;
for(ll i=0;i<n.size();i++)... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.