code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#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 x;
cin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,a,b) for (int i=a; i<b; ++i)
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll H,W; cin >> H >> W;
vector <string> Grid(H);
loop(i,0,H) cin >> Grid[i];
queue <pair <pair<int, int>, int> > Q;
vect... | 0 | 88,215,615 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
int main(){
ll N,Z,W; cin>>N>>Z>>W;
vector<ll> A(N);
rep(i,N) cin>>A[i];
if(N==1) cout<<abs(A[0]-W);
else{
cout<<max(abs(A[N-1]-W),abs(A[N-2]-A[N-1]));
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long H,W,N;
cin >>H>>W;
long long Sa,Sb,Sc,ans;
ans=100000000;
for(int i=1;i<H;i++){
Sa=i*W;
Sb=(H-i)*(W/2);
Sc=(H-i)*(W-(W/2));
ans=min(ans,abs(max(Sa,max(Sb,Sc))-min(Sa,min(Sb,Sc))));
}
for(int i=1;i<H;i++){
Sa=i*W;
Sb=((H-... | 0 | 10,820,851 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int N, L;
std::vector<string> S;
std::string tmp;
std::cin >> N >> L;
for (int i = 0; i < N; i++) {
std::cin >> tmp;
S.push_back(tmp);
}
std::sort(S.... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <istream>
#include <sstream>
#include <iomanip>
#include <iterator>
#include <climits>
using namespace std;
typedef ... | 0 | 86,539,950 |
#include <cstdio>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <iterator>
#define loop(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll h,w,d;cin>>h>>w>>d;
pair<ll,ll> a[100010];
rep(i,0,h){
rep(j,0,w){
ll b;cin>>b;
a[b]=make_pair(i+1,j+1);
}
}
vector<ll> mod[100... | 0 | 67,275,219 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
cons... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
... | 0 | 26,431,168 |
#include<iostream>
#include<string>
#include<vector>
#define CI cin >>
#define CO cout <<
#define E << endl;
using namespace std;
int main(void) {
int temp = 0;
int cost_input[10];
int cost_return = 0;
int num[10];
int j = 0;
for (int i = 0; i < 10; ++i) {
CI temp;
if (temp == 0) {
j = i;
break;
}
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
const int INT_INF = 1001001001;
int main(){
int n;
cin >> n;
vector<ll> A(n);
for(int i=0;i<n;i++){
cin >> A[i];
}
map<ll,int> m;
for(int i=0;i<n;i++){
... | 0 | 86,915,473 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
string s, t;
cin >> s >> t;
int i;
for(i = 0; i < n; i++){
bool flag = true;
for(int j = i; j < n; j++){
if(s[j] != t[j-i]) flag = false;
}
if(flag) break;... | 0 | 83,936,935 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
#define rreps(i, n) for(int i=((int)(n)); i>0; --i)
#define all(x) (x).begin(), (x).end()
#define ... | #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 | 72,417,947 |
#include<bits/stdc++.h>
using namespace std;;
int main(){
string s,t; cin>>s>>t;
cout<<t<<s<<endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=1; i<=(int)(n); i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define bigger (char)toupper
#define smaller (char)tolower
using namespace std;
typedef pair<int,int> pii;
typedef ... | 0 | 91,113,257 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
while(1)
{
int x,y;
cin>>x>>y;
if(x==0&&y==0)break;
cout<<min(x,y)<<" "<<max(x,y)<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair < int , int >;
using i3 = pair < int , ii >;
using li = pair < ll , int >;
using lii = pair < ll , ii >;
using pll = pair < ll , ll >;
using vi = vector < int >;
using vl = vector < ll >;
using ... | 0 | 57,328,840 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main(){
ll n;
cin >> n ;
std::vector<ll> a(n);
std::vect... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);
const int N = 1e5+5, M = 1e6+6, OO = 0x3f3f3f3f;
int a[N], b[N];
int h, n;
int main()
{
cin>>n>>h;
int mxa = -1;
for (int i = 0; i < n; i++)
{
cin>>a[i]>>b[i];
mxa = m... | 0 | 65,996,456 |
#include <iostream>
using namespace std;
int route = 0;
int a, b, n;
bool road[17][17];
void dfs(int x, int y) {
if (x == a && y == b) {
route++;
return;
}
if (x > a || y > b) return;
if (road[y][x]) return;
dfs(x + 1, y);
dfs(x, y + 1);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (cin >>... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v(n+1);
for(int i = 0; i < n; i++){
cin >> v[i];
}
long long r = 0;
for(int i = 0;i < n; i++){
if(v[i] % 2 == 1){
v[i]--;
... | 0 | 70,713,140 |
#include<iostream>
using namespace std;
int coin[] = { 500, 100, 50, 10, 5, 1 };
int main() {
int n,res;
while(true) {
cin>>n;
if(!n) break;
n=1000-n,res=0;
for(int i=0; i<6; i++) {
res+=n/coin[i];
n%=coin[i];
}
cout<<res<<endl;
}
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 38,861,807 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <functional>
#include <queue>
#include <string>
#include <cstring>
#include <numeric>
#include <cstdlib>
#include <cmath>
using namespace std;
typedef long long ll;
#define INF 10e17
#define rep(i,n) for(int i=0; i<n; i++)
#define re... | #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<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
int main(){
fast_io
int n;
cin>>n;
vector<ll> a(n);
rep... | 0 | 72,994,322 |
#include <iostream>
#include <complex>
#include <cmath>
#include <iomanip>
using namespace std;
int main(int argc, char *argv[])
{
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << setprecision(20) << sqrt(pow(x1-x2, 2.0)+pow(y1-y2, 2.0)) << endl;
return 0;
} | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 39,051,232 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
for(int i=0;i<12;i++){
if(i==4) cout << ' ';
cout << s[i];
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long k;
cin >> k;
long long a = 49 + k / 50;
int m = (int) (k % 50);
cout << 50 << endl;
for (int i = 0; i < 50; i++)
{
if (i != 0)
cout << " ";
if (i < m)
cout << a + 50 - (m - 1);
... | 0 | 45,498,296 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define SORT(s) sor... | #include<iostream>
using namespace std;
int main(){
int n, y, m, d;
cin>>n;
for(n;n;n--){
cin>>y>>m>>d;
int ans=0;
for(int i=y+1;i<1000;i++){
if(i%3==0) ans+=20*10;
else ans+=(20+19)*5;
}
if(y%3==0) ans+=20*(10-m);
else{
for(int i=m+1;i<=10;i++){
if(i%2) ans+=20;
else a... | 0 | 79,062,746 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_v... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 15,966,856 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#define int long long
#define double long double
#define fre(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
using namespace std;
inline int read(){
int sum=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
w... | #include <bits/stdc++.h>
using namespace std;
const double ESP=1e-8;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
#define eq(a,b) a-b<ESP
double x[3],y[3];
double xp,yp;
int main(){
while (cin>>x[0]>>y[0]>>x[1]>>y[1]>>x[2]>>y[2]>>xp>>yp){
bool r=false,l=false;
REP(i,3){
double... | 0 | 62,527,144 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int cnt0 = 0;
int cnt1 = 0;
REP(i, s.size()) {
if (s[i] == '0') cnt0++;
else cnt1++;
}
cout << min(cn... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | 0 | 87,414,051 |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> v;
int a[55];
int main(void)
{
int n, k, i, j, p, q, ans = 0;
scanf("%d %d" ,&n, &k);
for (i = 0; i < n; i++)
scanf("%d" ,&a[i]);
for (i = 0; i <= min(n, k); i++)
for (j = 0; i + j <= min(n, k); j++)
{
v.clear();
f... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | 0 | 9,175,845 |
#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>
using namespace std;
int main(){
int M,N;
cin>>M>>N;
vector<pair<pair<int,int>,int>> A(N);
for(int i=0;i<N;i++){
cin>>A[i].first.second>>A[i].first.first;
A[i].second=i;
}
sort(A.begin(),A.end());
vector<int> B(M+1,1),C(N),D(N);
for(int i=0;i<N;i++){
C[A[i].second]=B... | 0 | 30,199,648 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int N, K;
cin >> N >>... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n,j,i,ans,k;
bool ha=true;
n=s.size();
j=n-1;
ans=0;
i=0;
int med=n/2;
while(i<=j){
if(s[i]=='x' && s[j]!='x'){
ans++;
i++;
}else if(s[j]=='x' && s[i]!='x'){
ans++;
j--;
}else if(s[i]... | 0 | 80,835,822 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) cin >> h[i];
int count = 0;
for (int l = 0; l < N; l++) {
int r;
while (h[l] != 0) {
int Min = h[l];
for (r = 1; l + r < N; r++) {
if (h[l + r] ... | #include <bitset>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
constexpr int64_t divider = 1000000007;
int main() {
int64_t N, M;
cin >> N >> M;
bitset<1000001> steps;
for (int m = 0; m < M; ++m) {
int s;
cin >> s;
steps.set(s);
if (steps.test(s - 1)) {
cou... | 0 | 64,539,124 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
ll rep_pow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){
ll memo = rep_pow(a, b/2... | 0 | 80,258,148 |
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <algorithm>
#include<math.h>
#include <cmath>
#include<iomanip>
using namespace std;
int main(){
double a, b, C;cin >> a >> b >> C;
double rad = M_PI /180 *C;
double S = a * b * sin(rad)/ 2;
double L = sqr... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
void solve() {
int bu[5] = {0};
rep(i, 0... | 0 | 55,532,829 |
#include<stdio.h>
int main(){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a<=b && b<=c) printf("%d %d %d\n",a,b,c);
else if(b<=a && a<=c) printf("%d %d %d\n",b,a,c);
else if(a<=c && c<=b) printf("%d %d %d\n",a,c,b);
else if(c<=a && a<=b) printf("%d %d %d\n",c,a,b);
else if(b<=c && c<=a) printf("%d %... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(... | 0 | 36,407,158 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,x,y,s;
cin>>n>>k>>x>>y;
if(n<=k)
{
cout<<x*n<<"\n";
}
else
{
s=(k*x)+(n-k)*y;
cout<<s<<"\n";
}
return 0;} | #include "bits/stdc++.h"
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;
int main(){
int n,m;
cin >> n >> m;
vector <vector <int>> c(m+1);
int a,b;
rep(i,n){
cin >> a >> b;
if(a<=m){
c[a].push_back(b);
}... | 0 | 50,845,922 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
char c;
cin >> c;
if(c == 'a' || c == 'i' || c ==... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long ... | 0 | 53,844,874 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> v;
pair<int,int> p;
map<int,int> m;
deque<int> d;
int main(void){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int x[n];
for(int i=0;i<n;i++)
cin>>x[i];
int sum = 0;
for(int i=0;i<n;i++)
sum += x[i];
float p = floa... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argv,char* argc[])
{
vector<pair<string,int> >ar;
int n;
cin>>n;
string s; int t;
for(int i=0;i<n;++i)
{
cin>>s>>t;
ar.push_back(make_pair(s,t));
}
string x;
cin>>x;
... | 0 | 34,770,438 |
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 77;
int main(){
int n , x , t ; cin >> n >> x >> t ;
if(n%x==0) cout << n/x * t << endl;
else cout << (n/x + 1) *t << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 57,588,221 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
ll N, P;
string S;
ll pow_mod(ll n, ll k, ll mod) {
if (k == 0) return 1;
else if (k % 2 == 1) {
return pow_mod(n, k-1, mod) * n % mod;
}
else {
ll tmp = pow_mod(n, k/2, mod);
return t... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((&a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " <... | 0 | 942,683 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> V(3);
for (int i = 0; i < 3; i++) cin >> V.at(i);
sort(V.rbegin(), V.rend());
if (V.at(0) == V.at(1) && V.at(1) == V.at(2)) return cout << 0 << "\n", 0;
int ans = 0;
int tmp = V.at(0) - V.at(1);
ans += tmp;
V.at(2) += tmp;
tmp = V.... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n+2];
a[0] = 0;
a[n+1] = 0;
for(int i = 1; i < n+1; i++){
cin >> a[i];
}
int sum = 0;
for(int i = 0; i < n+1; i++){
sum += abs(a[i] - a[i+1]);
}
for(int i = 1; i < n+1; i++){
... | 0 | 72,383,078 |
#include <iostream>
#include <string>
#include <ctype.h>
using namespace std;
int main(int argc, char *argv[])
{
string input;
getline(cin, input);
for (int i = 0; i < input.size(); i++)
{
if (islower(input[i]))
{
input[i] = toupper(input[i]);
}
else
{... | #include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#def... | 0 | 51,907,564 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S == "a" ){
cout << "vowel" << endl;
}
else if (S == "i"){
cout << "vowel" << endl;
}
else if (S == "u"){
cout << "vowel" << endl;
}
else if (S == "e"){
cout << "vowel" << endl;
}
else if (S == "o"){
cout << "v... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n+1];
bool pressed[n+1] = {};
for (int i=1; i<=n; i++) {
cin >> a[i];
}
int on = 1, cnt = 0;
while (on != 2) {
if (pressed[a[on]] == false) {
pressed[a[on]] = true;
on = a... | 0 | 37,324,001 |
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define int long long
#define puts(x) cout<<x<<endl
#define inf 243000000000000001
#define minf -243000000000000001
signed main(){
int n,k;
cin>>n>>k;
vector<int>v(n);
vector<int>ans(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
... | #include<bits/stdc++.h>
#define FastRead \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define endl "\n"
#define f for
using namespace std;
int main()
{
FastRead
ll int n,m,i;
cin>>n>>m;
... | 0 | 6,431,765 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin >>S;
int r=0;
int b=0;
for(size_t i=0;i<S.size();i++){
if(S.at(i)=='0') r++;
else b++;
}
cout <<2*min(r,b)<<endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <stdlib.h>
#include <math.h>
#include <string.h>
using namespace std;
typedef long long ll;
struct node
{
int c;
int a[15];
}book[15];
int b[15];
int main()
{
int n... | 0 | 97,407,052 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stdio.h>
#include <string>
#include <string.h>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <stdlib.h>
using namespace std;
int main (void)
{
string a;
cin >> a;
int k = 0;
k = a.size();
for (int i = k; i > 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
vector<ll> distances;
vector<vector<pll>> edges;
ll INF = 1e16;
bool dfs(int node)
{
for (auto edge : edges.at(node))
{
ll nextNode, distance;
tie(nextNode, distance) = edge;
if (distances.at(ne... | 0 | 86,670,206 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | #include <bits/stdc++.h>
using namespace std;
int main(){
string str;
while(getline(cin,str)){
if(str==".") break;
stack<char> stk;
string res = "yes";
for(int i=0;i<str.size();i++){
if(str[i]=='(') stk.push('(');
if(str[i]=='[') stk.push('[');
if... | 0 | 5,332,044 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
int main(){
string S; cin >> S;
set<char> st;
vector<char> v(26);
rep(i,26){
st.insert('a'+i);
v[i] = 'a'+i;
}
rep(i,S.size()){
st.erase(S[i]);
}
if(S == "... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 38,550,094 |
#include<iostream>
using namespace std;
int main(){
int x,y;
while(cin>>y>>x){
if(x!=0||y!=0){
for(int i=0;i<y;i++){
for(int j=0;j<x;j++){
cout<<'#';
}
cout<<endl;
}
cout<<endl;
}
}
} | #include<iostream>
using namespace std;
int main(){
int a,b,c;
int x = 0;
cin >> a >> b >> c;
for (int y = a; y <= b; ++y){
if (c % y == 0){
++x;
}
}
cout << x << endl;
return 0;
} | 0 | 52,124,358 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int n[5];
scanf("%d%d%d%d%d", n+0, n+1, n+2, n+3, n+4);
sort(n, n+5);
printf("%d %d %d %d %d\n", n[4], n[3], n[2], n[1], n[0]);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
const int MAX = 1000001;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
fo... | 0 | 19,658,288 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define ll long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1e18
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a; i <= b; i++)
#define ps(x,y... | #include <iostream>
using namespace std;
const int N = 100 + 1;
int main() {
int A[N][N] = {{0}};
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int u;
cin >> u;
int k;
cin >> k;
for (int j = 0; j < k; ++j) {
int x;
cin >> x;
A[... | 0 | 48,186,024 |
#include <vector>
#include <iostream>
using namespace std;
void dfs(const vector<vector<int>> &G, vector<int> &C,
int v, int prev){
for(auto v_ : G[v]){
if(v_ == prev) continue;
C[v_] += C[v];
dfs(G,C,v_,v);
}
}
int main(){
int N, Q;
cin >> N >> Q;
vector<vector<int>> G(N);
for(int i = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n, a[110];
cin >> n;
for(int i = 0; i < n; i++)
cin >> a[i];
pair<ll, ll> p[210];
for(int i = -100; i <= 100; i++)
{
ll sum=0;
for(int j = 0; j < n; j++)
sum+=(a[j]-i)*(a[j]-i);... | 0 | 13,860,567 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
ll choose(ll a)... | #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
struct Span{
int d;
int p;
Span():d(0),p(0){}
Span(int d, int p):d(d),p(p){}
bool operator>(const Span &t)const{ return p>t.p; }
};
int main(){
while(true){
int ans = 0;
int n,m;
vector<Span> vspan;
scanf("%d... | 0 | 57,540,593 |
#include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i,n,init) for(ll i=init;i<(n);i++)
int main()
{
int n,k;
cin >> n >> k;
cout << (k == 1?0:n-k) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
c... | 0 | 17,350,857 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll>A(N);
int flagN = -1;
int flagP = -1;
for (int i = 0; i < N; ++i) {
cin >> A[i];
if(A[i] < 0) flagN = i;
if(A[i] > 0) flagP = i;
}
ll M = 0;
if(flagN ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
long long i,count=0,ans=0;
for(i=0; i<s.size(); i++)
{
if(s[i]=='B')
count++;
else if(s[i]=='W')
ans=ans+count;
}
cout<<ans;
} | 0 | 68,634,357 |
#include<iostream>
#include<math.h>
#define PI 3.141592/180
using namespace std;
int main()
{
int a,b,C;
double S,L,h;
cin >> a >> b >>C;
h = b * sin(C*PI);
S = a * h / 2;
L = sqrt((a*a)+(b*b)-(2*a*b*cos(C*PI))) + a + b;
cout << S << ' ' << L << ' ' << h << endl ;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
string search[4] = {"maerd", "remaerd", "esare", "resare"};
int d = 0, k;
for (int i = 0; i < s.length();)
{
for (int j = 0; j < 4; j++)
{
k = 0;
... | 0 | 3,040,961 |
#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 drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
#define dame { puts("-1"); return 0;}
#define yn {puts("... | #include <bits/stdc++.h>
using namespace std;
map<int,vector<int>> P;
set<string> RT;
vector<bool> ans;
void prog(int a,string r,vector<bool>T){
T.at(a-1)=true;
if(T==ans){
RT.insert(r);
return;
}
for(int i:P.at(a)){
if(T.at(i-1))continue;
r.push_back(i+'0');
pr... | 0 | 76,078,148 |
#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define all(a) a.begin(), a.end()
#define sz(a) a.size()
#define pb push_back
using namespace std;
const ll mod = 1e9+7;
ll n, d[10000001], ans=0;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("A.txt", "r",... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef long long ll;
typedef long double ld;
int main()
{
string s; cin >> s;
string t; cin >> t;
int len = s.size();
for (int i = 0; i < len; i++)
{
string ... | 0 | 11,817,474 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
int res = 0;
for (int i = 0; i < N;) {
int j = i + 1;
while (j < N && a[j] <= a[j-1]) ++j;
res = max(res, j - i - 1);
i = j;
}
cout << res << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for(ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(ve... | 0 | 25,519,991 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,m;
cin>>n>>m;
int a[m],b[m],c[m];
set<pair<int,int>>edges[n][n];
int dist[n][n];
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++){
if(i==j)
dist[i][j]=0;
else
dist[i][j]=100000;
}
}
for(int i=0;i<m;i++)
{
cin>>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | 0 | 6,903,033 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, uint>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
const int CASES = 3;
void solve(){
int N, K;
ll X[101], Y[101];
cin >> N >> K;
for(int i = 0; i < N; ++i) cin >> X[i] >> Y[i];... | 0 | 86,758,476 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define ff first
#define ss second
#def... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
vec l(1e5+5),r(1e5+5),num(1e5+5);
int main() {
ll n;
cin >> n;
for(ll i=1;i<=n;i++) {
ll tmp;
cin >> tmp;
num[tmp]=i;
... | 0 | 20,756,384 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
int x;
cin >> x;
int n = x / 100;
if (5 * n >= x % 100)
cout << 1 << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
bool betemp(string sleft, string sright, int left, int right) {
if (sleft == sright) return (right - left) % 2 == 1;
else return (right - left) % 2 == 0;
}
void solve(int N) {
string vac = "Vacant";
string sleft, sright, str;
int left = 0, right = N/2;
... | 0 | 68,651,765 |
#include<bits/stdc++.h>
using namespace std;
#define fr(i, n) for(ll i = 0; i < n; i++)
#define frr(i, n) for(ll i = 1; i <= n; i++)
#define frm(i, n) for(ll i = n-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
typedef long long ll;
typedef pair<ll,ll> pii;
typedef pair<double, double> ponto;
typ... | #include <iostream>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#inc... | 0 | 54,460,552 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
#define INF 1e9
#define LINF __LONG_LONG_MAX__
int main() {
int ... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
map<char, int> a;
if(s.length() < 26){
for(... | 0 | 55,261,642 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll q,h,s,d; cin >> q >> h >> s >> d;
ll n; cin >> n;
h=min(2*q,h);
s=min(2*h,s);
ll w=n/2;
ll y=n%2;
ll ans=min(2*s,d)*w+y*s;
cout << ans << endl;
} | #include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)... | 0 | 27,170,483 |
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#include <sstream>
#include <algorithm>
#include <map>
#include <iterator>
#include <queue>
#include <utility>
#include <set>
#include <deque>
#include <string>
using namespace std;
#define endl "\n"
#define ll long l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 2,861,760 |
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
string s;
vector<vector<char> > b{
vector<char>{},
vector<char>{'.',',','!','?',' '},
vector<char>{'a','b','c'},
vector<char>{'d','e','f'},
vector<char>{'g','h','i'},
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll minimum;
ll frog(ll *A,ll n,ll k)
{
ll ans=0,p=0;
ll t[n+1];
for(int i=0;i<=n;i++)
t[i]=INT_MAX;
for(int i=1;i<=n;i++)
{
if(i==1)
t[i]=0;
else if(i>=3&&k>=2)
{
for(int j=i-1;j>=max(i-k,p... | 0 | 49,798,099 |
#include <iostream>
using namespace std;
const int INF = 1000000000;
int main()
{
while(true){
int n;
cin >> n;
if(n==0)
break;
int T[10][10];
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
if(i==j){
T[i][j] = 0;
}
else{
T[i][j] = INF;
}
}
}
int m = 0;
for(int i=0;... | #include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin>>s;
long long int start=0;
long long int end=s.size()-1;
bool ok=tr... | 0 | 36,676,156 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include <bitset>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <stdio.h>
#include <math.h>
#include <bits/stdc++.h>
using namespace... | 0 | 72,233,100 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i=a; i<=b; i++)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int MOD = 1e9+7;
ll n;
map<ll, ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int H,N,A;
cin >> H >> N;
for(int i=0;i<N;i++){
cin >> A;
H -= A;
if(H <= 0){
cout << "Yes" <<endl;
return 0;
}
}
cout << "No" <<endl;
} | 0 | 20,567,410 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n, k; cin >> n >> k;
vector<ll> sum(n + 1);
for(int i = 1; i <= n; i++) {
int a; cin >> a;
sum[i] = (sum[i - 1] + a - 1) % k;
sum[i] = (sum[i] + k) % k;
}
map<ll, ll> mp;
ll ans = 0;
fo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 0 | 16,208,715 |
#include<stdio.h>
int main()
{
int N,i;
scanf("%d %d",&N,&i);
N=N+1-i;
printf("%d",N);
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<assert.h>
#include<string>
#include<cstdlib>
#include<cctype>
#include<unordered_map>
#include<sstream>
#include<numeric>
#include<stack>
usi... | 0 | 98,887,577 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
const int MOD=1e9+7;
const int INF=1e15;
signed 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<<"Y... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s;
int main(void){
cin >> s;
vector<int> c(30);
for(auto i : s) c.at(i-'a')++;
for(int i = 0; i < 26; i++){
if(c.at(i) >= 2){
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
retur... | 0 | 5,335,016 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
int64_t L; cin>>L;
vector<int64_t>a(N);
for(int i=0;i<N;i++)
cin>>a.at(i);
int64_t ans=0;
for(int i=0;i<N-1;i++)
if(L<=a.at(i)+a.at(i+1)){ans=i+1; break;}
if(ans==0)
cout<<"Impossible"<<endl;
else{
cout<<"Possible"<<e... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
int n1;
int n2;
int num;
int cnt;
int ans = 0;
int tmpans;
int m;
while (cin>>n>>n1>>n2,n!=0||n1!=0||n2!=0){
vector<int> vec(n);
m = 0;
for(m = 0;m < n;m++){
cin >> num;
v... | 0 | 71,096,911 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, m;
cin >> a >> b >> m;
vector<int> fridge(a), microwave(b);
int minf = 1e6, minm = 1e6;
for(int i=0; i<a; i++){ cin >> fridge[i]; minf = min(minf, fridge[i]); }
for(int i=0; i<b; i++){ cin >> microwave[i]; minm = min(minm, micr... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
string str;
int ans[26] = {0};
while (getline(cin, str)) {
for (int i = 0; i < str.size(); i++) {
if ('a' <= str[i] && str[i] <= 'z') {
ans[str[i] - 'a']++;
} else if ('A' <= str[i] && str[i... | 0 | 30,392,697 |
#include <bits/stdc++.h>
#define l_ength size
const int inf = (1<<30);
const int mod = 1000000007;
using ll = long long;
using namespace std;
vector<int> graph[250000];
bool besucht[250000];
ll query[250000];
ll res[250000];
void dfs( int p, ll sum ){
if( besucht[p] ) return;
besucht[p] = true;
res[p] = sum;
for( a... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define INF 1e09
using std::cin;
using std::cout;
using std::endl;
usin... | 0 | 90,763,850 |
#pragma gcc optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,r,n) for(ll i=(ll)(r);i<(ll)(n);++i)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
#define pb(n) push... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, char> P;
int n = 0;
int encode(string a){
vector<int> l;
for(int i = 0; i < a.size(); i++){
switch(a[i]){
case 'm':
l.push_back(1000);
break;
case 'c':
l.push_back(100);
break;
case 'x':
l.push_back(10);
... | 0 | 40,771,793 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const int MAX_N = 100000;
const int MAX_S = 317;
int n, s, j, skip, nextskip, lis, idx, nextidx;
int a[MAX_N], sz[MAX_S * 2], top[MAX_S * 2], p[MAX_S], nextp[MAX_S];
int PatienceSorting(int nexti){
int r = -1;
int l = -1;
if(p[0] == -... | 0 | 29,940,617 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear... | 0 | 70,242,510 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | #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 INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N);
... | 0 | 95,213,488 |
#include <iostream>
using namespace std;
int main(){
int n,a[10000],q,q1,q2,q3,q3s;
cin >> n >> q;
for (int i = 0; i <= n; i++){
a[i] = i;
}
for (int i = 0; i < q; i++){
cin >> q1 >> q2 >> q3;
if (q1){
if (a[q2] == a[q3]){
cout << 1 << endl;
} else{
cout << 0 << endl;
}
} else {
q3s = a... | #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; }
void solv... | 0 | 7,684,264 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
string from,to;
cin>>from>>to;
int f[from.size()+1][to.size()+1];
for(int i=0;i<from.size()+1;i++){
for(int j=0;j<to.size()+1;j++){
f[i][j]=0;
}
}
for(int i=1;i<from.size()+1;i++){
f[... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll MOD=1000000007;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
ll n,k;
cin>>n>>k;
ll r[100001];
r... | 0 | 17,371,063 |
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
string a[50];
string b[50];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
bool ok = false;
for (int sy = 0; sy < n; sy++) {
if (sy + m > n) {
... | 0 | 96,038,574 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<list>
#define N 10002
using namespace std;
vector<int> G[N+1];
list<int> ans;
bool visited[N+1];
int indeg[N+1];
int n;
void dfs(int node){
visited[node]=true;
for(int i=0;i<G[node].size();i++){
int v=G[node][i];
if(... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define CFOR(i, str) for(int i = 0; (str)[i]!='\0'; (i)++)
#define FOR(i, s, r) for(ll i = (s); i < (r); i++)
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define SORT(v) sort(v.begin(), ... | 0 | 44,620,395 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int Q;
ll A,B;
bool judge(ll mid)
{
if(mid < A && mid < B)return true;
if(mid % 2)
{
ll mid1,mid2;
mid1 = mid2 = (mid + 1) / 2;
if(A <= mid1)mid1++;
if(B <= mid2)mid2++;
return mid1 * mid2 < A * B;
... | #include<bits/stdc++.h>
using namespace std;
const int maxn=3e5+50;
int n,c[maxn],d[maxn],kd[maxn],f[maxn],res[maxn];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i){
int ai;
scanf("%d",&ai);
++c[ai];
}
for(int i=1;i<=n;++i) ++d[c[i]];
for(int i=0;i<=n;++i) kd[i]=i*d[i];
... | 0 | 37,926,264 |
#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; }
template<typen... | #include<iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
char mat[100][100];
string s = "#.";
for(int i = 0; i < 100; i++){
for(int j = 0; j < 100; j++){
mat[i][j] = s[i/50];
}
}
a--, b--;
for(int i = 0; i < 50; i++){
for(int j = 1 ... | 0 | 36,275,638 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true... | #include <bits/stdc++.h>
using namespace std;
int N;
const int M=1000001;
vector<int>a[M];
bool vis[M];
int gcd(int a,int b){return a?gcd(b%a,a):b;}
main()
{
cin>>N;
for(int i=2;i<M;++i)for(int j=i;j<M;j+=i)a[j].push_back(i);
int g=0;
bool ok=true;
for(int i=0;i<N;++i){
int A;cin>>A;
... | 0 | 56,448,920 |
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No... | 0 | 94,577,610 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b)... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 7,852,597 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <string>
using namespace std;
int main()
{
string s[1001], ms, fs, ss;
int m = 0, c, i = 0;
getline(cin, ss);
stringstream gs(ss);
while(gs >> s[i]){
if(s[i].size() > m){
m = s[i].size();
ms = s[i];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> a(n), num(n + 1, 0);
for (ll i = 0; i < n; i++) {
cin >> a[i];
num[a[i]]++;
}
ll sum = 0;
for (ll i = 0; i <= n; i++) {
sum += num[i] * (num[i] - 1) / 2;
}
for (ll i = 0; i < n; i++) {
ll tmp = 0;... | 0 | 37,451,535 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define nl cout<<"\n";
#define chk(x) cout<<#x<<" : "<<x, nl
#define ll long long int
#define u unsig... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 100005
vector < pair < int , int > > a[N];
int vis[N];
int pos[N];
int valid = 1;
void dfs(int n, int cur)
{
vis[n] = 1;
pos[n] = cur;
for(int i=0;i<a[n].size();i++)
{
if(vis[a[n][i].first]==0)
{
d... | 0 | 59,042,621 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
bool flag=false;
cin >> X >> Y;
for (int i=0; i<X+1; i++){
if (4*X-2*i == Y){
flag=true;
break;
}
}
if(flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 0 | 81,125,740 |
#include <bits/stdc++.h>
using namespace std;
using f32 = float;
using f64 = double;
using LL = long long;
using ULL = unsigned long long;
#define REP(i, n) for (LL i = 0; i < (int)(n); i++)
signed main()
{
string a;
cin >>a;
REP(i,2){
if(a[i]!=a[i+1]){
cout << "Yes";
return 0;
}
}
cout << "No";
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s1,s2;
int count=0;
cin>>s1>>s2;
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
if(i==j)
{
if(s1[i]==s2[j])
{
count++;
}
}
}
}
cout<<count<<endl;
} | 0 | 3,544,496 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s; int w; cin >> s >> w;
string ans = "";
for (int i = 0; i < s.size(); i+=w) {
ans += s[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include<numeric>
#include<cstdlib>
#include <iostream>
#define ll long long int
#define all(x) x.begin(),x.end()
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define v vector<long long int>
#define vv vector< int>
#define gcd(m,n) __gcd(m,n)
#define vp vector<... | 0 | 35,902,269 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>
#include <unordered_s... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#define _USE_MATH_DEFINES
#include<math.h>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<set>
#include<list>
#include<cmath>
#include<stdio.h>
#include<string.h>
#include<iomanip>
#includ... | 0 | 35,044,344 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | #include <bits/stdc++.h>
#include <string>
#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, a, b;
cin >> n >> a >> b;
int sum=0;
for(int i=1; i<=n; i++) {
string s=to_string(i);
int ibuff=0;
rep... | 0 | 51,491,481 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#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 all(a) (a).begin(),(a).end()
#define mod 1000000007
#define pi acos(-1.0)
using namespace std;
signed main() {
cin.tie(0);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
for (int i = 0; i < n; i++){
for (int j = i+1; j < n; j++) {
ans++;
}
}
for (int i = 0; i < m; i++){
for (int j = i+1; j < m; j++) {
ans++;
}
... | 0 | 24,328,859 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Base
{
ll d[65];
const ll mx;
Base(ll mx = 60) : mx(mx)
{
for(ll i = 0; i <= mx; i++) d[i] = 0;
}
void insert(ll x)
{
for(ll i = mx; ~i; --i)
{
if(x & (1LL << i))
{
if(!d[i])... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> v;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
v.push_back(x);
}
vector<int> ans(n);
if(n%2==0)
{
int mid=n/2;
for(int i=0;i<n;i+=2)
{
... | 0 | 67,900,501 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
sort(arr,arr+n,greater<int>());
int mid = n/2;
mid--;
cout<<arr[mid]-arr[mid+1]<<"\n";
} | #include<bits/stdc++.h>
#define rep(i,n) for (int i =0; i <(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int N, M;
cin >> N >> M;
vector<P>A(N);
rep(i,N)cin >> A[i].first >> A[i].second;
sort(A.begin(),A.end());
ll ans = 0;
rep(i,N){
while(A[i].second){
... | 0 | 70,720,036 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
string S;
cin >> S;
bool alphabet[26];
rep(i, 26) alphabet[i] = false;
for (int i = 0; S[i] != '\0'; ++i) {
alphabet[S[i]-'a'] = true;
... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 0 | 57,956,143 |
#include<iostream>
using namespace std;
char ans[2][10]={
"No\n",
"Yes\n"
};
int main(){
int a,b,c;
cin>>a>>b>>c;
bool flag=0;
if(a<b)if(b<c)flag=1;
cout<<ans[flag];
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int sz=110;
vector<int> prime;
int siz;
bool mark[sz];
void seive()
{
int i,j,k,sq;
sq=sqrt(sz);
for(i=3;i<sz;i+=2) mark[i]=true;
for(i=3;i<=sq;i+=2){
if(mark[i]){
for(j=i*i;j<sz;j+=i) mark[j]=false;
... | 0 | 39,632,417 |
#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 n, l;
cin >> n >> l;
vector<string> ss(n);
rep(i, n) { cin >> ss[i]; }
sort(ss.begin(), ss.end());
rep(i, n) { cout << ss[i]; }
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i< (n); ++i)
const long long INF = 1LL<<58;
template<class T> bool chmin(T &a, T b){ if(a>b) a = b; }
template<class T> void chmax(T &a, T b){ if(a<b) a = b; }
template<class T> int former(const vector<T> &v, T x){
... | 0 | 40,168,947 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
const int INF=1e9;
struct edge{
int to,cost;
edge(int a,int b):to(a),cost(b){}
edge(){}
};
struct data{
int At,cost;
data(int a,int b):At(a),cost(b){}
data(){}
bool operator>(const data &d)const{
... | 0 | 17,725,002 |
#include <iostream>
#include <queue>
#include <vector>
#define MAXSIZE 100000
using namespace std;
void calculate(vector<long long int>& lunlun_num)
{
queue<long long int> lunlun_temp;
for (int i = 1; i <= 9; i++){
lunlun_temp.push(i);
lunlun_num.push_back(i);
}
int count = 9;
while (count <= MAXSIZE)... | #include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define ll... | 0 | 65,763,298 |
#include <iostream>
#include <vector>
using namespace std;
long long solve(long long A, long long B){
if(A > B) swap(A, B);
long long L = 0, R = B;
while(R - L > 1){
long long mid = (L+R)/2;
if(mid * mid < A * B) L = mid;
else R = mid;
}
if(L < A) return 2 * L;
if(L * (L+1) < A * B) return 2 * L - 1;
retur... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool is_square(int n)
{
for (int i = 0; i <= n; i++)
{
if (i * i == n)
{
return true;
}
}
return false;
}
double distance(double x1, double y1, double x2, double y2)
{
return sqrt((x1 - x2) * (x1 -... | 0 | 22,474,925 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,k;
cin>>n>>k;
if(n<=k) cout<<"unsafe"<<endl;
else cout<<"safe"<<endl;
return 0;
} | #include <bits/stdc++.h>
using i16 = std::int16_t;
using i32 = std::int32_t;
using i64 = std::int64_t;
using usize = std::size_t;
template<typename T>
using Vector = std::vector<T>;
using String = std::string;
template<typename T>
using UniquePointer = std::unique_ptr<T>;
using namespace std;
#define rep(i, max) for(us... | 0 | 17,400,066 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
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&... | #include<bits/stdc++.h>
using namespace std;
typedef bool boo;
typedef int li;
typedef long il;
typedef unsigned long ul;
typedef long long int ll;
typedef unsigned long long ull;
typedef double dd;
typedef string ... | 0 | 47,452,455 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.