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;
int main() {
int N, res = 0, max = 0;;
cin >> N;
for (int i = 1; i <= N; i++) {
int tmp = i;
int cnt = 0;
while (tmp % 2 == 0) {
tmp /= 2;
cnt++;
}
if (max <= cnt) {
max = cnt;
... | #pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define... | 0 | 51,249,246 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin() , (v).end()
#define vi vector <ll>
#define vii vector <pair<ll,ll>>
#define ii pair<int,int>
#define lp(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define F first... | #include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
using namespace std;
int main(){
ll n,sum1=0,sum2=0;
cin >> n;
vector<vector<ll>> v(n,vector<ll>(3,0));
vector<ll> v2(n);
r(i,n)cin >> v[i][1];
r(i,n){
cin >> v[i][2];
v[i][0]=v[i][1]-v[i][2];
sum1+=v[i][1]; s... | 0 | 5,098,905 |
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <tuple>
#include <map>
#include <ctime>
#include <cstdlib>
#include <random>
#include <unistd.h>
using namespace std;
#define int long long
signed main(){
char a;
ci... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int INF = 1000000001;
int main() {
int n;
scanf("%d", &n);
vector<int> h(n);
rep(i, n) {
scanf("%d", &h[i]);
}
int cnt = 0, max_c = 0;
rep(i, n-1) {
if (h[i] >= h[i+1]) {
c... | 0 | 16,109,682 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define init(a,i) for(int k=0;k<(i);k++)(a)[k]=0
#define in(a,i) for(int k=0;k<(i);k++)cin>>(a)[k]
#define all(a) (a).begin(),(a).end()
#define el(a) (a).end()-(a).begin()
#define mod ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 2005;
const ll MOD = 1e9 + 7;
int n, m;
ll dp[N][N];
int main() {
cin.tie... | 0 | 29,123,387 |
#include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<int>adj[8];
bool marked[8];
int n=8,m=28;
int dfs(int s,int c)
{
marked[s]=true;
if(c+1==n){
return 1;
}
int sum=0;
for(auto x : adj[s])
{
if(!marked[x]){
sum += dfs(x,c+1);
marked[x]=false;}
}
return sum;
}
int main()
{
cin>>n>>... | 0 | 67,019,076 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
#include<stdio.h>
#include <cstdint>
#inclu... | #include <iostream>
#include <ctime>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int NMAX = 10000;
void PrintArray(int* A, int N)
{
cout << A[0];
for (int k = 1; k < N;k++) {
cout << " " << A[k] ;
}
cout << endl;
}
void Swap(int& a, int &b) {
int tmpA, tmpB;
tmpA = a;
tmp... | 0 | 54,089,339 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const string col[2] = {"RB", "GY"};
int H, W, d;
char hoge[1005][1005];
char ans[505][505];
void solve1() {
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (i % 2 == 0 && j % 2 == 0) ans[i][j] = 'R';
e... | #include<iostream>
#include<set>
using namespace std;
int main()
{
ios::sync_with_stdio( false );
int n;
cin>>n;
set< string > dict;
string cmd, key;
for( int i=0; i<n; i++ ) {
cin>>cmd>>key;
if( "insert" == cmd ) {
dict.insert( key );
} else {
if( dict.end() != dict.find( key ) ) {
cout<<"yes\n";... | 0 | 68,169,228 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | #include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
string ans="EQUAL";
if(a.length()>b.length()) ans="GREATER";
else if(a.length()<b.length()) ans="LESS";
else if(a.length()==b.length()){
int n=a.length();
for(int i=0; i<n; i++){
if(a... | 0 | 99,700,858 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1001001001;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
ll g... | #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>... | 0 | 90,593,992 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int max, min, sum,n,x,ans;
while(true){
cin>>n;
if(n!=0){
cin>>x;
max=x;
min=x;
sum=x;
for(int i=1;i<n;i++){
cin>>x;
sum+=x;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, x, y; scanf("%d %d %d %d", &n, &k, &x, &y);
if (n <= k) printf("%d", x * n);
else {
int cost = k * x;
printf("%d", cost + (n - k) * y);
}
return 0;
} | 0 | 32,414,227 |
#include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for(int i=a; i<b; i++)
#define mem(arr, val) memset(arr, val, sizeof(arr))
#define MOD 1000000007
#define INF 1000000001
#define epsilon 1e-15
typedef long long int ll;
typedef unsigned long long int ull;
int gcd(int a, int b){
if(b==0) return a;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | 0 | 1,254,452 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 510;
... | #include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
#define PI 3.141592
int main(void){
long double x1, x2, x3, x4, y1, y2, y3, y4, tilt_a, tilt_b;
int n;
cin >> n;
for(int i=0; i<n; i++){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
if(x1 == x2){
... | 0 | 31,228,432 |
#include <bits/stdc++.h>
using namespace std;
vector<int> finalpos;
long long initpos[100005];
long long finpos[100005];
bool clockwise[100005];
long long finalans[100005];
long long n,l,T;
int main(){
scanf("%lld%lld%lld",&n,&l,&T);
for (int x = 0; x<n; x++){
int t;
scanf("%lld%d",&initpos[x],&... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a; i< (int)(b); ++i)
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
typedef long double ld;
using ll=long long;
using namespace std;
const int mod=1e9+7;
const ld pi = (acos(-1));
template<class T>bool chmax(T &a, const T &b) { if (a<b)... | 0 | 32,802,423 |
#include <iostream>
using namespace std;
int main(){
int m,f,r;
while(1){
cin>>m>>f>>r;
if(m==-1 && f==-1 && r==-1) break;
else if(m==-1 || f==-1) cout<<"F"<<endl;
else if(m+f>=80) cout<<"A"<<endl;
else if(m+f<80 && m+f>=65) cout<<"B"<<endl;
else if(m+f<65 && m+f>=50) cout<<"C"<<endl;
el... | #include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#define N 1010
using namespace std;
int n, m;
long long x[N], y[N], p[50];
int main() {
#ifdef isLOCAL
freopen("work.in", "r", stdin);
freopen("work.out", "w", stdout);
#endif
cin >> n, m = 35;
for (int i = 1; i <= n; ++i) {
... | 0 | 1,520,309 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using VE = vector<T>;
template<class T> using P = pair<T, T>;... | #include <bits/stdc++.h>
using namespace std;
const long long INF = (1LL<<32);
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFO... | 0 | 34,646,798 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string S;
cin >> S;
string T;
cin >> T;
T = T.subst... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex... | 0 | 73,982,751 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
ll lucas[100];
int main() {
int n;
cin >> n;
lucas[0] = 2;
lucas[1] = 1;
for (int i = 2; i <... | #include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
ll M = 998244353;
ll modpow(ll a, ll n, ll mod) {
... | 0 | 13,147,843 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
{
return a;
}
return gcd(b, a%b);
}
int main() {
int n, x;
cin >> n >> x;
vector<int> x_s(n);
for (auto i = 0; i < n; i++)
{
cin >> x_s[i];
}
vector<int> sub(n);
for (auto i ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 0 | 34,045,095 |
#include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
if(x&1) ans=ans*a%MOD;
a=a*a%... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... | 0 | 61,285,329 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[1001][1001];
int main()
{
string s,t;
cin >> s >> t;
int n = s.size(),m = t.size();
for(int i = 0;i<n+1;i++)
{
dp[i][0] = i;
}
for(int i = 0;i<m+1;i++)
{
dp[0][i] = i;
}
for(int i = 1;i<n+1;i++)
{
for(int j = 1;j<m+1;j++)
{
i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
map<string, int> s;
for (int i = 0; i < n; i ++) {
string tmp; cin >> tmp;
if (s.count(tmp) == 0) {
s[tmp] = 1;
} else {
s[tmp] ++;
}
}
int m; cin >> m;
for (int i = 0; i < m; i ++) {
... | 0 | 50,501,758 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin>>a;
if(a=='a'||a=='i'||a=='u'||a=='e'||a=='o'){
cout<<"vowel"<<endl;
}
else{
cout<<"consonant"<<endl;
}
} | #pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL;
#define pb push_back
#define mp make_pair
#define all(x) ... | 0 | 44,191,748 |
#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<utility>
#include<memory>
#include<cmath>
#include<stack>
#include<tuple>
#include<numeric>
#include<cassert>
#define ALL(g) (g).begin(),(g).end(... | #include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
int DP[1001][1001];
int main(){
int T;
cin >> T;
for (int t = 0; t < T; t++) {
char X[1002],Y[1002];
scanf("%s%s",X,Y);
int y = strlen(Y);
int x = strlen(X);
... | 0 | 21,911,967 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for(int i = 0; i < N; i++){
int b;
cin >> b;
b--;
a.at(i) = b;
}
int nwbt = 0;
int cnt = 0;
while(true){
if(nwbt == 1){
cout << cnt << endl;
... | #include <bits/stdc++.h>
#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 INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | 0 | 47,205,993 |
#include <bits/stdc++.h>
using namespace std ;
#define int long long
#define fast ios_base::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0) ;
#define endl '\n'
void solve() {
int n ;
cin >> n ;
int ans = 0 ;
vector<int> v(2 * n) ;
for (auto &x : v) cin >> x ;
sort(v.begin(), v.end()) ;
fo... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>> ;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++... | 0 | 75,071,445 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t n, l;
cin >> n >> l;
vector<int64_t> A(n);
copy_n(istream_iterator<int64_t>(cin), n, A.begin());
int f = -1;
for (int i = 0; i < n - 1; i++){
if (A[i] + A[i + 1] >= l){
f = i + 1;
}
}
if (f == -... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
vector<ll> L;
ll getP(int N, ll X) {
if (N == 0) {
if (X > 0) {
return 1;
} else {
return 0;
}
}
if (X <= 0) {
return 0;
} else if (X >= L[N]) {
retur... | 0 | 59,227,756 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> ... | #include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for(ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll,... | 0 | 36,844,159 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main()
{
ll n , gcd , x;
cin >> n;
for(ll i = 0 ; i < n ; i++)
{
cin >> x;
if(!i)
gcd = x;
gcd = __gcd ( x , gcd);
}
cout << gcd << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if(s.at(0) == 'R' && s.at(1) == 'R' && s.at(2) == 'R') {
cout << 3 << endl;
}
else if((s.at(0) == 'R' && s.at(1) == 'R') || (s.at(1) == 'R' && s.at(2) == 'R')) {
cout << 2 << endl;
}
else if(s.at(0) == ... | 0 | 63,663,181 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
int main()
{
string a,b,c;
cin >> a >> b >> c;
if(a[a.size()-1] == b[0] && b[b.size()-1] == c[0]){
cout << "YES" << "\n";
}else{
cout << "NO"<< "\n";
}
} | #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>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
int d[n];
rep(i,n){
cin>... | 0 | 9,729,006 |
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main()
{
int n, k;
cin >> n >> k;
vector<ll> s(n + 1);
for (int i = 0; i < n; ++i) {
ll a;
cin... | #include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <iomanip>
#include <map>
#include <bitset>
#include <cstdio>
#include <set>
#include <stack>
#include <queue>
#include <cassert>
#include <numeric>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for (ll... | 0 | 21,771,582 |
#include <bits/stdc++.h>
using namespace std;
#define tani_nachi_ke ios_base::sync_with_stdio(false); cin.tie(NULL);
#define M_PI 3.14159265358979323846
#define data data_
#define ff first
#define ss second
#define pb push_back
#define ld long double
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 51;
int mp[MAX_N][MAX_N];
ll X[MAX_N], Y[MAX_N];
pair<ll, ll> dot[MAX_N];
int N, K;
int minmp(int i, int j) {
if(i >= 0 && j >= 0) return mp[i][j];
else return 0;
}
int main()
{
cin >> N >> K;
for(int i = 0; i < N; ++i)... | 0 | 95,906,537 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define SORTD(s) sort((s).rbegin(),(s).rend())
int gcd(int a, int b) {
if (!b) return a;
return gcd(b, a % b);
}
int main() {
ll a,b,c,d,sum;
cin>>a>>b>>c>>d;
sum +=b/c-(a-1)/c;
sum +=b/d-(a-1)/... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
#include <string.h>
#include <set>
using namespace std;
#define N 100005
#define M 20
#define mod 1000000007
int x[N],dp[N][M];
int jumpCity(int stCity,int day) {
int curCity = stCity... | 0 | 12,833,479 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.... | 0 | 34,424,805 |
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<(n);++i)
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RREP(i, n) for(int i=(int)(n);i>=0;--i)
#define RFOR(i, a, b) for(int i=(int)(a);i>=(int)(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define DUMP(x... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_bas... | 0 | 19,517,857 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
using namespace std;
using ll = int64_t;
ll mod_pow(ll x, ll n, const ll mod){
ll ans = 1;
while(n){
if(n & 1) ans = ans * x % mod;
x = x * x % mod;
n >>= 1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long,long long> P;
int main() {
long long N,M;
cin >> N >> M;
vector<P>A(N);
for(long long i = 0; i < N; i++) {
long long a,b;
cin >> a >> b;
A[i].first = a;
A[i].second = b;
}
sort(A.begin(),A.end())... | 0 | 38,258,269 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
void solve () {
long long n, m;
cin >> n >> m;
vector<pair<long long, long long>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
long long ans = 0;
sort (a.begin(), a.end());
for (auto p : a) {
ans += ... | 0 | 16,307,362 |
#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() {
ll n,a,b;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
const int mod = 1e5;
const long long INF = 1LL<<60;
int main(){
int n;
while(cin >> n){
if (n == 0) break;
vector<long long> imos(101010);
rep(i,n){
string s1, s2;
cin >> ... | 0 | 65,776,850 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
if(s[0]!=s[1] || s[1]!=s[2] || s[0]!=s[2])
cout<<"Yes";
else cout<<"No";
} | #include<iostream>
#include<vector>
using namespace std;
using ll = long long;
int main(){
int k;
cin>>k;
vector<ll> a;
for(int i=1;i<=9;i++) a.push_back(i);
while(1){
if(k<=(int)a.size()){
cout<<a[k-1]<<endl;
return 0;
}
k-=(int)a.size();
vect... | 0 | 58,595,717 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
bool isev(string &s,ll x)
{
if(x&1) return 0;
for(int i=0;i<x/2;i++)
{
if(s[i]!=s[x/2+i])
{
return 0;
}
}
return 1;
}
int main()
{
string s;
cin>>s;
ll n=s.size();
n--;
while(ise... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
constexpr long MOD = 1e9 + 7;
using namespace std;
#include <map>
map<pair<int,int>, int> m;
long h, w, n;
long counter[10];
long nonzero = 0;
void hoge(int a, int b) {
for (int i = -1; i < 2; i... | 0 | 37,645,874 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k,sum=0;
cin>>a>>b>>c>>k;
while(k&&a){
sum++;
a--;
k--;
}
while(k&&b){
b--;
k--;
}
while(k&&c){
sum--;
c--;
k--;
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const double PI = 3.14159265358979323846;
int main()
{
int H, N;
cin >> H >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++)
{
cin >> A[i] >> B[i];
}
vector<vector<int>> dp(N + 1, vector<in... | 0 | 30,172,650 |
#include <iostream>
int main (){
int a,b,c;
std::cin >> a >> b >> c;
if (a < b && b < c)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 83,767,637 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0;
for(int i = 0 ; i < s.size(); i++) {
if(s[i] == 'o') sum++;
}
if(8 - sum <= 15 - s.size()) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr<<x<<END;
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int i = (b); i > (a); --i)
const int mod... | 0 | 65,722,632 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
vector<vector<int>> black(50, vector<int>(100, 0));
vector<vector<int>> white(50, ve... | #include <bits/stdc++.h>
using namespace std;
int n, m, p[100005], ans[100005];
vector<pair<int, int>> v[100005];
int ta;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d%d", p + i, &ta);
v[p[i]].emplace_back(ta, i);
}
for (int i = 1; i <= n; i++) {
sort(v[i].begin(), v[i].end());
... | 0 | 67,863,893 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#include <cassert>
using namespace std;
#define TEST
#ifdef TEST
#define dout... | 0 | 44,291,692 |
#include<bits/stdc++.h>
using namespace std;
const int N=8005,low=8000;
char s[N];
int x,y,n;
bitset<N*2>bx,by;
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
scanf("%d%d",&x,&y);
bx[0+low]=1;by[0+low]=1;
bool flag=true;
int t=0,st=0;
for(int i=1;i<=n;i++)
if(s[i]=='F') t++;
else
... | #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>;
const int INF=1001001001;
int dy[4]={-1,0,1,0};
int dx[4]={0,-1,0,1};
int main(){
int h,w;
cin>>h>>w;
vector<string>s(h);
rep(i,h)cin>>s[i];
vector<vector<int>>dist... | 0 | 58,362,807 |
#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 argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
string s1,s2,s3;
cin>>s1>>s2>>s3;
s1[0]=toupper(s1[0]);
s2[0]=toupper(s2[0]);
... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<utility>
#include<sstream>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int ma... | 0 | 68,332,019 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
using P = pair<int,int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
int main(){
ll n;
cin >> n;
vector<ll> d;
for(ll i = 1; i * i <= n; ++i){
if(n % i == 0){
d.push_b... | #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 (ll 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 r... | 0 | 92,578,025 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end(... | #include <iostream>
using namespace std;
int main() {
int H, W;
bool loop = true;
while (loop) {
cin >> H >> W;
if ((H == 0) && (W == 0)) {
loop = false;
continue;
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if ((i == 0) || (i == H-1)) {
cout << "#";
... | 0 | 15,165,841 |
#include <bits/stdc++.h>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
int N;
cin >> N;
int T[110] = {};
int V[110] = {};
int S[110] = {};
for(int i = 1; i <= N; i++){
cin >> T[i];
S[i] = S[i-1] + T[i] * 2;
}
for(int i = 1; i <= N; i++){
cin >> V[i];
}
int A[40010] = {};... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, y; cin >> x >> y;
string ans = "No";
if (y % 2 == 1) {
cout << ans << endl;
return 0;
}
if (2 * x <= y && y <= 4 * x) ans = "Yes";
cout << ans << endl;
return 0;
} | 0 | 11,761,796 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define FOR(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))
#def... | # include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# pragma GCC target("avx2")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
# define int long long
using namespace std;
const int N = 2e5 + 7;
const int mod = 1e9 + 7;
vector < int > adj[N];
int used[N], c... | 0 | 50,191,597 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
ll n, ans = 0;
cin >> n;
vector<pair<ll, ll>> a;
for (ll i = 2; i * i <= n; i++)
{
if (n % i != 0)
continue;
ll e = 0;
while (n % i == 0)
{
e++;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vvi = vector<vector<int>> ;
struct unionfind{
vector<int> r;
unionfind(int n){
r = vector<int>(n,-1);
}
int root(int x){
if(r.at(x) < 0) return x;
else return r.at(x) = root(r.at(x));
}
bool unite... | 0 | 7,435,237 |
#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... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
using namespace std;
#define rep(i, n) for(long int i = 0; i < n; i++)
int main(){
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int ans = 1000000000;
for (int i = -100; i <= 100; i++){... | 0 | 14,083,745 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define memset(a,first,last,val) fs(i,first,last,1) a[i]=val
#define nl cout<<"\n";
#define chk(x) co... | #include<bits/stdc++.h>
using namespace std;
bool visited[100005];
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (visited[i]) {
continue;
}
if (a[a[i]] == i) {
cnt++;
visited[a[i]] = true;
}
}
cout... | 0 | 89,580,004 |
#include <string>
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int min = a, max = b;
if(a > b){
min = b;
max = a;
}
rep(i, max){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a = vector<int>(N);
for(int i=0;i<N;i++){
cin >> a.at(i);
}
sort(a.begin(), a.end());
int answer = 100000000000;
int tmp;
for(int x=a.at(0);x<=a.at(N-1);x++){
tmp = 0;
for(auto num : a){
tmp += (num - x) * (num - x... | 0 | 78,987,037 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;i>=n;--i)
typedef long long ll;
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
if(max(a,c)-min(a,c)<=d) cout<<"Yes"<<end... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define all(x) (x).begin() , (x).end()
#define f first
#define s second
#define pr(x) cout<<x<<endl;
#define pr2(x,y) cout<<x<<" "<<y<<endl;
#de... | 0 | 48,457,523 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
string s; cin>>s;
ll ans=IN... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <bitset>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
cons... | 0 | 96,475,492 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>
#include<string>
#include<stdio.h>
#include<cmath>
#include<map>
#include<bitset>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define repn(i, n) for(int i = 1; i <= n; i++)
#define repr(i, n) for(int i = n-1; i >... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
# define M_PI 3.14159265358979323846
void solve(){
ll total=0;
int d;
cin>>d;
vector<int>a(d);
for(int i=0;i<d;i++)
cin>>a[i];
for(int i=0;i<d;i++){
... | 0 | 19,942,108 |
#include <stdio.h>
#include <string.h>
int main() {
char kata1[15];
char kata2[16];
scanf("%s",kata1);
scanf("%s",kata2);
int str = strlen(kata1);
int a = 0,count = 0;
for(a = 0; a<str; a++){
if(kata1[a] == kata2[a]){
count++;
}
}
if(count == str){
printf("Yes\n");
}else{
printf("No");
}
retur... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll... | 0 | 30,813,486 |
#include <iostream>
using namespace std;
int main() {
int a[5];
for(int i=0; i<5; i++){
cin >> a[i];
}
for(int j=0; j<5; j++){
int v = a[j];
int k = j-1;
while(a[k]<v && k>=0){
a[k+1] = a[k];
k--;
a[k+1] = v;
}
}
for(int l=0; l<4; l++){
cout << a[l] << ' ';
}
cout << a[4] << endl;
return 0... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
int h,w;
vector<string>g;
cin >> h >> w;
g.resize(h);
rep(i, h) cin >>... | 0 | 29,171,491 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const do... | #include<iostream>
using namespace std;
int main(){
int change, pay, cnt;
while(true){
cin>>pay; if(pay==0) break;
cnt=0;
change = 1000 - pay;
cnt+= change / 500 ;
cnt+= (change / 100) %5;
cnt+= (change / 50) %2;
cnt+= (change / 10) %5;
cnt+= (change / 5) %2;
cnt+= change %5;
cout<<cnt<<... | 0 | 55,449,876 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <iostream>
#include <bitset>
#include <cassert>
#include <queue>
#include <random>
#include <stack>
#include <iomanip>
using namespace std;
typedef unsigned int uint;
typedef long long llong;
typedef unsigned long long ullong;
typedef long do... | 0 | 586,158 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int m,n;
cin >> n >> m;
int left=-1;
int right=n+2;
rep(i,m){
int t_left, t_right;
cin >> t_left >> t_right;
left = max(left, t_left);
right = min(right, t_right);
}
... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <utility>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <climits>
#include <numeric>
#include<stdio.h>
#include <queue>
#include <iomanip>
#include <float.h>
#include <set>
#include<functional>
#include <stack>
#include <tim... | 0 | 1,075,951 |
#include <iostream>
#include <math.h>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#define DOLL long double
#define LOLI long long int
using namespace std;
const long C_10PW9 = 1000000000;
const int ULCODE = 32;
int main()
{
int H, W, M;
cin >> H >> W >> M;
vector<int> Height(H), Width(W);
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 94,019,129 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double a=0, b=0, c=0;
int d=0;
cin >> a >> b;
c = (a+b)/2;
d = (a+b)/2;
if(c-d>0){
d++;
}
cout << d << endl;
} | #define rep(i, a, b) for(int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template<class T> inline void chmax(T &a, const T &b) {if(a < b) a = b;}
template<class T> inline void chmin(T &a, const T &b) {if(a > b) a = b;}
const long long INF = 1LL<<60;
const ll MAXN = (ll)... | 0 | 11,931,913 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll,ll> > Q;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main()
{
int a,b,c;
cin>>a... | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n , h[N] , f[N];
int main()
{
cin >> n;
for(int i = 1 ; i <= n; ++i)
{
cin >> h[i];
}
f[1] = 0;
f[0] = 99999;
h[0] = 99999;
for(int i = 2 ; i <= n; ++i)
{
f[i] = min(f[i-1] + abs(h[i-1] - h[i]), f... | 0 | 14,389,586 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
int A, P;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> A >> P;
cout << (3*A+P)/2 << endl;
} | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 0 | 17,657,056 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int inf = 1200005;
int main(){
int n, m, x;
cin >> n >> m >> x;
int c[n], a[n][m];
for(int i = 0; i < n; i++){
cin >> c[i];
for(int j = 0; j < m; j++)
cin >> a[i][j];
}
int ans = inf;
for(int ... | 0 | 96,013,489 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
int main(void){
ll n;
cin >> n;
vector<ll> a(n);
ll sum = 0;
ll m = INF;
for (int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
m = min(m, a[i]);
}
ll l ... | #include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;
int counting(int N_H, int N_W, vector< vector<int> > &Graph, queue< pair<int, int> > &PaintingPos)
{
int count = 0;
pair<int, int> pos_y_x;
queue< pair<int, in... | 0 | 14,469,072 |
#include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 1000000007
#define LINF 10000000000000007LL
#define ll long long
using namespace std;
int cnt[1000009];
int ka[214514],inv[214514];
void setkaijo(int n){
ka[0]=1;
for(int i=1;i<=n;i++){
ka[i] = ka[i-1] * i;
ka[i] ... | #include <iostream>
using namespace std;
int N;
int ma;
int main()
{
cin >> N;
for(int i = 1;i <= N;i++)
{
if((i + 1) * i / 2 >= N)
{
ma = i;
break;
}
}
for(int i = ma;i >= 1;i--)
{
if(N - i >= 0)
{
cout << i << endl;
N -= i;
}
}
return 0;
} | 0 | 85,047,517 |
#include <iostream>
#include <string>
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define SIZE(x) ll(x.size())
typedef long long ll;
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int num = SIZE(S);
REP(i, num) {
if (S == T) {
cout << "Yes";
return 0;
} else {
strin... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
ll W, H, N;
cin >> W >> H >> N;
ll min_x = 0, max_x = W;
ll min_y = 0, max_y = H;
for (ll i = 0; i < N; i++)
{
ll x, y, a;
cin ... | 0 | 74,305,436 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int t;
cin>>t;
long long int ans = 0, max = t;
for(int i = 1; i < n; i++) {
cin>>t;
if(t < max) {
ans += max-t;
}
else if(t > max) {
max = t;
}
}
cout<... | #pragma region header
#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>
#inc... | 0 | 24,569,818 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define pa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
#define pb push_back
using ll = long long;
using namespace std;
using pint = pair<int,int>;
using pll = pair<ll,ll>;
const int INFint = 1e9;
const ll INFll = 1e18;
ll MOD=1e9+7;
ll ... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};... | 0 | 34,800,343 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
template<typename T>
void print(T x) {
cout << x << endl;
}
int main(void) {
int n; cin >> n;
string s; cin >> s;
int k; cin >> k; k--;
char x = s[k];
rep(i, s.size()) {
if(s[i]!=x... | #include <bits/stdc++.h>
using namespace std;
using ll=long long ;
void solve() {
int n; cin >> n;
vector<ll> sum(n+1);
sum[0] = 0;
for (int i = 1; i <= n; i++) {
int x; cin >> x;
sum[i] = sum[i-1] + x;
}
ll res = 1ll<<60;
for (int i = 1; i < n; i++) {
ll d = abs(2*su... | 0 | 5,445,539 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end... | 0 | 91,833,021 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
bool dp[100010]={0};
string div[] = { "dream", "dreamer", "erase", "eraser" };
string S; cin >> S;
dp[0] = 1;
for (int i = 0; i < S.size(); ++i) {
if (!dp[i]) continue;
for (string s : div) {
if (s == S.substr(i, s.size())) {
dp[i + s.size(... | #include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
#define il inline
constexpr int N=1e5+5;
struct EDGE
{
int to,nxt,w;
};
int n,cnt;
EDGE e[N*2];
int dis[N],head[N];
bool vis[N];
queue<int>q;
il void add(int x,int y,int z)
{
e[++cnt].to=y;
e[cnt].... | 0 | 6,931,198 |
#include<bits/stdc++.h>
using namespace std;
#define oo (long long)1e18
#define ll long long
#define setdp memset(dp,-1,sizeof(dp))
const ll mod = 1e9+7;
void _IOS(){ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);}
#define PI 3.14159265359
int sx,sy,tx,ty;
struct threeElements{
int _1st,_2nd,_3rd... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll ans = 1000000000000;
ll num;
bool judge;
for(ll i = 1; i*i <= N; i++){
if(N % i == 0){
num = N / i + i - 2;
ans = min(ans, num);
}
}
cout << ans << ... | 0 | 62,643,803 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N;
cin >> N;
ll ans =0;
vector<ll> C(N),S(N),F(N);
for(int i=0;i<N-1;i++){
cin >> C[i] >>S[i] >>F[i];
}
for(int i=0;i<N;i++){
ll ans =0;
for(int j=i;j<N-1;j++){
if(ans<=S[j])... | #include <iostream>
#define N_MAX 1000000000
using namespace std;
int func(long long n){
static int cnt = 0;
if(cnt++ > 64)return -1;
char ans;
cout << "? " << n << endl;
cin >> ans;
if(ans == 'Y')return 1;
return 0;
}
int main(void){
long long left = (long long)N_MAX*10-1, right = (long... | 0 | 90,828,626 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std;
const int N = 3e5 + 7;
const int mod = 1e9 + 7;
void solve1()
{
int n;
cin >> n;
vector < int > v(n + 2 , 0);
for( int i = 1; i <= n; i++ ){
cin >> v[i];
}
int sum = 0;
for( int i = ... | #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> a(100005);
rep(i,n){
int x;
cin >> x;
a[x]++;
}
int ans = 0;
rep(i,100000){
int ... | 0 | 100,131,126 |
#include <bits/stdc++.h>
#include <queue>
using namespace std;
int main(){
int N;
cin >> N;
typedef pair<int, int> Student;
priority_queue<Student, vector<Student>, greater<Student>> que;
int num;
for(int i=0; i<N; i++){
cin >> num;
que.push(Student(num, i));
}
while (!qu... | #include <bits/stdc++.h>
using namespace std;
int n;
string s;
bool ok(vector<bool> &is_sheep, bool s1, bool s2) {
is_sheep[0] = s1;
is_sheep[1] = s2;
for (int i=1; i<n-1; i++) {
if (is_sheep[i]) {
if (s[i] == 'o') {
is_sheep[i+1] = is_sheep[i-1];
} else {
is_sheep[i+1] = !is_sheep... | 0 | 76,904,805 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define SORT(s) sor... | #include <iostream>
#include <vector>
using namespace std;
int solve(int n, int m, int p) {
int a[n];
int ret = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ret += 100*a[i];
}
if (a[m-1]) ret = ret * (100-p)/100 / a[m-1];
else ret = 0;
return ret;
}
int main(void){
int n... | 0 | 40,600,035 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int m =0;
int n1=n;
while(n1!=0){
m = m+(n1%10);
n1=n1/10;
}
if(!(n%m)){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define append push_back
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e18 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {1, 0,... | 0 | 54,217,211 |
#include<iostream>
using namespace std;
int main(){
int a=1;
int b=1;
for(a=1;a<10;a++){
for(b=1;b<10;b++){
cout << a <<"x"<<b<<"="<<a*b << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define sz size
#define se second
#define fe first
#define mper make_pair
#define all(x) x.begin(), x.end()
#define mal ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
#define vl vector<ll>
#define vi vector<int>
#define vli vector <pair <... | 0 | 20,145,756 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | #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;
vector<P> ac(n);
rep(i,m) {
int p;
string s;
cin >> p >> s;
p--;
if (ac.at(p).first ==... | 0 | 5,393,339 |
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
long long int Fraction = 1;
for(int i = 0; i < n; i++){
Fraction *= n-i;
}
printf("%lld\n", Fraction);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 0 | 54,796,131 |
#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
int main () {
int n,Q;
cin >> n >> Q;
dsu d(n);
while(Q--) {
int type,u,v;
cin >> type >> u >> v;
if(type == 0) d.merge(u,v);
if(type == 1) cout << d.same(u,v) << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,K;
cin >> N >> K;
vector<int> A_cnt(N);
int count=0;
for(int i=0; i<N; i++){
int a; cin >> a;
if(A_cnt.at(a-1) == 0){
count++;
}
A_cnt.at(a-1)++;
}
sort(A_cnt.rbegin(),A_cnt.rend());
... | 0 | 87,127,672 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#define rep(i, n) fo... | #include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include<algorithm>
#include <iomanip>
#include <math.h>
#include <iostream>
#include <bitset>
#include <map>
#define db double
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long ... | 0 | 9,918,508 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=1000000007;
#define INF (1<<30)
#define LINF (lint)(... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | 0 | 20,134,834 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int a,b;
cin>>a>>b;
int pow=1;
int ans=0;
while(pow<=b && a)
{
pow*=2;
ans++;
a--;
}
if(a)
{
cout<<pow+a*b<<endl;
}
else
cout<<pow<<endl;
} | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ff first
#define ss second
#define MP make_pair
#define mset(x,a) memset(x,a,sizeof(x))
#define max3(x,y,z) max(x,max(y,z))
#define min3(x,y,z) min(x,min(y,z))
#define sqr(a) (a)*(a)
#define all(x) (x).begin(), (x).e... | 0 | 17,921,767 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(void){
ll n;
cin >> n;
ll ans=0,a,p=0;
for (int i=0; i<n; i++){
cin >> a;
if (a<p) {
ans+=p-a;
}
else p=a;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int K = 10000;
bool XC[3*K], YC[3*K], XCN[3*K], YCN[3*K];
int main() {
string S; int N, X, Y;
cin >> S >> X >> Y;
N = S.size();
bool mode = 0;
vector<int> xs, ys;
int x = N, cnt = 0;
for(int i=0; i<N; i++) {
if(S[i] == 'T') {x = i; ... | 0 | 56,725,264 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
typedef long long ll;
ll n,l; cin>>n>>l;
string p;
vector<string>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
sort(v.begin(),v.end());
for(int i=0;i<n;i++)
{
cout<<v[i];
}
cout<<p<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int used[300000];
int main(){
int N;
cin >> N;
int A[(1<<N)+1];
for(int i=0; i<(1<<N); i++){
cin >> A[i];
}
A[1<<N] = -1;
long long data[1<<N][2];
data[0][0] = 0; data[0][1] = -1;
for(int i=1; i<(1<<N); i++){
vector<int> arr;
arr.push_back(i);
for(int j=0; j... | 0 | 77,149,417 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int> > dp(s.size() + 1, vector<int>(t.size() + 1, 100000));
dp[0][0] = 0;
for (int i = 0; i <= s.size(); i++) dp[i][0] = i;
for (int j = 0; j <= t.size(); j++) dp[0][j] = j;
for (int i = 0; i... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define MOD 1000000007
#define INF (1<<30)
#define LINF (1LL<<60)
#def... | 0 | 95,690,219 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
priority_queue<int> pq;
for(int i=0,x;i<10;i++)
cin>>x,pq.push(x);
for(int i=0;i<3;i++,pq.pop())
cout<<pq.top()<<endl;
return 0;
} | #include<bits/stdc++.h>
#define lli long long int
using namespace std;
int ar[10005];
lli dp[10005][200][2];
lli getSum(int pos , int n , lli d, lli sum , bool flag)
{
if(pos > n) {
if(sum==d) return 1;
return 0;
}
if(dp[pos][sum][flag] != -1) return dp[pos][sum][flag];
int limit = 9;
if(!flag) limit = ar[pos]... | 0 | 62,381,656 |
#include<stdio.h>
#include<math.h>
int main()
{
int N;
scanf("%d", &N);
int i, a[1000], b[1000], c[1000];
for (i = 0; i < N; i++)
{
scanf("%d %d %d", &a[i], &b[i], &c[i]);
}
for (i = 0; i < N; i++)
{
float A = a[i], B = b[i], C = c[i];
float d = fmax(A, B), sm1 = fmin(A, B);
float biggest = fmax(d, C), ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,p,x;
int a[100];
int sum;
while(1){
cin>>n>>m>>p;
if(n==0 && m==0 && p==0) break;
sum=0;
for(int i=0;i<100;i++){
a[i]=0;
}
for(int i=0;i<n;i++){
cin>>x;
a[i]=x;
sum+=x;
}
if(a[m-1]!=0){
... | 0 | 13,943,959 |
#include <stdio.h>
int main(void){
int a,b;
scanf("%d%d",&a,&b);
printf("%d %d %.12lf\n",a/b,a%b,(double)a/b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
inline double inp(pair<double, double> a, pair<double, double> b) {
return a.first * b.first + a.second * b.second;
}
bool cmp(pair<double, double> a, pair<double, double> b) {
return atan2(a... | 0 | 82,135,985 |
#include <stdio.h>
#include <string.h>
int main(){
int Tc;
scanf("%d",&Tc );
long long int data[Tc]={}; long long int Tot=1;
for (int i=0; i<Tc; i++){
scanf("%lld", &data[i]);
}
for (int j=0; j<Tc; j++){
if (data[j]==0){
printf("0");
return 0;
}
}
for(int k=0; k<Tc; k++){
if (data[k]>10000000000000... | #include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace... | 0 | 81,982,381 |
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a);i<(b);++i)
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c)
#defi... | #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 pqueue(x) priority_queue<x,v... | 0 | 71,676,833 |
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long int
using namespace std;
int mod = 1e9 + 7;
int findSum(string s) {
int sum = 0;
for (int i = 0; i < s.length(); i++) {
sum += s[i] - '0';
}
return sum;
}
int32_t main() {
#ifndef ONLI... | #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;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | 0 | 28,070,752 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
template <typename T>
T gcd(T a, T b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
template <typename T>
T lcm(T a, T b) {
if (a <= b)
return b / gcd(a, b) * a;
else
return a / gcd(a, b) * b;
}
int main() {
... | #include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
int N;
int A[1<<20];
int dp1[1<<20][20] = {},dp2[1<<20][20] = {};
int main(){
cin >> N;
for(int i=0;i<(1<<N);i++){
cin >> A[i];
dp1[i][0] = A[i];
}
for(int j=0;j<N;j++){
for(int i=0;i<(1<<N);i++){
... | 0 | 10,447,765 |
#include<iostream>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<list>
#include<map>
#include<tuple>
#include<cmath>
#include<bitset>
using namespace std;
int main()
{
double W, H, x, y,ans;
double S_x1, S_x2, S_y1, S_y2, S_x, S_y;
c... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 0 | 49,287,061 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=5e3+5;
struct Q{
int id[N*2],s,t,k;
LL q[N*2];
void init(){s=t=0;}
void insert(LL x,int i){
while(s<t&&i-id[s]>=k)s++;
while(s<t&&x<=q[t-1])t--;
q[t]=x,id[t]=i;t++;
}
LL top(){return q[s];}
}q;
int p[N],c[N],st[N*2],top,k;
bool v... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i< (n); i++)
using namespace std;
using ll = long long;
typedef pair<int,int> P;
int main(void) {
ll N,X,mod; cin >> N >> X >> mod;
vector<ll> lib(mod,-1);
vector<ll> A(10000000,0);
A[1] = X;
ll line1;
for(ll i=2; i<=10000000; i++) {
... | 0 | 57,859,035 |
#include <cstdio>
#include <iostream>
#include <deque>
#include <vector>
using namespace std;
int main(){
int k;
cin >> k;
while(k % 2 == 0){
k /= 2;
}
while(k % 5 == 0){
k /= 5;
}
vector<int> digitSum_mod(k, 1e9);
deque<int> dq;
digitSum_mod[1] = 1;
dq.push_back(1);
while(!dq.empty()){
... | #include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b)
{
if (a < b) {
int k = a;
a = b;
b = k;
}
if (b == 0) return a;
return gcd(b, a%b);
}
int p(int n)
{
for (int i = 2; i*i <= n; i++) {
if (n%i == 0) return i;
}
return n;
}
int mai... | 0 | 6,646,459 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.