code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <queue>
#include <cmath>
using namespace std;
struct vertex{
double x;
double y;
};
void printqueue(queue<vertex*> q){
while (!q.empty()){
cout << "(" << q.front()->x << "," << q.front()->y << "), ";
q.pop();
}
cout << endl;
}
void printans(queue<vertex*> q){
while (!q.empty()){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long count=0;
cin >> N;
vector<int>vec(N);
for(int i=0;i<N;i++){
cin >> vec.at(i);
}
for(int i=0;i<N;i++){
if(i==N-1){
count+= vec.at(i)/2;
}
else if(vec.at(i)%2==1){
count += vec.at(i)/2;
if(vec.at(i+... | 0 | 99,685,905 |
#include<cstdio>
#include<algorithm>
int main(){
int a[5];
while(~scanf("%d",&a[0])){
for(int i=1;i<5;i++){
scanf("%d",&a[i]);
}
std::sort(a,a+5);
std::reverse(a,a+5);
for(int i=0;i<4;i++){
printf("%d ",a[i]);
}
printf("%d\n",a[4]);... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#include <cassert>
#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()
using namespace std;
using ll = long long;
usin... | 0 | 23,312,845 |
#include <iostream>
using namespace std;
long long fact(int n) {
return (n == 1) ? 1 : n * fact(n - 1);
}
int main()
{
int n;
while (cin >> n) {
cout << fact(n) << endl;
}
return 0;
} | #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(){
string s;
cin >> s;
vector<int> a(3);
rep(i,3){
if(s.at(i)=='a') a.at(0) ++;
else if(s.at(i)... | 0 | 88,975,489 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | #include<bits/stdc++.h>
using namespace std;
int main() {
int N, M; cin >> N >> M;
for (int i = 0; i < M; i++) {
if (N % 2 == 0) {
if (i % 2 == 0) {
int j = i / 2 + 1;
cout << j << ' ' << N + 1 - j << endl;
} else {
int c = N / 2 + 1;
int d = (i + 1) / 2;
cout... | 0 | 93,217,861 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll taka,aoki,k;
cin >> taka >> aoki >> k;
ll ans1, ans2;
ll temp1 = taka, temp2 = aoki;
taka = taka - k;
if (taka <= 0){ans1 = 0; }else{ ans1 = ta... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using ii = pair<int, int>;
using vii = vector<ii>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) (int)(x).size()
#define eb emplace_back
#define pb push_back
#def... | 0 | 96,026,672 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#define int long long
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define rea... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n, k;
cin >> n >... | 0 | 35,503,254 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=1000000007;
#define INF (1<<30)
#define LINF (lint)(... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
while(1) {
int n,a,b,c,x;
cin >> n >> a >> b >> c >> x;
if(!(n||a||b||c||x)) break;
int y[20000] = {0};
for(int i = 0; i < n; i++) cin >> y[i];
int i = 0, f = 0;
while(1) {
if(x == y[i]) {
i++;
... | 0 | 54,940,582 |
#include <bits/stdc++.h>
using namespace std;
signed main(){
int P, Q, R;
scanf("%d%d%d", &P, &Q, &R);
printf("%d\n", P + Q + R - max({P, Q, R}));
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000010;
constexpr ll INF= 5000000000000000000;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll,ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
... | 0 | 79,386,887 |
#include<stdio.h>
int main() {
char character1[100];
char character2[100];
scanf("%s", character1);
scanf("%s", character2);
printf("%s%s", character2, character1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int64_t LCM(int x, int y)
{
return x / __gcd(x, y) * y;
}
int f(int x)
{
int ret = 0;
while (x % 2 == 0)
{
x /= 2;
ret++;
}
return ret;
}
int main()
{
int64_t N, M;
cin >> N >> M;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
{
cin >> A... | 0 | 78,851,207 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset tree<long long , null_type,less_equal<long long >, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_set tree<long long , null_type,less<long long >, r... | #include<iostream>
#include<vector>
int main(){
int N,K;
std::cin>>N>>K;
std::vector<unsigned long long> maxs(N+2),mins(N+2);
maxs[N+1]=N*((unsigned long long)N+1)/2;
mins[0]=0;
for(unsigned long long i=1;i<=N+1;++i){
mins[i]=(i-1)+mins[i-1];
maxs[N-i+1]=maxs[N-i+2]-(i-1);
}
... | 0 | 64,156,479 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(),a.end()
typedef pair<int,int>pint;
typedef v... | #include <iostream>
using namespace std;
int main() {
int N = 0, K = 0;
cin >> N >> K;
int num = 1;
for(int i = 0; i < N; i++) {
if(num*2 < num+K) {
num *= 2;
} else {
num += K;
}
}
cout << num << endl;
} | 0 | 51,659,182 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
templa... | 0 | 4,214,989 |
#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;
cin >> N;
int A[N];
int B[N];
for(int i = 0; i < N; i++){
cin >> A[i];
B[i] = A[i];
}
sort(B,B + N);
int max_v =... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
template<class T>
vector<pair<T,int>> run_length_encoding(const vector<T>& a){
vector<pair<T,int>> res;
int n=a.size(),pre=0;
rep(i,n) if(i==n-1 || a[i]!=a[i+1]) res.emplace_back(a[i],i-pre+1), pre=i+1;
return res;
}
int main(){
... | 0 | 1,068,811 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
long double pi=3.1415926535897932;
long double a,b,x,y,ans; cin>>a>>b>>x;
... | #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 (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | 0 | 67,198,180 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#de... | #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 | 77,687,727 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
string s, ss;
cin >> s >> ss;
int a = s.size();
rep(i, 0, a){
if(s[i] != ss[i]){
cout << "No\n";
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 319,011 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
int main()
{
int A, B;
string S;
cin >> A >> B;
cin >> S;
if (S.size() != A + B + 1) {
cout << "No\n";
return 0;
}
if (S.find('-') != A) {
cout << "No\n";
return 0;
}
for (int i = 0; i < S.size(); i++)... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long int n,i,count=0;
cin>>n;
string s;
for(i=1;i<=n;i++)
{
s=to_string(i);
long int l=s.size();
if(l%2!=0)
{
count++;
}
}
cout<<count;
} | 0 | 3,457,157 |
#include<iostream>
#include<vector>
#include<map>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
using namespace std;
#define ll int64_t
#define REP(i, n) for (ll i=0; i<n; i++)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
vector<ll> N(4);
REP(i, 4) cin... | #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);
string s;
cin>>s;
if(s[0]!='A')
{
cout<<"WA"<<endl;
return 0;
}
... | 0 | 61,908,439 |
#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() {
ll a, b;
cin >> a >> b;
ll ans = a;
while(1) {
if(ans % b == 0) {
break;
}
ans += a;
}
cout << ans << endl;
... | #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)
#... | 0 | 96,000,337 |
#include <iostream>
int N;
void solve() {
std::cin >> N;
std::cout << (1+N)*(N)/2 << std::endl;
}
int main() {
solve();
return 0;
} | #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>
using namespace std;
#define SAY... | 0 | 31,492,675 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef v... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define REP(i,k,n) for(int i = k; i < (int)(n); i++)
#define vi vector<int>
#define pb push_back
typedef long long ll;
using namespace std;
int main(){
char d1[5] = {'.',',','!','?',' '};
int n;
while(cin >> n) {
rep(i,n){
... | 0 | 87,335,915 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <queue>
#include <bitset>
#pragma GCC optimize(2)
#define INF 0x3f3f3f3f
using namespace std;
typ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
set<char> a;
rep(i, s.size()) a.insert(s[i]);
for (char c = 'a'; c <= 'z'; c++) {
bool ok = true;
for (auto e : a)
if (c == e... | 0 | 93,017,493 |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{
int a,b,c,r,s,t,d,x=0,u;
scanf("%d%d%d%d", &a,&b,&c,&d);
r=abs(a-b);
s=abs(b-c);
u=abs(a-c);
if(r<=d&&s<=d)
x=1;
else if(u<=d)
x=1;
if(x==1)
printf("Yes\n");
else
printf("No\n");
re... | #include<iostream>
int main(){
int na,nb,nc;
std::cin>>na>>nb>>nc;
if(na < nb && nb < nc)
std::cout<<"Yes"<<std::endl;
else
std::cout<<"No"<<std::endl;
return 0;
} | 0 | 29,859,887 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using Graph = vector<vector<bool>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
... | #include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,... | 0 | 25,202,052 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <queue>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;i>=n;--i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, con... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD=1000000007;
int main() {
int N; cin>>N;
long long int T; cin>>T;
vector<ll> t(N,0);
ll ans=0;
for(int i=0;i<N;i++){
cin>>t[i];
}
for(int i=0;i<N-1;i++){
if(t[i+1]-t[i]>=T){
ans+=T;
... | 0 | 4,401,872 |
#include <iostream>
#include <cstdio>
#include <cctype>
using namespace std;
int main(void){
char c;
while(1){
c = getchar();
if(islower(c))
c = toupper(c);
else if(isupper(c))
c = tolower(c);
cout<<c;
if(c=='\n')
break;
}
return 0;
} | #include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n)... | 0 | 48,945,840 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
#define topo_SIZE 10000
vector<int> topologicalSort(vector<vector<int> > G,int n=-1){
int indeg[topo_SIZE] =... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 0 | 46,263,916 |
#define TRUE true
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<long long, long long>;
template <class T>
using vec = vector<T>;
template ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> P(N);
vector<int> Q(N);
for(int i = 0; i < N; i++) cin >> P.at(i);
for(int i = 0; i < N; i++) cin >> Q.at(i);
vector<int> kaijou(N+1, 1);
for(int i = 1; i < N+1; i++) kaijou.at(... | 0 | 35,507,052 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define ep emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | 0 | 9,386,958 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
int ans=1;
cin >> N >> M;
int i=0;
while(i<N){
if(ans<M){
ans *=2;
}else{
ans += M;
}
i++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | 0 | 81,598,124 |
#include<bits/stdc++.h>
#define ll long long
#define debug(x) cout<<x<<"DE"<<endl;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll noo=0,noz=0;
string s;
cin>>s;
for(int i=0;i<s.size();i++){
if(s[i]=='0')noz++;
else noo++;
}
cout<<2ll... | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | 0 | 84,982,385 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll sum[200009];
ll a[200009];
int main()
{
int n;
cin>>n;
ll t=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
sum[i]=sum[i-1]+a[i];
}
ll minn=1e15;
for(int i=1;i<=n-1;i++)
{
minn=min(minn,abs(sum[i]-(sum... | #include <bits/stdc++.h>
using namespace std;
int LCS(const string& a, const string& b) {
int ans = 0;
const int len_a = a.length(), len_b = b.length();
int dp[len_a + 1][len_b + 1] = {};
for(int i=1; i<=len_a; i++) {
for(int j=1; j<=len_b; j++) {
dp[i][j] = max(dp[i][j], dp[i-1][j] );
dp[i][... | 0 | 60,122,459 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s,p;
cin>>s>>p;
int l = p.length();
int inc = 0;
for(int i=0;i<l;++i){
if(s.find(p) != string::npos){inc = 1;break;}
s = s[s.length()-1] + s.substr(0,s.length()-1);
}
cout<<(inc?"Yes":"No")<<endl;
} | #include <iostream>
int main(int argc, char **argv){
for(int i = 1; i < 10; i++){
for(int j = 1;j < 10; j++){
std::cout << i << "x" << j << "=" << i * j;
std::cout << std::endl;
}
}
} | 0 | 37,446,601 |
#include <stdio.h>
int main()
{
long int a,b,i,m,n=0;
scanf("%ld %ld",&a,&b);
for(i=1;i<=b;i++)
{
scanf("%ld",&m);
n=n+m;
}
if(n>=a)
{
printf("Yes\n");
}
else
printf("No\n");
return 0;
} | #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 FOR(i,a,n) for(ll i=a;i<(ll)(n);i++)
int main(){
int N; cin>>N;
double sum = 0;
rep(i, N){
double x;
string u;
cin>>x>>u;
if(u... | 0 | 45,274,175 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
int main(){
int n,f=0;
cin >> n;
int a[n], ans=1;
for(int i=0;i<n;i++)
cin >> a[i];
for(int i=0;i<n;i++){
for(int j=0;j<i;j++){
if(a[j]<=a[i])
f=1;
else{
f=0;
break;
}
... | 0 | 69,929,312 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s,t;
int main(){
cin >> s >> t;
int len1 = s.size();
int len2 = t.size();
int ans = 0;
for(int i = len1 - len2;i>=0;i--){
int cnt = 0;
for(int j = 0;j<len2;j++){
if(s[i + j] == t[j]) {
... | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | 0 | 66,118,929 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string b; cin >> b;
string ans;
if (b == "A") ans = "T";
if (b == "T") ans = "A";
if (b == "C") ans = "G";
if (b == "G") ans = "C";
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iterator>
#include <map>
#include <iomanip>
using namespace std;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define prec std::cout << std::fixed << std::setprecision(15);
#define endl "\n"
#de... | 0 | 72,993,865 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i,n) for(int i=0;i<n;i++)
const ll MOD = 1000000007;
ll cnt =0,ans=0;
const int MAX = 510000;
int main(){
int n,k;
map<int,int>mp;
cin >> n >> k;
int d[110],a[110][110];
for(int i=1;i<=k;i++){
... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define RREP(i,a) for(int i = a;i >= 0;i--)
#define rep(i,n) for(int i = 0;i < (n);i++)
#define rrep(i,n) for(int i = n - 1;i >= 0;i--)
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
... | 0 | 64,322,045 |
#include <iostream>
using namespace std;
int main(void) {
double dist, time, speed;
cin >> dist >> time >> speed;
if ((dist / speed) <= time) {
cout << "Yes";
}
else {
cout << "No";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODAD... | 0 | 34,276,557 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define VI vector<int>
#define PII pair<int,int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define db double
#define all(x) (x).begin(),... | #define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _ov... | 0 | 86,268,522 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mxN = 1e5;
ll N, h[mxN], dp[mxN];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for(int i = 0; i < N; ++i)
cin >> h[i];
for(int i = 1; i < N; ++i){
dp[i] = dp[i-1]+abs(h[i]-h[i-1]);
if(i>=2)
dp[i] = min(dp[i], dp[i-2... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int a, b;
string s;
std::cin >> a >> b >> s;
bool ok = true;
rep(i, s.size()) {
if (i == a) {
if (s[a] != '-') {
ok = false;
break;
... | 0 | 16,791,525 |
#include <bits/stdc++.h>
using namespace std;
#define long long long
const long MOD = 1e9+7, LINF = 1e18 + 1e16;
const int INF = 1e9+1;
const double EPS = 1e-10;
const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
class TaskD {
long k, n, a[51];
public:
void solve(istream &cin, ostream &cout) {
cin >> k;
n = ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long int q, h, s, d;
long double n;
cin >> q >> h >> s >> d >> n;
long long int ans = 0;
if (h >= 2 * q)
{
h = 2 * q;
}
if (s >= 2 * h)
{
s = 2 * h;
}
if (d >= 2 * s)
{
d = 2 * s;
}
while (n != 0)
{
if (n >= 2)
{
ans += (int)(n ... | 0 | 66,311,938 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
ll n, t;
cin >> n >> t;
ll limit = t;
ll ans = t;
vector<ll> time(n);
rep(i, n) cin >> time[i];
rep(i,n){
if(i > 0){
if(time[i] >=limit){
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE>
void print_vec(const vector<TYPE>& v){
for(int i=0; i<v.size(); i++){
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
cout << endl; cout << " ";
for... | 0 | 74,328,161 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define all(v) v.begin(), v.end()
#define ll long long
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<long long>;
using vvll = vector<vll>;
ll powll(ll ... | #include <iostream>
using namespace std;
int main()
{
int A,B;
cin>>A>>B;
if(A==1)
{
if(B==1)
cout<<"Draw";
else cout<<"Alice";
}
else if(B==1)
{
if(A==1)
cout<<"Draw";
else cout<<"Bob";
}
else {
if(A>B)
cout... | 0 | 42,371,581 |
#include <bits/stdc++.h>
#define Data_Nerd ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define files freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
using namespace std;
using ll = long long;
const int N = 1e5 + 1;
ll arr[N];
int main() {
Data_Nerd
int n, m; scanf("%d%d", &n, &m);
for(int... | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | 0 | 81,095,573 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int r,g,b,n;
cin >> r >> g >> b >> n;
int ans = 0;
for(int i = 0; i <= 3000; i++){
for(int j = 0; j <= 3000; j++){
int l = 0; int R = 3001;
while(R-l > 1){
int mid = (l+R)/2;
if... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long 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; }
r... | 0 | 76,601,213 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int H,W;
char buf[105][105];
int main(){
scanf("%d %d",&H,&W);
for(int row = 0; row < H; row++){
s... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | 0 | 39,598,243 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int alpha[26];
string sen;
char abc[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
for(int i=0;i<26;i++) alpha[i]=0;
while(1){
getline(cin,sen);
if(sen.empty()) break;
for(int ... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | 0 | 18,228,883 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans=(1<<25);
cin >> n;
int a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a,a+n);
for(int i=a[0];i<=a[n-1];i++){
int sum=0;
for(int j=0;j<n;j++){
int s=abs(a[j]-i);
sum+=s*s;
}
ans=min(ans,sum);
}
cout << a... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' ';... | 0 | 28,706,944 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
using namespace std;
#define ll long long
#define il inline
const int maxn=1000010;
int a[maxn],n,tot[maxn];
int prime[maxn],notprime[maxn];
int d[maxn];
int prime_tot;
il int read... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 | 31,727,339 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0);
string s;
cin >> s;
if(s.length() == 2) {
if(s[0] == s[1]) cout << "1 2" << endl;
else cout << "... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | 0 | 9,313,974 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#inclu... | #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 | 55,179,540 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using Grid= vector<vector<char>>;
using vin= vector<int>;
using ll=long long;
using vll= vector<ll>;
using vbl=vector<bool>;
using vch=vector<char>;
using pnn=pair<int ,int>;
#define ft first
#define sd second
#define fn front
#define pb p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int len[10];
int n, A, B, C;
int dfs(int ind, int a, int b, int c){
if(ind == n){
if(a && b && c)return abs(a - A) + abs(b - B) + abs(c - C);
return 1e9;
}
int ans = dfs(ind + 1, a, b, c);
... | 0 | 57,227,366 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | #include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ss second
#define ar array
#define int long long
#define ld long double
#define pb push_back
#define mp make_pa... | 0 | 61,775,675 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
set<char> st;
for (int i = 0; i < s.size(); i++) {
st.insert(s.at(i));
}
for (int i = 0; i < 26; i++) {
if (!st.count(i + 'a')) {
char c = i + 'a';
cout << c << endl;
return 0;
}
}
cout << "None"... | #include <iostream>
#include <deque>
#include <stdio.h>
#include <cstdio>
#include <algorithm>
#include<bits/stdc++.h>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define sp <<" "
#define nw <<"\n"
#define ca "Case "<<tc++<<": "
#define IOS ios_base::sync_with_stdio(0);cin.ti... | 0 | 72,535,840 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
ll a[90];
a[0] = 2; a[1] = 1;
for(int i=2; i<n+1; ++i) a[i] = a[i-1]+a[i-2];
cout << a[n] << endl;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define maxs(x,y) x = max(x, y)
#define mins(x,y) x = min(x, y)
using namespace std;
using ll = long long;
typedef pair<int, ... | 0 | 84,498,307 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,monster = 0,sum = 0;
cin >> n;
vector<int> city(n+1);
vector<int> hero(n);
for (int i = 0; i < n+1; i++){
cin >> city.at(i);
monster += city.at(i);
}
for (int i = 0; i < n; i++){
cin >> hero.at(i);... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n,k,x,y;
cin>>n>>k>>x>>y;
if(n>=k)
{
ll a=k*x;
ll b=y*(n-k);
ll c=a+b;
cout<<c<<endl;
}
else
{
ll c=n*x;
cout<<c<<endl;
}
} | 0 | 83,461,348 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
char str[33];
char l[15] = {'q', 'w', 'e', 'r', 't', 'a', 's', 'd', 'f', 'g', 'z', 'x', 'c', 'v', 'b'};
char r[11] = {'y', 'u', 'i', 'o', 'p', 'h', 'j', 'k', 'l', 'n', 'm'};
while(1){
cin >> str; if(str[0] == '#') break;
int counter = 0;
... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int (i)=0;i<(n);i++)
#define REP(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define INF INT_MAX
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
#define int long long
#d... | 0 | 32,325,403 |
#include <iostream>
#include <map>
using namespace std;
int main()
{
map<int, pair<int, int>> pos;
for(int i=0, val; i<3; i++) {
for(int j=0; j<3; j++) {
cin >> val;
pos[val] = {i, j};
}
}
bool card[3][3] = {{0, 0, 0},{0, 0, 0},{0, 0, 0}};
int q;
cin >> q;... | #include <iostream>
using namespace std;
int c;
void search(int last, int s, int n)
{
if(n==0){
if(s==0) c++;
return;
}
if(n==1){
if(last<s&&s<10) c++;
return;
}
--n;
for(int i=last+1; i<10; i++){
search(i, s-i, n);
}
}
int main()
{
ios::sync_with_... | 0 | 44,254,393 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b)... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+9;
int a[maxn];
int main()
{
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
while(k--)
{
int b[maxn];
memset(b,0,sizeof(b));
for(int i=1;i<=n;i++)
{
int l = max(1,i-a[i]);
... | 0 | 79,350,433 |
#include <bits/stdc++.h>
using namespace std;
template <class T> T input() {T t; cin>>t; return t;}
#define FOR(i,a,b) for (ll i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (ll i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,x) for (ll i = 0; i < x.size(); i++)
#define RREP... | #pragma GCC optimize("O3")
#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... | 0 | 29,373,104 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(n+1, 0);
vector<bool> broken(n+1, false);
for (int i = 0; i < m; i++) {
int x;
cin >> x;
broken[x] = true;
}
dp[0] = 1;
... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | 0 | 20,752,766 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define pb push_back
#define pf push_front
#define Pf pop_front
#define MN 100005
using namespace std;
inline int in(){
int x=0;bool f=0;char c;
for (;(c=getchar())<'0'||c>'9';f=c=='-');
for (x=c-'0';(c=getchar())>='0'&&c<='9';x=(x<<3)+(... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 0 | 94,377,097 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = s.size()/2-1; i>0; i--) {
if (s.substr(0,i) == s.substr(i,i)) {
cout << i * 2 << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
#define dame { puts("-1"); return 0;}
#define yn {puts("... | 0 | 90,031,620 |
#include<iostream>
#include<vector>
using namespace std;
void func(int &y, int &m, int &d){
d++;
if(y%3==0){
if(d>20)m++,d=1;
}
else if(m%2==1){
if(d>20)m++,d=1;
}
else if(d>19)m++,d=1;
if(m>10)y++,m=1;
}
int main(void){
int n;
cin >> n;
while(n--){
int y,m,d;
cin >> y >> m >> d;... | #include <iostream>
#include <cmath>
typedef long long ll;
using namespace std;
int arr[105];
ll ways(int N, int P, int even, int odd) {
if(even == N) {
if(P == 0) return pow(2, N);
else if(P == 1) return 0;
}
return pow(2, N-1);
}
int main() {
ios_base::sync_with_stdio(false);
... | 0 | 34,279,574 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
int main(){
int n, x, t; cin >> n >> x >> t;
cout << int(ceil(n * 1.0 / x) * t) << endl;
} | #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 | 65,025,389 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define ll long long
#define INF 1e+9
int n;
void warshall_floyd(vector<vector<int> > &d) {
for(int k = 0; k < n; k++) {
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
d[i][j] = min(d[i... | #include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... | 0 | 92,394,993 |
#include<stdio.h>
#include<cstdlib>
int H;
int parent(int i){
if(i == 1) return 0;
return i / 2;
}
int left(int i){
if(i * 2 > H) return 0;
return i * 2;
}
int right(int i){
if(i * 2 + 1 > H) return 0;
return i * 2 + 1;
}
void PrintAllElement(int *A){
int i;
for(i = 1; i < H + 1; i++){
printf("node... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
template<typename T>
void printv(const vector<T>& s) {
for(int i=0;i<(int)(s.size());++i) {
cout << s[i];
if(i == (int)(s.size())-1) co... | 0 | 51,613,637 |
#include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
long long n, res;
int main() {
DAU
cin >> n;
res = n * (n - 1) / 2;
cout << res;
PLEC
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) begin(v), end(v)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
template<class T1, class T2> void... | 0 | 81,083,769 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++){
double score = i;
double coin = 1.0/n;
while (score < k)... | #include<bits/stdc++.h>
using namespace std;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int L=-1,R=100001,l,r,n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>l>>r;
L=max(L,l);
R=min(R,r);
}
cout<<max(R-L+1,0);
return 0;
} | 0 | 28,647,928 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
int main()
{
vector<int> ans_list;
while (1)
{
int m... | #include <iostream>
#include <vector>
#include <queue>
int main() {
unsigned int N, M;
std::cin >> N >> M;
std::vector<std::vector<unsigned int>> day_jobs(100000 + 5);
for (unsigned int i = 0; i < N; ++i) {
unsigned int a, b;
std::cin >> a >> b;
day_jobs.at(a).push_back(b);
}
std::priority_queue... | 0 | 73,299,291 |
#include <cstdio>
#include <algorithm>
using namespace std;
int a[100009], b[100009];
int main(){
int n, k, mask;
scanf("%d %d",&n, &k);
for(int i = 0; i < n; i++){
scanf("%d %d", a+i, b+i);
}
k++;
long long ans = 0;
for(int bit = 30; bit >= 0; bit--){
if((k >> bit) & 1){... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
void darts();
void longest_dis();
void sum_of_three_integers();
int main()
{
sum_of_three_integers();
}
void darts()
{
while (true)
{
int n, m;
cin >> n >> m;
if (n == 0) break;
vector<int> p(n);
... | 0 | 33,104,103 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, sum, cond, count;
sum = 0;
count = 0;
cin >> N >> M;
vector<int> A(N);
for(int i = 0; i < N; i++){
cin >> A[i];
sum += A[i];
}
cond = sum /(4*M) ;
for(int i = 0; i < N; i++){
if(A[i]*4*M >= sum ){
count++;
}
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
long long modpow(long long a, long long n, long long mod=MOD) {
long long res = 1;
while (n > 0) {
if (n & 1... | 0 | 51,490,998 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
bool a[100005];
int main(){
ll n,k,i,again=0;
scanf("%lld",&n);
for(i=1;i<=n;i++){
scanf("%lld",&k);
if(a[k])again++;
else a[k]=true;
}
again+=again%2;
printf("%lld",n-again);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < a)... | 0 | 46,696,742 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#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)
constexpr int MOD = 100000... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
lli n, m;
int main(void){
cin >> n... | 0 | 98,075,635 |
#include <cstdio>
#include <cstring>
#include <queue>
#include <map>
#include <functional>
using namespace std;
int mins(int p,int q){
if(p<0)return q;
else if(q<0 || p<q)return p;
else return q;
}
int n,i,j;
int a,b,c;
int ari,man;
int lo,no,tai,mi;
typedef pair<int,int> mp;
mp pa;
int mati[10][11][2];
int daiyo... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n; int64_t ans = 0;
vector<int64_t> a(n), b(n);
priority_queue<pair<int64_t, int>> que;
for (auto i = 0; i < n; i++) {
cin >> a[i] >> b[i]; que.push({{a[i] + b[i]}, i});
}
for (auto i = 0; i < n; i++) {
auto ... | 0 | 1,701,607 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const ll INF = 1LL<<60;
int main(){
int a,b,c;
cin>>a>>b;
if(a==1){
if(b==2)
c = 3;
else
c = 2;
}
else if(a==2){
if(b==1)
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_... | 0 | 16,279,123 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int a, b, c; cin >> a >> b >> c;
int k; cin >> k;
int sum = 0;
while (a >= b) {
b *= 2;
sum++;
}
while (b >= c) {
c *= 2;
... | #include <iostream>
using namespace std;
int main(void) {
int m,f,r;
int sum;
while(cin >> m >> f >> r && (m != -1 || f != -1 || r != -1)) {
sum = m + f;
if(m == -1 || f == -1 || sum < 30)
cout << 'F' << endl;
else if(sum >= 80)
cout << 'A' << endl;
else if(sum >= 65 && sum < 80)
... | 0 | 92,917,356 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 998244353
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
string s; cin >> s;
int L = s.size(), cnt = 0;... | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
rep(i, N) cin >> A[i];
long long ans = 0, digit = 0;
int r... | 0 | 89,061,866 |
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define vi vector<int >
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin, (x).rend()
#define ll long l... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll locate(ll a,vector<ll> b){
for(ll i=0;i<b.size();i++){
if(a<b[i])return b[i];
}
return 0;
}
int main() {
ll N;
cin >> N;
string S;
cin >> S;
vector<vector<ll>> A(10,vector<ll>(0));
for(ll i=0;... | 0 | 65,931,653 |
#include <stdio.h>
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define print(x) cout<<(x)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define ll long long int
#define pb push_back
int ma... | #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<<" ";ne... | 0 | 27,229,659 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int MOD = 1e9 + 7;
const int INF = 2147483647;
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, ... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vint;
typedef vector<vint> vvint;
static int n;
static vint arr;
long long solve(void){
long long res = 0;
for(int i = 1; i < n; i++){
if(arr[i] < arr[i-1]){
res += arr[i-1] - arr[i];
arr[i] = arr[i-1];
}
... | 0 | 58,549,215 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x1,y1,x2,y2,x,y;
cin>>x1>>y1>>x2>>y2;
x=y2-y1,y=x1-x2;
cout<<x2-x<<" "<<y2-y<<" "<<x1-x<<" "<<y1-y;
} | #include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a)... | 0 | 29,976,667 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,n) for(ll i = (s); i < (n); i++)
#define rep0(i,n) rep(i,0,n)
#define rep1(i,n) rep(i,1,n+1)
#define repR(i,s,n) for(ll i = (n-1); i >= (s); i--)
#define repR0(i,n) repR(i,0,n)
#define repR1(i,n) repR(i,1,n+1)
#define BR "\n"
#define SP... | #include<bits/stdc++.h>
#define ll long long int
#define fr(i,n) for(ll i=0; i<n; i++)
#define fre(i,n) for(ll i=1; i<=n; i++)
#define pb push_back
#define mp(i,j) make_pair(i,j)
#define fi first
#define se second
#define pii pair<ll,ll>
#define ve vector
#define piii pair<pii, ll>
#define FAST ios_base::sync_with_std... | 0 | 43,522,667 |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn = 1 << 26;
int dp[maxn], opt[200010], pre[200010], cnt[26], INF = 1e9;
char s [200010];
int main()
{
for(int i = 1; i < maxn; i++)
dp[i] = INF;
scanf("%s", s + 1);
int n = strlen(s + 1);
for(int i = 1; i <= n; i++) ... | #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... | 0 | 35,767,274 |
#include<iostream>
#include<vector>
#include<algorithm>
int n,x;
std::vector<int> vec;
long long int num(){
long long int lli=0;
for(auto v:vec){
lli+=static_cast<long long int>(v);
}
return lli;
}
int main(){
std::cin>>n;
for(int i=0;i<n;++i){
std::cin>>x;
vec.push_back(x);
}
sort(vec.begin(),vec.end());... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { std::cout << #a << " = " << a << "\n"; }
template<class T1, clas... | 0 | 47,620,277 |
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<map>
#include<set>
#include<cstdlib>
#include<cmath>
#include<numeric>
#include<iomanip>
#include<functional>
#include<cstdlib>
#include<queue>
#include<deque>
#include <iterator>
const double PI = acos(-1);
using n... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
int n;
cin>>n;
vector<tuple<int,int,int>> a;
rep(i,n)... | 0 | 40,292,947 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
using namespace std;
#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... | 0 | 77,041,615 |
#include <cstdio>
#include <cmath>
int main() {
double x1, y1, x2, y2;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
printf("%.5lf\n", sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)));
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ii, int> ri3;
#define mp make_pair
#define pb push_back
#define fi first
#define sc second
#define SZ(x) (int)(x).size()
#define ALL(x) begin(x), end(x)
#define... | 0 | 9,166,670 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long;
int main() {
int n,m, cnt = 0;
cin >> n >> m;
vector< vector< bool > > adj(n, vector< bool > (n, 0));
vector< int > pp(n);
for (int i=0; i<n; i++) pp[i] = i;
for (int i=0; i<m; i++) {
int u,v;
cin >> u >> v;
--u,--v;
adj[u][v] = 1;
adj[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<ll, ll>;
int main()
{
ll n, d, a;
cin >> n >> d >> a;
vector<pint> xh(n);
rep(i, n) cin >> xh[i].first >> xh[i].second;
rep(i, n) xh[i].second = (xh[i].second % a == 0)... | 0 | 42,619,375 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
int main(void){
int n;
cin >> n;
int sum = 0;
vector<pair<string,int>> p(n);
for(int i = 0;i < n;i++){
cin >> p[i].first >> p[i].second;
sum += p[i].second;
}
string x;
cin >> x;
for(int i = 0;i <... | #include<bits/stdc++.h>
#define ll long long int
#define f(i,n) for(ll i = 0; i < n ; i++)
#define fn(i,n) for(ll i = 1; i <= n ; i++)
#define F first
#define pb push_back
#define S second
using namespace std;
ll dp[3005][3005];
char a[1001][1001];
ll r = 0, c = 0;
ll mn = INT_MAX;
ll mx = 1000000007;
ll numberOfPaths... | 0 | 58,599,305 |
#include <bits/stdc++.h>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
typedef long long ll;
using namespace std;
int h, w, k;
vector<vector<int>> c;
int del;
int main(){
int cnt = 0;
cin >> h >> w >> k;
c.resize(h);
rep(i, h){
c[i].resize(w);
rep(... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
namespace commit
{
long long
SolveSecondSum(const std::vector<int> &originalInputs)
{
long long sum = 0;
int increasingCount = 0;
int decreasingCount = 0;
for (std::size_t index = 1; index<originalInputs.size();... | 0 | 92,296,724 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string A, B;
string S;
cin >> A >> B >> S;
regex re = regex("^[0-9]{" + A + "}-[0-9]{" + B + "}$");
bool isValid = regex_match(S, re);
cout << (isValid ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> inputs(N);
rep(i, N){
cin >> inputs.at(i);
}
int min_n = inputs.at(0);
int max_n = inputs.at(0);
rep(i, N){
int x = inputs.at(i);
... | 0 | 31,833,062 |
#include<bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
#define ll long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
int main()
{
ll n,i,c=0;
cin>>n;
ll a[n];
for(int j=0;j<n;j++)
cin>>a[j];
for(i=0;i<n-1;i++)
{
while(a[i]>a[i+1])
{
a[i+1]++;
c++;
}
}
cout<<c<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int MOD = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
#define print(x) cout << x << endl
#define prints(x) cout << fixed << setprecision(10) << x << endl
#define printc(... | 0 | 35,958,735 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
string T = S.substr(2, S.size()-3);
int count = 0;
rep(i, T.size()) if( T[i] == 'C' ) count++;
int o = 0;
rep(i, S.size()) if( S[i] < 'a' || S[i] > 'z' ... | #include <bits/stdc++.h>
using namespace std;
string s;
int x, y;
int main()
{
cin >> s >> x >> y;
bitset< 2 * 8000 > dpx, dpy;
int cnt = 0, first = 0, N = s.size();
while (s[first++] == 'F');
dpx[8000 + --first] = dpy[8000] = 1;
bool isX = true;
for (int i = first; i < N; ++i) {
if (s[i] == 'F') cnt+... | 0 | 76,891,665 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <tuple>
#include <map>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <numeric>
#include <limits>
#include <unordered_map>
#include <map>
#include <cmath>
#include <deque>
#include <queue>
usin... | #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))... | 0 | 87,558,372 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
using namespace std;
struct node
{
long long d;int p;
}a[100010];
struct bian
{
int x,y,next;
}e[100010];int len,last[100010];
void ins(int x,int y)
{
len++;
e[len].x=x;e[len].y=y;
e[len].next=last[x];last[x]=len;
}
bool cmp(n... | #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 pb push_back
#define ll long long int
#define db double
#define SORTA(v) sort(v.begin(),v.end())
#define SORTD(v) sort(v.begin(),v.end(),greater<>())
#define... | 0 | 9,844,664 |
#include<bits/stdc++.h>
using namespace std;
int a,b;
int main() {
scanf("%d %d",&a,&b);
if(a-b<0) puts("0");
else printf("%d",a-b);
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005
int main() {
... | 0 | 37,076,508 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
cin >> A >> B >> C;
int aa,bb,cc;
aa= A * 10 + B + C;
bb= A + B * 10 + C;
cc= A + B + C * 10;
cout << max({aa,bb,cc}) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
int main()
{
int n; cin >> n;
vector<P> red;
vector<P> blue;
rep(i,n)... | 0 | 80,362,059 |
#include <stdio.h>
int main(){
char n;
for(;;){
scanf("%c",&n);
if(n=='\n'){break;
}
if(n<97&&n>=65){
n+=32;
}
else if(n>=97&&n<123){
n-=32;
}
printf("%c",n);
}
printf("\n");
return 0;
} | #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 ;
int mod = 998244353;
int cnt[N];
int32_t main(){
fast;
int n ; cin >> n ;
int in = 0;
for(int i = 0 ; i < n ; ++i){
... | 0 | 37,347,315 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.