code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define pii pair <int, int>
#define all(vv) (vv).begin(), (vv).end()
#define time cerr << '\n' << (double)clock()/CLOCKS_PER_SEC << '\n'; return 0
int n;
map <string, int> mp;
int32_t main() {
ios_base::sync_... | #include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#pragma GCC optimize("Ofast")
#define rep(i, n) for(int i = 0; i < (n); ++i)
... | 0 | 32,665,355 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
const int INF=1001001001;... | #include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <stack>
#include <complex>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
vector<int> res[1000];
int mai... | 0 | 63,748,154 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
#define rep(i, r) for(int i = 0; i < (int)(r); i ++)
int main(){
int n; cin >> n;
vector <ll> A(n);
vector <ll> sum_of_A(n);
rep(i, n){
cin >> A.at(i);
}
sort(A.begin(), A.end());
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
const int dx[] = { -1 , -1 , -1 , 0 , 0 , 0 , 1 , 1 , 1 };
const int dy[] = { -1 , 0 , 1 , -1 , 0 , 1 , -1 , 0 , 1 };
#define NN 8010000
#define TC int t;cin>>t;for(int T=1;T<=t;T++)
#define mod 1000000007
#define PI acos(-1)
#define a... | 0 | 82,108,528 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll a;
cin>>a;
ll b;
cin>>b;
ll c=-100;
ll d=100;
ll e,f;
cin>>e>>f;
for(ll i=0; i<a;i++){
ll g;
cin>>g;
c=max(g,c);
}
for(ll i=0;i<b;i++){
ll h;
cin>>h;
d=min(h,d);
}
if(c+1>d){
cout<<"War... | 0 | 100,577,318 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
ll k,s;
ll ans;
int main(void){
cin>>k>>s;
for(int x=0;x<=k;x++){
for(int y=0;y<=k;y++){
if(0<=s-x-y&&s-x-y<=k){
ans++;
}
}
}
cout<<... | #include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
const int N = 2000 + 5;
ll r[N][N] = {}, l[N][N] = {};
ll u[N][N] = {}, d[N][N] = {};
char arr[N][N];
int main(){
Hello
ll h, w, ans = 0;
cin >> h >> w;
... | 0 | 24,279,306 |
#include "bits/stdc++.h"
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include <bits/stdc++.h>
typedef long long ll;
#define mod 1000000007
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("outp.txt","w",stdout);
#endif
ll n,k,d,x;
map<ll,ll> m;
cin>>n>>k;
for(ll i=1;i<=k;i++)
{
cin>>d;
for(... | 0 | 74,122,407 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e12;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; ++i) cin >> a.at(i);
vector<long long> v(n+1, 0);
for(int i = 0; i < n; ++i) v.at(i+1) = v.at(i) + a.at(i);
vector<long long> w(n+1, 0);
... | #include<bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (ll)n; i++)
#define REPvec(itr, mp) for(auto itr = mp.begin();itr != mp.end(); itr ++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef vector<int > vecint;
typedef vector<double > vecd;
typedef ... | 0 | 85,085,607 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.e... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 62,881,275 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int64_t N ,T=1 ;
cin >> N ;
vector<int64_t> A(N) ;
for(int i = 0 ; i < N ; i++){
cin >> A.at(i) ;
if(A.at(i) == 0 ){
cout << 0 << endl ;
return 0 ;
}
}
for(int i = 0 ; i < N ; i++){
if(A.at(i) > 1000000000000000000/T... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | 0 | 85,588,302 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define deb... | #include <iostream>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <climits>
#define el '\n'
typedef long long ll;
using namespace std;
void sol(){
int n;
cin >>n;
vector<int> h(n);
for (int &i: h) cin >>i;
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(h[0] - ... | 0 | 88,440,536 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main()
{
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<ll> p(a);
rep (i, a)
cin >> p[i];
vector<ll> q(b);
rep (i, b)
cin >> q[i];
sort(p.begin(), ... | #include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<char> vc;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
#de... | 0 | 39,090,118 |
#define ll long long
#define dd long double
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define fo(i , n) for(ll i = 0 ; i < n ; i++)
#include<iomanip>
#include<cmath>
#include<cstdio>
#include<utility>
#include<iostream>
#include<ve... | #include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <time.h>
#include <stdarg.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <functional>
#include <map>
#define ll long long
using namespace std;
ll mod = 1e... | 0 | 74,675,414 |
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define mod 1000000007
#define double long double
#define ull unsigned long long
#define vi vector<ll>
#define ppi ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leadinz zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | 0 | 81,429,436 |
#include<iostream>
#include<math.h>
using namespace std;
#define rep(i,n) for(i=0;i<N;i++)
int main(){
int N;
cin >> N;
int x[N];
int i;
rep(i,N){
cin>>x[i];
}
int sum=0;
rep(i,N){
sum+=x[i];
}
double pos=(double)sum/N;
int ans1=(int)pos;
int ans2=(int)(po... | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
int main(){
int a, b, c, k;
cin >> a >> b >> c >>k;
if(k<=a){
cout << k << endl;
retu... | 0 | 40,703,161 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (sca... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n;
cin >> n;
vector<long long int> v(n);
for(int i = 0; i < n; i++)
{
cin >> v[i];
}
long long int stools = 0;
for(int i = 1; i < n; i++)
{
if(v[i]<v[i-1])
{
st... | 0 | 81,348,513 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <climits>
#include <map>
using namespace std;
const int MAX_V = 1000;
const int INF = 1000000;
int v;
int g[MAX_V][MAX_V];
int d[MAX_V];
bool used[MAX_V];
void dijkstra(int s)
{
fill(d, d + v, INF);
fill(used... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int a,b;
... | 0 | 30,241,179 |
#include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int oo = 1e9 + 7;
const int mod = 1e9 + 7, maxn = 100100;
const long double PI = acos(-1);
int main (){
ios_base::sync_with_stdio(false);
cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
int main() {
ll n, a, b;
cin >> n >> a >> b;
if (a + b > n + 1 || a * b < n) {
cout << -1 << endl;
return 0;
}
vector<ll> ans;
for (ll i = b; i > 0; i--) {
... | 0 | 9,876,563 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long INF = (1LL<<62);
typedef long long L... | #include<iostream>
using namespace std;
int main(){
int n;
while(cin>>n){
if(n==0)
break;
int a[n];
for(int i=0; i<n; i++) cin >> a[i];
int Max = a[0];
for(int i=0; i<n; i++){
int sum=0;
for(int j=i; j<n; j++){
sum+=a[j]... | 0 | 86,441,904 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | #include <cstdio>
#include <iostream>
#include <queue>
#define ROP(i,n) for(int i=0;i<n;i++)
#define ROPP(i,n) for(int i=1;i<=n;i++)
#define INF 999999999
using namespace std;
typedef pair<int,int> P;
int N,M,G,gx[10],gy[10];
char MAP[1005][1005];
int DX[4]={1,0,-1,0},DY[4]={0,1,0,-1},FAR[1005][1005];
int BFS(int u){
... | 0 | 72,754,613 |
#include <iostream>
using namespace std;
string check(int a)
{
int arr[] = {1,2,3,5,6,9,10,13,17};
for(int i = 0; i < sizeof arr/sizeof arr[0]; i++)
if( a == arr[i] )
return "No";
return "Yes";
}
int main()
{
int a;
cin >> a;
cout << check( a % 28 );
} | #include <iostream>
#include <vector>
#include <cstdlib>
#include <math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 1L... | 0 | 79,702,259 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
const int INF = 1e9;
int h, w;
v2<bool> g;
v2<int> dp;
void solve(){
cin >> h >> w;
g = v2<bool>(h, vector<bool>(w));
dp = v2<int>(h, vector<int>(w));
for(int i = 0; i < h; i++){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i< (n); ++i)
const int INF = 1001001001;
long long match[10] = {2,5,5,4,5,6,3,7,6};
string dp[11000];
const string MINUSINF = "-";
void chmax(string &a, string b) {
if (a == MINUSINF) a = b;
else if (a.size() < ... | 0 | 82,649,272 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <algorithm>
#include <array>
#include <complex>
#include <string>
#include <utility>
#include <map>
#include <queue>
#include <list>
#include <functional>
#include <numeric>
#include <stack>
#include <tuple>
using namespace... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 0 | 98,555,285 |
#include <iostream>
using namespace std;
int a, b;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b;
if (a > b) {
cout << "a" << " > " << "b" << "\n";
}
else if (a < b) {
cout << "a" << " < " << "b" << "\n";
}
else {
cout << "a" << " == " << "b" << "\n";
}
cin >> a;
return 0;
} | #include <iostream>
#include <vector>
#include <unordered_set>
#include <algorithm>
#include <numeric>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
vector<int> primes_under(int hi) {
vector<int> primes;
primes.push_back(2);
for (int i = 3; i <= hi; i += 2) {
bool ok = tr... | 0 | 35,630,832 |
#include<bits/stdc++.h>
#include<atcoder/all>
#define prArr(Arr,n) for(int _=0;_<n;_++) cout<<(Arr)[_]<<" ";
using namespace std;
using namespace atcoder;
const int INF=(int)0x3f3f3f3f;
const int MOD=(int)1e9+7;
const double eps=1e-9;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int ... | #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<long, long>;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#define rep(i, n) for(ll i = 0; i<n; i++)
#define rep_s(i... | 0 | 59,514,170 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
bool l[26]={1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,1,1,1,0,1,1,1,0,1};
int main(){
while(true){
string s;
cin >> s;
if(s[0]=='#') break;
bool now=l[s[0]-'a'];
int cnt=0;
rep(i,s.size()){
if(l[s[i]-'a']!=now) cnt++;
now=l[s[i]-'... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (scanf("%d", &x)==1) return x; el... | 0 | 69,588,970 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
int main(){
ll N;
cin >> N;
vector<ll> h(N);
for (int i = 0; i < N; i++) cin >> h[i];
ll out = 0;
bool check = true;
while (check) {
int i = 0;
check = false;
wh... | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define Pi acos(-1)
#define LL long long
#define ULL unsigned long long
#define LD long double
const int MAX_N = 200005;
string S;
int SBit[MA... | 0 | 88,518,412 |
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll=long long;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
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, co... | #include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <functional>
#include <iostream>
#include <string>
#include <array>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include ... | 0 | 57,488,943 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void){
int M; cin >> M;
ll ans = 0;
vector<ll> digits;
rep(i, M){
ll d, c; cin >> d >> c;
ll m;
m = (d*c-1) / 9;
ans += c-1+m;
... | 0 | 68,653,082 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
const int MAX_N = 100005;
int par[MAX_N];
int rn[MAX_N];
void init(int n){
for(int i=0; i<n; i++){
par[i] = i;
rn[i] = 0;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
if (N==1) {
cout << 1 << endl;
exit(0);
}
vector<ll> P(N);
for (ll i=0; i<N; i++) {
cin >> P[i];
}
ll count = 1;
ll temp = P[0];
for (... | 0 | 36,192 |
#include <cstdio>
#include <vector>
using namespace std;
int main() {
size_t n;
scanf("%zu", &n);
for (size_t i=0; i<n; ++i) {
size_t k;
scanf("%*d %zu", &k);
vector<int> v(n+1);
for (size_t j=0; j<k; ++j) {
size_t d;
scanf("%zu", &d);
v[d]... | #include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
struct PriorityQueue
{
int heap[2000001];
int size = 0;
void maxHeapify(int i)
{
int left = i * 2;
int right = i * 2 + 1;
int largest;
if (left <= size && heap[left] > heap[i])
largest = left;
else
larges... | 0 | 49,140,149 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <algorithm>
#include <cmath>
#include <deque>
#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 i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f)... | 0 | 26,572,963 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
void solve()
{
ll n,w,i,j,m,x,y,z,k,h,mod = 1e9+7;
cin >> h >> w;
string a[h];
for(i=0;i<h;i++)
cin >> a[i];
ll dp[h][w];
memset(dp,0,sizeof(dp));
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define For(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
typedef vector<int> vint;
typedef vector<long long> vlint;
typedef vector<string> vstr;
typedef vector<char> vchar... | 0 | 95,584,712 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;... | #include <bits/stdc++.h>
using namespace std;
#define rng(i,a,b) for(int i = (a); i < (b); ++i)
#define rep(i,n) for(int i = 0; i < (n); ++i)
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
struct vec {
double x, y;
vec() : x(0), y(0) {}
... | 0 | 8,852,686 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(1){
cin >> n;
if(n == 0)
break;
vector<int> a(n);
for(int i = 0;i < n;++i)
cin >> a[i];
int min_g = 1000000;
for(int i = 0;i < n - 1;++i){
for(int j = i + 1;j < n;++j){
min_g = min(min_g,abs(a[i] - a[j]));
}
}
cout << min_g ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
int ans, h, w, m;
cin >> h >> w >> m;
int a, b;
vector<pair<int, int>>bomb(m);
vector<int>p1(h, 0),p2(w, 0);
rep(i, m) {
cin >> a >> b;
a--;
b--;
... | 0 | 87,812,013 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int,int> PII;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, p;
string s;
cin >> n >> p >> s;
ll ans=0;
if(p==2 || p==5) {
for(int i=0; i<n; ++i)
if((s[i]-'0')%p==0)
ans+=i+1;
} else {
map<int, int> mp;
++mp[0];
int ... | 0 | 50,589,427 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return t... | #include<bits/stdc++.h>
using ll = long long;
using namespace std;
const ll INF = 1000000000000000000;
const ll mod = 998244353;
char maze[101][101];
signed main() {
ll n, m, a = 1, b = 1; cin >> n >> m;
cout << 100 << ' ' << 100 << endl;
if (n < m) {
while (true) {
if (n == 1) { break; ... | 0 | 53,902,271 |
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define For(i,n) for(ll i=0; i<n; ++i)
#define all(v) (v).begin(), (v).end()
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vecto... | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <iterator>
#include <map>
#includ... | 0 | 25,258,358 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <queue>
#include <ctime>
#include <cassert>
#include <cstdio>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <random>
using namespace std;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int N;
int x[110000],y[110000];
vint G[110000];
int dfs(int from, int to)... | 0 | 77,502,792 |
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cmath>
using namespace std;
struct point
{
double x, y;
}pos[105];
bool cmp(point a, point b)
{
if (atan2(a.y, a.x) != atan2(b.y, b.x))
return atan2(a.y, a.x) < atan2(b.y, b.x);
else return a.x < b.x;
}
int main()
{
int n;
cin >> n;
for (int i = ... | #include<bits/stdc++.h>
#include<vector>
#include<cmath>
#include<string>
using namespace std;
#define vc vector<int>
#define vcvc vector<vector<int>>
#define vcl vector<long int>
#define vccl vector<long long int>
#define pb(a) ... | 0 | 5,149,327 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | #include <iostream>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e8
#define EPS 1... | 0 | 3,755,319 |
#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
int count,count2=0,ans[1000]={0};
char number[1000];
while(1){
scanf("%s",&number);
for(count=0;number[count]!='\0';count++){
ans[count2]+=(number[count]-'0');
}
if(ans[count2]==0){break;}
count2++;
}
for(count=0;count<count2;count+... | #include<iostream>
#include<vector>
int main(void){
int k;
std::string s;
std::cin >> k >> s;
int ss = s.size();
if(ss <= k) std::cout << s << std::endl;
else{
for(int i = 0; i < k; i++){
std::cout << s[i];
}
std::cout << "..." << std::endl;
}
return 0;
} | 0 | 10,637,969 |
#include <iostream>
#include <string>
int main(int argc, char** argv)
{
std::string str;
if (std::getline(std::cin, str))
{
for (int i = 0; i < str.size(); ++i)
{
if (str[i] >= 'a' && str[i] <= 'z')
{
str[i] += ('A' - 'a');
}
else if (str[i] >= 'A' && str[i] <= 'Z')
{
str[i] -= ('A' - 'a')... | #pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,ssse3,tune=native")
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vec... | 0 | 61,044,182 |
#include<bits/stdc++.h>
using namespace std;
int n,m,ans=0;
vector<vector<int>> g(8);
vector<int> c(8),d;
void dfs(int k,int cnt){
c.at(k)=1;
d.push_back(k);
if(cnt==n){
ans++;
}
else{
for(auto z:g.at(k)) if(c.at(z)==0) dfs(z,cnt+1);
}
c.at(k)=0;
d.erase(prev(d.end(),1));
}
int main(){
int x,y... | #include <bits/stdc++.h>
using namespace std;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s;
int n = s.length();
if(n == 2 && s[0] == s[1]){
cout << 1 << " " << 2 << '\n';
return 0;
}
for(int i = 0; i <= n - 3; i++){
st... | 0 | 94,458,650 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int a;
vector<int> cnt(1e5+3, 0);
for(int i=0; i<N; i++){
cin>>a;
cnt[a]++;
cnt[a+1]++;
cnt[a+2]++;
}
int ans=0;
for(int c : cnt){
ans=max(c, ans);
}
cout<<ans<<endl;
... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 49,041,513 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int64_t a[100'000];
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a, a + n, [](const auto &lh, const auto &rh) {
return lh > rh;
});
int64_t amax = a[0];
i... | #include <stdio.h>
#include <algorithm>
#include <vector>
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
using namespace std;
const int N=100010;
int n,x,y;
vector<int> vec[N];
int dfs(int ... | 0 | 45,240,615 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
long long luca[100];
luca[0] = 2;
luca[1] = 1;
for (int i = 2; i <= N; i++) {
luca[i] = luca[i - 1] + luca[i - 2];
}
printf("%lld\n", luca[N]);
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
#define per(i,n) for (int i=n-1; i>=0; --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vv = vector<vi>;
const int mod = 1000000007;
int main(){
ll n, k;
c... | 0 | 87,275,318 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
int timer, k;
string s;
ll dp[13][2][2][10];
int seen[13][2][2][10];
ll solve(int idx = 0, bool top = 0, bool put = 0, int last = 0) {
if (idx == (int)s.size()) return put;
if (seen[idx][top][put][last] == timer)
return dp[... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i,n) for(int i=0;i<n;i++)
#define Fr(i,n) for(int i=0;i++<n;)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
#define iFr(i,n) for... | 0 | 51,337,293 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 FORR(i, m, n) for(int i = m; i >= n; i--)
#define INF (ll)2e9
#define MOD ((ll)1e9+7)
#define ALL(v) v.b... | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>... | 0 | 25,078,372 |
#include <iostream>
using namespace std;
int main()
{
long long int n,k,x,y,rem,coast;
cin>>n>>k>>x>>y;
if(n>k)
{
rem = n-k;
coast = (k*x) + (rem*y);
}
else if(n==k)
coast = k * x;
else
coast = n * x;
cout<<coast<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
int main()
{
string s;
cin >> s;
int i, n = s.size(), ct = 0;
int mem[n + 1] = {0};
if (s[0] == 'R')
mem[0] = 1, ct = 1;
for (i = 1; i < n; i++)
{
if (s[i] == 'R')
mem[i]... | 0 | 62,484,042 |
#include <iostream>
#include <vector>
using namespace std;
class Node
{
public:
Node() {MyID = ParentID = -1; Depth = 0; }
int MyID;
int ParentID;
int Depth;
vector<int> ChildrenID;
void Print()
{
cout << "node " << MyID << ": "
<< "parent = " << ParentID << ", "
<< "depth = " << ... | #include <bits/stdc++.h>
using namespace std;
#define PI 4*atan(1)
#define INF 1e8
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int main(){
int N, A, B, C, X;
while(cin >> N >> A >> B >> C >> X, N||A||B||C||X){
vector<int> Y(N);
for(int i = 0; i < N; i++){
cin >> Y[i];
}
int x = X, index = ... | 0 | 70,746,700 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define sync ios_base::sync_with_stdio(false); cin.tie(NULL)
#define input(arr,n) for(ll i1=0;i1<n;i1++ )cin>>arr[i1]
#define mod 1000000007
#define F first
#define S second
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_po... | #include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | 0 | 72,760,172 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
#include <utility>
#include <climits>
#include <string>
typedef long long ll;
using namespace std;
void solve(){
string s, p;
cin >> s >> p;
for(int i = 0; i < s.length(); i++){
string str;
if(i < s... | #include<bits/stdc++.h>
using namespace std;
int H , W , d;
char color[4] = { 'R', 'Y', 'G', 'B' };
inline int read(){
int s = 0 , w = 1;
char ch = getchar();
while((ch < '0') || (ch > '9')){
if(ch == '-'){
w = -1;
}
ch = getchar();
}
while((ch >= '0') && (ch <= '9')){
s = s * 10 + ch - '0';
... | 0 | 58,072,148 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall... | #include<bits/stdc++.h>
using namespace std;
int main () {
int n; cin >> n;
int a[100000];
bool b[100000] = {false};
for (int i=0; i<n; i++) {
cin >> a[i];
}
int x=0;
int c=0;
while (a[x]!=2 && b[x]==false) {
b[x] = true;
x=a[x]-1;
c++;
}
if (b[x]==true) cout << -1; else cout << c+1;
return 0;
} | 0 | 96,635,471 |
#include<stdio.h>
typedef struct{
char mark;
int number;
}Card;
int main(){
int a,b,i,j,minj,num_card,stable1=1,stable2=1;
Card card1[36],card2[36],check[36],swap;
scanf("%d",&num_card);
for(i = 0;i < num_card; i++){
scanf(" %c%d",&card1[i].mark,&card1[i].number);
}
for(i = 0;i < num_card; i++){
... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long l... | 0 | 69,614,213 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vi = vecto... | #include <atcoder/all>
#include <bits/stdc++.h>
typedef long long int lld;
typedef unsigned long long int llu;
#define INF (lld)(9223372036854775807)
#define IINF (int)(2147483647)
using namespace std;
using namespace atcoder;
int main(void) {
lld n, q;
cin >> n >> q;
dsu d(n);
for (lld i = 0; i < q; i++) {
... | 0 | 93,363,763 |
#include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << '\n'
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define sz(x) ((int)... | #include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#include <vector>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
const int INF = 1e9;
using namespace std;
int main() {
int n;
i... | 0 | 23,717,894 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <stack>
#include <functional>
#include <sstream>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=j;i>(n);i--)
type... | #include<bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n ; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main(void){
... | 0 | 8,575,556 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
string S;
cin >> S;
for(int i = 0;i < S.size();i++) {
cout << S.at(i);
if(i == 3) cout << " ";
}
cout << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define YES cout<<"YES"<<"\n";
#define NO cout<<"NO"<<"\n";
#define ld long double
#define yes cout<<"yes"<<"\n";
#define no cout<<"no"<<"\n";
#define No cout<<"No"<<"\n";
#define Yes cout<<"Yes"<<"\n";
#define f(i,a) for(i=0;i<a;i++)
#define fo... | 0 | 71,396,164 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int h,w;
string s[60];... | #include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <math.h>
#include <algorithm>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll INF = 1000000000000000000LL;
using namespace std;
const int MOD = 1000000007;
int main(){
cin.tie(0);
i... | 0 | 5,012,173 |
#include<iostream>
using namespace std;
int main() {
int n, u, k, tmp;
cin >> n;
int M[n][n];
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
M[i][j] = 0;
}
}
for (int i=0; i<n; i++) {
cin >> u >> k;
for (int j=0; j<k; j++) {
cin >> tmp... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int B=0;
int C=0;
vector<int> A(N);
for(int i=0; i<N;i++)
{
cin >> A.at(i);
}
for(int k=0; k<N;k++)
{
if( A.at(k)>(B+1) )
{
A.at(k)=-1;
}
if(A.at(k)==B+1)
{
B++;
c... | 0 | 64,275,139 |
#include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include<set>
#include<queue>
#include <iomanip>
typedef long long ll;
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main()
{
int n,m;
cin>>n>>m;
string str[n];
for(int i=0;i<n;i++)
cin>>str[i];
int left[n][m]{};
int right[n][m]{};
int up[n][m]{};
int down[n][m]{};
for(int i=0;i<n;i++)
{
int coun... | 0 | 95,777,124 |
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
int n,m,l,cnt,mx,my;
char a[1009][1009];
int vis[1009][1009];
pair<int,int> p[10],st;
int mov[4][2] = {1,0,0,-1,-1,0,0,1};
struct status
{
int x,y;
int ord;
status(int a,int b,int c)
{
x ... | #include<bits/stdc++.h>
using namespace std;
int next(int a, int b, int c, int x){
return (a*x+b)%c;
}
int main(void){
while(true){
int n, a, b, c, x, ri[110];
cin >> n >> a >> b >> c >> x;
if((n+a+b+c+x)==0) break;
for(int i=0;i<n;++i){
cin >> ri[i];
}
... | 0 | 91,566,398 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5+100;
typedef long long ll;
typedef pair<ll,int> pli;
#define fr(i,a,b) for(int i = a;i <= b; ++i)
#define nfr(i,a,b) for(int i = a;i >= b; --i)
#define pb push_back
int n;
pli v[N];
ll d[N];
int fa[N];
int siz[N];
map<ll,int> vis;
vector<int> edge[N];
ll va... | 0 | 27,764,901 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
int a,b,c;
cin >> a>> b >>... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0,... | 0 | 60,664,842 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int i;
for(i=1;i*(i+1)/2<N;i++){}
if(i*(i+1)/2==N)for(int j=1;j<=i;j++)cout<<j<<endl;
else{
int k=i*(i+1)/2-N;
for(int j=1;j<=i;j++){
if(j!=k)cout<<j<<endl;
}
}
} | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
llong eval(char *s){
llo... | 0 | 24,963,850 |
#include <bits/stdc++.h>
#include <cassert>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int, int>;
using vvi = v... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vec... | 0 | 98,988,884 |
#include<bits/stdc++.h>
using namespace std;
int N;
vector<int> A, B;
int main(){
cin >> N;
A.resize(N);
B.resize(N-1);
for(int i = 0; i < N-1; ++i) cin >> B[i];
for(int i = 0; i < N; ++i){
if(i == 0) A[i] = B[i];
else if(i == N-1) A[i] = B[i-1];
else{
A[i] = min(... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void eating_symbols_easy()
{
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < 4; ++i)
{
if (s[i] == '+') ++cnt;
else --cnt;
}
cout << cnt << "\n";
}
void multiple_of_2_and_n()
{
int n;
cin >> n;
if (n % 2 == ... | 0 | 58,268,019 |
#include<bits/stdc++.h>
using namespace std;
#define ll int64_t
#define rep(i,n) for(int64_t i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr int64_t INF=(1ll<<60);
constexpr int64_t mod=1000000007;
constexpr double pi=3.14159265358979323846;
template<type... | #include<iostream>
using namespace std;
const int BUF = 6;
int row, col, nRemain;
string b[BUF];
void read() {
cin >> row >> col >> nRemain;
for (int i = 0; i < row; ++i) {
cin >> b[i];
}
}
void work() {
int ans = 0;
for (int rMask = 0; rMask < (1 << row); ++rMask) {
for (int cMask =... | 0 | 56,256,902 |
#include<bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector <long long> table(1e5+10,0);
for (long long i=0; i<N; i++) {
long long a;
cin >> a;
a+=1;
table.at(a-1)++;
table.at(a)++;
table.at(a+1)++;
}
sort(table.begin(),... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
int m,n;
cin >> m >> n;
vector<vector<string>>word(m,vector<string>(n));
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
cin >> word[i][j];
}
}
int a;
char b;
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(wor... | 0 | 7,779,832 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<map>
#include<queue>
#include<vector>
using namespace std;
int main() {
vector<int> a(5);
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
s... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 50,532,919 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
#include <string.h>
#include <numeric>
using namespace std;
#define int long long
#define reps(i,s,n) for(int (i)=(s);(i)<(... | #include <bits/stdc++.h>
using namespace std;
struct DSU {
int n;
vector<int> p, sz;
DSU(int n) : n(n) {
p.resize(n);
sz.resize(n);
for (int i = 0; i < n; i++) {
p[i] = i;
sz[i] = 1;
}
}
int find_set(int x) {
if (x == p[x]) return x;
... | 0 | 94,238,764 |
#include <iostream>
#include <algorithm>
using namespace std;
void solve() {
char c;
int i = 1;
while ((c = getchar()) != '\n') {
if (i&1)
cout << c;
i ^=1;
}
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | 0 | 79,682,156 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c,d,r,f;
cin>>a>>b;
c=b*(pow(b-1,a-1));
cout<<c<<endl;
return 0;
} | #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
const i... | 0 | 21,675,441 |
#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
#define LINF 1e18
typedef long long ll;
const int MOD = 1e9+7;
int main() ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, A, B, t = 1;
cin >> N >> A >> B;
while (A > 0 && B <= N)
{
if (t % 2)
{
if (A + 1 == B)
A--;
else
A++;
}
else
{
if (B - 1 == A)
B++;
else
B--;
}
t++;
}
co... | 0 | 858,398 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll b[51][2];
ll a[51][2];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> a[i][0] >> a[i][1];
}
for (int i = 0; i < m; ++i) {
cin >> b[i][0] >> b[i][1];
}
for (int i = 0; i < n; ++i) {
int index = 0;
ll val ... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
UnionFind(size_t size) : v(size, -1) {}
vector<int> v;
int root(int x) {
return (v[x] < 0 ? x : v[x] = root(v[x]));
}
bool same(int x, int y) {
return root(x) == root(y);
}
void unite(int x, int y) {
x = root(x);
y = root(y);... | 0 | 93,795,035 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("-ffloat-store")
#define int long long
#define rep(i,begin,end) for(__typeof(end)i=(begin)-((begin)>(end));i!=(end)-((begin)>(end));i+=1-2*((begin)>(end)))
#defi... | #include<bits/stdc++.h>
using namespace std;
int main(void){
char a,b;
while(1){
scanf("%c",&a);
if(islower(a)){
b=toupper(a);
cout<<b;
}else{
b=tolower(a);
cout<<b;
}
if(a =='\n') break;
}
} | 0 | 66,609,071 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << (x) << '\n'
#define debugArray(x, n) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 0 | 83,545,655 |
#include<bits/stdc++.h>
using namespace std ;
# define pb push_back
# define ll long long
# define mp make_pair
# define endl "\n"
# define vi vector<int>
# define vc vector<char>
# define vll vector<ll>
# define pi pair<int,int>
const int MOD = 1e9 + 7 ;
const ll inf = 1e18 ;
void solve() {
int n ;
cin >> n ;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define PI acos(-1.0)
#defin... | 0 | 34,499,687 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
using namespace std;
typedef long long ll;
typedef l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#def... | 0 | 18,036,829 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | 0 | 47,834,250 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define print(i) cout << i << endl
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
int main(void)
{
int a;
int da[3];
cin >> a;
FOR(i, 0, a){
cin >> da[0] >> da[1] >> da[2];
... | #include <algorithm>
#include <bitset>
#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_s... | 0 | 30,617,126 |
#include <bits/stdc++.h>
#define ll long long
int v[10];
int ans = 1490390;
int n,A,B,C;
void dfs(int a,int b,int c,int i,int unite){
if(v[i] == -1){
if(a == 0 || b == 0 || c == 0)return;
std::vector<int>tmp(3);
tmp[0] = a,tmp[1] = b,tmp[2] = c;
sort(tmp.rbegin(),tmp.rend());
a = tmp[0],b = tmp[1]... | #include<bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#define Scll3(x,y,z) scanf("%llu%llu%llu",... | 0 | 56,217,633 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<sstream>
#include<string>
#include<math.h>
using namespace std;
struct card
{
int num;
char val;
};
int main()
{
int n;
card bb[50], se[50];
cin >> n;
for (int i = 0; i < n; i++)
{
char sss;
int q;
cin >> sss >... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 80,043,195 |
#include<bits/stdc++.h>
#define f(i,a,b) for(register int i=a;i<=b;++i)
#define ff(i,a,b) for(register int i=a;i>=b;--i)
#define debug(x) cerr << #x << " : " << x << " " << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<st... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 0 | 32,374,253 |
#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++)
#define _GLIBCXX_DEBUG
string s, ans;
int calc(string t){
int ans = t[0] - '0';
int i = 1;
while(i < 7){
char op = t[i], n = t[i+1];
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string O, E;
cin >> O >> E;
if (O.size() == E.size()) {
for (int i = 0; i < O.size(); ++i) {
... | 0 | 91,063,699 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | #include <iostream>
#include <utility>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
typedef pair<int, int> pii;
const int N_SIZE = 100;
int dp[N_SIZE + 1][N_SIZE + 1];
void solve(int n, pii rc[])
{
REP(i, n)
dp[i][i] = rc[i].first * rc[i].second;
REP(i, n - 1)
dp[i][i + 1] = dp[i][i] ... | 0 | 41,260,690 |
#include <iostream>
#include <string>
using namespace std;
int main(void)
{
int x, y; cin >> x >> y;
string ans;
int diff = y - 2 * x;
if (diff >= 0 && diff % 2 == 0 && diff / 2 <= x) ans = "Yes";
else ans = "No";
cout << ans << endl;
} | #include<stdio.h>
#include<iostream>
#include<list>
#include<map>
#include<math.h>
#include<vector>
#include<algorithm>
#include<string.h>
#include<iomanip>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
... | 0 | 16,246,109 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | #include <bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
template <typename T> using vvec = vector<vector<T>>;
constexpr int64_t mpow(int64_t a, int64_t b, int64_t mod = 1000000007) {
if (b <= 0) { return 1; } if (b == 1) { return a % mod; } if (b == 2) { return (a * a) % mod; }
... | 0 | 16,836,213 |
#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 n;
cin >> n;
vector<P> RED;
rep(i, n) {
int a, b;
cin >> a >> b;
RED.push_back({-b, a});
}
sort(RED.begin(),... | #include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") { cout << ... | 0 | 22,702,562 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
string a,b;
cin >> a >> b;
if(a > b)cout << ">" << endl;
else if(a < b)cout <<... | #include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
#include <fstream>
#include <iterat... | 0 | 73,195,661 |
#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<algorithm>
#define rep(i,a) for(int i=0;i<(a);++i)
int n, k;
int a[100001], sum[100001];
int main(){
while (scanf("%d%d", &n, &k), n|k){
rep(i, 100001)sum[i] = 0;
scanf("%d", &a[0]);
for (int i = 1; i < n; ++i){
scanf("%d", &a[i]);
sum[i] = sum[i - ... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b)... | 0 | 86,245,491 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++) {
cin >> A[i];
}
int max = 0;
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
if(i == j) continue;
if... | #include<bits/stdc++.h>
#include<bits/extc++.h>
#define file(s) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define go(x, i) for(register int i = head[x]; i; i = nxt[i])
#define For(i, a, b) for(register int i = (a), i##_end_ = (b); i <= i##_end_; ++ i)
#define FOR(i, a, b) for(register int i = (a), i##_... | 0 | 8,953,396 |
#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 N; cin >> N;
vector<ll> A(N);
vector<ll> sum(N+1,... | #include <set>
#include<algorithm>
#include<iostream>
#include<functional>
#define ll long long
using namespace std;
typedef pair<int, int> pii;
const int maxn = 1e5;
pii val[maxn + 11];
int pos[maxn + 11];
int main() {
ios::sync_with_stdio(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> val[i].first;
... | 0 | 5,473,477 |
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i,n,init) for(ll i=init;i<(n);i++)
int main()
{
string s;
cin >> s;
int n = s.size();
stack<char> q;
q.push(s[0]);
repi(... | #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
int main() {
string s, t; cin >> s >> t;
vector<vector<int>>dp(s.size() + 1, vector<int>(t.size() + ... | 0 | 68,372,503 |
#include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 33,614,695 |
#include <iostream>
#include <map>
#include <stack>
#include <string>
using namespace std;
int main(){
string line;
map<char, char> bracket;
bracket[')'] = '(';
bracket[']'] = '[';
while(getline(cin, line)){
if(line == ".") break;
bool ans = true;
stack<char> s;
for(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 89,191,931 |
#include <iostream>
#include <algorithm>
using namespace std;
int func(int num, int rest, int before){
if(num == 0){
if(rest == 0){
return 1;
}
return 0;
}
int res = 0;
for(int i = 0; i <= rest && i <= before; ++i){
res += func(num - 1, rest - i, i - 1);
}
return res;
}
int main(){
cin.tie(0);
ios::s... | #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
typedef long long ll;
const i... | 0 | 36,977,629 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
for (int i = A; i <= B; i++) {
string s = to_string(i);
int n = s.size();
for (int j = 0; j < (n + 1) / 2; j++) {
if (s[j] != s[n - 1 - j]) break;
if (j == (n ... | #include<algorithm>
#include<bitset>
#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_set>
#include<util... | 0 | 13,436,535 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define p... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll,ll> lll;
const ll MOD = 1000000007;
const ll INF = 1e9+5;
const double eps = 1e-7;
cons... | 0 | 22,389,602 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <iomanip>
typedef long long ll;
const ll MOD = (ll)1e9 + 7LL;
using namespace std;
ll T[100002], A[100002];
int main () {
ll N;
cin >> N;
for(int i = 1; i <= N; i++)
{
cin >> T[i];
}
for(int i = 1; i <= N; i++... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
vector<ll> dp(n,0);
dp[0] = 1000;
for(i = 1;i < n;++i){
dp[i] = ... | 0 | 7,206,416 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.