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;
int main () {
char c;
cin>>c;
int x=0;
if (c=='a'||c=='i'||c=='u'||c=='e'||c=='o'){
x=1;
}
if (x==1){
cout<<"vowel"<<endl;
}
else{
cout<<"consonant"<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll i... | 0 | 41,896,691 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
#define ll long long int
int main(){
int m, n;
cin>>n>>m;
vector<int> a(n);
rep(i, n) cin>>a[i];
int sum=0;
rep(i, n) sum+=a[i];
sort(a.rbe... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <list>
#include <string>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
#define REPD(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) REPD(i, 0, n)
#define DIV0 1... | 0 | 17,929,702 |
#include <iostream>
#include <vector>
int main()
{
int n, m;
std::cin >> n >> m;
std::vector<int> k(m);
std::vector<std::vector<int>> s(m);
std::vector<int> num(m);
for (int i = 0; i < m; i++)
{
std::cin >> k[i];
for (int j = 0; j < k[i]; j++)
{
int a;
... | #include <bits/stdc++.h>
using namespace std;
#define LL long int
const int MAX = 1e6;
const int MOD = 1e9+7;
int main(){
int s;
vector<int> ans(s + 1,0);
cin >> s;
ans[0] = 1;
for(int i = 0; i <= s; ++i){
if(i - 3 >= 0){
ans[i] = ans[i - 1] + ans[i - 3];
ans[i] %= MO... | 0 | 100,352,960 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int x,y;cin>>x>>y;
cout<<abs(abs(x)-abs(y))+((x<0&&y<0)||(x>=0&&y>=0)?(x>=y)*2:1)+(y?0:-1)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
using Graph = vector<vector<int>>;
using P = p... | 0 | 68,965,943 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e18;
ll dx[] = {1, 0};
ll dy[] = {0, 1};
int main() {
ll h, w;
cin >> h >> w;
string s[h];
ll ans[h][w] = {};
rep(i, h) rep(j, w) ans[i][j] = INF;
rep(i, h) cin >> s[i];
ans[0... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N, M;
int D[10000], P[10000];
int Porg[10000];
while(cin >> N >> M, N | M){
for(int i=0; i < N; i++){
int d, p; cin >> d >> p;
D[i] = d; P[i] = p; Porg[i] = p;
}
int maxp_ind = 0;
int cnt = 0;
while(M > 0 && cnt <... | 0 | 40,862,901 |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int x,y;
while(~scanf("%d%d",&x,&y))
{
printf("%d\n",x+y/2);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0... | 0 | 61,821,389 |
#include <iostream>
using namespace std;
typedef struct {
char mark;
int number;
} card;
int N;
card c1[40], c2[40];
void bubbleSort(card* c);
void selectionSort(card* c);
void trace(card* c);
bool compare();
int main() {
cin >> N;
for (int i = 0; i < N; ++i) {
char ch; int num;
cin >> ch >> num;
c1... | #include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <complex>
using namespace std;
const double pi=3.141592653589793;
void koch_snowflake(size_t n, complex<double> p1, complex<double> p2) {
if (!n) return;
complex<double> s, t, u;
s = (2.0*p1 + p2) / 3.0;
t = (p1 + 2.0*p... | 0 | 30,294,466 |
#include<iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if (a < b)
if (b < c) cout << "Yes\n";
else cout << "No\n";
else
cout << "No\n";
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 10000000000
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> a(n);
int b = 0;
int sum = 0;
rep(j,n){
cin >> a[j];
sum += abs(a[j] - b);
b = a[j];
}
... | 0 | 23,744,890 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int S,W;
cin>>S>>W;
if(S<=W) cout<<"unsafe"<<endl;
else cout<<"safe"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int h[10] = {0,2,5,5,4,5,6,3,7,6};
int main(){
int n,m;
cin >> n >> m;
ve<char> a(m);
rep(i,m){
cin >> a[i];
}
ve<string> dp(n+... | 0 | 56,603,440 |
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
#include<deque>
#include<map>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;
const LL MAX=2000010;
const LL MOD=1000000007;
typedef map<LL,LL>::iterator Itr;
int main()
{
LL n,d,a;
cin... | 0 | 55,241,848 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main()
{
int H, W;
cin... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int ... | 0 | 42,868,897 |
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#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, begin, end) for (int i = begin; i >= end; i--)
templa... | 0 | 5,457,177 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
vector<long long> ct(n+1, 0);
for ( int i = 0; i < n; i++ ) {
cin >> a[i];
ct[a[i]]++;
}
long long sum = 0;
for ( int i = 0; i <= n; i++ ) {
sum += ct[i]*(ct[i]-1)/2;
}
for ( int i = 0; i < n; i++ ) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (int)(N); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using pint = ... | 0 | 39,389,227 |
#include <iostream>
using namespace std;
int main(void){
int A,B,C,D;
cin >> A >> B >> C >> D;
const int first = max(A,C);
const int last = min(B,D);
cout << max(0,last-first);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
typedef long long ll;
struct edge { ll s, t, x; };
typedef pair<ll, ll> P;
typedef pair<double, P> event;
... | 0 | 74,437,523 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end(), greater<long long>());
if (N - K <= 0) {
cout << 0;
return 0;
}
long l... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> ... | 0 | 84,856,131 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
ll int count = 0;
for(int i = 1; i < n; i++) {
count += (n - 1) / i;
}
cout << count << '\n';
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define... | 0 | 88,040,835 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#define INF 999999
using namespace std;
int main(){
int N;
while(cin>>N,N){
int num[5500]={0},max=-INF;
for(int i=0;i<N;i++){
cin>>num[i];
}
for(int i=0;i<N;i++){
in... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int i,j,k;
cin >> N;
int Amax = 1000001;
vector<bool> s(Amax,false);
vector<int> c(Amax,0);
for(i=0;i<N;i++){
cin >> j;
c[j]++;
s[j] = true;
}
for(i=0;i<Amax;i++){
if (s[i] && (c[i] > 0))
for(j=i*2;j<Amax;j+=i)
... | 0 | 54,082,094 |
#include<bits/stdc++.h>
using namespace std;
long calc(long n,vector<long>&dp,long mod){
if(n<3)return 0;
if(dp[n]!=0)return dp[n];
for(int i=3;i<=n;i++){
if(n!=i)dp[n] += calc(n-i,dp,mod);
else dp[n]++;
dp[n] %= mod;
}
dp[n]%=mod;
return dp[n];
}
int main(){
long s;
... | #include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | 0 | 91,895,952 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
vector<ll> a(n+1);
rep(i,n+1) cin>>a[i];
if(n==0){
if(a[0]==1) cout<... | #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, M;
cin >> N >> M;
vector<int> A(N);
int S = 0;
rep(i, N) {
cin >> A[i];
S += A[i];
}
int ans = 0;
for(int x : A) {
if (x >= floa... | 0 | 72,196,318 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <cstdio>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;(i)>=0;(i)--... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#ifdef PRINTE... | 0 | 53,535,649 |
#include<bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
int n; cin >> n;
int idx = 1;
vector<int> b;
if (n % 2 != 0) {
idx = -1;
}
for (int i = 0; i < n; i++) {
int a; cin >> a;
if (idx == 1) {
b.push_back(a); ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
#define r... | 0 | 4,997,397 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N, A;
cin >> N >> A;
int x = N % 500;
if (x <= A) {
cout << "Yes" << endl;
}
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a,b,c,ans,cou;
cin>>a>>b>>c;
cou=0;
vector<vector<char>> data(a, vector<char>(b));
for(int64_t i=0;i<a;i++){
for(int64_t j=0;j<b;j++){
cin>>data.at(i).at(j);
}
}
for(int64_t i=0;i<pow(2,a);i++){
for(int64_t j=0;j<pow(2,b);j++){
int64_t... | 0 | 44,799,579 |
#include<bits/stdc++.h>
using namespace std;
string S;
int K;
int dp[2][100+1][5];
signed main() {
cin >> S >> K;
int n = S.size();
dp[0][0][0] = 1;
for(int i=0; i<n; i++) {
int s = (int)(S[i] - '0');
for(int k=0; k<=K; k++) {
for(int d=0; d<=9; d++) dp[1][i+1][k + (int)(d!=0)] += dp[1][i][k];
... | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 1000000007
#define LINF 6000000000000000007LL
#define ll long long
using namespace std;
signed main(){
int n,k;
cin>>n>>k;
vector< pair<int,int> > a;
for(int i=0;i<n;i++){
int x,y;
cin>>x>>y;
a.pb(mp(x,y));
}... | 0 | 39,463,396 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include"bits/stdc++.h"
using namespace std;
#define Fast_D cout<<fixed<<setprecision(13);
#define FastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define nl "\n"
#define int long long
#define double long... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]... | 0 | 62,811,388 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int mod = 1000000007;
ll dp[100005];;
ll gcd(long long a,long long b){
if(b == 0)
return a;
else return gcd(b,a%b);
}
int main(){
int n,k; cin>>n>>k;
int a[n];
map<int,int>mp;
for(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#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 fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
int main(void){
ll n, k;
cin >> n >> k;
ll a[n];
rep(i, 0, n){
... | 0 | 65,593,063 |
#include<iostream>
#include<algorithm>
using namespace std;
long long dp[6000],n,a[6000],i,maxm;
int main(){
while(1){
cin>>n;
if(n==0)break;
for(int i=1;i<=n;i++)cin>>a[i];
dp[1]=maxm=a[1];
for(int i=2;i<=n;i++){
if(dp[i-1]>=0)dp[i]=dp[i-1]+a[i];
else dp[i]=a[i];
maxm=max(dp[i],... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int N;
vector<int> n(4);
cin >> N;
n.at(0) = N / 1000;
N %= 1000;
n.at(1) = N / 100;
N %= 100;
n.at(2) = N / 10;
N %= 10;
n.at(3) = N;
for(int i = 0; i < (1 << 3); i... | 0 | 65,162,334 |
#include<bits/stdc++.h>
using ll=long long;
using namespace std;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using P = pair<int, int>;
using V = vector<int>;
constexpr array<int, 4> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
constexpr int INF = 1234567890, MOD = 1000000000 + 7;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;... | 0 | 5,256,877 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n,c,k;
cin >> n >> c >> k;
ll ans=0;
ll cnt=0;
ll ti=-inf;
vec t(n);
for(ll i=0;i<n;i++) cin >> t[i];
sor... | #include <array>
#include <functional>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<std::vector<int>> G(N);
for (int i = 0; i < N - 1; ++i) {
int x, y;
std::cin >> x >> y;
G[x - 1].push_back(y - 1);
G[y - 1].push_back(x - 1);
}
int mod = 1000000007;
... | 0 | 86,404,578 |
#include<stdio.h>
#include<math.h>
void hidariokiku(int *hidari, int *migi);
int main(void){
int inpnum;
int a,b,c;
for(scanf("%d", &inpnum); inpnum != 0; inpnum -= 1) {
scanf(" %d %d %d", &a, &b, &c);
hidariokiku(&a, &b);
hidariokiku(&b, &c);
hidariokiku(&a, &b);
if(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int k;
cin >> k;
vector<ll> lun;
for (int i = 1; i < 10; i++) lun.push_back(i);
int cnt = 0;
while (lun.size() <= k) {
ll p = lun[cnt] * 10;
int q = lun[cnt] % 10;
if (q == 0) {lun.push_back(... | 0 | 49,034,643 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n,k;
cin>>n>>k;
int arr[n];
int dp[n];
for(int i=0;i<n;i++)
dp[i]=1e9;
dp[0]=0;
for(int i=0;i<n;i++)
cin>>arr[i];
for(int ... | #include <iostream>
#include <string>
using namespace std;
int main (void){
int p, q, r;
cin >> p >> q >> r;
if(p + q < r + q){
if(p + q < p + r){
cout << p + q << endl;
}else{
if(p + r < r + q){
cout << p + r << endl;
}else{
... | 0 | 98,940,174 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define MOD 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(var) (var).begin(), (var).end()
#define MAXX 9000000000000000000
#define pii pair<int,int>
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pii;
typedef vector<ll> Vi;
typedef vector<Vi> VVi;
const double EPS = (1e-7);
const ll INF =(1e13);
const double PI = (acos(-1));
const ll MOD = ll(1e9) + 7;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ... | 0 | 17,100,601 |
#include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
#define int long long
priority_queue<int> q;
int n, m, x, sum;
main() {
DAU
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> x;
q.emplace(x);
}
w... | #include<iostream>
using namespace std;
int main() {
int n;
int a[100000];
int i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long int c;
c = 0;
int flag;
flag = 0;
for (i = 0; i < n; i++) {
if (a[i] == 0) {
flag = 0;
}
else {
if (flag == 0) {
if (a[i] % 2 == 0) {
c = c + a... | 0 | 68,928,827 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int h[10] = {0,2,5,5,4,5,6,3,7,6};
int main(){
int n,m;
cin >> n >> m;
ve<char> a(m);
rep(i,m){
cin >> a[i];
}
ve<string> dp(n+... | 0 | 94,673,336 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
string S;
cin >> S;
int N;
cin >> N;
for (int i = 0; i < S.length(); i++) {
if (i == 0) {
cout << S[i];
}else if(i % N == 0) {
cout << S[i];
}
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 60,845,905 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long l... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x,n,a;
cin >> x >> n;
vector<int> p(n);
vector<int> arr(101, 1);
for(int i=0; i<n; i++){
cin >> a;
arr.at(a) = 0;
}
int j=1, check = 1;
if(arr.at(x)==1){
cout << x << endl;
return 0;
}
while(check==1){
if(x+j > 100){
... | 0 | 7,127,492 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
int main() {
int a,b,c,d; cin >> a >> b >> c >> d;
int s = min(a,c);
int g = max(b,d);
int ans = 0;
for(int i = s;i < g;i++){
if(i >= a && i < b && i ... | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | 0 | 94,043,798 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<char> AAA={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char> BBB={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
for(int ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
vector<vector<int>> g;
vector<bool> used;
vector<vector<int>> dp;
int mod = 1e9 + 7;
void dfs(int v) {
used[v] = true;
dp[v][0] = 1;
dp[v][1] = 1;
for (auto to : g[v]) {
if (!used[to]) {
dfs(to);
dp[v][0]... | 0 | 76,167,488 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
char x, y;
cin >> x >> y;
if(x < y) cout << '<' << endl;
else if(x > y) cout << '>' << endl;
else cout << "=" << en... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
template<... | 0 | 13,081,744 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100 * 1001;
int n, m, a[N], cnt, where[N];
pair <int, int> b[N];
bool mark[N];
vector<int> adj[N], par[N];
void dfs(int v) {
mark[v] = true;
where[v] = cnt;
par[cnt].push_back(v);
for (auto u : adj[v])
if (!mark[u])
dfs(u);
}
int main() {
cin >> n >>... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 10,133,638 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater... | #include<iostream>
using namespace std;
int main(){
long long int A,B,K;
cin >> A >> B >> K;
if(A>K){
A = A -K;
cout << A << " " << B;
}
else if(A<K && K>=A+B){
cout << 0 << " " << 0;
}
else{
cout << 0 << " " << B-K+A;
}
} | 0 | 29,646,882 |
#include <stdio.h>
int main() {
int n, k, v = 1;
scanf ("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
if (v <= k) {
v *= 2;
}
else if (v > k) {
v += k;
}
}
printf ("%d\n", v);
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 0 | 70,996,148 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,n,s=0;
cin>>A>>B;
n=A;
while(n<=B){
if(n%10==n/10000&&n/10%10==n/1000%10) s+=1;
else s+=0;
n+=1;
}
cout<<s<<endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 38,319,329 |
#include <stdio.h>
#include <vector>
#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) = (n) - 1; (i) >= 0; --(i))
using lli = long long int;
std::vector<int> A;
int main(void){
int n; scanf("%d", &n);
A.resize(n); REP(i, n) scanf("%d", &A[i]... | #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 | 8,662,580 |
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int main(){
long n,UENINIGERUDE,SEISU[10000],GOKEI=0,SAISYO;
cin>>n;
SAISYO=n-1;
for(int i=0;i<n;i++){
cin>>SEISU[i];
}
for(int i=0;i<=n;i++){
for(int j=i+1;j<n;j++){
if(SEISU[i]<SEISU[j]){
UENINIGERUDE=SEISU[i];
SEISU[i]... | #include <iostream>
#include <queue>
using namespace std;
int w,h;
int g[21][21];
bool visited[21][21];
int moves[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int count;
bool legal(int x, int y)
{
if(visited[x][y]!=true&&0<=x&&x<h&&0<=y&&y<w&&g[x][y]==0)
return true;
else
return false;
}
void dfs(int x,int y)
{
vis... | 0 | 58,183,910 |
#include <iostream>
#include <vector>
#include <string>
#include <set>
using namespace std;
int main() {
string S;
cin >> S;
uint aval = static_cast<uint>('a');
uint zval = static_cast<uint>('z');
vector<int> counters(zval-aval+1, 0);
for (size_t i=0; i<S.size(); ++i) {
uint val = static... | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = LLONG_MAX, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;... | 0 | 60,927,481 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
... | #include <stdio.h>
#define MAXL 3000
void swap(int *x, int *y);
int main()
{
int x[MAXL] = {0};
int y[MAXL] = {0};
int i = 0;
while(i < 3000)
{
scanf("%d",x+i);
scanf("%d",y+i);
if(x[i] == 0 && y[i] == 0) break;
i++;
}
int length = i;
for(i = 0; i < length... | 0 | 21,613,066 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
int main(){
... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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; }
const lli mod = 1e9+7;
lli n, k;
int m... | 0 | 75,596,585 |
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
int n;
lli arr[200001];
lli _abs(lli a){return a<0 ? -a : a;}
int main() {
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lld",arr+i),arr[i]+=arr[i-1];
lli mx=1e18;
for(int i=1;i<n;i++) {
mx = min(mx, _abs(2*arr[i]-arr[n]));
... | #include <iostream>
#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 <unordered_set>
#pragma GCC... | 0 | 39,432,782 |
#include <bits/stdc++.h>
using namespace std;
class dice{
public:
int d1;
int d2;
int d3;
int d4;
int d5;
int d6;
int kaisi(int s1, int s2, int s3, int s4 ,int s5,int s6);
string huru(string x);
int kakunin(int x,int y);
};
int dice::kaisi(int s1,int s2,int s3,int s4,int s5,int s6){
d1 = s1;
d2 = s2;
d3 ... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <utility>
#include <string>
#include <queue>
#define rep(i, n) for(int i = 0; i < n; i++)
#define INF (1<<30)
typedef long long ll;
using namespace std;
void solve(){
int n;
int taro = 0, hanako = 0;
string x, y;
cin >>... | 0 | 78,625,453 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
#include <string>
#include <sstream>
#include <math.h>
#include <set>
#include <queue>
using namespace std;
#define rep(i,n) for(int i = 0; i < n ; i++)
#define pb push_back
#define MAX 100
static const int WHITE = 0;
static const int GRAY = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef set<ll> sl;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#defi... | 0 | 40,305,114 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a... | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | 0 | 57,863,514 |
#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
int n,C[10001]={},a;
cin>>n;
for(int i=0;i<n;i++)scanf("%d",&a),C[a]++;
for(int i=0,cnt=0;cnt<n;i++){
for(int j=0;j<C[i];j++){
if(cnt)printf(" ");
printf("%d",i),cnt++;
}
}
printf("\n");
return 0;
} | #include <iostream>
using namespace std;
int a,b;
int main(){
while(1){
cin>>a>>b;
if(a==0 && b==0){
break;
}
int dp[25][25]={},n=0,xi=0,yi=0,k[50][50]={};
cin>>n;
for(int i=1;i<=n;i++){
cin>>yi>>xi;
k[yi][xi]=-1;
}
if(k[1][1]!=-1){
dp[1][1]=1;
}
for(int y=1;y<=a;y++){
for(int x=1;x<=b;x++){
if(k... | 0 | 56,427,001 |
#include <iostream>
#include <cstdio>
using namespace std;
int parent(int i) { return i / 2; }
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
int main()
{
int H[300];
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &H[i]);
for (int i = 1; i <= n; i++) {
printf("node %... | #include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5... | 0 | 25,405,306 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
void solve(int W, int H, int N, vector<int> x, vector<int> y, vector<int> a) {
int left(0), right(W), top(H), bottom(0);
REP(i, N) {
switch (a[i]) {
case 1:
left = max(left, x[i]);
break;
case 2:
... | 0 | 86,223,147 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<pair<int, int>> ans;
if (N % 2 =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
int H,W;
cin >> H >> W;
... | 0 | 92,424,057 |
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <locale>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int solve(int n) {
vector<int>keep(n);
vector<int>ans(n-1);
int a;
for(int i=0;i<n;i++){
cin>>a;
... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ull N, X;
cin >> N >> X;
ull l = N;
ull a=N-X, b=X;
while(a!=0) {
l += 2 * (b/a) * a;
... | 0 | 61,115,680 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= 9; ++i) {
if (i * 111 >= n) {
ans = i * 111;
break;
}
}
cout << ans;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
string S; cin >> S;
int s = S.size();
int cnt0 = 0;
int cnt1 = 0;
rep(i, s){
if(S[i] == '0'){
cnt0++;
} else {
... | 0 | 18,993,155 |
#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... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAXN 100005
#define MOD 1000000007
ll dp[MAXN][2];
vector<ll> adj[MAXN];
void DFS(ll s,ll p)
{
dp[s][0] = 1;
dp[s][1] = 1;
for(auto it: adj[s])
{
ll v = it;
if(v != p)
{
DF... | 0 | 30,243,589 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a = 0;
int b = 0;
int d = 0;
int r = 0;
double f = 0.0;
cin >> a;
cin >> b;
d = a / b;
r = a % b;
f = (double)a / (double)b;
printf("%d %d %f\n",d,r,f);
} | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
void solve() {
int p;
int n;
cin >> n >> p;
vector <int> v(n);
int even = 0;
int odd = 0;
for(int i = 0; i < n; i++) {
cin >> v[i];
v[i] %= 2;
even += v[i] == 0;
odd += v[i] == 1;
}
if(odd == 0) {
... | 0 | 95,157,771 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int a[4];
int main(){
for(int i = 0; 6 > i; i++){
int tmp;cin>>tmp;tmp--;
a[tmp]++;
}
vector<int> z;
for(int i = 0; 4 > i; i++){
z.push_back(a[i]);
}
sort(z.begin(),z.end());
for(int i = 0; 4 > i; i++){
if(i < ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
using P = pair<int, int>;
int main() {
ll h, w; cin >> h >> w;
if(h%3==0 || w%3==0){
cout << 0 << endl;
return 0;
}
dump(h);
ll ht = h/... | 0 | 65,440,812 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
template <typename T>
ll extGCD(T a, T b, T &x, T &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | 0 | 82,737,713 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 105
#define INF 100000000
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(a)<<endl
typedef pair<int,int> P;
const int MAX = 100005;
const in... | 0 | 25,020,548 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main() {
string s,t;
cin >> s >> t;
if(s[0]==t[2]&&s[1]==t[1]&&s[2]==t[0]){
cout << "YES" << endl;
}
... | #include <iostream>
using namespace std;
int main(void) {
string s;
char c;
getline(cin, s);
for (int i = 0; i < s.size(); i++) {
if (!isalpha(s[i])) cout << s[i];
else {
if (isupper(s[i])) c = tolower(s[i]);
else c = toupper(s[i]);
cout << c;
... | 0 | 25,792,654 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
#include <iomanip>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 +... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 22,979,930 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
long long n, m, ans;
cin >> n >> m;
m /= 2;
ans = 0;
ans = min(n, m);
m -= ans;
if (m > 0)
ans += m / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long ans = 0, n;
cin >> n;
vector<int> score(40);
int num = 1, point = 1;
while (num < 40) {
for (int i = 1; i <= point + 1; i++) {
score[num] = point;
num++;
}
point++;
}
for (long... | 0 | 46,465,953 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
int main(){
string S; cin >>S;
int check[26]={};
rep(i,0,S.size()) {
int temp=S[i]-'a';
check[temp]++;
}
bool flag=true;
rep(i,0,26) {
if (1<check[i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, lst;
int a[maxn];
long long ans;
signed main () {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
ans = a[1] - 1, a[1] = 1;
lst = 1;
for (int i = 2; i <= n; ++i) {
if (lst != a[i] - 1) {
ans += (a[i] - 1) / (lst... | 0 | 86,293,706 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll h, w;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> h >> w;
if (h % 3 == 0 || w % 3 == 0) {
cout << 0 << endl;
exit(0);
}
ll ans = min(h, w);
for (int i = 1; i < w; ++i) {
ll... | 0 | 51,176,487 |
#include <iostream>
using namespace std;
int main(){
int x, y, tmp;
cin>>x>>y;
while(x || y){
if(x>y){
tmp=x;
x=y;
y=tmp;
}
cout << x << ' ' << y << endl;
cin>>x>>y;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define Opy ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
int main()
{
Opy;
int n;
cin>> n;
map< ll, ll> B;
for(int i = 0; i < n; i++)
{
ll tmp;
cin>> tmp;
B[tmp]++;
}
... | 0 | 38,871,022 |
#include <iostream>
int main()
{
int a, b;
std::cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a == b) std::cout << "Draw" << std::endl;
else if (a > b) std::cout << "Alice" << std::endl;
else std::cout << "Bob" << std::endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <ioman... | 0 | 73,972,860 |
#include <stdio.h>
#include <bits/stdc++.h>
int main(){
int n;
int i;
int j,k,l;
scanf("%d", &n);
for (i = 0; i < n; i++) {
int y,m,d;
int ans = 0;
scanf("%d%d%d", &y, &m, &d);
for (j = 1; j < y; j++) {
if (j%3 == 0) {
ans += 200;
}
else {
ans += 195;
}... | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | 0 | 67,663,167 |
#include <iostream>
using namespace std;
int main(){
int n;
float x1, y1, x2, y2, x3, y3, x4, y4;
cin >> n;
for(int i = 0; i < n; i++){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
float s1 = (y2 - y1) / (x2 - x1);
float s2 = (y4 - y3) / (x4 - x3);
if(s1 == s2){
cout << "YES" << endl;
}
else{... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
using P = pair<int,int>;
using ivec = vector<int>;
using Graph = vector<vector<int>>;
template<class T> inlin... | 0 | 68,743,967 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
cout << A[A.size() - 1] - A[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MOD 1000000007
#define PI 3.14159265
#define EPS 1e-9
#define Pi acos(-1.0)
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define forr(i,a,b) for(int i=(a); i<(b); i++)
#define clean(arr,val)... | 0 | 34,862,478 |
#include <bits/stdc++.h>
using namespace std;
#define fastio cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(0)
typedef long long ll;
#define swap(x, y)((x)^=(y)^=(x)^=(y))
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> matrix;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 62,752,601 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
char x;
int b,c;
while(1){
c=0;
while(1){
scanf("%c",&x);
if(x=='\n')break;
b=x-'0';
c=c+b;
}
if(c==0)break;
cout << c << endl;
}
} | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 0 | 32,963,537 |
#include <iostream>
#include<vector>
#include <map>
using namespace std;
int main(void){
int n;
long long k;
cin >> n >> k;
map<int,long long> m;
for (int i = 0; i < n; i++) {
int a,b;
cin >> a >> b;
m[a] += b;
}
long long sum = 0;
for(auto p : m) {
sum +=... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main() {
Int N, L, T; cin >> N >> L >> T; L *= 2, T *= 2;
vector<int> X(N), W(N);
for (int i = 0; i < N; i++) cin >> X[i] >> W[i], X[i] *= 2;
Int idx = 0;
for (int w : W) if (w == 2) idx += N - 2;
idx = idx * (T / L) % N;
... | 0 | 26,368,316 |
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#define inf 0x3f3f3f3f
#define pi 3.1415926535898
using namespace std;
const int N=2e5+10;
const int mod=1e9+7;
ll f[N+1];
ll b[N+1];
ll finds(ll x){
if(f[x]!=x)
f[x]=finds(f[x]);
ret... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;... | 0 | 61,150,709 |
#include <bits/stdc++.h>
#include <math.h>
#include <float.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; }
te... | #include <iostream>
#include <string>
std::string Shuffle(const std::string& s, int h)
{
int l = s.length();
return s.substr(h, l - h) + s.substr(0, h);
}
std::string Shuffle(std::string s, std::istream& in)
{
int m;
in >> m;
for(int i = 0; i < m; ++i){
int h;
in >> h;
s = Sh... | 0 | 85,109,124 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
int result = 0;
int a=0;
int b=0;
cin >> n;
while(1){
while(a<360){
a+=n;
result++;
}
if(a==360){
break;
} else {
a = a % 360;
}
}
cout << result << endl;
return 0;
} | #include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int main(){
int W, H;
while(cin >> W >> H, W||H){
int n, dp[17][17] = {0};
bool xx[17][17];
memset(xx, false, sizeof(xx));
cin >> n;
for(int i = 0; i < n; i++){
int x, y; cin >> x... | 0 | 12,123,291 |
#include<iostream>
using namespace std;
int main()
{
string a;
cin>>a;
for(int i=0;i<a.length();i++)
{
if(a[i]!='z')
{
if(islower(a[i]))
a[i]=a[i]+1;}
}
cout<<a<<endl;
re... | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<lo... | 0 | 53,227,390 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N,R;cin>>N>>R;
if(N>=10){
cout<<R<<endl;
... | #include<bits/stdc++.h>
double th = M_PI * 60.0 / 180.0;
int cnt, n;
int koch(int n, std::vector<double> left, std::vector<double> right){
if(n == 0){
return 0;
}
std::vector<double> m1(2);
std::vector<double> m2(2);
std::vector<double> m3(2);
m1[0] = left[0] + (right[0] - left[0]) / 3.... | 0 | 213,054 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
using namespace std;
using ll = unsigned long long;
using p = pair<int, int>;
int main()
{
int N, M;
cin >> N >> M;
int p = 0;
vector<int> connect(N);
rep(i, 0, M)
{
int k;
cin >> k;
r... | #include<bits/stdc++.h>
#define IO if(fopen("input.txt","r")) freopen("input.txt","r",stdin),freopen("output.txt","w",stdout)
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<... | 0 | 88,931,406 |
#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 <stack>
#include <iostream>
using namespace std;
int main(){
int num;
stack <int> s;
while(1){
cin >> num;
if(!num){
if (s.empty()) break;
cout << s.top() <<endl;
s.pop();
}
else s.push(num);
}
return 0;
} | 0 | 92,001,243 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define PB push_back
#define _SAD() ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
#define SZ(s) s.size()
#define SRT(x,y) sort(x,x+y)
#define REV(a,b) reverse(a,a+b)
#define VSR... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Max=1e5+10;
const int MOD=1e9+7;
int a[Max];
int pos[Max];
ll inv[Max];
ll fac[Max];
int sp;
int ss;
void init() {
fac[0]=1;
fac[1]=1;
inv[0]=1;
inv[1]=1;
for(ll i=2; i<=Max; i++) {
fac[i]=fac[i-1]*i%MOD;
i... | 0 | 24,234,189 |
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
#define dbg(x1) cout<<#x1<<" = "<<(x1)<<endl
#define dbg2(x1,x... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int sz=110;
vector<int> prime;
int siz;
bool mark[sz];
void seive()
{
int i,j,k,sq;
sq=sqrt(sz);
for(i=3;i<sz;i+=2) mark[i]=true;
for(i=3;i<=sq;i+=2){
if(mark[i]){
for(j=i*i;j<sz;j+=i) mark[j]=false;
... | 0 | 61,601,613 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
while(n!=0||k!=0){
vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
vector<int> S(n+1);
S[0] = 0;
for(int i=0;i<=n;i++){
S[i] = S[i-1] + a[i-1];
}
int max = 0;
int tmp = 0;
for(int i= 0;... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvv vector<vvl>
#define vvi vector<vector<int> >
#define vvl vector<vect... | 0 | 53,139,625 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#define loop(i,a,b) for(ll i=(a);i<(b);++i)
#define minv(v) *min_element(... | #include<iostream>
#include<string>
using namespace std;
int main(){
string str;
string sub1,sub2; ... | 0 | 58,763,438 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << (x) << '\n'
#define debugArray(x, n) ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
template<int64_t Prime>
struct mod_int {
int64_t v_;
mod_int(int64_t x=0) : v_(x) { normalize(); }
void normalize() { ((v_ %= Prime) += Pri... | 0 | 71,172,871 |
#include <iostream>
#include <map>
using namespace std;
long long mod(long long a, long long m) {
a %= m;
return a >= 0 ? a : a+m;
}
int main() {
long long n, k;
cin >> n >> k;
long long ans = 0, S[n+1], x[n+1];
map<long long, int> mp;
S[0] = 0, x[0] = 0;
mp[0]++;
for (int i = 1; i <= n; i++) {
long long a;
... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../lib/dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<double, double> Pd;
typedef pair<double, int> Pi;
const int MOD = 1e9 + 7;
... | 0 | 73,657,075 |
#include <stdio.h>
long long int fact(long long int n){
return (n==0)? 1 : n*fact(n-1);
}
int main(){
long long int n;
scanf("%lld", &n);
printf("%lld\n", fact(n));
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=(ll)1e9+7;
const ll INF=(ll)1e18+10;
const double PI=acos(-1);
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; }
... | 0 | 68,615,441 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<complex>
#include<cfloat>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define REP(i,n) for(int i=0; i<(int)(n... | #include<iostream>
int main(){
int a,b,N;
std::cin>>N>>a>>b;
if((b-a+1)%2==0){
std::cout<<"Borys"<<std::endl;
}else
std::cout<<"Alice"<<std::endl;
return 0;
} | 0 | 85,544,336 |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
using ll = long long;
int main(){
ll i,j,N,r=0,g=0,b=0,ans=0,st=1;
string S;
cin >> N >> S;
for(i=0;i<N;++i){
if(S[i]=='R') ++r;
if(S[i]=='G') ++g;
if(S[i]=='B') +... | 0 | 70,496,643 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
#define ll long long
#define loop(i,n) for(int i=0; i<n; i++)
#define loop1(i,n) for(int i=1; i<=n; i++)
#define loopi(i,s,e) for(int i=s; i < e; i++)
#define loopiRev(i,s,e) for(int i=s; i >= e; i--)
#define PI 3.14159265359
#def... | 0 | 25,722,739 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
if(n>=64)cout << 64 <<endl;
else if(n>=32)cout << 32 << endl;
else if(n>=16)cout << 16 << endl;
else if(n>=8)cout << 8 << endl;
else if(n>=4)cout << 4 << endl;
else if(n>=2)cout << 2 << endl;
else if(n==1)cout << 1 << endl;
re... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 43,346,063 |
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The Value Of " << #val << " is : " << val << '\n';
typedef long double ld;
typedef long long ll;
typedef ... | #include<cstdio>
#define MAX_W 20
#define MAX_H 20
using namespace std;
char field[MAX_H][MAX_W];
int W, H, count;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
void dfs(int x, int y)
{
for(int i = 0; i < 4; i++)
{
int nx, ny;
nx = x + dx[i], ny = y + dy[i];
if(nx >= 0 && nx < H && ny >= 0 &... | 0 | 57,265,099 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,c) for(int i=0;i<c;++i)
int main(){
int a,b,c,d;
cin >> a>> b>> c>>d;
int e = a+c;
int f = a+d;
int g = b+c;
int h = b+d;
cout << min(min(e,f),min(g,h)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long a, long long b) {
long long d = gcd(a, b);
return ... | 0 | 4,735,597 |
#include <iostream>
#include <cstdio>
using namespace std;
long long a[5000];
int main(){
int n;
while(cin >> n && n){
long long ans = -1e9;
for(int i = 0 ; i < n ; i++) cin >> a[i] , ans = max(ans, a[i]);
long long sub = 0;
for(int i = 0 ; i < n ; i++){
sub += a[i];
if( sub < 0 ){
sub = 0;
}else... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i,n) for(int i=0;i<n;i++)
#define all(in) in.begin(), in.end()
#define INF (sizeof(int) == 4 ? (int)1e9:(int)1e18)
#define EPS 0.0000000001
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<c... | 0 | 4,373,817 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int max_a = *max_element(a.begi... | #include<bits/stdc++.h>
using namespace std;
int dx[2] = {0,1};
int dy[2] = {1,0};
int area[17][17]={0};
int x,y;
int xg,yg;
int ans=0;
int saiki(int a,int b){
for(int i=0;i<2;i++){
if(a+dx[i] > x || b+dy[i] > y || area[a+dx[i]][b+dy[i]] == -1);
else if(area[a+dx[i]][b+dy[i]] == 2){
ans++;
}
els... | 0 | 48,278,515 |
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
const int N = 1e5 + 5, mod = 1e9 + 7;
bool step[N];
int n, m, dp[N];
ll solve(int idx){
if(idx > n || (step[idx] == false)) return 0;
if(idx == n) return 1;
... | #include <iostream>
using namespace std;
int main()
{
string N;
cin >> N;
int num = stoi(N);
int *aN = new int[num];
string a;
int inNum;
for(int i = 0; i < num; ++i)
{
cin >> a;
inNum = stoi(a);
aN[i] = inNum;
}
int result;
int temp;
int counter =... | 0 | 91,692,683 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl "\n"
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
template <typename T>
inline T gcd(T a, T b) { while (b != 0) swap(b, a %= b); return a; }
int main(){
ll x, y;
cin >> x >> y;
ll a... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#... | 0 | 89,060,475 |
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#i... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long q;
cin>>q;
while(q--){
long long x,y;
cin>>x>>y;
long long sqr=(long long)sqrt(x*y);
if(x==y){
cout<<2*sqr-2<<endl;
continue;
}
long long ans=2*sqr-1;
if(sqr*(sqr+1)>=x*y) ans--;
if(sqr*sqr==x*y) ans--;
cout<<ans<<e... | 0 | 64,925,584 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.