code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#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... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | 1 | 7,736,632 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ans;
int a=-1;
for(int i=1; i<=n; i++){
int count=0;int s=i;
while(s%2==0&&s>0){
s=s/2;
count++;
}
if(count>a){
a=count;
ans=i;
}
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin>>n;
int ans=1;
int M=0;
for(int i=1;i<=n;i++){
int x=0;
int y=i;
while(y%2==0){
x++;
y/=2;
}
if(M<x){
M=x;
ans=i;
}
}
cout<<ans<<endl;
} | 1 | 65,850,486 |
#include <iostream>
using namespace std;
int T[100][100];
void init(){
for (int i = 0; i < 100; ++i)
{
for (int j = 0; j < 100; ++j)
{
T[i][j] = 0;
}
}
}
void DispTable(int n){
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
cout << T[i][j];
if(j!=n-1) cout << " ";
}
cout << endl... | #include<bits/stdc++.h>
using namespace std;
int n;
vector<vector<int> > g;
int ans[101][101];
int main(){
cin>>n;
for(int i=0;i<n;i++){
int u,k;
cin>>u>>k;
for(int j=0;j<k;j++){
int v;
cin>>v;
ans[u][v]=1;
}
}
for(int i=1;i<=n;i++){
... | 1 | 6,581,242 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int H,W,K;
cin>>H>>W>>K;
vector<vector<char>> c(H,vector<char> (W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin>>c.at(i).at(j);
}
}
vector<vector<char>> d(H,vector<char> (W));
for... | #include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
using namespace std;
#define repi(i,n) for(int i=... | 1 | 74,478,986 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
ll X,A,B;
cin>>X>>A>>B;
int eat=B-A;
if(eat<=0)
{
cout<<"delicious"<<endl;
}
else if(eat<=X)
{
cout<<"safe"<<endl;
}
else
{
cout<<"d... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
char maze[51][51];
int main(){
int x,a,b;
cin >> x >> a >> b;
if (b <= a ) cout << "delicious" << endl;
else if (b >... | 1 | 80,085,455 |
#include<bits/stdc++.h>
#define ll long long int
#define INF 1000000000
#define mod 1000000007
#define endl "\n"
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
int main()
{
fio
ll n;
cin >> n;
ll h[n + 1];
for(ll i = 1; i <= n; i++) {
cin >> h[i];
}
ll dp[n + 1] = {0};
dp[1] ... | #include<bits/stdc++.h>
using namespace std;
int frog1(int N, int a[])
{
int dp[N+1];
dp[0] = 0;
dp[1] = a[0];
dp[2] = abs(a[1] - a[0]);
dp[3] = min(dp[2] + abs(a[2]-a[1]) , abs(a[2]-a[0]));
for( int i = 3; i < N; i++)
{
dp[i+1] = min(dp[i] + abs(a[i]-a[i-1]), dp[i-1] + abs(a[i]-a[i-... | 1 | 98,163,483 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | 1 | 41,221,939 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
int N, K;
vector<ll> H;
ll INF = 1145141919810893;
vector<ll> pressAr;
void press() {
for (int i = 0; i < H.size(); i++) {
pressAr.push_back(H[i]);
}
sort(pressAr.begin(), pressAr.end());
pressAr.erase(unique(pressA... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include<unordered_map>
typedef long long ll;
... | 1 | 81,858,979 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include<bits/stdc++.h>
#define lli long long int
#define rep(i,n) for(lli i=0; i<n; i++)
#define loop(i, j, n) for(lli i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
con... | 1 | 88,945,970 |
#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 A, B, C;
cin >> A >> B >> C;
int mx = max({A, B, C});
int ans = A + B + C + 9 * mx;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define all(a) (a).begin(),(a).end()
#define x first
#de... | 1 | 92,057,342 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; i++)
static const long long INF = 1000000;
using p = pair<int,int>;
int main(){
int k,x;
cin >> k >> x;
if (500*k >= x) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int k, x;
cin >> k >> x;
if (500 * k >= x) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 26,562,293 |
#include <iostream>
#include <cmath>
using namespace std;
int main(void){
long long int N, M;
cin >> N >> M;
if(N == 1)
cout << abs(M-2) << endl;
else if(M == 1)
cout << N-2 << endl;
else{
long long int lap = 2*N + 2*M - 4;
long long int sum = N*M;
cout << sum - lap << endl;
}
return 0... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
ll n,m;
cin >> n >> m;
cout << abs((n-2)*(m-2)) << endl;
} | 1 | 80,904,742 |
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <bitset>
using namespace std;
using ll = long long;
constexpr ll INF = 1010000000000000017LL;
constexpr ll mod = 1000000007;
#define rep(i, n) for(l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.14159265358979
#define EPS 1e-8
#define mod 998244353
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define endl "\n"
#define NEG_INF -2e18
const ll INF=1e15;
const int N=2e5+50;
int main()
{
ios_base::syn... | 1 | 43,526,795 |
#include<bits/stdc++.h>
#define fi first
#define se second
typedef long long ll;
using namespace std;
class shortest_path{
public:
explicit shortest_path(int n):vertex(n),INF(0){}
shortest_path(int n,ll inf):vertex(n),INF(inf){
v2.resize(static_cast<unsigned long>(vertex));
for(int i=0;i<vertex;... | #include<bits/stdc++.h>
using namespace std;
#define INF 5000000000
#define INF2 2000000000
using ll=long long;
int main()
{
ll V,E;cin >> V >>E;
vector<vector<ll>> dis(V,vector<ll> (V,INF));
ll u,v,d;
for (ll i=0;i<E;i++)
{
cin >> u >> v >> d;
dis[u][v]=d;
}
bool can=true;
... | 1 | 32,524,696 |
#include<bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;
typedef pair< int, P > iP;
typedef pair< P, P > PP;
static const int INF = INT_MAX;
static const LL LINF ... | #include<bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
ll n,k;
char s[20];
cin >> n >> s >> k;
k--;
for(int i=0;i<n;i++){
if(s[i]!=s[k])s[i]='*';
}
cout << s;
} | 1 | 61,491,458 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | #include <bits/stdc++.h>
#define int long long int
#define main signed main()
#define bye return 0
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define each(p, v) for (auto p = (v).begin(); p != (v).end(); p++)
#define all(v) (v).begin(), (v).end()
#define prec(n) fixed << setpr... | 1 | 13,753,310 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define MOD 1000000007
#define Rep0(i, n) for (auto i=0; i<n; i++)
#define Rep1(i, n) for (auto i=1; i<=n; i++)
#define Sort(P) sort(P.begin(), P.end())
#define Rev(P) reverse(P.begin(), P.end())
int ma... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
typedef long long ll;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n)
{
cin >> a[i];
}
bool flag = true;
ll ans = 0;
while (flag)
{
... | 1 | 63,489,308 |
#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 <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ar array
#define db do... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define rep(i,a,n) for(int i=a ; i<n ; i++)
#define pb push_back
ll p=1e9+7 ;
int main()
{
ll n,k ;
cin>>n>>k ;
ll lim ;
ll dp[k+1] ;
ll fake[k+1] ;
memset(dp,0,sizeof(dp)) ;
dp[0]=1 ;
rep(i,0,n)
{
memset(fake,0,sizeof(fake)) ;
cin>>lim ;... | 1 | 79,327,300 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
string s;
cin >> s;
string ans;
rep(i, s.size()){
if (i % 2 == 0){
ans.push_back(s[i]);
}
}
cout << ans << endl;
return 0;
} | 1 | 5,516,462 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const ll mod = 1e9+7;
#define flash ios_base::sync_with_stdio(false);cin.tie(0);
typedef pair<int, int > pii;
const int INF = 1e9+5;
int main(){
int n;
cin >> n;
ll a[n];
for(ll i = 0; i < n; i++){
cin >> a[i];
}
ll sum = 0, mx = 0;... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
long long int ans = 0;
cin >> n;
vector<int>step(n);
for(int i = 0; i < n; i++){
cin >> step[i];
}
int max_step = step[0];
for(int i = 0; i < n; i++){
if(max_step > step[i]){
... | 1 | 83,919,928 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
#define pi 3.14159265358979
int main()
{
int n, ans = 0;
cin >> n;
for(int i = 1; i < n+1; i++)
{
if ... | 1 | 82,639,326 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll MOD=1000000007;
ll abs1(ll a){
if(a>=0)return a;
else return -a;
}
ll pow1(ll a,ll b){
ll p=1;
for(int i=0;i<b;i++){
p*=a;
}
return p;
}
int digit(ll a,ll b){
int i=0;
while(a!=0){
a/=b;
i++;
}
... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,... | 1 | 64,767,271 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using P = pair<int,int>;
void Yes() {
cout << "Yes" << endl;
}
void No() {
cout << "No" << endl;
}
int main(void) {
char x, y; cin >> x >> y;
char ans;
if(x > y) ans = '>';
else if(x < y) ... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <set>
#include <bitset>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)... | 1 | 15,851,325 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | #include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<deque>
#include<queue>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int ... | 1 | 28,217,839 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
char b;
cin >> b;
switch (b)
{
case 'A':
cout << "T" << endl;
break;
case 'T':
cout << "A" ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 1 | 61,245,807 |
#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;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | # include <bits/stdc++.h>
# define sz(x) (int)((x).size())
# define F first
# define S second
# define pb push_back
# define ub upper_bound
# define lb lower_bound
# define all(x) x.begin(), x.end()
# define pqueue priority_queue
# define mset multiset
# define umap unordered_map
# define Speed() ios_base::sync_with_st... | 1 | 35,119,891 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main () {
int n; cin >> n;
string s1, s2; cin >> s1 >> s2;
for (int i = 0; i < n; i++)
if (s1[i] == s2[0]) {
bool g = 1;
for (int j = i + 1, k = 1; j < n; j++, k++)
if(s1[j] != s2[k])
g = 0;... | 1 | 26,278,597 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<(n); i++)
#define int long long
#define mod 1000000007
#define F first
#define S second
#define P pair<long long,long long>
#define all(a) a.begin(),a.end()
#define INF 1000000000000000000
using namespace std;
signed main(void){
int n,k;cin>>n>>k;
v... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | 1 | 85,007,453 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
int N;
cin >> N;
vec<ll> A(N);
rep(i, N) cin >> A[i];
map<ll,int> mp;
ll now = 0;
l... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
int main(){
int n;
cin >> n;
ll now = 0LL;
map<ll,int> m;
m[0]++;
rep(i,n){
ll tmp;
cin >> tmp;
now ... | 1 | 49,498,030 |
#include<bits/stdc++.h>
#define lg long long int
#define loop(i,s,e) for(lg i=s;i<=e;i++)
#define iloop(i,s,e) for(lg i=e;i>=s;i--)
#define pb push_back
#define mp make_pair
#define mod 1000000007
using namespace std;
lg min(lg a,lg b)
{return a<b?a:b;}
lg max(lg a,lg b)
{return a>b?a:b;}
lg lcm(lg a ,lg b)
{
retur... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 1 | 56,600,469 |
#include<iostream>
using namespace std;
int main(){
int d, t, s;
cin>>d>>t>>s;
if((s*t)>=d) cout<<"Yes";
else cout<<"No";
} | #include<iostream>
int main(){
double D = 0;
int T = 0;
double S = 0;
std::cin >> D >> T >> S;
if (D/S <= T){
std::cout << "Yes" << std::endl;
}
else{
std::cout << "No" << std::endl;
}
return 0;
} | 1 | 75,294,261 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll mod=1e9+7;
vector<vector<ll>> gr(1e5+2);
vector<vector<ll>> dp(1e5+2,vector<ll>(2,-1));
ll solve(int node,bool x,int p)
{
if(dp[node][x]!=-1)
return dp[node][x];
ll ans=1,ans2=1;
if(gr[node].size()==1&&p==gr[node][0])
return dp[node][x]=(x==0... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int Nmax = 1e5 + 5;
const int mod = 1e9 + 7;
vector <int> adj[Nmax];
int n;
int dp[Nmax][2];
void add(int &a, int b)
{
a += b;
if (a >= mod) a -= mod;
}
void mul(int &a, int b)
{
a *= b;
if (a >= mod) a %= mod;
}
int solve(int u, ... | 1 | 1,268,002 |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int dx = x2 - x1, dy = y2 - y1;
cout << x2 - dy << " " << y2 + dx << " " << x1 - dy << " " << y1 + dx;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int x1,y1,x2,y2;
int tx,ty,tmp;
int x3,y3,x4,y4;
cin >> x1 >> y1 >> x2 >> y2;
tx = x1 - x2;
ty = y1 - y2;
tmp = tx;
tx = ty;
ty = -tmp;
x3 = tx + x2;
y3 = ty + y2;
tx = x2 - x3;
ty = y2 - y3;
tmp = tx;... | 1 | 82,586,220 |
#include <bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
typedef long long ll;
int main()
{
int X,A;cin>>X>>A;
if (X<A) cout<<0<<endl;
else cout<<10<<endl;
} | using namespace std;
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#i... | 1 | 15,242,096 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i,n) for(int i = 0; i < n; i++)
#define invrep(i,n) for(int i = n; i > 0; i--)
double dist (int i, int j, vector<int> x, vector<int> y) {
return pow(pow((x[i] - x[j]), 2) + pow((y[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P, Q;
int P_num = 0, Q_num = 0;
for (int i = 0; i < N; i++) {
int p;cin >> p;
P.push_back(p);
P_num = P_num * 10 + p;
}
for (int i = 0; i < N; i++) {
int q;cin >> q;
... | 1 | 21,933,024 |
#include <iostream>
using namespace std;
int main (){
int H,W;
while(true){
cin >> H >>W;
if(H==0 &&W==0) break;
for(int i = 0;i<H;++i){
if(i==0 || i==H-1){
for(int j=0;j<W;++j){
cout <<"#";
};
}
else {
cout<<"#";
for(int k=1;k<W-1;++k){
cout <<".";
};
cout<<"#";
}
... | #include<iostream>
using namespace std;
int main(){
int H,W;
while(cin >> H>> W,H+W!=0){
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(i==0 || i==H-1 || j==0 || j==W-1)
cout<<'#';
else
cout<<'.';
}
cout<<endl;
}
cout<<endl;
}
return 0;
} | 1 | 6,127,616 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | #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... | 1 | 13,238,873 |
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define TABLE_SIZE 16777216
#define ORDER_LENGTH 7
#define STR_LENGTH 13
using namespace std;
int translateChar(char ch){
int ret;
switch(ch){
case 'A':
ret = 1;
break;
case 'C':
ret = 2;
break;
case 'G':
ret = 3;
break;
ca... | #include<iostream>
#include<string>
#include<cstring>
using namespace std;
string S,R;
char T[5]="ACGT";
int U,a,q;
int power[12]={1,4,16,64,256,1024,4096,16384,65536,262144,1048576,4194304};
bool V;
bool x1[4];
bool x2[16];
bool x3[64];
bool x4[256];
bool x5[1024];
bool x6[4096];
bool x7[16384];
bool x8[65536];
bool x... | 1 | 29,511,811 |
#include<iostream>
using namespace std;
int main()
{
int a,b,c,d=0,f;
while(cin>>a>>b>>c)
{
for(int i=a;i<=b;i++)
{
f=c%i;
if(f==0)
d++;
}
cout<<d<<endl;
}
} | #include <iostream>
using namespace std;
int main(void)
{
int a,b,c,k,n;
cin >> a >> b >> c;
n=0;
for(k=a;k<=b;k++){
if(c%k == 0)
n=n+1;
}
cout << n << endl;
return 0;
} | 1 | 71,059,141 |
#include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
string S;
cin >> S;
vector<int> count(2,0);
for(int j : {0, 1}){
int target = j;
for(int i=0; i<S.size(); i++){
int val = S[i] - '0';
if(target == val){
co... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S; cin >> S;
int black=0;
int white=0;
string S_c = S;
for(int i=0;i<S_c.length(); i++){
if(i==0){
if( S_c.at(i)=='0'){
S_c.at(i) = '1'; black++;
}
}else if(S_c.at(i-1)=='0' && S_... | 1 | 62,565,940 |
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
string s;
cin >> s;
int n = s.size()+1;
vector<int> right(n,0);
vector<int> left(n,0);
int count=0;
rep(i,n-1){
if(s.at(i)=='<')count++;
else count=0;
... | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
typedef long long int ll;
string S;
int main()
{
ll i;
ll sum=0;
ll len, cl;
ll last;
cin >> S;
len = S.size();
last = 0;
for (i=0; i<len; ) {
cl=0;
switch(S[i]) {
case '<':
while (S[i] == '<' && i<len) {cl++; ... | 1 | 13,932,666 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mtv(kit) cout<<#kit<<" - "<<kit<<"\n";
#define ff first
#define ss second
#define pb push_back
#define rep(i,a,b) for(i=a;i<b;i++)
#define pii pair<ll , ll>
#define all(x) x.begin(),x.end()
#define nl "\n"
#define ump unordered_map
void doit(){
... | #include <iostream>
using namespace std;
typedef long long ll;
int main()
{
int n;
string s;
cin>>n>>s;
for(int i=0; i<s.size(); i++)
{
if(s[i]==s[i-1]) n--;
}
cout<<n;
return 0;
} | 1 | 73,469,189 |
#pragma once
#pragma once
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<math.h>
#include <iomanip>
#define rep(i,n) for(auto i=0;i<(n);i++)
#define all(vs) (vs).begin(),(vs).end()
#define roundup(A,B) (A)/(B)+((A)%(B)==0?0:1)
#define read(type,name) type name;cin>>name
us... | #include<iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(){
int N, A, B_prev, B;
long long ans = 0;
std::cin >> N;
vector<int> Bs(N);
for(int i = 0; i < N-1; i++){
std::cin >> B;
if(i == 0){
ans = ans + B;
}else{
ans = ans + mi... | 1 | 81,169,436 |
#include <iostream>
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <map>
#include <queue>
#include <string>
using namespace std;
int n,s,m[10];
int f(int n,int s,int m){
if(n==1){
if(s<m)return 1;
else return 0;
}
int t=0;
for(int i=0;i<=s&&i<m;i++)t+=f(n-1,s-i,i);
return t... | #include<iostream>
using namespace std;
int cnt, n, s;
bool used[10];
void rec(int pos, int t, int sum ){
if ( t == n ){
if ( sum == s ) cnt++;
return;
}
if ( pos > 9 ) return;
rec(pos+1, t, sum);
rec(pos+1, t+1, sum + pos);
}
main(){
while( cin >> n >> s ){
if ( n == 0 && s == 0 ) break;
... | 1 | 50,656,599 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b)... | 1 | 73,742,948 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, A, B;
cin >> K >> A >> B;
if(A%K != 0) {
if(B >= (A/K+1)*K) cout << "OK" << endl;
else cout << "NG" << endl;
}
else cout << "OK" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int k, a, b;
cin >> k >> a >> b;
int x = (a - 1) / k;
int y = b / k;
cout << (y - x > 0 ? "OK" : "NG") << '\n';
return (0);
} | 1 | 62,669,982 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const ll INF = 1e16;
void solver(int N, int P, vector<int> &A, ull &ans){
int even{};
for(int i = 0; i != N; ++i){
if(A.at(i)%2 == 0){
++even;
}
}
ull... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | 1 | 70,398,487 |
#include<iostream>
typedef float f;f a,b,c,d,h,i,e,g;f r(f k,f l,f m,f n){m-=k;n-=l;k=e-k;l=g-l;return m*l-n*k?m*l-n*k>0?1:-1:0;}int main(){for(;!(std::cin>>a>>b>>c>>d>>h>>i>>e>>g).eof();)puts(r(a,b,c,d)==r(c,d,h,i)&&r(a,b,c,d)==r(h,i,a,b)?"YES":"NO");} | #include <iostream>
#include <vector>
#include <float.h>
using namespace std;
struct Point
{
Point() :x(0.0), y(0.0) {}
Point(double _x, double _y) : x(_x), y(_y) {}
double x;
double y;
};
bool HalfPlaneTest(const Point& P1, const Point& P2, const Point& P)
{
return ((P2.y - P1.y) * P.x - (P2.x - P1.x) * P.y + (P2... | 1 | 99,419,495 |
#include <stdio.h>
int main ( )
{
int x,y;
scanf("%d %d",&x,&y);
if(x>=-1000 && y<=1000 && y>=-1000 && y<=1000)
{
if(x<y)
{
printf("a < b\n");
}
if(x>y)
{
printf("a > b\n");
}
if(x==y)
{
printf("a == b\n");
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
string s;
if (a > b){
s = "a > b";
} else if (a < b){
s = "a < b";
} else {
s = "a == b";
}
cout << s << endl;
} | 1 | 29,526,001 |
#include <iostream>
#include <string>
using namespace std;
int wa(string inp);
int main(void)
{
string inp1;
getline(cin, inp1);
while(inp1[0] - '0'){
cout << wa(inp1) << endl;
getline(cin, inp1);
}
return 0;
}
int wa(string inp)
{
int len = inp.size();
int wa = 0;
for(int i = 0; i < len; i++){
... | #include<iostream>
using namespace std;
int main(void) {
char num[1000][1010];
int jump;
int outnum[100] = {};
for (int i = 1; i <= 2000; i++) {
cin >> num[i];
if (num[i][0] == '0') {
jump = i;
break;
}
}
for (int t = 1; t < jump; t++) {
for (int u = 0; u <= 2000; u++) {
if (num[t][u] == '\0') {
... | 1 | 100,535,383 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
using namespace std;
typedef long long int ll;
int main(){
int n; cin >> n;
vector<ll> a(n),b(n);
ll mi=1e9;
ll sum=0;
for(int i=0;i<n;i++){
cin >> a[i] >> b[i];
if(a[i]>b[i])mi=min(mi,b[i]);
sum+=a[i];
... | #include<bits/stdc++.h>
#define taskname "A"
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
const int maxn = 5e5 + 5;
multiset<int,greater<int>> s[maxn];
int n , a[maxn];
int main(){
if(fopen(taskname".INP","r")){
freope... | 1 | 78,184,496 |
#include <cstdio>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define all(a) (a).begin(), (a).end()
template<class T> inlin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int N;
vector<ll> a,s;
void dfs(ll p, ll x) {
if(x != 0)
s.push_back(x);
if(p == N)
return;
dfs(p+1, x+a.at(p));
if(x == 0)
dfs(p+1, 0);
}
int main() {
ll K,r=0;
cin >> N >> K;
a.resize(N);
r... | 1 | 34,947,533 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | #include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <cassert>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
vector<ll> d... | 1 | 21,914,940 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
in... | 1 | 56,958,866 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
long long sum=0;
for(int i=0;i<s.length();i++) sum+=int(s[i])-48;
(sum%9==0)?cout<<"Yes":cout<<"No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
char N[200010];
cin >> N;
int n = strlen(N);
int sum = 0;
for(int i = 0; i<n; i++){
sum += N[i] - '0';
}
sum %= 9;
if(sum == 0) cout << "Yes" << endl;
if(sum != 0) cout << "No" << endl;
} | 1 | 10,924,714 |
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
static const int NMAX = 1000003;
char D[NMAX][13];
int h1(long long x) {
return x % NMAX;
}
int h2(long long x) {
return 1 + (x % (NMAX - 1));
}
long long convert(char c[]) {
long long cc = 0;
for (unsigned int i = 0; i < strlen(c); i+... | #include <cstdio>
#include <string.h>
#include <vector>
using namespace std;
namespace {
class Dictionary {
private:
struct Node {
Node* children[4];
char flags[4];
Node() {
children[0] = NULL;
children[1] = NULL;
children[2] = NULL;
children[3] = NULL;
flags[0] = 0;
f... | 1 | 7,199,076 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <complex>
#include <tuple>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <random>
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using n... | 1 | 64,589,557 |
#include <iostream>
int N;
void solve() {
std::cin >> N;
std::cout << (1+N)*(N)/2 << std::endl;
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int,int>;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i=1; i<=n; ++i) {
ans += i;
}
cout << ans << endl;
return 0;
} | 1 | 1,681,652 |
#include <iostream>
using namespace std;
int main() {
long N, A, B;
cin >> N;
cin >> A;
cin >> B;
cout << N / (A + B) * A + min(N % (A + B), A);
return 0;
} | #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){
ll n, a, b;
cin >> n >> a >> b;
ll d = n / (a + b);
ll ans = d * a + min(n - (d * (a + b)), a);
cout << ans << endl;
return 0;
} | 1 | 88,901,512 |
#include<iostream>
#include<cstdlib>
#include<cmath>
using namespace std;
int main(){
int N; cin>>N;
int L=0;
int Ans=0;
for(int i=1; i<N+1; i+=2){
for(int j=1; j<i+1; j++){
if(i%j==0)
L++;
else continue;
}
if(L==8)
Ans++;
L=0;
}
cout<<Ans<<endl;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
ll solve(ll n){
ll ans=0;
reps(i,n+1){
if(n%i==0)ans++;
}
return ans;
}
int main()
{
ll n,ans=0;;
cin>>n;
if(n<105){
cout<<0<<endl;
retu... | 1 | 98,204,966 |
#include <bits/stdc++.h>
#include <string.h>
#include <vector>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
#define MOD 1000000007
#define acc... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec_input(v) for(auto it=v.begin();it!=v.end();it++){cin>>*it;}
#define vec_output(v) for(auto it=v.begin();it!=v.end();it++){if(it!=v.begin())cout<<" ";cout<<*it;... | 1 | 27,533,748 |
#include<bits/stdc++.h>
using namespace std;
int x,t;
int main()
{
cin>>x>>t;
cout<<((x-t>0)?(x-t):0);
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int X, t;
cin >> X >> t;
cout << max(X-t, 0) << "\n";
return 0;
} | 1 | 61,402,867 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main()
{
ll n; cin>>n;
ll d= n*n;
cout<<d<<endl;
return 0;
} | 1 | 3,292,940 |
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int calc(int y,int m,int d){
int cnt=0;
for(int i=1;i<y;i++){
cnt+=(i%3)?195:200;
}
for(int i=1;i<m;i++){
if(y%3!=0&&i%2==0)cnt+=19;
else cnt+=20;
}
cnt+=d;
return cnt;
}
int main(){
int n;... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
int n;
cin >> n;
typedef struct{
int y;
int m;
int d;
}ymd;
vector<ymd> birth(n);
for(int i=0; i<n; i++){
cin >> birth[i].y >> birth[i].m >> birth[i].d;
}
for(int i=0; i<n; i++){
int day=0;
int y = birth[i].y;
int m = birth... | 1 | 24,334,386 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
class DAG {
private:
ll v, e;
vector<vector<ll>> table;
vector<ll> in_d;
vector<ll> head;
public:
DAG(ll v) : v(v) {
table.resize(v);
in_d.resize(v);
e = 0;... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int V, E;
cin >> V >> E;
vector<vector<int> > edge(10001);
vector<int> state(V, 0);
for (int i = 0; i < E; i++) {
int s, t;
cin >> s >> t;
edge[s].push_back(t);
state[t]++;
}
vector<int> ans;... | 1 | 32,978,460 |
#include <iostream>
#include <vector>
int main(){
int H, W;
std::cin >> H >> W;
std::vector<std::vector<char>> C(H, std::vector<char> (W));
std::vector<std::vector<char>> Cout(2*H, std::vector<char> (W));
for (int i=0; i<H; i++){
for (int j=0; j<W; j++){
std::cin >> C.at(i).at(j);
}
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int H,W;
cin >> H >> W;
char S[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin >> S[i][j];
}
}
for(int i=0;i<H;i++){
for(int k=0;k<2;k++){
for(int j=0;j<W;j++){
if... | 1 | 35,861,692 |
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever while (true)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
template<ty... | #include <iostream>
#define ALPHABET 26
int main(){
char c;
int n[ALPHABET]={};
while(std::cin>>c){
if('A'<=c&&c<='Z'){
c+=0x20;
}
if('a'<=c&&c<='z'){
n[c-0x61]++;
}
}
for(int i=0;i<ALPHABET;i++){
std::cout<<char('a'+i)<<" : "<<n[i]<<std::endl;
}
} | 1 | 80,817,317 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,sum=0;
cin >> A >> B >> C;
bool a=false;
for(int i=A;i<B*A+1;i+=A){
sum+=A;
if(sum%B==C){
a=true;
break;
}
}
if(a){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 1 | 19,616,261 |
#include<bits/stdc++.h>
typedef long long int lli;
typedef long double lld;
typedef long long ll;
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define vvlli vector<vector<long long int>>
#define ppi pair<int, int>
#define rppi pair<int, pair<int, int>>
#define lppi pair<pair... | #include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define ... | 1 | 13,763,092 |
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
ll N, K, S, T, ans{};
cin >> N >> K;
vector<int> A(N);
ll P = K * (K+1) / 2 % MOD;
ll Q = K * (K-1) / 2 % MOD;
for (int &a: A) cin >> a;
for (int i = 0; i != N; ++i) {
S = T = 0;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n,k,ans = 0,i,j,b = 0;cin >> n >> k;
long long a[n];
for(i=0;i<n;i++) cin >> a[i];
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
if(a[i]==a[j]) continue;
if(a[i]>a[j]) ans = (ans+(k+1)*k/2)%1000000007;
else ans = (ans+(k-1)*k/2)%... | 1 | 64,221,827 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string a;
cin >> a;
a[5] = ' ';
a[13] = ' ';
cout << a << endl;
} | #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;
string s;
int main(... | 1 | 37,481,177 |
#include <iostream>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main()
{
int h,w;
while(cin >> h >> w)
{
if(h == 0 && w == 0) break;
rep(i,h)
{
rep(j,w)
{
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <sstream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int h, w;
while (1)
{
cin >> w >> h;
if (h == 0 && w == 0) break;
for (int i = 0; i < w; ... | 1 | 70,988,335 |
#include "bits/stdc++.h"
#define rep(i,b) for(ll i=0;i<b;i++)
#define ll long long
using namespace std;
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvvl vector<vector<vector<ll>>>
#define debug(x) cerr<<#x<<" "<<x<<'\n';
int cnt[200003],n,k;
long long ans;
map<int,int>mp;
int main(void) {
cin>>n>>k... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
int n, k;cin >> n >> k;
vector<ll> v(n), ruiseki;
ruiseki.push_back(0);
for(int i = 0;i < n;i++){
cin >> v[i];
ruiseki.push_back(ruiseki.back() + v[i]);
}
ll ans = 0;
map<ll, int> mp;
for(int... | 1 | 11,526,867 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int d[26] = { 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 };
while( true ) {
string in;
cin >> in;
if ( in == "#" ) break;
long long int h = d[ in[0] - 'a' ];
long long int ans = 0;
for (... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typ... | 1 | 5,274,734 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum;
cin >> N;
sum = 0;
for(int i = 1; i <= N; i*=10) {
sum += N / i - N / (i * 10) * 10;
}
if(N % sum == 0) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 15,222,626 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()... | 1 | 76,127,715 |
#include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<deque>
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll LLINF = 1001001001001001001;
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll coun = 0;
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
string S, T;
int main() {
cin >> S >> T;
vector<string> v;
for (int i = 0; i < S.size(); i++) {
bool jud... | 1 | 29,426,088 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <bitset>
using namespace std;
typedef long long int lli;
int main(void)
{
lli X, Y;
cin >> X >> Y;
if (X % Y == 0)
{
cout << -1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int x,y;
cin >> x >> y;
if(x%y==0)cout << -1 << endl;
else cout << x << endl;
} | 1 | 32,633,447 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <unordered_map>
#include <array>
#include <fstream>
#include <cassert>
#include <cmath>
#inclu... | #include <bits/stdc++.h>
#define forn(i, n) for (llong i = 0ll; i < (llong) n; ++i)
#define fornn(i, l, r) for (llong i = (llong) l; i < (llong) r; ++i)
#define size(x) ((int) (x.size()))
using namespace std;
typedef long long llong;
const llong inf = (llong) 1e+9 + 7ll;
const llong linf = (llong) 1e+18 + 7ll;
const lo... | 1 | 23,396,891 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k; cin >> a >> b >> k;
long long num = min(k, a);
a -= num; k -= num;
b -= min(k, b);
cout << a << " " << b << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int A, B, K;
cin >> A >> B >> K;
long long int a, b;
if(K <= A) {
cout << A - K << " " << B << endl;
} else if(K <= A + B) {
cout << 0 << " " << B - K + A << endl;
} else {
cout << 0 << " " << 0 << endl;... | 1 | 86,400,698 |
#include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int k, a, b; cin >> k >> a >> b;
if (b-a <= 2) {
cout << k+1 << endl;
return 0;
}
Int ans = 1;
for (int i = 0; i < k; i++) {
if (ans >= (Int)... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
lon... | 1 | 65,139,146 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int m;
const int maxn=2e5+7;
ll a[maxn],b[maxn];
int main()
{
scanf("%d",&m);ll ans=0;ll sum=0;ll c=0;
for(int i=1;i<=m;i++)
{
scanf("%lld%lld",&a[i],&b[i]);
sum+=a[i]*b[i];c+=b[i];
}
cout<<(c-1)+((sum-1)/9)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = (int)2e5 + 9;
ll d[N]... | 1 | 32,475,622 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T> inline bool chmin(T& a, T b) {
if (a... | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
int mai... | 1 | 41,130,868 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int N,A=0;
cin >> N;
int a = log10(N);
for(int i=0; i<=a; i++){
int b = N / pow (10, a-i);
A = A + b % 10;
}
if (N % A == 0){
cout << "Yes" << endl;
}
else {
cout << "No" << 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>
#include <cctype>
#in... | 1 | 34,388,328 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <iostream>
using namespace std;
int main(){
int n,i,p,m=1e6,cnt=0;
cin >> n;
for(i=0;i<n;++i){
cin >> p;
if(p<=m) ++cnt;
m = min(m,p);
}
cout << cnt << endl;
return 0;
} | 1 | 77,728,117 |
#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 <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii = pair<int,int>;
... | 1 | 84,619,311 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, const char * argv[]) {
int a,b,c,d;
double e;
cin >> a >> b;
c = a/b;
d =a%b;
e= 1.0*a/b;
printf("%d",c);
printf(" ");
printf("%d",d);
printf(" ");
printf("%.8lf\n",e);
return 0;
} | #include<iostream>
#include <iomanip>
#include <cstdio>
using namespace std;
int main(){
double a,b;
cin >> a >> b;
cout << (int)a/(int)b <<" "<< (int)a%(int)b<<" ";
printf("%.5f\n",a/b);
return 0;
} | 1 | 46,632,851 |
#include<bits/stdc++.h>
using namespace std;
const int INF = (1<<30);
int main()
{
int n;
while( cin >> n, n ) {
int ma = 0, mi = INF, sum = 0, data;
for(int i=0; i<n; i++) {
cin >> data;
sum += data;
if( data > ma ) ma = data;
if( data < mi ) mi = data;
}
sum = sum - ma - mi... | #include<stdio.h>
void sort(int p[],int n);
void sort(int p[],int n)
{
int i,j,temp;
for (i = 0; i < n - 1; i++) {
for (j = n - 1; j > i; j--) {
if (p[j-1] > p[j]) {
temp = p[j];
p[j] = p[j-1];
p[j-1] = temp;
}
}
}
}
in... | 1 | 12,688,457 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include <iostream>
#include <algorithm>
#include <numeric>
#include <list>
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
using namespace std;
typedef long long ll;
int main() {
int n,k;
cin >> n>> k;
int hs[n];
for (int i=0;i<n; i++){
cin >> hs[i];
}
if (k >= n) cout << ... | 1 | 9,001,136 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string x;
cin >> x;
int ret = 2000;
for (int i = 0; i <= x.size()-2; i++) {
int tmp = stoi(x.substr(i,3));
ret = min(abs(tmp-753), ret);
}
cout << ret << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
int size = s.size();
int64_t sint = stoll(s);
int64_t tenpros = 10;
for(int i = 0; i < size - 4; i++) {
tenpros *= 10;
}
vector<int> spartint(size - 2);
for(int i = 0; i < size-2; i++) {
spartint.at(i) = sint / tenpros... | 1 | 32,909,527 |
#include <bits/stdc++.h>
using namespace std;
using ll = 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 MOD 1000000007
int main(void) {
int x;
cin >> x;
if(x >= 1200)
cout << "ARC" << endl;
else
cout << "ABC" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
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... | 1 | 5,405,774 |
#include<cstdio>
#include<cstring>
int main(){
char word[380][33];
int count[380] = {};
int now = 0;
int max = 0;
int a, b = 0;
char s[33];
while(scanf("%s", &s) + 1){
int t = 0;
while(s[t]){
if('A' <= s[t] && s[t] <= 'Z'){
s[t] = s[t] + 'a' - 'A';
}
t++;
}
bool flug = true;
for(int i = 0;... | #include <iostream>
#include <string>
#include <algorithm>
#include <map>
using namespace std;
int main()
{
string s[1001],len_max,ans;
map<string,int> count;
int i = 0,count_max = 1;
while(cin >> s[i])
{
if(len_max.size() < s[i].size())
{
len_max = s[i];
};
count[s[i]]++;
if(count[s[i]] > count_max... | 1 | 65,372,235 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
#define all(x) (x).begin(),(x).end()
#define re... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
Graph G(N);
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
a--;
G[i].push_back(a);
}
vector<int> dist(... | 1 | 5,457,135 |
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; ++i)
cin >> a[i];
sort(a.begin(), a.end());
int m1 = n/2-1;
int m2 = n/2;
cout << a[m2]-a[m1];
return 0;
} | 1 | 56,218,417 |
#include <bits/stdc++.h>
using namespace std;
char var[110];
int main(){
int a,b;
scanf("%d%d",&a,&b);
for(int i=0;i<b;i++)
var[i]='0'+a;
string L=var;
for(int i=0;i<a;i++)
var[i]='0'+b;
var[a]=0;
string R=var;
printf("%s\n",min(L,R).c_str());
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 1 | 53,495,356 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a, b, c;
cin >> a >> b >> c ;
if( b >= c ){
cout << "delicious" << endl;
} else if ( b < c && c <= a + b){
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;
} | #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;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
... | 1 | 18,932,247 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X;
int A;
cin>>X>>A;
puts(X < A ? "0" : "10");
return 0;
} | 1 | 97,735,402 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> vec(N);
for (int i=0; i<N; i++){
cin>>vec.at(i);
}
int M;
cin>>M;
vector<string> vec2(M);
for(int i =0; i<M; i++){
cin>>vec2.at(i);
}
int x=0;
for(int i=0; i<N; i++){
int y=0;
for(int j=0... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, m;
cin >> n;
unordered_map<string, int> um;
int res... | 1 | 87,628,580 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >>n>>m;
int a[n][n];
int b[m][m];
string s;
for(int i=0;i<n;i++){
cin>>s;
for(int j=0;j<n;j++){
if(s[j]=='.')a[i][j]=0;
else a[i][j]=1;
}
}
for(int i=0;i<m;i++){
cin>>s;
for(int j=0;j<m;j++){
if... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | 1 | 40,790,667 |
#include <iostream>
#include<string>
#include <math.h>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int n, ans;
cin >> n;
cout << ((n%2==0) ? (n/2)-1:floor(n/2)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ar array
#define sz(a) (int) a.size()
#define fi first
#define se second
#define all(s) s.begin(), s.end()
#define vi vector<int>
#define pb push_back
#define eb emplace_back
#define ii pair<int, int>
#define bit(x... | 1 | 6,855,087 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.