code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
long long k;
cin >> s >> k;
char ans = '1';
int l = s.size();
for(int i = 0; i < l; i++){
ans = s.at(i);
if(ans != '1') break;
if(i == k-1) break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <queue>
using namespace std;
using P = pair<int,int>;
int main() {
int n; cin >> n;
vector<P> red(n);
vector<P> blue(n);
for(int i=0; i<n; i++){
cin >> red[i].second;
cin >> red[i].first;
}
for(int i=0; i<n; i++){
cin >> blue[i].first;
... | 0 | 46,248,399 |
#include<iostream>
using namespace std;
typedef long long ll;
int main() {
ll x, y; cin >> x >> y;
int ans = 0;
for (ll i = x; i <= y;) {
i *= 2; ans++;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | 0 | 73,873,268 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
long long int a, b, c;
cin >> a >> b >> c;
long long int k;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int H, W, D, Q;
int A[301][301];
int dp[300 * 300 + 1];
int L[100000], R[100000];
int main(int argc, char* argv[]) {
cin >> H >> W >> D;
unordered_map<int, pair<int, int>> map;
for (int i = 1... | 0 | 74,364,377 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int, int>;
#define LARGE 1000000007
int main() {
int n;
cin >> n;
vector<P> p(n);
rep(i, n) {
int a;
cin >> a;
p[i] = make_pair(a, i+1);
}
... | #include <iostream>
#include <cmath>
using namespace std;
#define ll long long
int res(ll n){
int ans =0;
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
int fac =0;
while(n%i==0){
n/=i;
fac++;
}
ans+=(sqrt(8*fac+1)-1)/2;
}... | 0 | 49,932,888 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M; cin >> N >> M;
vector<vector<ll>> v(8, vector<ll>(N));
for (int i = 0; i < N; i++)
{
ll x, y, z; cin >> x >> y >> z;
v[0][i] = x + y + z;
v[1][i] = x - y + z;
v[2][i] = x + y - z;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s,s1;
int n,i;
cin>>n;
while(n--){
cin>>s>>s1;
int w1=1,w2=0,w3=0,w4=0;
int sum=0;
for(i=0;i<s.size();i++){
if(s[i]>='2'&&s[i]<='9')w1=s[i]-'0';
else if(s[i] == 'm'){sum+=1000*w1;w1=1... | 0 | 66,391,442 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | #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 | 69,081,051 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int X;
cin >> X;
for (int K = 1;; K++) {
if ((X * K) % 360 == 0) {
cout << K << "\n";
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
const int MAXH { 10010 }, MAXN { 1010 };
const ll MOD { 1000000007 }, oo { 1LL << 35 };
ll st[MAXH][MAXN];
ll dp(int h, int i, int N, const vector<ii>& xs)
{
if (h <= 0)
return 0;
if (i == N)
return h < ... | 0 | 22,500,919 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int A, B;
cin >> A >> B;
int t8 = 0, t10 = 0;
int x = 10;
while (t8<=A && t10 <=B) {
t8 = x*8/100; t10 = x/10;
if (t8==A && t10==B) {
cout << x << endl;
return 0;
}
x++;
}
c... | #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 | 74,611,728 |
#include <iostream>
#include <iomanip>
#include <string>
using namespace std;
int n, nr1, nr2;
string s1, s2;
int main(){
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s1 >> s2;
if (s1 > s2) {
nr1 += 3;
}
if (s2 > s1) {
nr2 += 3;
}
if (s1 == s2) {
nr1++;
nr2++;
}
}
cout << nr1 << ' ' << ... | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<... | 0 | 8,254,201 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<n;i++)
int main(){
ll N; cin>>N;
vector<ll>A(N+1);
vector<ll>d(N);
ll sum=0;
rep(i,N){
cin>>A[i];
sum+=A[i];
}
A[N]=A[0];
if(sum%((N+1)*N/2)==0){
ll K=sum/((N+1)*N/2);
rep(i,N){
d[i]=A[i+1]-A[i];
d[i]-... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> P;
typedef unsigned long long i... | 0 | 41,588,706 |
#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
if(n>=400 && n<=599)
cout << 8;
if(n>=600 && n<=799)
cout << 7;
if(n>=800 && n<=999)
cout << 6;
if(n>=1000 && n<=1199)
cout << 5;
... | #include<iostream>
using namespace std;
int main(){
int m, f, r;
while(1){
cin >> m >> f >> r;
if(m==-1 && f==-1 && r==-1) break;
else if(m==-1 || f==-1) cout << "F" <<endl;
else if((m+f) >= 80) cout << "A" <<endl;
else if(((m+f) >= 65) && ((m+f) < 80)) cout << "B" <<endl... | 0 | 42,034,476 |
#include<stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (!(a - b)) {
printf("a == b\n");
}
else if (a - b > 0) {
printf("a > b\n");
}
else printf("a < b\n");
return 0;
} | #include<bits/stdc++.h>
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 perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 21,064,561 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sep ' '
#define endl ... | #include <iostream>
using namespace std;
int main()
{
int n;
int a,b,c,d;
cin>>n;
int floor[4][3][10];
for(int i=0;i<4;i++){
for(int s=0;s<3;s++){
for(int t=0;t<10;t++){
floor[i][s][t]=0;
}
}
}
for(int i=0; i<n; i++) {
cin>>a>>b... | 0 | 16,734,865 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); ++i)
using ll = long long;
bool is_prime(long long n) {
if (n <= 1) return false;
for (long long p = 2; p * p <= n; ++p) {
if (n % p == 0) return false;
}
return true;
}
vector<long long> calc_divisor(long long n) ... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>P;
int main(){
int N,M;
while(1){
cin >>N>>M;
if(N==0 && M==0)break;
P a[N];
for(int i=0 ; i < N ; i++){
cin >>a[i].second>>a[i].first;
}
sort(a,a+N,greater<P>());
for(int i=0 ; i < N ; i++){
int d=min(M,a[i].s... | 0 | 6,882,426 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#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 <cst... | #include<iostream>
using namespace std;
int main(){
int a,b,n,i,j,x[40],y[40],m[17][17];
while(cin>>a>>b,a*a+b*b){
for(i=1;i<=a;i++)
for(j=1;j<=b;j++)m[i][j]=-1;
cin>>n;
for(i=0;i<n;i++){
cin>>x[i]>>y[i];
m[x[i]][y[i]]=0;
}
m[1][1]=1;
for(j=2;j<=b;j++)if(m[1][j]==-1)m[1][j]=m[1][j-1];
for(i=2;i<=a;i++){
if(m[i][1]==-1... | 0 | 71,124,178 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,n;
cin>>x>>n;
vector<int> p(n,0);
for(int i=0;i<n;i++){
cin>>p[i];
}
int min=51;
int ans=0;
for(int i=0;i<=101;i++){
if(min>abs(x-i)){
bool flag=true;
for(int j=0;j<n;j++){
... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | 0 | 94,653,682 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) std::cerr << #x << " : " << (x) << std::endl;
int ma... | #pragma once
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <numeric>
using namespace std;... | 0 | 71,611,861 |
#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 a, b;
cin >> a ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
Int N, K;
vector<Int> A(200010, 0), S(200010, 0);
Int id(Int i){
Int res = S[i] - i;
if(res >= 0){
res %= K;
} else {
... | 0 | 46,590,203 |
#include <stdio.h>
int fib(int);
int fibo[45];
int main(){
int n,i;
for(i=0;i<45;i++)fibo[i]=-1;
scanf("%d",&n);
printf("%d\n",fib(n));
return 0;
}
int fib(int n){
if(n==0 || n==1)return fibo[n]=1;
if(fibo[n]!=-1)return fibo[n];
return fibo[n]=fib(n-1)+fib(n-2);
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
string str;
vector<string> strs;
int n;
cin >> str >> n;
for (int i=0;i<n;i++) {
string op;
int a, b;
cin >> op >> a >> b;
if (op == "replace") {
string tmp;
cin >> tmp;
... | 0 | 6,412,358 |
#include <bits/stdc++.h>
#define l_ength size
const int inf = (1<<30);
using ll = long long;
using namespace std;
int main(){
int n, mod; cin >> n >> mod;
vector<ll> a(n), sum(n+1);
for( auto &k : a ){
cin >> k;
--k;
}
sum[0] = 0;
for( int i = 0; i < n; ++i ){
sum[i+1] = sum[i]+a[i];
sum[i+1] %= mod;
}
... | #include <iostream>
char map[6][6] = {};
int main()
{
int H, W, K;
std::cin >> H >> W >> K;
int n_black = 0;
for (int j = 0; j < H; j++)
{
for (int i = 0; i < W; i++)
{
std::cin >> map[j][i];
if (map[j][i] == '#')
n_black++;
}
}
... | 0 | 24,639,683 |
#include <bits/stdc++.h>
using namespace std;
int main(){
constexpr int Nbit= 1e5;
int N,M;
cin >> N >> M;
bitset<Nbit> ACs;
vector<int> WAs(N);
int prob; string status;
for(int i=0; i<M; i++){
cin >> prob >> status;
prob--;
if(status=="AC"){
ACs.set(prob);
}
else if(!ACs.test(p... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint MOD = 1e9+7;
signed main(){
lint n; cin >> n ;
vector<lint> a(n), b(n);
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++) cin >> b[i];
vector<pair<bool, int> > data1(n), data2(n);
data1[0] = make_pair(true, a[0... | 0 | 6,939,008 |
#include<bits/stdc++.h>
#define mino "frequency"
#define ll long long
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define matrix vector<vector<ll>>
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define Down(i,a,b) for(int i=a; i>=b; i--)
#define FOR_(i,a,b) for(int i=a; i<b; i++)
#define t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 2,261,322 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> dp(n+1,INF);
dp[0] = 0;
for(int i = 1; i <= n; i++) {
dp[i] = dp[i-1]+1;
for(int j = 1; pow(6,j) <= n; j++) {
i... | #include "bits/stdc++.h"
#include <unordered_set>
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1;i >= 0; i--)
#define ALL(a) (a).begin(),(a).... | 0 | 47,563,866 |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
const int INF = 100000;
void chmin(int &a, int b) { if (a > b) a = b; }
int N, A, B, C;
vector<int> L;
int rec(int i, int a, int b, int c) {
if (i == N) {
if (!a || !b || !c) return INF;
return abs(a - A) + abs(b - B) + abs... | #include <iostream>
using namespace std;
const char grade(int m, int f, int r)
{
int s = m+f;
if(m == -1 || f == -1)
{
return 'F';
}
else if(s >= 80)
{
return 'A';
}
else if(s >= 65 && s < 80)
{
return 'B';
}
else if(s >= 50 && s < 65)
{
re... | 0 | 6,575,093 |
#include <bits/stdc++.h>
typedef long long ll;
const int N = 105;
char s[N];
int k, n, tot, len[N];
ll ans;
int main()
{
bool is = 1;
scanf("%s%d", s + 1, &k); n = strlen(s + 1);
for (int i = 1; i <= n; i++) if (s[i] != s[1]) is = 0;
if (is) return std::cout << 1ll * n * k / 2 << std::endl, 0;
for (int i = 1, c = ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
string s,c;
int sum=0,r,l=0;
bool f=true;
cin>>s;
r=s.size()-1;
for(int i=0;i<s.size();i++){
if(s[i]!='x') c+=s[i];
}
int o=0,p=c.size()-1;
while(o<p){
if(c[o]!=c[p]){
f=false;
break;
}
o++;
... | 0 | 50,653,395 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 100001;
int arr[N][3];
int dp[N][2][2][2];
ll findans(bool f, bool s, bool t, int n){
if(n < 0) return 0;
ll ans = 0;
if(dp[n][(int)f][(int)s][(int)t]) return dp[n][(int)f][(int)s][(int)t];
if(f && s){
ans = max(findans(0, 1, 1, n -... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K, X, Y;
cin >> N;
cin >> K;
cin >> X;
cin >> Y;
int ans = 0;
if (N > K)
{
ans = K * X + (N - K) * Y;
}
else
{
ans = N * X;
}
cout << ans << endl;
return 0;
} | 0 | 15,073,785 |
#include <bits/stdc++.h>
#define Maxn 100007
using namespace std;
int n,m,v,p;
int a[Maxn],b[Maxn];
bool check(int id)
{
int tmp=a[id]+m;
int now=0;
for (int i=1;i<=n;i++)
if (i!=id) b[++now]=a[i];
long long res=1LL*p*m;
for (int i=p;i<=now;i++)
{
if (b[i]>tmp) return false;
... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
cons... | 0 | 71,191,484 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define ll long long
#define INF 1e+9
int n;
void warshall_floyd(vector<vector<int> > &d) {
for(int k = 0; k < n; k++) {
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
d[i][j] = min(d[i... | 0 | 66,767,620 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
long lon... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | 0 | 5,874,557 |
#include<iostream>
using namespace std;
int main()
{
int a,b,s;
cin>>a>>b;
s=a+b;
if(s%2==0){cout<<s/2;}
else{cout<<(s/2)+1;}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define vt vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
signed main() {
... | 0 | 40,533,429 |
#include <bits/stdc++.h>
#define INF 2e9
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int ctoi(const char c){
if('0' <= c && c <= '9') return (c-'0');
return -1;
}
int main(){
int D;
cin >> D;
if(D==25) cout << "Christmas" << endl;
if(D==24) c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector <int> a(n);
ll sum=0;
for(int i=0;i<n;i++){
cin >> a[i];
sum+=a[i];
}
ll pre=0,ans=1e18;
for(int i=0;i<n-1;i++){
pre+=a[i];
ans=min(ans,abs(2*pre-sum));... | 0 | 45,869,650 |
#include <bits/stdc++.h>
#include <numeric>
#include <algorithm>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP1(i, n) for(int i = 1; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std... | #include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | 0 | 17,524,122 |
#include<iostream>
#define N 999999
int p[(N+1)/2];int m[N+1];void k();using namespace std;main(){int n;p[0]=2;m[1]=0;m[2]=1;k();while(cin>>n){cout<<m[n]<<endl;}}void k(){int i,j,e=1;for(i=3;i<N+1;i++){for(j=0;p[j]*p[j]<=i;j++){if(i%p[j]==0){goto tag;}}p[e]=i;e++;tag:m[i]=e;}} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
constexpr ll INF = ll(1e+18) + 1;
ll dist(ll a, ll b, ll c, ll d) {
return abs(a-c) + abs(b-d);
}
int main() {
int N, K;
long double ans = 0;
int j;
cin >> N >> K;
rep(i, N) {
... | 0 | 22,762,521 |
#include <bits/stdc++.h>
#include <assert.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
long long ans = 0;
while (true)
{
long long tmp = 0;
bool ok = false;
for (int i = 0; i < N; i++)
{
tmp += a[i] / N;
... | #include <iostream>
#include <cstring>
#include <string.h>
#include <cstdio>
using namespace std;
int main(){
char c[1111];
int len=0;
int k=0;
char maxc;
int iti[1111]={0};
char ans[1111];
int sai=0;
char ans1[1111];
char cpy[1111][1111];
while(scanf("%s",c)!=EOF){
if(len<strlen(c)){
len=... | 0 | 4,000,184 |
#include <iostream>
using namespace std;
int main(void){
int x[3],temp;
cin >> x[0] >> x[1] >> x[2];
for (int i = 0; i < 3-1; i++){
for (int j = 3-1; j>i; j--){
if (x[j] < x[j-1]){
temp = x[j];
x[j] = x[j-1];
x[j-1] = temp;
}
}
}
cout << x[0] << " " << x[1] << " " << x[2] << "\n";
return 0;... | #include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<tuple>
#include<bitset>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define req(i,n) for(ll i ... | 0 | 85,425,884 |
#include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
int main()
{
int N;
cin >> N;
double res=0;
rep0(i,N){
double a;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int INF = 1e9;
struct mint {
ll x;
mint(ll x=0):x(x%mod){}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod... | 0 | 49,911,567 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n,m,a[100];
cin>>n>>m;
int popu=0; double sum_a=0;
rep(i,n){
int A;
cin>>A;
a[i]=A;
sum_a+=a[i];
}
rep(i,n){
if(a[i] >= sum_a/(4*m)){
popu++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n,d;
cin >> n >> d;
vector<vector<int>> x(n,vector<int>(d));
rep(i,n){
rep(j,d){
cin >> x[i][j];
}
}
int ans = 0;
rep(i1,n){
... | 0 | 90,659,049 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#in... | #include <bits/stdc++.h>
using namespace std;
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
return ret;
}
int main() {
int ... | 0 | 10,645,388 |
#include <iostream>
using namespace std;
struct card{
char mark;
int value;
};
void BubbleSort(struct card c[], int N){
for(int i = 0; i < N; i++){
for(int j = N-1; j > i; j--){
if(c[j].value < c[j-1].value){
card tmp = c[j];
c[j] = c[j-1];
c[j-1] = tmp;
}
}
}
}
void SelectionSort(struct ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vec;
typedef vector<vec> mat;
int n,B[200001];
void inout(int x){
string s;
cout<<x<<"\n";
cin>>s;
if(s=="Vacant") B[x]=-1;
if(s=="Male") B[x]=1;
... | 0 | 100,011,030 |
#include <bits/stdc++.h>
using namespace std;
struct Taste {
long long hi;
vector<long long> ds;
Taste(): hi(0), ds(0) {}
void add(long long d) {
ds.push_back(d);
hi = max(hi, d);
}
bool operator<(const Taste& o) const {
return hi > o.hi;
}
};
struct TopK {
int k;... | #include <iostream>
using namespace std;
struct card{
char suit;
int value;
};
void selection(struct card a[], int n){
for (int i=0; i<n; i++){
int minj=i;
for (int j=i; j<n; j++){
if (a[j].value <a[minj].value){
minj=j;
}
}
swap(a[i],a... | 0 | 99,858,276 |
#include"bits/stdc++.h"
using namespace std;
int n;
string A;
bool open[(int)2e5+5];
int main(){
cin>>n>>A;
long long ans=1;
int x = 0;
const long long MOD=1e9+7;
if(A[0]!='B') {cout<<0; return 0;}
for(int i=0;i<2*n;++i){
if(i==0||( (A[i]!=A[i-1]&&open[i-1]) || (A[i]==A[i-1]&&!open[i-1]) )){
open[... | #include<cstring>
#include<iostream>
#include<cstdio>
#include<vector>
#include<set>
#include<cmath>
#include<sstream>
#include<cassert>
#include<string>
#include<algorithm>
#define rep(i,n) for(int i = 0;i<n;i++)
#define Rep(i,n) for(int i = 1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define fi first
#defin... | 0 | 72,632,638 |
#include <iostream>
using namespace std;
string judge(int x, int y);
int main()
{
int a,b;
cin >> a >> b;
cout << judge(a,b) << endl;
return 0;
}
string judge(int x, int y)
{
if(x > y) return "a > b";
else if(x < y) return "a < b";
else return "a == b";
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define fi first
#define se second
#define pb push_back
#define int long long
int a[5], b[5];
signed main() {
ios_base::sync_with_stdio(false); cout.tie(0);
FOR(i, 1, 4) {
int x; cin >> x;
if(x ==... | 0 | 64,933,548 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int yakusu(int n) {
int ret = 0;
for (int i = 1; i <= n; i++) {
if (n % i == 0) ret++;
}
return ret;
}
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T, typename C> void printset(const multiset<T, C> &s) {
for (auto &t : s) {
cout << t << " ";
}
cout << endl;
}
int main() {
ll N, M;
vector<vector<ll>> jobs(100001);
cin >> N >> M;
for (ll i = 0; i < N; i++) {
... | 0 | 74,649,486 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vecto... | 0 | 596,985 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define ep emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int main() {
int n;
long long int a,b,a1,b1,t;
bool flag1=true,flag2=false;
cin>>n;
long long int x[n],y[n],k[n];
int a2[32],b2[32];
vector<long long int> v;
for(int i=0;i<n;i++){
cin>>... | 0 | 23,178,025 |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <array>
#include <iomanip>
#include <unordered_set>
#define ll long long
#define ar array
#define AC ios_base::sync_with_stdio(0);
using namespace std;
const int N = 1e5;
const int M = 1e9+7;
int n, k;
ll dp[105][N+5];
int arr[105];
int... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | 0 | 2,281,647 |
#include<iostream>
using namespace std;
int main(){
int x,y;
while(1){
cin >> x >> y;
if((x==0)&&(y==0)) break;
if(x <= y){
cout << x << " " << y <<endl;
}
else{
cout << y << " " << x <<endl;
}
}
} | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
using namespace std;
int main() {
const long long int mod = 1000000007,INF=50000000000000;
map<long long in... | 0 | 74,113,975 |
#include<bits/stdc++.h>
using namespace std;
int n,m,sum=0;
bool vis[200005];
vector<int> fr[200005];
void dfs(int a)
{
vis[a]=true;
sum++;
for(int i=0;i<fr[a].size();++i)
if(!vis[fr[a][i]])
dfs(fr[a][i]);
}
int main()
{
cin>>n>>m;
for(int i=0;i<m;++i)
{
int x,y;
... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
using P = std::pair<ll, int>;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(2e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
v... | 0 | 24,987,472 |
#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;
int gcd(int a, int b) { return b != 0 ? gcd(... | #include<cstdio>
using namespace std;
int main()
{
int n,k,ans;
while(scanf("%d%d",&n,&k)!=EOF)
{
ans=k;
while(--n)
{
ans*=k-1;
}
printf("%d\n",ans);
}
return 0;
} | 0 | 41,492,973 |
#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ll long long
int main()
{
set<string> st;
int N;
string c, v;
cin >> N;
REP(i, N)
{
cin >> c >> v;... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x&&x<b)
#define out(ans) cout << ans << endl
typedef pair<ll,ll>P;
const ll mod=1e9+7;
const int INF = 1000000;
const double PI=3.141... | 0 | 62,018,178 |
#include<bits/stdc++.h>
using namespace std;
#include<vector>
namespace Union_find {
class union_find {
int n;
std::vector<int> par;
std::vector<int> rank;
std::vector<int> _size;
public:
union_find(int _n);
int find(int x);
void unite(int x, int y);
bool same(int x, int y) { return ... | #include <cstdio>
int n,k,a;
long long dp[100001];
int main(){
while(scanf("%d%d",&n,&k), n != 0){
for(int i = 0; i <= n; i++) dp[i] = 0;
for(int i = 1; i <= n; i++){
scanf("%d",&a);
dp[i] = dp[i-1] + a;
}
long long mx = 0;
for(int i = 0; i <= n - k; i++){
long long sum = dp[i+k] - dp[i];
if(sum ... | 0 | 68,882,277 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
string prev, curr;
set<string> hist;
cin >> prev;
hist.insert(prev);
rep(i, N - 1) {
cin >> curr;
if (prev[prev.size() - 1] != curr[0] || hist.count(cur... | #include<bits/stdc++.h>
using namespace std;
using lint = long int;
using P = pair<lint, lint>;
#define MOD 1000000007
lint X, Y;
lint inv_mod(lint x, lint y){
lint a = x, b = y, u = 1, v = 0;
lint d;
while(b){
d = a / b;
a -= b * d; swap(a, b);
u -= v * d; swap(u, v);
}
u %= y;
if... | 0 | 28,312,446 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,X;
cin >> A >> B >> X;
if(A > X){
cout << "NO";
}else{
X-A<=B?cout<<"YES":cout<<"NO";
}
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#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++)
using ll = long long;
using vec = vector<ll>;
using vec2 = vector<vector<ll>>;
ll inf = pow(2, 62);
int main()
{
ll h, w, k;
cin >> h >>... | 0 | 100,672,158 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
string S; cin >> S;
ll K; cin >> K;
ll N = S.size();
if (N == 1) {
cout << K / 2 << endl;
return 0;
}
bool same = true;
rep(i,N) if (S[0] != ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
int n, m; cin >> n >> m;
V<bool> b(n + 1, false);
for(int i = 0; i < m; i++){
in... | 0 | 9,525,370 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | #include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main()
{
string s;
cin>>s;
int count=0,count1=0;
if(s.size()==1)
cout<<"0"<<endl;
else
{
for(int i=0;i<s.size();i++)
{
if((s[i]=='0'&&i%2==0)||(s[i]=='1'&&i%2==1))
{
... | 0 | 99,757,113 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
ll res=N;
for(ll a=1;a*a<=N;a++){
if(N%a==0)res=min(res,a+N/a-2);
}
cout<<res;
return 0;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int INF = 1000000007;
int MAXC = 200000;
int dp[30][200000];
int main(){
int n,m;
int c[30];
cin >> n >> m;
rep(i,m){
cin >> c[i] ;
}
sort(c,c+m);
rep(j,30){
... | 0 | 800,918 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
const double pi = acos(-1);
ll pow_mod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y... | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
using namespace st... | 0 | 31,028,182 |
#include <bits/stdc++.h>
using namespace std;
namespace {
int H, W, d;
void input() {
cin >> H >> W >> d;
}
void solve() {
auto T = 2000;
auto F = vector<string>(H, string(W, '0'));
auto s = "RGBY";
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; ... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 72,043,296 |
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define ok puts("ok")
#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define vi vector < int >
#define pi pair < int, int >
#defin... | #include <algorithm>
#include <iostream>
#include <cstdio>
#define int long long
using namespace std;
inline int read(){int tot=1;char c=getchar();while(c!='-'&&(c<'0'||c>'9'))c=getchar();if(c=='-')tot=-1,c=getchar();
int sum=0;while(c<='9'&&c>='0')sum=sum*10+c-'0',c=getchar();return sum*tot;}
void wr(int x){if(x<0){pu... | 0 | 71,547,077 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include <bits/stdc++.h>
#define ll long long int
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll INF = 922337203685477;
#define pb push_back
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
vector<ll>adj[100005];
int m... | 0 | 13,861,703 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 0 | 51,448,051 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int now = 1;
for (int i = 0; i < n; i++) {
if (now < k) {
now = now * 2;
} else {
now += k;
}
}
cout << now << endl;
return 0;
} | 0 | 11,698,180 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
int a[n],b[n];
rep(i,n) cin>>a[i];
rep(i,n) cin>>b[i];
ll cnt=0;
rep... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
double bitToJPN(double bit) {
return bit * 380000.0;
}
int main() {
fastIO;
int n;
cin >> n;
... | 0 | 75,521,067 |
#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 K;
string S;
cin >> K >> S;
if (S.size() <= K)
cout << S << endl;
else {
S = S.substr(0, K);
cout << S + "..." << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
using P = pair<int,int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b){return b!=0 ? gcd(b, a%b) : a;}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
int main()... | 0 | 94,437,154 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #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 | 16,246,773 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define tc(t) int t; cin>>t; while(t--)
#define f(n) for(int i=0;i<n;i++)
#define endl "\n"
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int apple,peice;
cin>>apple>>peice;
int answer=apple*3+ peice;
cout<<answer/... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<set>
using namespace std;
typedef long long ll;
#define N 100010
set<int> s;
set<int>::iterator it,tmp;
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c... | 0 | 8,829,991 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <cstdlib>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functiona... | #include <bits/stdc++.h>
using namespace std;
bool cmp(long long a, long long b)
{
return a>b;
}
int main()
{
int n,m;
cin>>n>>m;
long long mx = -(99999999);
long long arr[9999][3];
for(int i=1; i<=n; i++){
for(int j=0; j<3; j++)cin>>arr[i][j];
}
for(int i=0; i<8; i++){
v... | 0 | 40,873,748 |
#include<iostream>
#include<cstdio>
#include<math.h>
#include<algorithm>
using namespace std;
int main()
{
int sum,m;
while(1)
{
cin>>m;
if(m==0)
{
break;
}
m=1000-m;
sum=m/500+(m%500)/100+(m%500%100)/50+(m%500%100%50)/10+(m%500%100%50%10)/5+(m%500%100%50%10%5);
cout<<sum<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS std::cin.tie(0);std::ios_base::sync_with_stdio(false)
#define ll long long
#define Fi first
#define Se second
#define Pb push_back
#define vi vector<int>
#define vp vector<pair<int,int>>
#define vvi vector<vector<int>>
#define v... | 0 | 23,210,162 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long l,r;
cin>>l>>r;
if(r-l>=2019)cout<<0<<endl;
else {
long long kotae=LLONG_MAX;
for(long long i=l;i<r;i++){
for(long long j=i+1;j<=r;j++){
kotae=min(kotae,(i%2019*j)%2019);
}
}
cout<<kotae<<endl;
}
return 0... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int N;
int main(int argc, char* argv[]) {
cin >> N;
unordered_map<int, int> map;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (map.find(a) != map.cend()) {
map[a]++;
... | 0 | 17,684,952 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int X, N;
cin >> X >> N;
vector<int> p(N);
rep(i, N) cin >> p[i];
if (N == 0) {
cout << X << endl;
return 0;
}
for (int i = 0; i <= N; i++) {
auto it2 = find(p.... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
if (scanf("%d %d", &n, &k) < 2) exit(1);
vector<int> h(n);
for (int i = 0; i < n; i++) {
if (scanf("%d", &h[i]) < 1) exit(1);
}
vector<int> a = h;
sort(a.begin(), a.end());
map<int, int> id;
map<int, int> res... | 0 | 1,206,037 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main(){
int n, m; cin >> n >> m;
vector<P> pos,... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
int abNum = 0;
int aNum = 0;
int bNum = 0;
int mNum = 0;
for(int i=0; i<n; i++){
string str;
cin >> str;
for(int j=0; j<str.length()-1; j++){
if(str[j] == 'A' && str[j+1] == 'B') abN... | 0 | 89,567,240 |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) pri... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll isPrime(int n)
{
if (n <= 1)
return 1;
if (n <= 3)
return 2;
if (n % 2 == 0 || n % 3 == 0)
return 1;
for (int i = 5; i * i <= n; i ... | 0 | 20,573,952 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main(void){
int x;
cin >> x;
cout << x * 360 / __gcd(x, 360) / x << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, a, ... | 0 | 90,335,632 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
struct edge{ll to,cost;};
const int inf = 1<<28;
const ll INF = 1LL<<53;
const int COMBMAX = 500005;
const ll MOD = 1e9+7;
#define _... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int d,x,y,S;
while (cin >> d){
S = 0;
x = 0;
while (x < 600 -d){
x += d;
y = x*x;
S += d * y;
}
cout << S << endl;
}
return 0;
} | 0 | 94,694,741 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int r,D,x;
cin>>r>>D>>x;
int cnt=0;
while(cnt<10){
x=r*x-D;
cout<<x<<endl;
cnt++;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
template<typename t1, class... | 0 | 22,613,593 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll k;
cin >> k;
ll ans[50];
for (ll q = 0; q < 50; q++)
{
ans[q] = q + k/50;
}
ll extra = k%50;
for (ll q = 0; q < extra; q++)
{
int idx = 0;
for (int w = 0; w < 50; w++)
{
if (ans[w] < ans[idx])
{
idx = w;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x)... | 0 | 8,858,511 |
#include <cstdio>
#include <iostream>
using namespace std;
#define maxn 2000005
#define ma 10005
int a[maxn],b[maxn],c[maxn];
void countingSort(int k)
{
for(int i=1;i<=k;++i)
c[a[i]]++;
for(int i=1;i<=ma;++i)
c[i]=c[i-1]+c[i];
for(int i=k;i>=1;--i)
{
b[c[a[i]]]=a[i];
c[a[... | #include <iostream>
using namespace std;
int main()
{
int X;
int t;
cin >>X;
cin >>t;
if((X-t) >= 0)
cout << X - t;
else
cout << 0;
} | 0 | 61,839,652 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,K;
cin>>A>>B>>K;
for(int i=0;i<K;i++){
if(i%2==0){
A -= A%2;
B += A/2;
A /= 2;
}
else{
B-=B%2;
A+=B/2;
B/=2;
}
}
cout << A <<" "<< B << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
vector<string> P, Q;
int main() {
cin >> N;
P.resize(N);
Q.resize(N);
for (int i = 0; i < N; i++) cin >> P[i];
for (int i = 0; i < N; i++) cin >> Q[i];
string X[N];
for (int i = 1; i <= N; i++) X[i - 1] = to_string(i)... | 0 | 4,553,117 |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
vector<long long> solve(vector<long long> light){
long long n = light.size();
vector<long long> table(n, 0);
for(long long i = 0; i < n; i++){
long long start = max(0ll, i - light[i]);
long long goal = min(n-1, i + ... | #include <iostream>
#include <vector>
#include <string>
#include <queue>
using namespace std;
#define INF 100000000
int main(void){
int h,w,n,ans=0;
pair<int,int> start;
cin>>h>>w>>n;
vector<string>field(h+2,string(w+2,'X'));
vector<vector<int>>d(h+2,vector<int>(w+2,0));
vector<pair<int,int>>goa... | 0 | 21,956,378 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
for(int i=1;i<s.size();i++){
if(1<i && s[i-2]==s[i]){
cout << i-1 << " " << i+1 << endl;
return 0;
}
if(s[i-1]==s[i]){
cout << i << " " << i+1 << endl;
return... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | 0 | 87,651,115 |
#include <stdio.h>
#include <stack>
int main(){
std::stack<int> st;
int n;
while(scanf("%d", &n) != EOF){
if(n == 0){
printf("%d\n", st.top());
st.pop();
}
else{
st.push(n);
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end... | 0 | 10,499,477 |
#include <bits/stdc++.h>
using namespace std;
int cnt[105];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < k; i++) {
int d;
scanf("%d", &d);
for (int j = 0; j < d; j++) {
int x;
scanf("%d", &x);
cnt[x]++;
}
}
int res = 0;
for (int i = 1; i <= n; i++) res += (cnt[i] == 0);
prin... | #include<bits/stdc++.h>
#define FastRead \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define endl "\n"
#define f for
using namespace std;
int main()
{
FastRead
ll int a,b,i;
cin>>a>>b;
... | 0 | 47,338,388 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
string S;
cin>>A>>B;
if(A%3==0||B%3==0||(A+B)%3==0) S="Possible";
else S="Impossible";
cout<<S<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int n,m,counter=0,flag=0;
long long x=1;
cin>>n;
m=n;
if(n==1){
cout<<0<<endl;
return 0;
}
for(long long int i=2;i*i<=m;i++){
if(n%i==0){
flag=1;
break;
}
}
i... | 0 | 24,359,601 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
const long long INF = 1LL << 60;
long long dp[n];
for (int i = 0; i < n; i++) dp[i] = INF;
long long in[n];
for (int i = 0; i < n; i++) cin >> in[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = max(0, i -... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin()... | 0 | 96,856,212 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
ll INF=1e10;
vector<ll>cnt(1e7);
Graph G(1e7);
void dfs(ll v,ll p){
for(auto nv:G[v]){
... | #line 1 "test/GRL_1_C.test.cpp"
#define PROBLEM "http:
#line 1 "macro/macros.hpp"
#include <bits/stdc++.h>
using namespace std;
#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 all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; ... | 0 | 37,465,821 |
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(void)
{
string str;
map<string, int> cnt;
string freq;
string maxlen;
while(cin >> str) {
int c = cnt[str]++;
if(c > cnt[freq])
freq = str;
if(str.size() > maxlen.size())
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 1e5+6;
int a[N];
void solve(){
int n;
cin>>n;
string s;
cin>>s;
int cnt = 0;
int mn = 0;
for(int i=0;i<n;i++){
if(s[i]=='(')cnt++;
else cnt--;
... | 0 | 8,379,754 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
void fnBubbleSort(vector<string> &rvsSortBbl)
{
int nSorting = 0;
bool bSorting = true;
while (bSorting)
{
bSorting = false;
for (int j = rvsSortBbl.size() - 1; j > nSorting; j--)
{
if (rvsSortBbl[j].at(1) < rvsSortB... | #include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define XinAi ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
#define int long long
using namespace std;
typedef pair<int,int> pii;
const int N = 1e13, M = sqrt(N)+10;
int np[M];
signed main()
{
for ... | 0 | 95,604,630 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PB push_back
#define MP make_pair
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<int> a(100001, 0), b(100001, 0);
int v;
for (int i = 0; i < n; ++i) {
cin >> v;
if (i & 1) a[v]++;... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | 0 | 89,116,425 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
const ll M=1000000007;
int main(){
int N,K;cin>>N>>K;
vector<ll> h(100010);
rep(i,N) cin>>h[i];
vector<ll> dp(100010,M);
dp[0]=0;
for(int i=0;i<N;i++){
for(int j=1;j<=K;... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define speed_up ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub uppe... | 0 | 50,843,051 |
#include <cstdio>
#include <cmath>
using namespace std;
int main(){
int n;
scanf("%d",&n);
long debt=100000;
for(int i=0;i<n;i++)
debt=(long)(ceil(debt*1.05/1000.0))*1000;
printf("%ld\n",debt);
return 0;
} | #include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=1e5+5;
ll a[maxn];
int main(){
ll n,m;
ll x=1;
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>a[i];
if(x>1e9) continue;
x=x*a[i]/2/__gcd(x,a[i]/2);
}
int flag=0;
for(int i=0;i<n;i++){
ll t=x*2/a[i];
if(t%2==0){
fl... | 0 | 64,650,124 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int,int> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout<<(bool x?"Yes":"No")<<endl;
#define out(s) cout<<s<<end... | #include <bits/stdc++.h>
using namespace std;
#define ms(s,n) memset(s,n,sizeof(s))
#define all(a) a.begin(),a.end()
#define present(t, x) (t.find(x) != t.end())
#define sz(a) int((a).size())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define pb push_... | 0 | 4,069,384 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (ll i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (ll i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,x) for (ll i = 0; i < x.size(); i++)
#define RREPALL(i,x) for (ll i = x.size()-1; i >= 0; i--)
#define ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | 0 | 24,386,428 |
#include<bits/stdc++.h>
using namespace std;
#define GO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
const int maxr = 1e5 + 5;
int32_t main()
{
GO;
int n;
cin >> n;
n--;
int ans = (n * (n + 1)) / 2;
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,a,b) for(int i=a;i<b;i++)
#define each(it,v) for(auto it : v)
#define mod 1000000007
#define All(v) (v).begin(),(v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vv v... | 0 | 60,909,371 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E18;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
for (auto &ai: a) cin >> ai;
a.emplace(a.begin(), 0);
a.emplace(a.end(), 0);
n += 2;
auto d = [&](int i, int j) {
return abs(a[i] - a[j]);
};
int su... | 0 | 30,293,483 |
#include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if (A == B)
cout << "Draw\n";
else if (A == 1)
cout << "Alice\n";
else if (B == 1)
cout << "Bob\n";
else if (A > B)
cout << "Alice\n";
else if (A < B)
cout << "Bob\n";
} | #include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
int N, K;
string s;
cin >> N >> K >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
rep(i, N){
if(s[i] == (char)('0' + now)) cnt++;
else {
... | 0 | 32,620,397 |
#include <iostream>
#include <iterator>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <numeric>
#include <iomanip>
#include <limits>
#include <set>
#include <map>
#include <type_traits>
#include <cstdint>
typedef long long ll;
using namespace std;
void factoring(l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.... | 0 | 66,831,817 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
bool In(){
char z;
cin>>z;
if(z=='N')return false;
return true;
}
int main(){
long long t=1000000000;
while(true){
cout<<"? "<<t<<"\n"<<flush;
if(In()){
if(t==1000000000){
long long x=500000000;
while(true){
cout<<"? ... | #include <bits/stdc++.h>
typedef unsigned long long int ull;
typedef long double ldb;
typedef long long int ll;
#define MOD1 1000000007
#define MOD2 998244353
#define PI 3.1415926535897932384626433832795
#define FILL(a, value) memset(a, value, sizeof(a))
#define BOOST ios_base::sync_with_st... | 0 | 68,393,214 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define MAXX 200010
#define PI 3.14159265358979323846264338327950
#define PB push_back
#define F first
#define S second
#define ll long long int
#define mod 1000000007
int main()
{
FAST;
string... | #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 | 29,585,541 |
#include<bits/stdc++.h>
#include<boost/variant.hpp>
using namespace std;
typedef long long ll;
typedef vector<boost::variant<bool, ll, int, string, double, char*, const char*>> anys;
template<typename T> inline void pr(const vector<T> &xs){
for(int i=0; i<xs.size()-1; i++) cout<<xs[i]<<" ";
(xs.empty()?cout:(cout<<xs... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | 0 | 69,470,844 |
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
unordered_map<int,std::vector<int>> grp;
void f(vector<pair<int,int>>& dp, int src, int par){
bool ch = false;
long long int w = 1;
long long int b = 1;
for(auto dest: grp[src]){
if(dest==par)continue;
ch = true;
f(dp,dest,src);
l... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
const std::string yes = "Yes";
const std::string no = "No";
int main(){
int n,m;
std::cin >> n;
std::set<std::string> st;
std... | 0 | 63,706,127 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.