code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int max_gcd(int n, int m) {
if (n == 1) return m;
for (int gcd = m / n; gcd > 0; --gcd) {
if (m % (gcd * n) % gcd == 0) return gcd;
}
return 1;
}
int main() {
int N, M;
std::cin >> N >> M;
std::cout << max_gcd(N, M) << '\n';
return ... | // 7/12
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
ll M;
cin >> N >> M;
// int M2 = M;
// map<int, int> mp; // 素因数、個数
// for (int i = 2; i * i <= 1000000000; i++) {
// ... | 1 |
#include <iostream>
#include <vector>
using namespace std;
bool linearSearch(const vector<int>& ary, int key) {
for (auto i = 0; i < ary.size(); i++) {
if (ary[i] == key) {
return true;
}
}
return false;
}
int main(void) {
int n;
cin >> n;
vector<int> S(n);
for ... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(... | 0 |
/*#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
#include<bits/stdc++.h>
#define ll long long
#define inf 1000000005
#define put putchar('\n')
#define F(i,a,b) for (int i=(a);i<=(b);i++)
#define D(i,a,b) for (int i=(a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
ll N, S, X[100500], P[100500];
int main() {
//cout.precision(10);
cin.tie(0);
ios::sync_with_std... | 0 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map... | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include<vector>
#include<iomanip>
#include<map>
#include <queue>
#include<cmath>
#include<cstdio>
#include<iomanip>
#include<set>
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define REP(i,n)... | 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;
cin >> N;
vector<int> A(N);
rep(i,N){
cin >> A[i];
}
map<int, int> K;
for(int i = 0; i < N; i++){
K[A[i]]++;
... | #include<bits/stdc++.h>
using namespace std;
signed main(){
int n,ans=0;
string a,b,c;
cin >> n;
cin >> a >> b >> c;
for (int i = 0; i < n; i++){
if (a[i] == b[i]){
if (b[i] != c[i]){
ans++;
}
}else if (b[i] == c[i]){
ans++;
}else if (a[i] == c[i]){
ans++;
}else... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 1 |
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> ... | #include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m>>n>>o>>p)
{
if(m+n>o+p)
cout<<"Left"<<endl;
else if(m+n<o+p)
cout<<"Right"<<endl;
else
co... | 1 |
#include"bits/stdc++.h"
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(ll x = (l);x<=(u);x++)
#define RREP(x,l,u) ... | // main.cpp
// ABC174F2
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <tuple>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// Binary Indexed Tree (Fenwick Tree)
// 使い方 : BIT<int>bit
// BIT<... | 0 |
#include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... | #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;
in... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
ll H, W, A, B;
cin >> H >> W >>A >> B;
... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
long long n,i,p,q;
while(cin>>n,n){
vector<int> ids;
map<int,long long> m;
while(n--){
cin>>i>>p>>q;
if(!m.count(i))ids.push_back(i);
m[i]+=p*q;
}
int na=1;
for (int k=0;k<(int)ids.size();++k) {
if(1000000<... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin>>n;
vector<vector<int>> x(n);
vector<vector<int>> y(n);
for(int i=0;i<n;i++){
int a;
cin>>a;
for(int j=0;j<a;j++){
int b,c;
cin>>b>>c;
x.at(i).push_back(b);
y.at(i).push_back(c);
}
}
int count=0... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <functional>
using namespace std;
#define R... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define M 1000000007
#define gb(co, k) ((co)>>(k)&1)
int main(){
int n;
cin>>n;
vector<ll> a(n);
rep... | //thuanqvbn03
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100005;
const int Mod = 1000000007;
int n, D;
string s;
long long dp[MaxN], tmp[MaxN];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s;
cin >> D;
n = s.size();
for (int i = s[0] ... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=205,up=60;
int n;
ll a[N],p[N];
char s[N];
void add(ll x)
{
for(int i=up;i>=0;i--)
if(x>>i&1)
{
if(!p[i]) {p[i]=x;break;}
else x=x^p[i];
}
}
bool query(ll x)
{
for(int i=up;i>=0;i--)
... | #include<bits/stdc++.h>
using namespace std;
int b[100000];
int main()
{
int n;
cin>>n;
long long int a[n+5];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
int j=0;
for(int i=1;i<n;i++)
{
if(a[i]==a[i-1])
{
b[j]=a[i];
... | 0 |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = ... | #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; }
vector<pair<int64_t,int64_t>>prime_factorize(int64... | 1 |
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <set>
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
const ll MAX_N = 6e5 + 25, MAX_M = 1500000, MOD = 1e9 + 7;
ll n, ans;
ll Arr[MAX_N];
ll dp[MAX_N];
ll DP[MAX_N];
ll ind;
vector <l... | #include<bits/stdc++.h>
int main(){
using namespace std;
constexpr unsigned long MOD = 1000000007;
unsigned long N;
cin >> N;
vector<unsigned long> a(N + 1);
for(unsigned long i = 1, A; i <= N; ++i){
cin >> A;
a[i] = a[i - 1] ^ A;
}
auto f = [&MOD](auto& a, auto k){(a.se... | 1 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
vi v(3);
rep(i,3) cin >> v[i];
sort(v.begin(),v.end());
cout << v[0]+v[1] << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
int ans;
cin >> A >> B;
if(B == 1){
cout << "0" << endl;
return 0;
}
ans = ((B-A) + (A-2))/(A-1) + 1;
cout << ans << endl;
} | #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 sum = 1;
rep(i,22){
if(sum >= b){
cout << i << endl;
return 0;
}
sum--;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN=2020,MOD=998244353;
template <class T>
inline bool read(T &ret)
{
char c;
int sgn;
if (c = getchar(), c == EOF)
{
return 0;
}
while (c != '-' && (c < '0' || c > '9'))
{
c = getchar();
}
sgn = (c == '-') ? -... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
using namespace std;
using LLONG = long long;
const LLONG MOD = 998244353;
cl... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#include <stack>
#define rep(i, n) f... | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
int h, w, dx[] = { -1,0,1,0 }, dy[] = { 0,-1,0,1 };
vector<string>m;
int main() {
cin >> h >> w;
m.resize(h);
int sum = 0;
for (int i = 0; i < h; i++) {
cin >> m[i];
for (int j = 0; j < w; j++) {
if (m[i][j] == '.')sum++;
}
}
ve... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N;
cin>>N;
vector<int> A(1010);
for(int i=1;i<=N;i++){
int n=i;
for(int j=2;j<=n/j;j++)
for(;n%j==0;n/=j)
A[j]++;
if(n!=1)
A[n]++;
}
int ans=1;
for(int i:A)
ans=ans*(i+1)%1000000007;
... | #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... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
int main(){
int a,b,c;
cin >> a >> b >> c;
int A = min(a,b);
int B = max(a,b);
for(int i=A;i<=B;i++){
if(i == c... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (ll)n; ++i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
void solve(void)
{
int a,... | 1 |
#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 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 chmin(T& a, T b) { if (a ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll M... | 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 all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#defi... | #include<bits/stdc++.h>
using namespace std;
const int MAX=100000+5;
int n;
pair<int,int> coord[MAX];
vector<int> par(MAX,0);
vector<pair<int,pair<int,int> > > edges;
int root(int x)
{
while(par[x]!=x)
{
par[x]=par[par[x]];
x=par[x];
}
return x;
}
void union1(int x,int y)
{
int u=root(x);
int v=root(y);
p... | 0 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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 h,w,n;
cin >> h >> w >>n;
int a=max(h,w);
cout<<(a + n - 1) / a<<endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <list>
#include <iomanip>
using namespace std;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#defin... | 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)... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, k; cin >> n >> k;
cout << n - k + 1 << endl;
return 0;
} | 1 |
#include <cstdio>
#include <algorithm>
#include <vector>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int pref[250005], suff[250005], ans, prefix[250005], h , w, a, b;
const int mod = 1e9 + 7;
int BinPow(int x,int n){
if(n == 0)
return 1;
if(n == 1)
return x;
else{
int sum = BinPow(x, n / 2) % mod;
sum*=s... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pi pair<ll,ll>
#define pii pair<ll,pi>
#define pb push_back
#define mk make_pair
#define db double long
const int siz = 2 * 1e5 + 7;
int parent1[siz];
int nodesize1[siz];
int parent2[siz];
int nodesize2[siz];
i... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;cin>>N>>M;bool F=false;int A=-1,B=-1,C=-1;
for (int X=0;X<=N;X++){
for (int Y=0;Y<=N;Y++){
if (X+Y<=N&&X*10000+Y*5000+(N-X-Y)*1000==M){
A=X;B=Y;C=(N-X-Y);F=true;break;
}
}
}
if(!F){
cout<<-1<<" "<<-1<<" "<<-1<<e... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
using namespace std;
long long cnt;
void print(vector<int> &data){
for (int i = 0; i < data.size(); ++i){
cout << data[i] << endl;
}
}
void insertSort(vector<int> &data, int d)... | 0 |
//こんなプログラムを組んではいけない(戒め
//マージの仕様が複雑だし、空白マスを引く処理忘れやすいし、ひどいコードだ。
#include<iostream>
#include<queue>
using namespace std;
const int h = 12;
const int w = 12;
const int dy[4] = {-1, 0, 1, 0};
const int dx[4] = {0, 1, 0, -1};
char data[h][w+2];
//データ構造をマージする一般的なテクなし。
class UnionFind {
public:
int oya[2521], size;
void i... | #include<iostream>
using namespace std;
char map[20][20];
void dfs(int i, int j) {
map[i][j] = '0';
if (map[i - 1][j] == '1')dfs(i - 1, j);
if (map[i + 1][j] == '1')dfs(i + 1, j);
if (map[i][j - 1] == '1')dfs(i, j - 1);
if (map[i][j + 1] == '1')dfs(i, j + 1);
return;
}
int main() {
for (int i = 0; i <= 13; i++) ... | 1 |
#include <iostream>
using namespace std;
int main(){
int x;
int ans =0;
cin >> x;
ans = x * x * x;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define loop(k) rep(author_is_masa,k)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<in... | 0 |
#include <bits/stdc++.h>
#define PB emplace_back
using namespace std;
const int N = 17;
long long int a[N][N], dp[1<<N];
int main () {
ios::sync_with_stdio(0);
int n;
cin >> n;
for(int i = 0 ; i < n ; i++ ) {
for(int j = 0 ; j < n ; j++ ) {
cin >> a[i][j];
}
}
lo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
const int INF = 100000000;
int cost[101][101];
int d[101];
bool used[101];
int n,k;
int dijkstra(int s, int g) {
fill(d,d+n,INF);
fill(used,used+n,false);
d[s] = 0;
while(true) {
int v = -1;
for (int u = 0; u < n; u++ ) {
if (!u... | #include<iostream>
using namespace std;
class meb{
public:
int num;
unsigned long long tanka;
unsigned long long count;
unsigned long long sum;
};
int main(){
int n;
while(1){
int cc=0;
cin>>n;
meb st[n];
if(n==0)break;
for(int i=0;i<n;i++){
cin>>st[i].num>>st[i].tanka>>st[i].count;
}
for(int k... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lol;
//マクロ
//forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i+... | #include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <queue>
#include <queue>
#include <stack>
#include <sstream>
#include <set>
typedef long long ll;
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
cons... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<double,string> P;
int main(){
int n;
while(cin>>n,n){
P pr[55];
for(int i=0;i<n;i++){
string l;
cin>>l;
int p,a,b,c,d,e,f,s,m;
cin>>p>>a>>b>>c>>d>>e>>f>>s>>m;
double sumi=f*s*m-p;
double sumt=a+b+c+(d+e)*m;
p... | #include <stdio.h>
#include <string.h>
int main(void){
int p, sum, d, e, f, s, m, n, i, j, x, max_i;
double tmp1, eff[50];
char str[50][21], C, tmp2[21];
while(1){
scanf("%d%*c",&n);
if(n == 0)
break;
for(i = 0;i < n;i++){
j = 0;
while((C = getchar()) != ' ')
str[i][j++] = C;... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
cin>>n;
cout<<n/3<<endl;
} | #include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
int a,b;
cin>>a>>b;
int start=1;
b=b-1;
int ans;
ans=b/(a-1);
if(b%(a-1)!=0)ans++;
cout<<ans<<endl;
} | #include <stdio.h>
typedef long long ll;
int main(void) {
ll h, w, n, m;
scanf("%lld%lld%lld", &h, &w, &n);
m = h > w ? h : w;
printf("%lld", (n + m - 1) / m);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30... | #include <iostream>
#include <cstdio>
using namespace std;
int n, a, b;
int main() {
cin >> n;
if(n==1) cout << "Hello World";
else {
cin >> a >> b;
cout << a+b;
}
return 0;
}
| 0 |
#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
const int N_MAX = 100;
const int INF = 1000000;
struct edge{
int to, cap, rev;
edge(int t, int c, int r): to(t), cap(c), rev(r){}
};
vector<edge> G[N_MAX * 2];
bool used[N_MAX * 2];
void add_edge(int from, int to,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S>... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
//ライブラリ始まり
//定数
//円周率
const double pi = 3.1415926535897932384;
//天井
const int INF = 1000000000; // = 10^9
const ll LINF = 1000000000000000; // = 10^15
//ABC文字列
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrs... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
string s;
cin >> n >> s >> q;
while (q--) {
int k;
cin >> k;
vector<ll> d(n), m(n), dm(n);
ll ans = 0;
for (int i = 0; i < n; i++) {
if (... | 0 |
#include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int n, m;
int p[1003];
void solve() {
sort(p, p + n);
reverse(p, p+n);
int ans = 0;
rep(i, n) ans += p[i];
for (int i = 0; i + m - 1 < n; i += m) {
ans -= p[i + m - 1];
}
... | #include<stdio.h>
#include<iostream>
using namespace std;
void insert_sort(long int *num,long int n,long int g,long int *cnt);
int main(){
long int cnt[1];
long int num[1000000];
long int n;
long int i;
long int m[1000000];
long int count=0;
long int k;
i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int A, B;
cin >> A >> B;
int tasu = A + B;
int hiku = A - B;
int kake = A * B;
if (tasu >= hiku && tasu >= kake) {
cout << tasu << endl;
}
else if (hiku >= kake && hiku >= tasu) {
cout << hiku << endl;
}
else {
cout << kake <... | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main() {
ll a, b;
cin >> a >> b;
ll ans = max(a + b, a - b);
ans = max(ans, a * b);
cout << ans << endl;
} | 1 |
#include <algorithm>
#include <boost/optional.hpp>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using E = pair<ll, P>;
const ll INF = 1LL << 60;
int n;
ll D;
ll a[200005];
vector< E > edges;
void solve(int L, int R) {
if (R - L <= 1) return;
int mid = (R + L) / 2;
ll lval = INF;
int lidx = -1;
f... | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
#define MAX 10000000
int b[110];
bool used[110];
struct edge{int from, to, cost;};
int solve(int a[110][110], int n, int s, int e){
fill(b, b+110, MAX);
fill(used, used+110, false);
b[s] = 0;
while(1){
int v = -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 mp make_pair
#define pb(x) push_back(x)
#define vll vector<long long>
#define pll pair<long long, long long>
#define mll map<long long, long long>
#define sz(v)... | 0 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, m;
cin >> n;
unordered_map<string, int> um;
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int N = 200200;
const int MAXN = 600600;
int ans = 59408656;
int n;
vector<int> on0[MAXN][4];
vector<int> on1[MAXN][4];
vector<int> on2[MAXN][4];
vector<int> on3[MAXN][4];
int Upd(vector<int> a, vector... | 0 |
#include <bits/stdc++.h>
#include <ctime>
#define rep(i,a,b) for(int i =a;i<b;i++)
using namespace std;
typedef unsigned long long ll;
inline int cine() {int a; return scanf("%d", &a) ? a : 1e9;}
void solve() {
int train, bus, mine = 1e9, sum = 0 ;
rep(i, 0, 2) {
cin >> train;
mine = min(mine,... | #include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
int q,w,e,r; cin >>q>>w>>e>>r;
cout << min(q,w) + min(e,r);
} | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <comple... | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++) //0から
#define REP(i,N) for(int j=i;j<N;j++) //iから
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (rig... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <map>
using namespace std;
int main(){
double n;
cin >> n;
cout << n*(180-(360/n)) << endl;
return 0;
}
| #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ll long long
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
string s;
cin >> s;
if(s == "RRR"){
cout << "3\n";
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,x;
cin >> N;
x = N%10 + ((N%100) / 10) + ((N%1000) / 100 ) + ((N%10000) / 1000) + ((N%100000) / 10000) + ((N%1000000) / 100000) + ((N%10000000)/1000000)+((N%1000000000) / 10000000);
if(N%x == 0)
cout << "Yes" << endl;
if(N%x != 0){
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
int a;
string s = to_string(n);
for (char c : s)
{
a += (c - '0');
}
if (!(n % a))
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
} | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s; cin >> s;
int cnt = 0;
for(int i = 2; i < s.size()-1; i++){
if(s[i] == 'C') {
cnt++;
if(cnt == 1) s[i] = 'c';
}
}
if(cnt != 1){
puts("WA");
return 0;
}
for... | #include <bits/stdc++.h>
using namespace std;
int dp[1005];
const char domino[15][15][15] = {
{}, // 0
{}, // 1
{}, // 2
{}, // 3
{"aacd", "bbcd", "efgg", "efhh"}, // 4
{"aabbc", "dee.c", "d..fg", "j..fg", "jiihh"}, // 5
{}, // 6
{"aabbcc.", "dd.ee.f", "..h..gf", "..h..gm", "ii.jj.m", ... | 0 |
#include <stdio.h>
int main() {
char x[102];
char g[102];
scanf ("%s %s", x, g);
printf("%s%s", g ,x);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chm... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(void)
{
int n, cnt=0;
string a,b,c;
cin >> n >> a >> b >> c;
rep(i,n) cnt += set<char>({a[i], b[i], c[i]}).size() - 1;
cout << cnt << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a;
for(int i=0;i*i<=n;i++)
a=i*i;
cout<<a<<endl;
} | /** author: __nishad__ **/
//#pragma GCC optimize(2)
//#pragma GCC optimize(3, "Ofast", "inline")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) co... | 1 |
#include <cstdio>
#include <algorithm>
#define mod 998244353
#define maxn 200010
#define LL long long
using namespace std;
LL fact[maxn],inv[maxn],ans,t[maxn],p;
int n,m,k,nm;
LL quick_pow(LL a,LL b){//a^b
LL ans=1;
while(b){
if(b&1)ans=ans*a%mod;
a=a*a%mod;
b>>=1;
}
return ans%mod;
}
void init(){
int i;
sc... | #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include <unordered_map>
//#include"testlib.h"
#define endl "\n"
#define all(v) v.begin(),v.end()
#define allr(s) s.rbegin(),s.rend()
#define RT(s) return cout<<s,0
#define sz(s) (int)(s.size())
#define PI acos(-1)
#define EPS 1e-8
#define watch(x) cout << (#x)... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned ui;
typedef unsigned long long ul;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef pair<bool, bool> pbb;
typedef vector<int> vi;
#define pb push_back
#define fi first
#def... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
const int inf=1e9+10;
const int maxn=16;
int dp[1<<maxn][maxn],dp2[1<<maxn],n,m,cost[maxn][maxn];
vector <int> g[1<<maxn];
i... | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main(){
string str;
while(cin >> str){
// cout << str << endl;
string strtmp;
for(int i=0;i<str.size();i++){
strtmp.push_back(str[str.size()-1-i]);
}
cout << strtmp << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
//型名省略
typedef long long ll;
typedef vector<long long> vl;
typedef vector<vector<long long>> vll;
typedef vector<char> vc;
typedef vector<vector<char>> vcc;
typedef vector<string> vs;
//マクロ
#define rep(i,n) for(ll i = 0; i < (ll) n; i++)
#define rep2(i,x,n) for(ll i = (ll) ... | 0 |
#include<cstdio>
#include<queue>
#include<utility>
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 400;
const int di[] = {1, 0, -1, 0};
const int dj[] = {0, 1, 0, -1};
bool color[MAX_N][MAX_N];
int H, W;
char ch[MAX_N + 1];
void input(){
scanf("%d%d", &H, &W);
for(int i = 0; i < H; ++i){
sca... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int INFTY = 1000000000;
int n;
scanf("%d", &n);
int p[n + 1];
for (int i = 0; i < n; i++) {
scanf("%d %d", p + i, p + i + 1);
}
int m[n + 1][n + 1];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double H, W, N;
cin >> H >> W >> N;
if(H >= W) cout << ceil(N/H) << endl;
else cout << ceil(N/W) << endl;
} | #include <iostream>
#include <string>
namespace ABC169
{
class A
{
public:
A() = default;
~A() = default;
void Run()
{
int A = 0;
int B = 0;
std::cin >> A;
std::cin >> B;
std::cout << A*B << std::endl;
}
};
}
int main()
{
ABC169::A prob;
prob.Run();
... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//constructor: LCA(graph);
template<class T>
class LCA_weight {
private:
int n;
int D = 30; //hight
vector<int> depth; //depth from root
vector<vector<pair<int,T>>> hen; //tree
vector<vecto... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin()... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
const double PI=3.1415926535897932;
bool SecondCompare(const pair<int,int> &a,const pair<int,int> &b)
{
return a.second<... | 0 |
#include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N;
cin >> N;
for (int i = N; i > 0; i--) {
double a = sqrt(i);
if (ceil(a) ==... | #include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1... | 1 |
#include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a>8)cout << ":(";
else if(b>8)cout << ":(";
else cout << "Yay!";
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
int main() {
int a, b; cin >> a >> b;
cout << max({a+b, a*b, a-b}) << endl;
return 0;
}
| 0 |
#include <iostream>
using namespace std;
#include <algorithm>
int main() {
int n;
while (1) {
cin >> n;
if (n==0) break;
int p1=0, p2=0;
int c1, c2;
for (int i=0; i<n; i++) {
cin >> c1 >> c2;
if (c1==c2) p1+=c1, p2+=c2;
if (c1>c2) p1+=c1+c2;
if (c1<c2) p2+=c1+c2;
}
cout << p1 << " " << p2 ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string str;
cin >> n;
for(int i=0;i<n;i++){
int out = 0;
int a[4] = {};
while(out != 3){
cin >> str;
if(str == "OUT") out++;
else if(str == "HOMERUN"){
a[3] += a[0]+a[1]+a[2]+1;
a[0] = a[1... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define ar array<int,2>
#define inf 1000000000000000000
int mod=1e9+7;
int min(int a,int b){return (a<b)?a:b;}
int max(int a,int b){return (a>b)?a:b;}
int fp(int a,int b){if(b==0) return 1;int x=fp(a,b/2);x=(x*x)%mod;if(b&1) x=(x*a)%... | #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 ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL<<60; // 仮想的な無限大の値;
using ll = long long;
using P = pair<int, int>;
#define vi... | 0 |
#include<bits/stdc++.h>
using namespace std;
vector<int>adj[100003],leaf;
int par[100003],depth[100005],sparse[100005][20],root=0,lz=0;
int lca(int p,int q)
{
int a,b,c,d,lp,i,j;
if(depth[p]<depth[q])
{
c=p; p=q; q=c;
}
for(j=19;j>=0;j--)
{
if((depth[p]-(1 << j))>=depth[q])... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using T = tuple<int,int,int>;
int main(){
int h, w;
cin >> h >> w;
map<int,int> ns; //（現在地、スタート地点の最大値）
multiset<int> dist; //現在地ースタート地点の最大値
rep(i,w) ns[i] = i; //キーiにiを代入
... | 0 |
#include <vector>
#include <algorithm>
#include <iostream>
#include <climits>
using namespace std;
typedef long long int int64;
vector<int64> P,Q;
int64 N,M,T;
int main(void)
{
while(true)
{
N = 0;
M = 0;
P.clear();
Q.clear();
P.shrink_to_fit();
Q.shrink_to_fit();
cin >> N >> M;
if(N == 0 && M == 0)... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
char Decryption(int k, char s) {
char station[] = {'a','b','c','d','e','f','g','h','i','j','k','l','m',
'n','o','p','q','r','s','t','u','v','w','x','y','z',
'A','B','C','D','E','F','G','H','I','J','K'... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,Y;
cin >> N >> Y;
int ansi=-1, ansj=-1, ansk=-1;
for(int i=0; i<=N; i++){
for(int j=0; j<=N-i; j++){
int k = N-i-j;
int total = i*10000 + j*5000 + k*1000;
if(total == Y){
ansi = i;
ansj = j;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int64_t N, M;
cin >> N >> M;
int64_t res = 1;
for (int64_t m = 1; m <= sqrt(M); ++m) {
if (M % m) continue;
int64_t m2 = M / m;
if (m >= N) res = max(res, m2);
if (m2 >= N) res = max(r... | 0 |
#include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m>>n>>o>>p)
{
if(m+n>o+p)
cout<<"Left"<<endl;
else if(m+n<o+p)
cout<<"Right"<<endl;
else
co... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
using ll = long long;
using P = pair<ll, ll>;
/*追加部分... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define dbg(x) cout<<#x<<":"<<x<<endl
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
vector<int> g[111111];
int p[111111];
ll ans;
ll n,k;
int... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
int n,m;
ll x,sum,ans;
map<ll,int>mmp;
int main()
{
scanf("%d%d",&n,&m);
s... | 0 |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<cmath>
#include<iomanip>
using namespace std;
int main(void){
int N,A[1000],c,hokan,flag,j,i,kaisuu;
cin>>N;
for(c=0;c<N;c++){
cin>>A[c];
}
flag=1;
i=0;
kaisuu=0;
while(flag){
flag=0;
for(j=N-1;i<j;j--){
if(A[j]<A[j-1]... | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typede... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, L;
cin >> N >> L;
int eated_apple = 10000000;
int sum_taste = 0;
for(int i=1; i<=N; i++){
sum_taste += L+i-1;
if(abs(eated_apple)>abs(L+i-1)) eated_apple = L+i-1;
}
cout << sum_taste-eated_apple << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
const long long int sMod = 998244353;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pa... | 1 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,t,f,ans;
double a[200001];
map<pair<int,int>,int> m;
signed main()
{
scanf("%lld",&n);
for(int i=1;i<=n;i++)
{
scanf("%lf",&a[i]);
int b=round(a[i]*1000000000);
t=f=-9;
while(b%2==0)
{
b/=2;
t++;
}
while(b%5==0)
{
b/=5;... | #include <bits/stdc++.h>
using namespace std;
int cnt[80][50];
int cnt2[200100], cnt5[200100];
char str[50];
long long inp()
{
memset(str, 0, sizeof(str));
scanf("%s", str);
long long ret = 0;
int point = 0;
int pointflag = 0;
for(int i = 0; str[i] ; ++i)
{
if(pointflag)
... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define pb push_back
int main(){
int x,y,z;
while(1){
cin>>x>>y>>z;
if(x==0&&y==0&&z==0)break;
int a[114514];
int b[114514];
rep... | #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... | 0 |
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
template<class T, class T2> inline void chkmax(T &x, const T2 &y) { if(x < y) x = y; }
template<class T, class T2> inline void chkmin(T &x, const T2 &y) { if(x > y) x = y; }
const int MAXN = (int)3e5 + 17;
const int mod = (int)1e9 + 7;
const int OFFSET = ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
string s;
int dp[2][3][300004];
void sub(const string& s) {
dp[1][0][0] = 1;
for (int i = 1; i < s.size(); ++i) {
for (int c : {0, 1}) {
if (c == 1 && s[i] == '0'
|| c == 0 && s[i] == '1') continue;
for (int pc : {0, ... | 1 |
#include <bits/stdc++.h>
using i64 = long long;
int main() {
int n, m;
scanf("%d%d", &n, &m);
std::vector<std::tuple<int, int, int>> es;
std::vector<std::pair<int, int>> w;
for (int i = 0; i < m; i++) {
int p, q, c;
scanf("%d%d%d", &p, &q, &c);
--p; --q;
es.emplace_b... | #include<bits/stdc++.h>
using namespace std;
#define f1(a,b,c) for(int c=a;c<=b;c++)
#define f2(a,b,c) for(int c=a;c>=b;c--)
#define f3(a,b,c) for(int c=a;c;c=b)
#define so1(a,n) sort(a+1,a+n+1,mycmp);
#define so2(a,n) sort(a+1,a+n+1);
#define ll long long
#define itn int
#define ubt int
#define pii pair<int,int>
#def... | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#define INF 200... | #include <iostream>
#include <fstream>
using namespace std;
int main() {
//ifstream cin("INPUT.txt");
//ofstream cout("OUTPUT.txt");
int n, m, sum, i;
int a, b;
while(cin >> n >> m, n != 0 && m != 0) {
int friends[500] = {0}; //1=友達 2=友達の友達
int m1[10000] = {0};
int m2[10000] = {0};
for(i = 0; i < m; i++) ... | 1 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf... | #include <iostream>
#include <vector>
template<typename T>
void Dump(const std::vector<T>& xs)
{
for (int i = 0; i < xs.size()-1; ++i)
{
std::cout << xs[i] << ' ';
}
std::cout << xs.back() << std::endl;
}
template<typename T>
int BubbleSort(std::vector<T>* src)
{
std::vector<T>& xs = *src;
bool change... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int k;
cin>>n>>k;
if(n%k==0){
cout<<0<<endl;
}
else{
cout<<1<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bo... | #include <bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18;
const int N = 5010;
long long f[N][N];
bool cmp(pair<int,int> a,pair<int,int> b){
return a.first < b.first;
}
int main() {
int n;
scanf("%d", &n);
vector< pair<int,int> > a(n);
for (int i = 0; i < n; i++) {
scanf(... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int N;
int A[3][100001];
LL dp[3][100001] = {};
int main() {
scanf("%d", &N);
rep(j, 3) { rep(i, N) scanf("%d", &A[j][i]); A[j][N] = 1000000001; }
rep(j, 3) sort(A[j... | 1 |
#include<cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<queue>
#define MAX_N 262144
#define INF 1000000000000000
typedef long long ll;
using namespace std;
int used[MAX_N];
ll n,d,a[MAX_N],ans=0,two[20];
pair<ll,ll> p[MAX_N],t[2*MAX_N][2];
vector<pair<ll,ll> > g[MAX_N];
void init(){
for(ll... | #include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll,int> pli;
#define fir first
#define sec second
#define Mp make_pair
const int MAXN = 2e5 + 5;
const int inf = 0x3f3f3f3f;
const ll linf = 0x3f3f3f3f3f3f3f3f;
template<typename T>
void chk_mi... | 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 all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <cstdio>
#include <iostream>
#include <vector>
#define lson (idx << 1)
#define rson (idx << 1 | 1)
#define INF 1000000000000LL
#define MAXN 200010
using namespace std;
typedef long long ll;
// `lo` is the current minimum of the segment.
// `lh` is the current value of the left endpoint.
// `lazy` is the lazy... | 0 |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<map>
#include<set>
using namespace std;
long long n,d,a[200005],r[200005],l[200005];
int main()
{
cin>>n>>d;
long long ret=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
ret+=a[i];
}
... | #include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int main()
{
int n;
ll d;
cin >> n >> d;
ll a[200005];
priority_queue<P, vector<P>, greater<P>> que;
for(int i = 0; i < n; i++){
cin >> a[i];
que.push(P(a[i], i));
}
... | 1 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
using ll = long long;
using namespace std;
constexpr ll inf = 1e15;
#define MAX_N 1000
constexpr int MAX = 10000;
constexpr int MOD = 1e9+7;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMin... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef double D;
typedef long long int LL;
#define st first
#define nd second
#define pb push_back
#define PLL pair <LL, LL>
#define PII pair <int, int>
const int N = 507;
const int MX = 1e9 + 7;
const LL INF = 1e18 + 9LL;
int n;
LL tab[N][N];
vector <int> primes;
LL... | #include <bits/stdc++.h>
using namespace std;
#define lor(a,b,c) for(register int a=b;a<=c;++a)
#define ror(a,b,c) for(register int a=c;a>=b;--a)
typedef long long ll;
const int MAXN=505,MAXD=7919;
const int movx[4]={-1,0,1,0},movy[4]={0,1,0,-1};
int n; ll a[MAXN][MAXN];
bool vis[MAXD]; ll prime[MAXN<<1];
inline ll ... | 1 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | #include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
LLI n, a, b, save;
cin >> n >> a >> b;
LLI first, second, ans = 0;
cin >> first >> second;
save = ( second - first ) * a;
if( save > b )
ans += b;
else
ans += save;
first = second;
for(int i = 2; i < n; i++)
{
cin... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string text;
while(getline(cin,text,'\n')){
for(int i=0;i<26;i++){
for(int w=0;w<text.size();w++){
if ('a'<=text[w]&&text[w]<'z')
text[w]++;
else if(text[w]=='z')
text[w] = 'a';
}
if (text.find("this") != string::... | #include <iostream>
#include <string>
using namespace std;
const int ALPHA = 26;
int main(){
string input;
while(cin && getline(cin, input)){
string cand[ALPHA];
for(int i=0; i<ALPHA; i++){
cand[i] = "";
for(int n=0; n<input.size(); n++){
if('a'<=input[n]&&input[n]<='z'){
cand[i] += (input[n]-'a'... | 1 |
#include<bits/stdc++.h>
using namespace std;
struct edge{
int to, cost;
};
int main(int argc, char *argv[]){
int n, m, r;
cin >> n >> m >> r;
vector<vector<edge> > g(n);
int from;
for (int i = 0; i < m; i++) {
edge e;
cin >> from >> e.to >> e.cost;
g[from].push_back(e);
}
int dp[n];
for ... | #include <iostream>
using namespace std;
#define full (m == 100 || e == 100 || j == 100)
#define avg(n) (m + e + j >= n)
#define me80 (m >= 80 || e >= 80)
int main() {
int n, m, e, j;
while (1) {
cin >> n; if (n == 0)break;
for (int i = 0; i < n; i++) {
cin >> m >> e >> j;
if (full || m + e >= 180 || avg(... | 0 |
#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()... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; i++)
static const long long INF = 1000000;
using p = pair<int,int>;
int main(){
int64_t x,ans;
cin >> x;
int a,b,c;
a = x/500;
b = x - 500*a;
c = b/5;
ans = 1000*a + c*5;
cout << ans << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char S;
int mix=0;
int a=0;
for(int i=0; i<3;i++){
cin >> S;
if (S=='R'){
a++;
mix=max(a,mix);
} else {
a=0;
}
}
cout << mix << endl;
} | #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()
{
string S;
cin >> S;
if (S.find("RRR") != string::npos) {
cout << 3 << endl;
} else {
if (S.find("RR") != string::npos) {
cout << 2 << endl;
... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define mod 998244353
#define N 1000009
#define cbn(x,y) ((ll)fac[x]*inv[y]%mod*inv[(x)-(y)]%mod)
using namespace std;
int m,n,fac[N],inv[N];
int ksm(int x,int y){
int z=1; for (; y; y>>=1,x=(ll)x*x%mod) if (y&1) z=(ll)z*x%mod;
return z;
}
int main(){
scanf("%d%d",&m,&n)... | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,q;
cin>>n>>q;
vector<int>a(n);
for(int i=0;i<n;i++)cin>>a[i];
vector<vector<int> >d(n);
vector<int>f(n);
vector<int>ans(q);
vector<vector<int> >id(n);
for(int i=0;i<q;i++)
{
int l,r;
cin>>l>>r;
l--;
r--;
... | #include<bits/stdc++.h>
using namespace std;
int ff;
int n,m,col[500100],blo,tot,le,ri,ans[500100],cnt[500100];
pair<pair<int,int>,int> que[500100];
bool pp(pair<pair<int,int>,int> x,pair<pair<int,int>,int> y){
return x.first.second<y.first.second;
}
inline void inser(int val){cnt[val]++;if(cnt[val]==1) ff++;}
inline ... | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int l[5];
char c;
while (cin >> l[0] >> c >> l[1] >> c >> l[2] >> c >> l[3] >> c >> l[4]) {
sort(l, l + 5);
if (l[0] == l[1] && l[1] == l[2] && l[2] == l[3])
cout << "four card";
else if (l[4] == l[1] && l[1] == l[2] && l[2] == l[3])
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RA... | 1 |
#include<bits/stdc++.h>
using namespace std;
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')
f=-1;
c=getchar();
}
while(c<='9'&&c>='0')
{
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
int main()
{
int d=read(),t=read(),s=read();
if(t*s>=d)
puts("Yes");
else
pu... | #include <iostream>
using namespace std;
#define fin(ans) cout << (ans) << '\n'
int main()
{
int A[3];
cin >> A[0] >> A[1] >>A[2];
sort(A,A+3);
if(A[0] == A[1] && A[1] == A[2]){
fin("No");
}else if ((A[0] != A[1] && A[1] != A[2]) ){
fin("No");
}else{
fin("Yes");
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() != 2)
reverse(s.begin(), s.end());
cout << s << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
char s[1500];
int i,n;
cin>>s;
n=strlen(s);
if(n==2){
cout<<s;
}
else{
for(i=n-1;i>=0;i--){
cout<<s[i];
}
}
return 0;
}
| 1 |
#include<iostream>
#include<vector>
#include<map>
#include<utility>
#include<algorithm>
#include<queue>
#include<stack>
#include<string>
#include<stdlib.h>
#include<stdio.h>
#include<cmath>
#include<cstdlib>
#include<typeinfo>
#include<sstream>
#include<list>
#include<set>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#de... | // 0529.cpp
// 2012/12/14.
#if 1
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#... | 1 |
#include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N + 2);
A[0] = 0;
A[N + 1] = 0;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
A[i + 1] = a;
}
int ans = 0;
for (int i = 0; i < N + 1; ++i) {
ans += abs(A[i + 1] - A[i]);
}
for (int i = 0; i < N; ++i) {
cout <... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 111;
for (int i = 1; i < 10; i++) {
if (N <= ans * i) {
cout << ans * i << endl;
break;
}
else if (i == 9) {
cout << 1111 << endl;
}
}
} | #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <utility>
#include <algorithm>
#include <n... | 0 |
#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... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <vector>
class DPreparingBoxes {
public:
void solve(std::istream& in, std::ostream& out) {
long long n;
std::vector<int> ans, a(200020), b(200020);
in >> n;
... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int maxsize(0);
vector<int> input;
while (1)
{
int tmp;
cin >> tmp;
if (!tmp)
{
break;
}
input.push_back(tmp);
(maxsize < tmp) ? (maxsize = tmp) : (0);
}
vector<int> prime, ans;
for (int i(2); i <... | #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
int card[20000],i,j,a=0,b=0,c=1,n;
cin>>n;
while(n!=0){
for(i=0;i<2*n;i++){
cin>>card[i];
}
for(i=0;i<2*n;i=i+2){
if(card[i]>card[c]){
a=a+card[i]+card[c];
}
else if (card[i]==card[c]){
a=a+card[i];
b=b+card[c];
}
else{
b=b+card[i]+card[c];
}
c=c+2;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll MOD=1e9+7;
void solve()
{
ll a[5];
for(ll i=0;i<5;i++)
cin>>a[i];
ll k;
cin>>k;
for(ll i=0;i<5;i++)
for(ll j=0;j<5;j++)
if(a[j]-a[i]>k... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.