code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define rep(i, n) for(int i = 0; i < ... | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define read(a) scanf("%d", &a)
#define readl(a) scanf("%lld", &a)
#define reads(a) scanf("%s", a)
#define readf(a) scanf("%lf", &a)
#define readc(a) scanf("%c", &a)
#define debug(a, b) printf("%s = %d\n", a, b)
#define debug1(a, i, b) printf("%s[%d] = %d", a, i, b)
#defi... | 0 | 99,623,839 |
#include <iostream>
#include <vector>
#include <algorithm>
int main() {
int n;
while (std::cin >> n && n) {
std::vector<int> a;
int minLength = 10000000;
for (int i = 0; i < n; i++) {
int b;
std::cin >> b;
a.push_back(b);
}
std::sort(a.begin(), a.end());
for (int i = 0; i < a.size() - 1; i++) {
... | #include <vector>
#include <list>
#include <map>
#include <climits>
#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 <c... | 0 | 33,876,727 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define prior priority_queue
#define MOD 1000000007
#define INF64 (long long)1e18
#define INF (int)1e9
#define PI 3.1415926535897932384626433832795
#define ll long long
#define ld long double
#define ret return
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
int main()
{
int a, b, c;
cin >> a >> b >>c;
if(a-c == 0){
cout << b << endl;
return 0;
}
if(b-c == 0){
cout << a << endl;
return 0;... | 0 | 87,321,757 |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
int main() {
#ifdef FASTIO
cin.tie... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 94,871,272 |
#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 ;
string S, T;
cin >> S >> T;
string newstring ;
rep (i, N) {
newstring.push_back(S[i]);
newstring.push_back(T[i]);}
cout << newstring << end... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define logger(x) cout << __LINE__ << ": " << #x << " -> " << (x) << endl;
#define ll long long int
#define ull unsigned long long int
vector<ll> g[200005];
vector<bool> vis(200005, 0);
ll max_len = 0;
void dfs(ll node, ll lvl)
{
vis[node] = true;
... | 0 | 33,917,789 |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define pb push_back
const int N = 1e2 + 10;
int n, limd, limu;
int p[N], cnt[3];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n >> limd >> ... | #include<cstdio>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
char tmp;
int len;
int main()
{
int tmpp=1e9;
printf("? %d\n",tmpp);
fflush(stdout);
scanf("\n");
scanf("%c",&tmp);
if(tmp=='Y')
{
int ask_num=1e9-1;
int ans=1e9;
len=9;
... | 0 | 92,822,529 |
#include<iostream>
int main(){
int W,H,x,y,r;
int flag=1;
std::cin>>W>>H>>x>>y>>r;
if(x-r<0||y-r<0){
flag=0;
}
if(x+r>W||y+r>H){
flag=0;
}
if(flag==1){
std::cout << "Yes" << std::endl;
}else{
std::cout << "No" << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
int main(){
long long n,k;
cin>>n>>k;
vector<long long> tower(n);
vector<long long> tallest(n,-1);
for(long long i=0;i<n;i++){
cin>>tower.at(i);
tallest.at(i)=max(tallest.at(max((long long)0,i-1)),tower.at(i));
}
long l... | 0 | 3,175,575 |
#include<stdio.h>
int main()
{
int k,x;
scanf("%d %d",&k,&x);
k=k*500;
if(k>=x||k==x){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N; cin >> N;
map<int, int> m;
vector<ll> v;
for (int i = 0; i < N; i++){
int a; cin >> a;
m[a]++;
if(m[a]==2){
m[a] = 0;
v.push_back(a);
}
}
if(v.size()<2)... | 0 | 77,663,461 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#define MOD 1000000007
typedef long long ll;
using namespace std;
pair<ll,ll> dp[300030];
int main(){
int n;
cin>>n;
int m=pow(2,n);
ll A[m+1]={};
for... | #include<bits/stdc++.h>
using namespace std;
const int MAXN=2e4;
const int bias=1e4;
bool dp[2][MAXN];
char s[10000];
vector<int> h,v;
int main()
{
while(scanf("%s",s+1)!=EOF)
{
int x,y;
scanf("%d%d",&x,&y);
memset(dp,false,sizeof(dp));
int len=strlen(s+1);
h.clear();v.cl... | 0 | 48,899,183 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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++)
using namespace std;
int main(){
int N, D, ans=0;
cin >> N >> D;
vector<vector<int>> X(N, vector<int>(D));
rep(i, N){
rep(j, D){
cin >> X... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
#include <string.h>
#include <numeric>
using namespace std;
#define reps(i,s,n) for(int (i)=(s);(i)<(n);++(i))
#define rep(... | 0 | 74,270,932 |
#include <bits/stdc++.h>
using namespace std;
#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(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
int N,M; cin >> N... | #include <iostream>
using namespace std;
#define ll long long
#define pb push_back
#define ins insert
#define mp make_pair
#define pii pair<int, int>
#define pil pair<int, ll>
#define pib pair<int, bool>
#define SET(a, c) memset(a, c, sizeof(a))
#define MOD 1000000007
#define enld endl
#define endl "\n"
#define fi firs... | 0 | 53,765,871 |
#include <bits/stdc++.h>
#define ll long long int
#define uu first
#define vv second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define INF 1e9
#define fastRead ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
const int MAX = 1e6 + 6;
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.... | 0 | 74,222,368 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <cmath>
#include <utility>
using namespace std;
struct vertex { double x, y; };
void kock(int d, vertex p1, vertex p2)
{
if (d == 0)
return;
vertex s, t, u;
s.x = (2 * p1.x + 1 * p2.x) / 3;
s.y = (2 * p1.y + 1 * p2.y) / 3;
t.x = (1 * p1.x + 2 * p2.x) / 3;
t... | #include<cstdio>
int main(){
int n,k=3;
scanf("%d",&n);
if(n==1){
printf("Yes\n2\n1 1\n1 1");
return 0;
}
while(k*(k-1)/2<n)k++;
if(k*(k-1)/2!=n){
printf("No");
return 0;
}
printf("Yes\n%d\n",k);
printf("%d ",k-1);
for(int i=1;i<k;i++)printf("%d ",... | 0 | 35,499,129 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | #include <iostream>
#define rep(i,n) for(int i = 0;i < (n);++i)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
ll V = 0,E = 0;
for(int i = 1; i<=n;++i)V+=ll(i)*(n-i+1);
rep(i,n-1){
int a,b;
cin >>a >> b;
if(a > b)swap(a,b);
E += ll(a)*(n-b+1);
}
ll ans = V -E;
cout << ans << en... | 0 | 10,433,530 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
using namespace std;
int main()
{
int n,t2 = 0,t1 = 0;
scanf("%d",&n);
int a[10][10];
for(int i=0; i<n; ++i)
a[0][i] = i+1;
for(int j=1; j<=2;++j)
for(int i=0; i<n; ++i)
... | #include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#in... | 0 | 96,439,999 |
#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) for(int i=0; i<a;i++)
#define loop2(i,a,b) for(int i=(a... | #include<iostream>
#include<cstdlib>
#include<vector>
using namespace std;
int main(){
int n,m;
int kasuga;
cin>>n>>m;
long long min;
long long minyukkar;
vector<long long> maiyanx(n);
vector<long long> maiyany(n);
vector<long long> yukkarx(m);
vector<long long> yukkary(m);
for(i... | 0 | 62,910,021 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define erep(i, n) for (ll i = 1; i <= (n); i++)
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main(void) {
int n, m, x;
cin >> n >> m >> x;
vect... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 25,705,078 |
#include <iostream>
using namespace std;
int main(){
int n,a,b,c,x;
cin >> n >> a >> b >> c >> x;
while(1){
if(n==0)break;
int y[n];
for(int i=0;i<n;i++)cin >> y[i];
int i,j=0,ret=0,ch;
for(i=0;i<=10000;i++){
if(x==y[j]){
ret = i;
j++;
if(j==n)break;
}
... | #include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mem(a, b) memset(a, (b), sizeof(a))
#define all(cont) cont.begin(), cont.end()
#define pb push_back
#define PI 3.1415926535897932384626433832795
#define mod1 1... | 0 | 66,445,713 |
#include <bits/stdc++.h>
using namespace std;
#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(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll N,M; cin >> N >> M;
vector<p... | #include <bits/stdc++.h>
#include <sstream>
#include <iomanip>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std... | 0 | 50,711,179 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define pb(x) push_back(x)
#define HAYAKU_HAYAKU ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
HAYAKU_HAYAKU;
int a,b,c,k;
cin>>a>>b>>c;
cin>>k;
while(b <= a){
b = b * 2;
k--... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t n,m;
cin >> n >> m;
vector<pair<int64_t,int64_t>>mise(n);
for(int i=0;i<n;i++)
cin >> mise.at(i).first >> mise.at(i).second;
sort(mise.begin(),mise.end());
int64_t ans=0,s=0;
{int64_t i=0;
while(s<m){
if(m-s<mise.at(i).second){
... | 0 | 1,298,212 |
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
#define int ll
#define all(a) a.begin(),a.end()
#define F first
#define S second
#define pb push_back
#de... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N; string S; cin>>N>>S;
vector<bool>A(10,false);
long long ans=0;
for(int i=0;i<N-2;i++){
if(A[S.at(i)-'0'])continue;
A[S.at(i)-'0']=true;
vector<bool>B(10,false);
for(int j=i+1;j<N-1;j++){
if(B[S.at(j)-'0'])continue;
B[S.... | 0 | 66,378,545 |
#include<bits/stdc++.h>
#define rep(i,n) for(ll i=0; i<n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF 1e9
using ll = long long;
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) { i... | #include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
templa... | 0 | 9,008,867 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
using namespace std;
int main() {
int n, m; cin >> n;
vector<string> s(n);
vector<string> t(m);
map<string, int> st;
set<string> d1;
set<string> d2;
for(int i = 0; i < n; i++)... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int a[26];
string s... | 0 | 38,693,105 |
#include <iostream>
using namespace std;
int main() {
int a[100],n;
cin>>n;
for(int i=0; i<n; i++){
cin>>a[i];
}
int sw = 0;
for(int i=0; i<n ; i++){
int minj = i;
for(int j=i; j<n; j++){
if(a[minj]>a[j]){
minj = j;
}
}
if(i != minj){
swap(a[i],a[minj]);
sw++;
}
}
for(int i=0; i<n ; ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
rep(i, n+1) {
if (i == 0) continue;
int score = i;
int cnt = 0;
while (score < k) {
score *= 2;
cnt++;... | 0 | 26,432,798 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define MOD 1000000007
#define ll long long int
#define u64 un... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
if(n % 2 == 1){
for(int i = 1; i <= m; i++){
cout << i << ' ' << n - i + 1 << '\n';
}
}
else{
bool f = true;
int l = 1, r = n;
for(int i = 1; i <= m; i++){
... | 0 | 50,184,129 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int w;
cin >> s >> w;
for(int i=0; i<s.length(); i+=w)
cout << s[i];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x % y == 0) {
return y;
} else {
return gcd(y, x % y);
}
}
long long lcm(long long x, long long y) {
return x / gcd(x, y) * y;
}
int main() {
long long num;
long long tmp1;
long long ... | 0 | 85,192,088 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
cin >> a >> b;
cout << a*a - b;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | 0 | 40,479,068 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::ma... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 82,371,248 |
#include <bits/stdc++.h>
#define rep(i , n) for (int i = 0; i < (int)(n); i++)
const int INF = 1<<29;
using namespace std;
using ll = long long;
int main(){
string s , a = "";
cin>>s;
for(auto i : s){
if(i=='B'){
if(a.size()){
a.pop_back();
}
}
else{
... | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
usin... | 0 | 86,776,998 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
double l;
cin >> l;
double ans=l*l*l;
ans /= 27;
printf("%.8f",ans);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,ll>pa;
const int N=2e5+100;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
int x[100],y[100],xx[100],yy[100];
int n,k;
ll check(int l,int r,int d,int u)
{
ll sum=0;
for(int i=1;i<=n;i++){
if(x[i]>=l&&x[i]<=r&&y[i]<=u&&y... | 0 | 58,497,621 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
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);
}
bool compare(pair<int,int>p1, pair<int,int>p2){
return p1.... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
const int N = 505;
const int INF = 3000;
char arr[N][N];
char SYM[] = "RYGB";
int n, m, d;
int main()
{
ios_base::sync_with_stdio(0);
cin >> n >> m >> d;
if (d % 2... | 0 | 48,173,192 |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
int a, b, c;
double S, L, h, d;
cin >> a >> b >> c;
d = ( acos( -1.0) * c) / 180.0;
S = a * b * sin(d) / 2.0;
L = a + b + sqrt( a * a + b * b - 2 * a * b * cos(d));
h = b * sin(d);
printf( "%1f\n%1f\n%1f\n", S ,L, h);
return 0... | #include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | 0 | 29,812,297 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
... | #define _USE_MATH_DEFINES
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define pb push_back
ll power(ll a,ll b){ll r=1;for(;b;b>>=1){if(b&1)r=r*a%mod;a=a*a%mod;}return r;}
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vecto... | 0 | 4,273,395 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long int h, v;
cin >> h >> v;
if(h == 1 || v == 1) {
cout << 1 << endl;
return 0;
}
h *= v;
if(h%2)
cout << (h/2)+1 << endl;
else
cout << h/2 << endl;
... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;... | 0 | 72,429,353 |
#include <stdio.h>
int main() {
int m, f, r;
int mf;
scanf("%d %d %d", &m, &f, &r);
mf = m + f;
while(m != -1 || f != -1 || r != -1) {
if(m == -1 || f == -1) {
printf("F\n");
} else if(mf >= 80) {
printf("A\n");
} else if(65 <= mf && mf < 80) {
printf("B\n");
} else if(50 <= ... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
struct COODINATE
{
public:
int x, y, n;
};
vector<string> Gin;
Graph Gout;
queue<COODINATE> Q;
int search(int x, int y, int n, int h, int w){
if(x<0 || w<=x || y<0 || h<=y || Gout... | 0 | 37,691,189 |
#if 0
????????£?????????????´?1??????
pdf??????????????????????????????????????????????????§?????????????????????
???????????§??????????????§?????????????????°?????????????????£??¨????????§?????????
??¢?????\????????????????????????????????£??¨??????????????????
#endif
#include <iostream>
#include <queue>
using namespa... | #include <bits/stdc++.h>
#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 rep2(i,j,n) for(int j=i;j<n;j++)
#define rep3(i,j,n) for(int j=i;j<=n;j++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define sp(n) cout << fixed << setprecision(n)
typedef long long ll;
using namespa... | 0 | 40,535,952 |
#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(){
int a, b, c;
cin >> a >> b >> c;
map<int, int> mp;
mp[a]++;
mp[b]++;
mp[c]++;
cout << mp.size() << endl;
... | #include <bits/stdc++.h>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef long long ll;
typedef pair<i... | 0 | 32,844,320 |
#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 a,b;
cin >> a >> b;
a=(a+11)%13;
b=(b+11)%13;
if(a<b) cout << "Bob" << endl;
else if(a>b) cout << "Alice" << ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<int> V;
for (int i = 0; i < N; i++) {
int v; cin >> v;
V.push_back(v);
}
multiset<int> minus[N+1][N+1];
int cusL[N+1], cusR[N+1];
cusL[0] = 0, cusR[0] = 0;
for (int i = 0; i < min(K, N); i++) {
i... | 0 | 7,241,948 |
#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;
ll a[100010];
ll sum_all[100010],sum_plus[100010];
int main(){
int n,k;
cin>>n>>k;
rep(i,n)cin>>a[i];
rep(i,n){
sum_all[i+1]=sum_all[i]+a[i];
sum_plus[i+1]=sum_plus[i]+... | #include<bits/stdc++.h>
using namespace std;
int a,b,n,x,y;
int main(){
while(1){
int memo[19][19]={0},check[19][19]={0};
cin>>a>>b;
if(a==0 && b==0)break;
cin>>n;
memo[0][1]=1;
for(int i=0;i<n;i++){
cin>>x>>y;
check[x][y]=1;
}
for(int i=1;i<=a;i++){
for(int j=1;j<=b;... | 0 | 86,392,627 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b && b < c) {
cout << "Yes"
<< "\n";
} else {
cout << "No"
<< "\n";
}
return 0;
} | #include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
#define P 1000000007
int n, d, ans;
char s[200005];
int main(){
scanf("%d%s", &n, s + 1);
for (register int i = 1; i <= (n << 1); ++i)
if ((i & 1) ^ (s[i] == 'B')) s[i] = 'R'; else s[i] = 'L';
ans = 1;
for (register int i = 1; i <= (n << ... | 0 | 88,221,650 |
#include <iostream>
using namespace std;
int main()
{
long long a[100];
long long max, bat,temp, temp1;
bat = 10;
for (int i = 1; i <= 10; i++)
cin >> a[i];
for (int i = 1; i <= 11; i++)
{
max = 0;
for (int j = 1; j <= bat; j++)
if(a[j] > max)
{
max = a[j];
temp1 = j;
}
temp = a[bat];
a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
char c;
cin >> c;
set<char>a = {'a','e','i','o','u'};
if (a.count(c))cout << "vowel" << endl;
else cout << "consonant" << endl;
} | 0 | 47,756,068 |
#pragma GCC optimize("Ofast")
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdl... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
for(int i=0;i<n;i++) cin >> a.at(i);
for(int i=0;i<m;i++) cin >> b.at(i);
int ans=0;
for(int i=0;i<=n-m;i++){
for(int j=0;j<=n-m;j++){
int k=1;
for(int y=0;y<m;y++)... | 0 | 9,656,626 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long A, long long B, long long C, long long D)
{
cout << (min(A, B) + min(C, D)) << endl;
}
int main()
{
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long C;
scanf("%lld", &C);
long long D;
scanf("%... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using ... | 0 | 59,025,787 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (ll i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
ll N;
cin >> N;
ll a;
cin >> a;
for(int i=1... | #include <bits/stdc++.h>
using namespace std;
void test(string ABCD, string op, string &answer){
if(op.size() == 3){
int sum = ABCD.at(0) - '0';
for(int i = 0; i < 3; i++){
if(op.at(i) == '+') sum += ABCD.at(i+1) - '0';
if(op.at(i) == '-') sum -= ABCD.at(i+1) - '0';
}... | 0 | 54,614,744 |
#include <stdio.h>
#define maxn 200010
int head[maxn],tot,n,m,d[maxn],pre[maxn],q[maxn*10],vis[maxn];
struct node{
int to,next;
}e[maxn<<1];
void add_edge(int u,int v){
tot++,e[tot].to=v,e[tot].next=head[u],head[u]=tot;
}
void init(){
int i,u,v;
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++){
scanf("%d%d",&u,&v);
add_... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 998244353
#define dd double
#define vi vector<int>
#define vll vector<ll>
#define forr(i, n) for(ll i=0;i<n;i++)
#define revf(i,n) for(ll i=n-1;i>=0;i--)
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define rep1(i,b) for(ll i=1;i<=b;i++)
#defi... | 0 | 82,281,062 |
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
ll t[100005], x[100005], y[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t[i] >> x[i] >> y[i];
}
int index;
int sa;
bool ok = true;
if (n =... | #include <bits/stdc++.h>
#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#in... | 0 | 57,579,332 |
#include <bits/stdc++.h>
#define N 200010
#define int long long
#define mod 1000000007
using namespace std;
inline int read()
{
int x=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
inline int qpow(int bas,int pw)
{... | #include <iostream>
#include <vector>
#define nmax 200010
using namespace std;
int n,m;
bool onr[nmax];
int poz[nmax];
vector< pair<int,int>> g[nmax];
int l[nmax];
int r[nmax];
int d[nmax];
bool viz[nmax];
void solve(int nod)
{
viz[nod]=1;
for( pair<int,int> p:g[nod])
{
poz[p.first]=poz[nod]+p.secon... | 0 | 89,832,046 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<pair<int,int>>>;
using pp=pair<int,pair<int,int>>;
#define MOD 1000000007
#define INF 1000000000
int main(){
int N;
cin>>N;
cout<<(N-1)/2<<endl;
} | #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 debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | 0 | 69,966,712 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
#define ll long long
#define inf 999999999
#define pa pair<int,int>
using namespace std;
int main(){
int c[22],n,m;
cin>>n>>m;
for(int i=0;i<m;i++) cin>>c[i];
static int dp[22][5... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | 0 | 49,787,032 |
#include <bits/stdc++.h>
using namespace std;
void solve(string s){
vector<vector<char>> v;
vector<char> tmp;
tmp.push_back('.');
tmp.push_back(',');
tmp.push_back('!');
tmp.push_back('?');
tmp.push_back(' ');
v.push_back(tmp);
tmp.clear();
tmp.push_back('a');
tmp.push_back('... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f... | 0 | 54,592,797 |
#include <iostream>
#include <vector>
using namespace std;
struct node {
int parent;
int depth;
vector<int> children;
node() : parent(-1), children() {}
};
int main() {
int N;
cin >> N;
vector<node> node_list(N, node());
for (int i = 0; i < N; ++i) {
int a, b;
cin >> a >>... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long d... | 0 | 70,454,530 |
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | #include <iostream>
void p(char *str, int a, int b) {
for (int i = a; i <= b; i ++)
std::cout << str[i];
std::cout << std::endl;
}
void replace(char *str, int a, int b, char *replace_str) {
for (int i = a; i <= b; i ++)
str[i] = replace_str[i - a];
}
void reverse(char *str, int a, int b) {
char temp;
... | 0 | 22,207,779 |
#include<bits/stdc++.h>
using namespace std;
main()
{
int n;
scanf("%d",&n);
int bf=-1;
int ans=0;
for(int i=0;i<n;i++)
{
int a;
scanf("%d",&a);
if(a==bf)
{
ans++;
bf=-1;
}
else
{
bf=a;
}
}
printf("%d",ans);
} | REP(y,2020) {
REP(x,2020) {
int X = (x + y) / 2;
int Y = (x - y) / 2;
if (0 < X && X < 3000 && 0 < Y && Y < 3000) {
ansGrid[X][Y] =grid[x][y];
}
}
}
for (int y=W; y<W+H; y++) {
for (int x=1; x<=W; x++) {
cout << ... | 0 | 44,569,594 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int cur;
cin >> cur;
int cnt=1;
int ans=0;
for(int n=1; n<N; n++) {
int a;
cin >> a;
if(a==cur) {
cnt++;
} else {
ans += cnt/2;
cnt=1;
}
... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
const int M = 1e9+7;
using namespace std;
main()
{
fast;
int a,b;
cin>>a>>b;
if (a==1 && b==1)
cout<<"... | 0 | 23,588,713 |
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <cmath... | #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 | 18,150,692 |
#include <stdio.h>
#include <iostream>
#include <utility>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int dp[1001][1001] = {};
int getLCS(string X, string Y)
{
int m = 0;
for (int i = 1; i <= X.size(); i++)
{
for (int j = 1; j <= Y.size(); j++)
{
... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
signed main () {
int n, m;
cin >> n >> m;
vector < int > s(n), t(m);
for (int &x: s)
cin >> x;
for (int &x: t)
cin >> x;
vector < vector < int > > dp(n + 1, vector < int > (m + 1, 0));
for (int i = 0; i <= n; ++i)
dp[i][0] = 1;
for (in... | 0 | 93,006,138 |
#include<cstdio>
#define int long long
#define min(a,b)((a)<(b)?(a):(b))
#define max(a,b)((a)>(b)?(a):(b))
const int N=1e5+3;
int n,m,a[N],b[N],ans1=-1e18,ans2=1e18,s;
signed main(){
scanf("%lld%lld",&n,&m);
for(int i=1;i<=n;i++)
scanf("%lld",a+i),b[i]=a[i]+b[i-1];
s=0;
for(int i=m;i<=n;i++)s+=max(a[i],0);
for(... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int findNextBottom(vector<int> prices, int start) {
int bottom = -1;
if (start == 0) {
bottom = 0;
}
for (int i = start + 1; i < prices.size(); i++) {
if (bottom < 0) {
if (prices[start] > prices[i])... | 0 | 44,053,167 |
#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>
using namespace std;
#define fo(i,a,n) for(i=a;i<n;i++)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort... | 0 | 62,561,606 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
int x = a.length(), y = b.length(), z = c.length();
if (a[x - 1] == b[0] && b[y - 1] == c[0])
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y;cin>>x>>y;
if(y%2!=0){
cout <<"No"<<endl;
return 0;
}
int mini=x*2;
int maxi=x*4;
if(y<=maxi && y>=mini){
cout <<"Yes"<<endl;
}else{
cout <<"No"<<endl;
}
} | 0 | 33,007,654 |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define lln long long int
#define IOS ios::sync_with_stdio(0);cin.tie(0);
int main(){
IOS;
lln n;
cin >> n;
lln mi = INT64_MAX;
for(lln i=1;i*i<=n;i++){
if(n % i == 0){
mi = min(n/i-1 + i-1,mi);
}
}
co... | #include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
int t[101010];
int main(){
int N, C, K;
scanf("%d %d %d", &N, &C, &K);
rep(i, N) sca... | 0 | 87,020,583 |
#include <bits/stdc++.h>
#define newl "\n"
using namespace std;
using lli = long long int;
using vvint = vector <vector <int>>;
const int mod = 1e9 + 7;
const int N = 2e5 + 1;
void solve(){
string s;
cin >> s;
int n = s.length();
int ans = 1e9;
for(int i = 0;i < n - 2;++i){
int num = stoi(s.substr(i,3));
ans =... | #include <iostream>
#include <vector>
using namespace std;
int main(){
long N, A, B;
cin >> N >> A >> B;
if(A+B > N+1 || A*B < N){
cout << -1 << endl;
}else{
vector<int> v;
v.push_back(A);
for(int i = 1; i < B; i++){
if(i <= (N-A)%(B-1)) v.push_back((N-A)/(B-1... | 0 | 59,673,890 |
#include <bits/stdc++.h>
using namespace std;
int FindRainyDays(string& S) {
int max_length = 0;
int count = 0;
for (int i = 0; i < S.length(); ++i) {
if (S[i] == 'R') {
count++;
}
else {
max_length = max(max_length, count);
count = 0;
}
}
max_length = max(max_length, count);... | #include<bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define ll long long
#define maxheap priority_queue<int>
#define minheap priority_queue<int,vector<int>,greater<int>>
const double pi = acos(-1.0);
const double eps = 1e-9;
using namespace std;
void solve(){
int n;
cin >> n;
vec... | 0 | 48,515,487 |
#include<stdio.h>
int main(){
char a[150];
char b[150];
scanf("%s",&a);
scanf("%s",&b);
printf("%s%s", b,a);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int t,i,sum=0,sum1=0,min1;
cin>>t;
int a[t];
for(i=0;i<t;i++)
{
cin>>a[i];
sum+=a[i];
}
min1=INT_MAX;
for(i=0;i<t;i++)
{
sum-=a[i];
sum1+=a[i];
min1=min(abs(sum-sum1),min1);
}
cou... | 0 | 82,979,974 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
int left = 0, right = N - 1;
string ls, rs;
cout << left << endl;
cin >> ls;
if(ls == "Vacant") return 0;
cout << right << endl;
cin >> rs;
if(rs == "Vacant") return 0;
while(true) {
int mid = (le... | #include <iostream>
#include <string>
#include <map>
using namespace std;
int main() {
map<string, bool> T;
int commandNum;
cin >> commandNum;
for (int i = 0; i < commandNum; i++) {
string command, str;
cin >> command >> str;
if (command[0] == 'i') T[str] = true;
else {
if (T[str]) cout << "ye... | 0 | 67,849,986 |
#include <iostream>
void round_up(int *num, const int round_num)
{
int fraction;
int tmp;
tmp = *num;
fraction = tmp % round_num;
tmp /= round_num;
if (fraction != 0){
tmp++;
}
*num = tmp * round_num;
}
int debt(const int amount, const int weeks)
{
int ret;
int round_nu... | #include <cstdio>
#include <cstring>
int a,b;
int dp[16][16];
bool bad[16][16];
int main (int argc, char const* argv[])
{
int a,b,n;
while(scanf("%d %d",&a,&b),a) {
memset(dp,0,sizeof(dp));
memset(bad,0,sizeof(bad));
scanf("%d",&n);
for(int i=0;i<n;i++) {
int x,y;
scanf("%d %d",&x,&y);
bad[x-1][y-1]=... | 0 | 19,406,204 |
#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;
int main() {
fastio;
int n, a;
cin >> n >> a;
n %= 500;
if (n <= a)
cout << "Yes";
... | #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; }
int n;
const int MAX = 100100;
int calctime(string s) {
int hh, mm, ss... | 0 | 85,002,988 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
int main(){
int x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
vi p(a), q(b), r(c);
rep(i,a)cin>>p[i];
rep(i,b)cin>>q[i];
rep(i,c)cin>>r[i];
sort(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
const int mod = 1e9 + 7;
const int ma = 201010;
ll fact[ma], rfact[ma];
ll mod_pow(ll x, ll n, ll mod) {
ll a = 1LL;
while (n) {
if (n%2) a = ((a%mod)*(x%mod))%mod;
x = ((x%m... | 0 | 20,320,325 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
vector<string> mp(h);
int c = 0;
vector<pair<int, int>> v;
for (int i = 0; i < h; i++) {
cin >> mp[i];
for (int k = 0; k < w; k++)
if (mp[i][k] == '#') {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define open(file, in, out) if (fopen(file in, "r")) { \
freopen(file in, "r", stdin); \
freopen(file out, "w", stdout); \
}
#de... | 0 | 24,877,372 |
#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>;
const int INF = INT32_MAX;
const ll INFL = INT64_MAX;
const int mod = 1e9 + 7;
template <typename T>
void print_vec(vector<T> v) {
for (T i : v) cout << i << " ";
cout << end... | #include <bits/stdc++.h>
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000... | 0 | 63,247,953 |
#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... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typ... | 0 | 28,324,159 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin >> N;
cout << 0 << endl;
string current;
cin >> current;
if (current == "Vacant") {
return 0;
}
int left=0, right=N, prev=0;;
for(int i=0; i<20; i++) {
int mid = (left+right)/2;
cout << mid << endl;
string ans;
cin >> ans;
i... | #include <bits/stdc++.h>
using namespace std;
void input(int& rnSwitchSiz,
vector<vector<int>>& rvvnLightSw, vector<int>& rvnReslt)
{
int nLightSiz;
cin >> rnSwitchSiz >> nLightSiz;
rvvnLightSw.resize(nLightSiz);
for (int i = 0; i < rvvnLightSw.size(); i++)
{
int nLightSwSiz;
cin >> nLi... | 0 | 26,753,894 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T>
int maximum(vector<T> A){
int m = -1;
for (T a : A) if (a > m) m = a;
return m;
}
int main(){
int A,B,C;
cin >> A >> B >> C;
vector<int> D = {A,B,C};
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K, S;
cin >> N >> K >> S;
for (int i = 0; i < N; ++i) {
if (i) cout << ' ';
if (K) {
cout << S;
K--;
... | 0 | 68,935,556 |
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n,k) (((ll)n>>(ll)k)&1)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, M;
cin >> H >> W >> M;
vector<int> A(H), B(W);
set<pair<int, int>> object;
for(int i = 0; i < M; i++) {
int h, w;
cin >> h >> w;
A.at(h - 1)++;
B.at(w - 1)++;
object.insert(make_pair(h - 1, w - 1));
}
int maxa = 0;
... | 0 | 28,060,367 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
string str;
cin>>k;
cin.ignore();
getline(cin,str);
int len = str.length();
if(len>k){
str[k]='.';
k++;
str[k] ='.';
k++;
str[k]='.';
for(int i=0;i<k+1;i++)
cout<<str[i];
}
else
cout<<str;
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<int>
#define nl endl
#define tc \
ll t; \
cin >> t; \
while (t--)
#define fastio \
ios_base::sync_with_stdio(NULL); \
cin.tie(NULL); \
cout.tie(NULL);
using namespa... | 0 | 52,341,801 |
#include <iostream>
using namespace std;
int f(int H, int W){
int a=W;
while(H){
while(W){
printf("#");
W--;
}
cout << endl;
W=a;
H--;
}
}
int main() {
int H, W;
while(cin >> H >> W){
if(H==0&&W==0){break;}
f(H, W);
cout << endl;
}
return 0;
} | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 26,517,777 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
static const int MAX_INT = std::numeric_limits<int>::max();
static const lo... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
ll n;
cin >> n;
int ans = 15;
for (ll i = 1; i * i <= n; i++) {
if (n % i) continue... | 0 | 82,059,408 |
#include<bits/stdc++.h>
using namespace std;
char s[101010];
int a[101010];
int main()
{
scanf("%s", s);
int k;
scanf("%d", &k);
int len = strlen(s);
int n = 0;
for(int i = 0; i < len; i++)
{
if(i == 0 || s[i] != s[i-1])
{
n++;
a[n] = 1;
}
else
a[n]++;
}
if(n == 1)
{
printf("%lld\n", 1ll * ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1)... | 0 | 97,599,247 |
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
int map[15][15];
void floyd(int n)
{
for(int k=0;k<=n;k++)
{
for(int i=0;i<=n;i++)
{
for(int j=0;j<=n;j++)
{
map[i][j]=min(map[i][j],map[i][k]+map[k][j]);
}
}
}
}
int main()
{
int n,i,j,a,b,t;
wh... | #include <cstdlib>
#include <string>
#include <iostream>
namespace {
inline int ctoi(char c) {
return c - '0';
}
}
int main() {
std::string str;
while (true) {
getline(std::cin, str);
if (str.size() == 1 && str[0] == '0') {
break;
}
int sum = 0;
for (auto ... | 0 | 73,429,776 |
#include <iostream>
using namespace std;
int main()
{
int x,y,c;
cin >> x >> y >> c;
int i, count = 0;
for(i = x; i <= y && i <= c;i++)
if(c%i == 0) count++;
cout << count << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
const ll MOD = 1000000000000000001;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll Len(ll n) {
ll s=0;
while(n!=0) ... | 0 | 40,930,111 |
#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;
typedef long long ll;
using tpl = tuple<int, int, int>;
typedef pair<int,int> pii;
void fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}
ll K;
int main(){
cin >> K;
if(K % 50 == 0){
cout << 50 << endl;
for(int i = 0; i < 50; i++){
... | 0 | 61,801,071 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n, m; cin >> n >> m;
vector<ll> routes(n+1, 1);
set<int> danger;
for(int i=0; i<m; i++){
int d; cin>>d;
danger.insert(d);
}
ll mod = 1000000007;
for(int i=1; i<=n; i++){
if(danger.find(... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 100005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x... | 0 | 16,918,981 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int n;
int sh, sm, ss, th, m, ts;
vector<pair<int,int> > tim;
int main(){
while(cin >> n, n){
tim.clear();
for(int i = 0; i < n; i++){
scanf("%d:%d:%d %d:%d:%d", &sh, &sm, &ss, &th, &m, &ts)... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll h,w;
cin >> h >> w;
vector<string> s(h);
for(auto &i:s)cin >> i;
vector<vector<ll>> dis(h,vector<ll>(w,1e9));
for(int i = 0;i<h;i++)
{
for(int j = 0;j<w;j++)
{
if(s[i][j]=='#')dis[i][j]=0;
}
}
for(int i = 0;i<h;i++)
{
... | 0 | 41,020,231 |
#include<iostream>
using namespace std;
bool Compare(const char*s, const char*p, int i, int sMax) {
for (int j = 0; p[j] != '\0'; j++) {
if (s[(i + j) % sMax] != p[j])return false;
}
return true;
}
int main() {
char s[100];
char p[100];
int sMax;
cin >> s >> p;
for (sMax = 0; s[sMax] != '\0'; sMax++);
for (i... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define PI 3.141592653589793
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> void chmax(T &a,T b) { if (a<b) a=b;}
template<class T> void chmin(T &a,T b) { if (a>b) a=b;}
int gcd(int a, int ... | 0 | 31,467,113 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
... | #include<iostream>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
#define pi 3.141592653589793283462
int main(){
int a,b;
double f,aa,bb;
cin>>a>>b;
f=a/b;
aa=a;
bb=b;
cout<<a/b<<" "<<a%b<<" ";
cout<< fixed << setprecision(10) << aa/bb << "\n";
return 0;
} | 0 | 74,555,752 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string input;
cin >> input;
if (input[2] == input[3] && input[4] == input[5]) {
cout << "Yes" << "\n";
}else {
cout << "No" << "\n";
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
ll MOD = 1e9 + 7;
int main() {
string s, t;
cin >> s >> t;
map<char, int> ms,mt;
map<int, vector<int>> vs, vt;
rep(i, s.length()){
if (ms[s[i]] == 0) {
ms[s[i]] = i;
... | 0 | 46,581,892 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
char a,b; cin>>a>>b;
if(a=='H'){
cout<<b<<endl;
}
else{
... | #include <algorithm>
#include <iostream>
#include <vector>
#include <set>
#include <functional>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define MAX 1000001
void _main(){
... | 0 | 2,313,713 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int N, A, B; cin >> N >> A >> B;
int answer = 0;
for (int i = 1; i <= N; ++i) {
string numstr = to_string(i);
int sum = 0;
for (int n = 0; n < numstr.size(); ++n) {
sum += numstr[n] - '0';
}
if (sum >= A && sum <= B) {
answer += ... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using Grid= vector<vector<char>>;
using vin= vector<int>;
using ll=long long;
using vll= vector<ll>;
using vbl=vector<bool>;
using vch=vector<char>;
using pinin=pair<int ,int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define r... | 0 | 64,032,547 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n, h;
cin >> n >> h;
vector<int> a(n), b(n);
for (int i=0; i<n; i++){
cin >> a[i] >> b[i];
}
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
int ans = 0;
int sum = 0;
for (int i=0; i<n; i++){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<pair<ll, ll>> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define popcount(x) __builtin_popcountll(x)
const long double PI = acos(-1);
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll... | 0 | 24,171,090 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
int main(){
int n, m;
cin >> n >> m;
vector<P> aru(n);
for(int i=0; i<n; ++i){
int a, b;
cin >> a >> b;
aru[i] = make_pair(a,b);
}
sort(aru.begin(),aru.end());
int ans = 0;
int arui = 0;
priority_queue<int> que;
for(i... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
int main() {
ll N,K;
cin>>N>>K;
vector<ll>vec(N);
for(ll i=0;i<N;i++){
cin>>vec.at(i);
}
vector<ll>voc(N,1);
for(ll i=0;i<K;i++){
ll a,b;
cin>>a>>b;
if(vec.at(a-1)>=vec.at(b-1)){
voc.at(b-1)=0;
... | 0 | 3,249,183 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <fstream>
#include <cmath>
#include <random>
#include <complex>
#include <functional>
#define ll ... | #include<iostream>
#include<cmath>
#include<numeric>
#include<functional>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<iomanip>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n;i++)
#define ll long long
#define INF 2147483647
using namespace std;
us... | 0 | 20,159,977 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int a, b;
while (cin >> a >> b) {
if ((a|b) == 0)
break;
int n;
cin >> n;
vector<vector<int> > work(b, vector<int>(a, 0));
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
work[y-1][x-1] = 1;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1001001001;
const int MOD... | 0 | 77,556,588 |
#include<iostream>
using namespace std;
int main (void)
{
long long int a,b,c,n,ans;
int i;
cin>>n>>a>>b;
c=0;
i=0;
ans=n/(a+b);
ans=ans*a;
if((n%(a+b))>a)ans+=a;
else ans=ans+(n%(a+b));
cout<<ans;
} | #include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <algorithm>
#include <climits>
#include <iomanip>
#define endl "\n"
#define debug(x) cout << #x << " : " << x << endl;
#define debug2(x, y) cout << #x << " : " << x << ", " <<... | 0 | 20,278,167 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S; cin >> S;
string ans_S;
ans_S += S.at(0);
for(int i = 1; i < S.size(); i++){
if(ans_S.at(i - 1) == '1')
ans_S += '0';
else
ans_S += '1';
}
int cnt = 0;
for(int i = 0; i < S.size(); i++){
if(ans_S.at(i) != S.at(i)) c... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long l... | 0 | 100,875,103 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int N,i;
cin>>N>>i;
int ans=N-i+1;
cout<<ans<<endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespac... | 0 | 90,954,275 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<int> vect(N+1);
vector<int> vecx(N+1);
vector<int> vecy(N+1);
for(int i=0;i<N;i++){
cin>>vect.at(i+1)>>vecx.at(i+1)>>vecy.at(i+1);
}
bool can =true;
for(int i=0;i<N;i++){
int x=vecx.at(i+1)-vecx.at(i);
int y... | #include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <stack>
#include <complex>
#include <stdlib.h>
#include <stdio.h>
#include <functional>
#include <cfloat>
#define fs first
#... | 0 | 10,478,040 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
#define Reps(i, x, N) for(int i = x; i < N; i++)
const int LLINF = 1LL << 60;
signed main()
{
int N;
int A, B, C;
cin >> N;
Rep(i, N) {
int cnt = 0;
cin >> A >> B >> C;
while(A < 1000) {
... | #include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
ll const MAX = 3e+5;
ll const D = 64;
ll const MOD = (ll)1e+9 + 7;
P table[MAX+1][D];
void solve() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
for (l... | 0 | 22,443,728 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K,ans;
cin >>N >> K;
if (K<2)
ans=0;
else
ans=N-K;
cout << ans << endl;
} | #include <iostream>
#include <stack>
using namespace std;
int main(int argc, char const* argv[])
{
stack<int> data;
int n;
while( cin >> n ){
if( n != 0 ) data.push( n );
else{
cout << data.top() << endl;
data.pop();
}
}
return 0;
} | 0 | 67,653,774 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | #include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0, M = 0;
cin >> N >> M;
string S;
cin >> S;
rep(i,N){
if(S[i] == '-'){
cout << "No";
return 0;
}
}
if(S[N] != '-'){
cout << "No";
return ... | 0 | 95,883,033 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
typedef long long ll;
#define press_F_to_pay_respect ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn for(int i=0;i<n;i++)
#define form for(int j=0;j<n;j++)
#define fore(i,a,b) for(int i = a; i < (b); i++)
#define pb push_back
#de... | #include<iostream>
using namespace std;
int main() {
int a,b,c=0,d;
int yama[10];
int hyama[3];
for(a=0;a<10;a++){
cin >> yama[a];
}
for(a=0;;a++){
if(a == 9){
a = 0;
c = 0;
}
if(yama[a] < yama[a+1]){
b = yama[a];
yama[a] = yama[a+1];
yama[a+1] = b;
}
else {
c++;
}
if(c == 9) {
... | 0 | 81,977,172 |
#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 n;
cin >> n;
vector<int> v(n);
rep(i,n) cin >> v[i];
sort(v.begin(), v.end());
double t = v[0];
rep(i,n-1) {
t = double(t + v[i+1]) /2;
}
prin... | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
#define int long long
#define double long double
const int INF = 1e18, MOD = 1e9 + 7;
signed main() {
int n, a;
int sum[111111] = {};
cin>>n;
for (int i = 0; ... | 0 | 2,192,389 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.