code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int result = max(a * c, max(a * d, max(b * c, b * d)));
cout << result;
}
signed main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);... | #include<iostream>
using namespace std;
int main() {
int a,b,c,min,mid,max;
cin >> a >> b >> c;
max = a;
if(max < b) {
max = b;
}
if(max < c) {
max = c;
}
min = a;
if(min > b) {
min = b;
}
if(min > c) {
min = c;
}
mid = a;
if((min == a || min =... | 0 | 72,415,126 |
#define LOCAL
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 1000000007LL
#define LLINF 100000000000000005LL
#define INF (int)1e9+1
#define pb push_back
template <type... | #include<iostream>
#include<algorithm>
#include<math.h>
#include<string>
#include<tuple>
#include<vector>
#include<cstdlib>
#include<cstdint>
#include<stdio.h>
#include<cmath>
#include<limits>
#include<iomanip>
#include<ctime>
#include<climits>
#include<random>
#include<queue>
#include<map>
using namespace std;
templa... | 0 | 11,644,147 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define f first
#define s second
#define mp make_pair
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
n *= 2;
int a[n];
for(int i =0;i <n ;i++)
{
cin>>a[i];
}
sort(a,a+n);
ll ans =0;
for(in... | #include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#include <math.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define FOR(... | 0 | 20,601,253 |
#include <cstdio>
int main(void) {
int score[2] = { 0 };
for(int i = 0; i < 2; i++) {
for(int j = 0; j < 4; j++) {
int buf;
scanf("%d", &buf);
score[i] += buf;
}
}
printf("%d\n", score[0] > score[1] ? score[0] : score[1]);
return 0;
} | #include <assert.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include ... | 0 | 29,368,888 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int n,p;
cin>>n>>p;
cout<<(n+1)-p<<endl;
} | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 92,389,922 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll,ll>;
int64_t INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll ... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
string a = "AtCoder Beginner Contest ";
string b = "AtCoder Regular Contest";
int s1 = a.size();
int s2 = b.size();
a[0] = toupper(a[0]);
b[0] = toupper(b[0]);
int x;
cin >> x;
if(x<1200)
{
for(int... | 0 | 16,897,934 |
# include <bits/stdc++.h>
# define sz(x) (int)((x).size())
# define F first
# define S second
# define pb push_back
# define ub upper_bound
# define lb lower_bound
# define all(x) x.begin(), x.end()
# define pqueue priority_queue
# define mset multiset
# define umap unordered_map
# define Speed() ios_base::sync_with_st... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | 0 | 85,108,597 |
#include <bits/stdc++.h>
using namespace std;
#define EACH(i,a) for (auto&& i : a)
#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RFOR(i,a,b) for(int i=(int)b-1;i>=(int)a;--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define debug(x) cerr << #x << ":" << ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | 0 | 24,122,945 |
#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<string>
#define mx_ari(a) *max_element(a , a+sizeof(a)/4)
#define mn_ari(a) *min_element(a , a+sizeof(a)/4)
#define mx_arl(a) *max_element(a , a+sizeof(a)/8)
#define mn_arl(a) *min_element(a , a+sizeof(a)/8)
#define mx_vec(v) *max_element(v.... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typed... | 0 | 91,341,739 |
#include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
stri... | #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 | 43,443,546 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define N 1000000007
#define N2 998244353
#define Nmax 100001
#define INF (ll)1e18
#define pll pair<ll,ll>
#define pii pair<ll,ll>
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,... | 0 | 70,705,275 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
bool flag = true;
int c = 0;
for (int i = 0; i < int(s.size()); ++i) {
flag = true;
c = 0;
for (int j = 0;; ++j) {
if (s[i + j] != t[j]) {
fla... | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> p(n), idx(n);
rep(i, n) {
cin >> p[i];
p[i]--;
idx[p[i]] = i;
}
set<int> st;
ll ans = ... | 0 | 41,405,588 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s;cin>>s;
while(1){
s.pop_back();
int n=s.size();
if(s.substr(0,n/2)==s.substr(n/2)){
cout<<n<<endl;
return 0;
}
}
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,N-1,0)
#define RREPS(i,n) RFOR(i,N,1)
#define int long long
#define mp make_pair
#define ... | 0 | 89,241,060 |
#include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define e "\n"
#define MaRiaMa { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
#define fix(n) cout << fixed << setprecision(n);
using namespace std;
int main()
{
MaRiaMa;
int a, b, c;
cin >> a >> b >> c;
multiset<int> p;
p.insert(a); p.inse... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long ... | 0 | 75,315,042 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A = 0, B = 0;
char c;
cin >> A >> c >> B;
if(c == '+'){
cout << A + B << endl;
}
if(c == '-'){
cout << A - B << endl;
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,a,n) for(ll i=a;i<(ll)(n);i++)
int main(){
int s;
cin>>s;
vector<bool> check(1000000, false);
int a = s;
check[a-1] = true;
for(int i=2;;i++... | 0 | 62,094,423 |
#include<bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
ll h, w;
cin >> h >> w;
if(h==1 || w==1){
cout << 1 << endl;
return 0;
}
ll masu = h*w;
ll res = masu / 2;
cout << masu ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long K, std::vector<long long> a) {
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
ll sum = 0;
ll res = N;
for (int i = 0; i < N; i++) {
if (sum + a[i] < K) {
sum += a[i];
} else {... | 0 | 323,489 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
map<char,int>mp;
vector<int>A(0);
for(int X=0;X<S.size();X++){
mp[S[X]]++;
}
for(auto p:mp){
auto V=p.second;
A.push_back(V);
}
if(A.size()==2&&A[0]==2&&A[1]==2){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ch... | 0 | 95,124,066 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <deque>
#include <iomanip>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vec... | #include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#defi... | 0 | 98,805,061 |
#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <cassert>
#include <fstream>
#include <iomanip>
#include <stack>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 ... | #include <iostream>
int main() {
int N, A;
std::cin >> N >> A;
if (N % 500 > A) {
std::cout << "No" << std::endl;
}
else if (N % 500 <= A) {
std::cout << "Yes" << std::endl;
}
} | 0 | 6,520,163 |
#include <iostream>
using namespace std;
#define INPUT_MIN 0
#define INPUT_MAX 100
int main()
{
int a = 0, b = 0, c = 0;
cin >> a;
cin >> b;
cin >> c;
if( (INPUT_MIN > a) || (INPUT_MAX < a) )
{
return 1;
}
if( (INPUT_MIN > b) || (INPUT_MAX < b) )
{
return 1;
}
if( (INPUT_MIN > c) || (INPUT_MAX < c) )
{
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <stack>
#include <map>
#include <iomanip>
using namespace std;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
return a ;
}
}
const int MAX = 5... | 0 | 83,535,375 |
#include <iostream>
using namespace std;
int main() {
int a , b , x;
cin >> a >> b >> x;
if ( a > x ) cout << "NO";
else if ( a == x ) cout << "YES";
else if ( a < x && a + b >= x ) cout << "YES";
else if ( a < x && a + b < x ) cout << "NO";
return 0;
} | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 7,341,852 |
#include <bits/stdc++.h>
typedef long long ll;
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++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,ll>
con... | #include<iostream>
using namespace std;
int h,w,d;
char a[4]={'R','Y','G','B'};
int main()
{
cin>>h>>w>>d;
for(int i=1;i<=h;++i,cout<<endl)
for(int j=1;j<=w;++j)
{
int x=i+j+w,y=i-j+w;
cout<<a[((x/d)&1)*2+((y/d)&1)];
}
return 0;
} | 0 | 66,423,707 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
int s=S.size();
map<char,int> ma;
for(int i=0;i<s;i++){
ma[S[i]]++;
}
for(char c='a';c<='z';c++){
if(ma[c]==0){
cout<<c<<endl;
return 0;
}
}
cout <<"None"<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
ll n,y;
cin>>n>>y;
vector<ll> a(3,-1);
for(ll i=0;i<=n;i++){
for(ll j=0;j<=n&&j+i<=n;j++){
ll k=n-(i+j);
if(i*10000LL+j*5000LL+k*1000LL==y){
... | 0 | 85,645,506 |
#include <bits/stdc++.h>
using namespace std;
bool Check(string input){
if(input.size()%2 == 1){
return false;
}
else{
int len = input.size() / 2;
for(int i=0;i<len;i++){
if(input[i] != input[i+len]) return false;
}
return true;
}
}
int main(void){
st... | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std; using ll=long long; using P=pair<ll,ll>; const int INF=1e9; const ll LNF=1e18;
int main(){
string s; cin>>s; s+='T';
int x,y; cin>>x>>y;
vector<int> v[2];
int tt=0, nw=0; bool fs=true;
for(char ch : s) {
if (ch ... | 0 | 49,963,272 |
#include <bits/stdc++.h>
typedef long long ll;
const int kN = 1e5 + 5;
int a[kN]; ll ans = 0;
int main() {
int n, lst = 0; scanf("%d", &n);
for(int i = 1; i <= n; ++i) {
int x; scanf("%d", &x);
if(lst && x) lst = 0, --x, ++ans;
lst = x % 2; ans += x / 2;
}
printf("%lld", ans);
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <iomanip>
#include <math.h>
#include <fstream>
using namespace std;
class pqComp
{
public:
bool operator()(pair<int, int> &a, pair<int, int> &b)
{
return a.second < b.secon... | 0 | 2,965,274 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0)
#define endl "\n";
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define int long long
const int MOD=1e9+7;
const int N=3e5+10;
int32_t main()
{
IOS;
int n;
cin>>n;
cou... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) d... | 0 | 68,359,929 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
long long k, a, b;... | #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 namespace std;
int main() {
fastIO;
int n, m, x, y;
cin >> n >> m >> x >> y;
vector<int> X(n);
vector<int> ... | 0 | 6,969,913 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
char x;
cin >> x;
cout << (char) (++x);
return 0;
} | #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 | 98,086,878 |
#include<iostream>
using namespace std;
#define MAX 256
int miku(int x){
if(x > 36)return 0;
if(x < 10)return (x + 3)*(x + 2)*(x + 1) / 6;
if(x > 18)return miku(36 - x);
if(x > 9 && x < 19)return (x + 3)*(x + 2)*(x + 1) / 6 - (miku(x - 10) * 4);
}
int main(void){
int n,i = 0;
int ans[MAX];
while(cin >> n){
ans... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n,d;
cin >> n >> d;
vector<vector<int>> x(n,vector<int>(d));
rep(i,n){
rep(j,d){
cin >> x[i][j];
}
}
int ans = 0;
for(int i=0; i<n; i++){
... | 0 | 55,914,864 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 | 60,141,637 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI 3.1415926535897932384626433832795028841971693993
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9+7;
int main(){
int n,k,r,s,p,ans=0;
string t;
cin>>n>>k>>r>>s>>p>>t;
vector<bool> dat(n,true);
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
const std::string yes = "Yes";
const std::string no = "No";
int main(){
int n,m;
std::cin >> n;
std::set<std::string> st;
std... | 0 | 18,768,995 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
double n;
cin>>n;
printf("%lf",(n/3)*(n/3)*(n/3));
return 0;} | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <deque>
#include <queue>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(s... | 0 | 44,526,631 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int n,t;
cin>>n>>t;
vector<int>time(n);
for(int i=0;i<n;i++){
cin>>time[i];
}
int dif;
long long sum=t;
for(int i=1;i<n;i++){
dif=time[i]-time[i-1];
if(dif<=t)sum+=dif;
else sum+=t;
}
cout<<sum<<endl;
return... | #include<bits/stdc++.h>
using namespace std;
const int INF=1e9;
int main() {
int n,m,r;
cin >> n >> m >> r;
vector<vector<int>> G(n+1, vector<int>(n+1,INF));
vector<int> R(r);
for ( int i=0; i<r; i++ ) {
cin >> R[i];
}
for ( int i=0; i<=n; i++ ) G[i][i]=0;
for ( int i=0; i<m; i++... | 0 | 91,036,711 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef pair<int,int> P;
const int INF = 1e9+7;
int main(){
int N,K;
cin >> N >> K;
if(N%K){
cout << "1";
}else{
cout << "0";
}
} | #include <bits/stdc++.h>
#define chmin(a, b) ((a)=min((a), (b)))
#define chmax(a, b) ((a)=max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
const ll MOD=1e9+7;
const ll INF=1e18;
int dx[]={1, -1,... | 0 | 2,671,876 |
#include <iostream>
#include <string>
#include <cctype>
#include <vector>
using namespace std;
int transform(string str){
int num=0;
for(int j=0;j<str.length();j++){
if(isdigit((int)str[j])){
if(str[j+1]=='m') num += (str[j]-48)*1000;
else if(str[j+1]=='c') num += (str[j]-48)*100;
else if(str[j+1]=='x') nu... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <cmath>
#include <ctime>
#include <cassert>
#include <cstdio>
#include <queue>
#include <set>
#include <map>
#include <fstream>
#include <cstdlib>
#include <string>
#include <cstring>
#include <algorithm>
#include <numeric>
using namespace std;
#de... | 0 | 76,220,790 |
#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... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#include <random>
#define REP(i,m,n) for(int i=int... | 0 | 2,054,913 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
using namespace std;
#define INF (1 << 30) - 1
#define LINF 1LL << 60
const int MOD = 1000000007;
using ll = long long;
using P = pair<int, int>;
int dp[1010][1010];
int main(){
string ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | 0 | 77,908,413 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll 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 MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
vector<ll> enumerate_divisors(ll n) {
vector<ll> divisor_1, divisor_2;
ll e, root_n = (ll)(sqrt(n) + 0.5);
for (int d = 1; d <= root_n; d++) {
if (n % d == 0) {
divisor_1.pu... | 0 | 24,622,535 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
int n,m,x,y,ind[maxn];
signed main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)cin>>x>>y,ind[x]++,ind[y]++;
for(int i=1;i<=n;i++)
if(ind[i]&1)puts("NO"),exit(0);
puts("YES");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
static const int INF (1<<30);
int main() {
int N, K;
cin >> N >> K;
if (K > (N-1)*(N-2)/2) {
cout << -1 << endl;
return 0;
}
vector<vector<int>> ans(N);
for (int i ... | 0 | 46,765,739 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;... | #include<bits/stdc++.h>
#define l long
#define ll long long
#define ld long double
#define INF 1000000000000
#define MOD 1000000007
#define MAX_N 1000006
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
l n,k;
cin>>n>>k;
vector<l> a;
l x;
... | 0 | 72,063,861 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | #include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
using namespace std;
struct node{
int key;
node *next;
node *prev;
};
node *a;
void insert(int key){
node *x = (node *)malloc(sizeof(node));
x->key = key;
x->next = a->next;
a->next->prev = x;
a->next = x;
x->prev = a;
}
node *Sea... | 0 | 9,225,868 |
#include<bits/stdc++.h>
#define MAXN ((int)(1e5+10))
#define INF ((int)(1e9))
using namespace std;
typedef long long LL;
int n,k;
LL a[MAXN],sum=0,ans=-INF,tmp=0;
int main()
{
cin>>n>>k;
for(int i=0;i<n;i++)
{
cin>>a[i];
tmp+=a[i];
if(a[i]>0)
sum+=a[i];
}
LL integer=0,fu=0;
for(int i=0;i<k;i++)
{
if(a... | #include<bits/stdc++.h>
using namespace std;
int jumps(int N, int a[],int k) {
int x,y;
int dp[N+1] = {0};
for(int i=2; i<=N; i++) {
x = y = INT_MAX;
for(int j=1; j<=k; j++) {
if(i-j>=1) x = dp[i-j] + abs(a[i] - a[i-j]);
y = min(x,y);
}
dp[i] = y;
... | 0 | 21,080,548 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int sex[100000];
bool check(int l, int r) {
int len = r - l + 1;
if (len % 2) {
return sex[l] != sex[r];
} else {
return sex[l] == sex[r];
}
}
int main() {
int N;
cin >> N;
string ans;
cout << 0 << endl;
cin >> ans;... | 0 | 69,956,258 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_back
#define... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
using ll = int64_t;
using namespace std;
ll n,m;
ll a[100010];
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
REP(... | 0 | 25,700,723 |
#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() {
string s;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3, y3, x4, y4;
int difx, dify;
difx = abs(x1-x2);
dify = abs(y1-y2);
if (x1 > x2){
if (y1 > y2){
x3 = x2 + dify;
y3 = y2 - difx;
x4 = x1... | 0 | 10,179,168 |
#include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("../data.txt");
int k, s, x, y, z, ways;
int main() {
cin >> k >> s;
for (x = 0; x <= k; x++) {
for (y = 0; y <= k; y++) {
if (s - x - y >= 0 && s - x - y <= k) ways++;
}... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utili... | 0 | 70,820,154 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int a[3][3];
rep(i,3) rep(j,3) cin >> a[i][j];
int n;
cin >> n;
rep(i,n){
int b;
cin >> b;
rep(j,3) rep(k,3) if(a[j][k] == b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1e9+7;
const ll INF=1e9;
const ll IINF=1e18;
const double EPS=1e-8;
const double pi=acos(-1);
template<class... | 0 | 95,280,806 |
#include<iostream>
#include<string>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
long int mod = 1000000007;
string l;
cin >> l;
long int dp[l.size()][2];
dp[0][0] = 1;
dp[0][1] = 2;
for(int i = 1; i < l.size(); i++){
if (l[i] == '0') {
dp[... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ... | 0 | 44,580,080 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | #include <bits/stdc++.h>
using namespace std;
void chmin (int& a, int b) {
if (a > b) a = b;
}
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 0; i < S.size()-2; i++) {
if (S[i] > '7') {
chmin(ans, (S[i]-'7') * 100 + (S[i+1]-'5') * 10 + S[i+2]-'3');
} else if (S[i] < '7') {
ch... | 0 | 57,484,450 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
string s; cin >> s;
if(s.size()%2!=0){
cout << "No";
return 0;
}
string t=s.substr(0,n/2);
if(t==s.substr(n/2,n/2)) cout << "Yes";
else cout << "No";
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 7,917,527 |
#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
while(1){
string str;
getline(cin,str);
if(str==".") break;
int i=0;
int sum = 0;
vector<int> inkakko;
while(1){
if(str[i]=='('){
in... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define M_PI 3.14159265358979
#define de... | 0 | 65,590,391 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast ... | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
const long long INF = 1e6+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);
using namespace std;
int main(){
string s;
cin >> s;
long long k;
cin >> k... | 0 | 54,383,209 |
#include <bits/stdc++.h>
using namespace std;
int solve(const vector<vector<int>> &v_positions,
const vector<vector<int>> &h_positions, const pair<int, int> &pos) {
int pos_x = pos.first, pos_y = pos.second, ans = 0;
const vector<int> &v_pos = v_positions[pos_x], &h_pos = h_positions[pos_y];
ans +=
... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL... | 0 | 86,790,843 |
#include<bits/stdc++.h>
using namespace std;
#define M_PI 3.1415926535
#define ll long long
#define ld long double
#define Summon_Tourist ios::sync_with_stdio(false);cin.tie(0);
ll gcd(ll a , ll b) { return b==0?a: gcd( b, a%b); }
ll lcm(ll a , ll b) { return a/gcd(a,b) * b ; }
ll inf = 1e9 + 7;
ll modexp( ll base ,ll... | #include <iostream>
#include <string>
#include <sstream>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <map>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
int N;
int data[251];
cin>>N;
for(in... | 0 | 95,265,918 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
int ans = 0;
cin >> n >> m;
rep(i, n) {
ans += i;
}
rep(i, m) {
ans += i;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdi... | 0 | 70,698,839 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
void dijkstra(vector<vector<pair<long long,long long>>> &g, vector<long long> &dist, long long st){
long long INF=1e17;
long long n=g.size();
dist.assign(n,INF);
priority_queue<pair<long long,long long>,vector<pa... | #include<vector>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<bits/stdc++.h>
#include<cstring>
#include<map>
#include<cmath>
#include<set>
using namespace std;
#define ll long long int... | 0 | 97,396,646 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utili... | 0 | 38,780,369 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
string n;
cin >> n;
while(1) {
if(n[0... | #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()... | 0 | 82,238,294 |
#include<bits/stdc++.h>
#define fr(i,n) for (int i = 1; i <= n; i++)
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
#define ii pair<ll,ll>
#define vi vector<int>
#define vii vector<ii>
#define ll long long int
#define INF 1000000000
#define endl '\n'
using namespace std;
vector<int>v[200... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)... | 0 | 65,235,846 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<map>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
int main(){
int N, M, K; cin >> N >> M >> K;
for(int i=0; i<N+1; i++){
for(int j=0; j<M+1; ... | #include <iostream>
#include <stdlib.h>
using namespace std;
struct Node {
int parent;
int number;
struct Node *left;
struct Node *right;
};
struct Node * N[100000];
int getDepth(struct Node *node){
int count = 0;
while (node->parent != -1) {
count++;
node = N[node->parent];
... | 0 | 30,135,260 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
string s;
cin >> n >> s;
if(s.size() % 2 == 1) {
cout << "No" << endl;
return 0;
}
int x = s.size() / 2;
rep(i, x) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 32,992,162 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main() {
int s;
cin>>s;
map<int,bool>mp;
int cnt=0;
while(0==0){
if(mp[s]==true){
break;
}
mp[s]=true;
if(s%2==0){
s/=2;
}
else{
s=(3*s)+1;
}
cnt++;
... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;
int main() {
int a,b,c;cin>>a>>b>>c;
int mx=max({a,b,c});
mx*=3... | 0 | 48,111,557 |
#include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x)... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define MAX 1e18
#define MIN -1e18
#define MOD 1000000007
#define base 139
#define base2 31
#define memz(a) memset(a, 0, sizeof(a))
#define memn(a) memset(a, -1, sizeof(a))
#define in1(a) scanf("%lld", &a)
#define in2(a, b) scanf("%lld%lld", &a, &b)
#def... | 0 | 64,004,734 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k,sum=0;
cin>>a>>b>>c>>k;
while(k--)
{
if(a>0)
{
sum=sum+1;
a--;
}
else if(b>0)
{
sum=sum+0;
b--;
}
else if(c>0)
{
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend();
#define isS... | 0 | 84,532,962 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const ... | #include <set>
#include <string>
#include <iostream>
int main()
{
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::set<std::string> dic;
int n;
std::cin >> n;
for(int i = 0; i < n; ++i){
std::string command, str;
std::cin >> command >> str;
if(command[0] == 'i'){
... | 0 | 38,124,803 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int m;
string s;
int h;
while(1){
cin >> s;
if(s == "-") break;
cin >> m;
for(int i = 0; i < m; i++){
cin >> h;
for(int k = 0; k < h; k++){
s += s[0];
s.erase(0,1);
}
}
cout << s << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
string s[55];
int t[55];
int result = 0;
for(int i = 0; i < n; i++){
cin >> s[i] >> t[i];
}
string x;
cin >> x;
for(int i = n - 1; i >= 0; i--){
if(s[i] == x)
break;
result... | 0 | 61,955,556 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,a=0,b=0,counter=0;
cin>>n;
vector<int>p(n),q(n),s(n);
for(int i = 0; i < n; i++) cin >> p[i];
for(int i = 0; i < n; i++) cin >> q[i];
iota(s.begin... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using pll = pair<ll,ll> ;
#define all(v) v.begin(),v.end()
int main(){
ll n ; cin >> n ;
vll a(n),b(n) ;
vector<pll> p(n) ;
for(int i=0;i<n;i++){
cin >> a.at(i) >> b.... | 0 | 90,728,242 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int n, m; cin >> n >> m;
vector<int> s(n), t(m);
REP(i, 0, n) cin >> s[i];
REP(i, 0, m) cin >> t[i];
ll dp... | #include <iostream>
#include <cmath>
using ll = long long;
using namespace std;
int n;
struct point {double x, y;};
void koch(int d, point p1, point p2){
if (d == 0) return;
point s{0,0}, t{0,0}, u{0,0};
double th = M_PI * 60.0 / 180.0;
s.x = (2.0 * p1.x + 1.0 * p2.x) / 3.0;
s.y = (2.0 * p1.y + 1.0 ... | 0 | 26,613,464 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#include <bitset>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair... | #include<iostream>
using namespace std;
int main(){
int n;
int nn[100];
int max = 0;
for(int i=0;i<100;i++){
nn[i] = 0;
}
while(cin >> n){
nn[n-1] += 1;
if(nn[n-1] > max){
max = nn[n-1];
}
}
for(int i=0;i<100;i++){
if(nn[i] == max){
... | 0 | 46,284,905 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define ra... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n, m;
cin >> n >> m;
priority_queue<int> que;
vector<vector<int>> ba(100005);
rep(i,n){
int a, b;
cin >> a >> b;
ba[a].em... | 0 | 59,136,215 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,... | #include<stdio.h>
int main(){
int N, G[10];
int a[3][3], ck[3][3];
for(int i = 0 ; i < 3 ; i++ ) {
scanf("%d %d %d",&a[i][0],&a[i][1],&a[i][2]);
}
scanf("%d",&N);
for(int j = 0 ; j < N ; j++ ){
scanf("%d",&G[j]);
for(int x = 0 ; x < 3 ; x++ ) {
for(int z = 0 ... | 0 | 75,849,665 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define pb push_back
#define endl '\n'
#define snd second
#define fst first
#define fastio cin.tie(NULL),cout.sync_with_stdio(true)
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector <i... | #include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(false); cin.tie(NULL)
#define testcases freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)
#define ui unsigned int
#define ll long long
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<ll>
#define... | 0 | 12,078,627 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 55,186,554 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
void printv(vector<ll> v) {
for (ll i : v)
cout << i << endl;
}
int main() {
string s;
cin >> s;
ll n = s.size() + 1;
vector<ll> a(n, 0);
rep(i, s.size()) {
... | #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;
ll gcd(ll a,ll b){
if(a % b == 0)return b;
else{
return(gcd(b,a% b));
}
}
int main(){
... | 0 | 30,369,577 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <co... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long LL;
LL ll[400005],rr[400005],l[400005],r[400005];
LL stk[400005],tp = 0;
LL n,a[400005],tot = 0;
LL dp[25][400005];
LL LOG[400005];
void init(){
LOG[0] = -1;
for(LL i = 1;i <= n;i ++) LOG[i] = LOG[i >>... | 0 | 69,808,329 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define MP make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
int n;
ll a[N], p[62];
void insert(ll x) {
for(int i = 60; i >= 0; i--) {
if(x >> i & 1) {
if(!p[i]) {
p[... | #include <bits/stdc++.h>
using namespace std;
long long int a[45];
long long int b[45];
int main(){
long long int A,B;
cin >> A >> B;
A--;
long long int ans=0;
for(long long int i=0;i<45;i++){
if(i==0)a[0]=A%(1LL<<2);
else a[i]=A%(1LL<<(i+1));
if((1LL<... | 0 | 58,618,512 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
int C=A-B;
if(C<0){
cout<<0<<endl;
}
else {
cout<<C<<endl;
}
} | #include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <s... | 0 | 98,067,492 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s; cin >> s;
int k; cin >> k;
for (int i = 0; i < k; i++)
{
char c = s[i];
if (c != '1')
{
cout << c << endl;
return 0;
}
}
cout << 1 << endl;
} | #include <iostream>
#include <stack>
using namespace std;
int main() {
int A;
int B;
int K;
cin >> A >> B >> K;
int cnt = 0;
stack<int> s;
for (int i = 1; i <= 100; i++) {
if(A % i == 0 && B % i == 0){
s.push(i);
}
}
for (int i = 0; i < K - 1; i++) {
... | 0 | 87,216,900 |
#include <iostream>
using namespace std;
void swap(int& x, int& y){
int tmp = x;
x=y;
y=tmp;
}
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a>b) swap(a,b);
if(b>c) swap(b,c);
if(a>b) swap(a,b);
cout << a << " " << b << " " << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
int64_t c=0, w;
cin >> n >> k;
priority_queue<int64_t> hs;
for(int i=0; i<n; i++){
cin >> w;
hs.push(w);
}
if (k >= n){
cout << c << '\n';
return 0;
}
n -= k;
for(int i=0; i<k; i++... | 0 | 70,273,947 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i=a; i < b; i++)
bool sort_by(pi c, pi d){
return c.S < d.S;
}
int main() {
int n;
ll ans = 1,... | #include <algorithm>
#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
struct item {
int p;
int y;
int idx;
int rank;
};
int main() {
int n, m;
cin >> n >> m;
vector<item> vec(m);
for (int i = 0; i < m; ++i) {
int p, y;
cin >> p >> y;
vec[i] = {p, y, i, 1};
}
... | 0 | 91,762,235 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n,k;
cin>>n>>k;
if(n%k==0) cout<<0<<endl;
else cout<<1<<endl;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
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;}
int ... | 0 | 35,139,575 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
int X,Y,Z;
ll K;
ll A[1010],B[1010],C[1010];
bool solve(ll mid){
ll sum=0;
rep(i,X) rep(j,Y){
int k=lower_bound(C,C+Z+1,mid-(A[i]+B[j]))-C;
sum+=Z-k;
}
return (sum>=K);
}
... | 0 | 13,024,570 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int N, Y;
cin >> N >> Y;
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= N - i; ++j) {
int k = N - i - j;
if (k * 10000 + j * 5000 + i * 1000 == Y) {
cout << k << " " << j << " " << i << endl;
... | #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 | 91,775,520 |
#include <stdio.h>
#include <string.h>
int main()
{
char s[100];
int k;
scanf("%d", &k);
scanf("%s", &s);
if (k >= strlen(s)){
printf("%s", s);
}else if (k<strlen(s)){
s[k]='\0';
printf("%s...", s);
}
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
int main(void){
string S; cin >> S;
int i = 0;
int a, b; a = 0; b = 0;
while (i < S.size()) {
if (i % 2 == 0) {
if (S[i] == '0') {
a++;
}... | 0 | 8,326,546 |
#include <bits/stdc++.h>
using namespace std;
long n,k,ans=0,mod=1000000007;
long modpow(long modpow_x,long modpow_y) {
long modpow_return=1;
for(long i=1;i<=modpow_y;i*=2) {
if(modpow_y/i%2==1) modpow_return=modpow_return*modpow_x%mod;
modpow_x=modpow_x*modpow_x%mod;
}
return modpow_return;
}
int main(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<int> P(N),Q(N);
for(int i=0; i<N; i++){
cin >> P.at(i);
}
for(int i=0; i<N; i++){
cin >> Q.at(i);
}
vector<int> order(N);
for(int i=0; i<N; i++){
order.at(i)=i+1;
}
int a,b;... | 0 | 60,429,194 |
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n,v,p;
ll m;
cin>>n>>m>>v>>p;
ll a[n];
rep(i,0,n) cin>>a[i];
sort(a,a+n);
int b=0;
int c=n-p;
while(c>b){
int d=(b+c)/2;
int e=uppe... | 0 | 2,799,642 |
#include <bits/stdc++.h>
using namespace std;
int x[3];
int main()
{
cin >> x[0] >> x[1] >> x[2];
sort(x, x + 3);
int cnt = 0;
int a = (x[2] - x[1]) / 2;
cnt += a;
int b = (x[2] - x[1]) % 2;
if (b % 2 != 0)
{
x[1]++;
x[0]++;
cnt++;
}
if ((x[2] - x[0]) % 2 ... | #include<bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define PB push_back
#define fst first
#define snd second
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define x0 x0123456789
#define y0 y0123456789
#define x1 x1234567890
#defin... | 0 | 71,346,035 |
#include<iostream>
#include<algorithm>
int main()
{
int j1, m1, s1, e1;
std::cin >> j1 >> m1 >> s1 >> e1;
int s = j1 + m1 + s1 + e1;
int j2, m2, s2, e2;
std::cin >> j2 >> m2 >> s2 >> e2;
int t = j2 + m2 + s2 + e2;
std::cout << std::max(s, t) << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 63,176,728 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n;
const int t = 86400;
while( scanf("%d",&n) , n ){
int table[t] = {};
for(int i=0 ; i<n ; ++i ){
int h1,m1,s1,h2,m2,s2,start,end;
scanf("%d:%d:%d %d:%d:%d", &h1 , &m1 , &s1 , &h2 , &m2 , &s2 );
start = s1 + m1*60 + h1*60*60 + ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
if(s == "zyxwvutsrqponmlkjihgfedcba"){
... | 0 | 10,954,913 |
#include <iostream>
#include <cmath>
#include <string.h>
#include <iomanip>
#include <math.h>
#include <algorithm>
#include <vector>
#include <map>
#include <tuple>
using namespace std;
#define INF 100000000;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
#define eps 1.0e-14;
int main(){
i... | #include <set>
#include <map>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
const int maxn = 2e5 + 7;
const int INF = 0x3f3f3f3f... | 0 | 52,811,248 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
typedef... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int INF =1001001001;
using P = pair<int,int>;
int N, M, R;
int dist[201][201];
bool visit[8];
int ans = INF;
vector<int> r(9);
void dfs(int v, int prev, int d){
if(v == R + 1){
if(ans > d) ans =... | 0 | 71,475,591 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, ex, area, r;
scanf("%d %d", &a, &b);
area = a*b;
ex = a+b-1;
r = area-ex;
printf("%d\n", r);
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#inc... | 0 | 83,141,408 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
vector<vector<ll>> dp(11);
for(ll i=1;i<10;i++)dp[1].push_back(i);
... | #include<bits/stdc++.h>
#define int(x) int x; scanf("%d",&x);
#define lnt(x) long long x; scanf("%lld",&x);
#define dbl(x) double x; scanf("%lf",&x);
#define str(x) string x; cin >> x;
#define fo(i,a,b) for (int i=(a);i<(b);i++)
#define rf(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define rp(i,n) for (int i=0;i<(n);i++)
#def... | 0 | 23,703,002 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans;
if (a > b) {
ans = 0;
} else if (n == 1) {
if (a != b) {
ans = 0;
} else {
ans = 1;
}
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
ll arr[5001] , score [5001] , vis[5001];
ll n , k ;
const ll OO =-1e18;
ll mx;
ll cycleLen(ll idx)
{
if(vis[idx])
return 0;
vis[idx]++;
ll cnt=cycleLen(arr[idx])+1;
return cnt;
}
ll cycleVal( ll idx , ll num , ll scsofar , ll ... | 0 | 35,133,993 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <random>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const ll INF = 10000000000;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s , t;
cin>>s>>t;
bool equal = false;
for(int i=0;i<s.length();i++)
{
if( s== t)
{
equal = true;
break;
}
s = s.back() + s.substr(0,s.length()-1 );
}
if( equal)
cout<<"Yes";
... | 0 | 23,094,707 |
# include "bits/stdc++.h"
using namespace std;
#define endl "\n"
typedef long long int ll;
#define f first
#define s second
inline void fastio(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
inline void setPrecision(int n){cout.precision(n);}
#define BR cerr<<endl
#define dbg(x) cerr<<(#x)<<": "<<x<<endl
#defi... | #include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using ll=long long;
using pll=pair<ll,ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } retu... | 0 | 45,152,969 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int ans,n;
int a[3];
void dfs(ve<int> &l, string s){
if(s.size() == n){
ve<int> l0(4,0),cnt(4,0);
rep(i,n){
l0[s[i]-'0'] += l[i... | 0 | 88,631,785 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, ll>> x(n);
rep(i, n)ci... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++)
{
cin >> A[i] >> B[i];
}
long long Ans = 0;
for (int i = 0; i < N; i++)
{
int j = N - i - 1;
if ((A[j] + Ans) % B[j] != 0)
... | 0 | 10,088,129 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include<bits/stdc++.h>
using namespace std;
int n,sum,a[100005];
int main(){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
a[0]=0,a[n+1]=0;
for(int i=1;i<=n+1;i++) sum+=abs(a[i]-a[i-1]);
for(int i=1;i<=n;i++)
{
int t1=abs(a[i+1]-a[i]);
int t2=abs(a[i]-a[i-1]);
... | 0 | 6,255,086 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S, T;
cin >> S >> T;
vector<int> check((int)S.size(), 0);
int count = 0;
for (int i=0; i<S.size() - T.size()+1; i++){
for (int j=0; j<T.size(); j++){
if (S.at(i+j) == T.at(j)) count++;
}
check.at(i) = count;
count = 0;
}
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
bool isPalindrome(string s) {
int upper,lower,len;
len=s.length();
if(len==1) {
return true;
}
if(len%2==0) {
lower=(len/2)-1;
upper... | 0 | 40,067,272 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.