code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
#include <cstdlib>
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; }
int N;
long long a[100010][3];
long long d... | #include <bits/stdc++.h>
using namespace std;
vector<int> tsort_Kahn(const vector<vector<int>>& g) {
const int V = g.size();
vector<int> indeg(V,0);
stack<int> S;
for(auto& u_out_edges : g)
for(auto& v : u_out_edges)
indeg[v]++;
for(int i=0; i<V; ++i)
if( indeg[i] == 0 )
S.push(i);
... | 0 | 86,036,011 |
#include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
#define int long long
#define double long double
const int INF = 1e18, MOD = 1e9 + 7;
int modpow(int x, int n) {
int ret = 1;
while (n > 0) {
if (n & 1) ret =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
const ll INFF = 1e18;
const ll MAXN = 510;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double INFD = 1E9;
const double EPS = 1e-9;
ll frek[200010];
ll tab[200010];
ll cnt(ll x)
{
return (x * (x - 1)) / 2;
}
int m... | 0 | 11,791,629 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
string X, Y;
int v[1001][1001];
int dp(string X, string Y) {
int n = X.size();
int m = Y.size();
for (int i = 0; i <= n; i++) {
v[i][0] = 0;
for (int j = 0; j <= m; j++) {
v[0][j] = 0;
}
}
for (int i = 1; i <= n; i++)... | #include <stdio.h>
int main()
{
char A, B, C;
scanf("%c%c%c", &A, &B, &C);
if(A==B && B!=C || A==C && C!=B || B==C && C!=A)
{
puts("Yes");
}
else {
puts("No");
}
return 0;
} | 0 | 68,290,481 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S ... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll n,k,a[200005],max=0;
cin >>k>>n;
rep(i,n){
cin>>a[i];
if(i>0){
if(max<a[i]-a[i-1]){
max=a[i]-a... | 0 | 92,682,279 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pairii;
const double pi=3.1415926535;
const ll mod=1000000007;
int main() {
ll h,w;cin>>h>>w;
if(h==1||w==1){cout<<1<<endl;
return 0;}
cout<<h*w/2+(h*w)%2<<e... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | 0 | 42,199,986 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 0 | 52,038,350 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | #include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>
#include <math.h>
#include <cmath>
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include<bitset>
#in... | 0 | 60,423,649 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void show(vector<ll>& vc)
{
for(auto it:vc)cout<<it<<" ";
cout<<endl;
}
#define M 300014
/**
typedef pair<ll, ll> pii;
#define x first
#define y second
pii extendedEuclid(ll a, ll b)
{
if(b == 0) return pii(1, 0);
else
{
p... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 25,529,206 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 18,934,027 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
string s;
cin >> s;
int cnt_0 = 0, cnt_1 = 0;
for (auto ch : s) {
if (ch == '0') {
cnt_0++;
} else {
cnt_1++;
}
}
cout << min(cnt_0, cnt_1) * 2 << '\n';
return 0;
} | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);... | 0 | 76,895,583 |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#include <ctime>
using namespace std;
typedef long long ll;
ll po[20];char opt[10];
inline bool Query(ll x){
printf("? %lld\n", x);
fflush(stdout);
scanf("%s", opt);
return opt[0] == 'Y';
}
int main(){
po[0] = 1;
for(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (scanf("%d", &x)==1) return x; el... | 0 | 63,087,756 |
#include <algorithm>
#include <iostream>
using namespace std;
#define SEQ 3
int main(){
int table[SEQ];
int i;
cin >> table[0] >> table[1] >> table[2];
sort(table, table+SEQ);
for (i = 0; i < SEQ-1; i++){
cout << table[i] << " ";
}
cout << table[SEQ-1] << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
using namespace std;
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else ... | 0 | 52,218,985 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c... | 0 | 350,887 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef unsigned long long ll;
int main()
{
int n... | #include <stdio.h>
#include <iostream>
using namespace std;
#define MAX_N 100000
#define NIL -1
struct Node {
int parent;
int left;
int right;
};
void print_node(Node nodes[], int i, int depth[]) {
printf("node %d: parent = %d, depth = %d, ", i, nodes[i].parent, depth[i]);
if(nodes[i].parent == NIL) {
pri... | 0 | 34,511,212 |
#include <bits/stdc++.h>
using namespace std;
char e[] = { 'A', 'C', 'T', 'G'};
int main() {
char b;
cin >> b;
int retp;
for(int i = 0; i < 4; i++) {
if(e[i] == b) {
retp = (i + 2) % 4;
}
}
cout << e[retp] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/arc087_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | 0 | 79,223,070 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e9;
const long long MOD = 1e9+7;
using Graph = vector<vector<ll>>... | 0 | 64,360,387 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<pair<int,int>> red(n);
vector<pair<int,int>> blue(n);
int a,b;
for(int i=0;i<n;i++){
cin >> a >> b;
red.at(i) = make_pair(-b,a);
}
sort(red.begin(),red.end());
for(int i=0;i<n;i++){
cin >> a >> b;
blue.at(i... | #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 s;
cin >> s;
int now = s;
vector<int> num(1000005);
num[s]++;
for(int i = 2; ; i++){
if(now % 2 == 0) now /= 2;
else now = now*3 + 1;
if(num[n... | 0 | 41,664,782 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll A;
double B;
cin >> A >> B;
ll B2 = B*100 + 0.001;
ll ans = A*B2;
ans /= 100;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define FILE
#define fr first
#define se second
using namespace std;
const long long N = 2e5 + 7;
const long long inf = 1e9 + 7;
const long long mod = 1e9 + 7;
int n;
int D;
int A;
pair<int, int> a[N];
queue<pair<int, long long>> q;
int main()
{
#ifdef FILEs
freopen("input.txt", "r"... | 0 | 20,082,532 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,a,sol=0;
vector<int> V;
int arr[1000020];
int main() {
cin >> n;
for (int i=0;i<n;i++) {
cin >> a;
V.push_back(a);
}
sort(V.begin(),V.end());
V.push_back(INT_MAX);
for (int i=0;i<n;i++) {
if (arr[V[i]... | #include<bits/stdc++.h>
#define Rushia_mywife ios::sync_with_stdio(0);cin.tie(0);
#define rep(i,head,n) for(int i=(head);i<n;i++)
#define F first
#define S second
#define FF first.first
#define FS first.second
#define SF second.first
#define SS second.second
#define pb push_back
#define pob pop_back
#define pf push_fro... | 0 | 58,746,906 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2, s3;
cin >> s1 >> s2;
int a, b;
cin >> a >> b;
cin >> s3;
if(s3==s1) cout << a-1 << " " << b << endl;
else cout << a << " " << b-1 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | 0 | 23,195,263 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(fals... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> x(n);
rep(i, n) cin >> x.at(i);
int ans = MOD;
rep(p, 300) {
int sum = 0;
... | 0 | 9,722,492 |
#include <bits/stdc++.h>
using namespace std;
#define print cout <<
#define printl(s) cout << s << endl;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template <typename T>
vector<T> getValues(int num){
vector<T> values(num);
for(int i=0;i<num;i++){
cin >> values.at(i);
}
return values;
}
int m... | #include <bits/stdc++.h>
#define ll long long
#define mp(a, b) make_pair(a, b)
#define newline cout << endl;
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(),v.end()
using namespace std;
template <typename S, typename T> ostream& operator<<(ostream& out, pa... | 0 | 42,482,072 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n)-1;i>=(j);i--)
using ll=long long;
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; re... | #include <iostream>
using namespace std;
int G[101][101];
int main() {
int n;
cin >> n;
fill(G[0], G[101], 0);
for (int i = 0; i < n; i++) {
int u, k;
cin >> u >> k;
for (int j = 0; j < k; j++) {
int v;
cin >> v;
G[u][v] = 1;
}
}
... | 0 | 80,535,866 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector< vector<int> > VVI;
typedef vector< ve... | #include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pii pair<ll , ll>
#define mpi make_pair
#define F first
#define S second
#define pb push_back
bool comp1(pii a , pii b)
{
return atan2(a.S , a.... | 0 | 23,047,575 |
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define FAST ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define SZ(a) (int)a.size()
#define Flush fflush(stdout);
typedef long long ll ;
using namespace st... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
if(s.size() > t.size()) {
cout << "GREATER\n";
return 0;
} else if(s.size() < t.size()) {
cout << "LESS\n";
return 0;
} else {
int ss = s.size();
for(int i = 0; i < ss; i++) {
if(s... | 0 | 71,579,187 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<ll, ll>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (ll i = begin; i < n; i++)
#define repe(i, begin, n) for (ll i = begin; i <= n; i++)
#define repr(i, begin, n) for (ll i = begin; i > begin - n; i--)
#define repre(i, begi... | #include <iostream>
#include <cstdio>
using namespace std;
int main() {
while(!feof(stdin)) {
int n, tmp, data[5];
for(int i=0;i<5;i++) scanf("%d", &data[i]);
if(feof(stdin)) break;
for(int i=4;i>0;i--) {
for(int j=0;j<i;j++) {
if(data[j]<data[j+1]) {
tmp=data[j+1]; data[j+1]=data[j]; data[j... | 0 | 63,976,539 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include <iostream>
using namespace std;
int main(void){
int N,A,B,C,X,Y[100];
while(cin>>N>>A>>B>>C>>X){
if(N==0 && A==0 && B==0 && C==0 && X==0) break;
for(int i=0; i<N; i++)
cin>>Y[i];
int Cn=0;
for(int i=0; i<=10000; i++){
if(Y[Cn]==X) Cn++;
... | 0 | 46,395,672 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
while (1) {
string t;
cin >> t;
if (t == "-")
break;
int n, h;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h;
string t2 = t.substr(0, h);
t.erase(0, h);
t += t2;
}
cout << t << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int i,j,flag=3;
string s;
cin>>s;
int len=s.size();
for(i=0,j=len-1;i<j;i++,j--){
if(s[i]!=s[j])
flag--;
}
for(i=0,j=(len-1)/2-1;i<j;i++,j--){
if(s[i]!=s[j])
flag--;
}
for(i=(len+1)/2,j=len-1;i<j... | 0 | 91,244,058 |
#include <bits/stdc++.h>
#define forn(i,n) for(int i=0;i<n;i++)
#define sz(x) (int)x.size()
typedef long long ll;
using namespace std;
int T[5];
int main() {
forn(i,5) cin>>T[i];
ll mn=1e9;
do{
ll cost=0;
forn(i,5){
int x=(T[i]+9)/10;
cost+=T[i]+(i==4?0:(10*x-T[i]));
}
mn=min(mn,cost);
}while(next_pe... | #include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <chrono>
#include <vector>
using namespace std;
int main()
{
int N;
cin >> N;
vector<long long> d(N);
vector<pair<int, int>> t;
map<long long, int> a;
for (... | 0 | 71,654,203 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(n + 1);
a.at(0) = 2;
a.at(1) = 1;
rep(i, n - 1) a.at(i + 2) = a.at(i + 1) + a.at(i);
cout << a.at(n) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
string S;
cin >> S;
string subS;
string leftS, rightS;
int maxLength = 1;
for (int i = 1; i < S.size() - 1; i++)
{
subS = S;
for (in... | 0 | 52,121,999 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string s;
cin >> a >> b >> s;
bool pc = true;
for(int i=0; i<s.size(); i++) {
if(i!=a && !isdigit(s[i])) pc = false;
if(i==a && s[i]!='-') pc = false;
}
if(pc) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int LGA = 60;
int main(){
ios::sync_with_stdio(false);
int n;
cin >> n;
ll a[n];
ll f = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
f ^= a[i];
}
for (int i = 0; i < n; i++) {
... | 0 | 10,899,419 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int d;
int s;
int y;
int x;
while(cin>>d){
s = 0;
x = d;
y = d*d;
while(1){
if(x == 600){
break;
}
s += (y*d);
x += d;
y = x*x;
}
cout<<s<<endl;
}
} | 0 | 77,079,523 |
#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;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | 0 | 78,059,534 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <cstdlib>
#include <stack>
#include <queue>
#include <list>
using namespace std;
class c_doubly
{
private:
public:
c_doubly();
void f_input();
};
c_doubly::c_doubly()
{
}
void c_doubly::f_input()
{
int n;
int n_key;
... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | 0 | 79,150,970 |
#include <bits/stdc++.h>
using namespace std;
#define rep(it,st,en) for(int it=(st);it<(int)(en);++it)
#define allof(c) (c).begin(), (c).end()
#define mt make_tuple
#define mp make_pair
#define pb push_back
#define X first
#define Y second
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typed... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second
#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x...) cerr << "[" << #x << "]: " << x << "\n";
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ... | 0 | 83,336,435 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int D, T, S; cin >> D >> T >> S;
if(S * T < D) cout << "No" << endl;
else cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
scanf("%d", &n);
vector<vector<int> > g(n);
for(int i = 0;i < n-1;i++){
int x, y;
scanf("%d %d", &x, &y);
x -= 1;
y -= 1;
g[x].push_back(y);
g[y].push_back(x);
... | 0 | 2,359,687 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long i=0; i<(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) { a = b; return true; } return false; }
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD = 1000000007;
#define lcm(x, y) ((x) * (y) / __gcd((x), (y)))
#define sz(a) (long long)((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define debug(x) cout << #x << " : " << x << endl
#define part cout<<"----------... | 0 | 9,120,315 |
#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>>;
using plli=pair<ll,int>;
using vplli=vector<pair<ll,int>>;
using pllll=... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef map<int, int> mii;
typedef vector<char> v... | 0 | 42,362,827 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
ll ans = (N-1+K-2)/(K-1);
cout << ans << endl;
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <string.h>
#include <climits>
using namespace std;
int main() {cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
long long... | 0 | 53,380,046 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | #include<bits/stdc++.h>
using namespace std;
struct item{
int a;
int b;
int c;
};
int main()
{
int n;
cin>>n;
vector<item> dp(n);
for(int i=0;i<n;i++){
int a1,b1,c1;
cin>>a1>>b1>>c1;
if(i==0){
dp[0].a=a1;
dp[0].b=b1;
dp[0].c=c1;
... | 0 | 92,380,359 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair <int, int>
#define piii pair <int, pii>
#define vi vector <int>
#define vl vector <ll>
#define pll pair <ll, ll>
#define PI acos(-1)
#define MP make_pair
#define PB push_back
#define F first
#define S sec... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
using plll=pair<ll,pll>;
using graph=vector<vector<int>>;
using wgraph=vector<vector<pll>>;
const ll MOD=1000000007;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll abs1(ll a){
if(a>=0)return a;
... | 0 | 65,092,018 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i,n) for(int i=1;i<=n;i++)
int a[100002];
int s[100002];
int main(){
while(1){
int n,k;
cin>>n>>k;
if(n==0)return 0;
loop(i,n)cin>>a[i];
s[1]=0;
loop(j,k){
s[1]+=a[j];
}
int m=s[1];
loop(i,n-k+1){
if(i==1)contin... | #include <bits/stdc++.h>
#define loop(n) for (int ngtkana_is_genius = 0; ngtkana_is_genius < int(n); ngtkana_is_genius++)
#define rep(i, begin, end) for(int i = int(begin); i < int(end); i++)
#define all(v) v.begin(), v.end()
#define lint long long
auto cmn = [](auto& a, auto c){if (a > c) {a = c; return true;} return ... | 0 | 73,038,942 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define MAX 100
int t[MAX+2], v[MAX+2], s[MAX+2];
double f(int i, double t){
if(i>0 && t<=s[i-1]) return v[i]+(s[i-1]-t);
else if(t<=s[i]) return v[i];
else return v[i]+(t-s[i]);
}
int main(){
int n;
cin >> n;
t[0]... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 18,513,065 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int N;
cin >> N;
vector<string> W(N);
REP... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define eb emplace_back
const int MAX=1000000;
ll m[MAX+10];
int main()
{
ll n;
cin>>n;
ll a[n+2];
for(ll i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
for(ll i=0;i<n;i++)
{
if(i>0 && a[i]==a[i-1]... | 0 | 14,225,305 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const long long mod = 1000000007;
int main(){
string s;
ll k;
cin >> s >> k;
ll n = sz(s);
vector<ll> seq(0);
ll cnt = 1;
rep(i,n){
if(i == n-1) {
seq.p... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using PLL = P<ll... | 0 | 4,781,648 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll MOD=1e9+7;
#define pa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
const int MAX = (int)1e6;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <ra... | 0 | 10,355,858 |
#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, d, x;
cin >> n >> d >> x;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(i, n) x += (d-1) / a[i] + 1;
cout << x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 0 | 79,601,588 |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <set>
#include <stdio.h>
#include <math.h>
using namespace std;
typedef long long int lli;
const long long int MaxN=300005;
const lli mod=1e9+7;
#define fst first
#define snd second
#define mp make_pair
const float pi=3.14159265358979323... | #include <cassert>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long ... | 0 | 9,779,027 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long S;
cin>>S;
long long A=S%1000000000;
long long B=S/1000000000;
if(S==1000000000000000000){
cout<<0<<" "<<0<<" "<<1000000000<<" "<<0<<" "<<0<<" "<<1000000000<<endl;
return 0;
}
cout<<setprecision(18)<<0<<" "<<0<<" "<<1000000000<<" ... | #include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
vector<ll> lnln ;
void dfs(ll x, ll y){
lnln.push_back(x) ;
string ... | 0 | 100,075,479 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
ll gcd(ll x,ll y){
if(x > y) swap(x,y);
if(x == 0) return y;
return gcd(x,y%x);
};
int main(){
int x;
cin >> x;
if(gcd(360,x) == 1) cout << 360 << endl;
else cout << 360/gcd(360,x) << endl;
ret... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a[3][3];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++)cin >> a[i][j];
}
int n;
cin >> n;
vector<int>b(n);
for(int i=0;i<n;i++)cin >> b[i];
vector<vector<bool>>ccc(3,vector<bool>(3,false));
for(int i=0;i<n;i++){
... | 0 | 74,105,674 |
#include <bits/stdc++.h>
using namespace std;
long INF = 1e16;
long divPlusOneIfModExist(long target, long div) {
return (target+div-1L)/div;
}
int main() {
long N;
cin >> N;
long A[N+1];
for (int i = 0; i <= (int)N; i++) {
cin >> A[i];
}
long maxNodes[N+1];
maxNodes[0] = 1L;
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
const double PI=3.1415926535897932;
bool SecondCompare(const pair<int,int> &a,const pair<int,int> &b)
{
return a.second<b.s... | 0 | 1,668,063 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << (s[2]==s[3] && s[4]==s[5] ? "Yes" : "No") << "\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
string S;
cin >> S;
ll X, Y, l = 0;
cin >> X >> Y;
vector<ll> ax, ay;
ll x0 = -1, y0 = 0;
bool fx = true;
auto pushL = [&]() {
if ( fx ) {
if ( x0 < 0 ) x0 = l;
el... | 0 | 58,047,487 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s,t;
cin>>s>>t;
int num1,num2;
cin>>num1>>num2;
string p;
cin>>p;
if(p==s)
cout<<num1-1<<" "<<num2;
else if(p==t)
cout<<num1<<" "<<num2-1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | 0 | 96,554,328 |
#include<stdio.h>
using namespace std;
#define NEL -1
struct tree{
int p,l,r;
};
tree a[100005];
int d[100005];
int re(int u,int p){
d[u]=p;
if(a[u].r>=0) re(a[u].r,p);
if(a[u].l>=0) re(a[u].l,p+1);
}
void print(int n){
for(int i=0;i<n;i++){
printf("node %d:",i);
printf(" parent = %d... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, k;
while( cin >> n >> k, n+k ) {
int max_sum, sum = 0, data[100000];
for(int i=0; i<k; i++) {
cin >> data[i];
sum += data[i];
}
max_sum =sum;
for(int i=k; i<n; i++) {
cin >> data[i];
sum -= data[i-k];
s... | 0 | 24,338,892 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b){return b ? gcd(b,a%b): a;}
int main(){
int n; cin >> n;
vect... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 10007;
const int inf = 101234567;
int main() {
ll N, M;
cin >> N >> M;
vector<vector<int>> x(N+1);
vector<pair<int, int>> city(M);
for (int i = 0; i < M; i++) {
ll P, Y;
cin >> P >> Y;
x[P].pus... | 0 | 88,867,007 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int x;
cin >> x;
cout << (x < 1200 ? "ABC" : "ARC") << "\n";
} | #include "iostream"
#include "algorithm"
#include "string"
#include "vector"
#include "cmath"
#include "bitset"
#include "queue"
#include "functional"
#include "map"
#include "unordered_map"
#include "set"
#include "stack"
#define lp(n) for (int i = 0; i < n; i++)
#define LP(n,i) for (int i = 0; i < n; i++)
#define mod... | 0 | 12,366,992 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #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 n; cin >> n;
map<int, int> a;
rep(i, n) {
int tmp;
cin >> tmp;
a[tmp]++;
}
int ans = 0;
for (auto a_tmp : a) {
if (a_tmp.fir... | 0 | 91,530,917 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int n;
long long a, ac = 1;
double ac2 = 1;
int main(){
scanf("%d", &n);
rep(i,n){
scanf("%lld", &a);
ac *= a;
ac2 *= a;
if(ac2 > 2e18){
ac = -1;
for(int j=i+1; j<n; j++){
scanf("%lld", &a);
if(a == 0) ac = 0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
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 ll MOD=1000000007,MOD2=998244353;
int main() {... | 0 | 41,366,562 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
struct UnionFind
{
vector< int > data;
UnionFind(int sz)
{
data.assign(sz, -1);
}
bool unite(int x, int y)
{
x = find(x), y = find(y);
if(x == y) return (false);
if(data[x] > data[y]) swap(x, y);
data[x] += data[y];
d... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n, p, a[20020], b[20020];
pair<int, int> ps[20020];
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
cin >> n;
int val = 500000000;
for(int i = 0; i < n; ++i) {
cin >> p;
ps[i].first = p;
ps[i].second = val... | 0 | 9,468,609 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <algorithm>
#include <stack>
#include <functional>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=j;i>(n);i--)
typedef long long int lli;
#define N 100... | #include<iostream>
using namespace std;
int main()
{
int d;
while(cin >> d){
int allS=0;
for(int i=0 ; i<600/d ; i++){
allS += d*d*i*d*i;
}
cout << allS << endl;
}
return 0;
} | 0 | 41,873,574 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
typedef long long LL;
int main(){
int N, M;
cin >> N >> M;
int tot=1900*M+100*(N-M);
cout << tot*pow(2,M) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> DP(N+1,-1);
DP[0] = 0;
for(int i = 0; i < N;i++){
if(DP[i+1]!=-1)DP[i+1] = min(DP[i+1],DP[i] + 1);
else DP[i+1] = DP[i] + 1;
for(int j = 6; i < N;j*=6){
if(i+j > N)break;
... | 0 | 67,986,194 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
int W, H;
vector<string> mp;
int dir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
void solve(int x, int y){
if(x<0 || H<=x || y<0 || W<=y || mp[x][y]!='.')return;
mp[x][y]='A';
rep(i,4)solve(x+dir[i][0], y+dir[i][1]);
}
int main(){
while... | #include<bits/stdc++.h>
#define LL long long
using namespace std;
int main () {
int N;
cin >> N;
vector<LL>A(N);
for (int i = 0; i < N; i ++) cin >> A[i];
sort(A.begin(), A.end());
vector<LL>sum(N + 1);
sum[0] = A[0];
for (int i = 1; i < N; i ++) sum[i] = sum[i - 1] + A[i];
sum[N] = 1e16;
int mi = 0... | 0 | 19,534,199 |
#include <bits/stdc++.h>
using namespace std;
int solve(int n) {
int cnt = 0;
while (n%2==0) {
n /= 2;
cnt++;
}
return cnt;
}
int main() {
int n, check=0,out=1;
cin >> n;
for (int i = 1; i <= n; i++) {
if (check != max(check, solve(i))) {
out = i;
check = ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I... | 0 | 32,938,059 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<cmath>
#include<numeric>
using namespace std;
int main(void) {
string s;
string a = "abcdefghijklmnopqrstuvwxyz";
vector<int> alp(26, 0);
while(cin >> s){
for(int i=0; i<s.size(); i++){
if( s[i]-'A' >= 0 &&... | #include <bits/stdc++.h>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define fi first
#define se second
#de... | 0 | 71,473,029 |
#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>
#include <iomanip>
#defi... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <deque>
#include <map>
#include<functional>
#define INF 10000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using ... | 0 | 13,245,129 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a, b, c; cin >> a >> b >> c;
cout << ((a != b && b != c && c != a) ? "Yes" : "No") << endl;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 0 | 70,707,843 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
typedef long long ll;
#define press_F_to_pay_respect ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn for(int i=0;i<n;i++)
#define form for(int j=0;j<n;j++)
#define fore(i,a,b) for(int i = a; i < (b); i++)
#define pb push_back
#de... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 78,597,354 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#ifdef LOCAL
#include<debug.h>
#else
#define db(...) 21
#endif
#define sz(a) (int)a.size()
#define found(m,x) ((m).find(x)!=(m).end())
#define uset unordered_set
#define umap unordered_map
#define a(x) x.begin(),x.end()
#define fo(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 998244353;
const int Inv2 = (MOD+1)/2;
signed main(){
int n;
cin>>n;
int a[(1<<n)],b[(1<<n)]={},c[(1<<n)]={},p[4];
for(int i=0;i<(1<<n);i++)cin>>a[i];
for(int i=0;i<(1<<n);i++){
b... | 0 | 41,830,695 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,n) for(ll i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
string s;
ll a, b;
cin >> a >> ... | #include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0;i<ll(n); i++)
int GetDigit(unsigned long long num){
return log10(num) + 1;
}
int main(){
ll max = 1000000000000000001;
int N;
cin >> N;
int... | 0 | 78,808,535 |
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
const int mod = 2019;
const int INF = 1e16;
int main() {
ll l, r;
cin >>l >>r;
ll ans(INF);... | #include <bits/stdc++.h>
# define ll int64_t
#define rep(i,n) for(ll i=0;i<n;i++)
#define rrep(i,n) for(ll i=1;i<=n;i++)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define mod 1000000007
using namespace std;
bool compare_by_b(pair<string,ll> a,pair<string,ll> b){
... | 0 | 79,676,282 |
#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 s;
cin>>s;
int n=s.size();
vector<int>a(n+1,0);
rep(i,n){
if(s[i]=='<')if(a[i]>=a[i+1])a[i+1]=a[i]+1;
}
for(int i=n; i>0; --i){
if(s[i-1]=='>')if(a[... | #include<iostream>
using namespace std;
#define MAX 100005
#define HN -1
struct Node{
int p,l,r;
};
Node Ta[MAX];
int num,Da[MAX];
void express(int d){
int i,o;
cout << "node "<< d <<": ";
cout << "parent = "<< Ta[d].p << ", ";
cout << "depth = "<<Da[d] <<", ";
if(Ta[d].p == HN){
cout << "root, ";
}
... | 0 | 46,572,440 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
string s;
cin >> s;
long long minv = 1e9;
for(long long i = 0; i + 2< s.size(); i++){
string t= s.substr(i, 3);
long long a = stoll(t);
minv = min(minv, abs(a-753));
}
cout << minv << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 39,422,468 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, S;
cin >> N >> K >> S;
for (int i = 0; i < K; i++) cout << S << " ";
for (int i = 0; i < N - K; i++) {
if (S < 1000000000) cout << S + 1 << " ";
else cout << 1 << " ";
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MAX_ROW = 510;
const int MAX_COL = 510;
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL>& operator [] (int i) { return val[i]; }
};
int GaussJordan(BitMatrix &A, b... | 0 | 8,776,772 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<numeric>
using namespace std;
int main()
{
int N, M, t, x, y; cin >> N >> M;
long long ans;
vector<int> a(N), c(31,0);
for(int i=0; i<N; i++) cin >> a[i];
sort(a.begin(),a.end(),greater<int>());
for(int i=30; i>... | #include<iostream>
#include<queue>
using namespace std;
int main(){
int w,h;
while(cin>>w>>h , w+h){
char Map[20][20]={0};
int pos = 0;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>Map[i][j];
if(Map[i][j]=='@') pos=i*w+j;
}
}
int cnt=0;
queue<int> q;
q.push(pos);
w... | 0 | 87,618,057 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <functional>
#include <climits>
#include <cstring>
using namespace std;
#define int long long
#define rep(i, n) for (int i=0;i<(int)n;++i)
#define rep... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
void read();
template<typename First, typename... Rest> void read(Firs... | 0 | 54,274,920 |
#include <iostream>
#include <queue>
#include <string>
#include <stdio.h>
using namespace std;
int main()
{
char cmd[2];
int digit;
priority_queue<int> Q;
while (true) {
scanf(" %s", cmd);
if (cmd[0] == 'i') {
scanf(" %d", &digit);
Q.push(digit);
} else {
if (cmd[1] == 'n') break... | #include <iostream>
using namespace std;
int main (void) {
int a, b, c, d, ttl;
cin >> a >> b >> c >> d;
if (a < b) {
ttl += a;
} else {
ttl += b;
}
if (c < d) {
ttl += c;
} else {
ttl += d;
}
int ans = ttl;
cout << ans << endl;
} | 0 | 42,453,395 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int h,w,n;cin>>h>>w>>n;
map<pair<int,int>,int>cnt;
for(int i=0;i<n;i++){
int x,y;
cin >>x>>y;
for(int j=0;j<3;j++){
for(int k=0;k<3;k++){
int x0,y0;
x0=x-j;y0=y-k;
if(1<=x0 && x0+2<=h && 1<=y0 && y0+2<=w)
{pair<in... | #include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cctype>
#include <cstdlib>
#define rep(i,a,b) for(int i=(a);i<b;i++)
#define INF 1000000000
using namespace std;
bool debug=false;
int main(){
int n,m,p;
while(1){
... | 0 | 49,412,023 |
#include<iostream>
using namespace std;
int main(){
long long int a, b;
cin >> a >> b;
if(a == 1){
cout << "1\n";
}
else if(b == 1){
cout << "1\n";
}
else if(a * b % 2 == 0){
cout << a * b / 2 << "\n";
}
else{
cout << (a * b + 1) / 2 << "\n";
}
} | #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>
#inc... | 0 | 36,429,859 |
#include <bits/stdc++.h>
using namespace std;
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(a) (a).begin(),(a).end()
#define loop(i,a,b) for(int (i) = (a); (i) < (b); (i)++)
#define debug(x) cout << #x << " = " << x << endl
using ll = long long;
using i... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vec... | 0 | 68,942,452 |
#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | #include<iostream>
#include<cstdio>
using namespace std;
const int maxn=2e6+5;
const int inf=(1<<31)-1;
int h,s[maxn];
void maxheapify(int i)
{
int l,r,largest=i;
l=2*i;
r=2*i+1;
if(l<=h&&s[largest]<s[l]){
largest=l;
}
if(r<=h&&s[largest]<s[r]){
largest=r;
}
if(largest!=i... | 0 | 91,538,981 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define DBG(...) \
do { \... | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
int f = 0;
for(int i=0;i<=x;i++){
int a = i;
int b = x-i;
if(a*2 + b*4 == y){
f = 1;
break;
}
}
if(f) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
... | 0 | 24,406,654 |
#include <bits/stdc++.h>
#define endl "\n"
#define ff first
#define ss second
#define PB push_back
#define MP make_pair
#define ll long long
#define llu unsigned long long
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define ABS(X) ((X)< 0 ? -(X): (X))
#define LCM(X, Y) ( (... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
int N;
cin >> N;
ll a[N];
for(int i = 0; i < N; i++) ... | 0 | 52,928,887 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N,A,B,C,sum;
sum = 0;
cin >> N;
for (int i=0;i<N;i++) {
cin >> A >> B;
C = B-A+1;
sum += C;
}
cout << sum << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int digit(LL num){
int res = 0;
while(num > 0) {
res++;
num /= 10;
}
return res;
}
int main(){
LL N;cin >> N;
int ans = 10;
for(LL i = 1; i * i <= N; i++){
LL a =... | 0 | 98,496,840 |
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <map>
#include <algorithm>
#include <queue>
#include <tuple>
#include <functional>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define irep(i,n) for(int i = 0; i < n; i++)
#define irep2(i,a,n) for(int i = a; i < n; i++)
... | #include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=m-1; i>=n; i--)
#define SORT(v,n) do{sort(v,v+n);reverse(v,v+n);}while(0)
#define all(x) (x).begin(),(x).end()
#define... | 0 | 84,665,243 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
double T,X;
cin >> T >> X;
cout << fixed << setprecision(7);
cout << T/X << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
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,... | 0 | 28,449,382 |
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define per(i, n, s) for (int i = (n-1); i >= (int)(s); i--)
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
const ll LINF = LLONG_MAX;
const ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> P;
typedef long long ll;
typedef pair<ll,ll> pll;
... | 0 | 57,155,634 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int x1 , y1 , x2 , y2 ;
cin >> x1 >> y1 >> x2 >> y2 ;
int a=abs(x1-x2);
int b=abs(y1-y2);
int x3 , y3 , x4 , y4 ;
if(x1<=x2&&y1<=y2){
x3=x2-b;
y3=y2+a;
x4=x3-a;
y4=y3-b;
}
if(x1<=x2&&y1>=y2){
x3=x2+b;
y3... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 0 | 31,078,917 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::string S, std::string T){
for(int i = 0; i < N; ++i){
cout << S[i] << T[i];
}
cout << endl;
return;
}
int main(){
long long N;
scanf("%lld",&N);
std::string S;
std::cin >> S;
std::string T;
std::ci... | #include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
typedef pair<int,int> P;
const int maxn=2e5+100;
int k;
bool vis[maxn];
int main()
{
while (scanf("%d",&k)!=EOF)
{
memset(vis,0,sizeof(vis));
deque<P> q;
q.push_front(make_pair(1,1));
... | 0 | 78,441,607 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using lli = int_fast64_t;
using ulli = unsigned long long;
#define debug(x) cerr << #x << " : " << x << endl
#define debugv(x) cerr << #x << " : {";for(auto value_of_x:x){ cerr << value_of_x << ", ";}cerr << endl
#define debug... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0; i<(n); i++)
#define REP2(i,x,n) for(ll i=x; i<(n); i++)
const long long INF = numeric_limits<long long>::max();
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
... | 0 | 17,740,787 |
#include<bits/stdc++.h>
using namespace std;
#define N 100010
#define inf 0x3f3f3f3f
int n,s,t;
int first[N],cnt=0;
int dis[N],vis[N];
struct edge{
int u,v,w,nxt;
}e[N*20];
inline void add(int u,int v,int w){
e[++cnt].u=u;e[cnt].v=v;e[cnt].w=w;
e[cnt].nxt=first[u];first[u]=cnt;
}
void dijkstra(){
typedef pair<int,i... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
#define pi 3.14159265359
#define mk(arr,n,type) type *arr=n... | 0 | 10,668,480 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
long long a, b;
while (true) {
cin >> a >> b;
if (a == 0 && b == 0) return 0;
for (int h = 1; h <= a; h++) {
if (h == 1 || h == a){
for (int i = 1; i <= b; i++) {
cout << '#';
}
}
el... | 0 | 55,114,949 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int p, q, r;
cin >> p >> q >> r;
cout << p +q + r - max(max(p,q), max(p,r));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using VecVec = vector<... | 0 | 11,902,852 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll n;
cin >> n;
ll x = 0, y = 0;
for (ll i = 1; i <= sqrt(n); i++) {
if (n%i == 0) {
x = i;
y = n/i;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin,(x).end()
int main(){
char a,b;
cin >> a >> b;
if(a=='H'){
if(b=='H'){
cout << "H" << endl;
}
if(b=='D'){
cout << "D" << end... | 0 | 6,097,852 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S, T;
cin >> S >> T;
vector<int> check((int)S.size(), 0);
int count = 0;
for (int i=0; i<S.size() - T.size()+1; i++){
for (int j=0; j<T.size(); j++){
if (S.at(i+j) == T.at(j)) count++;
}
check.at(i) = count;
count = 0;
}
... | #include<iostream>
#include<algorithm>
using namespace std;
char tyle[30][30]={'0'};
int find_tyle(int i,int j){
if(tyle[i+1][j]=='.'){
tyle[i+1][j]='a';
find_tyle(i+1,j);
}
if(tyle[i][j+1]=='.'){
tyle[i][j+1]='a';
find_tyle(i,j+1);
}
if(tyle[i-1][j]=='.'){
tyle[i-1][j]='a';
find_tyle(... | 0 | 60,871,308 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{
LLONG N, C, K; cin >> N >> C >>... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = s... | 0 | 45,793,907 |
#include<stdio.h>
int abs(int,int);
int main(void){
int a,b,c,d;
scanf("%d %d %d %d",&a,&b,&c,&d);
if(abs(a,c)<=d || (abs(a,b)<=d && abs(b,c)<=d)){
printf("Yes");
}else{
printf("No");
}
return 0;
}
int abs(int x,int y){
int sub=x-y;
if(sub<=0){
sub=-1*sub;
}
return sub;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define SQ(a) (a)*(a)
template <class T, class ... | 0 | 584,899 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(void){
int N;
cin >> N;
string S[N];
for(int i=0;i<N;i++){
cin >> S[i];
}
int mp[N][26];
for(int i=0;i<N;i++){
for(int j=0;j<26;j++){
mp[i][j] = 0;
}
}
for(int i=0;i... | #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 <tuple>
#include <numeric>
#define... | 0 | 26,134,946 |
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a);i<(b);++i)
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc051_b.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cou... | 0 | 9,021,580 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
vector<int> cost(1000000);
vector<vector<int>> data(1000000);
vector<int> divide(string str){
vector<int> divide(str.length());
f... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int n;cin >>n;
int ans;int now=-1;
for (int i = 1; i <=n; ++i) {
int c... | 0 | 26,300,977 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | #pragma region Template
#include <bits/stdc++.h>
#ifdef _DEBUG
#include "../../../debug_print.hpp"
#else
#define debug(...)
#endif
#define sort_(a) sort(a.begin(), a.end())
#define rsort(a) sort(a.rbegin(), a.rend())
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; 0 <= i; i--)
#defi... | 0 | 81,889,784 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.