code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int v, e;
scanf("%d %d", &v, &e);
long long INF = (1LL << 32);
long long G[v][v];
for (int i = 0; i < v; ++i) {
for (int j = 0; j < v; ++j) {
if (i == j)
G[i][j] = 0;
else
G[i][j] = INF;
}
}
for (int i ... | #include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
using s64 = int64_t;
constexpr s64 INF = 1'010'000'000'000'000'000LL;
template<typename T, typename U>
bool chmin(T& xmin, const U& x)
{
if(x < xmin) {
xmin = x;
return true;
}
else {
return false;
}
}
... | 1 | 9,438,956 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,c,d,b;
cin >> a >> b >> c >> d;
int flag = 0;
if(abs(a-c)<=d) cout << "Yes" << endl;
else{
if(abs(a-b)<=d && abs(b-c)<=d)
cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int x,y,z,d;
cin>>x>>y>>z>>d;
if(abs(x-z)<=d || (abs(x-y)<=d && abs(y-z)<=d)){
cout<<"Yes"<<endl;
}
else{cout<<"No"<<endl;}
} | 1 | 45,068,186 |
#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>
#include <cctype>
#in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define DECIMAL(n) std::cout << std::fixed;std::cout << std::setprecision(n);
#define hell 1000000007
#define narak 998244353
#define PI 3.14... | 1 | 1,739,171 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
using namespace std;
void solve(){
int a, b; cin >> a >> b;
cout << a * b - a - b + 1 << endl;
return;
}
int main(){
solve();
return 0;
} | 1 | 20,810,444 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int ans = 0;
string s, t;
cin >> s >> t;
for (int i = 0, n = s.size(); i < n; ++i)
{
ans += (s[i] != t[i]);
}
cout << ans << endl;
return 0;
} | #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()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main(void){
string s, t;
cin >> s... | 1 | 31,217,443 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
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... | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
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; } return false; }
int main()
{
double T, X;
cin... | 1 | 46,105,644 |
#include<stdio.h>
int main() {
int D, T, S;
scanf("%d %d %d", &D, &T, &S);
float meterPerMinute = (float)D/T;
if (meterPerMinute <= S)printf("Yes");
else printf("No");
} | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
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; } ret... | 1 | 96,805,022 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
if(s.substr(0,4)=="YAKI") cout<<"Yes";
else cout<<"No";
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 1 | 90,460,545 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
vector<ll> a(n),b(n);
for(ll i = 0; i < n; i++) cin >> a[i];
for(ll i = 0; i ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.... | 1 | 41,648,998 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | 1 | 71,917,601 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int s,u;
string t;
cin >> s >> t >> u;
if (t == "+") {
cout << s + u << endl;
}
else if (t == "-") {
cout << s - u << endl;
}
} | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 1 | 19,407,760 |
#include<iostream>
#include<queue>
#include<climits>
#include<cstdlib>
using namespace std;
int d[1111][1111];
char input[1111][1111];
bool visited[1111][1111];
int H,W,N,S_x,S_y,answer=0;
const int dirx[]={0,-1,0,1};
const int diry[]={1,0,-1,0};
int now='1';
int D[11];
queue<int> q;
void BFS();
void clean();
int main(... | #include <iostream>
#include <algorithm>
#include <queue>
#include <cstdio>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define fi first
#define se second
static const int INF = 1e9;
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};
str... | 1 | 76,458,907 |
#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;
int L = 1;
int R = N;
rep(i,M) {
int l,r;
cin >> l >> r;
L = max(L,l);
R = min(R,r);
}
cout << max(0, R-L+1) << e... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main(){
int N, M;
cin >> N >> M;
int L, R;
int Lmax = 0;
int Rmin = INF;
rep(i, M){
cin >> L >> R;
Lmax = max(Lmax, L);
Rmin ... | 1 | 80,516,273 |
#include<iostream>
#include<stack>
using namespace std;
int main(){
int in, out;
stack<int> stk;
while( cin >> in ){
if(in != 0){
stk.push(in);
}else{
out = stk.top();
cout << out << endl;
stk.pop();
}
}
return 0;
} | #include <cstdio>
#include <stack>
using namespace std;
stack<int> car;
int main()
{
int n;
while(scanf("%d",&n) != EOF) {
if(n != 0) {
car.push(n);
} else {
printf("%d\n",car.top());
car.pop();
}
}
return 0;
} | 1 | 30,989,822 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
cout << max(0, min(B, D) - max(A, C));
return 0;
} | #include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int a,b,c,d;
cin>>a>>b>>c>>d;
int y = -max(a,c)+min(b,d);
if(y<0)
cout<<0<<endl;
else
cout<<y<<endl;
return 0;
} | 1 | 93,958,980 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char N;
cin >> N;
string ans = "consonant";
if (N == 'a' || N == 'e' || N == 'i' || N == 'o' || N == 'u') {
ans = "vowel";
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S == "a" ){
cout << "vowel" << endl;
}
else if (S == "i"){
cout << "vowel" << endl;
}
else if (S == "u"){
cout << "vowel" << endl;
}
else if (S == "e"){
cout << "vowel" << endl;
}
else if (S == "o"){
cout << "v... | 1 | 70,404,761 |
#include <cmath>
#include <iostream>
#include <vector>
inline uint32_t diff(uint32_t x, uint32_t y) {
return ((x > y) ? x - y : y - x);
}
uint32_t dfs(const std::vector<uint32_t>& bamboo, uint32_t A, uint32_t B,
uint32_t C, uint32_t pos = 0, uint32_t a = 0, uint32_t b = 0,
uint32_t c = 0, ui... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, int>;
using vpii = vector<pair<int, int>>;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i < (int)n; i++)
const ll mod = 1e9 + 7;
const ll inf = 1e12;
const double pi = 3.141592;
const int di[4... | 1 | 57,339,353 |
#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef lo... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
using Tree = vector<vector<int>>;
int N;
vector<long long> D;
map<long long, int> dtoi;
vector<int> subtree_size;
long long rec(const Tree &G, int v) {
long long res = 0;
for (auto c : G[v]) {
res += rec(G, c)... | 1 | 19,880,302 |
#include<stdio.h>
int main()
{
int n,i,d=0;
scanf("%d",&n);
while(n!=0)
{
i=n%10;
if(i==7){printf("Yes");d=1;break;}
n/=10;
}
if(d!=1)printf("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
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 IN... | 1 | 57,953,686 |
#include<iostream>
using namespace std;
int main(){
int n,x,sum;
for(;;){
cin>>n>>x;
if(n==0&&x==0)
break;
sum=0;
for(int i=1;i<n+1;i++){
for(int j=i+1;j<n+1;j++){
for(int k=j+1;k<n+1;k++){
if((i+k+j)==x)sum++;
}
}
}
cout<<sum<<endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main()
{
int n, x;
cin >> n >> x;
int i,j,k, count;
while (n != 0 || x != 0) {
i = 0;
count = 0;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n ; j++) {
if(j!=i){
for (k = 1; k <= n ; k++) {
if (k != i && k !... | 1 | 23,158,877 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N;
cin >> N;
vector<string> W(N);
for (int i = 0; i < N; ++i) {
cin >> W[i];
}
char latest = W[0][W[0].size()-1];
for (int i = 1; i < N; ++i) {
for (int j = 0; j < i; ++j) {
if (W[i] == W[j]) ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<string> w(n);
for (int i=0 ; i<n ; i++)
cin >> w.at(i);
int ans = 1;
for (int i=0 ; i<n-1 ; i++){
for (int j=i+1 ; j<n ; j++){
if (w.at(i) == w.at(j)){
ans = 0;
break;
}
}
if (w.at(i... | 1 | 24,831,085 |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#define FILL(a, n, x) memset((a), (x), sizeof ((a)[0]) * (n))
#define COPY(a, n, b) memcpy((b), (a), sizeof ((a)[0]) * (n))
using namespace std;
const int mod = 1e9 + 7;
typedef long long li;
inline int Add(int x) { return x >= mo... | #include <bits/stdc++.h>
int N = 1e6, SZ = 320, INF = 1 << 29;
long long LINF = (1LL << 60), mod = 1e9 + 7;
const long double eps = 1e-8, PI = acos(-1.0);
#define lowbit(x) (x & (-(x)))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long lo... | 1 | 56,416,706 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
string S, T;
cin >> S >> T;
int count = 0;
rep(i, S.size())
{
if (S[i] == T[i])
count++;
}
... | 1 | 69,696,674 |
#include<bits/stdc++.h>
#include<algorithm>
#include <cstdlib>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
const int MAXN = 1e5+10;
int a[255];
int main(void)
{
ios::sync_with_stdio(false);
int n;
cin>>n;
for(int i = 1; i <= n; ++i)
cin>>a[i];
for(int i = 1; i <= n; ++i)
{
printf("node ... | #include <iostream>
#include <cmath>
using namespace std;
#define MAX 250
int parent(int i)
{
return (int)floor(i / 2);
};
int left(int i)
{
return i * 2;
}
int right(int i)
{
return i * 2 + 1;
}
int main ()
{
int H;
int A[MAX + 1];
cin >> H;
for (int i = 1; i <= H; i++)
{
cin >>... | 1 | 55,080,736 |
#include <bits/stdc++.h>
using namespace std;
int main(){
const int N= 3;
vector<string> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
bool is_satisfied= true;
for(int i=1; i<N; i++){
if(data.at(i-1).back()!=data.at(i).at(0)){
is_satisfied= false;
break;
}
}
string ans= (... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main()
{
string a, b, c;
cin >> a >> b >> c;
cout << (a.back() == b.front() && b.back() == c.front() ? "YES" : "NO") << endl;
} | 1 | 92,493,554 |
#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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | #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;
vector<int> a(26,50);
rep(x,n) {
string s;
cin >> s;
vector<int> b(26);
for(int i=0; s[i]!='\0'; i++) {
b[s[i]-'a']++;
... | 1 | 8,289,284 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
if(s.at(0) == 'A'){
cout<<"T"<<"\n";
}
else if(s.at(0) == 'T')
{
cout<<"A"<<"\n";
}
else if(s.at(0) == 'G'){
cout<<"C"<<"\n";
}
else if(s.at(0) == 'C')
{
cout<<"G"<<"\n";
}
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
ll INF=... | 1 | 12,448,487 |
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int N;
vector<ll> A;
vector<vector<int>> G;
ll dfs(int v, int p) {
vector<ll> edges;
for (int u : G[v]) {
if (u != p) {
l... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+50;
const ll inf=1e16;
int gi(){
char ch=getchar(); int x=0,q=0;
while(ch<'0'||ch>'9') q=ch=='-'?1:q,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return q?-x:x;
}
int head[N],nn[N][2],d[N],a[N],cnt,fl... | 1 | 72,487,765 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#define MAX_N 100
using namespace std;
string S[MAX_N];
int main() {
int N, L;
cin >> N >> L;
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
sort(S, S + N);
for (int i = 0; i < N; ++i) {
printf("%s", S[i].c_str());
}
pri... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main(void)
{
int N,L;
cin >> N >> L;
vector<string> s(N);
rep(i,N)
cin >> s[i];
sort(s.begin(),s.end());
rep(i,N)
cout << s[i];
cout << endl;
return 0;... | 1 | 95,546,543 |
#include<stdio.h>
int main(void)
{
int x,c;
c=1;
while (scanf("%d",&x),x!=0){
if(x==0) break;
printf("Case %d: %d\n",c,x);
c++;
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int in;
int num = 1;
while(1){
cin >> in;
if(in == 0){
break;
}
cout << "Case " << num << ": " << in << endl;
num++;
}
return 0;
} | 1 | 42,327,044 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int l... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb emplace
#define pi pair <int, int>
#define time cerr << '\n' << (double)clock()/CLOCKS_PER_SEC << '\n'; return 0
int n, m, dist[200100], ans[200100];
vector <int> G[200100];
void bfs(int source) {
memset(dist, -1, sizeof(dist));
queu... | 1 | 31,155,222 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, a[300000];
cin >> n;
for(int i=0;i<n;++i) cin >> a[i];
static int cnt[300001], ccnt[300001];
for(int i=0;i<n;++i) ++cnt[a[i]];
for(int i=0;i<=n;++i) ++ccnt[cnt[i]];
int64_t sum[300002] = {0}, xsum[300002] = {0};
for(int i=1... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vecto... | 1 | 12,970,963 |
#include<cstdio>
int H;
bool exist(int x){
if(x >= 1 && x <= H) return true;
else return false;
}
int main(void){
scanf("%d", &H);
int s[H], i, p, l, r;
for(i = 1;i <= H;i++) scanf("%d", &s[i]);
for(i = 1;i <= H;i++){
printf("node %d: key = %d, ", i, s[i]);
p = i / 2;
if(exist(p)) printf("parent key = %d, "... | #include <stdio.h>
#include <iostream>
#include <utility>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int heap[250];
int H;
int main()
{
cin >> H;
for (int i = 0; i < H; i++)
cin >> heap[i];
for (int i = 0; i < H; i++)
{
printf("node %d: key = %d, ", i +... | 1 | 65,827,670 |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define pll pair<LL,LL>
#define x first
#define y second
#define pi acos(-1)
#define sqr(x) ((x)*(x))
#define pdd pair<double,double>
#define MEMS(x) memse... | 1 | 11,548,445 |
#include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cl... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <functional>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <typeinfo>
#define PI 3.14159265359
#define INF 99999999;
#define rep(i, n) for(int i=0; i... | 1 | 93,818,109 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll int
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | 1 | 21,716,647 |
#include <string>
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define INF 1000000000
using namespace std;
int main()
{
int n;
int min = INF, ans = 0 ;
cin >> n;
rep(i,n){
int p;
cin >> p;
... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin>>N;
vector<int> v(N);
for(int i=0;i<N;i++){
cin>>v[i];
}
int a=0;
int minn=1e9;
for(int i=0;i<N;i++){
minn=min(minn,v[i]);
if(minn==v[i]){
a++;
}
}
cout<<a<<endl;
return 0;
} | 1 | 10,591,134 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include <iostream>
using namespace std;
int main()
{
int n,x,t;
cin>>n>>x>>t;
int k=n/x;
if(n%x!=0)
k++;
cout<<k*t<<endl;
return 0;
} | 1 | 2,445,717 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
using plll=pair<ll,pll>;
using graph=vector<vector<int>>;
using wgraph=vector<vector<pll>>;
const ll MOD=1000000007;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll abs1(ll a){
if(a>=0)return a;
... | 1 | 42,248,073 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alength=... | #include<stdio.h>
#include<math.h>
int main()
{
int N,P,Ans;
scanf("%d %d",&N,&P);
Ans=N-P+1;
printf("%d\n",Ans);
return 0;
} | 1 | 27,198,132 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
bool ok = false;
for (int i = 1; i <= B; i++)
{
if (A * i % B == C){
ok = true;
break;
}
}
cout << (ok ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A,B,C;
cin >> A >> B >> C;
int check = A;
int flag = 0;
do
{
if(check%B == C)
{
flag = 1;
break;
}
check = (check+A)%B;
}while(check%B != A%B && flag == 0);
if(flag == 1)
{
cout << "YES" << endl;
}
else... | 1 | 27,168,436 |
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
set<tuple<int,int,int>> s;
int a,b;
rep(i,m){
cin>>a>>b;
s.insert({a,b,i});
}
vector<int> A(m),B(m);
int tmp=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<pair<int,int>, int>> city(M);
vector<pair<int, int>> ans(M);
for (int i = 0; i < M; i++) {
int P, Y;
cin >> P >> Y;
pair<int, int> p = make_pair(P,Y);
city[i] = make_pair(p, i);
pair<int, int> q... | 1 | 48,130,273 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a,b;
int count = 0;
cin >> a >> b;
string s;
cin >> s;
for(int i=0;i<a;i++){
if(s.at(i)=='0'||s.at(i)=='1'||s.at(i)=='2'||s.at(i)=='3'||s.at(i)=='4'||s.at(i)=='5'||s.at(i)=='6'||s.at(i)=='... | #include<bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
int a, b;
cin >> a >> b;
string s;
cin >> s;
int n = s.size();
if(n!=a+b+1){
cout << "No" << endl;
return 0;
}
if(s[a]!... | 1 | 43,236,449 |
#include<iostream>
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
using ll=long long;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
int arr[a+3],ara[b+3];
arr[0]=c;
ara[0]=d;
for(int i=1;i<=a;i++)
{
cin>>arr[i];
}
sort(arr,arr+(a+1),greater<int>());
for(int... | #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... | 1 | 65,645,193 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | #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... | 1 | 54,168,691 |
#include<iostream>
using namespace std;
int main(){
int moto=100,syuu;
cin>>syuu;
for(int abc=0;abc<syuu;abc++){
if(moto%20!=0){
moto=moto*1.05+1;
}else{
moto*=1.05;
}
}
cout<<moto*1000<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n, debt = 100000;
cin >> n;
for (int i = 1; i <= n; i++){
debt *= 105;
debt /= 100;
if (debt % 1000 > 0){
debt /= 1000;
debt++;
debt *= 1000;
}
}
cout << debt << "\n";
return 0;
} | 1 | 77,761,011 |
#include <bits/stdc++.h>
#define REP(i, n) for (int (i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for(int (i) = a; (i) < (int)b; i++)
#define RREP(i, n) for(int (i)=((int)(n)-1); (i)>=0; i--)
#define RFOR(i, a, b) for(int (i) =((int)(b)-1); (i)>=(int)a; i--)
#define ALL(v) (v).begin(),(v).end()
#define MOD 100000... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(int... | 1 | 17,050,600 |
#include <iostream>
#include <algorithm>
using namespace std;
const int INF = 1<<28;
int main(){
int n,i,j,k,a,b,c;
while( cin >> n, n ){
int cost[10][10];
for(i=0;i<10;i++){
for(j=0;j<10;j++){
cost[i][j] = INF;
if(i==j) cost[i][j] = 0;
}
... | #include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
const int INF = 100000000;
int d[10][10];
int ans1, ans2;
bool town[10];
main(){
int n;
while(cin >> n && n){
fill(d[0], d[10], INF);
fill(town, town+10, false);
for(int i=0;i<n;i++){
int a, b, c;
... | 1 | 49,002,602 |
#include <iostream>
using namespace std;
int main()
{
int loan = 100000;
int n;
cin >> n;
for (int i = 0; i < n; i++){
loan *= 1.05;
if (loan % 1000 != 0){
loan += 1000 - (loan % 1000);
}
}
cout << loan << endl;
return (0);
} | #include<iostream>
#include<math.h>
using namespace std;
int main(){
int week, fraction;
cin >> week;
double debt = 100000;
double const rate = 1.05;
for (int i = 0; i < week; i++){
debt = debt*rate;
fraction = (int)debt % 1000;
if (fraction > 0){
... | 1 | 20,377,012 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define MAX 305
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
ll INF=1ll<<55;
int n, k;
int H[MAX];
ll dp[MAX][MAX];
int main(){
cin >> n >> k;
rep(i,n){
cin >> H[i+1];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 2031;
const ll INF = 1e18;
void update(ll& x, ll y)
{
x = min(x, y);
}
int main()
{
ll dp[331][331];
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i ... | 1 | 31,242,759 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N,ans=0;
cin >> N;
vector<ll> A(N),B(N),diff;
ll sum=0;
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N; i++){
cin >> B[i];
if(A[i] >= B[i]) diff.push_back(A[i]-B[i]);
else{
sum += B[i] - A[i]... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | 1 | 3,441,372 |
#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(a) a.begin(),a.end()
#define INF 1000000007
const int MOD = 1000000007;
int gcd(int x,int y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
int main(){
int a,b,m;
int money = 0;
cin... | #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 chmax (_T& a,_T b){if(a<b){a=b;return true;}return false;}
template <class _T> inline bool chmin (_T& a,_T b){if(a>b){a=b;return true;}return false;}
c... | 1 | 6,853,767 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
list<char> li;
for(char c: s) {
if(c == 'B') {
if(li.size() > 0) li.pop_back();
} else {
li.push_back(c);
}
}
for(char c: li) cout << c;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int l=s.length();
vector<int>res;
for(int i=0; i<l; i++)
{
if(s[i]=='0')
{
res.push_back(0);
}
else{
if(s[i]=='1')
res.push_back(1);
els... | 1 | 18,226,642 |
#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>;
typedef long long ll;
typedef vector<ll> VL;... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 1 | 8,320,014 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+10;
struct point
{
ll x;
ll y;
}p[N];
bool cmp(point a,point b)
{
return atan2(a.x,a.y)>atan2(b.x,b.y);
}
int main()
{
int n; cin>>n;
for(int i=1;i<=n;i++)
scanf("%lld%lld",&p[i].x,&p[i].y);
int nx[N];
for(int i=1;i<=n;i++)
nx... | #include<bits/stdc++.h>
using namespace std;
double angle(double a,double b){
double p = a/(abs(a)+abs(b));
if (b<0){
return p-1;
}else{
return 1-p;
}
}
bool com(pair<double,double> a,pair<double,double> b){
return atan2(a.first,a.second) < atan2(b.first,b.second);
}
int main(){
int n;cin>>n;
vector<pair<dou... | 1 | 73,555,938 |
#include<bits/stdc++.h>
typedef long long ll;
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
void fast()
{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
int main()
{
ll n,k,x,y;
cin>>n>>k>>x>>y;
if(n>=k)
cout<<k*x+(n-k)*y<<endl;
else
cout<<n*x<<... | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int N, K, X, Y, result;
cin>>N;
cin>>K;
cin>>X;
cin>>Y;
if(N>K){
cout<< X*K + Y*(N-K);
}else{
cout<< X*N;
}
} | 1 | 28,290,607 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define M 1000000007
ll powll(ll x, ll y) {
ll re=1;
rep(i, y) {
re = re * x % M;
}
return re;
}
int main() {
int n,m;
cin >> n>>m;
vector<ll... | #include <bits/stdc++.h>
#ifdef atclib
#include <atcoder/all>
#endif
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef boost
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ld long double
#define ull unsigned long long
#define vi std::vector<int>
#defi... | 1 | 47,503,003 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
return (b ? gcd(b, a % b) : a);
}
int Solve(vector<int> a, int x) {
int n = a.size();
int ans = 0;
for(int i = 0; i < n; i++) {
ans = gcd(abs(a[i] - x), ans);
}
return ans;
}
int main() {
ios::sync_with_stdio(false)... | 1 | 77,011,767 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(a, b) for(int i=a; i<=b; i++)
#define REP(i, a, b) for(int i=a; i<=b; i++)
#define ff first
#define ss second
#define ll long long
#define inf 1000000000
#define pb push_back
#define mod 1000000007
const ll INF=1e18+5;
const int maxN=1e5+5;... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define int long long int
#define endl "\n"
#define pb push_back
int dp[100001][2];
vector<int> v[100001];
void Indset(int n, int p){
dp[n][0]=1;
dp[n][1]=1;
for(auto c : v[n]){
if(c!=p){
Indset(c,n);
dp[n][0]... | 1 | 8,598,576 |
#include <iostream>
int main() {
int a,b,d,r;
std::cin>>a;
std::cin>>b;
d=a/b;
r=a%b;
std::cout << d << " " << r << " ";
printf("%.8lf\n", (double)a/(double)b );
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << a/b << ' ' << a%b << ' ';
printf("%.8f\n",(double)a/(double)b);
return 0;
} | 1 | 42,259,833 |
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SHIFT_LEFT(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).su... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
const ll MAX = 100010;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
... | 1 | 60,833,248 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
using namespace std;
int main() {
int N, N1 = 0, N0 = 0;
string S;
cin >> S;
N = S.size();
for (int i = 0; i < N; i++) {
if (S[i]... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | 1 | 24,941,889 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr double EPS = 1e-12;
int main(){
int n;
cin >> n;
vector<int64> a(n);
for(int i = 0; i < n; ++i){
cin >> a[i];
}
for(int i = 0; i < n; ++i){
if(a[i] == 0LL){
cout << 0 << endl;
return 0;
}
}
double ke... | #include<stdio.h>
int main() {
int berapaKali;
long long a1[100001];
long long a2 = 1;
long long max = 1000000000000000000;
scanf("%d", &berapaKali);
for(int j=0;j<berapaKali;j++){
scanf("%lld", &a1[j]);
if(a1[j]==0){
printf("0");
return 0;
}
}... | 1 | 29,336,004 |
#include <bits/stdc++.h>
#define INF 1e18 * 5
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
vector <pair<ll,ll>> p;
int n,k;
ll x,y;
vector <ll> vx,vy;
int psum[51][51];
int check[51][51];
map <ll,int> compx,compy;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
ll res = 9223372036854775807;
cin >> n >> k;
for... | 1 | 65,687,446 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <array>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <tuple>
#include <cmath>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cfloat... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n,d,a;
cin >> n >> d >> a;
vector<pair<ll,ll>> mon(n);
for(int i = 0;i < n;... | 1 | 43,227,770 |
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_re... | #include<bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
using vvint = vector<vector<int>>;
using vvLL = vector<vector<LL>>;
bool solve(vint a, int b){
bitset<16001> bit;
bit[8000] =... | 1 | 99,311,041 |
#include <bits/stdc++.h>
using namespace std;
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
const int maxn = 1e5 + 5;
int N, A[maxn], B[maxn], Cnt;
map<int, int> mp;
int main() {
scanf("%d", &N);
foru(i, 1, N) scanf("%d", &A[i]);
foru(i, 1, N) B[i] = A[i];
s... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector< int >v(n);
vector< int >w(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
w[i] = i;
}
sort(w.begin(), w.end(), [&](int i, int j) {
return v[i] < v[j];
});
int ans = 0;
for (i... | 1 | 15,331,500 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
int count=0;
if (N>1){
count += N*(N-1)/2;
}
if (M>1){
count += M*(M-1)/2;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0);cin.tie();cout.tie();
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9 + 7;
const ll inf = 9223372036854775807;
const ll mininf = -9223372036854775807;
c... | 1 | 13,218,806 |
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<set>
#include<map>
#include<memory>
#define FOR(i,R) for(int i=0;i<R;i++)
#define ZERO(a) memset(a,0,sizeof(a))
using namespace std;
typedef pair<int,int> P;
const int INF=10000;
char maze[1024][1024];
int H,... | #include <cstdio>
#include<cstring>
#include <algorithm>
#include <queue>
#define max 1005
using namespace std;
char map[max][max];
bool vis[max][max];
int h,w,n,ans;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
struct node
{
int x;
int y;
int time;
} start;
void BFS(node st,char ed)
{
queue<no... | 1 | 46,899,721 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,k;
int count = 0;
cin >> a >> b >> k;
for(int i = min(a,b);i >=1 ;i--){
if(a % i == 0 && b % i == 0){
count++;
}
if(count == k){
cout << i << endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,K,j=0;
cin>>A>>B>>K;
int i=min(A,B);
for(;j<K;i--)
if(A%i==0 && B%i==0)
j++;
cout<<i+1<<endl;
} | 1 | 44,973,034 |
#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 ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,... | #include <bits/stdc++.h>
using namespace std;
long long solve(long long N){
if(N % 2 == 1) return 0;
long long ans = 0;
N /= 2;
while(N){
ans += N/5;
N /= 5;
}
return ans;
}
int main(void){
long long N; cin >> N;
cout << solve(N) << endl;
} | 1 | 44,068,780 |
#include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);
int a,b,c,d;
cin>>a>>b>>c>>... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 1 | 16,759,820 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
string yes = "Yes\n";
string no = "No\n";
int main()
{
int a,b; char op; cin>> a >> o... | #include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char const* argv[]) {
int A, B;
char op;
scanf("%d %c %d", &A, &op, &B);
if (op == '+') printf("%d\n", A + B);
else printf("%d\n", A - B);
return 0;
} | 1 | 57,213,424 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> fill(int r, int c, const T& t){ return v2<T>(r, vector<T>(c, t)); }
#define F first
#define S second
int n;
string l;
v2<int> dp;
const int MOD = 1e9+7;
int f(int ind... | 1 | 40,362,085 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const double pi = 3.1415926535897932384;
const int INF = 1000000000;
const ll LINF = 1000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
const ll MOD = 1000000007;
struct UnionFind... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 1 | 9,957,662 |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
typedef pair<long long, long long> P;
int main(){
int N, K;
cin >> N >> K;
vector<long long> x(N), y(N);
for(int i = 0; i < N; i++) cin >> x[i] >> y[i];
long long ans = 5e18;
for(int i = 0; i < N; i++){
for(int... | #include <iostream>
#include <cmath>
#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>
#inclu... | 1 | 69,562,003 |
#include <stdio.h>
#define N 44
int Fib[N];
void fib(int n){
int i;
Fib[0] = 1;
Fib[1] = 1;
for(i=2; i<=n; i++) Fib[i] = Fib[i-1] + Fib[i-2];
}
int main(){
int n;
scanf("%d",&n);
fib(n);
printf("%d\n",Fib[n]);
return 0;
} | #include <iostream>
#define MAX 44
using namespace std;
long long fib[MAX];
int main(){
int n; cin>>n;
fib[0]=fib[1]=1;
for(int i=2;i<=n;i++){
fib[i]=fib[i-1]+fib[i-2];
}
cout<<fib[n]<<endl;
} | 1 | 79,875,900 |
#include <bits/stdc++.h>
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 = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll A,B; cin >> A >> B;
ll A_sum... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
ll calc(ll A)
{
if (A <= 0)
return 0;
ll ans = 0;
for (int i = 0; i < 50;... | 1 | 49,025,533 |
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 1e5 + 2;
int n, m, k, a[N], dir[N], b[N];
inline int Collide(int i, int j)
{
if (dir[i] == dir[j]) return false;
if (dir[i] == -1) swap(i, j);
int dist = (a[j] - a[i] + m) % m;
if (k * 2 < dist) return 0;
else return 1 + (k * ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 1 | 50,180,126 |
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
ll n,m;
cin>>n>>m;
map<ll,ll> M;
ll tmp=0,x;
M[0]++;
rep(i,n){
cin>>x;
tmp=(tmp+x)%m;
M[tmp]++;
}
ll sum=0;
for(auto y:M){
... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
bool compPair(const pair<int, int>& arg1, const pair<int, int>& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a =... | 1 | 38,288,522 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n,m;
cin >> n >> m;
int ans = 0;
REP(i,n){
ans += i;
}
REP(i,m){
ans += i;
}
cout << a... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 1 | 13,056,315 |
#include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
#if !ONLINE_JUDGE
freopen("in1.txt", "r", stdin);
freopen("out1.txt", "w" , stdout);
#endif
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw" << endl;
}
else if (a == 1)
{
cout << "Alice" << endl;
}
else if (b == 1)
... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 1 | 83,871,174 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << (a % b == 0 ? 0 : 1) << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin >> n >> k;
int ans=0;
if(n%k!=0)
{
ans=1;
}
cout << ans << endl;
} | 1 | 72,786,033 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define INF (1<<30)-1
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp(a,b) make_pair(a,b)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"... | 1 | 61,179,140 |
#include <bits/stdc++.h>
const static double de_PI = 3.14159265358979323846;
const static int de_MOD = 1000000007;
const static int de_MAX = 999999999;
const static int de_MIN = -999999999;
int main(void) {
int a = 0;
std::cin >> a;
double n = 100000;
for (int i = 0; i < a; i++) {
n = n*1.05;
n = static_cast<in... | #include <iostream>
using namespace std;
int main() {
double money = 100000;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
money *= 1.05;
double miman = money - ((int)(money*0.001)) * 1000.0;
if (miman > 0) {
money = money - miman + 1000.0;
}
}
cout << (int)money << endl;
return 0;
} | 1 | 56,914,598 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long L,R;
cin >> L >> R;
long long i = L;
long long j = L+1;
int min = 2018;
int now;
while(i < j && i <= L +2019){
j = i+1;
while(j <= R && j <= L +2019){
now = ((i%2019) * (j % 2019)) % 2019;
if(now < min) min = now;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long l,r;
cin>>l>>r;
if(r-l>=2019)cout<<0<<endl;
else {
long long kotae=LLONG_MAX;
for(long long i=l;i<r;i++){
for(long long j=i+1;j<=r;j++){
kotae=min(kotae,(i%2019*j)%2019);
}
}
cout<<kotae<<endl;
}
return 0... | 1 | 49,057,319 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n,cnt;
cin >> n >> cnt;
vec v(n);
for(ll i=0;i<n;i++) cin >> v[i];
ll ans=-inf;
for(ll i=0;i<=n;i++) {
fo... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 1 | 77,524,832 |
#include <bits/stdc++.h>
#define REPI(x) for(int i=0;i<x;i++)
#define REPJ(x) for(int j=0;j<x;j++)
#define REPISE (s,e) for(int i=s,i<e;i++)
#define REPJSE (s,e) for(int j=s,j<e;j++)
typedef long long ll;
using namespace std;
int main ()
{
int N,b;
int A[3][3],linenum[8];
vector<int> lines[8];
REPI(3)
REPJ(... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int arr[101][101] = {0};
int main()
{
for(int i=0; i<3; i++)
{
for(int j=0; j<3; j++)
{
cin >> arr[i][j];
}
}
int a;
cin >> a;
for(int n=0; n<a; n++)
{
int o;
cin >> o;
for(int i=0; ... | 1 | 45,662,948 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#def... | #include <bits/stdc++.h>
using namespace std;
int INF = 1e9;
int main(){
int N;
cin >> N;
vector<int>a(N);
for(int i = 0; i < N; i++) {
cin >> a[i];
}
int ans = INF;
for(int i = -100; i <= 100; i++) {
int cnt = 0;
for(int j = 0; j < N; j++) {
cnt+=(i-a[j])... | 1 | 31,942,398 |
#include<stdio.h>
int a,b,c;
int main()
{
scanf("%d%d%d",&a,&b,&c);
printf("%d\n",a==b&&a==c&&b==c?1:(a==b||a==c||b==c?2:3));
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0,i##_len=(int)(n);i<i##_len;i++)
#define rep1(i,n)for(int i=1,i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=(int)(n)-1;0<=i;i--)
#define rrep1(i,n) for(int i=(int)(n);1<=i;i--)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it... | 1 | 93,620,618 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define rep_start(a,i,n) for(ll i=a;i<=n;i++)
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define rev1(i,n) for(ll i=n;i>0;i-... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define rep(i, n) for(int i=0;i<(int)(n);i++)
int main(){
ll n, m;
cin >> n >> m;
vector<ll> h(n);
vector<int> a(m);
vector<int> b(m);
vector<bool> good(n, true);
rep(i, n){
cin >> h.at(i);
}
rep(i, m){
... | 1 | 58,471,403 |
#include <stdio.h>
#include <string.h>
#define STRMAX 256
int main(void)
{
char str[STRMAX];
char out[STRMAX];
int num;
int num2;
int i;
while (1) {
memset(str, '\0', sizeof(str));
scanf("%s", str);
if (str[0] == '-') {
break;
}
else {
scanf("%d", &num);
for (i=0; i<num; i++) {
scanf("%d... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <iomanip>
using namespace std;
#define pi 3.141592653589
#define repeat(i,n) for(int i=0;i<n;i++)
int main()
{
string str;
string temp;
int n;
int h;
while (1)
{
cin >>... | 1 | 68,816,780 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define FOR(x,y) for(int i=x; i<y; ++i)
#define FORR(x,y) for(int i=y-1; i>=x; i--)
using namespace std;
int main() {
long long n; cin >> n;
vector<long long> arr(n),b(n);
FOR(0,n){
cin >> arr[i];
b[i] = arr[i] - (i+... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
vector<long> A(N);
for (long i = 0; i < N; i++) {
cin >> A.at(i);
A.at(i) = A.at(i) - (i + 1);
}
sort(A.begin(), A.end());
long m = A.at(N / 2);
long ans = 0;
for (auto a : A) ans += abs(a - m);
cout << ans << "\n";... | 1 | 79,854,918 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n,m,x;
cin>>n>>m>>x;
vector<int> c(n);
vector<vector<int>> avi(n,vector<int>(m));
rep(i,n){
cin>>c[i];
rep(j,m){
cin>>avi[i][j];
}
}
int min_cost = 12... | #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... | 1 | 84,790,371 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll ans = 110;
for(ll i=1;i*i<=N;i++){
if(N%i==0){
ll m = max(i, N/i);
ll d = 0;
while(m>0){
d++;
m = m / 10;
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int count(ll x){
int cnt=0;
while(x>0) x/=10,++cnt;
return cnt;
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
ll n;
cin>>n;
int res=99;
for(ll i=1;i*i<=n;++i)
if(n%i==0){
ll x=i;
ll y=n/i;
res=min(res,max(count(i),count(n/i)... | 1 | 97,352,883 |
#include <iostream>
using namespace std;
int main(void){
long long a,b,c,k;
cin>>a>>b>>c>>k;
if (abs(a-b)>1000000000000000000){
cout<<("Unfair");}
else{
if (k%2==0){
cout<<(a-b);}
else{
cout<<(b-a);
}
}
} | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii... | 1 | 38,592,501 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define NUM(x,v) (POSU(x,v)-POSL(x,v))
#define SORT... | #include <bits/stdc++.h>
#include <stdlib.h>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod=1000000007;
ll BIG=1e9;
ll d[100001];
int main(){
int K;cin>>K;
queue<int> Q;
d[1]=1;
Q.push(1);
while(!Q.empty()){
int x=Q.front();
int p=(10*x)%K, q=(x+1)%K;
whil... | 1 | 29,415,363 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N ;
cin >> N ;
if ( N/1000 == N/100 % 10 && N/1000 == N/10 % 10){
cout <<"Yes" << endl;
}else if( N/100 % 10 ==N/10 % 10 && N/100 % 10 == N % 10){
cout <<"Yes" << endl;
}else {
cout <<"No" << endl ;
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
int memo1 = x / 1000;
int memo2 = (x / 100) % 10;
int memo3 = (x % 100) / 10;
int memo4 = x % 10;
if(memo1 == memo2 && memo2 == memo3){
cout << "Yes" << endl;
}
else if(memo2 == memo3 && memo3 == memo4)... | 1 | 1,819,347 |
#include <iostream>
using namespace std;
int main(){
int num[3];
int tmp;
for(int n=0;n<3;n++)cin>>num[n];
for(int x=0;x<3;x++){
for(int y=2;y>0;y--){
if(num[y]<num[y-1]){
tmp=num[y];
num[y]=num[y-1];
num[y-1]=tmp;
}
}
}
cout<<num[0]<<" "<<num[1]<<" "<<num[2]<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if (a < b) {
if (b < c) cout << a << " " << b << " " << c << endl;
else {
if (a < c) cout << a << " " << c << " " << b << endl;
else cout << c << " " << a << " " << b << endl;
}
} else {
if (a < c) cout << b << " " ... | 1 | 23,680,019 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int lcs(string s1, string s2){
int n=s1.size();
int m=s2.size();
s1=' '+s1;
s2=' '+s2;
int dp[n+1][m+1];
for(int i=0; i<=n; i++) dp[i][0]=0;
for(int i=0; i<=m; i++) dp[0][i]=0;
for(int i=1; i<=n; i++){
for(int j=... | #include <bits/stdc++.h>
using namespace std;
int LCS(const string &a, const string &b) {
vector<vector<int>> dp(a.size() + 1, vector<int>(b.size() + 1, 0));
for (int i = 0; i <= a.size(); i++) {
for (int j = 0; j <= b.size(); j++) {
if (i > 0 && j > 0) {
if (a[i - 1] == b[j - 1]) {
dp[i][j] = max(dp[i]... | 1 | 34,219,898 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.