code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n ;
cin>>n ;
vector<int> v(n) ;
for(int i=0;i<n;i++){
cin>>v[i] ;
}
vector<int> temp=v ;
sort(v.begin(),v.end()) ;
for(int i=0;i<n;i++){
if(temp[i]... | #include <iostream>
#include<string>
#include<cmath>
#include<ciso646>
#include<cstring>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<utility>
#include<map>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
ll Max = 10 + 1e12;
int N = 5 + 1e5;
int main(... | 1 | 35,674,572 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++);
using namespace std;
using ll = long long;
int main() {
cin.tie(0)->sync_with_stdio(false);
ll x, y;
cin >> x >> y;
vector<ll> ans(4, LONG_MAX);
if (x <= y) ans[0] = y - x;
if ((-1 * x) <= y) ans[1] = y - (-1 * x) + 1;
... | 1 | 67,695,827 |
#include <iostream>
using namespace std;
#include <math.h>
int main()
{
double x1, y1, x2, y2, x3, y3, x, y;
double ax, ay, bx, by;
double z1, z2, z3;
while (cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x >> y) {
ax = x2 - x1;
ay = y2 - y1;
bx = x - x1;
by = y - y1;
... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<vector>
#include<string>
#include<random>
using namespace std;
int main(){
double x[4], y[4];
while(cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> x[3] >> y[3]){
vector<bool> t(3, false);
for(int i=0; ... | 1 | 93,175,727 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define _READ freopen("input.txt", "r", stdin);
#define _FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int32_t main()
{
int n;
cin>>n;
vector<vector<int>> ar;... | #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)... | 1 | 63,934,110 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int a, b;
string s;
cin >> a >> b >> s;
bool ok = true;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b; cin>>a>>b;
string s; cin>>s;
for(char c:s.substr(0,a)) if('0'>c||c>'9'){
cout<<"No"; return 0;
}
if(s.substr(a,1)!="-"){
cout<<"No"; return 0;
}
for(char c:s.substr(a+1,b)) if('0'>c||c>'9'){
cout<<"No"; return 0;
}
cout<<"... | 1 | 1,591,835 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0; i < (ll)(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; }
con... | #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>... | 1 | 60,634,091 |
#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;
vector<vector<int>> edges(n);
rep(i, m) {
int a, b;
cin >> a >> b;
a--; b--;
edges.at(a).push_back(b);
edges.at(b... | #include<iostream>
#include<queue>
#include<cstring>
using namespace std;
struct node{
int c;
int next;
}e[2000005];
int head[200005];
int dis[200005];
int n,m;
int tot;
void add(int x,int y){
e[tot].c=y;
e[tot].next=head[x];
head[x]=tot;
tot++;
}
bool dfs(int x){
queue<int> q;
q.push(x);
dis[x] = 0;
while(q.... | 1 | 30,249,700 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n,k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pa... | #include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main() {
int n, d ;
cin >> n >> d ;
vector<vector<double>>... | 1 | 91,882,590 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define bn(n) (n).begin(), (n).end()
#define FOR(n) for(int i = 0; i < (int)n; i++)
void solve() {
string s;
cin >> s;
while(s.find('B') != string::npos) {
if (s.find('B') != 0) {
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
string t;
for(int i=0; i<s.size(); i++) {
if(s[i]=='0' || s[i]=='1') t += s[i];
else if(t.size() > 0) t.pop_back();
}
cout << t << endl;
return 0;
} | 1 | 100,689,924 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
void dijkstra(vector<vector<pair<long long,long long>>> &g, vector<long long> &dist, long long st){
long long INF=1e17;
long long n=g.size();
dist.assign(n,INF);
priority_queue<pair<long long,long long>,vector<pa... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | 1 | 73,137,682 |
#include <stdio.h>
char c[256];
void clear() {
int i; for (i = 0; i < 256; i++) c[i] = 0; }
int main() {
int n;
char f, t;
while (1) {
scanf("%d\n", &n);
if (!n) break;
clear();
while (n--) {
scanf("%c %c\n", &f, &t);
c[f] = t;
}
scanf("%d\n",... | #include <iostream>
#include <cstring>
using namespace std;
char s[100000000];
int main()
{
int n, m, i, j, k;
char a[80], b[80], c;
bool f = false;
while (cin >> n && n)
{
for (i = 0; i < n; i++)
{
cin >> a[i] >> b[i];
}
cin >> m;
strcpy(s, "");
for (i = k = 0; i < m; i++)
{
cin >> c;
for (... | 1 | 40,932,674 |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::string s;
std::getline(std::cin, s);
for (char c : s)
if (c == '1') std::cout << '9';
else if (c == '9') std::cout << '1';
else std::cout << c;
std::cout <... | #include<iostream>
using namespace std;
int main()
{
int num;
cin>>num;
int rev=0;
int sum=0,rem=0;
while(num!=0){
rem=num%10;
num=num/10;
if(rem==9){
sum=sum*10+1;
}
else{
sum=sum*10+9;
}
}
while(sum!=0)
{
rev=(rev*10)+(sum%10);
sum=sum/10;
}
cout<<rev;
retur... | 1 | 85,124,982 |
#include <stdio.h>
int main()
{
int numA, numB, sumBall, sum, count = 0;
scanf("%d %d", &numA, &numB);
sumBall = numA + numB;
int ball[sumBall];
for(int i = 0; i < numA; i++)
{
ball[0] = 2;
ball[i + 1] = ball[i] + 2;
}
for(int i = numA; i < sumBall; i++)
{
bal... | #include<iostream>
#include<stdio.h>
#include<cstring>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<math.h>
#define ll long long
#define d double
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int a[n],b[m];
int i;
int j;
int c1=2;
int c2=1;
for(i=0;i<n;i++){
a[i]=c1;
c1... | 1 | 53,393,426 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define repf(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<pair<ll, ll>> pf(ll n){
vector<pair<ll, ll>> res;
for (ll i = 2; i*i <= n; i++){
if (n%i != 0){
continue;
}
else{
ll ex = 0;
while (n%i == 0){
ex++;
... | 1 | 45,969,771 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] -= i + 1;
}
sort(A.begin(), A.end());
long long ans = 0;
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define mfill(x,y) memset(x,y,sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x,y,h,w) if(0<=x&&x<h&&0<=y&&y<w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr,__VA_ARGS__)
#else
#define debug(... | 1 | 25,273,743 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | #include<bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)1e18
#define pii pair<ll,ll>
#define mod 1000000007
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fb(i,a,b) for(ll i=a;i>b;i--)
#define ff first
#define ss second
#define PI 3.141592653589793238
#define pq priorit... | 1 | 75,704,278 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define REP(i, j) for(int i = 0; i < j; i++)
#define FOR(i, j, k) for(int i = j; i < k; i++)
const int N = 5;
int main(){
vector<int> v(N);
REP(i, N) cin >>v[i];
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
cout <... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
vector<int> num(5);
for(int i=0; i<5; i++) cin >>num[i];
sort(num.begin(),num.end());
for(int i=0; i<5; i++){
cout <<num[4-i];
if(i == 4) cout <<endl;
else cout <<" ";
}
return 0;
} | 1 | 1,666,384 |
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd... | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr <... | 1 | 74,480,285 |
#include "bits/stdc++.h"
using namespace std;
class WeightedUnionFind {
public:
vector<int> par;
vector<int> rank;
vector<int> diff_weight;
WeightedUnionFind() {}
WeightedUnionFind(int size, int weight) {
rank.resize(size, 0);
par.resize(size, 0);
diff_weight.resize(size, 0);
for (int i = 0; i<size; i++) m... | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX
int n, m;
vector<pair<int, int> > graph[100010];
int cost[100010];
bool flag = true;
void dfs(int idx, int num){
if(!flag) return;
cost[idx] = num;
for(int i = 0;i < graph[idx].size();i++){
if(cost[graph[idx][i].first] != INF){
... | 1 | 40,964,855 |
#include <bits/stdc++.h>
using namespace std;
int N;
const int M=1000001;
vector<int>a[M];
bool vis[M];
int gcd(int a,int b){return a?gcd(b%a,a):b;}
main()
{
cin>>N;
for(int i=2;i<M;++i)for(int j=i;j<M;j+=i)a[j].push_back(i);
int g=0;
bool ok=true;
for(int i=0;i<N;++i){
int A;cin>>A;
... | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+10;
int n;
int a[maxn];
int c[maxn];
inline int R_Int(){
int ch,a;
while(ch=getchar(),ch<'0'||ch>'9');a=ch^48;
while(ch=getchar(),ch>='0'&&ch<='9')a=a*10+(ch^48);
return a;
}
inline int Gcd(int a,int b){
return b?Gcd(b,a%b):a;
}
bool usd[maxn];
inline... | 1 | 40,243,859 |
#include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define e "\n"
#define MaRiaMa { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
#define fix(n) cout << fixed << setprecision(n);
using namespace std;
int main()
{
MaRiaMa;
double a, b;
cin >> a >> b;
double mean = 0;
mean = ((a + b) / 2);
... | #include <iostream>
using namespace std;
int main(void){
double a,b;
cin >> a >> b;
double A = (a + b) / 2.0;
int B = (a + b)/2;
double T = (a + b) / 2.0 - B;
if(T == 0.0)
cout << A <<endl;
else
cout << A - T + 1 << endl;
} | 1 | 8,563,102 |
#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<deque>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0;i < (n);i++)
#define repr(i, n) for(int i = (n);i >= 0;i--)
#define repf(i, m, n) for(int i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, k; cin >> n >> k;
int r = (n - 1) * (n - 2) / 2 - k;
if (r < 0) {
cout << -1 << endl;
... | 1 | 65,527,584 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int>dp(N + 1, 1e9);
dp[0] = 0;
int a = 1;
int b = 1;
int c = 1;
for (int i = 1; i < 1 + N; ++i) {
while (b * 6 <= i) {
b *= 6;
}
while (c * 9 <= i) {
c *= 9;
}
dp[i] = min(min(dp[i - a] + 1, dp[i - b] + 1), dp[i -... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
int main() {
int n; cin >> n;
V<int> dp(n + 1, n);
dp[0] = 0;
for(int i = 1; i <= n; i++){
for(int p6 = 1; p6 <... | 1 | 85,618,834 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
signed main() {
string s; cin >> s;
if(s[0] == s[1] && s[1] == s[2]) {
cout << "Yes" << endl;
return 0;
}
if(s[1] == s[2] && s[2] == s[3]) {
cout << "Yes" << endl;
return 0;
}
cout << "... | #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;
int d1, d2, d3, d4;
d1 = n % 10;
d2 = n / 10 % 10;
d3 = n / 100 % 10;
d4 = n / 1000;
if (d2 == d3 && (d3 == d4 || d1 == d2)) {
cout << "Yes" << endl;
} else {
cout <... | 1 | 3,660,005 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n,m;
cin >> n >> m;
if (n % 2 == 1) {
for (int l = 2, r = n; l <= m + 1; l++, r--) {
cout << l << " " << r << '\n';
}
} else {
bool flag = true;
for (in... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(fals... | 1 | 36,863,963 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(... | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for(ll i = 0; ... | 1 | 99,188,180 |
#include <iostream>
#define MOD 1000000007
using namespace std;
typedef long long ll;
ll dp1[2001][2001], dp2[2001][2001], sum[2001][2001];
int main() {
int n, m, s[2000], t[2000];
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < m; i++) {
cin >> t[i];
}
dp1[0][0] = ... | #include <iostream>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
#include<string>
#include<cassert>
#include<cmath>
#include<climits>
#include<iomanip>
#include<bitset>
#include<unordered_map>
using namespace std;
#define REP(i,n) for(ll (i)=0;(i)<(n... | 1 | 35,172,090 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define LOOP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define MP make_pair
#define FR first
#define SC second
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=9000000009;
signed m... | #include <iostream>
#include <string>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <climits>
#include <cfloat>
#include <map>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
const int INF = INT_MAX;
typedef long long LL;
typedef pair<int,int> P;
int main(){
vector<... | 1 | 15,027,158 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | #include <bits/stdc++.h>
#define rp(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll=long long;
using P=pair<int,int>;
using G=vector<vector<int>>;
int main(){
string s;
cin >> s;
int ymd=0;
rp(i,10){
if(i==4||i==7) continue;
ymd=ymd*10+(s.at(i)-'0');
}
if(ymd<20190431) ... | 1 | 39,313,946 |
#include <iostream>
#include <cmath>
#include <stdint.h>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
using namespace std;
#define int long long
int gcd(int a, int b){
if(b==0){
return a;
}
return gcd(b,a%b);
}
int lcm(int a, int b)
{
return (a*... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll dep(ll a, ll b){
if(b==0){
return a;
}
return dep(b,a%b);
}
int main() {
ll a,b;
cin>>a>>b;
ll gcd= dep(max(a,b),min(a,b));
cout << a*b/gcd;
return 0;
} | 1 | 59,215,903 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define pb push_back
#define endl '\n'
#define snd second
#define fst first
#define fastio cin.tie(NULL),cout.sync_with_stdio(true)
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector <i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
int main(){
ll A;
string B;
cin >> A >> B;
ll B100 = (B[0] - '0') * 100 + (B[2] - '0') * 10 + (B[3] - '0');
cout << A * B100 / 100 << endl;
return 0;
} | 1 | 51,098,434 |
#include "bits/stdc++.h"
using namespace std;
int main(){
double T,X;
cin >> T >> X;
cout << T/X << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const ll mod = 1e9+7;
const int N=2e5+9;
int main()
{
FASTINOUT;
double x,y;
cin>>x>>y;
cout<<x/y;
return 0;
} | 1 | 1,790,539 |
#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> list(n);
rep(i,n ) cin>>list.at(i);
int ans=list[0];
rep(i,n-1)ans =gcd(ans,list[i+1]);
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | 1 | 24,131,462 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,x,y;
cin>>n;
vector<string> w(n);
for(int i=0;i<n;i++){
cin>>w[i];
}
int sum=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(w[i]==w[j]){
sum++;
}
}
}
for(int i=0;i<n-1;i++){
if(w[i][w[i].size()-1... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <utility>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
bool shiritori(int n) {
vector<string> v;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (find(v.begin()... | 1 | 59,870,606 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define MOD 1000000007
typedef long long int ll;
const int INF=(1<<30);
struct pos{
int x;
int y;
};
int main(){
int H,W,D;
cin >> H >> W >> D;
vecto... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define r... | 1 | 36,206,485 |
#include<iostream>
using namespace std;
int main(){
int H,W;
while(cin >>H>>W && !(H==0 && W==0)){
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cout <<"#";}
cout<<endl;}
cout<<endl;}
return 0;
} | #include <iostream>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
int a = 0, b = 0, i = 0,j = 0, k =0;
for(k=0 ;; k++){
cin >> a >> b;
if((a==0)||(b==0))break;
for(i = 0; i < a; i++){
for(j = 0; j < b; j++){
cout << '#';
}
... | 1 | 26,722,467 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmd... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<string>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<iomanip>
#define REP(i,n) for(int i=0;i<(n);i++)
#define EPS (1e-7)
#define INF (2e9)
using namespace std;
typedef long long int ll;
const ll ... | 1 | 7,597,174 |
#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... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
long long n, ans = 0, last;
cin>>n;
vector<string> s(n);
for (int i = 0;i<n;i++){
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
for (int i = 1; i < n;i++){
if(s[i]==s[i-1]){
last = i... | 1 | 51,489,041 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
template... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(... | 1 | 18,376,378 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int n;cin >>n;
int ans;int now=-1;
for (int i = 1; i <=n; ++i) {
int c... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int inf = 10e17;
#define mod 1000000007
int findLowerBound(
vector<pair<int, int>> &arr,
pair<int, int> &p)
{
auto low = lower_bound(arr.begin(),
arr.end(), p);
return low - arr.begin();
}
int findUpperBound(
... | 1 | 73,279,864 |
#include<stdio.h>
int main()
{
int a,b,c;
scanf("%d %d %d", &a, &b, &c);
if (a!=b && a!=c) printf("%d",a);
else if (b!=a && b!=c) printf("%d",b);
else if (c!=a && c!=a) printf("%d",c);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a[3];
cin>>a[1]>>a[2]>>a[3];
sort(a+1,a+4);
if(a[1]==a[2]) cout<<a[3];
else cout<<a[1];
cout<<endl;
return 0;
} | 1 | 30,602,450 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define F first
#define S second
#define B begin
#define E end
#define PB push_back
#define endl "\n"
#define FORS(i, j, k, step) for (int i=j; i<k; i+=step)
#define FOR(i, j, k) for (... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define mod 1000000007
#define ... | 1 | 51,204,035 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include... | #include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
using namespace std;
int A[100000];
long long B[100000];
bool stand_bit(int N, int pos){
if((((N >> (... | 1 | 71,813,600 |
#include<stdio.h>
int main()
{
int number,ans ;
scanf("%d",&number);
ans = number*(number+1) / 2 ;
printf("%d\n",ans);
} | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
int numOfCandy = 0;
rep(i, N) {
numOfCandy += i + 1;
}
cout << numOfCandy << endl;
return 0;
} | 1 | 26,698,541 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | #include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define beg begin()
#define end end()
void _main(){
ll n ; cin >> n;
vector<ll>... | 1 | 65,481,686 |
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define Nmax 200010
#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define RFOR(i,a,b) for(long long i = (b-1);i>=a;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ITR(itr,mp) for(auto itr = (mp).begin(); itr != (mp).end(); ... | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b == 15) cout << "+" << endl;
else cout << (a * b == 15 ? "*" : "x") << endl;
} | 1 | 76,877,504 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n;
cin >> n;
cout << (((n / 10) % 111 == 0) || ((n % 1000)... | 1 | 100,476,204 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int K,N,ans=0,sum=0;
cin>>K>>N;
sum=N,ans=1;
while(sum<K) {sum+=N-1; ans++;}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
int ans = 1;
while (true) {
int tmp = k + (k - 1) * (ans - 1);
if (n <= tmp) {
break;
}
ans++;
}
cout << ans << endl;
return 0;
} | 1 | 66,693,395 |
#include <iostream>
using namespace std;
void sort(int &a, int &b){
int buff;
buff = a;
a = b;
b = buff;
}
int main()
{
int a, b, c;
int num[3];
cin >> a >> b >> c;
num[0] = a;
num[1] = b;
num[2] = c;
while(true){
if(num[0] <= num[1] && num[1] <= num[2])
break;
if(num[0] >= num[1]){
sort(num[0], nu... | #include <iostream>
using namespace std;
int main() {
int a,b,c,d;
cin>>a>>b>>c;
if (c<a) {
d=c;
c=a;
a=d;
}
if (a>b) {
d=a;
a=b;
b=d;
}
if (b>c) {
d=b;
b=c;
c=d;
}
cout<<a<<" "<<b<<" "<<c<<"\n";
return 0;
} | 1 | 41,561,516 |
#include <bits/stdc++.h>
#define int long long
#define counter(m) for(int i=0;i<m;i++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define All(V) V.begin(), V.end()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1e9+7, INF = 1e9;
ll modPow(ll a, ll n, ll mod)
{
if(n == 1)return a;
if(n % 2 == 1) return (a * modPow(a, n-1, mod)) % m... | 1 | 60,885,787 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, l, r, sum, ans, imos[100001] = {};
cin >> n >> m;
for ( int i = 0; i < m; i++ ) {
cin >> l >> r;
imos[l-1] ++;
imos[r] --;
}
ans = 0;
sum = 0;
for ( int i = 0; i <= n; i++ ) {
sum += imos[i... | 1 | 47,133,916 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int StartTime = max(A, C);
int EndTime = min(B, D);
cout << max(0, EndTime - StartTime) << endl;
} | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main()
{
int A, B, C, D... | 1 | 80,524,030 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<int> a(n + 2, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = 1; i <= n + 1; i++) {
sum +=abs(a[i] - a[i - 1]);
}
for (int i = 1; i <= n; i++) {
int tmp = sum;
tmp -= abs(... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 +... | 1 | 90,633,390 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;... | #include <bits/stdc++.h>
using namespace std;
using ll = 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++)
ll factorial(int i) {
if (i == 0) return 1;
return (factorial(i - 1)) * i;
}
int d(ll n) {
if(n == 0) return 1;
int count... | 1 | 85,862,075 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>0;i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
long long gcd(long long a, long long b)
{
for (;;)
{
if (a == 0) return b;
b %= a;
if (b == 0) return a;
a %= b;
}
}
long long lcm(long long... | 1 | 77,153,222 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int w,h,x,y,r;
cin >> w >> h >> x >> y >> r;
cout << (x-r<0 || y-r<0 || x+r>w || y+r>h ? "No":"Yes") << endl;
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int W, H, x, y, r;
int left, right;
int up, down;
cin >> W >> H >> x >> y >> r;
left = x - r;
right = x + r;
up = y + r;
down = y - r;
if (left >= 0 && right <= W && up <= H && down >= 0)
{
printf("Yes\n");
... | 1 | 13,731,420 |
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
using Graph = vector<vector<ll>>;
ll inf=300000000000000000;
const double PI = 3.14159... | 1 | 46,332,056 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> ws(n);
cin >> ws[0];
for (size_t i = 1; i < n; i++) {
cin >> ws[i];
ws[i] += ws[i-1];
}
int ans = 100000000;
for (size_t i = 0; i < n-1; i++) {
ans ... | 1 | 18,747,924 |
#include <iostream>
using namespace std;
int main(){
int n,s,r,bit;
int sum;
while(cin >> n >> s && n || s){
r = 0;
for(int i=0;i < (1<<10) ;i++){
sum = bit = 0;
for(int j=0;j<10;j++)
if( i & (1<<j) )bit++;
if(bit != n)continue;
for(int j=0;j<10;j++){
if( i & (1<<j) )sum+=j;
}
if( sum =... | #include<iostream>
using namespace std;
void dfs(int n,int s,int k);
int ans=0;
int main(){
int n,sum;
while(cin>>n>>sum , n||sum){
ans=0;
dfs(n,sum,0);
cout<<ans<<endl;
}
}
void dfs(int n,int sum,int k){
if(n<0){
return ;
}
if(n==0){
if(sum==0){
ans++;
}
}
else{
if(9<k){
return ;
}
for(... | 1 | 22,769,233 |
#include<bits/stdc++.h>
using namespace std;
typedef long long llint;
string s;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> s;
cout << s.substr(0, 4) << " " << s.substr(4) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool c... | 1 | 53,224,530 |
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long l... | #include<bits/stdc++.h>
#define ll long long
#define N 100005
#define inf 1000000005
#define mod 1000000007
#define put putchar('\n')
#define F(i,a,b) for (int i=(a);i<=(b);i++)
#define D(i,a,b) for (int i=(a);i>=(b);i--)
#define go(i,t) for (int i=head[t];i;i=Next[i])
#define sqr(x) ((x)*(x))
#define re register
#defi... | 1 | 15,796,711 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
int main() {
ll n;
cin >> n;
ll ans = 0;
map<string, ll> mp;
rep(i,n) {
string t;
cin >> t;
sort(t.begin(), t.end());
ans +=... | #include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
int main(){
int n;cin>>n;
string s[n];for(int i=0;i<n;i++){cin>>s[i];sort(s[i].begin(),s[i].end());}
ll sum=0;
map<string,ll> box;
for(int i=0;i<n;i++){
box[s[i]]+=1;
}
for(auto p:box){
ll i = p.second;
... | 1 | 28,381,300 |
#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>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
ll x,y;
cin>>x>>y;
int cnt=0;
while(1){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll x,y;
cin >> x >> y;
int count = 1;
for(;;){
x = x*2;
if(x>y)break;
count++;
}
cout << count << endl;
} | 1 | 11,159,611 |
#include<iostream>
using namespace std;
#define df 0
typedef long int li;
li dc=0;
void rem(li& you,li& others,int n);
int main(){
if(df) printf("*debug mode*\n");
int n; cin >> n;
li a[n],s=0;
li y[n],oth[n],sum=0;
for(int i=0;i<n;i++){
dc+=df;
cin >> y[i];
s+=y[i];
y[i]+=sum;
oth[i]=0;
... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 1 | 90,825,623 |
#include <bits/stdc++.h>
using namespace std;
void solve(){
set < int > s;
int n;
cin >> n;
for(int i = 0; i < n; i++){
int p;
cin >> p;
s.insert(p);
}
if(s.size() == n){
cout << "YES" << "\n";
}
else{
cout << "NO" << "\n";
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int>a(n);
rep(i,n)cin >> a[i];
sort(all(a));
bool ok = true;
rep(i,n-1){
if(a[i]==a[i+1])ok = ... | 1 | 51,178,146 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
string S;
cin >> S;
int a = 0, b = 0;
for (int i = 0; i < S.size(); i++) {
if (i % 2) {
if (S[i] != '0') a++;
}
else {
if (S[i] ... | #include<iostream>
using namespace std;
int main(){
char s[100000]={'3'};
cin>>s;
int a=0,b=0;
for(int i=0;i<100000;i++){
if(i%2==0){
if(s[i]=='1'){
a++;
}
}
else{
if(s[i]=='0'){
a++;
}
}
... | 1 | 90,489,897 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ld> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<ll>> vvll;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll;... | #include<iostream>
using namespace std;
class Dice{
public:
int f[6];
Dice(){}
void roll_x(){roll(1,4,6,3);}
void roll_y(){roll(1,2,6,5);}
void roll_z(){roll(2,3,5,4);}
void roll(int i,int j,int k,int l){
int t=f[i]; f[i]=f[j]; f[j]=f[k]; f[k]=f[l]; f[l]=t;
}
void move(cha... | 1 | 2,029,128 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long int ll;
... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define rep(i,x,y) for(int i=(x);i<=(y);++i)
inline int read(){
char ch=getchar();int x=0,f=1;
while(ch<'0'||ch>'9'){
if(ch=='-')f=-1;
ch=getchar();
}
while('0'<=ch&&ch<='9'){
x=x*10+ch-'0';
ch=getchar();
}
return x*f;
}
int main(){
int Q... | 1 | 22,766,520 |
#include<bits/stdc++.h>
using namespace std;
int n,ans=0,cnt[2][2];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
string s;cin>>s;
for(int j=0;j+1<(int)s.size();j++) if(s[j]=='A'&&s[j+1]=='B') ans++;
cnt[s[0]=='B'][s[s.size()-1]=='A']++;
}
if(cnt[1][1])
{
ans+=cnt[1][1]-1;
if(cnt[1][0]) cnt[1][0]--,ans++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
int main(){
int n;
cin>>n;
int cnt_a=0, cnt_b=0, cnt_ab=0;
int ans=0;
rep(i,n){
string s;
cin>>s;
bool a=0, b=0;
if(s[0]=='B') b=1;
if(s[s.size()... | 1 | 46,649,777 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ll long long
#define ld long double
#define pb push_back
#define MOD 1000000007
#define LLMN LONG_LONG_MIN
#define... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
vector<int> g[100005];
int n, m, pre[100005];
void bfs() {
queue<pair<int, int> > q;
q.push({1, 0});
while(!q.empty()) {
int x = q.front().first;
int pr = q.front().second;
q.pop();
if(pre[x]) continu... | 1 | 96,653,581 |
#include <iostream>
#include <queue>
#include <string>
#include <algorithm>
#include <limits>
typedef long long ll;
using namespace std;
long long enqueue(int n, int k, long long v[]) {
ll ans = 0;
for (int kk=0;kk<=k;kk++) {
for(int num_pick = 0; num_pick <= kk; num_pick++) {
if(n < num_pick) {
continue... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
#define task "tst"
using namespace std;
const ll N = 3e3 + 9;
const ll mod = 1e9 + 7;
typedef pair<ll,ll> LL;
priority_queue<ll,vector<ll>,greater<ll>> pq;
ll n,k,a[N],i,j,l;
ll maxx;
int main(){
ios_base::sync_wi... | 1 | 24,791,092 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int (i)=0;(i)<(n);++(i))
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);++(i))
#define EACH(e,v) for(auto& e:v)
#define ALL(v) (v).begin(),(v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort((v).rbegin(),(v).rend())
#define PE... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | 1 | 38,662,903 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K >> N;
vector<int>A(N);
vector<int>ans(N);
for(int i=0; i<N; i++){
cin >> A.at(i);
}
sort(A.begin(), A.end());
for(int i=0; i<N-1; i++){
ans.at(i)=A.at(i+1)-A.at(i);
}
ans.at(N-1)=K-A.at(N-1)+A.at(0);
sort(ans.beg... | #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 K, N;
cin >> K >> N;
int prev, next, first;
cin >> first;
next = first;
int m = 0;
rep(i, N - 1) {
prev = next;
cin >> next;
m = max(m,... | 1 | 73,560,817 |
#include <bits/stdc++.h>
using namespace std;
int main (){
int N;
int K;
int num;
cin >> N >> K;
if(K == 1){
cout << 0 << endl;
}
else{
num = N - K;
cout << num << endl;
}
} | #include<iostream>
using namespace std;
int main()
{
int a,b,d;
cin >> a >> b;
d=a%b;
cout << d << endl;
return 0;
} | 1 | 53,201,661 |
#include <iostream>
#include <algorithm>
using namespace std;
int Z, Y, M, D;
void solve(void);
inline bool is_leap(int y) { return y % 3 == 0; }
inline bool is_big(int m) { return m % 2 == 1; }
int main() {
cin >> Z;
for (int zi = 1; zi <= Z; ++zi) {
cin >> Y >> M >> D;
solve();
}
return 0;
}
void solv... | #include<cstdio>
using namespace std;
int n, y, m, d;
int r = 39 * 5, t = 20 * 10;
int s = r * 2 + t;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &y, &m, &d);
y--; m--;
int sum = (y / 3) * s + (y - (y / 3) * 3) * r;
int temp = m * 20 + d;
if ((y + 1) % 3 != 0) {
... | 1 | 30,461,319 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
int h,w,m;
cin>>h>>w>>m;
vector<int> y(m),x(m);
map<pair<int,int>,int> bomb;
for(int i=0; i<m; i++){
cin>>y[i]>>x[i];
y[i]--;
x[i]--;
bomb[make_pair(y[i],x[i])]++;
}
map<int,int> y... | #include<bits/stdc++.h>
#define int long long
#define PI 3.14159265
#define pb(x) push_back(x)
#define PI 3.14159265
#define all(v) v.begin(), v.end()
#define endl cout<<"\n"
#define dbg(x) cout<<#x<<" "<<x;endl;
#define bye endl;return
#define uni 1.000000
using namespace std;
const int mod = 1000000007;
vector<int> ... | 1 | 17,418,245 |
#include<stdio.h>
int main(void)
{
int a[10],s,d,f,i;
for(i=1;i<=10;i++){
scanf("%d",&a[i]);
}
for(i=1;i<=10;i++){
for(f=i+1;f<=10;f++){
if(a[i]<a[f]){
s=a[i];
a[i]=a[f];
a[f]=s;
}
}
}
printf("%d\n",a[1]);
printf("%d\n",a[2]);
printf("%d\n",a[3]);
return 0;
} | #include <stdio.h>
#include <iostream>
using namespace std;
int main(){
int height[10],pos,max[3];
for(int i=0;i<10;++i)cin >> height[i];
for(int i=0;i<3;++i){
int tmp = 0;
for(int n=0;n<10;++n){
if(tmp<height[n]){
tmp = height[n];
pos = n;
}
}
max[i] = tmp;
height[pos] = 0;
}
for(int i=0;i<3;++i)
cout ... | 1 | 67,285,095 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ii = pair<int, int>;
struct UnionFind {
vi p, sz;
int n;
UnionFind(int n): n(n) {
p.resize(n);
sz.assign(n, 1);
for (int i = 0; i < n; i++)
p[i] = i;
}
int find_set(int u) {
return p[u] = u == p[u] ? u : find_set... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector < vector<ll> > Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;... | 1 | 91,819,028 |
#include <bits/stdc++.h>
using namespace std;
string s, t;
int main () {
cin >> s >> t;
if (t.substr(0,s.length())== s){
cout << "Yes";
} else {
cout << "No";
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
#define endl '\n'
int main() {
ios::sync_with_stdio(0); cin.tie(0);
string s,t;
cin >> s >> t;
int ns = s.length();
int nt = t.length();
bool good = nt == ns+1;
if (good) t.pop_back();
if (good && t == s) {
... | 1 | 3,643,079 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
ll gcd (ll a,l... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll a, b, c, d; cin >> a >> b >> c >> d;
ll l = c / __gcd(c, d) * d;
ll e = b - b / c - b / d + b / l;
ll f = ~- a - ~- a / c - ~- a / d + ~- a / l;
cout << e - f << endl;
return 0;
} | 1 | 96,269,792 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define arr array
using namespace std;
const int e = 2e6 + 69;
const ll mod = 1e9 + 7;
ll a[e];
int n, m;
ll p[e], x[e];
vector<ll>adj[e];
ll ans = 0;
void dq(int pos)
{
if(pos == n+1){
for(int i=1; i<=m; i++){
ll dem = 0;
... | #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>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } re... | 1 | 32,501,875 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<bool> vec(n + 1, true);
vector<long long> dp(n + 1, 0);
for (int i = 0; i < m; i++) {
long long k;
cin >> k;
vec.at(k) = false;
}
dp[0] = 1;
for (int i = 1; i <= n; i+... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | 1 | 88,260,370 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
ll func(ll n) {... | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int N;
cin>>N;
vector<int> A(N);
for(int &i:A)
cin>>i;
map<int,int> B;
for(int i:A)
B[i]++;
int k=0;
for(pair<int,int> p:B)
k+=(p.second-1)*p.second/2;
for(int i=0;i<N;i++){
cout<<k-(B[A[i]]-1)<<endl;
}... | 1 | 17,558,474 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
string o,e;
cin>>o>>e;
for(int i=0;i<o.size();i++)
{
cout<<o[i];
if(i<e.size()){
cout<<e[i];
}
}
if(o.size()<e.size()){
cout<<e[e.size()-1];
}
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | 1 | 66,526,760 |
#include<stdio.h>
int main(){
int apple;
int Papple;
int total;
int pie;
scanf("%d %d", &apple, &Papple);
total = 3*apple + Papple;
pie = total / 2;
printf("%d", pie);
return 0;
} | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main()
{
int A,P;
cin >> A >> P;
cout << (3*A+P)/2;
} | 1 | 65,900,719 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double n,m,d;
cin >> n >> m >> d;
double ans;
if(d==0){
ans=n/(n*n)*(m-1);
}
else{
ans=(2*(n-d))/(n*n)*(m-1);
}
cout << fixed << setprecision(10);
cout << ans << endl;
} | #include<stdio.h>
int main(){
long long int i,a,b,c;
double ans=0,n,m,d;
scanf("%lld %lld %lld\n",&a,&b,&c);
n=a,m=b,d=c;
if(d==0){
ans=n/n/n;
}
else{
ans=2*(n-d)/(n*n);
}
ans=ans*(m-1);
printf("%.10lf\n",ans);
return 0;
} | 1 | 78,787,723 |
#include<iostream>
using namespace std;
int fib[45] = {0};
void solve(int n) {
if (n == 0 || n == 1) {
fib[n] = 1;
return;
}
if (fib[n - 2] == 0) solve(n - 2);
if (fib[n - 1] == 0) solve(n - 1);
fib[n] = fib[n - 1] + fib[n - 2];
return;
}
int main() {
int n;
cin >> n;
... | #include"iostream"
using namespace std;
int main()
{
int a,b,c;
int n;
cin>>n;
c=1;
a=1;b=1;
for(int i=1;i<n;i++)
{
c=a+b;
a=b;
b=c;
}
cout<<c<<endl;
return 0;
} | 1 | 81,141,163 |
#include <stdio.h>
int main()
{
int k; scanf ("%d",&k);
int a[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
printf ("%d\n",a[k-1]);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++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 irep(i, m, n) for (int i = (... | 1 | 45,543,410 |
#include <iostream>
using namespace std;
int main(){
int a,b,c,d,A,B,C,D;
cin >> a >> b >> c >> d >> A >> B >> C >> D;
cout << max(a+b+c+d,A+B+C+D) << endl;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a[4], b[4];
int sa, sb;
sa = sb = 0;
for (int i = 0; i < 4; i++)
cin >> a[i];
for (int i = 0; i < 4; i++)
cin >> b[i];
for (int i = 0; i < 4; i++) {
sa += a[i];
sb += b[i];
}
co... | 1 | 89,267,488 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D;
1 <= A,B,C,D <= 10;
cin >> A >> B >> C >> D;
if (A+B > C+D) {
cout << "Left" << endl;
} else if (A+B == C+D) {
cout << "Balanced" << endl;
} else {
cout << "Right" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin >> a;
cin >> b;
cin >> c;
cin >>d;
if((a+b) > (c+d)){
cout << "Left" << endl;
}
else if((a+b) == (c+d)){
cout << "Balanced" <<endl;
}
else{
cout << "Right" <<endl;
}
} | 1 | 57,439,414 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
const ll N = 1e6;
const ll inf= 1e14;
const ll mod =1e9+7;
const double PI = acos(-1);
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define pld pair<ld,ld>
ll powm(ll a, ... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
#includ... | 1 | 80,596,315 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
char s[n];
int cnt=1;
for(int i=0;i<n;i++)
{
cin>>s[i];
}
for(int i=0;i<n-1;i++)
{
if(s[i]!=s[i+1])
{
cnt++;
}
}
cout<<cnt<<endl;
exit(0);
} | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n ;
cin>>n ;
string s ;
cin>>s ;
stack<char> st ;
for(int i=0;i<n;i++){
if(st.empty())
st.push(s[i]) ;
else{
char temp=st.top() ;
if(s[i]==... | 1 | 80,902,882 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define long long long
int main(void) {
ll w, h;
cin >> w >> h;
vector<ll> p(w), q(h);
for(auto &e: p) cin >> e;
for(auto &e: q) cin >> e;
vector<pair<ll,ll>> es;
for(auto &e: p) es.push_back({e, 0});
for(auto &e: q) es.p... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
int H,W;
ll p;
int main(){
cin >> W >> H;
vector<P> v(W+H);
for(int i=0;i<W+H;i++){
cin >> p;
if(i<W) v[i] = P(p,1);
else v[i] = P(p,-1);
}
sort(v.begin(),v.end());
int X = H+1,Y = ... | 1 | 86,984,476 |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll A, B;
vector<string> c;
int main() {
cin >> A >> B;
c.resize(100);
for (int i = 0; i < 100; i++) {
if... | 1 | 88,907,950 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
ll gcd(ll a, ll b){
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main(void){
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++... | #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, k;
cin >> n >> k;
vector<int> a(n);
bool ok = false;
rep(i,n) {
cin >> a.at(i);
}
sort(a.rbegin(), a.rend());
int g = 1e... | 1 | 91,367,124 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int res=n%k;
cout<<res;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i<n;++i)
using ll = long long;
using P = pair<int,int>;
int main(){
int n,k;
cin >> n >> k;
if(k == 1) cout << 0 << endl;
else cout << n-k << endl;
return 0;
} | 1 | 7,841,592 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define loop(k) rep(author_is_masa,k)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<in... | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int c;
int ans=0;
for(int i=0;i<a;i++){
cin>>c;
if(c>=b)ans+=1;
}
cout<<ans<<endl;
} | 1 | 4,168,360 |
#include <bits/stdc++.h>
#include <string.h>
#include <vector>
#define MAX 10000
using namespace std;
#define inf 0x3f3f3f3f
#define ll long long
#define pb push_back
#define upperlimit 1000100
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define INF (int)1e15
#... | #include<bits/stdc++.h>
using namespace std;
#define listi vector<int >
#define listll vector<long long >
#define pii pair<int ,int >
#define pll pair<long long ,long long >
#define heap priority_queue<long long >
#define all(a) a.begin(),a.end()
#define pb(a) push_back(a)
#define mod 998244353
#define maxx 200006
#def... | 1 | 98,573,614 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x, t;
scanf("%d %d", &x, &t);
int ans = x - t;
if(ans > 0) printf("%d\n", ans);
else printf("0\n");
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int X,t,y;
cin>>X>>t;
y=X-t;
if(y>=0)
cout<<y;
else
cout<<0;
} | 1 | 4,509,369 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | 1 | 62,515,936 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.