code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int H,W,K;
cin>>H>>W>>K;
vector<vector<bool>> c(H,vector<bool>(W,0));
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
char s;
cin>>s;
if(s=='#')c[i]... | #include <iostream>
using namespace std;
int parent(int i){
return i/2;
}
int left(int i){
return i*2+1;
}
int right(int i){
return i*2+2;
}
int main(int argc, const char * argv[]) {
int n;
cin >> n;
int H[n];
for(int i=0;i<n;i++){
cin >> H[i];
}
for(int i=0;i<n;i++){
... | 0 | 75,431,102 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<string> seat(N);
int Left = 0;
int Right = N;
for (int i = 0; i < 20; i++) {
if (i == 0) {
cout << 0 << endl;
cin >> seat[0];
if (seat[0] == "Vacant") break;
} else {
int ... | 0 | 51,466,504 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep_lr(i,l,r) for(int i=(l);i<(r);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<int, int, int> T;
constexpr int INF ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); ++i)
#define repr(i, a, b) for (int i=a; i<(b); ++i)
#define reprev(i, n) for (int i=n-1; i>=0; --i)
#define reprrev(i, a, b) for (int i=b-1; i>=(a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cout << fixed <... | 0 | 19,557,354 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
string s;
cin>>s;
if(s=="AAA"||s=="BBB"){
cout << "No";
}
else{
cout << "Yes";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef map<int,int> mii;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
typedef unsigned long long int ulli;
#define int ll
#define F first
#define S second
#define endl "\n"
#define MP make_pa... | 0 | 50,569,245 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int D,T,S;
cin >> D >> T >> S;
if ((D + T - 1) / T <= S) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long n,ans = 0;
cin >> n;
long a[n],b[n],c[n],cnt=0;
for(int i=0;i<n;i++) cin >> a[i];
for(int i=0;i<n;i++){
cin >> b[i];
c[i] = a[i] - b[i];
}
for(int i=0;i<n;i++){
if(c[i]<0){
cnt += c[i];
... | 0 | 98,690,719 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;
void printv(int v[], int len) {
for (int i = 0; i < len; i++)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll ans = 1000000000000;
ll num;
bool judge;
for(ll i = 1; i*i <= N; i++){
if(N % i == 0){
num = N / i + i - 2;
ans = min(ans, num);
}
}
cout << ans << ... | 0 | 27,407,775 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
char a[n][n], b[m][m];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j)
cin >> a[i][j];
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < m; ++... | # include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
int arr[100005];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,c,k;
cin>>n>>c>>k;
for(i... | 0 | 87,656,254 |
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n, a, b;
cin >> n >> a >> b;
if(a * b < n || a + b > n + 1){
cout << -1 << endl;
return 0;
}
int c, e;
for(c = 0; c < n; c++){
if(c * a + b - c > n){
c--;
e = n - c * a ... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int, int> PII;
int main(){
int N, M;
while(cin >> N >> M){
if(N == 0 && M == 0) break;
vector<PII> route;
PII tmp;
for(int i = 0 ; i < N ; i++){
cin >> tmp.second >> tmp.first;
route.push_back(tm... | 0 | 76,802,166 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=2e5+10;
#define fi first
#define se second
#define pb push_back
int n;
int main() {
ios::sync_with_stdio(false);
cin>>n;
cout<<(n-1)/2<<endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <random>
#include <iomanip>... | 0 | 67,217,346 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pil = pair<pii,int>;
int main(){
int s,t,m;
cin >> s >> t >> m;
vector<int> a(s);
rep(i,s) cin >> a[i];
vector<int> b(t);
rep(i,t) cin >> b[i];
vec... | #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define AfterDecimal(n) cout << fixed << setprecision(n);
#define ll long long int
#define ld long double
#define all(a) a.begin(), a.end()
#define pii ... | 0 | 58,407,769 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
cin>>n;
int a[n+2];
a[0]=0;
a[n+1]=0;
rep(i,0,n) cin>>a[i+1];
int sum[n+2];
sum[0]=0;
rep(i,0,n+1){
sum[i+1]=sum[i]+abs(a[i+1]-a[i]);
... | #include<bits/stdc++.h>
using namespace std;
struct Node{
int right,left,parent;
Node(){ right=-1;left=-1;parent=-1; }
};
int main(){
int n;
scanf("%d",&n);
Node tree[n];
int id,k,c;
for(int i=0;i<n;++i){
scanf("%d%d",&id,&k);
if(k){ scanf("%d",&c); tree[id].left=c; tree[c].p... | 0 | 877,701 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define scan(argument) cin... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
long long int mod = (long long int)1000000007;
using namespace std;
void solve()
{
ll i,j,k,n;
std::cout.precision(10);
int yes=0;
string s;
cin>>s;
j=0;
k=0;
for(i=0;i<3;i++)
{
if(s[i]=='A')
{
... | 0 | 96,858,789 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll A,B;
char op;
cin>>A>>op>>B;
if(op=='+') {
cout<<A+B<<endl;
}
else {
cout<<A-B<<endl;
}
} | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) f... | 0 | 79,563,711 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <bits/stdc++.h>
using namespace std;
#define NIL -1
struct Node{ int p, l, r; };
Node tree[100005];
int n, D[100005];
void print(int id){
cout << "node " << id << ": ";
cout << "parent = " << tree[id].p << ", ";
cout << "depth = " << D[id] << ", ";
if(tree[id].p == NIL) cout << "root, [";
e... | 0 | 38,502,932 |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end(... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=1LL<<60;
ll MOD=1000000007;
int main(){
ll N;
cin >> N;
vector<ll> A(N,0);
vector<P> B(N);
for(ll i=0;i<N;i++){
... | 0 | 52,670,584 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for(int i = 0; i < N; i++) {
cin >> a.at(i);
if(a.at(i) == 2) {
}
}
int count = 0;
int x = a.at(0);
while(count < N) {
if(x != 2) {
count++;
x = a.at(x-1);
} else {
cout <... | 0 | 89,759,379 |
#ifndef COMPETITIVE_HEADER
#pragma GCC optimize ("Ofast")
#ifdef ONLINE_JUDGE
#pragma GCC target ("avx512f")
#else
#pragma GCC target ("avx")
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
... | #include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <ioman... | 0 | 21,855,223 |
#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... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
using namespace std;
... | 0 | 97,038,575 |
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <cassert>
#include <complex>
#include <iomanip>
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | 0 | 35,905,362 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; ++i) {
ll a, b;
cin >> a >> b;
v.emplace_back(a + b, b);
}
sort(v.rbegin(), v.rend());
ll x = 0, y = 0;
for (int i = 0; i < n; ++i) {
if (i % 2... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
const string YES = "Yes";
const string NO = "No";
void solve(std::string S) {
string revS = S;
reverse(revS.begin(), revS.end());
if (S == revS) {
string S2 = "";
for (ll i... | 0 | 44,505,808 |
#include <bits/stdc++.h>
#include <set>
#include <queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define ll long long
#define ld long double
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repsl(i, s, n) for (ll i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | 0 | 26,724,277 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct edge{
ll to, cost;
};
ll gcd(ll a,ll b){
if(b == 0){
return a;
}else{
r... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 62,796,039 |
#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
int solve() {
int n, m; cin >> n >> m;
vector<int> H(n);
for (int i = 0; i < n; ++i) {
cin >> H[i];
}
unordered_map<int, vector<int>> graph;
for (int i = 0; i < m; ++i) {
int x, y; cin >> x >> y;
... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin>>N;
vector<double> x(N);
vector<string> u(N);
for(int i=0;i<N;i++){
cin>>x[i]>>u[i];
}
double ans=0.0;
for(int i=0;i<N;i++){
if(u[i]=="JPY") ans+=x[i];
if(u[i]=="BTC") ans+=x[i]*380000.0;
... | 0 | 95,855,918 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #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 ... | 0 | 21,853,904 |
#include <iostream>
#include <vector>
#include <algorithm>
typedef long long ll;
using namespace std;
int main() {
ll n, t;
cin >> n >> t;
vector<ll> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l.begin(), l.end());
ll head = 0, end = 0;
ll ans = 0;
for (int i = 0; i < n - 1; i++) {
if (l[i] + t < l[... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int H, W; cin >> H >> W;
vector<string> F(H);
for (int i=0; i<H; i++) cin >> F[i];
vector<vector<int>> L(H, vector<int>(W));
vector<vector<int>> R(H, vector<int>(W));
vector<vector<int>> U(H, vector<int>(W));
vector<vector<int>> D(H, vector<in... | 0 | 20,997,777 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(),... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vec... | 0 | 99,029,366 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed
main(){
int m,n,l;
while(cin >> m >> n >> l && !(m==0 && n==0 && l==0))
{
vector<int> p(m);
for(int i=0;i<m;i++)
cin >> p[i];
sort(p.rbegin(), p.rend());
int ans = 0, sum = 0;;
for(int i=n;i<=l;i++)
{
... | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin>>A>>B>>C;
if(A>=B && A>=C) {
cout<<B+C;
} else if(C>=B && C>=A){
cout<<A+B;
} else if(B>=A && B>=C){
cout<<C+A;
}
return 0;
} | 0 | 30,698,167 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int r,D,x;
cin >> r>>D>>x;
vector<int>Ans(11);
Ans[0] = x;
for (int n = 0; n < 10; ++n) {
Ans[n + 1] = r * Ans[n] - D;
}
for (int n = 0; n < 10; ++n) {
cout << Ans[n+1] <<endl;
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ... | 0 | 61,757,627 |
#include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define rep1(i, to) for (ll i = 1; i <= (to); ++i)
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (sca... | 0 | 82,844,016 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #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 | 97,401,481 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
template <class T>
T gcd(T a, T b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
template <typename T>
set<T>... | 0 | 29,642,002 |
#include<iostream>
#include<cstdint>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int64_t X, Y; std::cin >> X >> Y;
int ans = 1;
while(X*2 <= Y){
++ans;
X*=2;
}
fin(ans);
return 0;
} | #include <iostream>
#include <string>
#define MAX_LEN (100)
using namespace std;
int all_diff(int value[]);
class Dice {
private:
int value[6];
int top;
public:
Dice(int value[]) {
for (int i = 0; i < 6; i++) {
... | 0 | 10,191,625 |
#include<bits/stdc++.h>
#include<string>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
vector<vector<int>>vec(M);
for(int i=0 ;i<M ;i++){
int k; cin >> k;
vec[i].resize(k);
for(int j=0;j<k;j++){
cin >> vec[i][j];
vec[i][j]--;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int dp[1 << 26];
int main()
{
int bit = 0;
string S;
fill_n(dp, 1 << 26, 1 << 27);
dp[0] = 0;
cin >> S;
for(int i = 0; i < S.size(); i++) {
bit ^= (1 << (S[i] - 'a'));
for(int j = 0; j < 26; j++) {
dp[bit] = min(dp[bit], d... | 0 | 75,148,448 |
#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i)... | #include <iostream>
#include <cstdio>
#include <stack>
using namespace std;
int main(){
int n,debt=100000;
cin >> n;
for(int i=0;i<n;i++){
debt*=1.05;
if((debt-(debt/1000)*1000)>0){
debt=(debt/1000 + 1)*1000;
}
}
cout << debt << endl;
return 0;
} | 0 | 20,564,889 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int h, w;
cin >> h >> w;
vector<string> grid(h);
for(int i = 0; i < h; ++i) cin >> grid[i];
vector<vector<int>> left(h, vector<int>(w, 0));
vector<vector<int>> right... | 0 | 84,300,908 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
int n;
cin >> n;
int a[n];
int ans = 0;
for(int i = 0;i < n;i++)
{
cin >> a[i];
if(i > 0 && a[i] == a[i - 1])
{
ans++;
a[i] = -1;
}
... | 0 | 61,737,229 |
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
int N;
cin >> N;
vector<vector<ll>> A(N,vector<ll>(3,0));
rep(i,N) {... | 0 | 22,541,706 |
#include<bits
using namespace std;
typedef long long ll;
#define req(i,n) for(int i = 1;i <= n;i++)
#define ALL(a) (a).begin(),(a).end()
ll n,m, ans = 0;
int main() {
cin >> n >> m; priority_queue<int> pq; int a, b,j =0;
vector<pair<int, int>> v;
req(i, n) {
cin >> a >> b;
v.push_back(make_... | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | 0 | 40,820,282 |
#include<iostream>
using namespace std;
int main() {
int n, x, i, j, k, sum;
cin >> n >> x;
while (n != 0 || x != 0) {
sum = 0;
for (i = 1; i <= n; i++) {
for (j = i + 1; j <= n; j++) {
for (k = j + 1; k <= n; k++) {
if (i + j + k == x) {
sum++;
}
}
}
}
cout << sum << endl;
ci... | #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 fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const ... | 0 | 46,748,201 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=b;i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#d... | #include <iostream>
using namespace std;
int main(){
int a , b , c;
int max , med , min;
cin >> a >> b >> c;
if(a<b){
if(a<c) {
min=a;
if (b<c){
med=b;
max=c;
} else {
med=c;
max=b;
}
} else {
min=c;
if (a<b){
med=a;
max=b;
} else {
med=b;
max=a;
}
}
} ... | 0 | 49,431,446 |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=b;i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#d... | 0 | 61,405,078 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for(int i = 0; i < n; i++)
cin >> h[i];
if(k >= n)
cout << 0;
else {
sort(h, h + n);
long long ans = 0;
for(int i = 0; i < (n - k); i++)
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll n, K;
cin >> n >> K;
vector < pair < ll, ll > > pts;
for(int i = 0; i < n; i++){
ll x, y;
cin >> x >> y;
pts.push_back({x, y});
}
sort(pts.begin(), ... | 0 | 44,500,049 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int>pii;
typedef unsigned long long ull;
#define dbg cout<<"Freak"<<endl;
#define dbgg(i) cout<<i<<endl;
#define N 1e9+7
#define pb push_back
#define pf push_front
#d... | 0 | 55,511,353 |
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
typedef pair<int, int> P;
queue<P> que;
int H, W;
char maze[1000][1000];
int r[1000][1000];
int bfs() {
for(int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
if(maze[i][j] == '#') {
que.push(P(i, j));
r[i][j] = 0... | #include<bits/stdc++.h>
#include<string>
#include<cmath>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
const ... | 0 | 54,072,421 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 0 | 65,378,849 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define repf(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#def... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | 0 | 8,503,399 |
#include <bits/stdc++.h>
using namespace std;
#define Boost ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define see(x) cerr<< __LINE__ << ": " << (#x) << " is "<< (x) <<'\n';
#define pb push_back
#define inf 1e9+8
#define mp make_pair
#define rep(i,n) ... | #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 FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<V... | 0 | 80,554,803 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 10001;
vector<int> par(N);
int find(int a){
if(par[a] == a)
return a;
else{
par[a] = find(par[a]);
return par[a];
}
}
void merge(int a, int b){
par[find(a)] = find(b);
}
int main(){
... | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
while(c<='9'&&c>='0') {x=(x<<1)+(x<<3)+c-'0'; c=getchar();}
return w==... | 0 | 51,538,335 |
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end(... | #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... | 0 | 55,248,873 |
#include <bits/stdc++.h>
#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(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
string keyence = "keyence";
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
string o,e;
cin >> o >> e;
int n = e.length() + o.length();
int ne = 0, no = 0;
string ans = "";
rep(i,n){
if... | 0 | 11,840,763 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N; cin >> N;
vector<int> X(N); for (auto &x : X) cin >> x;
int L; cin >> L;
vector<vector<int>> dp(N, vector<int>(17));
for (int a = 0; a < N; a++) {
auto it = upper_bound(begin(X), end(X), X[a]+L) - 1;
dp[a][0] = it - be... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <functional>
#include <iomanip>
#include <bitset>
#include <numeric>
#include <queue>
#include <map>
#include <cstdint>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000... | 0 | 62,620,841 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(pos,mp) for(ll pos=mp.begin();pos!=mp.end();pos -++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define NMAX 2010
const ll mod = 1000000000 + 7;
ll n, m;
ll dp[NMAX][NMAX];
ll s[NMAX], t[NMAX];
void init() {
rep(i, 0, NMAX) {
rep(j, 0, NMAX) dp[i][j] = 0;
... | 0 | 49,937,727 |
#include <bits/stdc++.h>
#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 namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
string s;
cin >> s;
int n = s.size() + 1;
int a[n];
rep(i, n) a[i] = 0;
for(int i = 0; i... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
const int MOD=1e9+7;
vector... | 0 | 3,246,737 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <utility>
#include <map>
#define maxn 200005
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n,a[maxn];
map <int,int> s;
typedef map<int,int> :: iterator Ite... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 0 | 15,837,697 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int add(int a, int b){
a = (a + mod) % mod;
b = (b + mod) % mod;
return (a + b) % mod;
}
int mul(int a, int b){
a = (a + mod) % mod;
b = (b + mod) % mod;
return 1ll * a * b % mod;
}
int fp(in... | #include <bits/stdc++.h>
using namespace std;
bool chk(char c) {
return ('2' <= c && c <= '9');
}
int conv(string s) {
int res = 0;
for (int i = 0; i < s.length(); ++i) {
if (s[i] == 'm') {
if (i == 0) res += 1000;
else {
string t = ""; t += s[i-1];
... | 0 | 63,748,722 |
#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, k; cin >> n >> k;
int tmp = n - k;
cout << ((k == 1) ? 0 : tmp) << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
int i;
string S, T;
cin >> S >> T;
int x = S.length();
int y = T.length();
int a = 0;
if (y == x + 1) {
for (i = 0; i < x; i++) {
if (S[i] != T[i]) {
a += 1;
}
}
if (a == 0) {
cout << "Yes" << "\n";
}
else {
cout <<... | 0 | 14,317,678 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
s+='T';
int x,y;
cin >> x >> y;
int n=s.size();
int direction=0;
int count=0;
vector<int> X,Y;
Y.push_back(0);
for (int i=0; i<n; i++){
if (s[i]=='F'){
... | #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 ... | 0 | 13,378,448 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <fstream>
#include <string>
#include <math.h>
#include <set>
#include <string>
#include <bitset>
#include <fstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pai... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, t; cin >> s >> t;
int dp[1001][1001] = {0};
int ls = s.size(), lt = t.size();
for (int i = 0; i <= ls; i++)
dp[i][0] = i;
for (int j = 0; j <= lt; j++)
dp[0][j] = j;
for (int i = 0; i < ls; i++) ... | 0 | 57,562,326 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int p, q, r;
cin >> p >> q >> r;
int ans = min(p+q, min(q+r, r+p));
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
... | 0 | 16,049,701 |
#include <bits/stdc++.h>
#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 FOR(i,n,m) for(int i=n;i<=(int)(m);i++)
#define RFOR(i,n,m) for(int i=(int)(n);i>=m;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
typedef long long ll;
const int INF = 1... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 73,997,023 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin>>s;
ll ans[s.size()+1],sum=0;
for(int i=0;i<s.size()+1;i++){
ans[i]=0;
}
for(int i=0;i<s.size();i++){
if(s[i]=='<'){
ans[i+1]=max(ans[i+1],ans[i]+1);
}
}
for(int i=s.size()-1;i>=0;i--){
if... | #include <iostream>
#include<vector>
#include<list>
#include<algorithm>
using namespace std;
vector<int> G[100000];
int V[100000];
list<int> ut;
int N;
void dfs(int u){
V[u]=1;
for(int i=0;i<G[u].size();i++){
int v =G[u][i];
if(!V[v])dfs(v);
}
ut.push_front(u);
}
int main(){
int s,t,... | 0 | 495,751 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=998244353,MAX=3105,INF=1<<30;
char S[MAX][MAX],ans[MAX][MAX];
int main(){
int H,W,D;cin>>H>>W>>D;
string T="RYGB";
for(int i=100;i<=2000;i+=D){
for(int j=100;j<=2000;j+=D){
... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<vector<int>> arr(n, vector<int>(3));
for(int i = 0;i<n;i++){
cin>>arr[i][0]>>arr[i][1]>>arr[i][2];
}
vector<vector<int>> dp(n, vector<int>(3));
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = ... | 0 | 36,871,185 |
#include <bits/stdc++.h>
using namespace std;
struct TopologicalSort {
vector<int> used, indeg, res;
vector<set<int>> G;
TopologicalSort() {}
TopologicalSort(int n):G(n), used(n, 0), indeg(n, 0) {}
void add_edge(int s, int t) {
G[s].emplace(t);
indeg[t]++;
}
void bfs(int s) {
queu... | #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,345,280 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin >> n, n){
int cnt = 0, co[6] = {500, 100, 50, 10, 5, 1};
n = 1000 - n;
for (int i = 0; i < 6; i++){
int a = n / co[i];
cnt += a;
n -= a * co[i];
}
cout << cnt << endl;
}
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
typedef int data_t;
typedef struct tag_node {
tag_node *before_;
data_t data_;
tag_node *next_;
} node_t;
class List
{
node_t *head_;
node_t *FindNodeFromBefore(data_t) const;
node_t *FindLastNode(void) const;
public:
List(void);
void Insert(... | 0 | 74,408,139 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
int main() {
ll X, Y; cin >> X >> Y;
... | #include <bits/stdc++.h>
using namespace std;
#define pi 2*asin(1.0)
long Comb(long N,long M){
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
for(long i=M;i>0;i--){
ans=ans/i;
}
return ans;
}
long Perm(long N,long M){
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
return ans;
}
long GCM(long A,long B)... | 0 | 96,239,021 |
#include <iostream>
long long mod_pow(long long x, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return res;
}
long long mod_inverse(long long x, long long mod) {
return mod_pow(x, mod - 2, mod);
}
long lo... | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 100001, MD = 1000000007;
int pp[N];
int main() {
string s; cin >> s;
int n = s.length();
for (int p = 1, i = 0; i < n; i++, p = p * 3LL % MD)
pp[i] = p;
long long ans = 0, cnt = 1;
for (int i = 0; i < n; i++)
if (s[i] == '1') {
ans ... | 0 | 60,676,873 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #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 (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 0 | 27,841,794 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string a, b; cin >> a >> b;
string ans;
if (a.size() < b.size()) {
ans = "LESS";
}
else if (b.size() < a.size()) {
ans = "GREATER";
}
else {
if (a < b) ans = "LESS";
else if (b < a) ans = "GREATER";
else ans = "EQUAL";
}... | #include <iostream>
using namespace std;
int main(void){
long long int n,a[10001]={0};
cin >>n;
for(int i=0;i<n;i++){
cin >>a[i];
}
long long int min=1000000,max=-1000000,sum=0;
for(int i=0;i<n;i++){
if(a[i]<min){
min=a[i];
}
if(a[i]>max){
... | 0 | 89,835,636 |
#include <iostream>
using namespace std;
void replace(int& a, int& b)
{
int temp = a;
a = b;
b = temp;
}
int main()
{
int a = 0, b = 0;
while(true)
{
cin >> a >> b;
if (a == 0 && b == 0) break;
if (a > b) replace(a, b);
cout << a << " " << b << endl;
}
... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | 0 | 47,862,042 |
#include<stdio.h>
using namespace std;
int main(void)
{
int A, B, K;
int D;
scanf("%d%d%d", &A, &B, &K);
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 == 1)
A = A - 1;
A = A / 2;
B = B + A;
}
else {
if (B % 2 == 1)
B = B - 1;
B = B / 2;
A = A + B;
}
}
printf("%d %d", ... | #include<bits/stdc++.h>
#define ll long long
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define N 300005
#define M 1000000007
#define pii pair<ll,ll>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
main()
{
int n,m;
cin>>n>>m;
map<ll,ll>mp;
ll now=0;
ll ans=0;
mp[0]++;
... | 0 | 49,040,119 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#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 =... | #include <bits/stdc++.h>
#define FLASH ios_base::sync_with_stdio(0);
#define ll long long
#define debt(x,y)cout<<"#x = "<<(x)<<" and "<<"#y = "<<(y)<<endl;
#define deb(x)cout<<"#x = "<<(x)<<endl;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define arr(a,n) for(ll i=... | 0 | 7,275,073 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
scanf("%d%d", &a, &b);
int mian_ji = a * b;
mian_ji = mian_ji - a - b + 1;
printf("%d\n", mian_ji);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
int main(){
cin >> n;
if(n==0){
cout << 0 << endl;
return 0;
}
if(n%2==1){
cout << 0 << endl;
return 0;
}
ll count=0;
ll memo=10;
while(n>=memo){
count+=n/memo;
memo*... | 0 | 8,353,584 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
string ans = "None";
for (char c = 'a'; c <= 'z'; c++) {
if (S.find(c) == string::npos) {
ans = c;
break;
}
}
cout << ans << endl;
return 0;
} | #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,m;
cin>>n>>m;
map<int,int> A,B;
rep(i,m){
int a,b;
cin>>a>>b;
if(a==1)B[b]=1;
if(b==n)A[a]=1;
}
for(auto p:A){
if(B[... | 0 | 48,642,348 |
#include<bits/stdc++.h>
using namespace std;
int main( void )
{
int A, B;
cin >> A >> B;
int count = 0;
for( int i = A; i <= B; i++ ) {
if( i % 10 == ( i / 10000 ) % 10 && ( i / 10 ) % 10 == ( i / 1000 ) % 10 )
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B; cin >> A >> B;
int ans=-1;
for(int i=1; i<1010; i++){
if(floor(i*0.08)==A && floor(i*0.1)==B){
ans=i;
break;
}
}
cout << ans << endl;
} | 0 | 25,772,589 |
#include "bits/stdc++.h"
#pragma warning(disable : 4996)
typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#define min3(x, y, z) min(x, min(y, z))
#ifdef _MSC_FULL_VER
#define dout cout
#define debug() if (true)
#de... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(0);
#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<<" ";ne... | 0 | 51,148,408 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long X,Y;
cin>>X>>Y;
int i=0;
for(;X<=Y;i++)
X*=2;
cout<<i<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int x=0;
int dig,num=n;
while(n){
dig=n%10;
x+=dig;
n/=10;
}
if(num%x==0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | 0 | 35,627,768 |
#include<cstdio>
#define mod (1000000007)
typedef long long ll;
ll x[110000],y[110000];
int main()
{
ll n,m;
scanf("%lld%lld",&n,&m);
for(int i=1;i<=n;i++) scanf("%lld",&x[i]);
for(int i=1;i<=m;i++) scanf("%lld",&y[i]);
ll s1=0,s2=0;
for (int i=1;i<=n;i++) s1=((2*i-n-1)*x[i]+s1)%mod;
for (int i=1;i<=m;i++) s2=((... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | 0 | 26,411,339 |
#include <iostream>
using namespace std;
int main(){
string wins;
getline(cin, wins);
int toWin = wins.length()-7;
for(int i=0;i<wins.length();i++){
if(wins[i]=='o') toWin--;
}
cout << (toWin<=0 ? "YES" : "NO");
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define ppll pair<ll,pll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lowe... | 0 | 100,371,668 |
#include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | 0 | 97,039,627 |
#define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long long int a[110000], LIS[110000];
int main(){
int N... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
const long long int m=pow(10,9)+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ull n,x,y,min=9999999999999;
cin>>n;
for(int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
... | 0 | 44,895,122 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
#define MOD 1000000007
using ll = long long;
using namespace std;
template<class T> bool chmax(T &a, c... | #include<iostream>
using namespace std;
int main(void){
int A, B, K;
bool result{false};
cin >> K >> A >> B;
if(A%K == 0){
result = true;
}
else if((A/K+1)*K<=B){
result = true;
}
if(result){
cout << "OK" << endl;
}
else{
cout << "NG" << endl;
... | 0 | 97,980,587 |
#include<cstdio>
int main() {
int n;
int A[2000001];
int B[2000001];
int C[10001] = {0};
scanf("%d", &n);
for(int i=1; i<=n; i++) {
scanf("%d", &A[i]);
C[A[i]]++;
}
for(int i=0; i<10000; i++) {
C[i+1] += C[i];
}
for(int i=1; i<=n; i++) {
B[C[A[i]]] = A[i];
C[A[i]]--;
}
printf("%d", B[1]);
for(int... | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include... | 0 | 24,043,947 |
#include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int res = 0;... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int arr[101] = {0};
int main()
{
long long int a, b, total=0, n=0;
cin >> a >> b;
for(int i=0; i<a; i++)
{
int c;
cin >> arr[i];
}
for(int i=0; i<a; i++)
{
total += arr[i];
}
for(int i=0; i... | 0 | 78,474,194 |
#include<iostream>
using namespace std;
int main()
{
for(;;){
int kane, sub, cont = 0;
cin >> kane;
if(kane == 0){
break;
}
kane = 1000 - kane;
sub = kane;
for(;;){
if(sub - 500>= 0){
cont++;
sub -= 500;
}
else{
break;
}
}
for(;;){
if(sub - 100 >= 0){
cont++;
sub -= 100;
}
else{... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int mod = 1000000007;
const int INF = 1001001001;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool c... | 0 | 86,298,768 |
#include<iostream>
using namespace std;
int dp[50];
int fibonacci(int x){
if(x==0 || x==1) return 1;
if(dp[x]!=0) return dp[x];
return dp[x]=fibonacci(x-1)+fibonacci(x-2);
}
int main(){
int n;
cin>>n;
cout<<fibonacci(n)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int64_t N, Z, W;
const int MAXN = 2010;
const int64_t INF = (1LL << 62);
vector<int64_t> A(MAXN);
vector<vector<int64_t>> DP(2, vector<int64_t>(MAXN, -1));
int64_t dfs(int64_t turn, int64_t top, int64_t x, int64_t y)
{
if (top == N)
{
return abs(x - y);
}
if (... | 0 | 86,861,356 |
#include<stdio.h>
#include<iostream>
int main(){
int n,a,b,c,d,count;
while(scanf("%d",&n)==1){
count = 0;
for(a=0;a<10;a++){
for(b=0;b<10;b++){
for(c=0;c<10;c++){
for(d=0;d<10;d++){
if(a+b+c+d == n) count = count + 1;
}
}
}
}
printf("%d\n",count);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define w(t) int t; cin>>t; while(t--)
#define fo(i,n) for(int i=0;i<n;i++)
#define endl "\n"
#define MOD 1000000007
const ll inf=1e18;
void Tez(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
ll c... | 0 | 61,349,889 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n, m;
cin >> n >> m;
vector<int> broken(n+1);
rep(i,m){
int a;
cin >> a;
broken[... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
int d[k];
int sunuke[n];
for(int i=0; i<n; i++){
sunuke[i]=0;
}
for(int i=0; i<k; i++){
cin >> d[i];
int a;
for(int j=0; j<d[i]; j++){
cin >> a;
sunuke[a-1]++;... | 0 | 5,154,708 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define ll long long
int main() {
int t,... | 0 | 26,720,073 |
#include <iostream>
using namespace std;
int main()
{
int k,m;
cin>> k>>m ;
if (k%m==0){
cout <<0;
}
else{
cout <<1;
}
return 0;
} | #include<iostream>
#include<cctype>
#include<string>
using namespace std;
int main(int argc, char const *argv[])
{
string str,str1,str2;
int a=0, b=0, n;
cin >> str;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> str1;
cin >> a >> b;
if(str1 == "print"){
str2 ... | 0 | 83,981,094 |
#include <iostream>
#include <vector>
int N;
void countingSort(std::vector<int>& A, std::vector<int>* B, int k) {
std::vector<int> C(k + 1, 0);
for (int j = 0; j < N; ++j)
C[A[j]]++;
for (int i = 1 ; i <= k; ++i)
C[i] = C[i] + C[i-1];
for (int j = N - 1; j >= 0; --j) {
(*B)[C[A[j]]] = A[j];
C[A[... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
#define INF (1e9)
int main() {
int H,N;cin>>H>>N;
vi A(N),B(N);
for (int i = 0; i < N; i++){
cin>>A[i]>>B[i];
}
vi dp(H+1,INF);
dp[H]=0;
for (int h = H; h >=0 ; h--){
... | 0 | 70,536,471 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
using namespace std;
typedef long long int ll;
const int INF = 100000000;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
const int n = 9;
for(i... | #include <bits/stdc++.h>
using namespace std;
#define dbg(x) #x "=" << x << " "
#define fore(i,a,b) for(int i=a,gon=b;i<gon;++i)
#define pb push_back
#define F first
#define S second
typedef double lf;
typedef long long ll;
typedef pair<int, int> pii;
ll solve(ll h, ll w) {
ll mn = w*h, a[3] = {};
for (ll i = 1... | 0 | 28,673,236 |
#include <iostream>
#include <cstdlib>
using namespace std;
typedef struct {
int nums[6];
int *top, *bottom, *forward, *back, *left, *right;
} dice;
void init_dice(dice *d) {
d->top = d->nums;
d->forward = d->top + 1;
d->right = d->forward + 1;
d->left = d->right + 1;
d->back = d->left + 1;
... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#define int long
#define ll long long
#define rep(i, n) for(i... | 0 | 67,383,145 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const ll MAX = 1e18;
int ... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef pair<... | 0 | 39,300,713 |
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP m... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
using ml = boost::multiprecision::... | 0 | 16,554,236 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
string s; cin >> s;
if (n % 2 == 1) {
cout << "No" << endl;
return 0;
}
string left = s.substr(0, n / 2);
string right = s.substr(n / 2);
if (left == right) cout << "Yes" << endl;
else cout << "No" << endl;
re... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | 0 | 79,367,640 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int w;
cin>>w;
int i;
for(i=0;i<s.length();i+=w)
{
cout<<s[i];
}
} | #include <bits/stdc++.h>
using namespace std;
const int mxH = 1e3 + 2, MOD = 1e9 + 7;
int h, w, dp[mxH][mxH];
char grid[mxH][mxH];
int calc(int i, int j)
{
if (i < 0 || j < 0)
return 0;
return dp[i][j];
}
int main()
{
cin >> h >> w;
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w... | 0 | 92,613,789 |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string moji = a == b ? "==" : (a > b ? ">" : "<");
cout << "a" << " " << moji << " " << "b" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 51,244,773 |
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define int long long
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false); cin.tie(... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A){rep(i,A.size()){cout << A[i];}cout << endl;}
int main(){
int n;
cin >> n;
vector<int> a(n+1);
rep(i,n+1) cin >> a[i];
vector<int> b(n)... | 0 | 12,276,048 |
#include <bits/stdc++.h>
#ifndef M_PI
#define M_PI 3.14159265358979
#endif
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;
typedef long double ld;
const... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base :: sync_with_stdio(false);
cin.tie(NULL);
ll n,x,m;
cin>>n>>x>>m;
ll sum = x,ind=-1;
set<ll> s;
s.insert(sum);
ll psum=0,nsum=0;
vector<ll> a,b;
b.push_back(sum);
for(auto i=2;i<=n;i++){
ll num = (x*x)%m;
... | 0 | 14,366,431 |
#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 long long ll;
typedef long double ld;
int main()
{
int n, m; cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
rep(i, n)
{
cin >> a[i];
}
rep... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin>>n;
vector< vector<int> > a(n,vector<int> (n));
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
a[i][j]=0;
}
}
for(int i=0; i<n; i++){
int u,k;
cin>>u;
cin>>k;
vector<int> v(k);
for(int j=0; j<k... | 0 | 71,784,086 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.