code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
using namespace std;
int main(){
string S;
cin >> S;
int ans = 1;
if(S=="RRR") ans = 3;
if(S=="RRS"||S=="SRR") ans = 2;
if(S=="SSS") ans = 0;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n, k; cin >> n >> k;
vector<int> data(n + 1, 0);
for (int i = 1 ; i <= n ; i++)
cin >> data[i], data[i]-... | 0 | 89,675,121 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int dp[100005][3];
int solve(int day,int n,vector<int> arr[],int flag)
{
int maxi=0;
if(day==n)
return 0;
if(dp[day][flag]!=-1)
return dp[day][flag];
if(flag==0)
{
maxi=max(maxi,arr[day][0]+solve(day+1,n,arr,1));
maxi=max(maxi,arr[day][1]+so... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 0 | 29,039,944 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for(int i=0;i<S.size();i++){
if(S.at(i) == 'a' ||
S.at(i) == 'i' ||
S.at(i) == 'u' ||
S.at(i) == 'e' ||
S.at(i) == 'o'){
cout << "vowel" << endl;
}else{
cout << "consonant" << endl;
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define INF 1000000000000
#define MOD 10000007
#define PI 3.14159265359
#define dij priority_queue<pair<int,int>,vector<pa... | 0 | 82,518,683 |
#include <iostream>
#include <vector>
#include <algorithm>
int main()
{
int a, b, k;
int m;
std::cin >> a >> b >> k;
int small = std::min(a, b);
int large = std::max(a, b);
std::vector<int> divs;
for (int d = 1; d <= small; d++)
{
if (small % d == 0 && large % d == 0)
divs.push_back(d);
}
std::cout << di... | #include<bits/stdc++.h>
using namespace std;
vector<long long>v;
int f(int x)
{
int ans=0;
for(int i=1;i<=100;i++)
{
ans+=i;
if(ans>x)
{
return i-1;
}
}
}
int main()
{
int ans=0;
long long x;
cin>>x;if(x==1)
{
cout<<"0"<<endl;
return 0;
}
for(int i=2;i<=sqrt(x);i++)
{
... | 0 | 3,251,712 |
#include <iostream>
#include <cstdio>
#include <cctype>
using namespace std;
int main()
{
int a[26] = {0};
char x;
bool flag = false;
while(cin >> x) {
if(isupper(x)) x = tolower(x);
if ('a' <= x && x <= 'z') {
a[x - 'a']++;
}
}
for (int i = 0; i < 26; i++) {
printf("%c : %d\n", i + 'a', a[i]);
}
re... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF 1<<30
#define LINF 1LL<<60
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
ll N; cin >> N;
vector<ll> a(N);
for(auto& in:a) cin >> in;
ll res = LINF;
ve... | 0 | 12,796,985 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
struct UnionFind
{
vector< int > data;
UnionFind(int sz)
{
data.assign(sz, -1);
}
bool unite(int x, int y)
{
x = find(x), y = find(y);
if(x == y) return (false);
if(data[x] > data[y]) swap(x, y);
data[x] += data[y];
d... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <bitset>
#include <string>
#include <sstream>
#include <iomanip>
#define int long long
#define double long double
#define Rap(n,i) for(int (i)=0;(i)<(n);(i)++)
#define Pr(n) cout<<n<<endl;
#define PairV vector<pair<in... | 0 | 45,009,670 |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define rev(v) reverse(v.begin(), v.end());
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
#define check cout<<"?\n";
using namespace std;
typedef long long ll;
typedef long double... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#defi... | 0 | 84,368,116 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const int MAX_N = 100000;
const int MAX_S = 317;
int n, s, j, skip, nextskip, lis, idx, nextidx;
int a[MAX_N], sz[MAX_S * 2], top[MAX_S * 2], p[MAX_S], nextp[MAX_S];
int PatienceSorting(int nexti){
int r = -1;
int l = -1;
if(p[0] == -... | #include <iostream>
using namespace std;
int main(){
ios::sync_with_stdio(false);
int sum=0;
int x;
int cnt=0;
while(1){
cin>>x;
if(!x)
return 0;
sum=1000-x;
while(sum>0){
if(sum>=500){
cnt++;
sum-=500;
... | 0 | 17,493,028 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a,b;
cin >> a >> b;
if (a==b) cout << '=' << endl;
else if (a=='A') cout << '<' << endl;
else if (b=='A') cout << '>' << endl;
else if (a=='B') cout << '<' << endl;
else if (b=='B') cout << '>' << endl;
else if (a=='C') cout << '<' << endl;... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
int main(){
string S;
... | 0 | 93,076,426 |
#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <utility>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <thread>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; ++i)
typedef long long ll;
typedef pair<int,int> pii;
int main... | #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... | 0 | 20,001,827 |
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
char Str[21];
int StrLen;
cin >> Str;
StrLen = strlen( Str );
while( 1 ){
cout << Str[StrLen-1];
StrLen--;
if( StrLen == 0 ) break;
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | 0 | 30,013,915 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <cmath>
#include <iomanip>
#include <bitset>
#include <string>
#include <stdlib.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
int main(){
ll a,b;
cin >> a >> b;
if (a%b==0){
cout << -1 <... | #include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
long long n,ans=0;
cin>>n;
long long b[n-1],a[n];
f(i,0,n-1){
cin>>b[i];
}
a[0]=b[0];
a[n-1]=b[n-2];
f(i,1,n-1){
if(b[i-1]<b[i]){
a[i]=b[i-1];
}
els... | 0 | 73,104,185 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
string S;
cin >> N >> S;
const long long MOD = 1000000000 + 7;
vector<long long> v( 26 );
for( int i = 0; i < N; i++ ) {
int n = S[i] - 'a';
v[n]++;
}
long long ans = 1;
for( int i = 0; i < 26; i++ ) {
if( v[i] == 0 ) continue;
ans *= v[... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> ostream& operator<<(ostream& os, const vector<T> arr){ for(int i = 0; i < (int)arr.size(); i++)cout << arr[i] << (i == (int)arr.size() -1 ? "" : " "); return os;}
int main()
{
int m, k;
cin >> m >> k;
int n = 1<<m;
if(k... | 0 | 35,332,348 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
vector<ll> A(N); REP(i, N) cin >> A[i... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_e... | 0 | 16,740,689 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
int L;
cin >> L;
cout << fixed << setprecision(12) << L*L*L / 27.0 << endl;
return 0;
} | #include <iostream>
#include <vector>
class Node{
public:
long key;
int parent, left, right;
Node(){
key = -1;
parent = left = right = -1;
}
};
class CompleteBT{
public:
int size;
std::vector<long> heap;
std::vector<Node> nodes;
CompleteBT(int s, std::vector<long> inHeap)... | 0 | 60,522,949 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100006;
const int MOD = 1e9 + 7;
int occ[N];
int F[N], I[N];
ll pow1(ll n, ll p){
ll c, r;
c = n;
r = 1;
while(p){
if(p & 1)
(r *= c) %= MOD;
p /= 2;
(c *= c) %= MOD;
}
return r;
}
void init(){
F[0] = I[0] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
vector<vector<string>> s(h,vector<string>(w,""));
int tt=-1,yk=-1;
for(int i = 0;i < h;i++)
{
for(int j = 0;j < w;j++)
{
cin >> s.at(i).at(j);
if(s.at(i).at(j) == "snuke")
{
tt = i;
yk = j;
break;
}
i... | 0 | 44,967,654 |
#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;
string S;
cin >> N;
map<string, ll> mp;
rep(i,N) {
cin >> S;
sort(S.begin(), S.end());
++mp[S];
}
ll ans = 0... | #include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
using namespace std;
double abs(double x)
{
if(x<0) return -x;
else return ... | 0 | 92,317,609 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
priority_queue<int> A;
for (int i = 0; i < N; i++){
int a;
cin >> a;
A.push(a);
}
for (int i = 0; i < M; i++){
int tar = A.top();
tar /= 2;
A.pop();
A.push(tar);
}
long long int ans = 0;
whil... | #include <iostream>
#include <cstring>
#define int64 long long int
using namespace std;
int main(){
int n ;
scanf("%d",&n);
char str[n] ;
scanf("%s",str);
int64 ret = 0 ;
for(int i=0;str[i];i++){
if(str[i]=='R')str[i]='0';
else if(str[i]=='G')str[i]='1';
else str[i] = '2'... | 0 | 41,527,694 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
const int maxn = 105 + 5;
ll a[maxn];
int main()
{
ios::sync_with_stdio(false);
int n ; cin >> n;
for (int i = 1 ; i <= n ; i++){
cin >> a[i];
}
sort(a + 1 , ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
const ll MOD = 1000000007;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(m+2);
for(int i=1;... | 0 | 73,669,383 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int in() {int x; cin>>x; return x;}
ll lin() {ll x; cin>>x; return x;}
string sin() {string x;cin>>x;return x;}
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
bool i... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vll = vector<long long>;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using vpi = vector<pair<int, int>>;
#define F first
#define S second
#d... | 0 | 34,915,581 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
int n, m, nx, ny;
cin >> n >> m >> nx >> ny;
vector<int> x(n), y(m);
... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | 0 | 65,375,681 |
#include <bits/stdc++.h>
#include <iostream>
#include <set>
using namespace std;
typedef pair <long long,long long> pii;
int N;
pii arr[100005];
long long val[100005];
multiset <long long> larger;
multiset <long long>::iterator it;
struct quad{
long long l, ll, r, rr;
};
quad neighbouring[100005];
int main() {
... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 0 | 98,340,376 |
#include <iostream>
int main()
{
int a, b, c;
std::cin >> a >> b >> c;
bool flag = false;
for (int i = 1; i <= b; ++i)
{
if (a * i % b == c)
{
flag = true;
break;
}
}
if (flag)
{
std::cout << "YES";
}
else
{
std:... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ch... | 0 | 61,294,526 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int edge[50][50];
int main(){
int n;
while(cin>>... | #include <iostream>
#include <string>
using namespace std;
int main() {
char char_A = 'A';
char char_Z = 'Z';
char char_a = 'a';
char char_z = 'z';
bool first = true;
string inputStr;
while (cin >> inputStr) {
if (!first) {
cout << " ";
}
first = false;
int m = inpu... | 0 | 42,267,807 |
#include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
const ll inf = 1000000001;
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F fi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
int N;
cin >> N;... | 0 | 96,772,614 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int n = s.size();
int len = 0;
for(int i = 0; i < n-1; i++){
s.erase(s.size() -1);
len = s.size();
if(len %2 != 0) {
continue;
} else if (s.substr(0, len/2) == s.substr(len/2, len)) {
break;
... | #include <bits/stdc++.h>
#define MAXN 2010
#define pii pair<int,int>
#define ff first
#define ss second
#define ll long long
#define in_range(x, y, n) (x >= 0 and x<n and y >=0 and y<n)
using namespace std;
const ll mod = 1e9 + 7;
ll n, m, ps[MAXN][MAXN];
int main (){
ios_base::sync_with_stdio(false);
cin >> n ... | 0 | 74,070,624 |
#include<cstdio>
static const int M = (int)1e5+5;
struct node{
int to;
node *nxt;
void add(int v){
node *p=new node;
p->to=v,p->nxt=nxt,nxt=p;
}
}head[M];
int SG[M];
void dfs(int u,int f){
SG[u]=0;
for(node *i=head[u].nxt;i;i=i->nxt){
int v=i->to;
if(v==f)continue;
dfs(v,u);
SG[u]^=SG[v]+1;
}
}
int m... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;
typedef p... | 0 | 15,304,226 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, k, d, a;
set<int> st;
cin >> n >> k;
rep(i, k) {
cin >> d;
rep(i, d) {
cin >> a;
st.insert(a);
}
}
cout << n - st... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.1415926535897932384626433832795l
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
us... | 0 | 30,024,378 |
#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 () {
string s;
int i;
cin >> s;
for(i=0; i<s.size(); i+=2){
cout << s[i];
}
} | #include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <bitse... | 0 | 68,068,827 |
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define INF 1e18
#define MOD 1000000007
#define N 1000005
#define BB(V) V[V.size()-2]
#define ex(V) return printf(V),0
using namespace std;
int t1,t2;
int BS(int s,int e){
if(s==e)return s;
int... | #include<bits/stdc++.h>
#include <math.h>
#include <map>
#include <unordered_map>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pa... | 0 | 100,295,865 |
#include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
char s[] = "1001010111001010";
int main()
{
long long i,n,x,y,c1=0,c2=0;
ios::sync_with_stdio(0),cin.tie(0);
cin>>i>>n>>x;
if(i+n>=x)
cout<<"Y... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define loop(k) rep(author_is_masa,k)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<in... | 0 | 86,915,633 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <functional>
using namespace std;
#define int lo... | #include<iostream>
using namespace std;
int main(){
int H,W,j,i;
for(;;){
int x=0;
cin>>H>>W;
if(H==0 && W==0){
break;
}
for(j=1;j<=H;j++){
for(i=1;i<=W;i++){
cout<<"#";
}
cout<<endl;
}
cout<<endl;
}
return 0;
} | 0 | 74,008,921 |
#include <stdio.h>
int main(){
char sebelum;
scanf("%c", &sebelum);
sebelum++;
printf("%c", sebelum);
return 0;
} | #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... | 0 | 20,454,706 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF=INT_MAX/4;
const long long MOD=998244353;
const double EPS=1e-14;
const bool DEBUG=false;
const string YES = "YES";
const string NO = "NO";
const string Yes = "Yes";
const string No = "No";
template<cl... | #include <stdint.h>
#include <cstdlib>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <iostream>
#include <bitset>
#include <array>
#include <stdio.h>
using namespace std;
# define MAX 1000
uint64_t D0[MAX]={0}, HP[MAX]={0}, HN[MAX]={0}, VP[MAX]={0}, VN[MAX]={0};
uint64_t Cmap[MAX][20] =... | 0 | 72,615,546 |
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
int i,j,n,s=0,t=0;
for(i=1;i<=4;i++)
{
cin>>n;
s+=n;
}
for(i=1;i<=4;i++)
{
cin>>n;
t+=n;
}
if(s>=t)cout<<s<<endl;
else cout<<t<<endl;
} | #include <bits/stdc++.h>
#define rep(i, x, y) for (int i = x; i <= y; i++)
using namespace std;
const int N = 1e5 + 10;
typedef long long ll;
ll n, m, v, p, ans;
ll a[N], b[N];
bool cmp(ll a, ll b) {
return a > b;
}
bool chk(ll lim) {
rep(i, 1, n) a[i] = b[i];
ll vv = v, pos;
pos = lim;
while (pos <... | 0 | 14,762,762 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string al = "abcdefghijklmnopqrstuvwxyz";
char a;
cin >> a;
for(int i = 0; i<al.size();i++){
if(al[i]==a){
cout << al[i+1];
break;
}
}
} | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 0 | 96,216,723 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005
int main() {
... | #include<bits/stdc++.h>
#define ld long double
#define ll long long
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define ppb pop_back
#define ull unsigned long long
#define over retu... | 0 | 100,706,601 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>> ;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout<<(... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int main(){
string s;
while(getline(cin,s),s!="."){
stack<int> st;
bool ans=true;
int n=s.size... | 0 | 77,802,932 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 50,957,185 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n; cin >> n;
map<string ,int > mp;
string s; cin >> s;
mp[s]++;
for(int i=0;i<n-1;i++){
string t; cin >> t;
mp[t]++;
if(s[s.size()-1]!=t[0]){
cout << "No" << endl;
return 0;
... | 0 | 47,158,860 |
#include <bits/stdc++.h>
#include <vector>
#define fo(i, t) for(int i = 0; i < t; i++)
#define rfo(i, t) for(int i = n - 1; i > 0; i--)
#define pb push_back
using namespace std;
int main()
{
long long a;
long long result = 0;
cin >> a;
for(int i = 1; i < a; i++)
{
result += (a - 1) / i;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
int main(void) {
int a,b;
cin >> a >> b;
char grid[100][100];
rep(i,50)rep(j,... | 0 | 62,144,212 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define rreps(i,n) for(int i = n; i >= 1; i--)
#define mrep(i,from,n) for(int i = from; i < n; i++)
#define mreps(i,from,n) for(int i = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;
ll qpow(ll a, ll b, ll mod = MOD) {
ll res = 1;
while (b) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
ll dp[maxn];
int main() {
... | 0 | 35,664,477 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
int main(){
vector<int> a(3);
rep(i,3)cin>>a[i];
sort(a.begin(), a.end());
printf("%d %d %d\n",a[0],a[1],a[2]);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> v(26);
for(int i = 0; i < 4; i++) {
v[s[i]-'A']++;
}
for(int i = 0; i < 26; i++) {
if(v[i] == 1 || v[i] == 3 || v[i] == 4) {
puts("No");
return 0;
}
}
... | 0 | 3,827,581 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
char c;
cin >> c;
set<char> s = {'a', '... | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | 0 | 62,515,107 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
using namespace std;
int A, B, C;
int main() {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 1e6+5;
string s[66];
int a[66];
void solve(){
int n;
cin>>n;
for(int i=1;i<=n;i++)cin>>s[i]>>a[i];
int ans = 0;
string tar;
cin... | 0 | 62,268,531 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int N;
cin >> N;
cout << powl(N, 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
while(true){
char grade;
int m, f, r; cin >> m >> f >> r;
if(m == -1 && f == -1 && r == -1) break;
if(m == -1 || f == -1){
grade = 'F';
}
else if (m + f >= 80){
grade = 'A';
}
... | 0 | 71,585,213 |
#include<iostream>
#include<vector>
using namespace std;
const int N = 10000002;
int main(){
int n,count = 0 ;
vector<int> v(N,1) ;
v[0] = 0, v[1] = 0;
for(size_t i = 2; i < N-1;++i){
if(v[i] == 1){
for(size_t j = i*2; j < N-1;j+=i){
v[j] = 0 ;
}
}
}
while(cin >> n){
count ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k; cin>>n>>k;
vector<long long> a(n), b, c;
for (int i = 0; i < n; i++) cin>>a[i];
for (int i = 0; i < n; i++) {
long long cur = 0;
for (int j = i; j < n; j++) {
cur += a[j];
b.emplace_back(cur);
}
}
long long ans = 0;... | 0 | 98,256,555 |
#include<iostream>
using namespace std;
int main(){
int a, b;
while(cin >> a >> b){
if(a + b == 0) break;
int dp[b][a];
bool cons[b][a];
for(int i = 0; i < b; i++){
for(int j = 0; j < a; j++){
dp[i][j] = 0;
cons[i][j] = false;
... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | 0 | 4,573,935 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 100010;
const int MAXM = 200010;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for(; !isdigit(ch); ch = getchar()) if(ch=='-') f=-1;
for(; isdigit(ch); ch = getchar()) x = (x*10)+(ch^48);
return x * f;
}
int st[MAXN], ... | #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<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define ... | 0 | 84,426,882 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
const int K = 100000 + 5;
int k;
vector<PII> g[K];
queue<int> q;
int d[K], inq[K];
int main() {
scanf("%d", &k);
for (int i = 1; i < k; ++i) {
g[i].push_back(make_pair((i + 1) % k, 1));
g[i].push_back(make_pair((i * 10) % ... | #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;
ll A, B, C, K;
int main() {
cin >> A >> B >> C >> K;
if (A == B && B == C) {
cout << 0 << endl;
retu... | 0 | 42,816,319 |
#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 gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
ll digit_sum(ll a){
ll ans=0;
wh... | #include <bits/stdc++.h>
using namespace std;
int main () {
string S;
cin >> S;
vector<long> data(26);
for(int i = 0; i < S.size(); i++){
data.at(S.at(i) - 'a')++;
}
if(S.size() == 26){
for(int i = 25; i >= 0; i--){
for(int j = S.at(i) - 'a' + 1; j < 26; j++){
if(data.at(j) == 0){
... | 0 | 33,984,434 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll ans = 0, sum = 0;
rep(i, n) {
int a;
cin >> a;
sum += a;
if (a == 0) {
ans += sum / 2;
sum = 0;
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
templat... | 0 | 32,169,166 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << x << "\n";
#define debug2(x,y) cout << x << " " << y << "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
const ll mod = 1e9+7;
const int MAX = 2e5+5;
int main() {
string str;
cin >> str;
map<char,int> mp... | 0 | 23,090,587 |
#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(){
string s,t;
cin>>s>>t;
int ans=t.size();
rep(i,s.size()-t.size()+1){
int cnt=0;
rep(j,t.size()){
if(t[j]!=s[i+j]){
cnt++;
}
}
a... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using tlll=tuple<ll,ll,ll>;
... | 0 | 796,820 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define max0(a,b,c) max(max(a,b),c)
#define min0(a,b,c) min(min(a,b),c)
#define ft first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define all(v) (v).begin(),(v).end()
#define mod 1000000... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long N;cin>>N;
long long A[N+1];
for(long long i=1;i<=N;i++){
cin>>A[i];
}
long long ans=0;
vector<long long>P(N+1);
for(long long i=1;i<=N;i++){
if(A[A[i]]==i){
ans++;
}
}
ans/=2;
... | 0 | 28,892,843 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i)
{
cin >> a[i];
}
int ans = 0;
vector<int> count(110000, 0);
for (int i = 0; i < N; ++i)
{
++count[a[i]];
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
int r,g,b,n;
cin>>r>>g>>b>>n;
ll ans=0;
rep(i,n+1){
rep(j,n+1){
int k=n-i*r-j*g;
if(k<0)continue;
if((n-(i*r+j*g))%b==0)ans++;
}
... | 0 | 83,726,870 |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define dbg(x) cout<<#x<<":"<<x<<endl
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
int main(){
ll n,k;
ll a[111111],b[111111];
ll ans=0;... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 45,830,656 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
vector<string> vec = {
"dreamer",
"dream",
"eraser",
"erase"};
string string_check(int start, string s)
{
for (int i = 0; i < 4; ++i)
{
if (vec[i] == s.substr(start, vec[i].le... | #include<iostream>
#include<string>
#include<algorithm>
#include<bits/stdc++.h>
#include<math.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++)
int main(){
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
rep(i,n-1) cin >> b[i];
... | 0 | 3,493,882 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
int i,k=0;
cin>>s>>t;
if(s[0]==t[0]) k++;
if(s[1]==t[1]) k++;
if(s[2]==t[2]) k++;
cout<<k<<endl;
} | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<numeric>
#include<vector>
#include<set>
#include<map>
#include<unordered_map>
#include<stack>
#include<queue>
#include<list>
using namespace std;
typedef long long ll;
#define MOD 1000000007
class Comb{
p... | 0 | 57,192,115 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int N, K, s;
ll sum, ans;
#include <bits/stdc++.h>
using namespace std;
string to_string(string s)
{
return '"' + s + '"';
}
string to_string(const char *s)
{
... | 0 | 5,443,536 |
#include<iostream>
using namespace std;
int main(){
int a, b;
std::cin >> a >> b;
if((a*b)%2==1){
std::cout << "Odd";
}else{
std::cout << "Even";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define int ll
#define _GLIBCXX_DEBUG
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define REPD(i,n) for (int i = (n-1); i >= 0; --i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define debug(x) cerr << #x <<... | 0 | 60,587,559 |
#include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#include <iomanip>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i,n) for(int i=... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | 0 | 9,809,080 |
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define first f
#define second s
#define long long ll
#define Max 100005
int main ()
{
int n, k;
cin >> n >>k;
int e = n - k;
if (k > 1) printf ("%d", e);
else printf ("0");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
const int INF = 2e9;
const int MOD = 1e9+7;
const int MAX = 1e5+10;
const lint LNF = 2e18;
int n;
lint A[MAX], sum, ans;
int main(){
ios::sync_with_stdio(0); cin.tie(0);
cin>>n;
for(int i=1; i<=n; i++) cin>>A[i], sum^=A... | 0 | 40,693,037 |
#include <bits/stdc++.h>
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;
string s,t;
cin >> s >> t;
int flag = 0;
for(int i=0;i<s.size();i++){
if(t.at(0)==s.at(i)){
int count = 0;
for(int j=i;j<s.size();j++){
... | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = ... | 0 | 50,035,294 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sfl(i,a,n) for (int i=a;i<n;i++)
#define ufl(i,a,n) for (int i=n-1;i>=a;i--)
#define SZ(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
ll power(ll a, ll b){
ll res = 1;
for(int i = 0; i<b; i++)
res ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<utility>
#include<limits>
int main(){
int n,h;
std::cin>>n>>h;
std::vector<std::pair<int,int>> damages(n);
int Ma=-1;
int num_throw=0;
for(auto&damage : damages){
std::cin >> damage.first >> damage.second;
Ma = std::max(dam... | 0 | 24,395,603 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
int main()
{
ios_base::sync_with_stdio(false);
ci... | #include<bits/stdc++.h>
using namespace std;
const int N=1005;
int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
long long x[N],y[N];
char ch[]={'U','D','R','L'};
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>x[i]>>y[i];
int m2=0;
if((x[0]+y[0])%2==0)
{
m2=1;
for(int i=0;i<n;i++)... | 0 | 28,715,601 |
#include<bits/stdc++.h>
#define int long long
#define for0(i, n) for(int i = 0; i < (n); i++)
#define puts(x) cout << x << "\n"
using namespace std;
signed main() {
int n, k, s; cin >> n >> k >> s;
for0(i, n) {
if (i)cout << ' ';
if (i < k)cout << s;
else cout << (s + 1) % 1000000000;
}puts("");
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#... | 0 | 70,146,017 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <cstdio>
#include <iostream>
#include <cmath>
using namespace std;
#define maxn 200005
typedef long long ll;
ll l,n,T,x[200005];
ll w[200005],t[200005];
ll sum[200005],ans[200005];
ll f(ll x){
while(x<0)x+=l;
return x%l;
}
ll calc(int left,int right,int p){
if(p==1)return sum[right]-sum[left];
else re... | 0 | 11,183,661 |
#include<stdio.h>
#define MAX 100001
int main(){
int H, i;
int A[MAX];
scanf("%d",&H);
for(i=1;i<=H;i++){
scanf("%d",&A[i]);
}
for(i=1;i<=H;i++){
printf("node %d: key = %d, ",i,A[i]);
if(i/2 >= 1)printf("parent key = %d, ",A[i/2]);
if(i*2 <= H)printf("left key = %d, ",A[i*2]);
if(i*2+1 <... | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) ... | 0 | 77,755,169 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ll long long
static const int MAX = 10000;
static const ll INFTY = 1e12;
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,... | /* {:i:i:|i:i:/l/l-- --l/li:i:i|i:i:i:i}
{:rx|:i:i ィi芥ミ .ィi芥ミｉ:ｉ|ﾍ:i:i:}
. ｛ﾏ|ｉ: {::’:} {:‘::} :ｉ:i:|〉｝:/
乂|:i:| ｀¨¨¨¨´ ｀¨¨¨´ :i:ｉ:|ｼ/
ﾉ:|:i| ′ |:i:i:|ﾂ
/:/|:i:| ､ _ _ |:i:i:|
/:/ .|:i:|/ ＼ ｨ〔|:i:/
... | 0 | 3,675,715 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
int main() {
ios_base::sync_with_stdio(false);... | 0 | 21,577,590 |
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << ": " << x << endl
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int n, k;
cin >> n >> k;
cout << ((n + k - 1) / k) - (n / k) << '\n';
return 0;
} | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v,d) memset( v, d ,sizeof(v))
typedef long long ll ;
typedef unsigned long long ... | 0 | 99,626,380 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std; using ll = long long;
using ull = unsigned long long; using P = pair<int, int>;
const int INF = 1e9; const int MOD = 1000000007;
const int dx[] = {-1,0,1,0}; const int dy[] = {0,-1,0,1};
#define PI 3.141592653589793238462643383... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e18;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N,K;
cin >> N >> K;
if(K > (N-1)*(N-2)/2) {
cout << -1 << endl;
return 0;
}
int res ... | 0 | 32,984,895 |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<climits>
#include<ctime>
#include<cstring>
#include<sstream>
#define REP(i,p,n) for(int i=p;i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep_split(tok,a_str,re) for(char *tok = strto... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,co=0;
double he=0;
while(cin>>n){
he=sqrt(n);
int ser[n+1];
for(int i=2;i<=n;i++)ser[i]=1;
for(int i=2;i<=he;i++)if(ser[i]==1)for(int j=2;j*i<=n;j++)ser[i*j]=0;
for(int i=2;i<=n;i++)if(ser[i]==1)co++;
... | 0 | 146,094 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long int
#define pb push_back
#define mp12 make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,in... | #include<iostream>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<string>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<set>
#include<queue>
#include<cmath>
using namespace std;
#define LL long long
#define mod 1000000007
int N,M,ans=0;
pair<int,int>AB[111111];
priority_... | 0 | 34,428,703 |
#include <iostream>
#include <vector>
#include <set>
#define eb emplace_back
#define mp make_pair
using namespace std;
const int inf = 1000000007;
vector < int > g[100010];
int dist[100010],outgoing[100010];
void dijk(int s) {
multiset < pair< int,int> > q;
dist[s] = 0;
q.insert(mp(dist[s],s));
while (!q.empty(... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 0 | 28,237,965 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
#define endl '\n'
int main() {
ios::sync_with_stdio(0); cin.tie(0);
ll n;
cin >> n;
vector<pair<string,ll>> A(n);
for (auto& _a : A) cin >> _a.first >> _a.second;
string x;
cin >> x;
ll sum = 0;
for (int i ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 93,178,653 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#def... | #include <iostream>
#include <string>
#define int long long
using namespace std;
string sa, sb;
int T[1009][1009];
int solve(){
int sal = sa.length(), sbl = sb.length();
for(int a=0; a<=sal; a++){
for(int b=0; b<=sbl; b++){
if(a==0 || b==0){
T[a][b] = 0;
}else if(... | 0 | 15,244,459 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2000 + 5, mod = 1e9 + 7;
int fact[N], inv[N];
int add(int a, int b){
a = (a + mod) % mod;
b = (b + mod) % mod;
return (a + b) % mod;
}
ll mul(ll a, ll b){
return a * b % mod;
}
int fp(int b, int p){
if(!p) return 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 381,395 |
#include <iostream>
int main() {
int n;
std::cin >> n;
int cnt = 0;
for (int i = 1; i <= n; ++i) {
int j = i;
int keta = 0;
while (j > 0) {
j /= 10;
keta++;
}
if (keta % 2 != 0)
cnt++;
}
std::cout << cnt << std::endl;
} | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 51,358,975 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
double L;
cin>>L;
L/=3;
cout<<fixed<<setprecision(8);
cout<<L*L*L<<endl;
} | #include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=5010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
retur... | 0 | 18,022,573 |
#include <iostream>
#include <vector>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using vvll = vector<vll> ;
int main(){
ll n ; cin >> n ;
cout << 800*n-200*(n/15) << endl ;
} | #include <stdio.h>
#include <iostream>
#include <string>
#include <cstdlib>
#include <sstream>
#include <cstring>
#include <stdexcept>
using namespace std;
#define abs(N) ((N>0)?N:-1*N)
#define lt(A,B) ((A>B)?B:A)
#define gt(A,B) ((A<B)?B:A)
#define print(S) (cout << S)
#define println(S) (cout << S << endl)
struct Nod... | 0 | 82,097,555 |
#include<iostream>
using namespace std;
int main(){
long long int S;
cin >> S;
long long int x1,x2,x3,y1,y2,y3,I;
I = 1000000000;
x1=0;
y1=0;
x2=I;
y2=1;
x3 = (I-S%I)%I;
y3 = (S+x3)/I;
printf("%lld %lld %lld %lld %lld %lld\n",x1,y1,x2,y2,x3,y3);
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#defi... | 0 | 40,391,016 |
#include <iostream>
using namespace std;
int main(void){
string str;
cin >> str;
int q;
cin >> q;
for(int i=0;i<q;i++){
string word;
cin >> word;
int a,b,plen;
cin >> a >> b;
plen = b-a+1;
if(word == "print"){
cout << str.substr(a,plen) << ... | #include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (int)(a); v < (int)(b); ++v)
#define FORE(v, a, b) for(int v = (int)(a); v <= (int)(b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define RS resize
#define CLR clear
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define C ... | 0 | 44,708,813 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
vector<int> e;
void prime_factor(int num)
{
... | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> ds(n);
rep(i,n) {
int t, d;
cin >> t >> d;
--t;
ds[t].push_back(d);
}
vector<int> y0, y1;
rep(i,n) {
if... | 0 | 84,319,443 |
#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;
using ll = long long;
#pragma region Macros
#define FOR(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T> bool chmin(T &a, co... | 0 | 95,961,379 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '1')cout << 9;
else if (s.at(i) == '9')cout << 1;
else cout << s.at(i);
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int64_t LCM(int x, int y)
{
return x / __gcd(x, y) * y;
}
int f(int x)
{
int ret = 0;
while (x % 2 == 0)
{
x /= 2;
ret++;
}
return ret;
}
int main()
{
int64_t N, M;
cin >> N >> M;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
{
cin >> A... | 0 | 72,305,011 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N ; cin >> N ;
int S ; S = 0 ;
for (int i = 0 ; i < N ; i++ ){
int l, r ; cin >> l >> r ;
S += r - (l - 1);
}
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long MINUS_INF = -1LL << 60;
struct UnionFind {
vector<long long> par;
vector<long long> rank;
vector<long long> root_size;
UnionFind(long long n = 1) {
init(n);
}
void init(long long n = 1) {
par.resize(n); rank.resize(... | 0 | 51,118,518 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<cassert>
#include<numeric>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(i... | 0 | 64,618,207 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#inclu... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define fs first
#define sc second
const LL MOD = 1e9+7;
template<class T>bool chmax(T &a, const T &b) {
if (a < b) { a = b; return true; }
return false;
}
template<class T>bool chmin(T &a, const T &b) {
if (b < a) { a = b; return true; }
... | 0 | 74,767,237 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long K,n;
cin >> n >> K;
int A[n];
for(int i=0;i<n;i++){
cin >> A[i];
}
long long srn=0,drn=0,ans=0;
for(int i=0;i<n;i++){
for (int j=i+1;j<n;j++){
if(A[i]>A[j]) srn++;
}
}
for(int i=0;i<n;i++){
for (int j=0;j<n;j++){... | #include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define fillarray(array, value, begin, end) fill((array) + (begin), (array) +... | 0 | 56,181,528 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int mod=1000000007;
const double PI = 3.14159265359;
#define mxe(v) *max_element(v.begin(),v.end())
#define mne(v) *min_element(v.begin(),v.end())
#define INF 1000000000000
#define pb push_back
#define pf push_front
#define... | 0 | 56,388,821 |
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m; i<n; i++)
#define co(n) cout << n << endl
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a+b>=c) co("Yes");
else co("No");
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | 0 | 9,897,834 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
using namespace std;
int main() {
string key = "keyence", S;
bool ans = false;
cin >> S;
int i = 0, j = 0;
for (i = 0; i <= S.size();... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int main(){
int n,m;cin >> n >> m;
vector<int> s(n),t(m);
for(int i=0;i<n;i++){
cin >> s[i];
}
for(int j=0;j<m;j++){
cin >> t[j];
}
vector<vector<ll>> dp(n+1,vector<ll>(m+1)),sum(n+1,vector<ll>(m+1));
dp[0][0... | 0 | 22,979,410 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | 0 | 70,225,838 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,K;
cin>>A>>B>>C>>K;
int res=0;
while(B<=A){
B*=2; res+=1;
if(res>K){cout<<"No"<<endl; return 0;}
}
while(C<=B){
C*=2; res+=1;
if(res>K){cout<<"No"<<endl; return 0;}
}
cout<<"Yes"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main(){
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A... | 0 | 84,167,012 |
#include<iostream>
std::string condition(int a, int b) {
std::string cond;
if (a > b) {
cond = ">";
} else if (a < b) {
cond = "<";
} else {
cond = "==";
}
return cond;
}
int main() {
int a, b;
char delimiter = ' ';
std::cin >> a >> b;
std::cout <<
'a' << delimiter << condition(a, b)... | #include <iostream>
#include <vector>
using namespace std;
int h,w,k;
int sum_matrix(const vector<vector<int>>& vv){
int count=0;
for(const auto& v : vv){
for(const auto& e : v){
count += e;
}
}
return count;
}
int main(){
cin >> h >> w >> k;
vector<vector<int>> data(... | 0 | 29,588,536 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string arr;
const int q = 1e5+5;
ll dp[q][150][2];
int d;
ll getsum(int ind, int n, int sum, bool flag, int use){
if(ind>=n) return use==d;
int limit=9;
if(!flag) limit= arr[ind]-'0';
if(dp[ind][use][flag]!=-1) return dp[ind][use][flag... | #include <iostream>
using namespace std;
int debtAfterWeek(int n)
{
int debt = 100000;
int last3digits;
for (int i = 0; i < n; i++)
{
debt *= 1.05;
last3digits = debt % 1000;
debt -= last3digits;
if (last3digits != 0)
{
debt += 1000;
}
}
return (int)debt;
}
int main()
{
int n;
cin >> n;
cout << ... | 0 | 55,109,876 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define SQ(a) (a)*(a)
template <class T, class ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <time.h>
#define ll ... | 0 | 47,710,637 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <iostream>
int* countingSort(int* a, int n, int max)
{
int* c = (int*)malloc(max * sizeof(int));
for (int i = 0; i < max; i++) {
c[i] = 0;
}
for (int i = 0; i < n; i++) {
c[a[i]]++;
}
for (int i = 1; i < max; i++) {
c[i] += c[i - 1];
}
int* sorted = (int*)malloc((n + 1) * siz... | 0 | 20,520,871 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.