code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define tr... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
#define REP(i,e,s) for(register int i=e; i<=s; i++)
#define DREP(i,e,s) for(register int i=e; i>=s; i--)
#define ll long long
#define DE(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG(a) DE("DEBUG: %d\n",a)
#define int long lon... | 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>;
int main() {
int N, K;
cin >> N >> K;
vector<double> p(N+1, 0);
int x;
double val;
for(int i=1; i<=N; i++){
cin >> x;
val = x*(x+1) * 0.5 / x;
p.at(i) =... | //...Bismillahir Rahmanir Rahim...
// Code by Asad Bin Saber
#include <bits/stdc++.h>
using namespace std;
// typedefs...
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
// cons... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
if (n == 2) {
int o, e; cin >> o >> e;
if (o == e) cout << 1 << endl;
else cout << 0 << endl;
return 0;
}
const int p = n / 2;
const int z = 100001;
vector<int> o_num(z, 0), e_num(z, 0);
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, v;
cin >> n;
int* ohash = (int*) calloc(100000, sizeof(int));
int* ehash = (int*) calloc(100000, sizeof(int));
for (int i = 0; i < n/2; i++) {
cin >> v;
ohash[v - 1]++;
cin >> v;
ehash[v - 1]++;
}
int omax = 0, emax = 0;
f... | 1 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
void solve(){
ll n;
cin>>n;
ll rem, num = 26;
string str="";
while(n != 0){
// cout<<1<<endl;
rem = n%26;
if(rem == 0){
str += 'z';
n = n/26;
... | #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;
ll ans = 0;
for (int i = 1; i <= n; ++i) {
if (i % 3 && i % 5) ans += i;
}
cout << ans << endl;
return 0;
} | 0 |
using namespace std;
#include <bits/stdc++.h>
int main(){
int a,b;cin>>a>>b;
if(a<=8&&b<=8)std::cout << "Yay!" << std::endl;
else
std::cout << ":(" << std::endl;
} | // Sakhiya07 - Yagnik Sakhiya
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define MOD 1000000007
const int N = 100005;
#define FAST ios_base::sync_... | 0 |
#include <iostream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <vector>
#include <utility>
#include <algorithm>
#include <queue>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// 組合せを素数で割った値を求める
const int MAX = 510000;
const int MOD = 1e9 + 7;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = f... | 1 |
#include <cstdio>
#include <cstdlib>
#include <numeric>
using namespace std;
int main() {
char *line = NULL;
size_t buffer_size = 0;
while (getline(&line, &buffer_size, stdin) > 0) {
int ls[10];
int v1, v2;
sscanf(line, "%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d",
ls, ls+1, ls+2, ls+3, ls+4, ls... | #include<stdio.h>
int main(void){
int l[10],v[2];
int sv,sl,i;
double n;
while(~scanf("%d",l)){
sv=0;sl=l[0];
for(i=1;i<=9;i++){
scanf(",%d",l+i);
sl+=l[i];
}
for(i=0;i<2;i++){
scanf(",%d",v+i);
sv+=v[i];
}
n=sl/(double)sv;
n*=v[0];
for(i=0;n>0;i++)n-=l[i];
printf("%d\n",i);
}
return... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp make_pair
#define xx first
#define yy second
#define pii pair <int, int >
#define pll pair < ll, ll >
#define xx first
#define yy second
#define vi... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
#define ref goto refrain
class dice{
public:
int o,u,s,e,n,w;//over,under,south,east,north,west
void change(char a);
};
void dice::change(char a){
int tem=o;
if(a=='S'){
o=n; n=u; ... | 0 |
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) { }
bool unionSet(int x, int y) {
x = root(x); y = root(y);
if (x != y) {
if (data[y] < data[x]) swap(x, y);
data[x] += data[y]; data[y... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class... | 0 |
#include <iostream>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
int n, m;
int t[13][13];
int main(){
while(cin >> n, n){
rep(i,13)rep(j,13)t[i][j]=0;
rep(i,n)rep(j,n){
cin >> m;
t[i][j] = m;
t[n][j] += m;
t[i][n] += m;
t[n][n] += m;
}
... | #include <stdio.h>
int main(void){
int n;
int a,b;
int aSum, bSum;
while (scanf("%d", &n), n!=0){
aSum = bSum=0;
for (int i=0; i<n; i++){
scanf("%d %d", &a, &b);
if (a>b) aSum += (a+b);
else if (a<b) bSum += (a+b);
else aSum += a, bS... | 0 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
// #include <prettyprint.hpp>
using namespace std... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> L(n);
rep(i,n) cin >> L[i];
int res = 0;
for(int i = 0; i < n; ++i) {
for(int j = i + 1; j < n; ++j) {
for(int k = j + 1; k < n; ++k) {
... | 1 |
#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 a,b;
cin >> a >>b;
int mx = max(a,b);
int mn = min(a,b);
int mx2 = max(mx-1,mn);
cout << mx + mx2 << endl;
}
// cout << fixed << setprecision(15) << ... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string a(int aa, int b) {
if(aa <= 8 && b <= 8) {
return "Yay!";
}
return ":(";
}
int main() {
int aa, b;
cin >> aa >> b;
cout << a(aa, b);
}
| /*
R R R R R R R R R R R R R R R R R R
R R R R R RR R R R R R R R R
R R R R R R R R R R R R R R R R R ... | 1 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0, before;
cin >> before;
bool HasNoAns = (before > 0);
for (int i = 1; i < N; i++) {
int now;
cin >> now;
if (now == 0) {
before = now;
continue;
}
if (now == before + 1) ans++;
else {
if (now <= before) ... | #include <bits/stdc++.h>
using namespace std;
int a[200002], b[200002];
int main(){
int n;
scanf("%d", &n);
bool ok = 1;
for(int i=1;i<=n;i++){
scanf("%d", &a[i]);
if(a[i] > a[i-1] && a[i]-a[i-1] > 1){
ok = 0;
}
if(i == 1 && a[i] != 0){
ok = 0;
... | 1 |
#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 998244353
#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)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> D(N), cnt(N);
for (int i = 0, d; cin >> d; i++) {
D.at(i) = d;
cnt.at(d)++;
}
if (D.at(0) || cnt.at(0) != 1) return cout << 0 << "\n", 0;
long ans = 1;
int mx = *max_element(D.begin(), D.end());
for (long ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
#ifdef _DEBUG
//freopen("_in" , "r", stdin );
//freopen("_out", "w", stdout);
#endif
ios::sync_with_stdio(0); cin.tie(0);
string s[3]; cin >> s[0] >> s[1] >> s[2];
int i = 0;
for(;;) {
if (!s[i].size()) break;
int t;
if (s[i][0] == 'a') t = 0;
if ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int A[N];
for(int i=0;i<N;i++){
cin>>A[i];
}
bool ans=true;
sort(A,A+N);
for(int i=0;i<N-1;i++){
if(A[i]==A[i+1]){
ans =false;
break;
}
}
if(ans){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
... | 0 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | #include<iostream>
#include<string>
using namespace std;
int main(void){
string str;
int q;
cin >> str;
cin >> q;
for (int i=0;i<q;i++){
string c;
cin >> c;
if (c=="print"){
int a,b;
cin >> a >> b;
for (int i=a;i<=b;i++)
cou... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[5009];
ll a[5000];
int main()
{
ll n;ll ans=0;
multiset<ll>s;cin>>n;
for(int i=0;i<n;i++){
ll x;cin>>x;
if(s.size()==0){
s.insert(x);
ans++;
}
else
{
auto z=s.... | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PP;
typedef vector<vector<ll> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ch... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp... | 0 |
#include <bits/stdc++.h>
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 1e5 + 10;
ll x[N], p[N];
ll ans;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n, S; cin >> n >> S;
int pos = -... | #include<bits/stdc++.h>
using namespace std;
const int maxn=100005;
inline int read(){
register int x=0,w=1,ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')w=-1;
for(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-48;
return w*x;
}
int n,s,x[maxn];
long long p[maxn];
long long calc(int l,int r,int lst){
if(... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <functional>
#include <iomanip>
#include <bitset>
#include <numeric>
#include <queue>
#include <map>
#include <cstdint>
#include <set>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long lon... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(fa... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int partition(int A[], int p, int r) {
int x = A[r];
int i = p;
for (int j = p; j < r; j++) {
if (A[j] <= x) {
swap(A[i++], A[j]);
}
}
swap(A[i], A[r]);
return i;
}
int main() {
int n;
cin >> n;
int A[n], suffix;
for (int i = 0; i < n;... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pd... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
int k;
cin >> s >> k;
int n = s.size();
vector<vector<vector<int>>> dp(n, vector<vecto... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<limits>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define clr(a,v) memset((a),(v),sizeof(a))
const int MAX_N = 100, INF = std::numeric_limits<int>::max()>>2;
int n;
int r[MAX_N], c[MAX_N];
std::vector<std:... | 0 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
const ll INF = 1e16;
#define PI (acos(-1))
//const ll mod = 1000000007;
struct LazySegmentTree {
private:
int n;
vector<ll> node, lazy;
public:
LazySegmentTree() {
int sz = 200050;
n = 1; while(n < sz) n... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
string s;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> s;
int lc = 0, rc = 0;
for (auto& i : s) {
if (i == 'S') lc++;
else {
if (lc) lc--;
else rc++;
}
}
cout << lc + ... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define P pair<ll, ll>
using ll = long long;
#define ALL(v) (v).begin(),(v).end()
#define endl ... | 1 |
#include<iostream>
#include<climits>
using namespace std;
int main(){
int n,a[5001];
int ans;
a[0]=0;
while(cin>>n&&n){
ans = INT_MIN;
for(int i=1;i<=n;i++){
cin>>a[i];
a[i] += a[i-1];
}
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
... | #include <iostream>
#include <limits>
#include <algorithm>
using namespace std;
int main()
{
for (int n; cin >> n && n;) {
vector<int> sequence(n);
int sum = 0;
int max_val = numeric_limits<int>::min();
for (int x, i = 0; i < n && cin >> x; i++) {
if (sum < 0)
... | 1 |
#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 mod=1000000007;
const int INF=1001001001... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
typedef pair<int, int> P;
vector<int> G[100000];
int depth[100000];
bool ok[100000];
P depth_pair[100000];
void dfs_depth(int v, int d){
depth[v] = d;
for(int i = 0; i < G[v].size(); i++){
if(depth[G[v][... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int minimum = N;
for(int i = 0; i < N; i++) {
int P;
cin >> P;
if(P <= minimum) {
minimum = P;
ans++;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int i=(s);(i)<(int)(e);++(i))
#define REP(i,e) FOR(i,0,e)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();++it)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define ppb(x) pop_back(x)
#define mp make_pair... | 1 |
#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... | #include <iostream>
#include <iomanip>
using namespace std;
int main(void)
{
const double PI=3.1415926535897932;
int r; cin >> r;
double l = (double) (2 * r) * PI;
cout << fixed << setprecision(15) << l << endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | // #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree... | 1 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int n;
cin >> n;
vector<double> a(n);
double sum = 0;
for(int i = 0;i < n;i++){
cin >> a[i];
sum += a[i];
}
double ave = sum / n;
double t = 101;
int ans = -1;
for(int i = a.size() - 1;... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{
int N; cin >> N;
vector<double> as(N); for... | 1 |
#include<cstdio>
using namespace std;
#define LL long long
#define mod 998244353
const int NN=1000000+117;
LL fact[NN]={};
LL rev[NN]={};
LL comp(int m,int n){
return fact[n]*rev[m]%mod*rev[n-m]%mod;
}
LL ksm(LL a,LL b){
LL ret=1;
while(b){
if(b&1){
(ret*=a)%=mod;
}
(a*=a)%=mod;
b>>=1;
}
return ret;
}
i... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 1 |
#include <iostream>
using namespace std;
bool Include3(int n){
if(n%10==3){
return true;
}
n/=10;
if(n){
return Include3(n);
}
return false;
}
void CheckNum(int n){
if(n%3==0){
cout << " " << n;
return;
}
if(n>9){
if(Include3(n)){
... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n;i++) {
if (i % 3 == 0) {
cout << " " << i;
}
else {
for (int j = 0; j < 4;j++) {
int n;
int m;
n = pow(10, j + 1);
m = n / 10;
if (j == 0 && i % n == 3) {
c... | 1 |
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int n,h,w,res1,res2;
signed main(){
cin>>n>>h>>w;
res1=n-h;
res1++;
res2=n-w;
res2++;
res1=res1*res2;
cout<<res1<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const string EMP = " ";
const ll INF = 1LL<<60;
const ll MOD = 1000000007;
const... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
//#include "MyMath.h"
//#include "MyDisjointset.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
#include <stdio.h>
using namespace std;
typedef pair<int, int> P;
const int INF = 1000000000;
struct edge {
int ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100005;
struct sj{
int a,l,r;ll x;
inline sj(){}
inline sj(int a,int l,int r,ll x):a(a),l(l),r(r),x(x){}
inline bool operator<(const sj &t)const{return x>t.x;}
}d[N];
inline void cmax(ll &a,ll b){if(a<b)a=b;}
inline ll Y(int i,ll k){
ll... | 0 |
#include <bits/stdc++.h>
#define rep2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
template <typename T>
T sq(T x) {
return x * x;
}
signed main() {
int R, G;
cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int r, g;
cin >> r;
cin >> g;
cout << g - r + g << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(int i = (a); i >= (b); --i)
#define RI(i,n) FOR(i,1,(n))
#define REP(i,n) FOR(i,0,(n)-1)
#define mini(a,b) a=min(a,b)
#define maxi(a,b) a=max(a,b)
#define mp make_pair
#define pb push_back
#define st ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
namespace yspm{
inline int read()
{
int res=0,f=1; char k;
while(!isdigit(k=getchar())){if(k=='-') f=-1;}
while(isdigit(k)){res=res*10+k-'0'; k=getchar();}
return res*f;
}
const int N=2e3+10;
int n,m,T,sum1[N][N],g[N][N];
int lin[N][N],row... | 0 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | #include<bits/stdc++.h>
using namespace std;
template<typename T>inline T read(){
T f=0,x=0;char c=getchar();
while(!isdigit(c)) f=c=='-',c=getchar();
while(isdigit(c)) x=x*10+c-48,c=getchar();
return f?-x:x;
}
#define int long long
namespace run{
const int N=2e5+9;
int a[N],m,v,p,n,ans,sum[N];
int main(){
n=r... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
ll n;
cin >> n;
vec... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using names... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
}
sort(a.begin(),a.end());
int flag=0;
for(int i=0;i<n-1;i++){
if(a.at(i)==a.at(i+1)){
flag=1;
}
}
if(flag==0){
cout<<"YES";
}else{
cout<<"NO"... | #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;
map<int,int>mp;
for(int i=0;i<n;i++){
int a;
cin>>a;
mp[a]++;
mp[a]%=2;
}
long long kotae=0;
auto begin=mp.begin(),end=mp.end();
for(auto iter=begin;iter!=end... | 0 |
#include <stdio.h>
int main(void){
int n,i,j,k;
scanf("%d",&n);
int retsu[n];
for (i = 1; i <= n; i++){
k = n - i;
scanf("%d",&retsu[k]);
}
for (j = 0; j < n; j++){
if( j ) printf(" ");
printf("%d",retsu[j]);
}
printf("\n");
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(void){
int n;
cin>>n;
vector<ll> a(n),b(n),c(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
cin>>b[i];
}
for(int i=0;i<n;i++){
cin>>c[i];
}
sort(a.begin(),a.end());
sort(c.begin(),c.end());
ll ans... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
reverse(b.begin(), b.end());
int start = -1, fin = -1;
for (int i = 0; i < n; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
rep(i,N){
cin >> A[i]... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
typedef long long ll;
int gi() {
int x=0,o=1;char ch=getchar();
while(!isdigit(ch)&&ch!='-') ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(isdigit(ch)) x=x*10+ch-'0',ch=getchar();
return x*o;
}
struct dat {
int l,r;
bool operator<(const da... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
const ll p=1000000007;
int main(){
ll n;
cin >> n;
ll bb=0;
ll k[n];
rep(i,n){
ll a,b;
cin >> a >> b;
bb+=b;
k[i]=a+b;
}
sort(k,k+n);
ll ans=0;
rep(i,n-n/2){
ans+=... | 0 |
// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,m;
cin >> a >> b >> m;
vector<int> refs(a);
vector<int> renges(b);
for(int i = 0; i < a; i++) {
cin >> refs.at(i);
}
for(int i = 0; i < b; i++) {
cin >> renges.at(i);
}
int ans = refs.at(0) + renges.at(0);
for(in... | 1 |
#include<stdio.h>
#include<string.h>
void haichi(void);
void Block(int,int);
int c,d,x,y,xg,yg,M,Flag;
int MAP[101][101],MF[101][101];
int main(void)
{
int w,h,xs,ys,n;
while(1){
Flag=0;
memset(MAP,0,sizeof(MAP));
memset(MF,0,sizeof(MF));
scanf("%d %d",&w,&h);
if(w == 0 && h == 0) break;
scanf("%d %d %d %... | #include<iostream>
using namespace std;
#define MAX 100
#define BLANK 0
#define LONG 4
#define SHORT 2
#define HORIZONTAL 0
#define VERTICAL 1
#define VISITED 9
int field[MAX+2][MAX+2];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
void rec(int x,int y,int c)
{
int i;
if(field[x][y]!=c)return;
field[x][y]=VISITED;... | 1 |
#include <iostream>
#include <vector>
using namespace std;
const int V_MAX = 100000;
struct LowLink
{
const vector<vector<int>> &g;
int V;
vector<vector<int>> dfs_tree;
vector<int> dfs_roots;
int pre_order[V_MAX];
int p_ord = 0;
int lowlink[V_MAX];
bool articulation[V_MAX] = {};
vector<pair<int, int>> bridge;... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool ... | 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>;
int main() {
int n, cnt = 0; cin >> n;
ll x; cin >> x;
vector<ll> a(n);
rep(i,n) cin >> a[i];
sort(a.begin(), a.end());
rep(i,n) {
if (x >= a[i])... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo LLONG_MAX
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
int ans=0;
for(int i=1;i<=n;i++){
if(i*i>n)break;
ans=max(ans,i*i);
}
cout<<ans<<endl;
} | #include <iostream>
using namespace std;
int main(void)
{
int x; cin >> x;
int ans = 0;
ans += 1000 * (x / 500);
x = x % 500;
ans += 5 * (x / 5);
cout << ans << endl;
} | 0 |
/*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#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
... | #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() {
int N, M, L, R;
cin >> N >> M;
int a, b;
a = 0;
b = N;
for (int i = 0; i < M; i++) {
cin >> L >> R;
a = max(a, L);
b = min(b, R);... | 0 |
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef pair<ll,ll> PLL;
#define REP(x,l,u) for(ll x = l; x < u; x++)
#define RREP(x,l,u) for(ll x = l; x >= u; x--)
#define all(x) x.begin(), x.end... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
//#define INF 1e18
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX]; //n!, 1/n!, 1/n
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rall(x) (x).rbegin(),(x).rend()
int main(){
int n; cin>>n;
n*=2;
vector<int> v(n);
rep(i,n) cin>>v[i];
sort(rall(v));
int cnt=0;
for(int i=0; i<n; i+=2){
cnt+=v[i+1];
}
cout<<cnt<<endl;
} | #include<iostream>
#include<vector>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<map>
#define INF 0xFFFFFF
#define ull unsigned long long
#define ll long long
#define ms(x,a) memset(x,a,sizeof(x))
#define endl "\n"
#define M(a,b) (a+b)/2
#define L(x) 2*x
#define R(x) 2*x+1
using namespace std;
ty... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ll long long
#define PB push_back
#define PII pair <long long , long long>
#define FAST ios::sync_with_stdio(false);cin.tie(0);
const int maxn = 2e3 + 30;
string a[maxn];
int vertex[maxn][maxn] , er[maxn][maxn] , ed[maxn][maxn];
i... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typed... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
char c[55][55];
bool visited[55][55];
int d[55][55];
int dx[4] = {0,1,0,-1}, dy[4] = {1,0,-1,0};
queue<P> Q;
int main()
{
int H,W;
cin >> H >> W;
int cntW = 0;
rep(i,H)
{
rep(... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
typedef vector<vlint> vvlint;
typedef vector<bool> vbool;
typedef vector<int> vint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n);... | 1 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,... | #include <iostream>
#include <stdio.h>
using namespace std;
double sum(int b[],int);
void bubble(int b[],int);
int main(){
int a;
cin >> a;
int b[a];
for (int i=0;i<a;i++)
cin >> b[i];
bubble(b,a);
cout << b[0] << " " << b[a-1] << " " ;
printf("%.0f\n",sum(b,a));
}
void bubble(in... | 0 |
#include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <sstream>
type... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
int n;
string s,t;
cin >> n >> s >> t;
int ans = 2*n;
rep(i,1,n+1){
if(s.substr(n-i,i) == t.substr(0,i)) ans = 2*n-i;
}
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_... | 0 |
#include <cstdio>
int main()
{
int a,b,c,sum;
scanf("%d/%d/%d",&a,&b,&c);
sum = a + 1;
if(b < 10)
{
printf("%d/0%d",sum,b);
}
else
{
printf("%d/%d",sum,b);
}
if(c < 10)
{
printf("/0%d",c);
}
else
{
printf("/%d"... | #define _GIBCXX_DEBUG
#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()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll MAX_N = 1000000010;
int main(void) {
ll n;
cin >> n;
vector<ll> v;
ll num = 1;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M);
for (int i = 0; i < M; i++) {
cin >> A[i];
}
// 昇順で確認する必要がある
sort(A.begin(), A.end());
vector<int> p = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
// マッチをi本使ったときの桁数の最大値
// 初期値は-1で埋めておく
// 要素数は N + 7... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ll long long
#define P pair<int,int>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int MOD = 1000000007;
const int INF = 2002002002;
const ll LLINF = 9009009009009009009;
using namespace std;
int main() {
... | 0 |
//...Bismillahir Rahmanir Rahim...
// Code by Asad Bin Saber
#include <bits/stdc++.h>
using namespace std;
// typedefs...
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
// cons... | #include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
const int N=2e5+3;
//string s,p;
//vector<int>v;
//map<in... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for(int (i) = (n); (i) < (m); ++(i))
constexpr int INF = 1e9;
// constexpr ll INF = 1LL<<61;
constexpr ll mod = 1e9+7;
... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
/*---------------------DEBUGGING--------------------------------------------*/
void __print(int x) {cerr <<... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N,M;
cin >> N >> M;
vector<ll> A(N+M-1),B(N+M-1),G[N],in_cnt(N,0);
vector<bool> is_root(N,true);
for(int i=0;i<N+M-1;i++){
cin >> A[i] >> B[i];
A[i]--,B[i]--;
G[A[i]].push_back(B[i]);
is_root[B[i]] = false;
in_cnt[B[i]]+... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 1e5+23;
vector<int> g[N], ans;
bool bio[N];
int parent[N];
void dfs(int u)... | 1 |
#include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
//printf(%.12lf\n,mid);
// __builtin_popcount(int) count 1's in binary
// get decimal part of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
... | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cassert>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<list>
#include <cstring>
#include <functional>
//#include<unordered_map>
//#include<unordered_set>
using name... | 1 |
#include <iostream>
using ll = long long;
using namespace std;
/* initialize */
int temp, n;
/* main */
int partition(int A[],int p,int r){
int x = A[r];
int i = p-1;
for (int j = p; j < r; j++) {
if (A[j] <= x){
i++;
temp = A[i];
A[i] = A[j];
A[j] = ... | #include <iostream>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
int main(){
int N;
cin >> N;
int A[N];
for(int i=0; i<N; i++){
cin >> A[i];
}
int B[N];
long ans = 0;
for(int i=0; i<N; i++){
if(i-A[i]<0){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long mod=1000000007;
long long dp[2][2000000],cnt[2000000]={},z=0LL;
long long modpow(int a,int b)
{
if (b==0)
{
return 1LL;
}
long long ans=modpow(a,b/2);
ans*=ans;
ans%=mod;
if (b%2==1)
{
ans*=a;
ans%=mod;
}
return ans;
}
int main(int argc, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... | 0 |
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> ... | 1 |
#include <iostream>
#include <vector>
//#include <string>
//#include <algorithm>
//#include <math.h>
//#include <queue>
//#include <stack>
//#include <iomanip>
// sometimes used
//#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
//typedef long long L... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define forn(i,a,b) for(int i =a;i<b;i++)
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false);
using namespace std;
// typedef long long int
typedef long long int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;
// typede... | 0 |
#include <iostream>
#include <cstdlib>
#include <queue>
#include <vector>
#include <utility>
#include <climits>
using namespace std;
struct edge {int to, cost;};
typedef int Vertex;
typedef pair<int, Vertex> P;
typedef vector<vector<edge>> Graph;
Graph make_graph(const int V, const int E){
Graph G(V);
for(in... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k;
int m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
vector<int> sumW(n + 1, 0);
REP(i, n) {
if (s[i] == 'W') sumW[i + 1] = sumW[i] + 1;
e... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
//入力
int n;
string s; //左が縦の行数、右が横の列数（念のため、余裕をもって+1）
int num_e = 0; //西向きの合計人数
int num_w = 0; //東向きの合計人数
cin >> n >> s;
for (int i=0; i<n; i++) {
if (s[i]=='E') num_e++;
if (s[i]=='W') num_w++;
... | 1 |
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
#include<stack>
#include<set>
using namespace std;
#define MOD 998244353
#define f(i,n) for(long long i=0;i<(long long)(n);i++)
#define N 2500100
long long kai[N];
long long rk... | 1 |
#include <stdio.h>
int main() {
int H, W, N;
scanf("%d %d %d", &H, &W, &N);
if(W >= H){
for(int i = 1; i <= H; i++) {
if (W * i >= N) {
printf("%d", i);
break;
}
}
}
else {
for(int i = 1; i <= W; i++){
if (H * i >= N) {
pr... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int H, W, N;
cin >> H >> W >> N;
if (H >= W) {
if (N % H == 0) {
cout << N / H << endl;
}
else {
cout << N / H + 1 << endl;
}
}
else {
if (N % W == 0) {
co... | 1 |
#include<stdio.h>
int main()
{
int a = 0, b = 0, x, y, n, i;
for (;;){
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++){
scanf("%d %d", &x, &y);
if (x > y){
a += x + y;
}
else if (x == y){
a += x;
b += y;
}
else
b += x + y;
}
printf("%d %d\n", a, b);
a = 0;
... | #include <iostream>
using namespace std;
int main() {
int n;
while(1){
cin >> n;
if(n == 0) break;
int num[10000][2] = {};
int score[2] = {};
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < 2; ++j){
cin >> num[i][j];
}
if (num[i][0] > num[i][1])
... | 1 |
#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;
#define ll long long int
#define ld long double
#define ordered_set tree < ll , null_type , less<ll> , rb_tree_tag , tree_order_statistics_node_update >
//added tw... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i=0; i<(int64_t)(n); i++)
#define all(v) v.begin(), v.end()
//c
int main(){
int n, k;cin >> n >> k;
vector<vector<int>> a(51, vector<int>(n));
rep(i, n) cin >> a[0][i];
rep(i, k){
vector<int> memo(n+1);
rep(... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
class UnionFind
{
public:
UnionFind(int... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, a, b, c, d, ans = 0;
cin >> N;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> A, B;
for (int i = 0; i < N; i++)
{
cin >> a >> b;
A.push(make_pair(a, b));
}
for (int i = 0; i < N; i++)
{
cin >>... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
vector<bool> a(h*w,false);
queue<int> que;
for(int i = 0; i < h; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using ll = long long;
int main(){
int D, G, p[11], c[11];
cin >> D >> G;
for(int i = 0; i < D; ++i){
cin >> p[i] >> c[i];
}
int ans = 1e9;
rep(tmp, 1<<D){
in... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); ... | #include<iostream>
#include<map>
using namespace std;
int main(void){
int l[10];
int v1,v2;
char c;
while(cin >> l[0]){
int sum = 0;
int ans=0;
sum= l[0];
for(int i = 1;i < 10;i++){
cin >> c >> l[i];
sum+=l[i];
}
cin >> c >> v1... | 1 |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double x = (double)(x2 - x1) * (double)(x2 - x1);
double y = (double)(y2 - y1) * (double)(y2 - y1);
cout << fixed << setprecision(6) << (double)sqrt(x+y) << ... | #include <iostream>
#include <cmath>
using namespace std;
int main(void){
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << sqrt(pow(fabs(x1-x2),2)+pow(fabs(y1-y2),2)) << endl;
return 0;
}
| 1 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
while(true){
vector<vector<int>> m(21);
for(auto &mm : m){
mm.resize(21,0);
}
int N,M;
cin >> N;
if(N==0)break;
for(int i=0;i<N;i++){
int x,y;
cin >> x >> y;
m[x][y]=1;
}
cin>>M;
int x=10,y=10;
for(int i=0... | #include <stdio.h>
typedef struct _Gem{
int x;
int y;
bool hit;
} Gem;
static void
pick_gem(Gem* g, int n, int x, int y)
{
for (int i = 0; i < n; i++) {
if (!g[i].hit && g[i].x == x && g[i].y == y) {
g[i].hit = true;
return;
}
}
}
static bool
check_gem(Gem* g, int n)
{
for (int i = 0; i < n; i++) {
... | 1 |
#include <cstdio>
#include <algorithm>
using namespace std;
int n, ans, tot, to[1000005], u[1000005], v[1000005];
char S[1000005], T[1000005];
bool check(int x) {
for (int i = 1; i <= tot - x; ++i)
if (u[i + x] - x < v[i])
return false;
return true;
}
int main() {
scanf("%d", &n);
scanf("%s", S + 1);
... | #include<bits/stdc++.h>
constexpr auto MAXN = 1000000+500;
std::string s,t;
std::queue<int> que;
signed main(void)
{
int len,down,up; size_t ans = 0;
std::cin>>len>>s>>t;
if(s == t){ puts("0"); return 0; }
down = up = len-1;
while(down >= 0){
while(down && t[down-1]==t[down]) --down;
while(up... | 1 |
#include <cstdio>
#include <set>
int main()
{
int s, t; //number of integers for S and T
int count = 0; // number of integers of T in S
std::set<int> S; // set S to be checked against
scanf("%d", &s);
for (int i = 0; i < s; ++i) {
int input;
scanf("%d", &input);
S.insert(input);
}
sc... | #include <iostream>
#define ll long long
using namespace std;
int main () {
int q,p = 0,n; cin >> q; ll ans = 0;
while (q--){
cin >> n;
if (n<p) ans += p-n;
else p=n;
} cout << ans << "\n";
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define dup(x,y) (((x)+(y)-1)/(y))
using namespace std;
typedef long long ll;
typedef pair<int, int>... | #include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
using namespace std;
int main(){
int l[11],v1,v2,ans;
double x;
while(1){
int sum=0,y=0;
rep(i,0,10){
scanf("%d,",&l[i]);
sum+=l[i];
}
if(scanf("%d,%d",&v1,&v2)==EOF) break;
x=(double)sum*v1/(v1+v2);
rep(j,0,10){
y+=l[j];
if(y>... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vl vector<ll>
int main() {
ll D, G;
cin >> D >> G;
vl p(D), c(D);
rep(i, D) cin >> p[i] >> c[i];
int ans = 1e9;
rep(i, 1<<D) {
vl P = p;
int prob = 0... | #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;
ll dp[11][210000];
const int INF=1e9;
int main() {
ll d,g;
cin>>d>>g;
g/=100;
vector<int> P(d+1),C(d+1);
int x;
rep(i,d){
cin>>P[i+1]>>x;
C... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int cp;
int hako[3];
for(int i = 0; i < 3; i++)
cin >> hako[i];
for(int i = 1; i < 3; i++){
cp = hako[i];
hako[i] = hako[0];
hako[0] = cp;
}
for(int i = 0; i < 3; i++){
cout << hako[i] << " ";
}
cout << "\n";
return 0;
} | /*
@uthor: Amit Kumar
user -->GitHub: drviruses ; CodeChef: dr_virus_ ; Codeforces,AtCoder,Hackerearth,Hakerrank: dr_virus;
*/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//#def... | 1 |
#include<iostream>
#include<vector>
#include<cmath>
#include<string>
#include<map>
#include<list>
#include<cctype>
#include<utility>
#include<algorithm>
#include<cmath>
#include<cctype>
using namespace std;
///入力順はここで定義
enum FACE { TOP,BACK, RIGHT ,LEFT , FRONT, BOTTOM};
template <class T>
class dice {
public:
dice... | #include<cstdio>
int comparedice(void);
class dice{
private:
int a,b,c,d,e,f;
public:
void setnumber(void);
void E(void);
void W(void);
void S(void);
void N(void);
void R(void);
void V(void);
int frontside(int x,int y);
int putme(char me);
};
void dice::setnumber(void){
scanf("%d%d%d%d%d%d",&a,&b,&c,&d,&e,&... | 1 |
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#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) <... | #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) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
const ll ... | 1 |
#include <iostream>
using namespace std;
int n;
int M[100][100];
int prim(){
int d[100]; //最小コスト
int color[100];
int p[100];
for(int i=0;i<n;i++){
d[i] = (1 << 21);
color[i] = 0;
p[i] = -1;
}
d[0] = 0;
p[0] = 0;
int mincost;
int u;
int cost = 0;
while(true){
mincost = (1 << 21)... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a[5], k, ans = 0;
for(int i = 0; i < 5; i++)
cin >> a[i];
cin >> k;
for(int i = 0; i < 5; i++)
for(int j = 0; j < 5; j++)
if(a[i] < a[j] && a[j] - a[i] > k)
ans++;
if(ans)cout << ":(";
else... | 0 |
//Author: ReseeCher
#include<bits/stdc++.h>
#define LL long long
#define F(x,y,z) for(int x=y;x<=z;++x)
#define D(x,y,z) for(int x=y;x>=z;--x)
#define ckmax(a,b) (a)=max(a,b)
#define ckmin(a,b) (a)=min(a,b)
#define pb push_back
#define Ad(x,y) (x)=((x)+(y))%P
using namespace std;
const int N=305;
const int P=998244353;... | #include <bits/stdc++.h>
using namespace std;
double dp[301][301][301];
int n;
double sushi(int o,int z, int t){
if(z<0||o<0||t<0)
return 0.0;
if(z==0&&o==0&&t==0)
return 0.0;
if(dp[o][z][t]>=0.0)
return (double) dp[o][z][t];
dp[o][z][t]= o*sushi(o-1,z,t)+z*sushi(o+1,z-1,t)+t*sushi(o,z+1,t-1)+n;
dp[o][z][t]/=(o... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n, q, a, b, l, val[800007][3], tag[800007];
int read()
{
int num = 0;
char c = getchar();
while (c<'0' || c>'9')c = getchar();
while (c >= '0' && c <= '9')num = num * 10 + c - '0', c = getchar();
return num;
}
int add(int w, int v)
{
for (int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 400;
int h, w;
string s;
int grid[MX][MX];
ll black[MX*MX], white[MX*MX];
bool used[MX][MX];
ll ans;
int curGroup = -1;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
void dfs(int x, int y) {
used[x][y] = true;
if (grid[... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
ll dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
ll counterb=0,counterw=0;
void dfs(ll x,ll y,ll H, ll W,vector<vector<bool>> &field,vector<vector<bool>> &check){
check[x][y]=1;
if(field[x][y]==1){counterb++;}
if(field[x][y]=... | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
unsigned long long int i, fin, num[3];
int n;
int main(){
cin >> n;
for(i=0;i<n;i++){
cin >> num[i];
}
if(n==2){
fin = min(num[0], num[1]);
for(i=1;i<=fin;i++){
if(!(num[0]%i) && !(num[1]%i)){
cout << i << endl;
}
}
}
if(n==3){
... | #include <iostream>
using namespace std;
int main()
{
int n;
int i;
int temp;
cin >> n;
int* p = new int[n];
for (i = n - 1; i >= 0; i--) {
cin >> p[i];
}
for (i = 0; i < n; i++) {
if (i < n - 1) {
cout << p[i] << " ";
} else {
cout << p[i] << endl;
}
}
delete [] p;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
struct node{
long long x,p;
}a[100010];
bool cmp(node a,node b){
return a.x<b.x;
}
long long n,s,ans;
int main(){
scanf("%lld%lld",&n,&s);
for (int i=1;i<=n;i++)
scanf("%lld%lld",&a[i].x,&a[i].p);
sort(a+1,a+n+1,cmp);
long long l=n,l1=1;
while (l>=l1){
if (a... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define pi std::pair<int, int>
#define mkp std::make_pair
#define ll long long
#define pb push_back
#define fi first
#define se second
//{{{IO
namespace IO{
template <class I> void read(I &x){
x = 0; char ch = getchar(); bool f = false;
for(... | 1 |
#include "bits/stdc++.h"
using namespace std;typedef long long lint;typedef vector<lint> liv;
//#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(),v.end()
#define linf 1152921504606846976
#define MAXN 100010
#define md 1000000007//998244353
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#de... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define int long long
#define all(X) (X).begin(), (X).end()
#define reset(X) memset(X, 0, sizeof(X))
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define endl '\n'
#define fi first
#define se second
using n... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int h, w;
cin >> h >> w;
char s[h][w];
rep(i, h) rep(j, w) cin >> s[i][j];
rep(i, h) rep(j, w) {
if (s[i][j] == '.') continue;
bool ok = false;
for... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define r... | 0 |
#include<bits/stdc++.h>
//ios::sync_with_stdio(false);
//cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dlb;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
typedef pair<ll, pair<ll,ll> > iii;
const int kn = 2e5 + 5;
const ll mod = 1e9 + 7;
#define x first
#define y second
#define _it iterator
#define pb push_back
#define pf push_f... | 0 |
#include <bits/stdc++.h>
#define FOR(I,X,Y) for(long int I=X;I<Y;I++)
#define REP(I,X) for(long int I=X;I>=0;I--)
#define INF 1e9+7
using namespace std;
int main(){
int a,b,c;
vector<int> ans;
while(1){
cin >> a >> b >> c;
if(!(a|| b || c))break;
int N,i,j,k,l;
cin >> N;
set<int> unbroken;
... | #include <bits/stdc++.h>
using namespace std;
const int maxn=112345;
int n,x[maxn],l,q,f[maxn][20];
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;++i) scanf("%d",&x[i]);
scanf("%d%d",&l,&q);
for (int i=1;i<n;++i) {
int t=upper_bound(x+1,x+1+n,x[i]+l)-x-1;
f[i][0]=t;
}
f[n][0]=f[... | 0 |
// #include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <tuple>
#include <map>
#include <math.h>
#include <algorithm> // std::sort, std::min, std::next_permutation, std::lower_bound
#include <iomanip> // std::setprecision
#include <cmath> // std::ceil
#include <nu... | #include <bits/stdc++.h>
#define err(args...) {}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; ... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
long long int n=0;
cin >> n;
long long int ans=0;
int i=0;
int amari=0;
vector<int>dog;
while(n>0){
if(n%26 == 0){
amari=n%26;
dog.push_back(amari);
n/=26;
n--;
continue;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
int main()
{
string s;
cin >> s;
ll n = s.length();
//2文字条件
for (int i = 0; i < n ... | 0 |
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main()
{
double x1,x2,y1,y2,x,y,z;
cin>>x1>>y1>>x2>>y2;
x=x2-x1;
y=y2-y1;
x *=x;
y *=y;
z=sqrt(x+y);
printf("%lf\n",z);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | 0 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
int main (int argc, char *argv[]) {
vector<int> v1(4), v2(2);
for (int i = 0; i < 4; ++i) {
cin >> v1[i];
}
for (int i = 0; i < 2... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
typedef pair<ll,ll> ipair;
#define F first
#define S second
/*
//functions from gfg
long long int power(long long int x,long long int y,long long int p)
{
long long int res = 1; // Initialize ... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
// #define INF __INT32_MAX__
#define INF 1e9
#define LINF __LONG_LONG_M... | #include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
int n,m;
int g[500][500];
int main(){
while(scanf("%d%d",&n,&m),n){
for(int i=0;i<n;i++)
for(int j=0;j<n;j++) g[i][j]=100000;
for(int i=0;i<m;i++){
int a,b;
scanf("%d%d",&a,&b);
g[a... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.