code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int INF = 2000000001;
int n;
scanf("%d", &n);
int H[n + 1];
for (int i = 1; i <= n; ++i)
H[i] = INF;
for (int i = 1; i <= n; ++i) {
int key;
scanf("%d", &key);
H[i] = key;
}
for (int i = 1; i <= n; ++i) {
cout << "node " << i << "... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ldb n, m, d; cin >> n >> m >> d;
if (d == 0) printf... | 0 | 32,790,189 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int main(){
int n;
cin >> n;
vector<pii> vp;
for(int i = 0; i < n; i++){
int a, b;
cin >> a >> b;
vp.push_back({a+b, a});
}
sort(vp.rbegin(), vp.r... | #include <iostream>
using namespace std;
int h,w;
int main(){
while(true){
cin>>h>>w;
if(h==0&&w==0) break;
for(int i=0;i<h;++i){
if(i==0||i==h-1){
for(int j=0;j<w;++j){
if(j==w-1) {
cout<<"#"<<endl;
}else{
cout<<"#";
}
}
... | 0 | 47,818,523 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_N = 1000005;
ll A[MAX_N],Ac[MAX_N],c[MAX_N],D[MAX_N];
vector<ll> pri;
ll mygcd(ll a, ll b)
{
if (b == 0) return a;
return mygcd(b,a%b);
}
int main()
{
int N;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int r (int a, int b) {
return (a + b - 1) / b;
}
signed main () {
int n, d, a;
cin >> n >> d >> a;
vector < pair < int, int > > gays(n);
for (pair < int, int > &p: gays)
cin >> p.first >> p.second;
sort(gays.begin(), gays.end());
long long... | 0 | 13,651,616 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
map<int,int> m;
int n; cin>>n;
while(n--){
int a; cin>>a;
m[a]++;
}
int ans{};
for(auto i:m){
if(i.first<i.second)ans += i.second-i.first;
if(i.first>i.second)ans += i.second;
}
cout<<... | #include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
while((n%4!=0&&n% 7!=0)&&(n>=11)){
n-=11;
}
if(n%4==0||n%7==0){
cout<<"Yes\n";
}
else
{
cout<<"No\n";
}
} | 0 | 77,292,524 |
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<set>
#include<map>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#defi... | #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 | 43,767,979 |
#include "bits/stdc++.h"
#define _overload(_1, _2, _3, _4, name, ...) name
#define _rep1(Itr, N) _rep3(Itr, 0, N, 1)
#define _rep2(Itr, a, b) _rep3(Itr, a, b, 1)
#define _rep3(Itr, a, b, step) for (i64 (Itr) = a; (Itr) < b; (Itr) += step)
#define repeat(...) _overload(__VA_ARGS__, _rep3, _rep2, _rep1)(__VA_ARGS)
using ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using P = pair<int,int>;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
cons... | 0 | 67,042,702 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | #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() {
strin... | 0 | 22,871,831 |
#include <stdio.h>
#include <string.h>
int main(void) {
char x[1000] = "";
int sum;
do {
sum = 0;
scanf("%s", x);
for (int i = 0; i < strlen(x); i++) {
sum += (x[i] - '0');
}
if (sum < 1) break;
printf("%d\n", sum);
} while (true);
return 0;
} | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<numeric>
#include<limits>
#include <cstdint>
#include<stack>
#include<queue>
using namespace std;
#define ll long long int
#define rep(N) for(ll i=0;i<N;i++)
#define rep2(N1,N... | 0 | 20,808,182 |
#include<bits/stdc++.h>
using namespace std;
typedef pair< int,int > P;
int N;
vector< vector< int > > Edge;
vector< int > Csum;
void bfs(){
Csum.assign(N+1,-1);
queue< P > que;
que.push(P(0,0));
Csum[0] = 0;
while(!que.empty()){
int now = que.front().second;
int cost = que.front().first;
que.pop(... | #include<stdio.h>
int main()
{
char ar[105];
scanf("%s", ar);
for(int i = 0; ar[i] != '\0'; i++)
{
if(ar[i] == ',')
{
printf(" ");
}
else
{
printf("%c", ar[i]);
}
}
puts("");
return 0;
} | 0 | 100,392,723 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 64,627,576 |
#include <iostream>
#include <cmath>
using namespace std;
struct Point {
double x, y;
};
void printPoint(Point p) {
cout << fixed << p.x << " " << p.y << endl;
}
void KochCurve(Point p1, Point p2, int rec, int n) {
if (rec < n) {
Point s, t, u;
double deg = 60.0*(M_PI/180.0);
s.x = (2.0 * p1.x + 1.0 *... | #include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) ((a) / gcd(a,b)) * (b)
#define all(x) x.begin(),x.end()
#define ll long long
#define ull unsigned long long
#define VI vector<int>
#define VLL vector<ll>
#define VS vector<string>
#define MPII map<int, int>
#define SET set<int>
#... | 0 | 44,696,825 |
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
const long M = 1046527;
const long NIL = -1;
const long L = 14;
string H[M];
long getChar(char ch){
if (ch == 'A') return 1;
else if (ch == 'C') return 2;
else if (ch == 'G') return 3;
else if (ch == 'T') return 4;
else ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cstdio>
#define REP(n) for(int i = 0;i < n;i++)
#define LLREP(n) for(long long int i = 0;i < n;i++)
typedef long long int ll;
using namespace std;
#define MAX_A 1000000007
double vector_2nd(double a,dou... | 0 | 98,291,583 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll i,j,x,y,z,a[1010],b[1010],c[1010],k;
cin >> x >> y >> z >> k;
for(i=0;i<x;i++){
scanf("%lld",&a[i]);
a[i]*=-1;
}
for(i=0;i<y;i++){
scanf("%lld",&b[i]);
b[i]*=-1;
}
for(i=0;i<z;i++){
... | 0 | 67,718,847 |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> A(N), B(N);
rep(i,0,N-1) cin >> A[i] >> B[i];
ll p = 0;
for (ll i = N-1; 0 <= i; --i)
{
ll d = A[i] + p;
if (d % B[i] != 0)
{
p += B[i] -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> data.at(i).at(j);
}
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (d... | 0 | 61,985,144 |
#include<bits/stdc++.h>
#define lld long long int
#define pb push_back
#define in insert
#define mod 1000000007
#define pi 3.14159265358979
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin>>s;
lld len=s.size();
char t[len],u[len];
for(lld i=0;i<le... | #include<bits/stdc++.h>
using namespace std;
int fin(vector<int> &f,int v){
if(f.at(v)==f.size())
return v;
f.at(v)=fin(f,f.at(v));
return f.at(v);
}
void uni(vector<int> &f,vector<int> &h,int x,int y){
if(h.at(x)>h.at(y)){
uni(f,h,y,x);
return;
}
if(x==y)
return;
f.at(x)=y;
h.at(y)=max(... | 0 | 76,136,839 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int h,n;
cin >> h >> n;
int attack = 0;
rep(i,0,n) {
int a;
cin >> a;
attack += a;
}
if (attack >= h) {
cout << "Yes" << endl;
} else {... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
long long add(long long a, long long b){
... | 0 | 27,761,524 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int m, k;... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
#define X first
#define Y second
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double PI = 3.14159265358979;
P mp[90090];
ll ans[9009... | 0 | 95,549,739 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string s, t;
cin >> s >> t;
int cnt = 0;
rep(i, 3) {
if(s[i] == t[i]) cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int N = 100;
... | 0 | 57,496,552 |
#include <bits/stdc++.h>
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 chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll N;
int main(){
ll N;
cin >> N;
vector<ll > idx(N+2, 0);
for(ll i = 1; i <= N; i++){
ll t; cin >> t;
idx[t] = i;
}
ll ans = 0;
multiset<ll > usedIdx;
usedIdx.insert(0);
usedIdx.insert(0);
usedId... | 0 | 223,068 |
#include <algorithm>
#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()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
cin.tie(0);
... | #include <iostream>
#include <vector>
using namespace std;
static const int FLOORS = 3;
static const int BUILDINGS = 4;
static const int ROOMS = 10;
class Building {
public:
vector< vector<int> > build;
Building() {
for(int i=0; i < FLOORS; i++) {
vector<int> tmp;
for(int j=0; j ... | 0 | 7,733,929 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie();
int n;
int x = 0 , y = 1;
cin >> n;
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
string s, p;
int flg=0;
cin >> s;
cin >> p;
s+=s;
int cnt=0;
int cnt2=0;
for(int i=0; i<s.size(); i++){
if(s[i] == p[cnt]){
for(int j=0; j<p.size(); j++){
if(s[i+j... | 0 | 1,521,268 |
#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
typedef long long ll;
const int maxn=100000+10;
int x[maxn],xx[maxn],w[maxn];
int i,j,k,l,r,s,t,n,m;
ll c;
int main(){
scanf("%d%d%d",&n,&l,&t);
fo(i,1,n) scanf("%d%d",&x[i],&w[i]);
fo(i,1,n){
if (w[i]==2)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i, n) for (int i = 0; i < n; i++)... | 0 | 56,957,795 |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define dbg(x) cout<<#x<<":"<<x<<endl
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
double dp[44444][222];
int main(){
ll n,t[111],v[111];
... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | 0 | 67,748,807 |
#include<iostream>
#include<string>
#include<cctype>
using namespace std;
string shuffle(string word1,int h){
string head = word1.substr(0,h);
string tail = word1.substr(h,word1.size()-h);
return tail + head;
}
int main(){
int x,y;
string word;
while(1){
cin >> word;
if(word=="-"... | #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 | 83,664,443 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <iostream>
using namespace std;
int main () {
int n, a, b, c, x;
while (cin >> n >> a >> b >> c >> x, n || a || b || c || x) {
int y[n];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
int frame = 0;
for (int i = (y[0] == x); i < n; i++) {
do {
x = (a * x + b) % c;
frame++;
if (frame... | 0 | 77,019,447 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main(){
int h,w,a,b;
cin>>h>>w>>a>>b;
vector<vector<int>> ans(h,vector<int>(w));
rep(i,b)rep(j,a) ans[i][j]++;
for(int i=b;i<h;i++)for(int j=a;j<w;j++) ans[i][j]++;
rep(i,h... | #include <iostream>
using namespace std;
int main(int argc, char* argv[]) {
int N, M, K;
cin >> N >> M >> K;
if (K == 0) {
cout << "Yes" << endl;
return 0;
} else if (K % N == 0 && K / N <= M) {
cout << "Yes" << endl;
return 0;
} else if (K % M == 0 && K / M <= N) {
cout << "Yes" << endl;
... | 0 | 26,528,938 |
#include <iostream>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
for(int i=1; i<1010; i++){
if(a == i*8/100 && b == i*10/100){
cout << i << '\n';
return 0;
}
}
cout << -1 << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, m, k;
int main()
{
scanf("%d%d", &m, &k);
if(m == 0)
{
if(k == 0)
puts("0 0");
else
puts("-1");
return 0;
}
if(m == 1)
{
if(k == 0)
puts("0 0 1 1");
else
puts("-1");
return 0;
}
n = (1 << m);
if(k >= n)
{
puts("-1");
return 0;
}... | 0 | 5,423,593 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define mod ((int)1e9+7)
#define lim 1000000000000000007
#define lim1 18446744073709551615
#define sq(a) ((a)*(a))
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mms(v,i) memset(v,i,sizeof(v))
#d... | 0 | 23,100,963 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <time.h>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <string.h>
#define sf scanf
#define pf printf
#define lf double
#define ll long... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, K, R, S, P;
cin >> N >> K >> R >> S >> P;
string T;
cin >> T;
const int64_t L = static_cast<int64_t>(T.length());
int64_t result = 0;
... | 0 | 22,349,628 |
#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int R, G;
cin >> R >> G;
cout << R*R - G << endl;
return 0;
} | #include <bits/stdc++.h>
#define mem(s,t) memset(s,t,sizeof(s))
#define pb(s) push_back(s)
#define inf 0x3f3f3f3f
#define mn 100010
typedef long long ll;
using namespace std;
vector<ll> p[50];
ll a[1010],sum[1010];
int n,k,now;
ll ans;
void work()
{
ll pp=42,nowp;
int i,j;
while (pp>=0)
{
nowp=1... | 0 | 2,178,691 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if ( abs(a - c) <= d || (abs(a-b) <= d && abs(b-c) <= d) ) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return (0);
} | #include <iostream>
using namespace std;
int main(){
long long n,y;
cin >> n >> y;
long long i,j;
for(i=0;i<=n;i++){
for(j=0;j<=n-i;j++){
if((y-1000*i-5000*j)/10000==n-i-j && (y-1000*i-5000*j)%10000==0 && (y-1000*i-5000*j)>=0){
cout << n-i-j << " " << j << " " << i << "\n";
return 0;
... | 0 | 94,383,243 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MAX_V = 1;
const ll MAX_E = 1;
struct edge {
ll from, to, cost;
};
edge ES[MAX_E];
vector<edge> G[MAX_V];
ll d[MAX_V];
ll prev_path[MAX_V];
ll V, E;
const ll MOD = (ll) 1e9 + 7;
const int MAX_INT = 1 << 17;
vector<bool> prime;
#define all(... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <stack>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ... | 0 | 8,475,532 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (int)(N); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
vector<long l... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long lo... | 0 | 80,784,078 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N,M;cin>>N>>M;
vector<int>a(N);
int sum=0;
rep... | #include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#d... | 0 | 38,819,027 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define db double
#define mod 1000000007
#define pb push_back
#define pp pair<int,int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repe(i,a,b)... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == 'A') {
int cnt = 0;
for (int i=2;i<S.size()-1;i++) {
if (S.at(i) == 'C') {
cnt++;
S.at(i) = tolower(S.at(i));
}
if(cnt == 1) {
... | 0 | 19,415,916 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B... | #include <bits/stdc++.h>
using namespace std;
void solve(int n, int k, vector<int>&a){
int needed = (log(n) + 1.0)/log(1.34);
needed = min(needed, k);
for(int kk = 0; kk < needed; kk++){
vector<int>B(n, 0);
for(int i = 0; i < n; i++){
int l = max(0, i - a[i]);
int r =... | 0 | 12,516,293 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin>>H>>W;
vector<vector<char>> table(H, vector<char>(W));
vector<bool> deleted_row(H, true);
vector<bool> deleted_col(W, true);
for(int i=0;i<H;i++) {
for(int j=0;j<W;j++){
cin>>table.at(i).at(j);
if(table.at(i).at(j)=='#'... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define pb push_back
#define ull unsigned long long
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define mat vector<vector<ll>>
mat cn(ll n, ll m){return v... | 0 | 86,133,577 |
#include<iostream>
#include<algorithm>
#include<map>
#include<queue>
using namespace std;
#define MAX 1005
int h, w, n;
char city[MAX][MAX];
struct node{
int x,y,time;
} start;
int direc1[4] = { -1,0,1,0 }, direc2[4] = { 0,1,0,-1 };
map<int,int>visited;
void dfs(char end) {
queue<node> que;
que.push(start);
visited... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll H, W, ans=0, tmp=0;
queue<pair<ll,ll>> Q;
vector<vector<ll>> color;
void bfs() {
while(!Q.empty()) {
pair<ll,ll> p = Q.front();
Q.pop();
if(p.first+1<H&&color[p.first+1][p.sec... | 0 | 57,640,438 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, int> pli;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n,i,j,ans=1;
cin>>n;
ll arr[n];
for(i=0; i<n; i++)
cin>>arr[i];
for(i=1; i<n; i++)
{
bool flag=1;
for(j=0; j<i; j++)
{
if(arr[i]>=arr[j]);
else
{
... | 0 | 23,882,029 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
... | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()
{
int N;
cin >> N;... | 0 | 86,583,611 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;retur... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | 0 | 95,719,750 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 87,414,217 |
#include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<llint>,greater<llint> > que;
priority_queue<llint> Que;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int ans=0... | #include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,... | 0 | 40,793,059 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
int main(){
std::string s; std::cin >> s;
for(int ... | #include<cstdio>
#include<iostream>
#include<vector>
using namespace std;
int main(void) {
int K;
scanf("%d", &K);
string S;
cin >> S;
if (S.length() <= K) {
cout << S << "\n";
} else {
cout << S.substr(0, K) << "..." << "\n";
}
return 0;
} | 0 | 35,352,316 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll ZERO = 0;
const ll INF = 9223372036854775807;
const ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll,ll> P;
int main() {
int N,K;
cin >> N >> K;
vector<P> vec(N);
for(int i = 0;i < N;i++) {
ll A,B;... | #include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#in... | 0 | 57,175,187 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<vector<double>> XY(N);
for(int i=0; i<N; i++){
double x, y;
cin >> x >> y;
XY[i] = {atan2(x, y), x, y};
}
sort(XY.begin(), XY.end());
double ans = 0;
for(int i=0; i<N; i++) for(int n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
static const int MAX=2000005;
int Heap[MAX];
int ppp;
void heapify2(int i){
if(i/2>0&&Heap[i]>Heap[i/2]){
swap(Heap[i],Heap[i/2]);
heapify2(i/2);
}
return;
}
void insertkey(int key){
ppp++;
Heap[ppp]=... | 0 | 79,425,001 |
#include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define ALL(x) x.begin(), x.end()
#define INF 0x3f3f3f3f
#define debug(x) cout << "##### " << x << endl;
typedef long long ll;
const int MOD = 1e9 + 7;
ll f[3050];
int main(){
int n;
cin >> n;
for(int i = 3; i <= n; ++i){
f[i... | #include<bits/stdc++.h>
using namespace std;
vector<vector<int>>G;
vector<bool>seen;
vector<int> cost;
void dfs(int v,int p=-1){
seen[v]=true;
if(v!=0)cost[v]+=cost[p];
for(auto next_v:G[v]){
if(next_v==p)continue;
if(seen[next_v])continue;
dfs(next_v,v);
}
}
int main(){
int n,q;
cin>>n>>q;
G.... | 0 | 91,109,236 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
ll i, temp,t, n,j, a[200600], ans, sum;
bool cond;
map<ll,ll>C;
map<ll,pair<ll,ll> >Ans;
vector<int>V;
bool vis[200010];
string s;
int main()
{
cin >> n;
for(i=0;i<n;i++)
{
cin >> temp;
a[i] = temp;
if(!vis[temp])
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | 0 | 54,153,155 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<pll> vpl;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define... | 0 | 47,178,817 |
#include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include<vector>
#include<iomanip>
#include<map>
#include <queue>
#include<cmath>
#include<cstdio>
#include<iomanip>
#include<set>
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define REP(i,n) for... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 99,052,558 |
#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();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 60,877,071 |
#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define sl set<ll>
#define vs vector<string>
#define vl vector<ll>
#define vi vector<int>
#define vpl vector<pair<ll,ll>>
#define pb push_back
#define PI 3.14159265358979323846
#define ll long long
#define ld long double
#define endl "\n"
#define rep(i... | #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void merge(int x, i... | 0 | 67,595,036 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int X,N;
cin >> X >> N;
vector<int> P(N);
for(int i=0;i<N;i++){
cin >> P.at(i);
}
int i=0;
while(true){
int A=X-i,B=X+i;
bool a=true,b=true;
for(int i=0;i<N;i++){
if(A==P.at(i)){
a=false;
}
}
if(a){
... | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <bitset>
using namespace std;
const long int INF = 1000000007;
int main(void)
{
long long N, K;
cin >> N >> K;
vector<int> a(N);
map<int, int> m;
for (int i = 0; i < N; i++)
{
... | 0 | 39,341,278 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
ll s;
cin >> s;
ll x1=s/1000000000+1;
ll x2=x1*1000000000-s... | #include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 998244353
#define INF 1<<30
#define LINF (ll)1<<62
#define MAX 510000
#define rep(i,n) for(ll i=0; i<(n); i++... | 0 | 21,246,286 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
char n[3];
for(int i = 0; i < 3; i++)
cin >> n[i];
for(int i = 0; i < 3; i++){
if(n[i] == '1')
n[i] = '9';
else if(n[i] == '9')
n[i] = '1';
}
for(int i = 0; i < 3; i++)
cout << n[i];
cout << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX/3
#define LLINF LLONG_MAX/3
#define MOD (1000000007LL)
#define MODA(a, b) a=((a)+(b))%MOD
#define MODP(a, b) a=((a)*(b))%MOD
#define inc(i, l, r) for(long long i=(l);i<(r);i++)
#define dec(i, l, r) for(long long i=(r)-1;i>=(l)... | 0 | 19,936,822 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#d... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N, A, B;
bool flag;
cin >> N >> A >> B;
if(B-A == 1){
cout << "Borys" << endl;
return 0;
}else{
while(1){
A++;
if(B-A == 1){
flag = true;
... | 0 | 20,979,150 |
#include <bits/stdc++.h>
#define int long long
#define ss second
#define ff first
using namespace std;
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
vector<pair<int,int>> primes;
set<int> nums;
for(int i=2; i*i <= n; i++){
if(n%i == 0){
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
#ifndef UTIL_HPP
#define UTIL_HPP
typedef ::std::int_fast64_t i64;
typedef ::std::uint_fast64_t u64;
typedef ::std::int_fast32_t i32;
typedef ::std::uint_fast32_t u32;
namespace tools {
template ... | 0 | 62,324,314 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<ll, ll>;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
using Graph = VV;
int Inf = (1 << 30)... | #include <bits/stdc++.h>
#define int long long
#define rng(i, l, r) for (size_t i = (l); i < (r); ++i)
#define rep(i, n) rng(i, 0, n)
#define gnr(i, l, r) for (size_t i = (r)-1; i >= (l); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
... | 0 | 61,874,607 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_e... | #ifndef DEBUG
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define fastio ios_base::sync_with_stdio(0)
#define untie cin.tie(0)
#define ms(a, b) memset(a, b, sizeof a)
#define m... | 0 | 36,841,373 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0; i<(int)n; i++)
#define rep2(i,a,n) for(long long i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using vll = vector<ll>;
using... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 2031;
const ll INF = 1e18;
void update(ll& x, ll y)
{
x = min(x, y);
}
int main()
{
ll dp[331][331][2];
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0;... | 0 | 53,424,583 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<map<int, int>> m(n);
for (int i = 0; i < n; ++i) {
string str;
cin >> str;
for (int j = 0; j < str.length(); ++j) {
m[i][str[j]-'a']+... | #include<bits/stdc++.h>
using namespace std;
struct UnionFind{
vector<int> r;
vector<int> count;
UnionFind(int N):r(N),count(N){
for(int i=0;i<N;i++){
r.at(i)=i;
count.at(i)=1;
};
}
int root(int x){
return r.at(x)==x?x:r.at(x)=root(r.at(x));
}
... | 0 | 88,921,721 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 | 54,233,215 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,ans,k;
ans=0;
cin>>n;
vector<long> vec(n);
vector<long> ko(0);
for(long i=0; i<n; i++){
cin>>vec.at(i);
}
for(long i=1; i<n; i++){
vec.at(i)=vec.at(i-1)+vec.at(i);
}
for(long i=0; i<n; i++){
ko.push_back(vec.at(i));
if... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q.r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long ... | 0 | 83,692,761 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define F(i,n) for(ll i=0;i<n;i++)
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define repp(i,a,b) for(ll i=a;i>=b;i--)
#define pb ... | #include<iostream>
using namespace std;
const int N=200100;
long long abs_(long long x)
{
if(x<0) x=-x;
return x;
}
long long ans,n,a[N],sum[N],sumd[N];
int main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;++i) cin>>a[i];
for(int i=1;i<=n;++i)
sum[i]=sum[i-1]+a[i];
for(... | 0 | 93,447,772 |
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define INF 2e9
using namespace std;
const int N=1e6+1;
const int mod=1e9+7;
ll fastexp(ll base,ll exp){
base%=mod;
ll ans=1;
while(exp>0){
if(exp&1){
ans*=base;
ans%=mod;
}
base*=base;
base%=mod;
exp/=2;
}
return ans;
}
ll gcd(ll a,ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define INIT(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | 0 | 51,651,161 |
#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define sl set<ll>
#define vs vector<string>
#define vl vector<ll>
#define vi vector<int>
#define vpl vector<pair<ll,ll>>
#define pb push_back
#define PI 3.14159265358979323846
#define ll long long
#define ld long double
#define endl "\n"
#define rep(i... | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
int *a = new int[n];
int max, t;
for (int i = 0; i < n; i++) {
cin >> t;
a[i] = t;
}
max = -1000000;
for (int j = 0; j < n; j++) {
for (int k = j, t = 0; k < n; k++) {
t += a[k... | 0 | 66,788,417 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
string s;
cin >> s;
int n = s.size();
int cnt = 0;
rep(i,n) if(s[i] == 'o') cnt++;
if(cnt+15-n>=8) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dx[] = {... | 0 | 8,791,526 |
#include <bits/stdc++.h>
using namespace std;
int main(){
list<int> lst;
int n;
cin >> n;
char query[100];
int key;
list<int>::iterator itr;
while(n--){
scanf("%s",query);
if(!strcmp(query,"insert")){
scanf("%d",&key);
lst.push_front(key);
}
if(!strcmp(query,"delete")){
s... | #include<functional>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<string>
#include<math.h>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
using namespace std;
const int INF=100000000;
char a[20][20];
in... | 0 | 90,150,443 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | #include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <math.h>
#include<bitset>
#include<stdio.h>
#include<iomanip>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int INF = 100000000;
bool isOK(int a... | 0 | 30,831,246 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int a, b, c,... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::vector<std::vector<ll> >
#define MODs 1... | 0 | 99,469,523 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void b_105(void) {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i+=2) {
int div_cnt = 0;
for (int j = 1; j <= i; j++) {
if (i % j == 0) div_cnt++;
}
if (div_cnt == 8)cnt++;
}
cout << cnt << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i,n) {
cin >> h[i];
}
int ans, cnt;
ans = cnt = 0;
rep(i,n-1) {
if(h[i] >= h[i+1... | 0 | 2,267,789 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = (int)1e9 + 7;
const... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
#include <utility>
#include <tuple>
#define INF 1000000000000
const long long MOD = 998244353;
using namespa... | 0 | 96,393,981 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
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 chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll mod= 1e9 + 7;
... | #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 | 27,344,890 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int T = 1;
while (T--) {
int n, m;
cin >> n >> m;
int ans = n * (n - 1) / 2 + m * (m - 1) / 2;
cout << ans << '\n';
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
char s[100];
char p[100];
int i;
int j;
int start;
cin >> s >> p;
i=0;
Roop:;
for(;s[i]!='\0';i++)
{
if(s[i]==p[0])
{
start=i;
goto Next;
}
}
cout << "No\n";
goto Exit;
Next:;
for(i=start,j=0;p[j]!='\0';j++ , i++... | 0 | 74,713,584 |
#include <bits/stdc++.h>
using namespace std;
int H, W, d;
char C[4] = {'R', 'G', 'B', 'Y'};
int main() {
cin >> H >> W >> d;
int cx, cy;
int color;
for(int iy = 0; iy < H; iy++) {
for(int ix = 0; ix < W; ix++) {
cx = ix + iy + 10000, cy = ix - iy + 10000;
color = (cx / d) % 2 + ((cy / d) % 2) * 2;
cout ... | #include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
using namesp... | 0 | 35,893,592 |
#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;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X,Y,Z,K;
cin >> X >> Y >> Z >> K;
vector<int64_t> A(X),B(Y),C(Z);
for ( int64_t i = 0; i < X; ++i){
cin >> A[i];
}
for ( int64_t i = 0; i < Y; ++i){
cin >> B[i];
}
for ( int64_t i = 0; i < Z; ++i){
... | 0 | 63,040,616 |
#include <iostream>
using namespace std;
int main() {
string Ans[6] = { "abc","acb","bac","bca","cab","cba" };
string S;
cin >> S;
for (int i = 0; i < 6; i++) if (S == Ans[i]) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
} | #include <iostream>
using namespace std;
int main(void){
int n = 0, m = 0, p = 0;
while(cin >> n >> m >> p){
if(n == 0){
break;
}
int allG = 0;
int plaier[100];
for(int i = 0; i < 100; i++){
plaier[i] = 0;
}
for(int i = 0; i < n; i+... | 0 | 97,416,829 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
#define _GLIBCXX_DEBUG
int main() {
ll N, M;
cin >> N >> M;
vector<bool> ac(N + 1);
vector<int> wa(N + 1);
for (ll i=0; i<M;i++){
ll problrem_id;
string result;
cin >> problrem_id >> result;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a,... | 0 | 58,007,269 |
#include<bits/stdc++.h>
using namespace std;
#define MAX 100001
#define MOD 1000000007
#define ll long long
#define ld long double
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
int main() {
fast;
int t = 1;
while(t--) {
ll n;
cin >> n;
vector<ll> v(n);
for(ll i=0;i<n;i++... | #include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b)
{
if (a % b == 0)
{
return(b);
}
else
{
return(gcd(b, a % b));
}
}
int main(void)
{
int n, x,ans;
cin >> n >> x;
vector<int> xx(n... | 0 | 16,601,220 |
#include "bits/stdc++.h"
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1;i >= 0; i--)
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sor... | #include <iostream>
using namespace std;
int main(){
int cnt=0,n,m,sum=0;
cin>>n>>m;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
for(int i=0;i<n;i++){
if(a[i]*4*m>=sum){
cnt++;
}
}
if(cnt>=m){
cout<<"Yes";
}
else cout<<"No";
} | 0 | 2,801,089 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, e, f, g;
cin >> a >> b;
ll c = min(a, b/2);
e = b - (c * 2);
if(e > 1)
f = e / 4;
cout << c + f << endl;
} | #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 | 51,539,932 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
#define int ll
const int INF=(int)2e18;
const int MOD = 1000000007;
const int PEG = 998244353;
long double pie=acos(-1);
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef pair< int, int > pii;
typedef... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string s, w, r;
int q, i, j, a, b;
cin >> s >> q;
for(i = 0; i < q; ++i){
cin >> w >> a >> b;
if( w == "replace" ){
cin >> r;
for( j = a; j <= b; ++j)
s[j] = r[j-a];
}else if( w == "print" ){
for( j = a; j <= b; ++j)
c... | 0 | 41,981,895 |
#include<cstdio>
using namespace std;
int a[200005];
int main(){
int n,i,j=1;
long long sum,ans=0;
int yhs;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
}
yhs=a[1];
sum=a[1];
for(i=1;i<=n;i++){
while(j<=n&&yhs==sum){
ans+=j-i+1;
j++;
sum+=a[j];
yhs^=a[j];
}
sum-=a[i];
yhs^=a[i];
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i, m, n) for (int i = (m); (i) < (n); ++(i))
using namespace std;
template <class T>
void setmax(T &a, T ... | 0 | 82,409,616 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
int main()
{
ll N,K; cin>>N>>K;
if(K==2) {cout<<N-1<<endl; return 0;}
ll ans=N/(K-1);
if(N%(K-1)>1) {ans++;}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
double sumbit=0;
double sumyen=0;
for(int i=0; i<N; i++){
double x;
string u;
cin >> x >> u;
if(u == "JPY"){
sumyen += x;
}else{
sumbit += x;
}
}
... | 0 | 91,337,760 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
using namespac... | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (t... | 0 | 32,376,706 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int x[n+1], y[n+1], t[n+1];
x[0] = y[0] = t[0] = 0;
for (int i = 1; i <= n; i++)
{
cin >> t[i] >> x[i] >> y[i];
}
bool ok = true;
for (int i = 1; i <= n; i++)
{
if((t[i] - t[i-1]) < abs(x[i] - x[i-1]) + abs(y[i] - y[i-1]) || (t[i] -... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e5;
#define pi acos(-1)
#de... | 0 | 46,704,025 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#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(ll i = (m); i >= (n); i--)
#define ALL(c) (c).begin(), (c).end()
... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#defin... | 0 | 38,110,562 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a+c, min({a+d, b+c, b+d}));
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <utility>
#include <tuple>
#include <math.h>
#include <set>
#include <map>
using namespace std ;
using ll = long long ;
using ld = long double ;
... | 0 | 20,789,900 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define all(obj) obj.begin(), obj.end()
#define db(x) cerr << #x << ":" << x << " "
#define dbl(x) cerr << ... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main(){
int n;
cin >> n;
vector<int> dp(100005,INF);
dp[0] = 0;
for(int i=0; i<100000; ++i){
dp[i+1] = min(dp[i+1], dp[i]+1);
for(int j=6; i+j<=100000; j*=6){
dp[i+j] = min(dp[i+j], dp[i] +1);
}
for(int j=9; i+... | 0 | 34,921,876 |
#include <iostream>
using namespace std;
int main()
{
int A[10000];
int a = 1;
for (int i = 0; a != 0; i++)
{
cin >> a;
A[i] = a;
}
for (int i = 0; A[i] != 0; i++){
cout << "Case " << i + 1 << ": " << A[i] << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
using P = pair<ld,ld>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<v<<"\n";
#define fi(v) get<0>(v)
#define se(v) get... | 0 | 72,854,255 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
const ll INF = 1LL<<60;
const ll MOD = 1e9+7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin>>n;
ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int q, h, S, D; cin >> q >> h >> S >> D;
int n; cin >> n;
int Q = 4 * q;
int H = 2 * h;
int L = min(min(Q, H), S);
Int ans;
if (2 * L > D) {
ans = ((... | 0 | 10,626,949 |
#include<iostream>
using namespace std;
int main(){
int W,H,x,y,r;
cin>>W>>H>>x>>y>>r;
if(x<W&&y<H){
if(x+r<W&&y+r<H){
if(x>0&&y>0){
cout<<"Yes"<<endl;
return 0;;
}
}
}
else{
cout<<"No"<<endl;
return 0;
}
if(x<=W&&y<=H){
if(x+r<=W&&y+r<=H){
if(x>0&&y>0){
cout<<"Yes"<<endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;cin>>n>>m;
vector<int>v(n);int o=0;
for(int i=0;i<n;i++){
cin>>v.at(i);o+=v.at(i);
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
int a=4*m;
o=(o+a-1)/a;
for(int i=0;i<m;i++){
if(v.at(i)<o){
cout<<"No"<<endl;
... | 0 | 13,336,880 |
#include<bits/stdc++.h>
using namespace std;
int main(){
double x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
double a=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
cout<<fixed<<setprecision(12);
double d=sqrt(a);
cout<<d<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<ll,ll> pll;
const ll mod = 1e9 + 7;
const ld PI = 3.1415926535897932384626;
const ld eps ... | 0 | 72,169,810 |
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | 0 | 69,386,655 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll vis[1000005];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll m,k;
cin>>m>>k;
ll n=pow(2,m);
if(k>=n||(k==1&&m==1)){
cout<<"-1";
exit(0);
}
else if(k==0){
... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 36,250,814 |
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... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
typedef long long ll;
int mod = 1000000007;
ll dp[100005];;
ll gcd(long long a,long long b){
if(b == 0)
return a;
else return gcd(b,a%b);
}
bool compare(pair<int,int>p1, pair<int,int>p2){
return p1.... | 0 | 9,789,083 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
long long n;
cin>>n;
n--;
cout<<(n*(n+1)/2)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
strin... | 0 | 90,425,493 |
#include <cstdio>
#define ll long long
int main() {
ll a, b, c, k;
scanf("%lld %lld %lld %lld", &a, &b, &c, &k);
if(a - b < -1000000000000000000 || 1000000000000000000 < a - b)
printf("Unfair\n");
else
printf("%lld\n", (a - b) * (1 - k % 2 * 2));
} | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
#include <queue>
#include <math.h>
#define ll long long
#define INF 100000000000
#define N 10000000
using namespace std;
int main(void){
int x,n;
cin>>x>>n;
int data[n];
for (int i=0; i<n; i++){
cin>>data[i];
}
int p,q;
... | 0 | 97,001,029 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b)for(int i=(int)(a);(i)<(int)(b);i++)
typedef unsigned long long ull;
typedef long long ll;
const int INF = 1001001001;
const ll MOD = 1e9 + 7;
using namespace std;
using P = pair<int,int>;
ll gcd(ll a, ll b) { re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 1e9 + 7;
int main(){
ll n; cin >> n;
ll dp[n + 1] = {0};
dp[0] = 1;
for(ll i = 3; i <= n; ++i){
for(ll j = 3; j <= n; ++j){
if(i - j >= 0){
dp[i] += dp[i - j];
dp[i] %= mod;
... | 0 | 76,398,519 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define mx 100001
#define eps 0.00000000... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 3,826,603 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.