code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define inf 1ll<<62
using namespace std;
int n;
int a[300010];
int max1[300010],ans[300010];
int main()
{
scanf("%d",&n);
n=1<<n;
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(int i=0;i<n;i++)
{
for(int j=i;j<n;j=(j+1)|i)
{
ans[j]=max(ans[j],max1[j]+a[i]);
max1[j]=max(max1[j... | #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;
int ans = 0;
rep(x, 1000) {
vector<int> v;
int nx = x;
v.push_back(nx % 10);
nx /... | 0 | 61,371,538 |
#include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uni... | #include <iostream>
using std::cout;
using std::cin;
using std::endl;;
int main()
{
while (1) {
int h, w;
cin >> h >> w;
if (h == 0 && w == 0) {
break;
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cout << "#";
... | 0 | 59,037,611 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int n, y, i, j;
cin >> n >> y;
y /= 1000;
for(i=n; i>=0; i--){
for(j=n-i; j>=0; j--){
if(i*10 + j*5 + n-i-j == y) goto SKIP;
}
}
cout << "-1 -1 -1\n";
return 0;
SKIP:... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
constexpr long long LINF = 1000100010001000100L... | 0 | 4,989,419 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using P=pair<long long,long long>;
#define rep(i,n) ... | #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()
typedef long long ll;
static const int INF (1<<30);
ll get_min(ll h, ll w) {
ll y = INF;
for (int x = 1; x <= w-2; x++) {
ll s1 = x * h;
ll s2, s3;
if (w-x % 2 == 0) {
... | 0 | 1,920,478 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using ll = long long;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, s, n) for(ll i = s; i < n; i++)
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<string> s(h+1);
vector<vector<int>> mas... | 0 | 24,312,217 |
#include <bits/stdc++.h>
#define int long long
#define double long double
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("avx,avx2,sse")
using namespace std;
int n, k, ans = 0;
vector<int> arr;
int ind(int x, vector<int> &arr) {
if (arr.empty() || arr[0] >= x) {
... | #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>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n... | 0 | 82,827,827 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
string s, s2, s3;
int m, n;
while (true) {
cin >> s;
if (s == "-") break;
cin >> m;
for (int j = 0; j < m; j++) {
cin >> n;
s2 = s[n];
for (int i = n + 1; i < s.length(); i++) {
s2 += s[i];
}
for (int i ... | #include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
string s;
cin>>s;
int g=0;
int f=0;
int h=0;
if(s[0]=='A'){
g=1;
}
for(int i=0;i<s.length();i++){
if(s[i]>=92){
h++;
}
}
for(int i=2;i<s.length()-1;i++){
if(s[i]=='C'){
... | 0 | 50,385,193 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b,c,d,e;
int f,g,h,i,j;
cin>>a>>f;
for(int k=0;k<f;k++){
cin>>b>>g>>h;
if(b=="print"){
cout <<a.substr(g,h-g+1)<<endl;
}else if(b=="reverse"){
c=a.substr(g,h-g+1);
e=c;
for(int q=0;q<h-g+1;q++){
c[q]=e[e.length()-q-1]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
ll a[int(2*1e5)+100];
int main() {
int n;
cin >> n;
rep(i,n) cin >> a[i];
m... | 0 | 100,223,783 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <tuple>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for(int i = (int)n - 1; j <= i; -... | #include <iostream>
int main()
{
int64_t n, m;
std::cin >> n >> m;
int64_t sum = 0;
if (n >= m / 2)
{
sum = m / 2;
}
else
{
sum = n;
m -= 2 * n;
sum += m / 4;
}
std::cout << sum << std::endl;
return 0;
} | 0 | 6,143,546 |
#include <bits/stdc++.h>
using namespace std;
#define hyperspeed ios::sync_with_stdio(false);cin.tie(NULL);
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define li long int
#define uli unsigned long int
#define pb push_back
#define ld long double
#define vi vector<int>
#define vvi vecto... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 20,527,573 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#define ll long long int... | 0 | 62,443,177 |
#include <iostream>
#include <algorithm>
#include <map>
typedef long long ll;
std::map<ll, ll> PrimeFactorization(ll num){
std::map<ll, ll> prime_factors;
for(ll i = 2 ; i * i <= num ; ){
if(num % i == 0){
num /= i;
prime_factors[i]++;
}else{
i++;
}
}
if(num > 1){
prime_facto... | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define F first
#define S second
const int maxN = 1e5;
const int inf = 0x3f3f3f3f;
typedef long long ll;
int k;
int dp[maxN];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> k;
queue< pii > q;
memset(dp, inf, sizeo... | 0 | 52,760,370 |
#include <bits/stdc++.h>
using namespace std;
#define froop1(a,n) for(int i = a;i < n;i++)
#define froop2(a,n) for(int i = a;i > n;i--)
#define ll long long
#define pq(name,type) priority_queue<type> name
#define vec(name,type,length,value) vector<type> name(length,value)
#define vec2(name,type,length,width,value) vect... | #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 | 44,124,408 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 34,092,315 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
string ans = "";
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'B') {
if (!ans.empty()) ans.pop_back();
} else {
ans += s[i];
}
}
cout << ans <... | #include <iostream>
#include <cmath>
#include <iomanip>
#include <utility>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;
long long gcd(int x, int y){
if ( x == 0 ) return y;
return gcd(y%x, x);
}
long long lcm(int x, int y){
if ( y == 0 ){
return x;
... | 0 | 24,624,647 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#incl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define pb push_back
#define eb emplace_back
#define... | 0 | 40,690,770 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k,x,y,s,c,s1,s2;
cin>>n>>k>>x>>y;
if(n>=k){s=n-k;c=k;}
else if(n<k){c=n;s=0;}
s1=x*c;
s2=y*s;
cout<<s1+s2;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 2000000010;
constexpr ll INF= 2000000000000000000;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
typedef pair<int,P> PP;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
... | 0 | 59,752,803 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
typedef unsigned long long ULLONG;
typedef long long LLONG;
stati... | 0 | 10,389,560 |
#pragma comment(linker, "/STACK:36777216")
#define LOCAL
#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <climits>
#include <cassert>
#include <complex>
#include <cstdio>
#include <string>
#include <ve... | #include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | 0 | 81,616,058 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int>a(n);
for (int i = 0; i < n; i++)cin >> a.at(i);
ll ans = 0;
for (int i = 0; i < n; i++) {
if (i == 0)ans += a.at(i);
else if (a.at(i) > a.at(i - 1))ans += a.at(i) - a.at(i - 1);
}
cout << ans << end... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
bool xcmp(pair<long long int, long long int> a, pair<long long int, long long int> b) {
if(a.first!=b.first) {
return a.first < b.first;
}
return a.second < b.second;
}
bool ycmp(pair<... | 0 | 7,317,088 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_l... | #include <iostream>
#include <cmath>
#include <cstdio>
#define PI 3.14159265
using namespace std;
struct Point{
double x;
double y;
Point(double _x,double _y){
x=_x;
y=_y;
}
};
Point* rotate(Point p, Point base, double rad){
return new Point(
cos(rad)*(p.x-base.x) - sin(rad)*(p.y-base.y) + base.... | 0 | 15,660,805 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int n;
long long arr[MAXN];
vector<int> adj[MAXN];
bool CANT = false;
long long dfs(int v, int par = 0) {
long long all = 0, mx = 0;
for (auto e : adj[v])
if (e != par) {
long long g = dfs(e, v);
all += g;
mx = max(mx, g);
}
if (a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int dp[105][4][2] = {};
int main() {
string s; cin >> s;
int n = s.length();
int K; cin >> K;
dp[0][0][0] = 1;
for (int i = 0; i < n; ++i) {
for (int j = 0;... | 0 | 14,367,677 |
#include <iostream>
using namespace std;
char field[30][30];
int res;
int w, h;
constexpr int dd[] = {0, 1, 0, -1, 0};
void dfs(int y, int x) {
res++;
field[y][x] = 'x';
for (int i = 0; i < 4; ++i) {
int ny = dd[i] + y, nx = dd[i + 1] + x;
if (0 <= ny && ny < h && 0 <= nx && nx < w) {
if (field[ny][... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
inline int read() {
int x = 0, fh = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
fh = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
... | 0 | 88,908,893 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,t;
cin>>n>>t;
int a[n];
int i;
for(i=0;i<n;i++)
cin>>a[i];
long long int ans=t,d=t;
for(i=1;i<n;i++)
{
if(d>=a[i])
{
ans+=a[i]-a[i-1];
d=a[i]+t;
}
else
{
ans+=d-a[i-1];
d=a[i]+t;
}
}
cou... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template<typename T>
int LIS(const vector<T>& v){
if(v.empty()) return 0;
vector<T> a(v.size(), v[0]);
auto end = a.begin();
++end;
for(int i=1;i<v.size();i++){
auto l = lower_bound(a.begin(), end, v[i]);
if(l == end... | 0 | 21,526,520 |
#include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
ll a;
ld b;
void input() {
cin >> a >> b;
}
void solve() {
cout << (a * (ll)round(b * 100)) / 100ll << '\n';
}
int main() {
ios_b... | #include<bits/stdc++.h>
#include<sstream>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
char c[1024];
void print(int a,int b){
for(int i=a;i<=b;i++)
cout<<c[i];
cout<<endl;
}
void replace(int a,int b, char* str){
for(int i=0;i<=b-a;i++)
... | 0 | 31,146,893 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include <bits/stdc++.h>
#define trace1(a) cout<<#a<<": "<<a<<endl
#define trace2(a,b) cout<<#a<<": "<<a<<" | ", trace1(b)
#define trace3(a,b,c) cout<<#a<<": "<<a<<" | ", trace2(b,c)
#define trace4(a,b,c,d) cout<<#a<<": "<<a<<" | ", trace3(b,c,d)
#define t... | 0 | 66,053,355 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
namespace BasicMath {
static UInt GreatestCommonDivisor(UInt a, U... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
templ... | 0 | 23,552,847 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
string s;
cin >> s;
if (s <= "2019/04/30") cout << "Heisei" << endl;
else cout << "TBD" << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | 0 | 10,609,038 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main() {
string T, S;
cin >> S >> T;
int ans = 10000;
rep(i, S.size() - T.size() + 1) {
int count = T.size();
rep(j, T.size()) if (S.at(i + j) == T.at(j)) count--;
ans = min(ans, count);
}
cout << ans;... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 0 | 36,020,446 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if(abs(a - c) <= d)
cout << "Yes";
else {
if(abs(a - b) <= d && abs(b - c) <= d)
cout << "Yes";
else
co... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pi 3.141592653589793
#define eps 0.00000001
#d... | 0 | 39,363,130 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n; cin >> n;
vector<int> p(n);
rep(i,n) cin >> p[i];
int mini = p[0], ans = 0;
rep(i,n) {
if (p[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
stack<char> s;
string ans = "";
ll n; cin >> n;
string st; cin >> st;
for(ll i = 0; i < n; ++i){
if(s.size() != 0 && s.top() == '(' && st[i] == ')'){
s.pop();
}else{
s.push(st[i]);
}
}
ll o = 0, z ... | 0 | 22,712,292 |
#include <cstdio>
#define loop_input(fmt,...) while(~scanf(fmt,__VA_ARGS__))
int main() {
int a, b;
loop_input("%d%d", &a, &b) {
printf("%d %d %lf", a/b, a%b, (double)a/b);
}
return 0;
} | #include <iostream>
#include <iomanip>
const int MAX_N = 100;
double t[MAX_N], v[MAX_N];
double l[MAX_N], r[MAX_N];
double f(int index, double time){
if(time<l[index]) return v[index] + l[index] - time;
else if(time>r[index]) return v[index] + time - r[index];
else return v[index];
}
int main(){
int N;
s... | 0 | 13,712,093 |
#include <iostream>
#include <deque>
#include <string>
#include <algorithm>
class TDoublyLinkedList
{
std::deque<int> Data;
void InsertInput();
void DeleteInput();
void DeleteFirst();
void DeleteEnd();
public:
void Manupulate(int Command);
void Output() const;
};
void TDoublyLinkedList::InsertInput()
{
int Numb... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define ss... | 0 | 35,778,740 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll N, X;
ll sum = 0;
cin >> N >> X;
sum += N;
ll a, b;
a = N - X, b = X;
while ( b > 0 ) {
ll q = a / b;
sum += 2 * q * b;
a -= q * b;
... | 0 | 47,728,526 |
#include <iostream>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
using ll = long long;
using namespace std;
int main() {
int k, x;
cin >> k >> x;
if(500 * k >= x) puts("Yes");
else puts("No");
return 0;
} | #include <iostream>
#include <map>
using namespace std;
int main(){
int dx[] = {1,0,-1,0,1,1,-1,-1}, dy[] = {0,1,0,-1,1,-1,1,-1};
int H, W, N;
cin >> H >> W >> N;
int a, b;
map<pair<int,int>, int> M;
for(int i = 0; i < N; ++i){
cin >> a >> b;
if(a > 1 && a < H && b > 1 && b < W){
++M[make_pair... | 0 | 28,861,831 |
#include <iostream>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
char ca = a.at(0) - 0x20;
char cb = b.at(0) - 0x20;
char cc = c.at(0) - 0x20;
cout << ca << cb << cc << endl;
} | #include<iostream>
#include<vector>
using namespace std;
int n;
void countingSort(short A[],short B[],int k)
{
int C[k+1];
for(int i=0;i<k+1;i++)
{
C[i]=0;
}
for(int j=0;j<n;j++)
{
C[A[j]]++;
}
for(int i=1;i<k+1;i++)
{
C[i]+=C[i-1];
}
for(int j=n-1;j>=0;j--)
{
... | 0 | 20,781,542 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n,k;
cin >> n >> k;
vector<ll> a(n);
rep(i,n)cin >> a[i];
vector<... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,L,T;
cin>>N>>L>>T;
int x[N],w[N];
for(int i=0;i<N;i++)cin>>x[i]>>w[i];
int count=0;
int y[N];
for(int i=0;i<N;i++){
if(w[i]==1) {
y[i]=(x[i]+T)%L;
count+=(x[i]+T)/L;
}
else {
... | 0 | 99,744,399 |
#include <stdio.h>
char ans[100000007];
int main(void)
{
int m, n;
int i, j, k;
int f;
char lb[12000];
char la[12000];
char c;
while (scanf("%d", &n), n != 0){
for (i = 0; i < n; i++){
scanf(" %c %c", &lb[i], &la[i]);
}
scanf("%d", &m);
k = 0;
for (i = 0; i < m; i++){
scanf(" %c", &c);
f = 0;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mtv(kit) cout<<#kit<<" - "<<kit<<"\n";
#define ff first
#define ss second
#define pb push_back
#define rep(i,a,b) for(i=a;i<b;i++)
#define pii pair<ll , ll>
#define all(x) x.begin(),x.end()
#define nl "\n"
#define ump unordered_map
void doit(){
... | 0 | 76,929,773 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> p;
int atooi(char s){
string n="0123456789";
for(int i=0;i<=10;i++){
if(s==n[i]){
return i;
}
}
return 0;
}
int timetime(string s){
int hh,mm,ss,st,ft,h1,h2,m1,m2,s1,s2;
h1= atooi(s[0]);
h2= atooi(s[1]);
m1= atooi(s[3]);
... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i = s; i < t ; i++)
#define SZ(a) (int)a.size()
char img[9][5] = {
{ '.',',','!','?',' ' },
{ 'a','b','c' },
{ 'd','e','f' },
{ 'g','h','i' },
{ 'j','k','l' },
{ 'm','n','o' },
{ 'p','q','r','s' },
{ 't','u','v' },
{ 'w','x','y','z' },
};
... | 0 | 20,348,448 |
#include <string>
#include <iostream>
using namespace std;
int main()
{
string str;
int count[26] = {0};
while(cin >> str)
for(auto c : str)
if(isalpha(c)) ++count[tolower(c) - 'a'];
for(int i=0; i<26; ++i)
cout << (char)('a'+i) << " : " << count[i] << '\n';
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
long l... | 0 | 67,158,194 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
vector<int> grade(n);
for(int i=0; i<n; i++){
cin >> grade[i];
}
sort(grade.begin(), grade.end());
int dm... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(v) (v).begin(),(v).end()
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<P>>;
int main() {
int N;
cin >> N;
Graph G(N);
rep(i, N-1) {
int a, b, c;
cin >> a >> b... | 0 | 78,183,218 |
#include<bits/stdc++.h>
using namespace std;
int main() {
long long N,K;cin>>N>>K;long long M=0;
map<long long,long long>mp;
for(int X=0;X<N;X++){
int A,B;cin>>A>>B;
mp[A]+=B;
}
for(auto p:mp){
long long A=p.first;long long B=p.second;M+=B;
if(M>=K){
cout<<A<<endl;break;
}
}
} | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pi... | 0 | 28,011,763 |
#include <iostream>
using namespace std;
int main() {
int k, a, b;
cin >> k >> a >> b;
if (a % k == 0) cout << "OK" << endl;
else if (a + (k - a % k) <= b) cout << "OK" << endl;
else cout << "NG" << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf ... | 0 | 60,999,670 |
#include<bits/stdc++.h>
using namespace std;
int main() {
map<int, long long>mp;
int n; cin >> n;
long long k; cin >> k;
while (n--) {
int num, cop; cin >> num >> cop;
mp[num] += cop;
}
for (auto it : mp) {
if (k <= it.second) return cout << it.first, 0;
k -= it.second;
}
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int INF=100100100100100;
vector<pair<char,int>> RL_S(strin... | 0 | 14,828,454 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(void) {
ll n, k;
cin >> n >> k;
vector<P> a(n);
rep(i, n) {
cin >> a[i].first >> a[i].second;
}
sor... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int H,W;
cin >> H >> W;
vector<vector<char>> nurinuri(H,vector<char>(W));
vector<vector<int>> step(H,vector<int>(W,-1));
queue<pair<int,int>> que;
rep(i,H){
rep(j,... | 0 | 87,330,582 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#defi... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set... | 0 | 56,665,170 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
int main(){
int n;
while(cin>>n&&n){
int ans = INF;
vector<int> a(n);
... | #pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (... | 0 | 94,133,663 |
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans=0, tmp=0;
vector<ll> A(MAXN, 0);
string S;
signed main(){
cin >> S;
vector<ll> dp1(S.size()+1,1), dp2(S.size()+1,0);
for(int i=1;i<=S.size();i++) {
if(S[i-1]=='0') {
... | #include <bits/stdc++.h>
class UnionFind{
private:
std::vector<int> parent;
std::vector<int> size;
public:
UnionFind(int N){
parent.resize(N);
size.resize(N);
for(int i = 0; i < N; i++){
parent[i] = i;
size[i] = 1;
}
}
int root(int x){
... | 0 | 70,613,398 |
#include <iostream>
using namespace std;
int distance(int a, int b, int c, int d) {
return abs(a-c) + abs(b-d);
}
int main() {
int n, m;
cin >> n >> m;
int a[n], b[n], c[m], d[m];
for (int i=0; i<n; i++) {
cin >> a[i] >> b[i];
}
for (int i=0; i<m; i++) {
cin >> c[i] >> d[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)... | 0 | 13,646,026 |
#include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
ty... | #include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long LL;
int Q;
LL a,b;
int main(){
scanf("%d",&Q);
while(Q--){
scanf("%lld%lld",&a,&b);
if(a==b) printf("%lld\n",a*2-2); else{
if(a>b) swap(a,b);
LL m=sqrt(a*b),t=(a*b-1)/m-1;
printf("%lld\n",m-1+t);
... | 0 | 72,565,895 |
#include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);
int n;
cin>>n;
vector<int> ... | #include <iostream>
#include <cmath>
#include <climits>
#include <algorithm>
#include <list>
#include <queue>
using namespace std;
#define MAX 1000000
#define INF (INT_MAX/2)
vector<int> G[MAX];
list<int> out;
bool V[MAX];
int N;
int indeg[MAX];
void bfs(int s){
queue<int> que;
que.push(s);
V[s] = true;
while(!... | 0 | 89,754,421 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
char func(char cur, char nbr, char info) {
if (cur == 'S') {
if (info == 'o') {
return nbr;
} else {
return 'W' + 'S' - nbr;
}
} else {
if (info == 'o') {
return 'W' + 'S' - nbr;
} else {
return nbr;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 1000000007;... | 0 | 36,142,264 |
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define mod 1000000007
using namespace std;
long long x,y;
int main()
{
scanf("%lld%lld",&x,&y);
if(abs(x-y)<=1)
{
puts("Brown");
}
else
{
puts("Alice");
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = ll(1e9)+7;
int main(){
ll N;
cin >> N;
set<ll> detected;
vector<ll> T(N);
detected.insert(0);
for(int i=0;i<N;i++){
cin >> T[i];
if(i>0&&T[i]>T[i-1]){
detected.insert(i);
}
... | 0 | 91,588,104 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
#define FOR(i, m, n) for (int i =... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 998244353;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define rep(i,n) for(ll i=(ll)0; i<(ll)n; i++)
#define REP(i,m,n) for(ll i=(ll)m; i<(ll)n; i++)
#define... | 0 | 66,383,289 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#define rep(i,a) for... | 0 | 19,680,986 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
int main() {
string L;
cin >> L;
int n = L.size();
vector<ll> dp0(n + 1, 0), dp1(n + 1, 0);
dp1[0] = 1;
ll MOD = 1e9 + 7;
rep(i, n) {
if (L[i] == '0') {
dp1[i + 1] = ... | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
long long n,a[200005],i,total=0,min[200005],mn;
cin>>n;
mn=10000000000;
for(i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]<mn)
{
mn=a[i];
}
min[i]=mn;
}
for(i=1;i<=n;i++)
... | 0 | 11,937,672 |
#include <bits/stdc++.h>
#define MAX 1000000
#define MOD 1e9
#define pb push_back
#define pairs pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pairs>
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define endl '\n'
using namespace std;
#define FastInput ios_base::sy... | # include <algorithm>
# include <cassert>
# include <cctype>
# include <cstdio>
# include <cstdlib>
# include <cstring>
# include <cmath>
# include <iostream>
# include <map>
# include <queue>
# include <set>
# include <sstream>
# include <stack>
# include <string>
# include <vector>
# include <iomanip>
# define rep(i,... | 0 | 51,284,233 |
#include <iostream>
#include <string>
#include <queue>
#include <algorithm>
using namespace std;
int main() {
int x[4], y[4], dx ,dy;
bool a = false, b = false;
cin >> x[0] >> y[0] >> x[1] >> y[1];
dx = x[1] - x[0];
dy = y[1] - y[0];
if (dx > 0) a = true;
if (dy > 0) b = true;
dx = abs(dx);
dy = abs(dy);
if (... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define all(x) (x).begi... | 0 | 26,041,659 |
#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;
int main(){
int m,nmin,nmax;
while(true){
cin>>m>>nmin>>nmax;
if(m==0)break;
int cnt=0;
int t=0;
int gap=0;
vector<int> p(m);
for (int i = 0; i < m; ++i) {
cin>>p[i];
}
for (int i = ... | 0 | 7,974,536 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); ++i)
using ll = long long;
using pll = pair<ll,ll>;
const ll INF64 = 1LL << 60;
const int INF = (1 << 29);
int main(){
string s; cin >> s;
string t; cin >> t;
int n = s.size();
int m = t.size();
string tmp = s;
rep... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(){
const long long INF = 1LL << 60;
long long N;
cin ... | 0 | 33,515,025 |
#include <iostream>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
int d[21];
int DP[50001];
for (int i = 0;i < m;i++) {
cin >> d[i];
}
for (int i = 0;i < n+1;i++) {
DP[i] = 100000;
}
DP[0] = 0;
for (int i = 0;i < m;i++) {
for (int j = 0; j < n-d[i]+1; j++) {
if (DP[j + d[i]] > DP[j] + 1)... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 0 | 69,444,323 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n[5];
for(int i=0;i<5;i++)
cin >> n[i];
sort(n,n+5,greater<int>());
for(int i=0;i<5;i++){
cout << n[i];
if(i==4) break;
cout << ' ';
}
cout << endl;
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned i... | 0 | 90,355,724 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
const int MOD = 1e9+7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<in... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define PER(i, n) for (int i = (n-1); i >= 0; --i)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(AL... | 0 | 67,990,953 |
#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() {
string s;
cin >> s;
int count=0;
for(int i=0;i<s.size();i+=2){
if(s.at(i)=='0')count++;
}
for(int i=1;i<s.size();i+=2){
if(s.at(i)=='... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
... | 0 | 28,796,150 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statis... | #ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#define NDEBUG
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
int main() {
large m, k;
cin >> m >> k;
if (m == 0) {
if (k == 0) {
printf("0 0\n");
return 0;
... | 0 | 82,324,783 |
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<ll>;
const int maxn = 5050, mod = 1e9 + 7;
ll solve(ll n, ll x) {
if(x == 0 || x == n) return 0;
ll l = ... | # include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
# include <bitset>
# include <map>
# include <queue>
# include <ctime>
# include <stack>
# include <set>
# include <list>
# include <random>
... | 0 | 64,892,571 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
int main() {
int n; cin >>n;
int a[212345];
rep(i,n) cin >>a[i];
int ans[512345];
int left = 212345, right = left+1;
rep(i,n){
if(i%2==(n-1)%2) ans[left--]=a[i];
else ans[right++]=a[i];
}... | #include <bits/stdc++.h>
#include <utility>
#include <vector>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for ... | 0 | 98,731,770 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
#define chmax(x,y) (x = max(x, y))
void solve(); int main() { solve(); return 0; }
void solve() {
set<int> S;
loop(i,0,3) {
int a;
cin >> a;
S.insert(a);
}
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N=0,cnt=0;
cin>>N;
while(N!=0){
if((N%10)==7){
cnt++;
}
N=N/10;
}
if(cnt>0){
cout<< "Yes";
}
else{
cout<< "No";
}
return 0;
} | 0 | 74,943,979 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
pair<int,int> a[100050];
void solve(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i].first);
a[i].second=i;
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++){
printf("%d ",a[i].second);
}
}
signed main(){
int t=1;
for(int i=1... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
while(true){
int n,k,max=-1e9,sum=0;
cin >> n >> k;
if(n==0) break;
int ar[n];
for(int i = 0;i<n;i++){
int a;
cin >> a;
ar[i]=a;
}
for(int i=0;i<k;i++){
sum += ar[i];
}
... | 0 | 83,148,567 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
using namespace std;
int main(){
int n,z,w,a[2005];
cin>>n>>z>>w;
for(int i=1;i<=n;i++)cin>>a[i];
if(n==1){
cout<<llabs(a[n]-w);
}
else{
cout<<max(llabs(a[n]-a[n-1]),llabs(a[n]-w));
}
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 90,762,125 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
int main(){
ll A,B,C,K;
cin>>A>>B>>C>>K;
if(K%2==0){
cout<<A-B<<endl;
}
if(K%2!=0){
cout<<B-A<<endl;
}
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<cmath>
using namespace std;
#define rep(i, n) for(long int i = 0; i < n; i++)
int main(){
long int n, k;
cin >> n >> k;
long int ans = 0;
long int num1 = 0;
long int num2 = 0;
if (... | 0 | 95,677,769 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using name... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(void){
int N, P;
cin >> N >> P;
int a[2] = {0,0};
rep(i,N) {
int A;
cin >> A;
a[A%2]++;
}
ll ans = 1;... | 0 | 8,063,713 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | 0 | 74,045,294 |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<long long> a, b, v;
long long solve();
int main() {
cin >> n;
a.resize(n);
for (auto& p : a) cin >> p;
b.resize(n);
for (auto& p : b) cin >> p;
cout << solve() << endl;
return 0;
}
long long solve() {
long long res = 0, cnt = 0;
for (int i = ... | #include <iostream>
#include <cstdio>
using namespace std;
int G[110][110];
int n;
int u, k, v;
void Hyoji(int N) {
for(int i=0; i<N; i++) {
for(int j=0; j<N; j++) {
printf("%d", G[i][j]);
if (j < N-1) {
printf(" ");
}
}
printf("\n");
}
}
int main() {
fill(&G[0][0], &G[0][0]+110*1... | 0 | 100,649,831 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,0,n)
#define _rrange(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);--i)
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | 0 | 57,204,939 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | #include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long U... | 0 | 39,729,285 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
int N, M;
cin >> N >> M;
vector <P> p(N);
rep(i,N) cin >> p[i].first >> p[i].second;
sort(all(... | #include <bits/stdc++.h>
using namespace std;
int main()
{
vector<string> w;
int n;
cin >> n;
string prev;
cin >> prev;
w.push_back(prev);
for (size_t i = 0; i < n - 1; i++)
{
string s;
cin >> s;
if (s[0] != prev[prev.length() - 1])
{
cout << "... | 0 | 2,140,234 |
#include<iostream>
#include<cstdio>
using namespace std;
int x,y;
int main(){
cin>>x>>y;
if(x==y){cout<<"a == b"<<endl;}
if(x<y){cout<<"a < b"<<endl;}
if(x>y){cout<<"a > b"<<endl;}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int dx = x2 - x1, dy = y2 - y1;
int x3 = x2 - dy, y3 = y2 + dx;
int x4 = x3 - dx, y4 = y3 - dy;
cout << x3 << " " << y3 << " " << x4 << " " << y4 << endl;
return 0;
} | 0 | 82,276,174 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
typedef long long ll;
using namespace std;
int solve(int n,int k){
int a[100000];
ll sum=0,ans=0;
for(int i=0;i<k... | #include <bits/stdc++.h>
int main() {
char str[1024];
char ope[256];
char obj[1024];
int q;
int a, b;
char temp;
scanf("%s", str);
scanf("%d", &q);
for(int i = 0; i < q; ++i) {
scanf("%s", ope);
if( strcmp("replace", ope) == 0 ) {
scanf("%d %d", &a, &b);
scanf("%s", obj);
for... | 0 | 49,579,468 |
#include<bits/stdc++.h>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
const int N=1e5+5;
#define ll long long
#define inf 0x3f3f3f3f
#define mem(x)... | #include<bits/stdc++.h>
using namespace std;
int main() {
ios_base :: sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
vector<int> x(3);
for(int i=0; i<3; i++){
cin >> x.at(i);
}
sort(x.begin(), x.end());
int cnt = 0;
cnt+=x.at(2)-x.at(1);
if((x.at(2)-(x.at(0)+cnt))%2==1)... | 0 | 14,547,710 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
const double PI = acos(-1.0);
#define rep(i, ... | #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)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 52,659,103 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N,K;
ll A[1001];
ll C[64];
bool ng[1000000];
int main(){
cin >> N >> K;
for(int i=1;i<=N;i++) cin >> A[i];
for(int i=0;i<N;i++) A[i+1] += A[i];
vector<ll> v;
for(int i=0;i<N;i++){
for(int j=i+1;j<=N... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,ans=0,pos;cin>>n;long long ar[n];
for(int i=0;i<n;i++){cin>>ar[i];}
for(int i=0;i<n-1;i++)
{
if(ar[i]>ar[i+1])
{
ans+=ar[i]-ar[i+1];
ar[i+1]=ar[i];
}
}
cout<<ans<<endl;
} | 0 | 42,879,434 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | #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++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> Pl... | 0 | 65,877,651 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string buf;
int table[] = {0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0}, state, c;
while(cin >> buf){
c = 0;
if(buf[0] == '#') break;
state = table[buf[0] - 'a'];
for(int i = 1;i < buf.length();++i){
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define In_The_Name_Of_Allah_The_Merciful ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define Alhamdulillah return 0;
#define all(v) v.begin(),v.end()
#define debug(n) cerr << "[" << #n << " = " << n << "]" << endl
void Suhaib_Saw... | 0 | 89,368,545 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
rep(i,n){
if(s[i] != s[i-1]) ans ++;
}
cout << ans << endl;
} | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 0 | 64,706,089 |
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
char str[1001][1001] ;
int j = 0;
for ( int i = 0; i < 1000; i++ )
{
cin >> str[i];
if ( str[i][0] == '0' )
{
break;
}
else
{
j++;
}
}
for ( int i = 0; i < j; i++ )
{
int sum = 0;
for ( int k = 0; k < s... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1e6 + 10;
int main(){
ll a,b,c,d;
ll sum;
cin>>a>>b>>c>>d;
sum = max(b * c,b * d);
sum = max(sum,a * c);
sum = max(sum,a * d);
cout<<sum<<endl;
return 0;
} | 0 | 53,766,384 |
#include <iostream>
#include <cstdio>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <string>
#include <list>
#include <fstream>
#include <iomanip>
#include <array>
#include <map>
#include <queue... | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main()
{
ll n;
cin >> n;
int input[n];
... | 0 | 8,205,684 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll q,a,b,cnt,p,l;
int main()
{
cin>>q;
while(q--){
cin>>a>>b;
p=a*b;
l=sqrt(p);
if(l*(l+1)<p) cnt=2*(l-1)+1;
else cnt=2*(l-1);
if(l*l==p&&a!=b) cnt--;
if(a*b==4) cnt=1;
cout<<cnt<<endl;
}
} | #include <bits/stdc++.h>
#include <algorithm>
#include <string>
#include <iostream>
#include <cmath>
using namespace std;
int h[1000000];
int dp[1000000];
int cost(int x,int y){
if(x==y)
return 0;
if(dp[x]!=-1)
return dp[x];
int c=abs(h[x]-h[x+1])+cost(x+1,y);
if(x+2<=y)
... | 0 | 84,621,653 |
#include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespac... | bool DBG = false;
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using bint = boost::multiprecision::cpp_int;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i... | 0 | 63,833,538 |
#include <bits/stdc++.h>
#define INF 1e9
#define MOD 1000000007
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main(void) {
ll N;
cin >> N;
if(N%2 == 1){
cout << 0 << endl;
return 0;
} else {
ll ans = 0;
ll div = 10;
while (N >= div)
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, a, b, pos1, pos2;
long long dp[3][4000] = {}, ans = 0;
string s;
cin >> n;
cin >> s;
ans = 0;
for(int i=0 ;i<n ;i++ ) {
if(s[i] == 'R') {
dp[0][i] = 1;
}
else if(s[i] == 'B') {
... | 0 | 60,614,157 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll H,W,D;
cin >> H >> W >> D;
vector<vector<ll> > grid(H, vector<ll>(W));
vector<pair<... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 16,075,441 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ... | 0 | 78,675,538 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N);
for(int n=0; n<N; n++) {
cin >> A[n];
A[n] -= (n+1);
}
sort(A.begin(), A.end());
long long int ans=0;
for(int n=0; n<... | #include <bits/stdc++.h>
#define MAX 100003
#define MODULO 1000000007
using namespace std;
vector<int> grafo[MAX];
long long dp[MAX][2];
long N;
void LIS(int vAtual, int vPosterior){
dp[vAtual][0] = dp[vAtual][1] = 1;
for(int i = 0; i < grafo[vAtual].size(); i++){
int elemento = grafo[vAtual][i];
... | 0 | 76,528,010 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main(){
int X;
cin >> X;
int rank = 8-(X-400)/200;
cout << rank << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int t, k;
int check[4];
for(int i = 0; i < 4; i++){
check[i] = 0;
}
for(int i = 0; i < 3; i++){
cin >> t >> k;
check[t - 1]++;
check[k - 1]++;
}
int flag_1 = 0;
int flag_2 = 0;
for(int i = 0; i <... | 0 | 43,760,201 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
using namespace std;
#define mod (1e9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) x... | 0 | 29,236,936 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <string>
#include <cmath>
using namespace std;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#define INT_MAX 2147483647
map<int, int> mp2;
int dfs(int count, vector<int> A, int sum, int targetValue, int minCo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1ll<<60;
int main(int argc, char **argv)
{
string s; cin >> s;
deque<char> d;
for (auto &e : s)
d.push_back(e);
ll res{0};
while (d.size() > 1)
{
char f = d.front();
char b = d.back();
if ... | 0 | 68,539,751 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define MOD 1000000007
template<class T> inline bool chma... | #include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
private:
... | 0 | 82,174,100 |
#include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
int tmp;
while ( a%b != 0 ) {
tmp = b;
b = a % b;
a = tmp;
}
return b;
}
int lcm(long long a, long long b) {
return a * b / gcd(a, b);
}
int main() {
int n, m;
cin >> n >> m;
long long a[n];
long long t;
ci... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
#define sort(s) sort(s.begin(),s.end())
#define reverse(s) reverse(s.begin(),s.end())
ll gcd(ll a, ll b) {
return b ? gcd(b, a%b) : a;
}
ll lcm(ll a, ll b) {
return ... | 0 | 33,864,036 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <string.h>
#include <tuple>
#include <vector>
#define REP(i,x) for(int i{ 0 }; i < (int)(x); i++)
#define REPC(i,x) for(int i{ 0 }; i <= (int)(x); i++)
#define RREP(i,x) for(int i{... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
int main() {
char str[21]={0};
char result[21]={0};
int offset;
cin >> str;
for (int i=20; i>=0; i--)
{
if (str[i]!=0)
{
offset = i;
break;
}
}
for (int i=0; i<=... | 0 | 61,360,191 |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int z,b,i,e;
while(~scanf("%d",&z))
{
z=z/3;
printf("%d\n",z);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define vll vector<ll>
#define vllv vector<vector<ll>>
#define sz size()
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define fast ios_base::sync_with_stdio(0); cin.tie(... | 0 | 16,499,626 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.