code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <climits>
using namespace std;
#define MOD int(1e9 + 7)
#define INF (long long)(1e18)
int main()
{
long... | //#include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <tuple>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <bitse... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define forg(i,x) for(int i=first[x];i;i=nxt[i])
#define uu unsigned
#define fi first
#define se second
#define lam(z,k) [&](const z &a,const z &b){ return k; }
#define od(x) ((x)&1)
#define ev(x) (od(x)^1)
#define mi2(x) (1<<(x))
#define scanf a12... | #include <cstdio>
#include <algorithm>
#include <cctype>
using namespace std;
inline int read(int f = 1, int x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();
return f*x;
}
const int N = 2e3+5, M = 4e6+5, P = 1e9+7;
int n, m, f[... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define X ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(2)<<(x)
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void ... | #include <bits/stdc++.h>
int N;
using namespace std;
int main() {
cin >> N;
vector<queue<int>> q(N);
for(int i = 0; i < N; ++i) {
for(int j = 0; j < N-1; ++j) {
int value;
cin >> value;
q.at(i).push(value-1);
}
}
// 優先度が高い順にpushしてある
// 1から順に試... | 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
int main(void) {
Int n, q;
cin >> n >> ... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> P;
typedef priority_queue<P,vector<P>,greater<P>> P_queue;
#define REP(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#def... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int M = int(1e9 + 7);
signed main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) cin >> A[i];
vector<int> pre(N + 1); {
for (int i = 0; i < N; ++i) {
pre[i + 1] = pre[i] ^ A[i];
}
if (... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=5e5+5;
const int M=(1<<20)+5;
const int p=1e9+7;
int read()
{
int s=0;
char c=getchar(),lc='+';
while (c<'0'||'9'<c) lc=c,c=getchar();
while ('0'<=c&&c<='9') s=s*10+c-'0',c=getchar();
return lc=='-'?-s:s;
}
void write(int x)
{
if (x<0... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long sum1 = 0;
long long numbers[200000];
int N;
cin >> N;
for(int i = 0; i < N; ++i){
cin >> numbers[i];
}
for(int i = 0; i < N-1; ++i){
if(numbers[i+1] < numbers[i]){
sum1+=numbers[i] - numbers[i+1];
numbers[i+1] = numbers[i+1] + (number... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <algorithm>
#include <time.h>
#include <chrono>
#include <random>
//#include <math.h>
#include <cmath>
#include <fstream>
#include <deque>
#include <unordered_map>
#include <un... | 1 |
#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>
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<b) { a=b; return 1; }... | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, t;
cin >> k >> t;
int a[t];
for (int i = 0; i < t; ++i) {
cin >> a[i];
}
sort(a, a + t);
cout << max(0, a[t - 1] - k + a[t - 1] - 1) << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define Opy ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
int main()
{
//Opy;
/*-------------------------------------------------
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", ... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define REV(i,a,n) for(int i=a;i>=n;i--)
#define all(a) a.begin(),a.end()
const int NUM = 2e5 + 5;
int32_t main()... | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include<iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << ((a-c)*(b-c)<0?"Yes":"No") << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
double solve(vector<vector<vector<double>>>& dp, int a, int b, int c, double N){
if(dp[a][b][c] != 0){
return dp[a][b][c];
}
if(a==0 && b==0 && c==0) return 0;
double f = 0;
f += 1 / (1 - (N-a-b-c)/N );
if(a>0) f += solve(dp,a-1,b,c, N) * (a/N) /(1 - (N-a-b-c)/N... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define uu unsigned
#define io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define MOD 1000000007
#define pl pair<ll,ll>
#define mkp make_pair
#define ss second
#define ff first
#define mit(a,b) map<a,b>::iterator
#define sit(a) set<a>::iterator
#defi... | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <utility>
#include <vector>
#include <cmath>
using namespace std;
#define INF 10000001
int main()
{
int a, n;
int maxi, mini;
int i;
long long sum = 0ll;
mini = INF;
maxi = -10000001;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d"... | #include <iostream>
using namespace std;
int main(){
int min,max,n,i;
int *data;
long sum;
cin>>n;
data= new int[n];
for (i=0;i<n;i++)cin>>data[i];
min=data[0];max=data[0];sum=data[0];
for (i=1;i<n;i++){
sum+=data[i];
if (min>data[i])min=data[i];
else if (max<data[i])m... | 1 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <queue>
#include <math.h>
#include <assert.h>
#include <set>
#include <map>
#include <bitset>
#include <ctime>
#include <time.h>
#include <algorithm>
#include <cstdio>
#include <fstre... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
map<ll,ll>ch;
for(ll i=0;i<n;i++){
ll x;
cin>>x;
ch[x]++;
if(ch[x]==2){
cout << "NO";
return 0;
}
}
cout << "YES";
// your code goes here
return 0;
} | 1 |
#include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,h,w;
cin >> n >> h >> w;
int a = 0;
int b = 0;
for(int i = 1; i <= n; i++){
if(i+w-1 <= n) a++;
if(i+h-1 <= n) b++;
}
cout << a*b << endl;
return 0;
} | 1 |
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
int w[10], k[10];
for(int i=0; i<2; i++){
for(int j=0; j<10; j++){
if(i == 0) cin >> w[j];
else cin >> k[j];
}
}
sort(w, w+10, greater<int>());
sort(k, k+10, greater<int>());
cout << w[0] + w[1] + w[2] <... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <stack>
#include <string>
#include <vector>
#incl... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1LL << 62;
const double PI = acos(-1);
const double eps = 1e-10;
int main() {
int h, w;
cin >> h >> w;
vector<vector<int>> a(h, vector<int>(w)), ans;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
ll pl(ll a, ll b) {
a %= mod, b %= mod;
return (a+b) % mod;
}
ll mu(ll a, ll b) {
a %= mod, b %= mod;
return (a*b) % mod;
}
ll pow_mod(ll a, ll b) {
if (b == 0) return 1;
a %= mod;
ll k = pow_mod(a, b/2)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
c... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;
int main()
{
string s;
int q;
cin >> s >> q;
cin.ignore();
string buf;
while (q)
{
getline(cin, buf);
//cout << "DEBUG:" << buf << endl;
if (buf.find("replace ")... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a... | 0 |
#include <cstdio>
#include <iostream>
#include <string>
#define INF (1<<21)
using namespace std;
int main(){
int i,j,n,k,c,a,b,G[101][101],d[101],f[101],yen,p,min,s,g;
while(1){
cin >> n >> k;
if(n == 0 && k == 0) break;
for(i=0;i<=n;i++){
for(j=0;j<=n;j++){
G[i][j] = INF;
}
}
fo... | #include<stdio.h>
#include<algorithm>
using namespace std;
int main(void)
{
int n,m,a[10000],b[10000],flg[10001],i,h;
while(1){
scanf("%d %d",&n,&m);
if(n==0&&m==0) break;
for(i=2;i<=n;i++) flg[i]=0;
for(i=0;i<m;i++){
scanf("%d %d",&a[i],&b[i]);
}
for(i=0;i<m;i++){
if(a[i]==1){
fl... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define rep(i,n) REP(i, 0, n)
int main(){
for(int n; cin >> n && n; ){
int ans = INF;
for(int z = 0; z * z * z <= n; z++)
for(int y = 0;... | #include <iostream>
using namespace std;
int main(){
int x;
cin >> x;
int pleasure = 0;
int f = x / 500;
x -= f * 500;
pleasure += 1000 * f;
f = x / 5;
x -= f * 5;
pleasure += 5 * f;
cout << pleasure << endl;
} | 0 |
#include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a... | #include<cstdio>
const int N=1e5+5;
int n,i,a[N],ans;
int read(){
char c=getchar();int k=0;for (;c<48||c>57;c=getchar());
for (;c>47&&c<58;c=getchar()) k=(k<<3)+(k<<1)+c-48;return k;
}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main(){
for (n=read(),i=1;i<=n;i++) a[i]=read();
if (n==1){puts("Second");return 0... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, T;
cin >> N >> X >> T;
cout << (((N-1)/X +1) * T ) << endl;
}
| #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int mod=1e9+7;
const int N = 2e5+5;
vector<ll>ans,veca,vecb;
vector<int>adj[N];
vector<double>aka;
vector<pair<int,double>>dp[N];
vector<bool>vis;
void init(int n){
ans.clear();veca.clear();aka.clear();vis.clear();
vecb.clear(),vecb.resi... | 1 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--) // [a, b)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) {... | #include <stdio.h>
int main(){
long long N, sum;
scanf("%lld", &N);
sum = N*(N+1)/2;
long long Un3 = N/3;
long long Sn3 = 3*(Un3*(Un3+1)/2);
long long Un5 = N/5;
long long Sn5 = 5*(Un5*(Un5+1)/2);
long long Un15 = N/15;
long long Sn15 = 15*(Un15*(Un15+1)/2);
printf("%lld", sum-Sn3-Sn5+Sn15);
retur... | 0 |
#include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
class Dice
{
public:
int label[6], tmp;
void in()
{
rep(i, 6) scanf("%d", &label[i]);
}
void rollS()
{
tmp = label[0];
... | #include<iostream>
using namespace std;
struct Directions
{
int E[6] = { 2, 1, 5, 0, 4, 3 };
int W[6] = { 3, 1, 0, 5, 4, 2 };
int N[6] = { 4, 0, 2, 3, 5, 1 };
int S[6] = { 1, 5, 2, 3, 0, 4 };
int Rotate[6] = { 0, 2, 4, 1, 3, 5 };
};
class Dice
{
public:
int num[6];
void swap(int*);
Directions dir_array;
Dice... | 1 |
#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<int> a(h*w);
for(int i = 0; i < h; i++) {
for(int j = 0; j <... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int H, W;
bool fid[510][510];
bool mem[510][510];
int cnt;
signed main()
{
cin >> H >> W;
rep(i, H)rep(j, W)
{
int a;
cin >> a;
fid[i][j] = a & 1;
mem[i][j] = a & 1;
... | 1 |
#include<iostream>
#include<cstdio>
#include<stack>
#include<algorithm>
using namespace std;
bool barrier[2000][2000];
long long hist_barrier[2000][2001];
char S[2000][2001];
int main(){
int H, W;
cin >> H >> W;
for(int i = 0; i < H; i++){
cin >> S[i];
}
for(int h = 0; h < H - 1; h++){
... | #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
while(true){
int n,m,p[1001];
vector<int> a;
scanf("%d %d",&n,&m);
if(n==0&&m==0) return 0;
p[0] = 0;
for(int i=0;i<n;i++) scanf("%d",p+i+1);
n++;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | 1 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <iostream>
using namespace std;
void ask(int left, int right, bool male) {
int mid = (left + right) / 2;
cout << mid << endl;
string s;
cin >> s;
if (s == "Vacant") return;
if (((mid - left) % 2 == 0) == (male == (s == "Male"))) ask(left, mid - 1, male);
else ask(mid + 1, right, s == "Male");
}
int ma... | 1 |
#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... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
int main()
{
///"In the name of Allah,most gracious and most merciful"///
ll i,j,x,y,z,count=0,sum=0,n;
cin>>n;
... | 0 |
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main (void){
int a, b;
int i, j, k;
cin >> a >> b;
i = a + b;
j = a - b;
k = a * b;
if(i < j){
if(j < k){
cout << k << endl;
}else{
cout << j << endl;
}
}else if(j <... | #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... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#defi... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE>
void print_vec(const vector<TYPE>& v){
for(int i=0; i<v.size(); i++){
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
cout << endl; cout << " ";
f... | 1 |
#include <bits/stdc++.h>
#define rep(i , n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main (){
ll N, L[2]{};
cin >> N;
set <int> S;
while (cin >> N) {
if (!S.insert(N).second) {
S.erase(N);
if (N > L[0]){
L[1] = L[0],... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<P>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template ... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | #include <stdio.h>
#include <string.h>
int main(){
char str1[25];
char str2[25];
char str3[25];
scanf("%s %s %s", str1, str2, str3);
if (str1[strlen(str1)-1] == str2[0]){
if (str2[strlen(str2)-1] == str3[0]){
printf("YES\n");
}
else
{
printf("NO... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define Task "abc"
#define For(i, a, b) for(int i = (a), _b = (b); i <= b; ++i)
#define All(x) (x).begin(), (x).end()
#define mp make_pair
typedef long long ll;
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
int... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> P;
typedef unsigned long long i... | 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 <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
int n = sqrt(N);
cout << n * n << endl;
} | 0 |
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main()
{
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
int n, m;
cin >> n >> m;
int a[n];
int b[m];
for(int i = 0;i < n;i++)
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, x;
cin >> n >> x;
vector<int> an(n);
for(int i=0; i<n; ++i) cin >> an[i];
ll ans = 0;
for(int i=0; i<n-1; ++i){
int ca = max(0, an[i] +an[i+1] -x);
ans += ca;
an[i+1] = max(0, an[i+1] -ca);
}
cout << ans ... | 0 |
#include<bits/stdc++.h>
using namespace std;
long long s,ans;
int n,a[200003];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+1+n);
for(int i=2;i<=n;i++)
{
s=(s+a[i-1])%1000000007;
ans=(ans+s*a[i])%1000000007;
}
cout<<ans<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
long long sum[200005];
int main()
{
long long mod=1000000007;
long long n;cin>>n;long long a[n];long long sum=0;
for(long long i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
sum=sum%mod;
}
long long pum=sum;long long rum=0;
for(lon... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
int main() {
long long N, M; std::cin >> N >> M;
std::map<long long, long long> C;
std::vector<long long> D(N + 1);
long long wa = 0;
long long ac = 0;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
... | 1 |
#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 repr(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 ld long double
using ll = long long;
... | #ifndef _TEMPLATE_ROOT
#define _TEMPLATE_ROOT
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define repl(i, a, b) for(ll i = a; i < (b); ++i)
#define repd(i, a, b) for(int i = a; i >= (b); --i)
#define repdl(i, a, b) for(ll i = a; i >= (b); --i)
#define all(x) begin(x),... | 0 |
#include <queue>
#include <vector>
#include <iostream>
using namespace std;
// ------ Class ------ //
class Graph2 {
public:
// ------ Variables ------ //
static const long long INF = 1000000000000000000;
int V, E; vector<vector<pair<int, long long> > > G;
// ------ Constructors ------ //
Graph2() : V(0), E(0), ... | #include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define N 100
void searchIndex(int mat[][N], int n, int obj, int *row, int *col);
void changeGroup(int group[], int n, int g_old, int g_new);
int main(void)
{
int n;
cin >> n;
int group[N];
for (int i = 0; i < n; i++) group[i] = i;... | 1 |
//#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
int main(){
long long int n;
cin >> n;
//全ての合計
long long int sum = 0;
for(int i = 1; i <= n; i++) sum += i;
//３で... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
cout<<(1+n)*n/2-(3+n-n%3)*(n-n%3)/3/2-(5+n-n%5)*(n-n%5)/5/2+(15+n-n%15)*(n-n%15)/15/2<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int ma... | //#pragma GCC optimize(2)
#include<cstdio>
#define L 1<<23
#define C (c=*A++)
#define ENS //__attribute__((optimize("-O2")))
#define NES //__attribute__((optimize("-O2"))) __inline__ __attribute__((always_inline))
#define N 1000001
int MAPLE,n,l[N],r[N],cnt,last,wt,ss[19];char fl[L],*A=fl,s[N],t[N];bool fg=true;
NES v... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N,K,cnt,sum,minsum,minsumtemp;
cin >> N >> K;
vector<int> x(N);
vector<int> diff(N-1);
for(int i=0;i<N;i++) {
cin >> x[i];
if(i) diff[i-1] = x[i]-x[i-1];
}
cnt = 0;
sum = 0;
minsum = INT_MAX;
fo... | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 998244353 //1000000007 // 100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
using namespace std;
typedef long long ll;
int main()
{
int n;
while(cin >> n && n) {
int ans = INF;
... | #include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vect... | 0 |
#include <iostream>
#include <cstring>
#include <sstream>
#include <vector>
using namespace std;
int main()
{
string s, tmp, str, commands;
stringstream ss;
vector<string> dice;
getline(cin, s);
ss << s;
while(getline(ss, str, ' ')) {
dice.push_back(st... | #include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
string ss;
cin >> ss;
int s[10];
for (int i = 0; i < ss.size(); ++i) {
s[i] = ss[i] - (char)'0';
}
int diff = 1000;
for (int i = 0; i < ss.size() - 2; ++i) {
int n = s[i] * 100 + s[i + 1] * 10 + s... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
#define int long long
typedef pair<int,int>pii;
typedef vector<int> vi;
typedef vector<vi> vii;
const int mxN=16,M=1e9+7;
//did u check when n=1?
//is mxN correct?
int n;
int g[mxN][mxN];
int dp[(1<<16)],... | /*
author: parv2809
*/
#include<bits/stdc++.h>
#define int long long int
#define mod 1000000007
#define inf 1e18
#define fo(i,y,n,inc) for(int i=y;i<n+y;i+=inc)
#define cin(t) int t;cin>>t
#define w(t) while(t--)
#define nl cout<<endl;
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define ft(i) ... | 1 |
#include <bits/stdc++.h>
using namespace std;
// ----------- define --------------
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
// -----------... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define MOD 1000000007ULL;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
string S;
cin>>S;
bool alpha[26];
string ans;
rep(... | 1 |
#include<iostream>
using namespace std;
struct Test{
int A[3];
bool R;
};
Test tests[1000];
int info[301], M[3], N;
int main()
{
while(true)
{
for(int i = 0; i <= 300; i++)
info[i] = 2;
cin >> M[0] >> M[1] >> M[2];
if(!(M[0] || M[1] || M[2]))
break;
cin >> N;
for(int i = 1... | #include <stdio.h>
int main()
{
int month, day, n;
int md[12] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30};
while (1) {
scanf("%d %d", &month, &day);
if (month == 0) break;
n = 0;
for (int i = 0; i < month; i++) {
n += md[i];
}
n += day;
switch (n%7) {
case 0: printf("Wednesday\n"); br... | 0 |
#include <stdio.h>
#include <string.h>
int main() {
int a, b;
scanf("%d %d",&a,&b);
char str[a+b+1];
scanf("%s",&str);
int len = strlen(str);
int flag = 0;
for (int i = 0; i < len; i++)
{
if (48 <= str[i] && str[i] <= 57)
{
continue;
}
else
{
if (i == a)
{
flag = 1;
}
else
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string h;
cin >> h;
if(h == "hi" || h == "hihi" || h == "hihihi" || h == "hihihihi" || h == "hihihihihi"){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 50005;
const int MOD = 1000000007;
int n, x, y, z, cnt;
int p[10][MAXN], fin[10][MAXN], t[MAXN];
int dp[2][45][MAXN];
map <string, int> mp;
string r[MAXN];
vector <string> f (int x) {
vector <string> res;
if (x == 0) {
res.push_back("");
... | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9+7;
int main() {
// U: 3^N fits, which hints towards a fancy subset DP
// i.e. the one that is magically 3^n when it looks like
// it should be 2^2n
cin.tie(0);
cin.sync_with_stdio(0);
int n; cin >> n;
long long a[n][n];
for(int i = 0;... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int N, K; cin >> N >> K;
int arr[N];
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
sort(arr, arr + N, greater<int>());
for (int i = 0; i < K; i++) {
ans += arr[i];
}
cout << ans <<... | #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++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, l, m=101;
cin >> n >> l;
for(int i=... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(void){
int n;
int a, b, c;
int mn;
cin >> n;
if (n == 2){
cin >> a >> b;
mn = min(a, b);
}
else{
cin >> a >> b >> c;
mn = min(a, min(b, c));
}
for (int i = 1; i <= mn; i++){
if (n == 2){
if (a%i == 0 && b%i == 0) cout << i ... | #include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0)
//#define MULTI_TEST
//#define GOOGLE
#ifdef LOCAL
#include "debugger.h"
#else
#define db(...)
#endif
#define ll long long
#define v32 vector<int>
#define v64 vector<ll>
#define s32 set<i... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int d, t, s, minute;
cin >> d >> t >> s;
if (d % s) {
minute = d / s + 1;
}
else {
minute = d / s;
}
if (minute <= t)
std::cout << "Yes\n";
else
std::cout << "No\n";
return 0;
} | #include<bits/stdc++.h>
#define lint long long
#define st first
#define nd second
#define INF 0x3f3f3f3f
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int k; cin>>k;
string s; cin>>s;
for(int i=0; i<min(k, (int)s.size());i++) cout<<s[i];
if((int)s.size() > ... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,b) for (int (i)=a;(... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int size=1e5;
const int inf=1e9;
int main(){
int H,W;cin>>H>>W;
int A[H][W] = {};... | 1 |
#include <cstdio>
int main()
{
int a,b,c,d;
scanf("%d %d %d %d", &a, &b, &c, &d);
if (a + b > c + d)
{
printf("Left");
}
else if (a + b < c + d)
{
printf("Right");
}
else if (a + b == c + d)
{
printf("Balanced");
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int d,t,s;
cin>>d>>t>>s;
float time = (d/(s*1.0));
if(time<=t)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | 0 |
#include "bits/stdc++.h"
using namespace std;
//template <typename... T> void read(T& ... t){ ((cin >> t), ...); }
//template <typename... T> void write(T ... t){ ((cout << t), ...); }
//#define int long long
#define FAST ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define size(x) (int)x.size()
#define all(x) x.begi... | #include <bits/stdc++.h>
using namespace std;
#define VIC ios::sync_with_stdio(0);cin.tie(0);ios_base::sync_with_stdio(0);
#define wtf(s) freopen((s), "w", stdout)
#define rff(s) freopen((s), "r", stdin)
#define pi (2 * acos(0))
typedef long double ld;
typedef long long ll;
#define endl '\n'
#define matrix vector<vect... | 1 |
#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>
#define MOD (long long)(1e9+7)
using namespace std;
int n,y;
int main()
{
cin >> n >> y;
int ok=0;
if(y%1000)
{
cout << -1 << ' ' << -1 << ' ' << -1;
return 0;
}
else y/=1000;
for(int i=0; !ok&&i<=y/10; i++)
for(int j=0; j<=y/5; j++)
if((y-i*10-j*5)>=0 && (y-i*10-j*5)+i+j == n)
... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
struct Graph{
Graph(int n):E(n),d(n){}
vector<vector<tuple<int,int,int>>>E;
vector<int>d;
void add_edge(int a,int b,int c,int d){
E[a].push_back(make_tuple(b,c,d));
}
void dijkstra(int s,int f){
priority_queue<P,vector<P>,greater<... | #include<iostream>
#include<string.h>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i,n) for(i=1;i<=n;i++)
using namespace std;
typedef pa... | 1 |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 998244353;/... | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int N;
cin >> N;
int c[N], flg=0;
for (int i = 0; i < N; i++){
c[i] = 0;
}
for (int i = 0; i < N; i++){
int tmp;
cin >> tmp;
if (i==0 && tmp==0){
flg = 1;
}
c[tmp] += 1;
}
if (c[0]==1 && flg ==... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 10010;
const string MININF = "-INF";
int match[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
string dp[MAXN]; // i本のマッチ棒を使ったときの最大数
void chmax(string &a, string b)
{
if (a == MININF)
{
a = b;
}
else if (a.size() < b.size())
{
a = b;
}
else if ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll dp... | 1 |
#include<bits/stdc++.h>
#include<sstream>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
void call(int n){
for(int i=1;i<=n;i++){
stringstream ss;
ss<<i;
char c[8];
ss>>c;
if(i%3==0||strstr(c,"3"))
cout<<" "<<i;
}
co... | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
void call(int n) {
int i = 1;
do {
int x = i;
bool END_CHECK_NUM = false;
if (x % 3 == 0) {
cout << " " << i;
END_CH... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define pi 3.14159265358979323
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {
return(gcd(b, a % b));
}
}
int main()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 1 |
#include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1e3+10;
const LL MOD=1e9+7;
int n,m,px[N*N],py[N*N];
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++) {
int x; scanf("%d",&x);
if (px[x]) { puts("0"); return 0; }
px[x]=1;
}
for (int j=1;j<=m;j++) {
int y; scanf("%d",&y)... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define N 100
#define INF 1000000
int main(){
int n, tmp, p[N + 1], dp[N + 1][N + 1];
cin >> n;
for(int i = 1 ; i <= n ; i++){
cin >> p[i-1] >> p[i];
}
for(int i = 1 ; i <= n ; i++){
dp[i][i] = 0;
}
for(int l = 2 ; l <= n ; l++){ //l = ????????????????... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; //10^18
const int inINF = 1000000000; //10^9
const ll MOD = 1000000007; //10^9+7
const ll MOD2 = 998244353... | 0 |
#include <stdio.h>
void dividing(int pm, int pe, int pj);
int main(void)
{
int students_number;
int pm[10000], pe[10000], pj[10000];
scanf("%d", &students_number);
while (1) {
if (students_number == 0) {
break;
} else {
for (int i = 0; i < students_number; ++i) ... | #include <stdio.h>
int main(void){
int n;
int pm, pe, pj;
double avr;
while (scanf("%d", &n), n){
for (int i=0; i<n; i++){
scanf("%d %d %d", &pm, &pe, &pj);
avr = (pm+pe+pj)/3.;
if (pm==100 || pe==100 || pj==100){
puts("A");
} else if (pm+pe >= 180){
puts("A");
} else if (avr>=80){
p... | 1 |
#include <stdio.h>
void merge(int *,int,int,int);
void mergesort(int*,int,int);
long long cnt=0;
int L[100002],R[100002];
int main(){
int A[200000],i,n;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&A[i]);
mergesort(A,0,n);
printf("%ld\n",cnt);
return 0;
}
void merge(int *a,int left,int mid,int right){
int ... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits... | 1 |
#include <bits/stdc++.h>
#define ll long long
#include<vector>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int mod=1e9+7;
int main(){
IOS;
int n,dr;
cin>>n>>dr;
if(n>=10)
cout<<dr;
else
cout<<dr+100*(10-n);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cout << "[" << #var << "] " ... | 0 |
//j
#include <stdio.h>
int main ()
{
int step= 0;
int a, b, c;
scanf ("%d %d %d", &a, &b, &c);
if (a<b)
{
for (int i=1; i <= a; i++)
{
if (b*i >= c)
{
printf ("%d", i);
return 0;
}
}
}
if (b<a)
{
for (int j=1; j <= b; j++)
{
if (a*j >= c)
{
printf ("%d", j);
return 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typenam... | 1 |
// This amazing code is by Eric Sunli Chen.
#include<bits/stdc++.h>
using namespace std;
template<typename T> bool get_int(T &x)
{
char t=getchar();
bool neg=false;
x=0;
for(; (t>'9'||t<'0')&&t!='-'&&t!=EOF; t=getchar());
if(t=='-')neg=true,t=getchar();if(t==EOF)return false;
for(; t<='9'&&t>='0'; t=getchar())x=x... | #include <bits/stdc++.h>
#define ll long long
#define N 1000100
ll n,s,ans,x[N],p[N];
using namespace std;
int main(){
scanf("%lld%lld",&n,&s);
for (ll i=1;i<=n;i++) scanf("%lld%lld",&x[i],&p[i]);
for (ll l=1,r=n;l<=r;){
if (x[l]>=s){ans+=x[r]-s; break;}//所有人都在一边直接开过去
if (x[r]<=s){ans+=s-x[l... | 1 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<" ";
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}... | 1 |
#include <stdio.h>
int main(void)
{
int a[1010];
int b[1010];
int t[1010];
int ans[1010];
int i=0;
int j=0;
int n=0;
a[0] = 1;
for(;;)
{
scanf("%d",&t[j]);
if(t[j]==0)
{
break;
}
j++;
}
a[1]=1;
a[2]=2;
a[3]=4;
for(i=4;i<1010;i++)
{
a[i]=a[i-1]+a[i-2]+a[i-3];
a... | #include <bits/stdc++.h>
#define DICE_SIZE 6
using namespace std;
class Dice {
private:
int number[DICE_SIZE];
int work_space[DICE_SIZE];
void reset_number(int, int, int, int, int, int);
public:
Dice(int *);
void turn(char);
int peek_top();
};
Dice::Dice(int *number) {
for (int i = 0; i < DICE_SIZ... | 0 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
#define ll long long
#define inf 999999999
#define pa pair<int,int>
using namespace std;
int n,a[200][200]={0};
void prim(){
int d[200]={0};
priority_queue<pair<int,pa> > PQ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int P[10010];
void init(int N);
int root(int a);
bool is_same_set(int a,int b);
void unite(int a,int b);
struct Node {
int cost,start,goal;
bool operator<( const Node& right ) const {
return cost == right.cost ? start < right.star... | 1 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_bac... | #include <bits/stdc++.h>
using namespace std;
int main() {
string A, B, S;
cin >> A >> B >> S;
cout << ((regex_match(S, regex("\\d{" + A + "}-\\d{" + B + "}"))) ? "Yes" : "No") << "\n";
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll l, r; cin >> l >> r;
if(r - l >= 2019)
{
cout << '0' << endl;
return 0;
}
ll ans = 2020;
for(ll i = l; i <= r; i++)for(ll j = i+1; j <= r; j++){
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long lon... | 1 |
#include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
const int mod=10007;
in... | 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 n, k;
cin >> n >> k;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end(), greater<int>());
int ans = 0;
rep(i, k) ans += l[i];
cout <... | #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;
ll gcd(ll a, ll b){
ll r,temp;
if (a < b){
temp = a;
a = b;
b = temp;
}
wh... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5+5,inf=1e10;
ll n,ans;
pair<ll,ll> prfx[N],sfx[N],a[N];
inline pair<ll,ll> inter(pair<ll,ll> u,pair<ll,ll> v){
pair<ll,ll> range = make_pair( max(v.first,u.first) , min(v.second,u.second) );
range.second = max(range.first,range.se... | //#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios_base::sync_with_stdio(false); cin.tie(0);
#define trav(x,a) for (auto& x: a)
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define mem(a,v) memset((a)... | 1 |
using namespace std;
#include <bits/stdc++.h>
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a<=b){
if(d<=c){
std::cout << a+d << std::endl;
}
else {
std::cout << a+c << std::endl;
}
}
else{
if(c<=d){
std::cout << b+c << std... | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<int>A,B;
for(int i=0;i<2;i++){
int a;
cin >> a;
A.push_back(a);
}
for(int i=0;i<2;i++){
int b;
cin >> b;
B.push_back(b);
}
sort(A.begin(),A.end());
sort(B.begin(),B.end());
co... | 1 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reg(i,a,b) for(int i=(a);i<=(b);i++)
typedef long long int lli;
typedef pair<int,int> mp;
typedef pair<int,mp> mmp;
#define fir first
#define sec s... | //*********************************************************************************************************************************
//* **
//* SSSSSSSSSSSS MMMM MMMM HHHH HHHH DDDDDDDDDDDD **
//* SSSSSSSSSSSS CSAA Numbered MMMMM MMMMM HHHH HHHH DDDDDDDDDDDDD **... | 1 |
#include<iostream>
using namespace std;
int main (void)
{
int r;
cin>>r;
r=r*2*3141592;
cout<<r/1000000<<"."<<r%1000000;
} | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (int i ... | 1 |
#include<stdio.h>
#include<limits.h>
#define NIL -1
static const int MAX = 500;
static const int INFTY = (1<<21);
int n, i, j, e, v, sum, u , minV;
main(){
int M[MAX][MAX], key[MAX], L[MAX],A[MAX];
scanf("%d", &n);
for ( i = 0; i< n; i++ ){
for ( j = 0; j < n; j++ ){
scanf("%d", &e);
M[i][... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | 0 |
#include <stdio.h>
int main (){
char all[20];
scanf("%s", all);
all[0] = '2';
all[1] = '0';
all[2] = '1';
all[3] = '8';
printf("%s", all);
return 0;
} | #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),... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).be... | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i,N) for(int i = 0; i<(int)(N); i++)
#define REP(i,k,N) for(int i = k; i<(int)(N); i++)
#define INF 10000000
typedef long long ll;
using namespace std;
const int MAX_N = 1001;
int d[MAX_N][MAX_N];
int main(){
string ch1,ch2;
cin >> c... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#in... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
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 (a>b) { a=b; return 1; } return 0; }
int main(){
cin.tie(0);
io... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define INF 10000000
#define rep(i,a,b) for(ll (i)=a;(i)<(ll)(b);(i)++)
using ipair = pair<ll,ll>;
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_7_A&lang=jp
vector<vector<ll>> capacity;
vector<vector<ll>> flow;
vector<ll> pred;
... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
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], b[N], c[N], d[N];
for(int i=0; i<N; i++) cin >> a[i] >> b[i];
for(int i=0... | 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define ll long long
int main() {
int n, k;
cin >> n >> k;
vector<int> x(n);
rep(i, n)
cin >> x[i];
int ans=INT_MAX;
for (int i ... | 0 |
#include<iostream>
using namespace std;
int main(){
int m, d, ans, month, i, total = 0;
while(1){
cin >> m >> d;
if (m == 0) break;
for(i = 1; i < m; i ++){
if(i==1||i==3||i==5||i==7||i==8||i==10||i==12){
total += 31;
}
else if(i == 2){
total += 29;
}
else{
total += 30;
}
}
to... | #include <stdio.h>
int main(){
int a,i;
long long b,c,d,j;
scanf("%d",&a);
if(a==2){
scanf("%lld %lld",&b,&c);
if(b>c)i=c;
else i=b;
for(j=1;j<=i;j++)if(b%j==0&&c%j==0)printf("%lld\n",j);
}else {
scanf("%lld %lld %lld",&b,&c,&d);
if(b<c&&b<d)i=b;
if(c<b&&c<d)i=c;
if(d<c&&d<b)i=... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int x,y;
cin>>x>>y;
if(x==0 || y==0){
if(y>x)
cout<<y+abs(x)<<endl;
else
cout<<abs(y)+x+1<<endl;
}else if(x*y>0){
if(x<y)
cout<<y-x<<endl;
else
cout<<x-y+2<<endl;
}else if(x*y<0)
cout<... | #include <iostream>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int x, y;
cin >> x >> y;
// 入力終了
// 1.初めにBを押すか押さないか決める
// 2.Aを0回以上押す
// 3.最後にBを押すか押さないか決める
int firstB[2] = {-1, 1}, secondB[2] = {-1, 1};
int ans = 2000000000;
int tmpx, tmpy;
rep(i, 2){
rep(j, 2){... | 1 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h... | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | 0 |
#include <cstdio>
#include <cmath>
using namespace std;
int main(void)
{
int h, w;
int h2;
double w2;
for (;;) {
scanf("%d %d", &h, &w);
if (h == 0 && w == 0)
return 0;
int z = pow(h, 2) + pow(w, 2);
w2 = sqrt(z);
for(h2 = h+1; h2 < w2; h2++) {
w2 = sqrt(z - pow(h2, 2));
if (w2 ==... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "random"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
temp... | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int ans = 111;
r... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cout << ceil(n/111.0)*111 << endl;
return 0;
} | 1 |
#include <iostream>
using namespace std;
void call(int n) {
for(int i=1;i<n+1;i++)
{
if( i%3==0 )
{
cout << " " << i;
}
else
{
int x = i;
while(x>0)
{
if( x%10==3 )
{
cout... | #include<stdio.h>
int main(void)
{
int x,a,c;
scanf("%d",&x);
a=3;
for(c=1;c<=x;c++){
a=x*x*x;
}
printf("%d\n",a);
return 0;
} | 0 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<sstream>
#include<map>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1;i <=n;i++)
#define rrep(i,n) for(int i = n -1;i >= 1;i--)
#define ALL(a) a.begin(),a.end(... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10; //微調整用（EPSより小さいと0と判定など）
... | #include <bits/stdc++.h>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
const int INF = 1e9;
using namespace std;
int n;
int res = 0;
struct node {
int id;
int parent;
};
node v[100];
vector<tuple<int, int, int>> cost;
vector<int> path;
int find(node x){
if(x.parent =... | 0 |
#include<iostream>
using namespace std;
int main ()
{
int n, a, p, k;
cin >> n;
a = n / 100;
k = a * 100 + a * 10 + a;
p = (a + 1) * 100 + (a + 1) * 10 + a + 1;
if(n <= k)
cout << k;
else
cout << p;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int n;
int main() {
cin >> n;
for (int i = 1; i < 10... | 1 |
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
#define p 1000000007
using namespace std;
namespace ywy{
inline ll mi(int a,int b){
ll ans=1,tmp=a;while(b){
if(b&1)ans=(ans*tmp)%p;tmp=(tmp*tmp)%p;b>>=1;
}ret... | 0 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... |
#include <iostream>
#include <string>
class Baseball{
public:
Baseball();
void init();
int getPoint();
void hit();
void homerun();
// @return false - the inning ends.
bool out();
private:
int point;
unsigned int outs;
bool base[3];
};
Baseball::Baseball(){
init();
}
... | 1 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define DEBUG true
#ifdef ONLINE_JUDGE
#undef DEBUG
#define DEBUG false
#endif
using namespace std;
#define TRACE(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); cerr ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main()
{
int t=1;
//cin>>t;
while( t-- )
{
int a,b;
cin>>a>>b;
cout<<a*b;
}
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
using ll = long long;
using ld = long double;
using ull =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string s;
cin >> a >> b >> s;
string ans = "Yes";
if (s.at(a) != '-') {
ans = "No";
}
for (int i = 0; i < a+b+1; i++) {
if (i == a) continue;
if (s.at(i) == '-') ans = "No";
}
cout << ans ... | #include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
double P1x,P1y,P2x,P2y;
cin >> P1x >> P1y >> P2x >> P2y;
printf("%.8lf\n", sqrt((P1x-P2x)*(P1x-P2x)+(P1y-P2y)*(P1y-P2y)));
return 0;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.