code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define endl "\n"
#define p pair<int, int>
#define arrinp(i, a, start, end); for(ll i = start; i <= end; i++) cin >> a[i];
#define arrout(i, a, start, end); for(ll i = start; i <= end; i++) cout << a[i] << " ";
#define swap(a, b) ... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int prime[25]={
2, 3, 5, 7, 11,
13, 17, 19, 23, 29,
31, 37, 41, 43, 47,
53, 59, 61, 67, 71,
73, 79, 83, 89, 97
};
int main(){
int N;
cin >> N;
vector<int> cnt(25,0);
for(int n=2;n<=N;++n){
int m=n;
for(int i=0;i<25;++i){
... | 0 | 36,976,194 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | 0 | 70,998,695 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define forn(i,a,n) for (int i=a; i<n; i++)
int cnt[2001];
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
cnt[1]=cnt[2]=0;
cnt[3]=cnt[4]=cnt[5]=1;
cnt[6]=2;
forn(i,7,n+1)
cnt[i]=(cnt[i-1]+cnt[i-3])%1000000007;
cout... | #include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
const int inf = 0x3f3f3f3f3f3f3f3LL;
const int mod = (int)1e9 + 7;
using namespace std;
#if LOCAL
#include "../../tr.h"
#else
#define tr(...)
#define endl '\n'
#endif
template<class T, class T2> void ... | 0 | 59,062,581 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A1, A2, A3;
cin >> A1 >> A2 >> A3;
cout << max(max(A1,A2),A3)-min(min(A1,A2),A3) << endl;
} | #include<iostream>
#include <bits/stdc++.h>
#include<algorithm>
#include <cstring>
#define endl "\n"
#define SRK ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define EPS 1e-6
typedef long long ll;
using namespace std;
int main()
{
SRK;
int i,temp = 0;
string a,b;
cin >> a >> b;
if (a... | 0 | 87,980,033 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<bitset>
#include<list>
#include<cassert>
#include<numeric>
#include<iomanip>
using namespace std;
int n, l, t;
vector <int> finish;
int main()
{
cin >> n >> l >> ... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const ll p = 1e9+7;
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
vector<ll> d(61);
rep(i,n){
for(int j=0;j<=60;j++){
if(((ll)1<<j)... | 0 | 80,978,157 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll X1, Y1, X2, Y2, X3, Y3, X4, Y4;
cin >> X1 >> Y1 >> X2 >> Y2;
ll dX = X2 - X1, dY = Y2 - Y1;
X3 = X2 - dY;
Y3 = Y2 + dX;
X4 = X1 - dY;
Y4 = Y1 + dX;
cout << X3 << " " << Y3 << " " << X4 << " " << Y4 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
vector<int>xs(n);
for (int i = 0; i < n; i++)cin >> xs.at(i);
xs.push_back(x);
vector<int>ys(m);
for (int i = 0; i < m; i++)cin >> ys.at(i);
ys.push_back(y);
sort(xs.begin(), xs.end());
so... | 0 | 48,578,037 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define OUT(x) cout << (x) << endl;
#define ALL(v) v.begin(), v.end()
#define REP(i, n) for (int i=0; i<n; ++i)
int main() {
int N, A, B;
cin >> N >> A >> B;
string ans;
for(;;){
if(A+1==B) {
ans = "Borys";
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x... | 0 | 24,210,597 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#de... | #include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> m,f,r;
int m1,f1,r1;
do{
cin>>m1>>f1>>r1;
m.push_back(m1);
f.push_back(f1);
r.push_back(r1);
}while (m1!=-1 || f1!=-1 || r1!=-1);
int i;
for (i=0;i<m.size()-1;i++){
char c;
... | 0 | 90,530,480 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using P = pair<int,int>;
using ll = long long;
using namespace std;
int main(void){
int n, k;
cin >> n >> k;
int a[n];
rep(i, n) cin >> a[i];
sort(a, a + n);
int sum = 0;
rep(i, k) sum += a[i];
cout << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 2e5 +... | 0 | 59,443,625 |
#include<bits/stdc++.h>
#define maxn 100005
using namespace std;
int n,m;
int main()
{
int x,y,l=0,r=maxn;
scanf("%d %d",&n,&m);
for(int i=1;i<=m;i++)
{
scanf("%d %d",&x,&y);
l=max(x,l),r=min(y,r);
}
if(l>r)printf("0");
else printf("%d\n",r-l+1);
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
const int m=1e9;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
t=1;
while(t--)
{
int n,k,x,y;
cin>>n>>k>>x>>y;
if(n<=k)
{
cout<<n*x<<endl;
}
... | 0 | 12,125,118 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #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 | 57,101,464 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
string s;
cin >> s;
long long int n = s.size();
long long i... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 49,357,876 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int n;
... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/range/adaptor/reversed.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long int ll;
#define PI (acos(-1))
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define dump(x)... | 0 | 97,413,726 |
#include<iostream>
using namespace std;
int main()
{
int w,h,x,y,r,t=0;
cin>>w>>h>>x>>y>>r;
if(x>=r&&y>=r)
{
if((w-x)>=r&&(h-y)>=r)
{
t=1;}
}
if(t==1)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 0 | 34,130,603 |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
while(cin>>a>>b>>c){
if(a<b && b<c){
cout<<"Yes\n";
}else{
cout<<"No\n";
}
}
} | #include <iostream>
#include <vector>
using namespace std;
const int INF = 10000000;
int dp[101][101];
int DP(int x,int y){
if(x <= 0 || y <= 0)return 0;
if(dp[x][y] == INF)return 0;
if(dp[x][y] != 0)return dp[x][y];
dp[x][y] = DP(x-1,y) + DP(x,y-1);
return dp[x][y];
}
int main(){
while(1){
int a,b;
cin >> a ... | 0 | 31,012,209 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int diff;
diff = a - b;
if (c - diff > 0){
cout << c - diff << endl;
}
else{
cout << 0 << endl;
}
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 | 98,023,541 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * b) - (a + b - 1);
} | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | 0 | 71,736,246 |
#include <bits/stdc++.h>
using namespace std;
#define is_uruu leapyear
#define ll long long
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ROF(i,a,b) for(int i=(a);i>(b);--i)
#define REP(i,a) for(int i=0;i<(a);++i)
int n, C[2000000]={0};
void countSort(int A[], int B[], int k){
FOR(i, 0, n){
C[A[i]]++;
}
FOR(... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define INF 1000000
int dp[25][50005];
int c[25];
int main(void) {
int n,m;
scanf("%d%d",&n,&m);
for(int i=1; i<=m; i++)
scanf("%d",&c[i]);
for(int i=0; i<=20; i++)
for(int j=0; j<=50000; j++)
dp[i... | 0 | 86,319,854 |
#include <bits/stdc++.h>
using namespace std;
int main(){
const int64_t mod = 1e9 + 7;
int64_t n, ans = 1; string s; cin >> n >> s;
vector<int> cnt(26, 0);
for (auto i = 0; i < n; i++) cnt[s[i] - 'a']++;
for (auto i = 0; i < 26; i++) ans = (ans * (cnt[i] + 1)) % mod;
cout << ans - 1 << endl;
... | #include<iostream>
#include<string>
using namespace std;
int main() {
string S, T; cin >> S >> T;
int M = S.size(), N = T.size();
if (N > M) cout << "UNRESTORABLE" << endl;
else {
string min_s(M, '~');
for (int i = 0; i <= M - N; i++) {
bool sat = true;
for (int j = 0; j < N; j++) {
... | 0 | 20,726,021 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int a, b;
string s;
cin >> a >> b >> s;
rep(i, a + b + 1)
{
if (i == a)... | #include <iostream>
using namespace std;
int main()
{
int w, h;
do
{
cin >> w >> h;
if(w == 0 && h == 0)
break;
else
for(int i = 0; i < w; i++)
{
for(int c = 0; c < h; c++)
cout << '#';
cout << e... | 0 | 70,017,271 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
typedef long long ll;
const int inf=1e9;
int main(){
int a,b,c,d;cin>>a>>b>>c>>d;
int ans=min(a,b);
ans+=min(c,d);
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | 0 | 52,609,927 |
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (t... | 0 | 28,914,534 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e16+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int dp[100005][2];
signed main() {
string L;
cin >> L;
dp[0][0] = 1;
dp[0][1] = 2;
for(int i = 1; i < L.size(); i++) {... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <map>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return ... | 0 | 35,145,405 |
#include <iostream>
#include <vector>
using namespace std;
constexpr int64_t MOD = 998'244'353;
int main(void) {
int N;
cin >> N;
vector<int> D(N);
vector<int> num(N);
for(int i=0; i<N; i++) {
cin >> D[i];
num[D[i]]++;
}
int64_t ans = 1;
if(D[0] != 0 || num[0] != 1) {
... | #include<bits/stdc++.h>
using namespace std;
#define lop(i,n) for(ll i=0;i<n;i++)
#define lop1(i,n) for(ll i=1;i<=n;i++)
#define lopr(i,n) for(ll i=n-1;i>=0;i--)
#define ll long long int
#define pb push_back
#define all(v) v.begin(),v.end()
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl '... | 0 | 90,615,505 |
#include <bits/stdc++.h>
#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 chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | #include <iostream>
using namespace std;
int main(void){
int N;
cin >> N;
int isOK,isNG,mid;
string A;
cout << "0" << endl;
fflush(stdout);
cin >> A;
if(A=="Male")
isOK = 0;
else if(A=="Female")
isNG = 0;
else
return 0;
cout << N-1 << endl;
fflush(stdout);
cin >> A;
if(A=="Male")... | 0 | 91,083,185 |
#include"bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
queue<pair<string, int>> q;
rep(i, N) {
pair<string, int> p;
cin >> p.first >> p.second;
q.push(p);
}
string X;
int ans = 0;
cin >> X;
bool judge = false;
rep(i, N) {
if (jud... | #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 | 42,274,927 |
#include<bits/stdc++.h>
using namespace std;
string r = "yuiophjklnm";
string l = "qwertasdfgzxcvb";
bool hand(char c){
for(int i = 0; i < r.length(); i++){
if(c == r[i])return true;
}
return false;
}
int main(){
string str;
while(cin >> str, str != "#"){
bool now = hand(str[0]);
int cnt = 0;
... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 0 | 67,164,796 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define F first
#define S second
#define IN inline
#define RE register
#define random(x) (rand()%... | #include<iostream>
using namespace std;
int main()
{
int n, x;
while (cin >> n >> x, !(n == 0 && x == 0)) {
int counter = 0;
for (int i = 1; i <= n - 1; i++) {
for (int j = i + 1; j <= n; j++) {
int k = x - i - j;
if (k >= 1 && k <= n && k > i && k > j) {
counter++;
}
}
}
cout << counte... | 0 | 45,087,099 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
#define rep(i,N) for(int i=0;i<(int)N;++i)
typedef long long ll;
using namespace s... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | 0 | 88,871,859 |
#pragma GCC optimize("O3")
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdlib>
#include<set>
#include<vector>
#include<sstream>
#include<queue>
#include <iomanip>
#include<unordered_set>
#include <stack>
#include <unordered_map>
#include <map>
constexpr auto INF = 92233720368547758... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
}
int kan_hyaku(int n){
... | 0 | 86,038,895 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int a, b , c, n;
cin >> a >> b >> c;
n = c / a + 1;
for(int i = 1; i < n; i++){
int s = 0;
s = a * i;
if(b <= s){
cout <<"OK\n";
return 0;
}
}
cout << "NG\n";
} | #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;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll n;
vector<string> S;
int main() {
cin >> n;
S.resize(n);
rep(i, n) cin >> S[i];
map<char, ll> mp;
rep... | 0 | 6,190,448 |
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,t,x,y;
int x1=0,y1=0,t1=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>t>>x>>y;
if((t-t1)-abs(x-x1)-abs(y-y1)>=0 && ((t-t1)-abs(x-x1)-abs(y-y1))%2==0){
t1=t;
x1=x;
y1=y;
... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
long long getDigit(long long n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),... | 0 | 84,009,509 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef pair < int , int > pp;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;
int i,n,a,b,t,x,k;
signed main(){
cin >> n >> a >> b;
if(n < a+b-1 || n > 1LL*a*b){
cout << -1;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0;i < n;i++){
cin >> a[i];
}
ll ans = a[0];
for (ll i = 1; i < n; i++){
ans = gcd(ans, a[i]);
}
... | 0 | 71,049,343 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<set>
#include<map>
#include<stdlib.h>
#include<stdio.h>
#include<vector>
#include<utility>
#include<queue>
#include<stdbool.h>
#include<math.h>
typedef long long ll;
#define N (1000000000+7)
using namespace std;
t... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n) { for (int i = 0; i < n; ++i) par[i] = i; }
void init(int n) { par.resize(n); for (int i = 0; i < n; ++i) par[i] = i; }
int root(int x) {
if (par[x] == x) retu... | 0 | 97,090,590 |
#include <iostream>
#include <vector>
using namespace std;
using int64 = long long;
using PII = pair<int64, int64>;
int64 CountInside(int64 x0, int64 y0, int64 x1, int64 y1, const vector<PII>& xys) {
int64 res = 0;
for (auto& xy : xys) {
if (x0 <= xy.first && xy.first <= x1 &&
y0 <= xy.second && xy.seco... | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) cout << x << endl; return... | 0 | 97,047,641 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define LOOP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define MP make_pair
#define FIR first
#define SEC second
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=1000000009;
signed... | #include <iostream>
using namespace std;
int main() {
int n;
while(cin>>n){
int count=0;
for(int i=9; i>=0; i--){
for(int j=9; j>=0; j--){
for(int k=9; k>=0; k--){
for(int l=9; l>=0; l--){
if(i+j+k+l==n)count++;
}
}
}
}
cout<<count<<endl;
}
return 0;
} | 0 | 74,406,372 |
#include <iostream>
using namespace std;
typedef long long ll;
ll sq (ll x) {
return x * x;
}
int main () {
ll S;
cin >> S;
ll p = 0;
for (ll k = 1 << 30; k != 0; k /= 2) {
if (sq(p + k) < S) {
p += k;
}
}
p++;
cout << 0 << " " << 0 << " "
<< p << " " << sq(p) - S << " "
<< 1... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 57,836,178 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int, int>;
int main() {
char a, b;
cin >> a >> b;
if ((a=='H' && b=='H') || (a=='D' && b=='D')) {
cout << 'H' << endl;
}
else {
cout << 'D' << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | 0 | 10,889,288 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (n); i++)
#define MOD 1000000007
using ll = long long;
typedef pair<int, int> P;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(b>=c){
cout<<"delicious"<<endl;
return 0;
}
if(c-b<=a){
cout<<"safe"<<... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 2000000010;
constexpr ll INF= 2000000000000000000;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
typedef pair<int,P> PP;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
... | 0 | 10,782,271 |
#include <bits/stdc++.h>
#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)
#define pb push_back
#define sz(x... | #include<iostream>
#define _USE_MATH_DEFINES
#include<math.h>
#include<vector>
#include<array>
#include<algorithm>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef long dou... | 0 | 1,673,326 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define all(sdk) sdk.begin(),sdk.end()
#define mll map<ll, ll>
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define repd(i,a,b) for(ll i=a;i>=b;--i)
#define hell 100000000... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define Max(x,y,z) max(x,max(y,z))
#define Min(x,y,z) min(x,min(y,z))
#define fr(i,s,e) for(i=s;i<e;i++)
#define rf(i,s,e) for(i=s-1;i>=e;i--)
#define pb push_back
#define mp make_pair
typedef l... | 0 | 40,655,034 |
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, d; cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> x[i][j];
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
i... | 0 | 64,189,956 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
typedef double DOUBLE;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REP... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
int main(){
int n;
std::cin >> n;
std::vector<int> a(n), orderd(n);
for(int i = 0; i < n; i++){
std::cin >> a[i];
orderd[i] = a[i];
}
std::sort(orderd.begin(), orderd.end());
if(orderd[n - 1] == orderd[n... | 0 | 90,143,588 |
#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long U... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb(x) push_back(x)
#define f(i,st,n) for(i=st;i<n;i++)
#define vec vector
#define mst(a,b) memset(a,b,sizeof(a))
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set... | 0 | 39,748,375 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1001001001;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
template<typename T>
struct BIT{
int n;
vector<T> d;
BIT(int n = 0):n(n),d(n+1){}
void add(int i,T x=... | 0 | 26,768,272 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
string s;
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
cin >> s;
if(s == "snuke"){
cout << (char)('A'+j-1) << i << endl;
}
}
}
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
for(int i = 0; i < s.size(); i++){
string tmp = s;
for(int j = 0; j < s.size(); j++){
tmp[j] = s[(j+i)%s.size()];
}
if(tmp == t){
puts("Yes");
... | 0 | 6,116,812 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<long double, pair<long long, long long>>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].second.first >> a[i].second.second;
a[i].first = atan2(a[i].second.second, a[i].s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string s;
cin>>s;
int c=0;
for(int i=65;i<=90;i++){
for(int j=0;j<4;j++){
if(s[j]==i){
c++;
break;
}
}
if(c>2)
break;
}
if(c... | 0 | 13,001,311 |
#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 unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | #include <bits/stdc++.h>
using namespace std;
void input(int& rnTrgSu, int& rnTrgKin)
{
cin >> rnTrgSu >> rnTrgKin;
}
int dfs(int nPos, int nTrgSu, int nTrgKin, vector<int>& rvnMoneyCnt)
{
const vector<int> cnvnMoney{10000, 5000, 1000};
if (nTrgSu == 0 && nTrgKin == 0) return 1;
if (nTrgKin < 0) ... | 0 | 66,219,375 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
int main(){
int n;scanf("%d",&n);
vector<int> a(n);
rep(i,n) scanf("%d",&a[i]);
lint ans=a[0]-1;
int x=2;
for(int i=1;i<n;i++){
if(a[i]==x){
x++;
}
else if(a[i]>x){
ans+=(a[i]-1)/x;
}
}
prin... | #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 mod 1000000007
typedef long long ll;
int main(){
string str;
cin >> str;
string checkStr = "";
rep(i, str.length()){
if(str[i] != 'x') checkStr = checkStr + str[i];
}
... | 0 | 68,052,697 |
#include <stdio.h>
int a,b,c,i;main(){for(;i<4;i++,scanf("%d",&a),b+=a);for(;~scanf("%d",&a);c+=a);printf("%d\n",b>c?b:c);} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 0 | 20,187,258 |
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<set>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) scanf("%d%d%d",&a... | #pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize ("-ffloat-store")
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for(i=0;i<(n);++i)
#define repA(i,j,n) for(i=(j);i<=(n);++i)
#define repD(i,j,n) for(i=(j);i>=(n)... | 0 | 47,482,604 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int N;
cin >> N;
vector<ll> vec(N+1);
for(int i=0;i<=N;i++){
if(i==0){
vec[i]=2;
}
if(i==1){
vec[i]=1;
}
if(i>1){
vec[i]=vec[i-1]+vec[i-2];
}
}
cout << vec[N] <<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N_MAX = 100002;
int n;
ll L, t;
ll x[N_MAX];
int w[N_MAX];
vector <int> v1, v2;
int ans[N_MAX];
int last1 (int pos)
{
int l = 0, r = (int)v1.size() - 1;
while(l < r)
{
int mid = ((l + r + 1) >> 1);
if(x[v1[mid]] > ... | 0 | 7,700,508 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
for (int i = 13; i < 1300; i++) {
if (i * 8/100 == A && i * 1/10 == B) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
} | #pragma region header
#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>
#i... | 0 | 10,055,509 |
#include<bits/stdc++.h>
using namespace std;
const int N = 10010;
int fa[N];
int findfa(int x){
if(x == fa[x]) return x;
return findfa(fa[x]);
}
int main(){
int n, q;
scanf("%d %d", &n, &q);
for(int i = 0; i < n; i++) fa[i] = i;
for(int time = 0; time < q; time++){
int a, b, c;
s... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath... | 0 | 26,981,503 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#define rep(i,n) for (int i=0; i < (n); ++i)
using namespace std;
using ll = long long ;
const int INF = 1001001001;
using namespace std;
int main() {
int k,s ;
cin >> k >> s ;
int an... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
bool bo=false;
for(int i=0;i<S.size();i++){
if(i==0){
if(S[i]!='A'){
cout<<"WA"<<endl;
return 0;
}
}else if('A'<=S[i] && S[i]<='Z'){
if(i==1 || i==S.size()-1 || S[i]!='C' || bo){
cout<<"... | 0 | 930,322 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
int main(){
ll N,K;
cin >> N >> K;
double ans=0;
for(ll i=0;i<N;i++){
int nn = i+1;
double tmp = 1.0/N;
while(nn<K){
nn*=2;
tmp/=2;
}
ans += t... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define NMAX 100005
int N;
int path[NMAX];
int L[NMAX];
int compute(){
L[0] = path[0];
int length = 1;
for (int i = 1; i < N; ++i)
{
if (path[i] > L[length-1])
{
L[length] = path[i];
length++;
} else {
*lower_bound(L, L +... | 0 | 17,189,978 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef pair<int,int> P;
const int INF = 1e9+7;
int main(){
int r;
cin >> r;
if(r<1200){
cout << "ABC";
}else if(1200<=r&&r<2800){
cout << "ARC";
}else{
cout << "AGC"... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
typedef long long int64;
int main() {
string S; cin >> S;
int ans = 0;
int l = 0, r = S.size() - 1;
while(l < r) {
if(S[l] == S[r]) {
++l, --r;
} else if(S[l] == 'x') {
+... | 0 | 53,872,722 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
cons... | #include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | 0 | 43,515,901 |
#include <map>
#include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <string>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> T &chmin(T &... | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long modpow(long long m, long long n) {
if (n == 0) return 1;
if (n % 2... | 0 | 73,488,054 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
int minx=200,miny=200,maxx=-200,maxy=-200;
for(int i=0;i<n;i++){
int a;
cin>>a;
maxx=max(maxx,a);
minx=min(minx,a);
... | #include <bits/stdc++.h>
#ifndef LOCAL
#pragma GCC optimize(3)
#endif
using namespace std;
typedef long long ll;
const int maxn=1e5+100;
int n;
int len[maxn];
bool inq[maxn];
int spfa() {
queue<int> q;
memset(len, 0x3f3f, sizeof(len));
memset(inq, 0, sizeof(inq));
inq[1] = 1, len[1] = 1;
q.push(1);
... | 0 | 36,760,832 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B, C;
cin >> A >> B >> C;
bool b = false;
for (int i = 1; i <= A * B; i++) {
int n = A * i;
if (n % B == C) {
b = true;
break;
}
}
cout << (b ? "YES" : "NO") << endl;
... | #include <iostream>
using namespace std;
int main(void){
int n,x;
int c = 0;
while(1){
cin >> n >> x;
if(n == 0 && x == 0) break;
for(int i = 1; i <= n; i++){
for(int j = i + 1; j <= n; j++){
for(int k = j + 1; k <= n; k++){
if((i + j... | 0 | 8,289,997 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
string s; cin >> s;
int n = s.size();
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
ll d[2], k;
cin >> d[0] >> d[1] >> k;
int cnt = 0;
rep(i, k) {
int id = cnt % 2;
if (d[id] % 2 == 1)
--d[id];
d[id] /= 2;... | 0 | 45,959,921 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const ll mod = 1000000007;
const ll INF = 1e+14;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
const int MOD=1e9+7;
vector<int> white,black;
vector< vector<int> > adj;
void dfs(int curr, int prev)
{
for(auto u:adj[curr])
{
if(u!=prev)
dfs(u,curr);
}
white[curr]=1;black[curr]=1;
for(auto u:adj[curr])
{
if(u!=prev)
{
... | 0 | 36,237,645 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (int)n; i++)
int main(){
ll n,a,b;
cin >> n >> a >> b;
ll c = a+b;
ll ans = a * (n/c);
ans += min(n%c, a);
cout << ans << endl;
} | #include<iostream>
#include<vector>
#include<string>
#include<map>
#include<set>
#include<algorithm>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
int main(void) {
int n;
vector<int> a;
cin>>n;
for(int i = 0;i < n;i++) {
int temp;
cin>>temp;
a.push_back... | 0 | 48,176,093 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
usin... | #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++)
const long long INF = 1LL<<60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<clas... | 0 | 19,238,493 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
long long int k;
cin >> k;
int ans;
for(int i = 0; i < s.length(); i++){
if(s[i] != '1'){
ans = s[i]-'0';
break;
}else if(i == k-1){
an... | 0 | 2,628,871 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,num[100],tmp
;
int i,j;
int min,cnt=0;
cin >> N;
for(i = 0 ; i < N ; i++){
cin >> num[i];
}
for(i = 0 ; i < N ; i++){
min = i;
for(j = i ; j < N ; j++){
if(num[j] < num[min]){
min = j;
}
}
tmp = num... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,ans=0;
cin>>n;
if(n%2!=0)
{
cout<<0<<endl;
return 0;
}
n/=2;
while(n>0)
{
ans+=(n/5);
n/=5;
}
cout<<ans<<endl;
return 0;
} | 0 | 60,731,972 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
int S;
cin >> S;
vector<bool> passed(1000000, false);
passed.at(S) = true;
int ans = 1;
while (true){
if (S % 2 == 0){
S /= 2;
}
else{
S = 3 * S + 1;
}
ans++;
if (passed.at(S) == true){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | 0 | 39,476,627 |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
double N, K;
int n;
cin >> N >> K;
double exp = 0;
for (n =1 ;n<=N;n++){
exp += pow(0.5, fmax(0,ceil(log2(K/n))));
}
std::cout << std::fixed;
std::cout << std::setprecision(12);
std::cout... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n1,n2,S[5],cnt=0;
cin>>n1>>n2;
for(int i=n1;i<=n2;i++){
int tmp=i;
int j=4;
while(tmp>0){
S[j]=tmp%10;
tmp/=10;
j--;
}
if (S[0]==S[4]&&S[1]==S[3])cnt++;
}
cout<<cnt<<endl;
} | 0 | 78,974,473 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<climits>
using namespace std;
static const int MAX = 100;
static const long long INFTY = (1LL<<32);
int n;
long long d[MAX][MAX];
void floyd(){
for(int i=0;i<n;i++)
for(int j=0;j<n;j++){
if(d[j][i]==INFTY)continue;
for(int k=0;k<n;k++){
if(d[i][k]==INFTY)... | #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <deque>
#include <stack>
#include <algorithm>
#include <memory.h>
#define rep(idx, max) for(int idx = 0, idx##Max = (max); idx < idx##Max; idx ++)
#define rrep(idx, min, max) for(int idx = (min), idx##Max = max; idx < idx##Max; idx ++)... | 0 | 798,743 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if(a+b==15) printf("+\n");
else if (a*b==15) printf("*\n");
else printf("x\n");
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leadinz zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | 0 | 43,396,764 |
#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>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | 0 | 49,064,716 |
#include<bits/stdc++.h>
#define pi acos(-1)
#define ll long long
#define pii pair<ll,ll>
#define debug(a) cout<<a<<'\n'
#define maxn 100009
#define MOD 1000000007
#define F first
#define S second
#define rep(i, a, b) for(ll i = a; i < (b); ++i)
#define per(i, b, a) for(ll i = b-1; i>=a ; i--)
#define trav(a, x) for(au... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int max=0;
int tsk=1;
for(int i = 0;i<=N;++i){
int res=0;
int kari=i;
while(true){
if(kari!=0){
if(kari%2==0) ++res;
else break;
}
else{
break;
... | 0 | 53,462,262 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
using P = pair<int,int>;
int main(){
int n, m;
cin >> n >> m;
vector<P> ans;
if(n%2){
for(int l = 1, r = n-1; l < r; l++, r--){
ans.emplace_back(l,r);
}
}else{
bool flag = false;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int count;
count = 0;
for (int i = 0; i < 3; i++)
{
if (s[i] == 'R')
{
count++;
}
}
if (s[1] == 'S' && count == 2)
{
count = 1;
}
cout << count << endl;
... | 0 | 42,996,708 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | #include <unordered_set>
#include <string>
#include <iostream>
using namespace std;
int main() {
typedef unordered_set<string> set_t;
set_t A;
int n;
string s,t;
cin >> n;
for (int i = 0; i<n; i++){
cin >> s >> t;
if (s == "insert"){
... | 0 | 53,328,884 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | #include<iostream>
#include<vector>
int n;
long long total;
std::vector<int> d;
std::vector<int> cur;
int k = 2;
void combination_cnt(int start, int cnt){
if(cnt == k){
total += d[cur[0]] * d[cur[1]];
return;
}
for(int i = start; i < n; i++){
cur.push_back(i);
combination_cnt... | 0 | 2,352,168 |
#include <iostream>
using namespace std;
int A[3] = {};
void conf(char a){
if(a == 'a') A[0]++;
else if(a == 'b') A[1]++;
else A[2]++;
}
int main(){
char c[3];
for(int i = 0; i < 3; i++){
cin >> c[i];
conf(c[i]);
}
if(A[0] == 1 && A[1] == 1 && A[2] == 1){
cout << "Yes" << endl;
}else{
co... | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) !=... | 0 | 75,157,550 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespac... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_s... | 0 | 92,819,174 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi 2*acos(0.0)
#define f first
#define s second
#define pb push_back
#define gap ' '
#define fastio {ios_base::sync_with_stdio(false);cin.tie(NULL);}
#define mod 1000000007
#define N 100005
ll n,m;
ll ara[N],sum[N];
map<ll,ll> mp;
int main(){
... | #include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);
int main(){
fastIO;
int N;
cin >> N;
vector<long long> x(N+1,0);
vector<long long> y(N+1,0);
vector<long long> t(N+1,0);
for(int i=1; i<N+1; i++){
cin >> t[i] >> x[i] >> y[i];... | 0 | 79,811,341 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
int ma... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define PER(i, n) for (int i = (n-1); i >= 0; --i)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(AL... | 0 | 23,633,931 |
#include<bits/stdc++.h>
#include<stdlib.h>
#include<stdio.h>
#define test ll t; cin>>t; while(t--)
#define FOR(p,n) for(ll i=p;i<(ll)n;i++)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 100... | #include<cstdio>
int main(){
int n;
int i,j,k;
while(scanf("%d",&n) != EOF){
int counter = 0;
for(i=0;i<=9;i++){
for(j=0;j<=9;j++){
for(k=0;k<=9;k++){
if(n-(i+j+k) >= 0 && n-(i+j+k) <= 9){
counter++;
}
}
}
}
printf("%d\n",counter);
}
return 0;
} | 0 | 90,310,428 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
stri... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 0 | 959,425 |
#include<iostream>
#include <algorithm>
#include<map>
using namespace std;
int arr1[10000005];
long long solveitabdo(long long x)
{
for (long long i = 1; i <= x; i++)
{
for (long long j = i; j <= x; j += i)
{
arr1[j]++;
}
}
long long back1 = 0;
for (long long i = 1; i <= x; i++)
{
back1 += arr1[i] * i... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
using namespace std;
#define int long long
#define double long double
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) str... | 0 | 19,140,641 |
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int a, c;int b;
double ans, ra, rb;
string FatString;
cin >> FatString;
cout << char(FatString[0] - 'a' + 'A');
cin >> FatString;
cout << char(FatString[0] - 'a' + 'A');
cin >> FatString;
cout << char(FatString[0] - 'a' + 'A');
... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <functional>
#include <cmath>
#include <cstring>
#include <numeric>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <complex>
#include <list>
#include <cassert>
#include <deque>
#i... | 0 | 95,051,144 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, M, pos, i, j;
cin>>N>>M;
vector<vector<int>> P(N);
vector<int> Num(N, -1), Sb(N);
queue<int> node;
for(i=0; i<M; i++){
int a, b; cin>>a>>b;
P[a-1].push_back(b-1);
P[b-1].push_back(a-1);
}
node.push(0); Num[0]=0;
while(node.siz... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int l=s.length();
if(l==6)
{
if(s[2]==s[3] && s[4]==s[5])
{
cout<<"Yes\n";
}
else cout<<"No\n";
}
else cout<<"No\n";
} | 0 | 33,777,657 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
#define MAX_M 100000000
int n;
int m;
char D[MAX_M];
char a,b;
int use[MAX_M];
typedef pair<char,char> P;
vector<P> A;
int main(){
while(true){
scanf("%d",&n);
if(n ==0)
break;
for(int i = 0;i < n;i++){
cin >>a>>b;
A.push_back... | 0 | 8,239,812 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll X, Y;
cin >> X >> Y;
int ans = 1;
ll A = X;
while (1) {
A *= 2;
if (A > Y) break;
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define deg2rad(de... | 0 | 69,948,091 |
#include <bits/stdc++.h>
#define ll long long
#define un unsigned
#define de double
#define pi acos(-1.0)
#define FF first
#define SS second
#define pb push_back
#define mp make_pair
#define mem(ae, value) memset(ae, value, sizeof(ae))
#define all(x) x.begin( ), x.end( )
#define UNIQUE(x) x.resize(unique(all(x)) - x.be... | #include<iostream>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#define debug(a) cout << "*" << a << "*" << endl
using namespace std;
typedef long long ll;
ll m, n;
int main()
{
while (~scanf("%lld%lld", &m, &n))
{
if (m == 1 && n == 1)
pr... | 0 | 69,816,373 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int l;
cin >> l;
cout << fixed << setprecision(100) << (long double)(l * l * l / 27.0) << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define INFTY 10000000000
typedef long long int ll;
const int MOD=1000000007;
using Graph = vector<vector<int>>;
using ipair = pair<ll,ll>;
bool operator< (const ipair a, const ipair b){return a.first < b.first;};
#define rep(i,n) for (ll i = 0; i < (n); ++i)
ll gcd(ll a, ll... | 0 | 81,890,755 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
int main()
{
int n, p;
cin >> n >> p;
string s;
cin >> s;
if(10 % p == 0 ){
ll ans = 0;
rep(r,n){
if((s[r] - '0') % p == 0... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> f(int n) {
vector<int> res(30);
for (int i = 0; i < 30; i++) {
res[i] = (n >> i) & 1;
}
return res;
}
int main() {
int n, k; cin >> n >> k;
auto K = f(k);
vector<ll> sum(30);
ll res = 0;
for (int i = 0; i < n; i++) {
... | 0 | 95,083,776 |
#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,string>;
int main() {
string o,e;
cin >> o >> e;
int n = o.size()+e.size();
string ans(n,'a');
int j = 0;
for(int i = 0; i < n; i+=2){
ans.at(i) = o.at(j);
j++;
}
j = 0;
for(in... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int map[2000][2000];
int main(void) {
int q;
scanf("%d",&q);
for(int i=0; i<q; i++) {
memset(map, 0, sizeof(map));
char x[2000], y[2000];
scanf("%s%s",x,y);
int xl=strlen(x),yl=strlen(y);
for(... | 0 | 70,731,391 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(3);
for (int i = 0; i < 3; i++) cin >> a.at(i);
vector<bool> odd(3, 0);
int oddcount = 0;
int res = 0;
for (int i = 0; i < 3; i++) {
if (a.at(i) % 2 != 0) {
oddcount++;
odd.at(i) = 1;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod... | 0 | 67,826,117 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define debug(x) cerr << #x << " = " << x << endl
int main(int qtd, char* nome[])
{
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
if(s[2] == s[3] && s[4] == s[5])
cout << "Yes\n";
else
cout << "No\n";
return 0;
} | #include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <string>
#include <sstream>
#include <stack>
#include <iomanip>
#include <numeric>
#include <queue>
#include <climits>
#include <bitset>
#include <set>
#include <complex>
#include <cmath>
#include <cstring>
#include <map>
using namespac... | 0 | 17,536,425 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | 0 | 4,305,009 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,max=0,min=100;
cin >> a >> b >> c;
if(a>max) max=a;
if(b>max) max=b;
if(c>max) max=c;
if(a<min) min=a;
if(b<min) min=b;
if(c<min) min=c;
cout << max-min;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;cin>>n;
int a[n];rep(i,n)cin>>a[i];
int sum=abs(a[0]);rep(i,n-1)sum+=abs(a[i+1]-a[i]);
sum+=abs(a[n-1]);
rep(i,n){
int ans = sum;
if(i==0)ans = ans - ... | 0 | 66,111,406 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(void){
ll n;
cin >> n;
string str, t;
cin>>str>>t;
ll result = 0;
for(ll i = 0; i < n; i++){
for(ll j = 0; j < n; j++){
if(str[i+j]!=t[j]){
result=max(result, j);
brea... | 0 | 89,284,577 |
#include <iostream>
#include <string>
int main() {
int n; std::cin >> n;
std::string s, t; std::cin >> s >> t;
for (int i = 0; i < n; ++i) {
std::cout << s[i] << t[i];
}
std::cout << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<ll,ll> P;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
ll n,A,B,C;
cin >> n >> A >> B >> C;
vector<ll> l(8,0);
ll ans = (ll)1e12;
... | 0 | 6,631,321 |
#include <bits/stdc++.h>
#define ft first
#define sd second
#define sz(x) ((int)x.size())
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef double de;
int main() {
int x, y;
cin >> x >> y;
cout << ((x % y)? x: -1);
return 0;
} | #include <iostream>
#include <vector>
using namespace std; using P=pair<int,int>; using ll=long long;
int main() {
ll n; cin>>n;
ll b[n+1]; fill(b,b+n+1,0);
for(ll j=1;j<=n;j++) {
ll j2=j;
for(ll k=2;k<=j2;k++) {
if (j2%k==0) j2/=k, b[k]++, k--;
}
}
ll an=0;
for(int i=2;i<=n;i+... | 0 | 35,382,888 |
#include <bits/stdc++.h>
using namespace std;
long long upper = 10e16 + 1000;
int main()
{
long long K;
cin >> K;
int n = 50;
vector<long long> res(50);
for (int i = 0; i < 50; ++ i) {
res[i] = i;
}
for (int i = 0; i < 50; ++ i) {
res[i] += K / n;
}
for (int i = 0; i < K % n; ++ i) {
res[i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
string s[n], t[m];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < m; i++) {
cin >> t[i];
... | 0 | 67,953,831 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define endl "\n"
#define PI 3.14159265358979323846264338327950288
using namespace std ;
using bigint = long long int ;
using v... | #include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(ll i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
... | 0 | 61,590,749 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.