code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <tuple>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)(a); i > (ll)(b... | 0 | 43,817,381 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end... | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int rooms[4][3][10];
int n, b, f, r, v;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 10; k++) {
rooms[i][j][k] = 0;
}
}
}
cin >> n;
for (int i = 0; i < n; i++) {
... | 0 | 57,680,597 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int n,m,a,b;
string s,t="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
cin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=0;j<m;j++)
{
cin>>s;
if(s=="snuke")
{
a=i;
b=j;
}
}
}
cout<<t[b]<<a<<endl;
ret... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | 0 | 89,997,129 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<vector<int>>;
int main(){
string S,T; cin>>S>>T;
int res = 0;
rep(i,3)if(S.a... | #define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include... | 0 | 81,672,952 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rrep(i, m, n) for(ll i = m; i > n; i--)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmin(x... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_bac... | 0 | 75,703,794 |
#include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class... | 0 | 44,146,862 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | #include <iostream>
#include <map>
#include <vector>
#include <set>
#include <stack>
#include <bitset>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <unordered_map>
#include <cmath>
#include <cassert>
#include <random>
using namespace std;
void solve();
int main() {
srand(time(0));
ios::sync... | 0 | 65,635,638 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
using namespace std;
#define DEBUG_
#ifdef DEB... | 0 | 55,709,028 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0;i < n;i++){
cin >> a[i];
a[i]--;
}
vector<long long> c(n,0);
for (int i = 0;i < n;i++){
c[a[i]]++;
}
long long sum = 0;
for (int i = 0; i < n;... | 0 | 56,795,039 |
#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)... | #include <iostream>
#include <stdio.h>
#include <math.h>
#define MAX 100
int H[MAX];
int n;
int parent(int i) {
int index = floor(i/2.0);
return H[index];
}
int left(int i) {
return H[2 * i];
}
int right(int i) {
return H[(2 * i) + 1];
}
int main() {
int val;
scanf("%d", &n);
for (int i = 1;... | 0 | 95,106,515 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn=1e5+7;
int a[maxn],b[maxn];
vector<int> c;
int x,y,aa,bb,cc;
bool cmp(int d,int e){
return d>e;
}
int main(){
cin>>x>>y>>aa>>bb>>cc;
for(int i=1;i<=aa;i++)
scanf("%d",&a[i]);
for(int i=1;i<=bb;i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | 0 | 99,113,374 |
#include <bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define pli pair<ll,int>
#define pii pair<int,int>
#define mk make_pair
#define pb push_back
#define eps 1e-12
#define MAXN 200009
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0)... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
namespace io
{
const int maxb = 1 << 15;
char b[maxb], *s = b, *t = b;
bool Getchar(char &ch)
{
return ch = s == t && (t = (s = b) + fread(b, 1, maxb, stdin)) == b ? 0 : *s ++;
}
}
int Getint()
{
using namespace... | 0 | 27,559,846 |
#include <bits/stdc++.h>
using namespace std;
typedef long long llint;
int n;
int a[101010];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
int ans = 0;
for (int i = 0; i < n; i++) {
int j = a[a[i]];
if (i == j) ans++;
}
cout << ans / 2 << endl;
return 0;
} | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<iomanip>
#include<set>
#include<unordered_map>
using namespace std ;
int len ;
int a[ 17 ] ;
bool ask ( int en ) {
cout << "? " ;
for ( int i = 0 ; i ... | 0 | 67,913,278 |
#include<bits/stdc++.h>
using namespace std;
#define itn int
int main(void){
string t;
cin >> t;
stack<char> s;
int sum = 0;
for(int i = 0;i < t.size();i++){
if(s.empty() || s.top() == t[i])s.push(t[i]);
else {
sum += 2;
s.pop();
}
}
cout << su... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 0 | 13,984,904 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector< vector<int> > VVI;
typedef pair<int,int> P;
#define rep(i,n)... | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9+7;
#define pb push_back
typedef long long ll;
const long long int N = 1e5;
void dfs(int u,int parent,vector<vector<int>>& adj, vector<vector<ll>>& dp){
for(auto it:adj[u]){
if(it==parent) continue;
dfs(it,u,adj,dp);
... | 0 | 23,863,497 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <ra... | #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>;
... | 0 | 49,607,770 |
#include <iostream>
#include <math.h>
using namespace std;
int main(void){
int a,b,C;
cin >> a >> b >> C;
double PI = acos(-1);
double rad;
rad = C * PI / 180;
double h = b*sin(rad);
double S = (a*h)/2;
double L = sqrt(pow(a - (b * cos(rad)),2) + h*h) + a + b;
cout << fixed << S << e... | #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 ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
string vac = "Vacant";
bool chk(string sl, string sr, int left, int right)
... | 0 | 17,068,531 |
#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 SORT(s) sort((s).begin(), (s).e... | #include<bits/stdc++.h>
using namespace std;
#define bolt ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef long double ld;
const ld pi=3.1415926535897932384626433;
const int... | 0 | 95,703,028 |
#include<bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
cout << N * (N-1) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N, M;
cin >> N >> M;
vector<ll> S(N+1, 0);
... | 0 | 25,997,752 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
vector<ll> v[100001];
ll vis[100001]={0};
ll val[100001]={0};
void dfs(ll node)
{
vis[node]=1;
for(ll i=0;i<v[node].size();i++)
{
if(vis[v[node][i]]==0)
{
dfs(v[node][i]);
val[node]^=(val[v[node][i]]+1);
}
}
return;
... | #include<iostream>
#include<map>
using namespace std;
int main()
{
map<long long,long long>m;
long long n,i,x,f=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>x;
m[x]++;
if(m[x]>1)
{
f++;
}
}
if(f>0)
{
cout<<"NO"<<endl;
}
else
... | 0 | 35,720,577 |
#include<bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
if ((S[2] != S[3]) || (S[4] != S[5])) cout << "No" << endl;
else cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template<class T> using vc = vector<T>;
template<c... | 0 | 69,129,085 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5+77;
int in[N];
signed main()
{
#ifdef home
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#else
#endif
ios_base::sync_with_stdio(0);
int n, l;
cin>>n>>l;
for(int i=1;i<=n;i++){
cin>>in[i];
... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main(){
ll n,m;
cin >> n >> m;
priority_queue<ll> data;
rep(i,0,n){
ll a;
... | 0 | 3,060,969 |
#include<bits/stdc++.h>
using namespace std;
long long printNcR(int n, int r){
long long p = 1, k = 1;
if (n - r < r)
r = n - r;
if (r != 0) {
while (r) {
p *= n;
k *= r;
long long m = __gcd(p, k);
p /= m;
k /= m;
... | #include<cstdio>
#include<iostream>
using namespace std;
int main(void){
int n, b, f, r, v, ko[4][3][10];
for(int i = 0; i < 4; ++i){
for(int j = 0; j < 3; ++j){
for(int k = 0; k < 10; ++k){
ko[i][j][k] = 0;
}
}
}
cin >> n;
for(int i = 0; i < n; ++i){
cin >> b >> f >> r >> v;
ko[b-1][f-1][r-1] +=... | 0 | 15,172,087 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
int main() {
std::vector<int> a(3);
std::cin >> a[0] >> a[1] >> a[2];
int max = std::max({a[0], a[1], a[2]});
int cnt = 0;
while (a[0] < max)
{
a[0] += 2;
cnt++;
}
while (a[1] < max)
{
... | #include <iostream>
using namespace std;
int P[10010];
void init(int N){
for(int i=0; i< N; ++i){
P[i]= i;
}
}
int root(int a){
if(P[a]==a) return a;
return (P[a] = root(P[a]));
}
bool is_same_set(int a, int b){
return root(a) == root(b);
}
void unite(int a, int b){
P[root(a)] = root(b);
}
int main(){
... | 0 | 37,925,853 |
#include<bits/stdc++.h>
using namespace std;
#define fi(a) scanf("%d",&a);
#define fli(a) scanf("%ld",&a);
#define fll(a) scanf("%lld",&a);
#define pi(a) printf("%d\n",a);
#define ppi(i,a) printf("Case %d: %d\n",i,a);
#define ll long long
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
voi... | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).substr((f),(t)-(f)))
#define ALL(a) (a)... | 0 | 58,891,833 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,l;
string a[100];
cin>>n>>l;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(a[i]>a[j]) swap(a[i],a[j]);
}
}
for(int i=0;i<n;i++)
{
cout<<a[i];
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc065_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cou... | 0 | 18,487,968 |
#include<iostream>
using namespace std;
int N;
string s;
long mod=1e9+7;
main()
{
cin>>N>>s;
long ans=1,cnt=0;
for(int i=0;i<2*N;i++)
{
if(cnt%2==0)
{
if(s[i]=='B')
{
cnt++;
}
else
{
ans=ans*cnt--%mod;
}
}
else
{
if(s[i]=='B')
{
ans=ans*cnt--%mod;
}
else
{
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | 0 | 2,327,146 |
#include <iostream>
using namespace std;
int main()
{
string N;
cin>>N;
if(N[0]==N[1]&&N[1]==N[2])
{
cout<< "Yes";
}
else if(N[1]==N[2]&&N[2]==N[3])
{
cout<< "Yes";
}
else
cout<< "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000 + 10, mod = 1e9 + 7;
int a[N],n,k;
ll f(ll x){
return x * (x + 1) / 2 % mod;
}
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i];
ll ans = 0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++) if(a[i]<a[j])... | 0 | 42,633,473 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = LONG_LONG_MAX / 100;
const ll MINF = LONG_LONG_MIN;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
bool contain(set<P> &s, P a) {... | #include<iostream>
#include<algorithm>
#include<functional>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<tuple>
#include<stack>
#include<queue>
#include<deque>
#include<sstream>
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<bitset>
#include<time.h>
#include<cstdlib>
#include<c... | 0 | 23,101,872 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include<bits/stdc++.h>
#define Fst first
#define Snd second
#define RG register
#define mp make_pair
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int UI;
typedef unsigned long long ULL;
template<typename T> inline void read(T& x) {
char c =... | 0 | 66,266,095 |
#include <bits/stdc++.h>
using namespace std;
int count(int x){
if (x<10) return 1;
return count(x/10)+1;
}
int main() {
int N;
cin >> N;
int ans=0;
for (int i=1; i<=N; i++){
if (count(i)%2==1) ans++;
}
cout << ans << endl;
} | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include... | 0 | 3,354,702 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, pair<int, int> > p;
long long gcd(long long a, long long b) {
if(a < b) {
swap(a, b);
}
long long r = a % b;
while(r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
cin.tie(0);
ios::sync_with_s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
double pi = 3.14159265359;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, ... | 0 | 54,568,221 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846264338327950L
int main(void) {
long long N, K, A,tmp;
cin >> N >> K;
vector<long long> light(N), light_tmp(N+1, 0), reset(N, 0);
for (long long i = 0; i < N; i++) {
cin >> A;
light[i] = A;
}
for (long long i = 0; i < min(K,(long lo... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a[3],z,z1;
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
if((a[1]%2!=0&&a[0]%2!=0)||(a[1]%2==0&&a[0]%2==0))
{
z=(a[1]-a[0])/2;
cout<<z+a[2]-a[1]<<end... | 0 | 43,862,626 |
#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 whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | #include <iostream>
#include <string>
using namespace std;
bool r[26];
int main(){
int state=-1;
string str;
int ret=0;
r['y' - 'a'] = true;
r['u' - 'a'] = true;
r['i' - 'a'] = true;
r['o' - 'a'] = true;
r['p' - 'a'] = true;
r['h' - 'a'] = true;
r['j' - 'a'] = true;
r['k' - '... | 0 | 75,267,865 |
#include<stdio.h>
#include<math.h>
int main()
{
int n, a, b, c, d, cnt = 0;
while (scanf("%d", &n) != EOF)
{
cnt = 0;
if (n > 36)
{
printf("0\n");
continue;
}
for (a = 0; a < 10; a++)
{
if (n - a>27)continue;
for (b = a; b < 10; b++)
{
if (n - a - b > 18)continue;
for (c = b; c < 1... | #include <stdio.h>
int main(void)
{
long long int min = 1000000, max = -1000000, sum = 0;
int i, n, input;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &input);
if (input <= min) min = input;
if (input >= max) max = input;
sum += input;
}
printf("%lld %l... | 0 | 11,153,978 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include <cstdio>
#include <algorithm>
#include <queue>
#define MAXN 101
using namespace std;
int n;
int graph[MAXN][MAXN];
int dist[MAXN];
bool visited[MAXN];
queue<int > q;
void init(){
fill(dist, dist+MAXN, -1);
fill(visited, visited+MAXN, false);
dist[1] = 0;
}
void bfs(int i){
for (int j = 1; j <= ... | 0 | 23,794,780 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
using ... | #include <stdio.h>
int main(){
char x[1001];
int sum;
while (scanf("%s", x) && x[0]!='0'){
sum=0;
for (char *p=x; *p != '\0'; p++){
sum += *p - '0';
}
printf("%d\n", sum);
}
return 0;
} | 0 | 35,729,258 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
#include <cassert>
#include <random>
#include <tuple>
#include <cstdint>
#include <complex>
#define rep(i,n) for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin>>n>>k;
vector<long long> a(n+1,0);
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=n;i++)a[i]+=a[i-1];
vector<long long> v;
for(int i=0;i<=n;i++){
for(int j=i+1;j<=n... | 0 | 83,052,363 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
constexpr int64_t MOD = 1'000'000'007;
template< typename T >
T mod_pow(T x, T n) {
T ret = 1;
while(n > 0) {
if(n & 1) (ret *= x) %= MOD;
(x *= x) %= MOD;
n >>= 1;
}
return ret;
}
i... | #include<cstdio>
using namespace std;
char a[55][55];
char b[55][55];
int main()
{
int n, m;
scanf("%d%d",&n,&m);
char c;
scanf("%c",&c);
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
scanf("%c",&a[i][j]);
}
scanf("%c",&c);
}
for(... | 0 | 44,920,682 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int Maxn = 111111;
struct Edge {
int v, id;
Edge *nxt;
} pool[Maxn*2], *tree[Maxn], *tail = pool;
inline void addedge(const int &u, const int &v, const int &id) {
tail->v = v, tail->id = id;
tail->nxt = tree[u], tree[u] = tail++;
}
int n, a[M... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
const int NIL = -1;
const int MAX_N = 100100;
struct Node{ int parent, left, right; };
N... | 0 | 55,537,213 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x... | #include <bits/stdc++.h>
using namespace std;
string to_id(int num) {
string s = to_string(num);
reverse(s.begin(), s.end());
while (s.size() < 6) s += '0';
reverse(s.begin(), s.end());
return s;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> cities(n+10, vector<int>());
... | 0 | 10,039,757 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
#define bil ((ll)1e9)
#define mod ((ll)1e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll k;
cin >> k;
queue<ll> que;
rep(i, 1, 10) que.push(i);
ll cnt = 0;
while(true){
cnt++;
auto q = que.front();
qu... | 0 | 42,581,699 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include <bits/stdc++.h>
#define ll long long
#define rep(X,N) for(ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define divceil(A, B) ((A + (B - 1)) / B)
#define MODN 1000000007
#define ALL(V) (V).begin(),(V).end()
#define CERR if(false) cerr
using namespace std;
int m... | 0 | 19,673,484 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define in(v) v; cin >> v;
void ins() {}
template<class T,class... Rest>void ins(T& v,Rest&... rest){cin>>v;ins... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define MAX 100000
void inarray(int a[], int n){
for(int i = 0; i < n; i++) cin >> a[i];
}
int main(){
int k,a,b; cin >> k >> a >> b;
ll B = 1;
for(int i = 0; i < k; i++){
if(b-a <= 2 || i == k-1){
... | 0 | 14,230,205 |
#include<iostream>
using namespace std;
int main(){
int N; cin >> N;
int ans = 0;
for(int i=1;i<=N;i = i+2){
int count = 0;
for(int j=1;j*j<=i;j++){
if(i%j == 0){
if(i/j == j) count++;
else count += 2;
}
}
if(count == 8){
ans++;
}
}
cout << ans << endl;... | #include <iostream>
using namespace std;
int main(){
int n;
int result = 0;
while(cin >> n){
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
for(int k=0; k<10; k++){
for(int l=0; l<10; l++){
if(i+j+k+l == n){
... | 0 | 66,563,242 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool smaller(const int left, const int right) {
return left>right;
}
int main()
{
vector<int> num;
for (int i=0; i<5; i++) {
int tmp;
cin >> tmp;
num.push_back(tmp);
}
sort(num.begin(),num.end(),smaller);
for (int i=0; i<4; i++)... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define orz 1000000007
using namespace std;
int n,l,t,x[100005],w[100005];
ll ans;
int main(){
scanf("%d%d%d",&n,&l,&t);
for(int i=1;i<=n;++i)scanf("%d%d",x+i,w+i);
for(int i=1;i<=n;++i){
if(w[i]==1){
ans+=... | 0 | 24,821,327 |
#include<iostream>
int n,k;main(){std::cin>>n>>k;std::cout<<(n-2)/(k-1)+1;} | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | 0 | 51,716,224 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
#define repa(i, a, b) for (auto i = (a); i <= (b); i++)
#define repd(i, a, b) for (auto i = (a); i >= (b); i--)
#define rep(i, n) for (int i = 0; i < n; ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for(int i=0;i<(n);++i)
#define INF (1ll<<60)
#define FI first
#define SE second
typedef pair<int, int> pii;
#define l_b lower_bound
#define u_b upper_bound
int N, M;
int x[100100], y[100100];
const int mod = ... | 0 | 40,974,479 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#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(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | #include <bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef int32_t i32;
typedef uint32_t u32;
typedef int64_t i64;
typedef uint64_t u64;
typedef pair<int,int> pii;
typedef pair<i64,int> pli;
typedef pair<int,i64> pil;
typedef pair<i64,i64> pll;
typedef vector<int> vi;
typedef vector<i64> vl;
const int M... | 0 | 5,791,027 |
#include<iostream>
#include<bits/stdc++.h>
#include<climits>
#include<math.h>
#define forn(x,n,s) for(int i = x; i < n; i += s )
#define forr(x,n,s) for(int i = x; i>=n; i -= s)
#define PI 3.14159265358979323846264338327950L
using namespace std;
void go(){
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main(){
ll n;
cin>>n;
ld ans=0;
for(ll i=0;i<n;++i){
ld x;
string u;
cin>>x>>u;
if(u=="JPY"){
ans+=x;
}else{
ans+=x*380000;
}
}
... | 0 | 40,581,182 |
#include <iostream>
int main()
{
int n;
int cnt;
while (std::cin >> n){
cnt = 0;
for (int a = 0; a < 10; a++){
for (int b = 0; b < 10; b++){
for (int c = 0; c < 10; c++){
for (int d = 0; d < 10; d++){
if (a + b + c + d... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int main(void){
int n;
cin >> n;
int a[6] = {100,101,102,103,104,105};
vector<bool> x(1e5 + 1,false);
x[0] = true;
for(int i = 0;i < 6;i++){
for(int j = 0;j <= 1e5;j++){
i... | 0 | 4,284,338 |
#include<bits/stdc++.h>
#define bye return 0
#define Yes cout << "Yes" << "\n"
#define No cout << "No" << "\n"
#define YES cout << "YES" << "\n"
#define NO cout << "NO" << "\n"
#define endl cout << "\n"
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
vector<int> v;
set<int> s;... | #include <bits/stdc++.h>
using namespace std;
# define C continue;
# define R return
# define D double
# define I insert
# define ll long long
# define ld long double
# define ull unsigned long long
# define ui unsigned int
# define pb push_back
# define pf push_front
# define vi vector < int >
# define vc vector < cha... | 0 | 56,386,752 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int t[N],v[N];
const int vmax=103;
double... | 0 | 12,464,621 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
int count = 0;
rep(i, s.size())
{
rep(j, s.size())
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int H,W;
while(1){
cin >> H >> W;
if (H == 0 && W == 0) break;
for(int i = 0; i < H; i++ ){
for(int j = 0; j < W; j++){
if((i == 0)|(i == H-1)| (j == 0)|(j == W-1)){
printf("#");
}else{
printf(".");
}
}
pri... | 0 | 27,208,951 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define endl "\n"
#define ll long long
#define sz(s) (int)(s.size())
#define INF 0x3f3f3f3f3f3f3f3fLL
#define all(v) v.begin(),v.end()
#define watch(x) cout<<(#x)<<" = "<<x<<endl
const int dr[] { -1, -1, 0, 1, 1, 1, 0, -1 };... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... | 0 | 95,694,688 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> w(n);
rep(i, n){
cin >> w[i];
}
int diff = 10000000;
rep(i, n){
int x = 0, y = 0;
for (int j = 0; j < i; j++){
... | #include <iostream>
using namespace std;
int main()
{
int N,K,X,Y;
cin >> N >> K >> X >> Y;
int sum =0;
for(int i=1;i<= N; i++){
if(i <= K){
sum += X;
}
if(i > K){
sum += Y;
}
}
cout << sum;
} | 0 | 55,428,108 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
int ans = 0;
int maxh = 0;
for (int i = 0; i < n; i++) {
int h; cin >> h;
if (maxh <= h) {
maxh = h;
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int h,w,x,y;
while(1){
cin >> h >> w;
y = h;
if(h==0 && w==0)
break;
while(h > 0){
x = w;
while(x > 0){
if(x==1 || x==w || h==1 || h==y)
cout <<"#";
... | 0 | 46,574,199 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
vector<int> abcd(4);
rep(i, 4) {
char c;
cin >> c;
abcd[i] = (int)c-'0';
}
rep(i, 1<<3) {
bitset<3> bit = i;
int sum = abcd[0];
vector<char> op(3);
... | #include <iostream>
#include <algorithm>
#include <vector>
#define MAXV 10000
using namespace std;
int main() {
int n;
cin >> n;
vector<int> cnt(MAXV, 0);
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
cnt[temp]++;
}
int count = 0;
for (int i = 0; i < cnt.size()... | 0 | 80,478,650 |
#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;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int ans = -1;
int j = 1;
int last = -1;
for... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int oddeight = 0;
for(int i=1;i<=n;i++){
int a=i;
if(a%2 == 1){
int cou=0;
for(int j=1;j<=a;j++){
if(a%j==0) cou++;
}
if(cou==8) oddeight++;
}
... | 0 | 43,437,793 |
#include <bits/stdc++.h>
using namespace std;
int dp[101][101];
int INF = 1000100100;
int main(){
int n,r[101],c[101];
cin >> n;
for(int i=1; i<n+1; i++){
cin >>r[i] >> c[i];
}
for(int i=0;i<101;i++){
for(int j=0;j<101;j++){
dp[i][j]=INF;
}
}
for(int i=1;i... | #include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (int i ... | 0 | 50,530,164 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H,W; cin >> H >> W;
vector<vector<char>> s(H,vector<char>(W));
int dw[4] ={1,0,-1,0};
int dh[4] ={0,1,0,-1};
bool can = true;
for(int h=0; h<H; h++){
for(int w=0; w<W; w++){
cin >> s.at(h).at(w);
}
}
... | #include <bits/stdc++.h>
using namespace std;
using namespace __detail;
typedef long long ll;
#define ar array
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define all(x) (x).begin(), (x).end()
#define en '\n'
#define FILL(x, v) memset(x, v, sizeof(x))
#define pb push_back
#defin... | 0 | 37,866,495 |
#include <iostream>
#include <string>
#include <sstream>
#include <queue>
using namespace std;
struct dot{
long long int k,p,l,r;
};
int main(int argc, char** argv) {
int n;
while(cin>>n){
int d[n][n];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
d[i][j]=0;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
... | #include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
int K;
cin>>K;
long long dp[30][10];
int judge=0;
int a,b;
for(int i=0;i<30;i++){
for(int j=0;j<10;j++){
if(i==0) dp[i][j]=1;
else{
if(j==0) dp[i][j]=dp[i-1][0]+dp[i-1][1];
else if(j==... | 0 | 77,473,936 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll x; cin>>x;
bool dp[11000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
int n; cin >> n;
ll a[n+1],b[n];
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
ll ans(0);
rep(i,n){
if(a[i]<=b[i]){
... | 0 | 35,638,937 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define D
#ifdef D
int main(void)
{
string s;
string p;
cin >> s;
cin >> p;
for (size_t i = 0; i < p.size(); i++)
{
if (i != 0)
s = s.substr(1) + s[0];
size_t num = s.find(p);
if (num != string::npos) {
cout << "Yes" << endl;... | #include <iostream>
#include<climits>
using namespace std;
int m[100][100];
int MCM(int p[],int n) {
for (int i = 0; i <= n; i++)
m[i][i] = 0;
for (int l = 2; l <= n; l++) {
for (int i = 1; i <= n - l + 1; i++) {
int j = i + l - 1;
m[i][j] = INT_MAX;
for (int k = i; k <= j-1; k++) {
int q = m[i][k] +... | 0 | 76,560,337 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
ull x, y;
int main(){
cin >> x >> y;
if(x > y) swap(x, y);
cout << (y - x <= 1 ? "Brown" : "Alice") << "\n";
} | #include<bits/stdc++.h>
using namespace std;
#define MP ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define For(i,n) for(int i=0;i<n;i++)
#define forn(i,n) for(int i=1;i<=n;i++)
#define fors(i,s) for(int i=0;i<s.size();i++)
#define all(v) v.begin(),v.end()
#define gcd(a, b) __gcd(a , b)
#... | 0 | 40,439,922 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair <int,int> PII;
typedef pair <ll, ll> PLL;
typedef pair <int,string> PIS;
typedef vector <int> vec;
typedef priority_queue<int> PQ;
#define INF 100000000000000000
#define endl '\n'
#define debug(x) c... | #include<iostream>
#include<cstring>
#include<queue>
using namespace std;
#define N 100
#define INFTY (1<<30)
int n,m[N][N],d[N];
void bfs(int s)
{
queue<int> q;
q.push(s);
for(int i=0;i<n;i++) d[i]=INFTY;
d[s]=0;
while(!q.empty())
{
int u=q.front();q.pop();
for(int v=0;v<n;v+... | 0 | 56,715,506 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int K,S;
cin>>K>>S;
int ans=0;
for(int i=0;i<K+1;i++){
for(int j=0;j<K+1;j++){
if(i+j<=S&&i+j+K>=S){
ans++;
}
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>> G(n);
rep(i,m... | 0 | 79,408,787 |
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using namespace boost::multiprecision;
using bint = cpp_int;
using bdec = cpp_dec_float_100;
int main() {
bint N;
cin >> N;
cout << ((N % 9) ? "No" : "Yes") << "\n";
} | #include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <cmath>
#include <climits>
#define ll long long int
#define pb push_back
#define mk make_... | 0 | 100,154,221 |
#include <stdio.h>
int main(void){
int n;
int i,j;
int sum[120]={0};
scanf("%d", &n);
int building[n];
int floor[n];
int room[n];
int people[n];
for(i=0;i<n;i++){
scanf("%d",&building[i]);
scanf("%d",&floor[i]);
scanf("%d",&room[i]);
scanf("%d",&people[i]);
sum[(building[i]-1)*30+(floor[i]-1)*10+room... | #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) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int maxn = 1e5 + 9;
#define BITS 60
ll n, a[... | 0 | 21,376,447 |
#include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int s[17][17],a,b,n,x,y;
int main(){
while(cin>>a>>b){
if(a+b==0)return 0;
for(int i=0;i<=b;i++)for(int j=0;j<=a... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PRINT(s) cout << s << endl;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR((i), 0, (n))
int main() {
int k, s;
cin >> k >> s;
int limit = min(k, s) + 1;
int count = 0;
REP(x, limit) {
if (2 ... | 0 | 57,471,577 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll MOD = 1e9+7;
ll LLINF = 1LL << 60;
int INF = INT_MAX;
vector<ll> a;
vector<ll> p;
ll F(ll i, ll j){
if(i<=0){
return 1;
}else{
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | 0 | 59,479,631 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
int A,B,C,D;
cin >> A >> B >> C >> D;
if(min(B,D) - max(A,C) > 0) {
cout << min(B,D) - max(A,C) << endl;
} else cout << 0 << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define MAXN 200010
using namespace std;
int n,m;
struct node{
int pos;
int index;
}X[100010];
bool cmp(node a,node b){
return a.pos<b.pos;
}
int main(){
scanf("%d",&n);
int x;
for(int i=1;i<=n;i++){
scanf("%d",&x);
X[i].pos=x;
X[i].index=i;
}
sort(X+1,X+1+n,... | 0 | 53,005,007 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int mod = 1000000007;
int main(){
int a,p;
cin >> a >> p;
int ans = (3*a+p)/2;
cout << ans << endl;
} | #include<bits/stdc++.h>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y) make_pair(x,y)
#define vp vector<pair<int,int>>
#define setbits(x) __builtin... | 0 | 22,011,977 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N, C, K;
cin >> N >> C >> K;
int T[N];
rep(i,N) cin >> T[i];
sort(T,T+N);
int ans = 0;
int n = 1;
int t = T[0];
for (int i = 1; i < N; i++) {
if (T[i]>t+K || n==C) {
ans++;
... | #include <bits/stdc++.h>
#define uni(x) (x).resize(unique(ALL(x)) - (x).begin())
#define fprint(v) for(auto x : v) cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846
#define MP(x, y) make_pair(x, y)
#define SZ(x) int((x).size())
#define PB(x) pus... | 0 | 65,716,995 |
#include<iostream>
int main(){char c,d,e;std::cin>>c>>d>>e;puts(c^d&&c+d+e==294?"Yes":"No");} | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F first
#define S s... | 0 | 61,854,294 |
#include<iostream>
using namespace std;
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <stack>
#define ll long long
int n,a,b,num;
int i1=0,i2=0,i3=0;
int findmin(void)
{
int h[3];
h[0]=i1;h[1]=i2;h[2]=i3;
sort(h,h+3);
return h[0];
}
int main()
{
cin>>n>>a>>b;
for(int i=0;i<... | #include<iostream>
using namespace std;
int main(void){
int H1,M1,H2,M2,K;
int cul;
int ans;
cin>>H1>>M1>>H2>>M2>>K;
cul=(H2*60+M2)-(H1*60+M1);
if(cul>K){
ans=cul-K;
}else{
ans=0;
}
cout<<ans<<endl;
return 0;... | 0 | 89,826,620 |
#include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<double> t(n), v(n);
int sum = 0;
for (int i = 0; i < n; i++)
{
cin >> t.at(i);
sum += t.at(i);
}
for (int i = 0; i < n; i++) cin >> v.at(i);
vector<double> maxv(sum * 2 + 1);
int ... | 0 | 27,042,832 |
#include<iostream>
using namespace std;
#define size 1000
int main()
{
int n,i,j;
float v[size],number;
double sum;
cin>>n;
for(i=0;i<n;i++)
{
cin>>v[i];
}
for(i=0;i<n-1;i++)
{
j=i+1;
number = v[j];
while(number<v[j-1] && j>0)
{
v[j] = v[j-1];
... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | 0 | 63,769,712 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0,b = 0,c = 0;
cin >> a >> b;
c = a * a - b;
cout << c << endl;
} | #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 | 67,295,408 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,m;
cin>>n>>m;
vector<string>p(m);
vector<string>s(m);
for(long long i=0;i<m;i++){
cin>>p[i]>>s[i];
}
long long cnt=0;
long long cnt2=0;
map<string,int>mp;
map<string,int>mp2;
for(long long i=0;i<m;i++){
if(s[i]=="AC"&&m... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
double bitToJPN(double bit) {
return bit * 380000.0;
}
int main() {
fastIO;
int n;
cin >> n;
... | 0 | 79,537,608 |
#include <bits/stdc++.h>
using namespace std;
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 (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int>v(m + 3), v2, stick(12), val(12, -1), vis(12, 0);
stick[1] = 2, stick[2] = 5, stick[3] = 5, stick[4] = 4, stick[5] = 5, stick[6] = 6, stick[7] = 3, stick[8] = 7, stick[9] = 6;
for(int i = 0; i < m; i++){
... | 0 | 44,245,590 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <numeric>
#include <set>
#include <cstdlib>
#include <queue>
#include <map>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<lli... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define ppll pair<ll,pll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lowe... | 0 | 30,718,133 |
#include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
for (int i = 0; i < n; ++i)
{
int y,m,d;
cin>>y>>m>>d;
int ans=0;
int ty=1000-y-1;
ans+=(20*20+19*10)*(ty/3);
if(ty%3==1) ans+=20*10;
else if(ty%3==2) ans+=20*15+19*5;
if(y%3==0)
{
ans+=20*(10-m... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> A;
int main() {
scanf("%d", &N);
A.resize(N);
for(int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
int mn = 2;
ll ans = (A[0] - 1);
for(int i = 1; i < N; i++) {
if(A[i] == mn) {
mn... | 0 | 62,776,017 |
#include<bits/stdc++.h>
#define REP(i, a, b) for(long long i=a; i<=b; ++i)
#define REPN(i, a, b) for(long long i=a; i<=b; --i)
#define rep(i, a, b) for(long long i=a; i<b; ++i)
#define rep0(i,b) for(long long i=0; i<b; ++i)
#define REP0(i,b) for(long long i=0; i<=b; ++i)
#include<cmath>
#include <iomanip>
using namespa... | #include <bits/stdc++.h>
#define ST_ARR_LEN(array) (sizeof(array)/sizeof(*array))
#define MOD 1000000007
using namespace std;
using ll = long long;
const ll MAX = LLONG_MAX;
const ll MIN = LLONG_MIN;
typedef stack<ll> llStack;
typedef queue<ll> llQueue;
typedef vector<ll> llVector;
typedef list<ll> llList;
typedef stru... | 0 | 32,426,224 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long... | #include <iostream>
#include <cstdio>
using namespace std;
int main(void) {
int N;
cin >> N;
int *array = new int[N];
for (int i = 0; i < N; ++i) {
cin >> array[i];
}
int total = 0;
for (int i = 0, min; i < N; ++i) {
min = i;
for (int j = i; j < N; ++j) {
... | 0 | 11,834,922 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n) ; i++)
constexpr auto INF = 2147483647;
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
ll height[15],maxHeightPre[15], tmp_height;
ll min_cost, tmp_cost;
maxHeightPre[0] = 0;
rep(i,n){
cin >> height[i];
i... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<string> S(n);
vector<vector<int>> alpha(n, vector<int>(26));
vector<int> ans(26, 1000000);
for (int i = 0; i < n; i++)
{
cin >> S.at(i);
for (int j = 0; j < S.at(i).size(); j++)
{
alpha.at(i).at(S.at(i).at... | 0 | 27,542,414 |
#include<cstdio>
using namespace std;
signed main(){
int ret = 0, d;
while( scanf( "%d", &d ) != EOF ){
int m = 600 / d;
ret = m * ( m - 1 ) * ( 2 * m - 1 ) / 6 * d * d * d;
printf( "%d\n", ret );
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
int n;
int taroP = 0;
int hanakoP = 0;
string taro,hanako;
cin >> n;
for (int i = 0; i < n ; ++i) {
cin >> taro;
cin >> hanako;
if (taro == hanako) {
taroP += 1;
hanakoP += 1;
... | 0 | 70,829,121 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
struct UnionFind {
vector<int> d;
UnionFind(int N) : d(N, -1) {}
int find(int x)... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | 0 | 7,008,188 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int i,n,max=0;
int count[101]={0};
while(cin >> n){
if(cin.eof()){break;}
count[n]++;
if(max<count[n]){
max=count[n];
}
}
for(i=1;i<101;i++){
if(max==count[i]){
cout << i << endl;
}
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
long n;
vector<long> a;
vector<long> l;
long asum = 0, bsum = 0;;
cin >> n;
for (long i = 0; i < n; i++) {
long t;
cin >> t;
a.push_back(t);
asum += t;
}
bool flag = false;
lo... | 0 | 52,919,529 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> cnt;
if (S[0] == '0') cnt.push_back(0);
int k = 1;
rep(i, N) {
if (i == 0) continue;
if (S[i] == S[i-1]) ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,i,j,k,l,a,b,c,d,m,f1,f2;
cin>>a>>b>>c;
k=10000000000;
l=k-b;
l+=c;
m=k+a;
if(l<=k)
{
cout<<"delicious"<<endl;
}
else if(l>k&&l<=m)
{
cout<<"safe"<<endl;
}
else if(l>m)
... | 0 | 94,583,798 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int counter = 0;
if (n > 36) {
cout << "0\n";
} else if (n == 36) {
cout << "1\n";
} else {
for (int a = 0; a <= 9; a++) {
for (int b = 0; b <= 9; b... | #include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main(void){
long long n,z,o,j,k;
long long x,y;
scanf("%lld",&n);
long long a[n];
for(int i=0;i<n;i++){
scanf("%lld",&a[i]);
o=2*a[i];
a[i]=o;
}
x=0;
for(int i=0;i<n;i++){
... | 0 | 53,310,310 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | 0 | 43,865,846 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
string s;
cin >> s;
int w;
cin >> w;
int tmp_num = 0;
while(1) {
if ( tmp_num > s.length() - 1 ) {
break;
}
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
vector<string> w(n);
for(int i = 0; i < n; i++) cin >> w[i];
string ans = "Yes";
for(int i = 1; i < n; i++){
for(int j = 0; j < i; j++){
if(w[j] == w[i]) ans = "No";
... | 0 | 15,560,479 |
#include<bits/stdc++.h>
using namespace std;
using ll=int64_t;
ll gcd(ll a,ll b){
if(a%b==0)return b;
else return gcd(b,a%b);
}
int main(){
ll n;cin>>n;
ll tmp1;
cin>>tmp1;
ll tmp2;
for(int i=1;i<n;i++){
cin>>tmp2;
tmp1=tmp1/gcd(tmp1,tmp2)*tmp2;
}
cout <<tmp1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
int p[n];
for (int i = 0; i < n; ++i) {
cin >> p[i]; p[i]--;
}
ll c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
ll ans = -1e18;
for (int st = 0; st < n; ++st... | 0 | 31,496,588 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << ((a < b && b < c) ? "Yes" : "No") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll Max = 100000+5;
const static ll INF = 1e18+5;
vector<set<ll>> G(Max);
ll N, Q, K;
map<pair<ll, ll>, ll> C;
ll DP[Max];
void Dijkstra(ll s){
for(int i = 0; i < Max; i++) DP[i] = INF;
DP[s] = 0;
for(auto v : G[s]) DP[v] = C[ma... | 0 | 51,237,730 |
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int debt = 100000;
for (int i = 1; i <= n; i++) {
debt = (debt * 1.05);
if (debt % 1000) {
debt /= 1000;
debt *= 1000;
debt += 1000;
}
}
cout << debt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int p[1000010];
int main(){
int n;
for(int i = 2 ; i <= 1000000 ; i++){
p[i] = 1;
for(int j = 2 ; j*j <= i ; j++){
if( i % j == 0 ){
p[i] = 0;
break;
}
}
p[i] += p[i-1];
}
while(cin >> n){
cout << p[n] << endl;
}
} | 0 | 51,089,002 |
#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 a, b, c, k;
cin >> a >> b >> c >> k;
if(a >= k) {
cout << k << endl;
return 0;
}
else if(a + b >= k) {
cout << a << endl;
return 0;
}
else {
int max = a +... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,n) for(long long i=0;i<n;++i)
#define REPP(i,m,n) for(long long i=m;i<n;++i)
#define rep(i,n) for(long long i = n-1;i>=0;--i)
#define repp(i,n,m) for(long long i = n-1; i >= m; --i)
#define ALL(N) (N.begin(),N.end())
#define de cout << "li... | 0 | 36,127,431 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define REP(i,n) for (int i=1;i<=(n);i++)
typedef long long ll;
int main() {
int a,b;
cin >> a >> b;
int ans = -1;
for(int i=1500;i>=0;i--){
int a_tax=i*0.08;
int b_tax=i*0.1;
if(a_tax==a&&b_ta... | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define... | 0 | 81,568,259 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, m;
ll f(ll p, ll q)
{
if(p == q) return 0;
if(q >= p - q) return f(q, p - q) + p;
else return 2 * q * (p / q - 1) + f(p - (q * (p / q - 1)), q);
}
int main()
{
cin>>n>>m;
cout<<f(n, n - m) + m;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srep... | 0 | 22,603,595 |
#include <iostream>
using namespace std;
struct Card {
char trump;
int num;
};
void BubbleSort(struct Card *c, int n);
void SelectionSort(struct Card *c, int n);
void printDeck(struct Card *c, int n);
bool isStable(struct Card *stable, Card *c, int n);
int main() {
int n;
struct Card c_b[36], c_s[36];
... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 40,607,183 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.