code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
string t; cin >> t;
string s = "";
while ((int)s.size() < 2 * n)
s += "110";
long long res = 0;
if (s.find(t) != string::npos) {
if (t == "1") res = 2e10;
else if (t == "11") res = 1e10;
else {
int k = 0;
for (int i = 0; i ... | #include<iostream>
#include<vector>
#include<algorithm>
#define rep(i,n) for(int i=0; i<(int)n; i++)
using namespace std;
int main(){
int n;
cin >> n;
int count = 0;
while(true){
if(n-1 >= 1){
count++;
n--;
}
else
break;
}
cout << count << endl;
return 0;... |
#include <cstdio>
int main()
{
int A, B, C;
scanf("%d%d%d", &A, &B, &C);
if(C==0)
{
if(A>B)
{
printf("Takahashi\n");
}
else
printf("Aoki\n");
}
else
{
if(B>A)
printf("Aoki\n");
else
printf("Takahashi\n");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string slot;
getline(cin,slot);
int flag=0;
for(unsigned int i=1;i<slot.length();i++){
if(slot[i]!=slot[i-1]){
flag=1;
break;
}
}
flag==0?cout<<"Won":cout<<"Lost";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 20;
mt19937 mt;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
mt.seed(time(nullptr));
int n, m;
cin >> n >> m;
vector<string> v(m);
for (auto& i : v) {
cin >> i;
}
//sort(... | #include <bits/stdc++.h>
using namespace std;
constexpr char LF = '\n';
template <typename T = int>
constexpr T INF()
{
return numeric_limits<T>::max();
}
template <typename InputIterator>
void print(InputIterator first, InputIterator last)
{
if (first != last) {
cout << *first;
for (auto p =... |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s;
cin >> s;
if ((s.at(0) == s.at(1)) && (s.at(1) == s.at(2)))
{
cout << "Won\n";
}
else
{
cout <<"Lost\n";
}
return 0;
} | #include <bits/stdc++.h>
#include<iostream>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lli unsigned long long int
#define forit(it, a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define fori(i,n) for(int j=i;j<n;j++)
#define pb push_back
#define ff first
#define ss second
#d... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for(int i... | #include<ctime>
#include<cstdio>
#include<cctype>
using namespace std;
int read(){
char c;
int x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while(isdigit(c)){
x=x*10+f*(c-48);
c=getchar();
}
return x;
}
int a,b;
int main(){
#ifndef ONLINE_JUDGE
freopen("A.in","r",stdin);
freopen("A.out","w",stdou... |
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<sstream>
#include<cstring>
#include<cstdio>
#include<string>
#include<deque>
#include<cmath>
#include<queue>
#include<set>
#include<map>
using namespace std;
int a, b;
int aBoard[1010];
int bBoard[1010];
int main(void)
{
scanf("%d%d", &a, &b);
if ... | #include<bits/stdc++.h>
using namespace std;
typedef int ll;
#define F first
#define S second
#define pb(x) push_back(x)
//cout.flush()
ll q, n, k, a[200001], c[20], c1, c2;
string s;
int main(){
// ios_base::sync_with_stdio(0);
// cin.tie(0);
cin >> c1 >> c2;
c[1]=0;
c[2]=0;
if(c1>=c2){
f... |
#include<bits/stdc++.h>
// no of bits to store no 2e5 is 19
// 2e5 ka 5 times square root lene se 2 or 3 ke pass pahunch jate hai
using namespace std;
#define int long long
#define mod 1000000007
#define MOD 1000000007
#define MAX 1000000000
#define inf ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
if(x!=y && x+y==1)cout<<"2"<<endl;
else if(x!=y && x+y==3)cout<<"0"<<endl;
else if(x!=y && x+y==2)cout<<"1"<<endl;
else if(x==y)cout<<x<<endl;
return 0;
} |
#define ll long long
#define dd long double
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define fo(i , n) for(ll i = 0 ; i < n ; i++)
//#include<bits/stdc++.h>
#include<iomanip>
#include<cmath>
#include<cstdio>
#include<utility>
#... | #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... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
template <class T, class U>
inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; ... |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,a[101],b[101],k,c[16],d[16];
int ans,mark[101],tot;
signed main()
{
scanf("%d %d",&n,&m);
for(int i=0;i<m;i++)
scanf("%d %d",&a[i],&b[i]);
scanf("%d",&k);
for(int i=0;i<k;i++)
scanf("%d %d",&c[i],&d[i]);
for(int i=0;i<(1<<k);i+... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#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 per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) ... |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#define N 103
#define NN 128000
template <typename T> inline void read(T &x) {
x = 0; char c = getchar(); bool flag = false;
while (!isdigit(c)) { if (c == '-') flag = true; c = getchar(); }
while (isdigit(c)) { x = (x << 1) + (x << 3) + (... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int N, K, M, MAX = 50 * 51 * 100 / 2;
cin >> N >> K >> M;
long dp[N][MAX];
rep(i, N){
if(!i){
fill(dp[i], dp[i] + K + 1, 1);
fill(dp[i] + K + 1, dp[i] + MAX, 0);
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
const int maxN = 5005;
char a[maxN][maxN];
int dp[maxN][maxN];
int row[maxN][maxN], col[maxN][maxN];
int add(int x, int y) {return (x + y < mod ? x + y : x + y - mod);}
int mul(int x, int y) {return (1LL * x * y) % mod;}
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<complex>
#include<cstdio>
#define initdp(a,b) for(int i=0;i<=a;i++)for(int j=0;j<=b;j++)dp[i][j]=-1;
#define fi first
#define se second
#define pb push_back
#d... |
#ifdef LOGX
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
/*---------macro---------*/
#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 unless(x) if(!(x))
#define until(... | #include<bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long sum = 0;
for(int i = 1 ; i < 100000000 ; i++ ) {
sum += i;
if(sum >= n) {
cout << i << endl;
break;
}
}
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
ll ans = 0;
void Main(){
int n, m;
cin >> n >> m;
vector<int> a(m);
For(i,0,m) cin >> a[i];
a.push_back(0);
a.push_back(n+1);
m += 2;
sort(A... |
/**
* Coded by : lucky_21
* --------Lokesh Singh
**/
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_upd... |
#include <stdio.h>
#include <stdbool.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int a[n];
for (int i = 0; i < n; i++) a[i] = ri();
int b[n];
for (int i = 0; i < n; i++) b[i] = ri();
int res = 0;
for (int i = 1; i <= 1000; i++) {
bool ok = true;
for (int j = 0; j < n; ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int64_t n;
cin >> n;
int len = to_string(n).size();
int ans = 0;
if (len % 2 == 0) {
int n1 = n / pow(10, len / 2);
int n2 = n % (int64_t)pow(10, len / 2);
if (n1 > n2) a... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
int ans=0;
ans+=(7-a);
ans+=(7-b);
ans+=(7-c);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define cio ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define mod 1000000007
typedef long long ll;
//ll aa[6]={}
int main()
{
cio;
ll a,b,c;
cin>>a>>b>>c;
cout<<21-a-b-c<<endl;
}
|
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<set>
#include<map>
#include<iostream>
#include<bitset>
#include<stack>
const int inf = 0x3f3f3f3f;//1.06e9大小
const double PI = acos ( -1 );
const double eps = 1e-6;
typedef unsigned long long ull;
typedef long long ll;
#def... | #include <bits/stdc++.h>
#define fu(a, b, c) for (ll a = b; a <= c; ++a)
#define fd(a, b, c) for (ll a = b; a >= c; --a)
#define mx(a, b) a = max(a, b)
#define mn(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
const ll N = 2e5 + 1, M = 998244353;
ll t, n, m, k, a, b, c, ans;
ll x[N], y[N];
set<pair<ll, ... |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
const int mxn = 500000;
int n;
int a[mxn], b[mxn];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 0; i < n; ... | /*
author: Maksim1744
created: 14.11.2020 15:10:32
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a) (*mi... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1e18+7;
const lint inf=1e9+7;
cons... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x)... |
#include<bits/stdc++.h>
using namespace std;
/*Uzumaki Naruto
Mesut Ozil
Harry Potter*/
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
#define HarryPotter ios::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
#define MAX 100000000LL
#define mod 1000000007LL
#define ... | #include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int n, a[1000];
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a, a + n);
for(int i = 1; i <= n; i++){
if(i != a[i - 1]){
cout << "No" << endl;
break;
}
if(i == n){
cout << "Yes" << e... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define li long int
#define fi first
#define se second
#define ve vector<ll>
#define mp make_pair
#define pr pair<ll,ll>
#define rep(i,n) for(ll i=0;i<n;i++)
#define repji(j,i,n) for(ll j=i;j<n;j++)
#define rev(i,n) for(ll i=n;i>... | #include<iostream>
using namespace std;
int main()
{
int a1, a2, a3;
cin >> a1 >> a2 >> a3;
int aa = a1;
if (a2 > aa)aa = a2;
if (a3 > aa)aa = a3;
int ss = a1;
if (a2 < ss)ss = a2;
if (a3 < ss)ss = a3;
int dd = a1 + a2 + a3 - aa - ss;
if (aa - dd == dd - ss)cout << "Yes";
else cout << "No";
return 0;
} |
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <memory.h>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <iostream>
#include <functional>
#include <complex>
#include <stdlib.h>
#include <fstream>
#include <random>
#include ... | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#include <map>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define reps(i, s, n) for (int i = s; i < (int)(n); ++i)
#define print(x) cout << x << "\n"
#define ALL(v) v.begin(), v.end()
#... |
#include<stdio.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
static inline int Max(size_t a,size_t b){return a>b?(int)a:(int)b;}
static inline int Min(size_t a,size_t b){return a<b?(int)a:(int)b;}
int main()
{
int T;if(!scanf("%d",&T)){return -1;}
while(T--)
{
char S[1001];int aa=1;
if(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
vector<pair<int, pair<int, int>>> v(n);
for(int i = 0; i < n; ++i) {
cin >> v[i].second.first >> v[i].first >> v[i].second.second;
}
sort(v.begin(), v.end());
for(int i = 0; i < n... |
#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7,INF=1e18;
#define ll long long
#define pll pair<ll,ll>
#define x first
#define y second
#define p_all(arr) for(auto i:arr){cout<<i<<" ";}cout<<"\n";
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
ll t=1;
... | #include <vector>
#include <string>
#include <iostream>
using namespace std;
int main(void)
{
long long n;
cin >> n;
long long sum = 0;
vector<long long>a(n), b(n);
for (long long i = 0; i < n; i++) {
cin >> a.at(i) >> b.at(i);
sum += b.at(i)*(b.at(i) + 1) / 2 - a.at(i)*(a.at(i) - 1) / 2;
}
cout << sum << en... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1500010;
int a[N], ct[N];
int main(){
int n, m, res = 1e9;
scanf("%d %d", &n, &m);
if(n == 1){
cout<<1<<endl;
return 0;
}
for(int i = 0; i < n; i ++){
scanf("%d", &a[i]);
if(i < m)
ct[a[i]] ++;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
int n,m;
cin >> n >> m;
int a[n];
rep(i,n) cin >> a[i];
set<int> b;
map<int,int> c;
rep(i,1.5*1e6+1) b.insert(i);
rep(i,m){
c[a[i]]++;
b.erase(a[i]);
} ... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
int N;
vector<pii> V, X;
signed main()
{
cin >> N;
rep(i, N)
{
int x, c;
cin >> x >> c;
V.push_back({c, x});
}
sort(V.begin(), V.end());
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long double n;cin>>n;
long double a,b,c,d;cin>>a>>b>>c>>d;
const long double alp=2*M_PI/n;
long double x=(a+c)/2,y=(b+d)/2;
long double ansx=(a-x)*cos(alp)-(b-y)*sin(alp)+x;
long double ansy=(a-x)*sin(alp)+(b-y)*cos(alp)+y;
cout<<setprecision(16)<<a... | #include <iostream>
#include <cmath>
#include <complex>
using namespace std;
typedef long double ld;
ld pi = acos(-1);
ld x[2],y[2];
int main(){
cout.precision(20);
int i,n; cin >> n;
for(i=0;i<2;i++) cin >> x[i] >> y[i];
complex<ld> c1(x[0],y[0]),c2(x[1],y[1]),c3(cos((ld)2*pi/(ld)n),sin((ld)2*pi/(ld)n)... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n... | #include<bits/stdc++.h>
using namespace std;
int cvrt(string s){
int res=0;
for(auto &c : s){if(c=='1'){res++;}}
return res%2;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n,m;
cin >> n >> m;
vector<string> s(n);
vector<long long> mem(2);
for(int i=0;i<n;i++){
cin >> s[i];... |
#include <iostream>
using namespace std;
#define ll long long
int main()
{
ll int arr[4] , sum =0 ;
for(int i=0;i<4;i++)
{
cin>>arr[i];
sum+=arr[i];
}
for(int i=1;i<=15;i++)
{
ll int s = 0;
for(int j=0;j<4;j++)
{
if( i & (1<<j))
... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define fast ios::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main(){
fast
int a,b,c,d;
... |
#include<bits/stdc++.h>
using namespace std;
int n,m;
int main(){
cin>>n>>m;
cout<<n*(1+m)*m/2+m*(1+n)*n/2*100;
}
| #include<bits/stdc++.h>
using namespace std;
int main() {
int a,b; cin>>a>>b;
int ans = 0;
for(int floor = 1; floor<=a; floor++) {
for(int room = 1; room<=b; room++) {
ans+=(floor * 100 + room);
}
}
cout<<ans;
} |
#include<iostream>
#include<cmath>
using namespace std;
int main() {
int a,b,c,i,j,k;
scanf("%d %d %d",&a,&b,&c);
c=c*1000;
i=b-a;
if(c%b==0)
printf("%d ",c/b);
else {
k=c/b+1;
j=b*k-c;
if((double)j/i>k) {
printf("UNSATISFIABLE");
return 0;
} else
printf("%d ",k);
}
if(c%a==0)
printf("%d",c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<... |
#include <iostream>
#include <cstdlib>
#include <bitset>
#include <map>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <algorithm>
#include <sstream>
using namespace std;
#define ll long long
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#d... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define all(x... |
#include<bits/stdc++.h>
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>void read(_Tp &t,Args &...args){read(t);read(args...);... | //全力以赴
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
const int dx[4] = {+1, 0, -1, 0};
const int dy[4]... |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((... | #pragma GCC optimize("Ofast,unroll-loops,fast-math")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define pll pair<ll , ll >
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)(x).size()
#define X first
#define Y second
#define mp make_pair
#define pii pair<int , int>
#define vec vector
... |
#include <bits/stdc++.h>
using namespace std;
#define w(x) int x;cin>>x;while(x--)
#define ll long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define vi vector<int>
#define fr(a,b) for(int i=a;i<=b;i++)
#define inf 1e18
#define mod 1000000007
int main()
{
/*#ifndef ONLINE_... | #include<bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
cout << (a+b)/2 << " " << (a-b)/2;
return 0;
} |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | //@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#defi... |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int n,ans;
int a[N],cnt[N],ch1[N],ch2[N],dp[N],sto1[N],sto2[N];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
a[i]%=200;
if(!a[i])a[i]=200;
}
dp[0]=1;
for(int i=1;i<=n;i++)
for(int j=1e4;j>=a[i];j--)
{
dp[j]+=dp... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
void rec(int *idx, int s, int baki, function<void(int *)> fun)
{
if (baki == 0) fun(idx);
else
{
if (s < 0) return;
re... |
#include <bits/stdc++.h>
using namespace std;
const int N = 110;;
int a[N * N], b[N * N], c[N], mp[N][N];
int n, m;
bool vis[N];
string ans[N*N];
void dfs(int u) {
vis[u] = true;
for (int i = 1; i <= n; i++) {
if (mp[u][i]) {
mp[i][u] = false;
if (!vis[i]) dfs(i);
}
... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cos... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define int long long
typedef int ll;
typedef long double ld;
const ll N = 505;
char en = '\n';
ll inf = 1e16;
ll mod = 998244353;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while ... | #include<unordered_map>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define neinf 0xc0c0c0c0c0c0c0c0ll
#define inf 0x3f3f3f3f3f3f3f3fll
#define uint unsigned i... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define mod 1000000007
#define decimal(n,k) cout<<fix... | #include <iostream>
using namespace std;
#define int long long int
int32_t main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<b-c<<endl;
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define repf(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#def... | #include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
using Matrix = vector<vector<int>>;
const ll INF = LLONG_MAX;
const ld EPS = 1e... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
struct State {
int begin, end, cost;
State(int begin_, int end_, int cost_) : begin(begin_), end(end_), cost(cost_) { }
};
bool done[1000][1000];
int main() {
int N, M; cin >> N >> M;
vector<vector<int>> G(N);
vec... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef tuple<int,int,int> tpl;
typedef pair<int,tpl> Pair;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+50;
ll gcd(ll a,ll b)
{
return b==0?a:gcd(b,a%b);
}
int read()
{
int s=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')
f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
... | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x))
#define pii pair<int,int>
#define pll pair<ll,ll>
#define INF 1e9+10
#define INFL 1e18
#define mod 1000000007
//#define... |
#include <bits/stdc++.h>
#define MAXN 100005
#define INF 1000000000000000005
using namespace std;
int main (){
long long ans, n,i;
cin>>n;
i=1000;
ans = 0;
while (i<=n){
ans += n-i+1;
i=i*1000;
}
cout<<ans;
return 0;
} | #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>;
using Graph = vector<vector<int>>;
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 ... |
//
// Created by saa on 2021/5/27.
//
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int h=0;
int w=0;
int min=300;
int sum=0;
cin>>h>>w;
vector<int> blocks(h*w);
for(int n=0;n<blocks.size();n++)
{
cin>>blocks[n];
if(blocks[n]<min)
{
... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int... |
// нахуй такие задачи пиздец
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m,k,a[15],is[200005];
struct P{
long double k,x;
}f[200005],sum[200005];//f[i]=k*f[1]+x
P operator +(P i,P j){
return {i.k+j.k,i.x+j.x};
}
P operator -(P i,P j){
return {i.k-j.k,i.x-j.x};
}
P operator /(P i,double... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N, Q; cin >> N;
vector<int> A(N), T(N);
REP(i, 0, N) cin >> A[i] >> T[i];
cin >> Q;
vector<ll> X(Q);... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[15];
bool cmp (int a, int b) {
return a > b;
}
int g2(int x) {
int ind = 0, res = 0;
while (x) {
a[ind ++] = x % 10;
x /= 10;
}
sort(a, a + ind);
for (int i = 0; i < ind; i ++) {
if (a[i] != 0) {
res *= 10;
res += a[i];
}
}
... | // Umang_US
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define pob pop_back
#define vi vector<ll>
#define mp make_pair
#define sz size()
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define rep(i,n) for(ll i=0;i<n;i++)
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie... |
#include<bits/stdc++.h>
#define cases long long t; cin>>t; while(t--)
#define ll long long
#define MOD 1000000007
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
ll i,j,flag=0,k,flag2=0;
cin>>s;
for(j=s.size()-1;j>=0;j--){
i... | #include<bits/stdc++.h>
#define ll long long
#define x first
#define y second
#define pi pair
#define K 1000000007
using namespace std;
ll a[2000000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll test_case=1;//cin>>test_case;
while(test_case--)
{
ll m,h;cin>>m>>h;
if(h%m==0)... |
#include<bits/stdc++.h>
using namespace std;
#define rg register
#define In inline
#define ll long long
const int N = 2e5;
const ll mod = 998244353;
namespace IO{
In ll read(){
ll s = 0,ww = 1;
char ch = getchar();
while(ch < '0' || ch > '9'){if(ch == '-')ww = -1;ch = getchar();}
while('0' <= ch && ch <= '... | #line 1 "a.cpp"
#include<iostream>
using namespace std;
#line 1 "/home/kotatsugame/library/datastructure/UF.cpp"
#include<vector>
struct UF{
int n;
vector<int>parent,rank;
UF(int n_=0):n(n_),parent(n_),rank(n_,1)
{
for(int i=0;i<n_;i++)parent[i]=i;
}
int find(int a){return parent[a]!=a?parent[a]=find(parent[a])... |
// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#... | #include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <chrono>
#include <complex>
using namespace std;
#define ll long long
#define ld long double
#define ui unsigned int
#define ull unsigned ll
#define mp make_pair
#define eb emplac... |
#include <bits/stdc++.h>
using namespace std;
#define fo(i, x, y) for (int i = (x); i <= (y); ++i)
#define fd(i, x, y) for (int i = (x); i >= (y); --i)
typedef long long ll;
int getint()
{
char ch;
int res = 0, p;
while (!isdigit(ch = getchar()) && (ch ^ '-'));
p = ch == '-'? ch = getchar(), -1 : 1;
while (isdi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef pair<int,int> P ;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
int main(){
int t ;
cin >> t ;
ll a[t] ;
rep(i, t) cin >> a[i] ;
rep(i, t){
if(a[i] % 2 == 0){
a[i] /= 2 ;
if(a[i] % 2 == 0)... |
#include <iostream>
#include <vector>
#include <iomanip>
#include <cmath>
#include <unordered_map>
#include <climits>
#include <algorithm>
#include <map>
#include <queue>
#include <random>
#include <chrono>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(x) x.begin(),x.end()
typedef long long ll;
ll mod = 1000000007;
ll inf = 1e18;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(m);
rep(i,m) cin >> a[i];
... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long p = sqrt(2 * n + 2);
while ((p + 1) * p <= 2 * n + 2)
p++;
cout << n + 1 - p + 1;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll ans = 2;
for (ll l = 1; l <= 1e7; l++) {
ll a = (2 * n - l * (l - 1));
ll b = a / (2 * l);
if (a % (2 * l) == 0 && b > 0 && b < n) {
ans +=... |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define int long long int
#define vi vector<int>
#define pb push_back
#define endl "\n"
#define all(v) v.begin(),v.end()
#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n-1;i>=0;i--)
#define deb(x) cout<<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define lb(x...)... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using T2 = tuple<int,int,int, int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
retur... |
#include <bits/stdc++.h>
using namespace std;
namespace Flandre_Scarlet
{
#define mod 1145141919
#define F(i,l,r) for(int i=l;i<=r;++i)
#define D(i,r,l) for(int i=r;i>=l;--i)
#define Fs(i,l,r,c) for(int i=l;i<=r;c)
#define Ds(i,r,l,c) for(int i=r;i>=l;c)
#define MEM(x,a) memset(x,a,sizeof(x))
#define FK(x) ME... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int N=1e5+10;
int a[11];
int main()
{
string s;
cin>>s;
memset(a,0,sizeof a);
for(int i=0; i<s.size(); i++)
{
int k=s[i]-'0';
a[k]++;
}
if(s.size()>=3)
{
for(int i=100; i... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
template<class G>
class Fenwick_tree{
vector<G> a;
public:
Fenwick_tree(int n=0){ build(n); }
Fenwick_tree(const vector<G>& a){ build(a); }
void build(int n){
a.assign(n,G{});
}
void build(const vector... | #include<bits/stdc++.h>
#define ll long long
#define N 100005
using namespace std;
int read() {
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while('0'<=c&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}
ll n,f[N][2];
int main() {
n = read();f[0][1] = f[0][0] = 1;
for(int i=1; i<... |
#include "bits/stdc++.h"
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m =0, n = 0, p = 0, q = 0, mod=998244353;
string s;
char moji;
cin >> a;
n=0;
for(int i=1;n<a;i*=2)
{
m++;
for(int j... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
template<typename T>
void __p(T a) {
cout << a;
}
template<typename T, typename F>
void __p(pair<T, F> ... |
#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<queue>
#include<bitset>
#include<cstdlib>
#include<set>
#include<unordered_map>
#define l(x) (x<<1)
#define r(x) ((x<<1)|1)
#define low(x) (x&(-x))
#define IL inline
#define reg register
#de... | #include<bits/stdc++.h>
#define pb push_back
#define endl ("\n")
#define mp make_pair
#define lb lower_bound
#define ff first
#define ss second
#define cn continue
#define br break
#define ins insert
#define int long long
#define bit(x) __builtin_popcount(x)
#define all(x) x.begin(),x.end()
#define up upper_bound
#defi... |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 400005
struct Edge{
int a,b;
};
ll N = 1;
ll uniformity[6*SIZE],p... | #include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... |
/* dont stick to an approach */
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
#include <cstdlib>
using namespace std;
typedef l... | // Problem: E - Divide Both
// Contest: AtCoder - AtCoder Beginner Contest 206（Sponsored by Panasonic）
// URL: https://atcoder.jp/contests/abc206/tasks/abc206_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <iostream>
#include <iomanip>
#include <cstdio>
#i... |
#include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
// cout << fixed << setprecision(8) << result << endl;
int main() {
ll n;
cin >> n;
ll ans = 0;
rep(i,n){
ll a, b;
cin >> a >> b;
ans += (b - a + 1)... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <string>
#include <iomanip>
#include <iostream>
#include <map>
#include <unordered_map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define fs first
#define sc second
#define endl '\n'
int A, B, C;
double mem[100][100][100];
double dp(int a, int b, int c) {
if (a >= 100 || b >= 100 || c >= 100)
return (a - A) + (b - B) + (c - C);
if (mem[a][b][c] >= 0)
return mem[a][b][c];... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
long long a[100];
long long n,tog;
vector<long long> v1,v2;
long long res;
void dfs1(long long d,long long sum)
{
if(d==n/2+1)
{
v1.push_back(sum);
res=max(res,sum);
return;
}
if(sum+a[d]<=tog)dfs1(... |
/*
** author : Dhiraj Govindvira
** date : 19 June 2021 ~ Saturday
** time : 05:30:08 PM
*/
#include <bits/stdc++.h>
using namespace std;
#ifdef DHIRAJ
#include "D:/dhiraj/Programming/debug.h"
#else
#define dbg(...) 1
#define cerr if(0) cerr
#endif
using ll = long long int;
#define endl '\n'... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#define all(v) begin(v), end(v)
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; ++i)
#define rep3(i... |
#include <bits/stdc++.h>
using namespace std;
using P = pair<long long, long long>;
long long b, c;
long long solve();
int main() {
cin >> b >> c;
cout << solve() << endl;
return 0;
}
long long solve() {
vector<P> v;
v.emplace_back(b - c / 2, b);
v.emplace_back(-b - (c - 1) / 2, -b);
v.emplace_back(-... | #include <bits/stdc++.h>
#define ll long long
#define SZ(vvv) ((int)vvv.size())
#define all(vvv) (vvv.begin(), vvv.end())
#define fastIO cout << fixed << setprecision(7), ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
using namespace std;
const int N = 1e5 + 9, M = 1e3 + 3, MOD = 1e9 + 7, OO = 1e9;
co... |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,b,a) for(int i=b;i>=a;i--)
#define efo(i,u,v) for(int i=BB[u],v=B[BB[u]][1];i;v=B[i=B[i][0]][1])
#define mset(a,x) memset(a,x,sizeof(a))
template<typename T> bool chkmin(T &a,const T &b) {return b<a?a=b,1:0;}
tem... | #include <iostream>
#include <stdio.h>
using namespace std;
int ed[101][101];
int visit[101];
void cle()
{
for(int i = 0; i < 101; i++)visit[i]=0;
}
double cc = 0;
void dfs(int v)
{
visit[v] = 1;
cc++;
for(int i = 1; i < 101; i++)
{
if(ed[i][v] == 1 && visit[i] == 0)
{
d... |
#include <bits/stdc++.h>
#include <numeric>
// #include <atcoder/modint>
using namespace std;
// using namespace atcoder;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll> > P... | #include <bits/stdc++.h>
#define li long int
#define lli long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define si size()
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define lb lower_bound
#define ub upper_bound
#define BS binary_search
#define... |
#include "bits/stdc++.h"
using namespace std;
#define dbg(var) cout<<#var<<"="<<var<<" "
#define nl cout<<"\n"
#define fr(i,n) for(int i=0;i<n;i++)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define fa(v) for(auto &i:v)
#define all(v) v.begin(),v.end()
#d... | //Solution By SlavicG
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb ... |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string S[3];
cin >> S[0] >> S[1] >> S[2];
int frag[3][10]={};
int count=0;//文字数のカウント
for(int i=0;i<3;i++){
for(int k=0;k<S[i].size();k++){
if(frag[i][k]==0){
count++;
frag[i][k]=count... | #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... |
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string t;
cin >> t;
if (n == 1) {
if (t == "1") {
cout << (long long)2e10 << '\n'... | /*
You're my honeybunch, sugar plum
Pumpy-umpy-umpkin
You're my sweetie pie
You're my cuppycake, gumdrop
Snoogums, boogums, you're
The apple of my eye
And I love you so
And I want you to know
That I'm always be right here
And I want to sing
Sweet songs to you
Because you are so dear...
*/
#include <bits/stdc++.h>
#in... |
#include <bits/stdc++.h>
using namespace std;
using P = pair<long long, long long>;
int n;
vector<P> v;
long long solve();
int main() {
cin >> n;
v.resize(n);
for (auto &p : v) cin >> p.first >> p.second;
cout << solve() << endl;
return 0;
}
long long solve() {
vector<int> id(n), p;
iota(id.begin(), ... |
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <queue>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
double xs[200000+10];
double ys[200000+10];
bool g[105][105];
int visited[105];
int counter;
int main(void) {... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co... | #include <iostream>
#include <cstdio>
const int nn = 2e5 + 5;
int n, ans[nn], tot;
int cnt, prev[nn << 1], last[nn], to[nn << 1];
void addedge(int p, int q) {
prev[++cnt] = last[p];
to[last[p] = cnt] = q;
}
int dep[nn], son[nn];
void dfs1(int p, int fa) {
for (int i = last[p]; i; i = prev[i]) {
if (to[i] != fa) {
... |
// Problem: A - Star
// Contest: AtCoder - AtCoder Beginner Contest 192
// URL: https://atcoder.jp/contests/abc192/tasks/abc192_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios_base::sync_with_stdio(fal... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using llu = unsigned long long;
using ld = long double;
#define CEIL(x, y) (ll)ceil((ld)(x) / (ld)(y))
#define dbgLST(ds) for(auto it : ds) cout << it << ' ';
#define dbgMP(ds) for(auto it : ds) cout << it.first << ' ' << it.second << '\n';
const do... |
#include <stdio.h>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <functional>
#include <limits.h>
#include <numeric>
using namespace std;
typedef long long int ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define inf INT_MAX
#define linf LLONG_MAX
... | #include<iostream>
#include<bits/stdc++.h>
#include<math.h>
#include<vector>
#include<string>
#include<cstring>
#include<ctype.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type,... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int A,B;cin>>A>>B;
map<int,int>mp;
for(int i=A;i<=B;i++){
for(int j=1;j*j<=i;j++){
if(i%j==0){
mp[j]++;
if(j!=i/j){
mp[i/j]++;
}
}
}
}
int ans=0;
for(auto i:mp){
if(i.s... | #include <bits/stdc++.h>
using namespace std;
int findMaxGCD(int arr[], int n)
{
int high = 0;
for (int i = 0; i < n; i++)
high = max(high, arr[i]);
int count[high + 1] = {0};
for (int i = 0; i < n; i++)
count[arr[i]]++;
int counter = 0;
for (int i = high; i >= 1; i--)
{
... |
#include <bits/stdc++.h>
#define MOD 1000000007LL
#define INF 0x3f3f3f3f3f3f3f3fLL
#define EPS 1e-6
#define rep(i, l, r) for (int i = l; i < (int)(r); i++)
#define rrep(i, l, r) for (int i = ((int)(r) - 1); i >= l; i--)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
struc... | //#pragma GCC optimize("Ofast")
#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>;
//~ while (clock(... |
#include<bits/stdc++.h>
using namespace std;
long long dp[67][2],ara[67];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz=0,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=0,y=1,cnt=0,res=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long l... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define yes {cout<<"Yes"<<endl;return 0;}
#define no {cout<<"No"<<endl;return 0;}
#define INF 2147483647
#define LINF 9223372036854775807
int main()
{
int i,j,n;
ll int dpt[61],dpf[61];
string x[61];
cin>>n;
for(i=1;i<=n;i++)cin>>x[i... |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
typedef long long ll;
typedef unsigned long long int ull;
typedef long double ldb;... | #include <bits/stdc++.h>
using namespace std;
//#define ll long long
//Functionn for sorting
int main()
{
unordered_map<long long int,long long int>mp;
long long int n;
cin>>n;
vector<long long int>a(n);
for(auto &x: a){
cin>>x;
mp[x]++;
}
long long int c=(n*(n-1))/2;
... |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=100010; //check the limits, dummy
int a[11];
int n, m;
int mp[100000010], mp1[100000010]... |
#include <bits/stdc++.h>
#define nl "\n"
#define ll long long
#define vii(N,M,x) vector<vector<long long>> x(N,vector<long long>(M))
#define pb push_back
#define ii pair<int,int>
#define ft first
#define sd second
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
const int INF=1e9+5;
const int MO... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
const int INF = 1001001001;
int main(){
string s;
cin >> s;
int n = s.size();
vector<int> c(3);
for(int i = 0; i < n; i++){
c[(s[i] - '0')%3]++;
}
int ... | #include <bits/stdc++.h>
#include <cctype>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template<typename key, typename val>
//using ordered_tree =
// tree<key, val, std::less<>, rb_tree_tag, tree_order_statistics_node_update>;
using namespace std;
t... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#end... | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(false);}} fast;
using ull = unsigned long long;
using ll = long long;
using vi = vector<int>;
using vl = vector<long>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvll = ve... |
#include <bits/stdc++.h>
using namespace std;
int bs(int a[],int n,int val)
{
if(a[0]>val) return -1;
if(a[n-1]<=val) return n-1;
int l=0;int u=n-2;
while(l<=u)
{
int mid=(l+u)/2;
if(a[mid]<=val && a[mid+1]>val)
return mid;
else if(a[mid]>val)
u=mid-1;
else l=mid+1;
}
}
int main() {
int n,m;
cin>... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll OO = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
const double pi = 3.14159265359;
//freopen("window.in", "r", stdin);
//freopen("output.out", "w", stdout);
void skrrrt() {
ios_base::sync_with_stdio(0), cin.tie(0);
}
//#########################... | // In god we trust
#include <bits/stdc++.h>
#include <chrono>
#include <algorithm>
#include <signal.h>
#include <thread>
#include <pthread.h>
#include <omp.h>
#define pb push_back
#define fi first
#define se second
#define Vi vector<int>
#define Vb vector<bool>
#define Pi pair<int, int>
#define Si set<int>
#defin... |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <tuple>
template <class E> struct FenwickTree {
int _n;
std::vector<E> data;
FenwickTree(int n) : _n(n), data(n) { }
void add(int p, E x) {
++p;
while (p <= _n) {
data[p - 1] += x;
p +... | /***************************************************************
File name: HaHa
Author: ljfcnyali
***************************************************************/
#include<bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for ( int i = (a), _end_ = (b); i <= _end_; ++ i )
#define mem(a) memset ( (a), 0, siz... |
#include <bits/stdc++.h>
#define endl '\n'
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace std;
typedef pair<int,int>pii;
int n;
int c[510][510];
int sumr[510],sumc[510];
int a[510],b[510];
bool che... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LON... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repab(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repr(i, n) for (ll i = (ll)(n); i >= 0; i--)
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sor... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vint> vvint;
typedef pair<ll, ll> iPair;
#define ff first
#define ss second
static ll n;
static vector<iPair> arr;
int main(){
cin >> n;
arr.resize(n);
for(int i = 0; i < n; i++)
cin >> arr[i].ff >> arr[i]... | #include<bits/stdc++.h>
#define lint long long int
#define rep(i,n) for(int i=0;i<int(n);i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define arep(i,a,n) for(int i=a;i<n;i++)
#define sort(a) sort(a.begin(),a.end())
#define reverse(a) reverse(a.begin(),a.end())
#define fill(a,x) fill(a.begin(),a.end(),x)
#define eb(dat... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl '\n'
const int mxN=30001,M=1e9+7;
int main() {
int n,k;
cin>>n>>k;
vector<int>v;
for(int i=1;i <=n;i ++){
int x;cin>>x;
if(x!=k)v.push_back(x);
}
for(int a: v)cout<<a<<" ";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n,q;
cin>>n>>q;
long long int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
long long int b[n]={0};
b[0]=a[0]-1;
for(int i=1;i<n;i++){
b[i]=a[i]-a[i-1]-1;
}
for(int i=1;i<n;i++){
b[i]=b[i]+b[i-1];
}
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll, ll>;
const ll INF = ll(1e18);
const ll mod = ll(998244353);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define P pair<int,int>
int main(){
int N;
cin >> N;
vector<vector<string>> S(9,vector<string> (256));
S[1][1] = "AB";
int k = 1;
rep(i,N-1){
rep(j,k){
S[i+2][j+1] = S[i+1][j+1] + S[i+... |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<unordered_map>
#include<vector>
#include<set>
#include<queue>
#include<stack>
#include <math.h>
#include<climits>
using namespace std;
#define int long long
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define pii pair<int,int>
... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
ll ans=-1;
void Exgcd(ll A,ll B,ll &x,ll &y,ll &d)
{
if(B==0)
{
x=1;y=0;d=A;
return;
}
Exgcd(B,A%B,x,y,d);
ll tmp=y;
y=x-(A/B)*y;
x=tmp;
}
void Solve(ll A,ll B,ll C,ll a,ll b)
{
ll x,y,d;
... |
#include<bits/stdc++.h>
#define lli long long
#define test int t;cin>>t;while(t--)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define mod 1000000007
using namespace std;
void solve()
{
double n , x , y , ans;
cin >> n >> x >> y;
lli dist = ceil(sqrt(x * x + y * y));
if(dist == n)
{
ans = 1;
... | #include<bits/stdc++.h>
using namespace std;
using LL=long long;
using P=pair<int,int>;
using T=tuple<LL,int,int,int>;
constexpr LL mod=1000000007;
constexpr LL inf=1e9;
constexpr double eps=1e-13;
constexpr double pi=3.141592653589;
int in(){
int x;
scanf("%d",&x);
return x;
}
int main(){
LL r=in(),x=i... |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | /*
Bismillahi-r-Rahmani-r-Rahim
RhIeyAaD
IIT-7th Batch,JU
*/
#include<bits/stdc++.h>
using namespace std;
#define debug(args...){ string _s = #args;replace(_s.begin(),_s.end(),',', ' ');stringstream _ss(_s);istr... |
#include <bits/stdc++.h>
using namespace std;
class DSU {
private:
vector<int> rank, parent;
vector<unordered_map<int, int>> freq;
public:
DSU(vector<int> &init) {
int sz = init.size();
rank = vector<int>(sz, 0);
parent = vector<int>(sz, 0);
iota(parent.begin(), parent.end(), 0);
freq = vect... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M=2e5+1;
struct BIT{
ll bit[200004];
int dat[200004];
void init(){
for(int i=0;i<=M;i++)bit[i]=dat[i]=0;
}
void add(int id,int a,int b){
for(;id;id-=(id&-id))dat[id]+=a,bit[id]+=b;
}
ll got1(int id){
ll res=0;
for(;id<=M;id+=(id... |
//#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> p;
const int INF = 1e9;
const double eps = 1e-7;
const ll LINF = ll(1e18);... | #include <bits/stdc++.h>
typedef long long ll;
#define ALL(l) (l).begin(),(l).end()
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using namespace std;
//const ll mod = 998244353;
//const ll maxn = 1000000000;
//-------------------------------------------------... |
#include<cstdio>
#ifdef WIN64
#define LL "%I64d"
#elif WIN32
#define LL "%I64d"
#else
#define LL "%lld"
#endif
const int mo=998244353;
long long a,b,c;
long long sigma(long long a)
{
if(a%2==0)
return (a/2)*(a+1)%mo;
else
return a*((a+1)/2)%mo;
}
int main()
{
scanf(LL LL LL,&a,&b,&c);
long long ans=sigma(c)%mo*... | #include<bits/stdc++.h>
using namespace std;
int main() {
int X,Y,Z; cin >> X >> Y >> Z;
double t = (double)Y/X;
for (int i =1000000; i>=0; i--) {
if (t > (double)i/Z) {
cout << i << endl; break; } }
return 0;
} |
#include<cstdio>
int n;
int gao(int x)
{
for (int j=10;j>=0&&x>n;--j)
if (x&(1<<j)) x^=1<<j;
return x?x:1;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;++i) printf("%d %d\n",gao(i<<1),gao(i<<1|1));
return 0;
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using name... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
int n,m,a[20][20],ok[300000],dp[300000];
int ... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// 組合せを素数で割った値
const int MAX = 510000;
const ll MOD = 1e9 + 7;
ll fac[MAX], finv[MAX], inv[MAX];
// 前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MO... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long LL;
typedef pair<int,int> PI;
typedef vector<int> VI;
typedef vector<PI> VPI;
template<class T> bool tmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool tmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
signed main(){
ll n,x;
cin >> n >> x;
cout << (n/x) << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,w,t=0,cnt=0;
cin>>n>>w;
while(t<=n)
{
t+=w;
cnt++;
}
cout<<cnt-1<<endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.