code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ll long long
#define P pair<int,int>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int MOD = 1000000007;
const int INF = 2002002002;
const ll LLINF = 9009009009009009009;
using namespace std;
int main() {
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) fo... | 0 | 89,403,906 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
char x,y;
cin >> x >> y;
if(x > y) cout << ">" << endl;
else if(x < y) cout << "<" << endl;
else cout << "=" << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int a,b,i;
cin>>a>>b;
if(a>b){
for(i=1;i<=a;i++){
cout<<b;
}
cout<<endl;
}
else if(a<b){
for(i=1;i<=b;i++){
cout<<a;
}
cout<<endl;
}
else if(a==b){
f... | 0 | 44,563,910 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n;
cin >> n;
ll ans=(n-1)*n/2;
cout << ans;
} | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
using namespace std;
int main(){
string str;
int p, a, b;
string command, alt;
string abb ;
cin >> str >> p;
for(int i = 0; i < p; i++){
cin >> command;
if... | 0 | 4,612,674 |
#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>=(ll)(b);i--)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int ... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <chrono>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int N;
int main() {
cin >> N;
vector<long long> A(1 << N);
for (int i = 0; i < (1 << N); i++) {
cin >> A[i];
... | 0 | 55,356,150 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
ll a[n+10][3];
ll maxn = -(1LL << 60);
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 3; j++) {
c... | #include<stdio.h>
#define MAX 250
int main(){
int a[MAX];
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
for(int i=1;i<=n;i++){
printf("node %d: key = %d, ",i,a[i]);
if(i/2>=1) printf("parent key = %d, ",a[i/2]);
if(2*i<=n) printf("left key = %... | 0 | 70,027,294 |
#include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
#define let auto const&
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) \
for (default_counter_t i = 0, end_i = default_counter_t(... | #include<bits/stdc++.h>
#define vi vector<int>
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define ll long long int
#define pi pair<ll,ll>
#define f first
#define mp make_pair
#define mod 1000000007
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
int gcd(int a, int b)
{
if(b==0)
return a;... | 0 | 98,514,424 |
#define _LIBCPP_DEBUG 0
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const long long INF = 1LL << 60;
ll MOD = 1e9+7;
int main() {
int K; cin>>K;
string S; cin>>S;
if(S.size()<=K) cout<<S<<endl;
else{
for (int i = 0; i < K; ++i) {
cout<<S[i];
}
... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
int ans=INT_MAX;
for(int i=0;i<s.size();i++)
{
int c=0;
for(int j=0;j<t.size();j++)
{
if(i+j>=s.size())
{
c=INT_MAX;
... | 0 | 63,736,680 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldIN... | #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 | 11,877,076 |
#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... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int,int>;
#define rep(i,n) for(int (i)=0,temp=(int)(n);(i)<temp;++(i))
#define repi(i,start,end) for(int (i)=(start),temp=(int)(end);i<(end);++(i))
#define rfor(x,v) for(const auto& (x) : (v))
#define all(x) (x).begin(),(x).end()
#de... | 0 | 91,394,745 |
#include <iostream>
#include <cstdio>
#define read(x) scanf("%d",&x)
using namespace std;
int main()
{
int n;
read(n);
cout<<(n-2)*180<<endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define Rep(i,a,b) for(ll i = a; i <= b; ++i)
#define rep(i,b) Rep(i,0,b-1)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POS... | 0 | 14,499,360 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 0 | 62,003,784 |
#include <stdio.h>
#include <map>
#include <string>
#include <string.h>
using namespace std;
map<string,int> words;
int alltoupper(char *s){
int i,l=strlen(s);
for(i=0;i<l;i++){
s[i] = tolower(s[i]);
}
}
int main(){
char s[32];
int max=0;
string my;
int maxlength=0;
string self;
while(scanf(" %s",... | #include<bits/stdc++.h>
using namespace std;
long long int n,a[1000001];
int gcd(int c,int d) {
return d==0?c:gcd(d,c%d);
}
int main() {
cin>>n;
int ans=0;
for (int i=0; i<n; i++) {
int x;
cin>>x;
a[x]++;
ans=gcd(ans,x);
}
int ok=1;
for (int i=2; i<=1000000; i++) {
int cnt=0;
for (int j=i; j<=1000000... | 0 | 94,253,871 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N,M;
cin>>N>>M;
vector<vector<ll>> vec(N,vector<ll>(0));
for(ll i=0;i<M;i++) {
ll a,b;
cin>>a>>b;
vec[a-1].push_back(b);
vec[b-1].push_back(a);
}
vector<ll> A(N);
for(ll i=0;i<N;i++)... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main() {
int h,w;
cin... | 0 | 39,452,401 |
#include <iostream>
#include<string>
int main() {
int x, y;
while (std::cin >> x >> y, x || y) {
if (x > y) {
std::cout << y << " " << x << std::endl;
}
else {
std::cout << x << " " << y << std::endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 76,912,182 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; 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 1e9
typedef long long ll;
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin >> n >> m;
vector... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
vector<int> op(4);
string abcd;
void solve(int depth, vector<int> ¤t) {
if (depth == 3) {
int tmp = (int) (abcd[0] - '0');
rep(i, 3) {
int value = (int) (abcd[i +... | 0 | 51,867,277 |
#include<iostream>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<deque>
#include<algorithm>
#include<math.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
s[n] = s[0];
int i, j;
char t[100003];
for (j = 0; j < 4; j++) {
if (j == 0) {
t[0] = 'S';
t[1] = 'S... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
const int Max = 1e6 + 5;
const int Mod = 1e9 + 7;
ll lst[Max];
int ls[Max];
int main()
{
int n;
cin >> n;
for (int i = 1;i <= n;i++)
{
int t;
scanf("%d", &t);
lst[t]++;
}
ll res = 0;
for (int i ... | 0 | 25,037,073 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin>>c;
if(c=='a'){
cout<<"vowel";
}
else if(c=='i'){
cout<<"vowel";
}
else if(c=='u'){
cout<<"vowel";
}
else if(c=='e'){
cout<<"vowel";
}
else if(c=='o'){
cout<<"vowel";
}
else{
cout<<"consonant";
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
return v... | 0 | 32,579,551 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
vector<tuple<int,int,int>> x(M);
for (int i=0; i<M; i++) {
int a,b;
cin >> a >> b;
x[i]=make_tuple(a,b,i);
}
sort(x.begin(),x.end());
for (int i=0; i<M; i++) {
if (i==0) {
get<1... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i = 0; i < (ll)(n); ++i)
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<queue<int>> q(n);
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
q[a]... | 0 | 28,059,425 |
#include <iostream>
#include <string>
using namespace std;
const string alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main(){
string s;
int k=0;
int count[27]={0};
cin >> s;
for (int i=0;i<4;i++){
for (int j=0;j<26;j++){
if(s[i]==alpha[j]){
count[j]++;
}
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
using namespace std;
vector <int> n;
int main(){
long long n,a,ans=0,cur;
cin>>n>>cur;
for(int i=1;i<n;i++){
cin>>a;
if(a<=cur){
ans+=cur-a;
}else{
cur=a;
}
}
cout<<ans<<endl;
return 0;
} | 0 | 9,711,681 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int64_t N, right = 0, sum = 0, ans = 0;
cin >> N;
vector<int64_t> A(N);
for (int64_t i = 0; i < N; i++)... | #include<bits/stdc++.h>
using namespace std;
#define SORT(c) sort((c).begin(),(c).end());
#define pb push_back
#define MP make_pair
#define pii pair<int,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define pi 3.141592653589793
#d... | 0 | 29,799,638 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll a,b,c,k;
cin>>a>>b>>c>>k;
ll sum = 0;
if( k > 0) {
if( k > a){
k = k-a;
sum += a;
}
else{
sum += k;
cout<<sum<<"\n";
return 0;
}
}
if( k > 0) {
if( k > b){
... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 8,525,127 |
#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 = 1e+9 + 7;
int main() {
int N, M, a;
cin >> N >> M;
vector<bool> broken(N + 1, false);
rep(i, M) {
cin >> a;
broken[a] = true;
}
vector<int> dp(N... | #include <iostream>
int map[18][18]={};
int a,b;
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
while(true){
std::cin>>a>>b;
if(a==0&&b==0)break;
int n;
std::cin>>n;
int x[41],y[41];
for (int i=0; i<n; ++i)
{
std::cin>>x[i]... | 0 | 89,122,522 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
#define fore(i,a) for(auto &i:a)
#define INF INT_MA... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, ans=0, tmp=0;
vector<vector<ll>> A;
string S;
signed main(){
cin >> S;
A.resize(26);
for(int i=0;i<S.size();i++) {
ll abc = S[... | 0 | 44,170,796 |
#include <iostream>
#include <math.h>
using namespace std;
void swap(int &i, int &j) {
if (j < i) {
int tmp = i;
i = j;
j = tmp;
}
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int a, b, c;
cin >> a >> b >> c;
swap(a, b);
swap(a... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_bac... | 0 | 45,419,853 |
#include<iostream>
#include<cstdio>
#define INT_MAX 100000000
using namespace std;
int index;
int mm[1000][1000];
int mine = INT_MAX;
void solve(int p[]){
int n = index-1,j,q;
for(int i=1;i<=n;i++)mm[i][i]=0;
for(int l=2;l<=n;l++){
for(int i=1;i<=n-l+1;i++){
j = i+l-1;
mm[i][j] = INT_MAX;
fo... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | 0 | 42,430,062 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
long long sum = 0;
vector<long long>A(N);
vector<long long>B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
for (int i = 0; i < N; i++) {
B.at(i) = sum;
sum += A.at(i);
}
vector<... | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#p... | 0 | 82,363,366 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | #include<iostream>
#include<algorithm>
using namespace std;
int dp[101][101];
int r[100],c[100];
int solv(int a,int b){
if(dp[a][b]==-1){
if(a == b-1){
dp[a][b]=0;
}else if(a==b-2){
dp[a][b]=r[a]*c[a]*c[a+1];
}else{
int Pmin=999999999;
for(int ... | 0 | 81,857,758 |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,s,ans;
void solve(int from,int now,int sum){
if(now==n && sum==s) ans++;
if(now<n && s-sum>=from*(n-now)){
for(int i=from;i<=min(9,(s-sum)/(n-now));i++){
solve(i+1,now+1,sum+i);
}
}
}
int main(){
for(;;){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl... | 0 | 100,666,042 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
string s;
cin >> s;
int N = s.size();
rep(i,(N-1)/2){
if(s.at(i) != s.at(N-1-i)){
cout << "No" << endl;
return 0;
}
}
rep(i,(N-1)/4){
if(s.... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
int t = 0;
for(int i=1; i<=n; ++i) {
t += i;
if(t>=n) {
int u = t - n;
for(int j=1; j<=i; ++j) {
if(j!=u) cout << j << endl;
}
... | 0 | 23,161,516 |
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int n, d, ans = 0;
int arr[15][15];
bool solve(int i, int j){
double ans = 0;
for(int idx = 0; idx < d; idx++){
ans += ((arr[i][idx] - arr[j][idx]) * (a... | #include <bits/stdc++.h>
using namespace std;
#define rall(x) x.rbegin() , x.rend()
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define pb push_back
using ll = long long;
using ii = pair <int , int>;
void in(int &x);
const int N = 105;
#define singleCase
const int inf = 1e8;
int n,m,dp[N][N];
... | 0 | 69,934,098 |
#include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for(int (i)=0; (i)<(n); (i)++)
#define REP2(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1,) (__VA_ARGS__)
#define MOD 1000000007
template <class T> ostream& ope... | #include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
class Dice {
int s1, s2, s3, s4, s5, s6;
public:
Dice(int s1, int s2, int s3, int s4, int s5, int s6);
void print();
void relocate(int top, int front);
... | 0 | 96,594,785 |
#include <iostream>
#include <cmath>
#include <vector>
#include <set>
#define N 1000000
typedef long long ll;
using namespace std;
int prime[N + 1];
int D[N + 1];
int used[N + 1];
int main() {
for (int i = 0; i <= N; ++i) {
prime[i] = 1;
D[i] = i;
used[i] = 0;
}
prime[0] = prime[1] =... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lon... | 0 | 68,662,958 |
#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 << "\n";}
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
bool flag = f... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
typedef pair<ll,ll>pi;
#define ff first
#define ss second
vector<pi>v;
#define inf 8e18
ll n,k;
const ll N=100;
bool comp(pi a,pi b)
{
return a.ff<b.ff;
}
ll x[N+4],y[N+4],a[N+5],b[N+6];
int main()
{
ios_base::sync_with_stdio... | 0 | 88,328,415 |
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int n;
string s;
stringstream ss;
cin>>n;
for(int i=n;i<=999;i++)
{
ss<<i;
ss>>s;
ss.clear();
if(s[0]==s[1]&&s[1]==s[2])
{
cout<<s<<endl;
return 0;
}
}
} | 0 | 555,949 |
#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 9;
const int infint = 1e9 + 7;
const int MAXN = 2e5 + 7;
const double eps = 1e-9;
const long double pi = 3.1415926535897932384626433... | # include <bits/stdc++.h>
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define ALL(x) (x).begin(), (x).end()
# define RALL(x) (x).rb... | 0 | 41,877,318 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
typedef int64_t ll;
template<class T> inline bool chmax(T & a, T b) { if ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int k[M], s[M][N], p[M];
for (int i = 0; i < M; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
fo... | 0 | 45,689,563 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll dp[100005];
int main()
{
ll n;
cin>>n;
ll a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
dp[n-1]=0;
for(int i=n-2;i>=0;i--){
if(i==n-2){
dp[i]=abs(a[i+1]-a[i]);
}
else{
dp[i]=min(dp[i+1]+abs(a[i+1]-a[i]),dp... | #include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ... | 0 | 17,577,084 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <bitset>
#include <math.h>
typedef long long ll;
typedef unsigned long long ull;
#define vi std::vector<int>
#define vl std::vector<ll>
#define floop(n) for(int i = 0; i < n; ++i)... | #include<stdio.h>
int main(){
int multiply1;
int multiply2;
for(multiply1 = 1; multiply1 <= 9; multiply1++)
{
for(multiply2 = 1; multiply2 <= 9; multiply2++)
{
printf("%dx%d=%d\n", multiply1, multiply2,
multiply1*multiply2);
}
}
return 0;
} | 0 | 82,585,027 |
#include <iostream>
int main(int argc, char *argv[]) {
int x1, y1, x2, y2;
std::cin >> x1 >> y1 >> x2 >> y2;
int x = x2, y = y2, dx = x2 - x1, dy = y2 - y1;
for (int i = 0; i < 2; ++i) {
std::swap(dx, dy);
dx = -dx;
x += dx;
y += dy;
std::cout << x << " " << y << std::endl;
}
} | #include<iostream>
using namespace std;
int main()
{
int m, f, r;
int i = 0;
char ans;
while (1)
{
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) break;
else
{
if (m == -1 || f == -1)
{
ans = 'F';
}
else if (m + f >= 80)
{
ans = 'A';
}
else if (m + f >= 65)
{
ans... | 0 | 51,043,890 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#define rep(i, a) REP(i, 0, a)
#define REP(i, a, b) for(int i = a; i < b; ++i)
type... | #include<bits/stdc++.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vl... | 0 | 75,610,758 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define PB push_back
#define MP make_pair
#define endl '\n'
#define all(a) (a).begin(),(a).end()
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
int arr[100005];
int dp[100005];
int f(int indx)
{
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define ll long long
class Dice{
public:
int val[6];
Dice(int a[]){
copy(a,a+6,val);
}
int side(){
return val[2];
}
bool match(int f, int u){
return (val[0] == f && val[4] == u);
... | 0 | 75,732,050 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i != static_... | 0 | 64,770,989 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define fcout cout << fixed << setprecision(15)
using lint = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 50,902,685 |
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s,t;
cin>>s>>t;
sort(s.begin(),s.end());
sort(t.begin(),t.end());
long lon... | #include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n;
while(true){
cin >> n;
if(!n) break;
int min_diff = 1000000;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
... | 0 | 72,867,820 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
bool flag=false;
cin >> X >> Y;
for (int i=0; i<X+1; i++){
if (4*X-2*i == Y){
flag=true;
break;
}
}
if(flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf (ll)(1e18)
#define mod 1000000007
int main()
{
int t=1;
while( t-- )
{
string s1,s2;
cin>>s1>>s2;
bool flag=1;
for( int i=0 ; i<s1.size() ; i++ )
if( s1[i]!=s2[i] )
{
... | 0 | 58,134,718 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
int main() {
int n; cin >> n;
V<ll> a(n + 2, 0);
ll sum = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
sum += abs(a[i] - a[i - 1]);
}
sum += abs(a... | #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>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
strin... | 0 | 8,931,843 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define N 100010
const int mod=998244353;
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<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n,d[N],... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll n, a, b, ans[300005];
int main() {
scanf("%lld%lld%lld", &n, &a, &b);
if (a == 1) {
if (b != n) {
printf("-1\n");
return 0;
}
for (int i = n; i >= 1; i--) printf("%d ", i);
return 0;
... | 0 | 80,380,820 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<functional>
#include<unordered_map>
#include<map>
using namespace std;
int p = 1000000007;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; 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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll>... | 0 | 16,081,771 |
#include <bits/stdc++.h>
using namespace std;
struct Benri { Benri() { std::cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12);}} benri;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<long long>;
using vvll = vector<vll>;
usin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
int ans = N;
for(int i = 0; i <= N; i++) {
int cnt = 0;
int X = i;
int Y = N-i;
while(X != 0) {
cnt+=X%6;
X/=6;
}
while(Y != 0) {... | 0 | 6,997,622 |
#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 = 2019;
int main() {
int k;
cin >> k;
vector<ll> lunlun;
queue<ll> q;
for (int i = 1; i <= 9; i++) {
lunlun.push_back(i);
q.push(i... | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
ll a = 2 , b = 1 , x;... | 0 | 36,768,119 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 2e5 + 77;
void sol(){
int n , m ; cin >> n >> m ;
priority_queue<int> A;
for(int i = 0 ; i < n ; ++i){
int a ; cin >> a;
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 0 | 21,139,291 |
#include <iostream>
#include <cstdio>
#include <cctype>
#include <stdlib.h>
#include <string>
using namespace std;
int main(void){
while(1){
int sum=0,n;
string str;
cin>>str;
if(atoi(str.c_str())==0)
break;
n = str.size();
for(int i=0;i<n;i++){
sum += str[i] - '0';
}
cout<<sum<<endl;
}
return... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
#define eb(t) emplace_back(t)
typedef long long ll;
typedef long long unsigned int llu;
ll INF = 1000000009;
const int MAX = 510000;
const int MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1... | 0 | 81,997,085 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
#include <queue>
#include <list>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
io... | #include <iostream>
using namespace std;
void Solution()
{
int n;
int times = 0;
int a[101] = {0};
while(cin>>n)
{
a[n]++;
}
for(int i = 0; i < 101; i++)
{
if(a[i] > times)
{
times = a[i];
}
}
for(int i = 0; i < 101; i++)
{
... | 0 | 5,428,871 |
#include <bits/stdc++.h>
std::vector<int> P(10000);
int main() {
int m, nmin, nmax;
int i;
while(std::cin >> m >> nmin >> nmax) {
if(m == 0 && nmin == 0 && nmax == 0) break;
for(i=0; i<m; ++i) {
std::cin >> P[i];
}
std::sort(P.begin(), P.begin()+i, std::greater<in... | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cer... | 0 | 24,958,599 |
#include <iostream>
using namespace std;
int s[5000];
int main() {
for (;;) {
int n;
cin >> n;
if (!n) return 0;
cin >> s[0];
int r = s[0], m = 0;
for (int i = 1; i < n; i++) {
cin >> s[i];
r = max(r, s[i]);
s[i] += s[i-1];
}
for (int i = 0; i < n; i++)
if (s[i]... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;
int main(){
constexpr int MAX_A=10001;
int N,K;
cin>>N>... | 0 | 64,551,632 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define forn(ii,a,b) for(int ii = (int)a ; ii < (int)b ; ii++ )
#define scan(any) for(auto &i:any) cin>>i;
#define debug(x) cerr << #x << " " << x << " -- \n"
#define I__O ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 0 | 67,819,856 |
#include<stdio.h>
int main(){
int count=0,x,y,z;
scanf("%d %d %d",&x,&y,&z);
for(int i=x;i<=y;i++){
if((z%i)==0){
count++;
}
}
printf("%d\n",count);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.... | 0 | 4,744,320 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <string>
#include <map>
#include <list>
#include <queue>
#include <set>
using namespace std;
int main(void){
int a, b, c;
cin >> a >> b >> c;
if(a > b) swap(a, b);
if(a > c) swap(a, c);
if(b > c) ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
vector<vector<char>>a(h,vector<char>(w));
for(int i=0;i<h;i++)
for(int j=0;j<w;j++)
cin >> a.at(i).at(j);
vector<vector<int>>cost(h,vector<int>(w,100000));
cost.at(0).at(0)=a.at(0).at(0)=='#';
for(int i=1;i<h;i++)
... | 0 | 35,111,305 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
ll nck(ll n, ll k){
ll ret = 1;
rep(i, k){
ret *= (n - i);
ret /= (i... | #include <bits/stdc++.h>
using namespace std;
const int N = 1337;
const int MOD = 1e9+7;
char B[N][N];
int dp[N][N];
int main(){
int h,w; cin >> h >> w;
for(int i = 1; i <= h; i++){
for(int j = 1; j <= w; j++){
cin >> B[i][j];
}
}
dp[1][1] = 1;
for(int i = 1; i <= h; i++)... | 0 | 71,836,900 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#... | #include<bits/stdc++.h>
#define rep(i,n) for(long long i=0;i<(n);i++)
#define ll long long
using namespace std;
int main(){
ll L,N,T;
cin >> N >> L >> T;
vector<ll> X(N);
vector<int> W(N);
rep(i,N) cin >> X[i] >> W[i];
vector<ll> tmp(N); ll count = 0;
rep(i,N){
ll d = (W[i] == 1) ? (... | 0 | 17,440,256 |
#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)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | 0 | 966,442 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n,k;
cin>>n>>k;
long long int s=n;
while(n--){
long long int x;
cin>>x;
}
long long int u=(s-1);
long long int d=(k-1);
if(u%d==0){
cout<<u/d;
}
else{
cout<<(u/d)+1;
}
re... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 82,466,832 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b,i) do { cout << "["; for (int (i) = (a);(i) < (b);++(i)) cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it))... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 30,080,463 |
#include <cstdio>
#include <vector>
#include <algorithm>
#include <functional>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <cassert>
#include <cmath>
using namespace std;
int main() {
int w, h;
scanf("%d %d", &w, &h);
vector<pair<int, bool>> es;
for (int ... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod =... | 0 | 52,022,161 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = s[0] - '0';
int b = s[1] - '0';
int c = s[2] - '0';
int d = s[3] - '0';
for (int bit = 0; bit < (1<<3); bit++) {
int sum = a;
if (bit & 1) sum += b;
else sum -= b;
if (bit & (1<<1)) sum += c;
else su... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
const llong mod = (llong)(1e9) + 7;
st... | 0 | 57,267,425 |
#include <iostream>
int main()
{
long long n,m,l=0,r=0;
std::cin>>n>>m;
std::cin>>l>>r;
for (int i=1; i<m; i++)
{
long long li,ri;
std::cin>>li>>ri;
if (li>l) l=li;
if (ri<r) r=ri;
}
if (l>r) std::cout<<0;
else std::cout<<r+1-l;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main(){
int H, W, M;
cin >> H >> W >> M;
vector<int> Hi(H, 0);
vector<int> Wi(W, 0);
set<pair<int,int>> ... | 0 | 61,448,624 |
#include "bits/stdc++.h"
#define F first
#define S second
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n = 0;
cin >> n;
ll ar[n];
ll ans = INT_MAX;
for (ll i = 0; i < n; ++i)
cin ... | #include <iostream>
using namespace std;
#define FOR(a, b) for(int a = 0; a < b; ++a)
int vx[4] = {0, 1, 0, -1};
int vy[4] = {-1, 0, 1, 0};
int a, b, m;
int map[16][16] = {0};
bool chk[16][16] = {false};
void froot(int x, int y){
FOR(i, 2){
int nx = x + vx[i + 1];
int ny = y + vy[i + 1];
if(map[y][x] == 2... | 0 | 65,963,366 |
#include <iostream>
int main()
{
int N;
std::cin >> N;
int res = 1;
for (; res<=N; res*=2);
std::cout << res/2 << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>... | 0 | 78,579,527 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int calc_keta(ll a) {... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 60,008,040 |
#define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
string S;
ci... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define PI acos(-1)
#define Mod (int)1000000007
#define INFTY (int)INT_MAX
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end... | 0 | 42,260,962 |
#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>;... | #pragma GCC optimize ("-O2")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ld ... | 0 | 39,545,776 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll a, ll b){
if(a % b == 0) return b;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b){
ll... | 0 | 81,975,735 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
int main() {
int n,k;
string s;
cin>>n>>s>>k;
... | #include <bits/stdc++.h>
using namespace std;
using namespace __detail;
typedef long long ll;
#define ar array
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define all(x) (x).begin(), (x).end()
#define en '\n'
#define FILL(x, v) memset(x, v, sizeof(x))
#define pb push_back
#defin... | 0 | 50,848,065 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
using namespace std;
int main() {
char str[7];
bool flag = false;
cin >> str;
if (str[2] == str[3]) {
if (str[4] == str[5]) {
fl... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int ... | 0 | 13,659,088 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> void drop(const T &x){cout<<x<<'\n';exit(0);}
void solve() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int tmp = min(a, k);
int ans = tmp;
k -= tmp;
if(!k) drop(ans);
tmp = min(b, k);
k -= tmp;
if(!k) drop(ans);
tmp = min(c, k);
ans... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n... | 0 | 77,438,644 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int c[20000+200];
int a[3000000+200];
int n;
void countSort(){
memset(c,0,sizeof(c));
for(int i=0;i<n;i++){
c[a[i]]++;
}
int index=0;
for(int i=0;i<10000+10;i++){
while(c[i]){
a[index++]=i;
... | #include<iostream>
#include<cstdio>
#define N 101
using namespace std;
typedef struct{
int q[10000];
int head;
int tail;
}Queue;
Queue que;
int g[N][N];
int n;
int d[N];
bool us[N];
void Enque(int data){
que.q[que.tail]=data;
que.tail++;
}
int Deque(void){
int data;
data=que.q[que.head];
que.head++;
... | 0 | 21,025,373 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string n;
long long i,l,j,k,s=0;
cin>>n;
l=n.length();
for(i=0;i<l;i++){
s+=(n[i]-48);
}
if(s%9==0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<string>
#include<numeric>
using namespace std;
typedef long long ll;
ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int n, m;
... | 0 | 76,261,709 |
#include <bits/stdc++.h>
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 0 | 11,910,933 |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MX=200011;
int n;
LL a[MX];
struct Edge{int t,nxt;Edge(int _t=0,int _nxt=0):t(_t),nxt(_nxt){}}e[MX];
int hed[MX],ec,D[MX];
inline void ade(int f,int t... | #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;
... | 0 | 93,236,438 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i,n) fo... | #include<bits/stdc++.h>
const double pi=acos(-1.0);
using namespace std;
#define endl '\n'
#define sl(n) scanf("%lld",&n)
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define ll long long
#define ull unsigned ... | 0 | 74,509,930 |
#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
int i, j,max;
int m[10];
for (i=0; i < 10; i++){
cin >> m[i];
}
for (i = 0; i < 3; i++){
max = 0;
for (j = 1; j < 10; j++){
if (m[j]>m[max]){
max = j;
}
}
printf("%d\n", m[max]);
m[max] = -1;
}
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using vvll = vector<vll> ;
using pll = pair<ll,ll> ;
#define all(v) v.begin(),v.end()
ll INF = 1ll<<61 ;
void chmax(ll &a,ll b){ if(a<b) a = b ;}
void chmi... | 0 | 60,498,488 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | #include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
int main(){
string s; cin >> s;
stack<char> st;
int ans = 0;
rep(i, s.length()){
if(st.e... | 0 | 16,027,024 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define all(obj) (obj).begin(), (obj).end()
static const int dx[4] = {0, 1, 0, -1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'u', 'r', 'd', 'l'};
static const ll INF = 1 << 21;... | #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>;
int main(){
string s; cin >> s;
for(int i = 0; i < s.size() - 1; i++){
... | 0 | 64,401,717 |
#include<iostream>
using namespace std;
#include<stdlib.h>
#include<stdio.h>
int main()
{
int i, n, d, p, q;
scanf("%d", &n);
int *P, *C, *S;
P = new int [n]; C = new int [n]; S = new int [n];
if(P == NULL || C == NULL || S == NULL) exit(EXIT_FAILURE);
for(i = 0; i < n; i++){ P[i] = -1; ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef vector<pii> vii;
typedef vector<pil> vil;
typedef vector<p... | 0 | 30,013,247 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define INF (INT_MAX)
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main(){
int n,d,x;
cin>>n>>d>>x;
int ans=0;
rep(i,n){
int a;
cin>>a;
ans+=(d-1)/a;
}
cout<<ans+x+n<<endl;
} | #include <bitset>
#include <vector>
#include <cstdio>
#include <iostream>
#define ll long long
#define vi vector<int>
using namespace std;
ll _sieve_size;
bitset<10000010> bs;
vi primes;
void sieve(ll upperbound) {
_sieve_size = upperbound + 1;
bs.set();
bs[0] = bs[1] = 0;
for (ll i = 2; i <= _sieve_size; i++)... | 0 | 3,842,075 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define powerof2 ()
#define mp make_pair
#define pi acos(-1)
using ll = long long;
const ll M = 1000000007;
const ll M1= 998244353;
using vl = vector<ll>;
using pll = pair<ll,ll>;
ll power(ll x,ll y){
if(y==0)
return ... | #include <bits/stdc++.h>
#include <climits>
#ifdef atclib
#include <atcoder/all>
#endif
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef boost
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ld long double
#define ull unsigned long long
#define vi std... | 0 | 85,869,865 |
#include<bits/stdc++.h>
using namespace std;
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef priority_queue<ll> pq;
#define f first
#define s second
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n,m;
bool adj[10][10];
int go(int u,int mask){
int cnt=0;
for(int v=0;v<n;++v)
if(!(mask>>v&1)&&adj[u][v]){
int nmask=mask|(1<<v);
if(nmask==(1<<n)-1) return 1;
else cnt+=go(v,mask|(1<<v));
}
return cnt;
}
int main() {
ios_base::syn... | 0 | 36,850,432 |
#include <bits/stdc++.h>
using namespace std;
const double PI=acos(-1.0);
int main()
{
double a,b,x,ans;
cin>>a>>b>>x;
double s=x/a;
if(s*2.0<=a*b)
{
double aa=s*2.0/b;
ans=90.0-atan(aa/b)*180.0/PI;
}
else
{
double x=(s*2.0-a*b)/a;
ans=90.0-atan(a/(b-x))*180.... | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | 0 | 14,554,789 |
#include <iostream>
#include <string>
#include <sstream>
using namespace std;
int stoi(string str) {
int ret;
ret = int(str[1])-48;
return ret;
}
int main() {
int n, min, flg;
string tmp;
cin >> n;
string *org = new string[n];
string *a = new string[n];
for (int i = 0; i < n; i++)
cin >> org[i];
for (int i... | #include <bits/stdc++.h>
int main() {
char str[1024];
char ope[256];
char obj[1024];
int q;
int a, b;
char temp;
scanf("%s", str);
scanf("%d", &q);
for(int i = 0; i < q; ++i) {
scanf("%s", ope);
if( strcmp("replace", ope) == 0 ) {
scanf("%d %d", &a, &b);
scanf("%s", obj);
for... | 0 | 51,321,994 |
#include <algorithm>
#include <iostream>
struct Card {
char suit;
unsigned int rank;
Card() = default;
Card(const Card&) = default;
Card& operator=(const Card&) = default;
bool operator!=(const Card& rhs) const { return rank != rhs.rank || suit != rhs.suit; }
bool operator<(const Card& rhs) const { return... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
for (int x = 0; x <= N; x++) {
for (int y = 0; y <= N; y++) {
if (N - x - y < 0) break;
int total = 10000 * x + 5000 * y + 1000 * (N - x - y);
if (total == Y) {
cou... | 0 | 80,234,864 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
int a[5];
int main(){
rep(i,5) cin >> a[i];
sort(a, a+5, greater<int>());
rep(i,5){
cout << a[i];
if(i == 4) break;
cout << " ";
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecVec = vector<Vec>;
#define REP(i, m, n) for(ll (i) = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for(ll (i) = (m); (... | 0 | 58,037,403 |
#include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
using namespace std;
typedef pair<int,int> P;
const ll mod=1000000007;
int main() {
ll a,b,k;
cin >> a >> b >> k;
if(k<=a)cout<<a-k<<" "<<b<<endl;
else{
k-=a;
if(k<=b){
cout<<0<<" "<<b-k<<endl;
}
else co... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_pair
#define all(... | 0 | 30,519,753 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n , k ;
cin >> n >> k ;
int ball = n-k;
if(k==1){cout <<0<<endl;}
else cout <<ball<<endl;
} | #include <iostream>
using namespace std;
int main()
{
int n,y,m,d;
int y3,yd,m2,md,dd,y2;
cin >> n;
for(int i=0;i<n;i++){
cin >> y >> m >> d;
if(y%3!=0) y2=y+(3-y%3);
else y2=y;
y3 = 334-y2/3;
yd = y3*200 + (1000-y-y3)*195;
m2 = m/2;
if(y%3!=0){
md = yd-39*m2;
if(m%2==1){
dd = md-d+1;
}el... | 0 | 97,118,055 |
#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... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | 0 | 98,332,362 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
string s, t;
cin >> s >> t;
cout << (s == t.substr(0, s.size()) ? "Yes" : "No") << '\n'... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string N;
cin >> N;
for(int i = 0; i < 8; i++) {
string ans;
ans += N.at(0);
int sum = N.at(0) - '0';
for(int j = 0; j < 3; j++) {
if(i >> j & 1) {
sum += N.at(j + 1) ... | 0 | 58,690,922 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char a,b;
cin>>a>>b;
if(a!=b){
cout<<'D'<<endl;
}
else{
cout<<'H'<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
template <typename T>
inline T gcd(T a, T b) { while (b != 0) swap(b, a %= b); return a; }
int main(){
int n;
cin >> n;
map<int, in... | 0 | 40,630,887 |
#ifndef _WIN32
#include<iostream>
#endif
#include<string>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
#define FOR(i,bg,ed) for(int i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
typedef vector<string> VS;
VS wrap(VS v,char c) {
int R = v.size(), C = v[... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
struct Node {
int key;
Node *prev, *next;
};
Node *nil;
void init() {
nil = (Node *) malloc (sizeof(Node));
nil->next = nil;
nil->prev = nil;
}
void insert(int key) {
Node *x = (Node *) malloc (sizeof(Node));
x->key ... | 0 | 90,453,727 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int cnt1 = 0,cnt2 = 0;
for ( int i = 0; i < n; i++){
if ( i % 2 == 0 ){
if ( s[i] != '1' ){
cnt1++;
}
}else{
if ( s[i] != '0' ){
cnt1++;
}
}
}
for ( int i = ... | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 2e5 + 100;
char str[maxn];
int a[maxn];
int dp[(1<<26)];
void print(int x)
{
while(x){
cout<<x%2;
x/=2;
}
cout<<endl;
}
int main()
{
cin>>str;
int L = strlen(str), ans = 0;
for(int i = ... | 0 | 70,335,210 |
#include <iostream>
using namespace std;
string s; int a=1; int maX=0;
int main()
{
cin >> s;
for(int x=0; x<s.length();x+=1)
if (s[x] == 'R')
{
if(s[x]==s[x-1])
a=a+1;
else
a=1;
maX = max (maX,a);
}
cout << maX;
} | #include <iostream>
#include <vector>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<vector<char>>vec(h,vector<char>(w));
vector<int>dx{ 0, 1, 0, -1};
vector<int>dy{ 1, 0, -1, 0};
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
cin >> vec[i][j];
}
... | 0 | 65,534,135 |
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main()
{
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << setprecision(5)
<< (double)sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pai acos(-1)
#... | 0 | 28,965,357 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.