code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits.h>
#include <climits>
#include <map>
#include <unordered_map>
#include <cmath>
#include <set>
#include <unordered_set>
#include <iterator>
#include <deque>
#include <assert.h>
#include <cstdlib>
using namespace... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using Pll = pa... | 0 | 93,150,615 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int vs[100000+10];
int inv[100000+10];
int main(void) {
int n;
scanf("%d", &n);
REP(i, n) {
scanf("%d", &vs[i]);
inv[vs... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
ll mod_pow(ll x, ll n){
ll ans=1;
x%=MOD;
while(n!=0){
if(n&1) ans=ans*x%MOD;
x=x*x%MOD;
n=n>>1;
}
return ans%MOD;
}
int main(){
int N,K; cin >> N >> K;
ll ans=0;
map<int,ll> m... | 0 | 69,909,212 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string S, ans = "None", alp = "abcdefghijklmnopqrstuvwxyz";
bool found = true;
cin >> S;
vector<int> a(26);
for(char i : S){
a[i - 'a']++;
}
for(int j; j < 26; j++){
if(a... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> v,y;
int N;
int main () {
cin >> N;
for(int i=0;i<N;i++){
int x;
cin >> x;
v.push_back(x);
y.push_back(x);
}
sort(y.rbegin(),y.rend());
for(int i=0;i<N;i++){
... | 0 | 46,345,114 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N), Q(N);
for (int &e : P) {
cin >> e;
}
for (int &e : Q) {
cin >> e;
}
vector<int> perm(N);
vector<vector<int>> perms;
iota(begin(perm), end(perm), 1);
do {
perms.push_back(perm);
} while (next_permutation(begin... | #include <iostream>
#include <cstdlib>
#include <time.h>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <array>
#include <string>
using namespace std;
typedef long long int ll;
int main(){
cin.sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
string st;
cin >> s... | 0 | 41,325,741 |
#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include <numeric>
#include<map>
#include<unordered_map>
#include <queue>
using namespace std;
using ll=long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define AL... | #include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define rep1(i,a,b) for(ll i=a; i<=b; i++)
#define repVect(i,n) for(ll i=0; i<sum.size(); i++)
#define fixed cou... | 0 | 53,196,092 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef int64_t Int;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if (a < b && b < c)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
} | #include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <limits>
#include <queue>
#include <unordered_map>
#include <list>
#include <set>
#include <numeric>
using namespace std;
using ll = long long;
#define rep_init... | 0 | 35,921,307 |
#include <iostream>
#include <vector>
#include <algorithm>
#define MAX(X,Y) ((X)>(Y)?(X):(Y))
#define MIN(X,Y) ((X)<(Y)?(X):(Y))
#define INF 1001001001
using namespace std;
int main(void){
int n,m,x,ans=INF;
int c[15], a[15][15];
cin >> n >> m >> x;
for (int i=0; i<n; i++){
int t; cin >> t;
c[i] = t;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,m;
cin >> n >> m;
ll a[n];
ll b[n+1];
b[0]=0;
map<ll,ll> mp;
for(ll i=0;i<n;i++){
cin >> a[i];
b[i+1]=b[i]+a[i];
b[i+1]%=m;
}
for(ll i=0;i<=n;i++){
mp[b[i]]++;
}
... | 0 | 24,090,561 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
pair<int, int> p = { stoi(s.substr(5,2)),stoi(s.substr(8,2)) };
if (p <= make_pair(4, 30))cout << "Heisei" << endl;
else cout << "TBD" << endl;
} | #include <bits/stdc++.h>
#define pb push_back
#define SZ(x) ((int)(x.size()))
#define FOR(i,s,n) for (ll i = (s); (i) < (n); ++i)
#define FORD(i,s,l) for (ll i = (s); (i) >= l; --i)
#define F first
#define S second
#define TC int __tc; cin >> __tc; FOR(case_num,1,__tc+1)
#define TEST(x,i) ((x)&(1ll<<(i)))
#define SET(x... | 0 | 83,690,808 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int n,d,x;
cin >> n >> d >> x;
int a[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
}
int sum = x;
for(int i = 0; i < n; i++) {
int count = 0;
while(count*a[i]+1 <= d) {
count++;
}
sum += ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <stdio.h>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++... | 0 | 25,037,698 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
vector<long> sam(b);
for(int i=0; i<b; i++){
sam.at(i)=((i+1)*a)%b;
}
bool judge=false;
for(int i=0; i<b; i++){
if(sam.at(i)==c){
judge=true;
break;
}
}
if(judge) cout << "YES" << endl;
else cout << "NO" << ... | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef vector<vector<ll> > Graph;
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;... | 0 | 84,609,198 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long A,B,C,k,q,w;
cin>>A>>B>>C>>k;
int a=A,b=0,c=C*-1;
if(A>=k) cout<<k;
else if(A+B+C==k) cout<<a+c;
else{
q=k-A;
if(B>=q) cout<<a;
else
{
w=q-B;
w=w*-1;
cout<<a+w;
}
}
} | 0 | 69,936,288 |
#include<iostream>
using namespace std;
int main(){
long long int x=1,s;
cin>>s;
while(s!=1){
x*=s;
s--;
}
cout<<x<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int n=s.size();
int r=0;
for(int i = 0; i < n-2; i++) {
if(s[i]==s[i+1] || s[i+1]==s[i+2] || s[i+2]==s[i]){
... | 0 | 44,024,497 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> p;
typedef unsigned long long i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
const ll MAX = 100005;
ll A[100005];
int main() {
... | 0 | 45,214,752 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
const int MAX= 10000100;
#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#d... | #include<iostream>
#include<cmath>
#include<string>
#include<cstdlib>
#include<stdio.h>
#include<cctype>
#include<algorithm>
#include<string.h>
#include<iomanip>
using namespace std;
int main()
{
double x_1,y_1,x_2,y_2;
double a,b,c;
while(cin>>x_1>>y_1>>x_2>>y_2)
{
a=x_1-x_2;
b=y_1-y_2;
c=a*a+b*b;
cout<<se... | 0 | 78,295,378 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <string>
#include <cctype>
#include <map>
#include <limits>
#include <iomanip>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
int... | #include<iostream>
using namespace std;
int main(){
while(1){
int n;
cin>>n;
if(n==0)break;
int ans=0;
int mini=1001;
int maxi=0;
for(int i = 0;i<n;i++){
int a;
cin>>a;
ans+=a;
mini=min(mini,a);
maxi=max(maxi,a);
}
cout<<(ans-maxi-mini)/(n-2)<<endl;
}
return 0;
} | 0 | 44,705,559 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
template<class T> inline T... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long h,w;
cin >> h >> w;
long long s = h*w;
if(h==1||w==1){
cout << 1 << endl;
return 0;
}else if(s%2!=0){
cout << (s+1)/2 << endl;
}else{
cout << s/2 << endl;
}
return 0;
} | 0 | 15,040,381 |
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("-ffloat-store")
#include <bits/stdc++.h>
using namespace std;
#define umap unordered_map
#define uset unordered_set
#define ll long long
#define lll long long
#define pb push_back
#define... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long... | 0 | 430,596 |
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<cstring>
#include<cctype>
#include<complex>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<functional>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<bitset>
using namespace std;
cons... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 53,088,633 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 0 | 90,961,053 |
#include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;
int main() {
int n, m, x, i;
scanf("%d%d", &n, &m);
for (i = 0; i < m; i++) {
scanf("%d", &x);
n -= x;
}
if (n < 0) n = -1;
printf("%d\n", n);
return 0;
} | #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 ull = unsigned long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<ull> a;
rep(i, n+1){
... | 0 | 89,920,158 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
#include <stack>
using namespace std;
const int MAX= 10000100;
#define loop(i,a,b) for(int i = a ;... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
#define MAX_N 100
const int INV = -1;
const int EXIST = 1;
const int NO_EXIST = 0;
const int YES = 0;
const int NO = -1;
int ary_graph[MAX_N +... | 0 | 50,961,209 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll a, ll b){ return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b){ return a/gcd(a,b)*b;}
int main()
{
int N,A[100010]={},ans=0;
cin>>N;
for(int i=1;i<=N;i++){
cin>>A[i];
}
for(int i=1;i<=N;i++){
if(i==A[A[i]])ans++;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin >> n;
string s; cin >> s;
int need_left = 0;
int... | 0 | 82,030,138 |
#include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
bool can = true;
ll a, b;
string s;
cin >> a >> b >... | 0 | 18,717,921 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.... | #include<bits/stdc++.h>
using namespace std;
long long int n,a[1000001];
int gcd(int c,int d) {
return d==0?c:gcd(d,c%d);
}
int main() {
cin>>n;
int ans=0;
for (int i=0; i<n; i++) {
int x;
cin>>x;
a[x]++;
ans=gcd(ans,x);
}
int ok=1;
for (int i=2; i<=1000000; i++) {
int cnt=0;
for (int j=i; j<=1000000... | 0 | 52,899,831 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int h1, m1, h2, m2, k;
cin >> h1 >>... | #include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | 0 | 99,547,918 |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int main() {
int n,x=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
x=max(x,a[i]);
}
int t=0,l=0;
for(int i=0;i<n;i++){
if(t<min(a[i],x-a[i])){
t=min(a[i],x-a[i]);
l=a[i];
}
}
cout<<x<<' '<<l;
return 0;
} | #include<algorithm>
#include<bitset>
#include<climits>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_... | 0 | 11,387,189 |
#include<stdio.h>
int main(void){
int a,n[101]={0},m=0;
while(~scanf("%d",&a)){
n[a]++;
m=m>n[a]?m:n[a];
}
for(int i=0;i<101;i++)if(m==n[i])printf("%d\n",i);
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(fals... | 0 | 48,992,818 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <list>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
void LoopUntilZeroInpput() {
int hogegegege = 0;
while (cin >> hogegegege && hogegegege != 0) {
}
}
int N;
ll a[50];
ll Cal(ll ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h;
cin >> w >> h;
vector<pair<long, int>> dat;
for (int i = 0; i < w; i++) {
long e;
cin >> e;
dat.emplace_back(e, 0);
}
for (int i = 0; i < h; i++) {
long e;
cin >> e;
dat.emplace_b... | 0 | 56,475,170 |
#include <iostream>
#include <string>
int main(void)
{
std::string cards, cardsShuffled;
while (std::cin >> cards, cards != "-")
{
int shuffleNum;
std::cin >> shuffleNum;
int h = 0;
for (int i = 0; i < shuffleNum; i++)
{
int temp;
std::cin >> t... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x=0,y=0,z=0,w=0;
cin >>x >>y>>z>>w;
int l=x+y;
int r=z+w;
if (l==r){cout<<"Balanced";} else if (l>r) {cout<<"Left";} else {cout<<"Right";};
} | 0 | 82,518,726 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
void Yes() {printf(... | #include <bits/stdc++.h>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
char A, B, C, D;
cin >> A >> B >> C >> D;
for(int i = 0; i < (1 << 3); i++) {
string ans_s = "";
ans_s = ans_s + A;
int ans_i = A - '0';
if((i >> 0) & 1) {
ans_i +=... | 0 | 39,417,438 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int a[100]={0},b,c=1;
while(cin>>b){
a[b-1]++;
if(a[b-1]>c)
c=a[b-1];
}
for(int i=0;i<100;i++){
if(a[i]==c)
cout<<i+1<<endl;
}
return 0;
} | #include<cstdio>
#include<algorithm>
using namespace std;
int input_data[5];
int main(void){
for(int i = 0; i < 5; i++){
scanf("%d", &input_data[i]);
}
for(int i = 0; i < 5; i++){
for(int j = i + 1; j < 5; j++){
if(input_data[i] < input_data[j]){
swap(input_data[i], input_data[j]);
}
}
}
for(int i ... | 0 | 32,885,419 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
ll A, B, K;
cin >> A >> B >> K;
if(A > K) {
A = A - K;
} else if(A <= K && K < A + B) {
B = B - (K - A);
... | #include<iostream>
using namespace std;
int main(void)
{
int a,b;
while(1){
cin>>a>>b;
if(a==0 && b==0) break;
if(a<b) cout<<a<<" "<<b<<endl;
else cout<<b<<" "<<a<<endl;
}
return 0;
} | 0 | 48,788,769 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, x;
cin >> n >> x;
vector<ll> a(n);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll zero = 0;
const ll INF = 10000000000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(void){
int N;
cin >> N;
vector<int> a(101, 0);
int tmp;
for(int i = 1 ; i <= N; i++){
tmp = i;
for... | 0 | 96,131,339 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define all(v) v.begin(),v.end()
#define inf (int)(3e18)
#define P pair<int,int>
#define mod (int)(1e9+7)
#define mod2 998244353
template<class T> inline void chmin(T &a, T b) {... | #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 = 10000... | 0 | 88,177,692 |
#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>
#include <fstream>
using names... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 95,320,206 |
#include "stdio.h"
#include "limits"
#include "algorithm"
#include "iostream"
#include "cmath"
#include "string"
#include "map"
#include "iomanip"
#include "stack"
using namespace std;
int main(){
char S[110];
bool FLAG;
stack<char> temp;
while(1){
FLAG=true;
gets(S);
if(S[0]=='.')break;
for(int... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 9,373,021 |
#include <bits/stdc++.h>
using namespace std;
bool comp(const int& lh, const int& rh) {
if(rh % 10 == 0 || lh % 10 == 0) return lh%10 < rh%10;
else return lh%10 > rh%10;
}
int main(void){
int data[5];
int ans = 0;
for(int i=0;i<5;i++) cin >> data[i];
sort(data,data+5,comp);
for(int i=0;i<5;i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | 0 | 1,979,541 |
#include<iostream>
using namespace std;
char table[310][310];
char tableT[310][310];
int main(void){
int N;
cin >> N;
for(int i=0;i<N;i++){
cin >> table[i];
for(int j=0;j<N;j++){
tableT[j][i]=table[i][j];
}
}
int ans=0;
for(int k=0;k<N;k++){
bool symflag=true;
for(int i=0;i<N;i++){... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
#define REP(i, n) for (long long i = 0... | 0 | 11,013,405 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
while (1) {
int n; cin >> n;
if (!n) break;
vector<char> v1, v2;
for (int i = 0; i < n; i++) {
char c;
cin >> c; v1.push_back(c);
cin >> c; v2.push_back(c);
}
int m; cin >> m;
for (int i = 0; i < m; i++) {
char b; cin ... | #include <iostream>
#include <vector>
#include <queue>
#include <cstring>
#define INFTY 1000000000
using namespace std;
bool list[100][100];
int ti[100];
int n;
void bfs(int now){
queue<int> next;
next.push(now);
while(next.size()!=0){
now=next.front(); next.pop();
for(int i=0;i<n;i++){
if(list[now][i]&&ti[i]... | 0 | 3,072,493 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[20005]={0},b[20005]={0};
int main(){
ll n;
cin>>n;
for(ll i=1;i<=n;i++){
a[i]=i*(n+1);
b[i]=(n-i+1)*(n+1);
}
for(ll i=1;i<=n;i++){
ll p;
cin>>p;
b[p]+=i;
}
for(int i=1;i<=n;i++) cout<<a[i]<<" ";
cout<<endl;
for... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repr(i, n) for (int i=n; i > 0; --i)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x);
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; re... | 0 | 90,278,440 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
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 int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0... | 0 | 3,573,588 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,X;
cin >> A >> B >> X;
if(A+B-1-X >= 0 && A <= X){
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
} | #include <bits/stdc++.h>
#define assem99 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define ld long double
#define endll '\n'
#define sz(a) (int)(a).size()
#define RWFile freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
int dx[] = { 0, -1, 0, 1, -1, 1, -1, 1 };
int dy[] =... | 0 | 52,927,919 |
#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... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
int n, k;
cin >> n >> k;
auto upd = [] (const vector<int>& v) {
vector<int> imos((int) v.size() + 2);
for (int i = 1; i <= (int) v.size(); i++) {
int l = max(0, i - v[i... | 0 | 41,095,336 |
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#pragma optimize("JARU SOSISONI")
using namespace std;
#define int long long
#define fast cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
#define geometry cout.setf(ios::fixed); cout.precision(15);
#define all(x) (x).begin(), (x).end()... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 36,837,123 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, c, d;
cin >> a >> b >> c >> d;
cout << (min(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint=vect... | 0 | 25,674,593 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
int main(void)
{
bool check=false;
string s,t;
cin >> s;
cin >> t;
for(int i=0;i<s.size();i++)
{
if(s[i]!=t[i])
{
check=true;
}
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | 0 | 52,238,871 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
... | 0 | 24,901,849 |
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,b) loop(i,0,b)
#define all(c) (c).begin(), (c).end()
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main() ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string s;
cin >> a >> b >> s;
string ans = "Yes";
if (s.at(a) != '-') {
ans = "No";
}
for (int i = 0; i < a+b+1; i++) {
if (i == a) continue;
if (s.at(i) == '-') ans = "No";
}
cout << ans << ... | 0 | 20,310,492 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 0 | 54,885,696 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define mid ((l+r)>>1)
const int M=3e5+20,P=1e9+7;
struct Task{
LL n,m,v,p,a[M];
LL sum[M];
void run(){
init();
sort(a+1,a+n+1);
for(int i=1;i<=n;++i){
sum[i]=sum[i-1]+a[i];
}
LL ans=n-p;
wh... | 0 | 16,795,377 |
#include<bits/stdc++.h>
using namespace std;
static const double pi = 3.141592653589793;
typedef pair<int64_t,int64_t> P;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(),(v).end()
using ll = long long;
using Graph = vector<vector<int>>;
const int MAX = 510000;
const int MOD = 100000000... | #include<bits/stdc++.h>
using namespace std;
#define sc3(a,b,c) scanf("%d %d %d",&a,&b,&c)
int main(){
int a,b,k,n,m,ans;
sc3(a,b,k);
for (int i=100;i>0;i--) {
if (a%i==0 && b%i==0) k--;
if (k==0) {
printf("%d\n",i);
return 0;
}
}
return 0;
} | 0 | 46,138,257 |
#include<stdio.h>
#include<cstdio>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#define pi 3.14159
#define Inf (int)pow(2., 12.)
using namespace std;
typedef std::pair<int, int> mypair;
queue<mypair> qu;
#defi... | #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#define mp make_pair
#... | 0 | 4,551,439 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | #include<bits/stdc++.h>
#include<set>
#define lli long long int
#define pb push_back
#define cio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define rep(i,a,n) for(i=a;i<n;i++)
#define all(v) (v.begin(),v.end())
#define ppb pop_back
#define vsz v.size()
#define pi 3.141592653589793238
using namespac... | 0 | 10,697,603 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
int main(void)
{
int N, x;
cin >> N >> x;
int ans;
if (N == 1)
{
ans = 1;
}
else if (N == 2)
{
if (x == 1)
ans = 2;
else
ans = 1;
}
else
... | #include<bits/stdc++.h>
#define ll long long
#define mod 1000000007ll
using namespace std;
ll ara[300005], cnt[2];
int main()
{
int n;
scanf("%d", &n);
for(int i=0; i<n; i++)
scanf("%lld", &ara[i]);
ll res= 0;
for(int i=0; i<60; i++)
{
cnt[0]= cnt[1]= 0;
for(int j=0; j<n; j++... | 0 | 50,718,692 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long m,k;
cin >> m >> k;
if(k >= 1 << m || (m == 1 && k == 1))
{
cout << (-1) << endl;
return 0;
}
if(k == 0 && m == 1)
{
cout << "1 1 0 0\n";
return 0;
}
int p = 1 << m;
for(int i = 0... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge { ll to, cost; };
const int MAX_V =100000;
const ll INF = 1LL<<60;
int V;
vector<edge> G[MAX_V];
ll d[MAX_V];
void dijkstra(ll s) {
priority_queue<P, vector<P>, great... | 0 | 71,951,985 |
#include<bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false),cin.tie(NULL);
#define ll long long
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define mii map<int, int>
#define pb ... | #include <stdio.h>
int main(){
int N, M;
scanf("%d %d", &N, &M);
int a1 = 0, a2 = 0, b1 = 0, b2 = 0;
for(a1=1; a1<N; a1++){a2 = a2+a1;}
for(b1=1; b1<M; b1++){b2 = b2+b1;}
(N+ M>= 2) ? printf("%d", a2 + b2) : printf("0");
return 0;} | 0 | 5,153,196 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define cool ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define MAX 1000001
#define mod 1000000007
#define pie 3.14159265358979323846
void solve()
{
int n,i,j,ans=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomani... | 0 | 44,276,855 |
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | #include <bits/stdc++.h>
using namespace std;
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vector<vector<t>>;
typedef long long ll;
typedef vc<int> vi;
typedef vvc<int> vvi;
typedef pair<int, int> pi;
#define uset unordered_set
#define umap unordered_map
#define endl "\n"
#define fi first
#de... | 0 | 98,886,310 |
#include<cstdio>
#include<cstdlib>
#define LL long long
using namespace std;
int main() {
LL x,y;
scanf("%lld%lld",&x,&y);
if(llabs(x-y)>=2)
printf("Alice\n");
else
printf("Brown\n");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int n,m;
cin>>n>>m;
vector<vector<int>> s(n,vector<int>(3,0));
for(int i=0;i<n;i++)
for(int j=0;j<3;j++)
cin>>s[i][j];
int ans=INT_MIN;
for(int i=0;i<8;i++)
{
vector<int> v;
for(i... | 0 | 23,316,991 |
#include <bits/stdc++.h>
using namespace std;
#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++)
int main() {
int mod=1000000007;
int n;
cin >> n;
vector<int>a(n);
vector<int>b(n);
rep(i,n){
cin>>a.at(i);
}
rep(i,n){
cin>>b.at(i);
}
... | #include <bits/stdc++.h>
#define MAX 100000
using namespace std;
int n, A[MAX + 1], L[MAX];
int lis()
{
L[0] = A[0];
int l=1;
for(int i=1; i<n; i++){
if (L[l - 1] < A[i])
{
L[l++] = A[i];
}
else
{
*lower_bound(L, L + l, A[i]) = A[i];
}
... | 0 | 74,021,944 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t=1;
while(t--)
{
ll n;
cin>>n;
ll arr[n];
for(ll i=0;i<n;i++)
{
cin>>arr[i];
}
... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 96,188,920 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
if(K == 1)
cout << 0;
else
cout << N-K;
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll S; cin >> S;
ll x2 = 1e9;
ll x3 = (x2-S%x2)%x2;
... | 0 | 46,961,497 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
vector<int> V(5);
vector<int> W(5);
vector<int> X(5);
int ans = 0;
for (int i = 0; i < 5; i++) {
cin >> V[i];
}
for (int j = 0; j < 5; j++) {
W[j] = V[j]/10 + min(1,V[j]%10);
ans += W[j]*... | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool ... | 0 | 15,983,405 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;cin>>a;
cout<<(a>=1200 ? "ARC":"ABC")<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fastio {\
ios::sync_with_stdio(0);\
cin.tie(0);\
}
#define file {\
freopen("io\\in.txt", "r", stdin);\
freopen("io\\out.txt", "w", stdout);\
freopen("io\\err.txt", "w", stderr);\
}
#ifdef LOCAL
#define debug(args...) {\
string _s(#args);\
... | 0 | 18,670,217 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,k,i=0;
cin>>a>>b>>c>>k;
while(a>=b&&i<=k)
{
i++;
b*=2;
}
while(b>=c&&i<=k)
{
i++;
c*=2;
}
if(a<b<c&&i<=k)
{
cout<<"Yes";
return 0;
}
cout<<"No";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define PB push_back
#define _SAD() ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
#define SZ(s) s.size()
#define SRT(x,y) sort(x,x+y)
#define REV(a,b) reverse(a,a+b)
#define VSR... | 0 | 61,731,331 |
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
int main() {
int k = 1000001;
int n;
cin >> n;
vector<int>a(k);
vector<int>b(n);
rep(i, ... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<vector>
using namespace std;
vector<pair<double, double> > kochPoint(vector<pair<double, double> > points, int n){
vector<pair<double, double> > newpoints;
int points_n = points.size();
for(int i=0; i<points_n-1; i++){
pair<double, doubl... | 0 | 78,193,266 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
int x;
cin >> x;
if(x <100){
cout << 0 << endl;
return 0;
}
if(x %100 == 0){
cout << 1 << endl;
return 0;
}
int xx = x / 100;
int mod = x % 100;
puts(5*xx >= mod ? "1" : "0");
return 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;
typedef pair<int,int> P;
constexpr int mod = 1e9+7;
int main(){
string s;
cin >> s;
int n = s.size();
vector<vector<int>> dp(n+1, vector<int>(2, 0));
dp[0][0] = 1;
for... | 0 | 87,509,343 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n, a, sum = 0;
cin >> n >> a;
while (1) {
if (n % 500 == 0)
break;
n--;
sum++;
}
if (sum <= a)
cout << "Yes" << endl;
els... | 0 | 41,116,107 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
ll x, y;
cin >> x >> y;
if (x % y == 0) cout << -1 << endl;
else cout << x << endl;
return 0;
} | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n;
cin >> n;
vector<int> arr(n, 0);
for(auto& val: arr)
cin ... | 0 | 93,521,808 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | #include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define MAXMIN(a,b,c) std::max(a,min(b,c))
#define CHABS(a)... | 0 | 32,752,995 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int dp[100005], a[100005];
int n;
int solve(int n)
{
dp[1]=0;
for(int i=2; i<=n; i++)
{
dp[i]=dp[i-1] + abs(a[i]-a[i-1]);
if(i>2)
dp[i]=min(dp[i], dp[i-2] + abs(a[i]-a[i-2]));
}
return dp[n];
}
int main()
... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<(n);++i)
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RREP(i, n) for(int i=(int)(n);i>=0;--i)
#define RFOR(i, a, b) for(int i=(int)(a);i>=(int)(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define DUMP(x... | 0 | 66,683,205 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> Pil;
ll a, b, c, d;
int main() {
cin >> a >> b >> c >> d;
ll ans = max(a*c, a*d);
ans = max(ans, max(b*c, b*d));
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int INF=1e8;
int d[12][12];
int V;
void warshall_floyd()
{
for(int k=0;k<12;k++)
for(int i=0;i<12;i++)
for(int j=0;j<12;j++)
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
int main()
{
while(cin>>V)
{
if(V==0) break;
for(int i=0;i<12;i++)
for(int j=0;j<12;j++)
{... | 0 | 33,357,423 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int n,m;
cin >> n >> m;
static int dp[100001] = {0};
rep(i,m){
int a;
cin >> a;
dp[a] = -1;
}
dp[0] = 1;
rep(i,n+1){
if(dp[i] == -1) co... | #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)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 0 | 91,509,670 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
using namespace std;
int main()
{
int N;
stack<int> mystack;
while(cin>>... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | 0 | 24,236,559 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define INF (1<<30)-1
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B... | 0 | 62,375,756 |
#include<bits/stdc++.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
long long n;
while(1){
cin>>n;
if(!n)break;
char from[n],to[n];
bool check[n];
rep(i,n){
cin>>from[i]>>to[i];
}
char desk;
long long m;
string ans="";
cin>>m;
for(lon... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int n;
cin>>n;
cout<<(int)((n-1)/2);
return 0;
} | 0 | 63,726,053 |
#include <algorithm>
#include <cstdio>
#include <vector>
class PriorityQueue {
std::vector<int> v_;
public:
void insert(int i)
{
v_.push_back(i);
upto(v_.size()-1);
}
int extract_max()
{
const auto max = v_.front();
v_[0] = v_.back();
v_.pop_back();
downto(0);
return max;
}
pri... | #include <iostream>
#include <math.h>
using namespace std;
int n;
struct Point
{
double x, y;
};
void KorchCurve(int d, Point p1, Point p2) {
if (d == 0) return;
Point s, u, t;
double theta = M_PI * 60.0 / 180.0;
s.x = (p1.x*2 + p2.x)/3;
s.y = (p1.y*2 + p2.y)/3;
t.x = (p1.x + p2.x*2)/3;
... | 0 | 48,966,516 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define sf scanf
#define pf printf
#define pb push_back
#define lb lower_bound
#define forr(i,x,y) for(int i=x;i<=y;i++)
#define ford(i,x,y) for(int i=x;i>=y;i--)
const int inf=0x7f7f7f,mod=100000000;
inline void read(int... | 0 | 52,902,266 |
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define all(s) s.begin(),s.end()
#define pii pair<int,int>
#define fr first
#define sc second
#define bst ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define no cout << "NO" << endl;
#define yes cout << "YES" << endl;
using ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 0 | 55,698,790 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5;
int n;
int a[N];
int gcd(int x, int y) {
... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.... | 0 | 27,226,054 |
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functi... | #include<bits/stdc++.h>
using namespace std;
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pop... | 0 | 35,323,318 |
#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[5];
rep(i, 5)scanf("%d", &a[i]);
sort(a, a + 5, greater<>());
rep(i, 5)cout << a[i] << (i == 4 ? '\n' : ' ');
return 0;
} | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
class Prints {
private:
class __Pr... | 0 | 30,702,408 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> a(101, -1);
for (int i = 0; i < 9; i++)
{
int x;
cin >> x;
a[x] = i;
}
vector<int> called_row(3, 0);
vector<int> called_col(3, 0);
int d = 0;
int u = 0;
int n;
cin >> n;
for (int i ... | #include<bits/stdc++.h>
#include<set>
#define lli long long int
#define pb push_back
#define cio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define rep(i,a,n) for(i=a;i<n;i++)
#define all(v) (v.begin(),v.end())
#define ppb pop_back
#define vsz v.size()
#define pi 3.141592653589793238
using namespac... | 0 | 30,377,485 |
#include<bits/stdc++.h>
#define EB emplace_back
#define int long long
#define F first
#define S second
#define N 100005
#define ALL(x) x.begin(),x.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
int32_t main()
{
IOS;
int tt=1;
while(tt--)
{
int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | 0 | 2,367,791 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(ll i = (m); i <= n... | 0 | 19,462,485 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
using namespace std;
using ll = long long;
using ld = long double;
template<class T> bool chmax(T &a,T b){if(a<b){a=b;retu... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int m... | 0 | 18,937,810 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define rep(i, n) for(int i=0;i<n;i++)
int main(){
int n,k;
cin >> n >> k;
if(n%k==0)cout << 0 <<endl;
else cout << 1 << endl;
} | #include<iostream>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int max = 0;
for(int i = 0; i <= (int)S.size() - (int)T.size(); i++) {
int cnt = 0;
for (int j = 0; j < (int) T.size(); j++) {
if (S[i + j] == T[j]) cnt++;
}
if (max < cnt) max = ... | 0 | 15,684,657 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<math.h>
#include<assert.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long INF = 1LL << 40;
const doub... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define pi pair<int,int>
#define pl pair<long long,long long>
#define rd(x) cin >> x;
#define rda(a,n) for(int i=1;i<=n;i++) cin >> a[i];
#define wr(x) cout << x << ' ';
#de... | 0 | 98,673,080 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
using namespace std;
int main(void){
int N;
cin >> N;
vector<int> W(N);
for(int i = 0; i < N; i++){
cin >> W[i];
}
int ans = INT_MAX;
for(int i = 0; i < N; i++){
int s1_Sum = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main()
{
ll n, sum = 0;
cin >> n;
vector<ll> a(n + 1), b(n... | 0 | 35,847,010 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
int main() {
int a,b,c;
cin >> a >> b >> c;
if(c-(a-b) >= 0){
cout << c-(a-b) << endl;
}else{
cout << 0 << endl;
}
return(0);
} | #include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i... | 0 | 27,026,394 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int ls[3][3];vector<int> up(101,0);
for(int u=0;u<3;u++){
for(int v=0;v<3;v++){
cin>>ls[u][v];}}
int u,v,an=0,n,f=1;cin>>n;
while(n--){
int a;cin>>a;up[a]=1;}
for(u=0;u<3;u++){f=1;
for(v=0;v<3;v++){
if(!up[ls[v][u]]){f=0; ... | #include <utility>
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
int N, M;
while(cin >> N >> M && N >0)
{
pair<int, int> PD[10000];
for(int i=0;i<N;i++)
cin >> PD[i].second >> PD[i].first;
sort(PD, PD+N);
int Mcur = M;
int sum = 0;
for(int i=0;i<... | 0 | 67,793,860 |
#include <string>
#include <iostream>
#include <utility>
template<typename T>
struct Node
{
T value;
Node* left;
Node* right;
Node()
{
left = right = NULL;
}
};
template<typename T>
class MySet
{
Node<T>* root_;
std::pair<Node<T>*, bool> insert(const T& value, Node<T>* node)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
const long long int m=pow(10,9)+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
vecto... | 0 | 46,734,594 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | #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++)
#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 push_back
#define all(v) (v).begin(), (v).end... | 0 | 80,466,060 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll A[100001];
ll usable_non_leaf_nodes[100001];
ll max_non_leaf_nodes[100001];
int main() {
int N;
cin >> N;
cin >> A[0];
if (N == 0) {
if (A[0] == 1) {
cout << 1 << endl;
} else {
cout << -1 << endl;
}
return 0;
} else if (A[0] > 0)... | #include <cstdio>
int main()
{
int n, m, d, p, r[11];
while(true)
{
scanf("%d", &n);
scanf("%d", &m);
if(n == 0 && m == 0) { break; }
for(int i = 0; i < 11; i++)
{
r[i] = 0;
}
for(int i = 0; i < n; i++)
{
scanf("%d", &d)... | 0 | 3,913,472 |
#include <iostream>
using namespace std;
int main(){
while(true){
int n,number[1000000],k;
long long int num=0,max=-1000000000;
cin >> n >> k;
if(n+k==0) break;
for(int i=0 ; i<n ; i++ )
cin >> number[i]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int m... | 0 | 53,661,933 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
long long a[(1<<n)];
pair<long long,long long> dp[(1<<n)];
for (int i = 0; i < (1<<n); ++i)
{
cin>>a[i];
dp[i]={a[i],-1000000000000000LL};
}
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < (1<<n); ++j)... | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
long long n, d, x;
cin >> n >> d >> x;
long long a[n];
for(long long i = 0; i < n; i++) cin >> a[i];
long long ans = x;
for(long long i = 0; i < n; i++){
long long cnt = 0;
long long start = 1;
while(s... | 0 | 14,427,951 |
#include<bits/stdc++.h>
#define faster ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define ull unsigned long long
#define pb push_back
const double PI = acos(-1.0);
using namespace std;
int main()
{
faster
int n;
cin>>n;
int a[n],b[n],c[n];
for(int i=0; i<n; i++)
{
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 42,239,934 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define MAX 1000
int c[MAX+1][MAX+1];
int lcs(string A, string B) {
int a = A.length();
int b = B.length();
int maxl = 0;
A = ' ' + A;
B = ' ' + B;
for(int i=0; i<a; i++) {
c[i][0] = 0;
}
for(int j=0... | #include<bits/stdc++.h>
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 = 0x3f3f3f3f;
const long long mod=1e9+7;
const long dou... | 0 | 49,286,155 |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<vector>
#include<cmath>
#include<map>
#include<string>
#include<queue>
#include<stack>
#include<bitset>
#include<list>
#include<set>
#include<utility>
#include<iomanip>
#define IO ios::sync_with_stdio(false)
#define eps 1e-7
#define in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
int const MOD = 1e9 + 7;
inline ll add(ll a, ll b) { return ((a % MOD) + (b % MOD)) % MOD; }
inline ll mult(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
int solve(int n, ll k, vi a)
{
vi l(n, 0), r(n, 0);
for (i... | 0 | 16,984,579 |
#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>
#includ... | #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;
int main(){
string N;
int K, l;
cin >> N >> K;
l = N.size();
vector<int> n(l);
rep(i,l) n[i] = N.at(i) - '0';
vector... | 0 | 15,089,946 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.