code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int N;
int64_t dp[100010][2];
void init()
{
for (int i = 0; i < N; i++)
{
dp[i][0] = dp[i][1] = 1;
}
}
int main()
{
cin >> N;
vector<int64_t> T(N), A(N);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
}
for (int i = 0; i < N; i++)
{
cin >> T.a... | #include <iostream>
using namespace std;
#define MAX_SIZE 300
int T[MAX_SIZE];
int parent(int i) { return i / 2; }
int left(int i) { return i * 2; }
int right(int i) { return i * 2 + 1; }
int main() {
int H;
cin >> H;
for (int i = 1; i <= H; i++) cin >> T[i];
for (int i = 1; i <= H; i++) {
cout ... | 0 | 53,473,755 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repr(i, n) for(int i = (n-1); i >= 0; --i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 0 | 87,115,794 |
#include<iostream>
#include<string>
using namespace std;
void printf(string str,int a, int b){
cout << str.substr( a,b-a+1) << "\n";
}
string reverse(string str,int a, int b ){
string t = str;
for(int i=a; i<=b; i++){
str[i] = t[b+a-i];
}
return str;
}
string replace(string str,int a, int b,string x)... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
stack<char> st;
for (int i=0; i<str.length(); i++) {
if (str[i] == 'B' ) {
if (!st.empty())
st.pop();
}
else {
st.push(str[i]);
}
}
vector<char> res;
while (!st.empty()) {
res.push_back(st.top());
st.pop();
... | 0 | 7,346,908 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int n;
int m[200][200];
int p[200];
int matrixChainMultiplication(){
for (int i = 1; i <= n; i++){
m[i][i] = 0;
}
for (int l = 2; l <= n; l++){
for (int i = 1; i <= n-l+1; i++){... | #include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
using namespace std;
long long A[100000];
long long diff_A[100000];
long long x[100000];
long long y[1000... | 0 | 20,494,563 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int ctoi(char c){
switch (c){
case '0': return 0;
case '1': return 1;
case '2': return ... | #include <iostream>
using namespace std;
int main()
{
while(true){
int n;
cin >> n;
if(n==0)
break;
char A[26];
for(int i=0; i<26; i++)
A[i] = (char)('A'+i);
char a[26];
for(int i=0; i<26; i++)
a[i] = (char)('a'+i);
char N[10];
for(int i=0; i<10; i++)
N[i] = (char)('0'+i);
for(int i=0; ... | 0 | 22,127,639 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
ll p[n+1],mini[n+1];
for(ll i=1;i<=n;i++)
cin>>p[i];
mini[1]=p[1];
for(ll i=2;i<=n;i++)
mini[i]=min(mini[i-1],p[i]);
ll cnt=0;
for(ll i=1;i<=n;i++)
if(mini[i]==p[i])
cnt++;
cout<<cnt;
} | 0 | 11,200,930 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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++)
using namespace std;
char S[4];
int main(){
rep(i, 4){
cin >> S[i];
}
sort(S, S+4);
if (S[0]==S[1] && S[1]!=S[2] && S[2]==S[3]) cout << "Yes" <... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, d, a;
cin >> n >> d >> a;
vector<pair<long long, long long>> x(n);
for (int i = 0; i < n; i++) {
cin >> x[i].first >> x[i].second;
x[i].second = (x[i].second + a - 1) / a;
}
sort(x.begin(), x.end());
long long ans = 0;
vect... | 0 | 67,992,250 |
#include <iostream>
#include <vector>
int main(){
u_int a, b;
while(std::cin >> a >> b){
if(a == 0 && b == 0){
return 0;
}
std::vector<std::vector<u_int>> path(a+1);
for(int i = 0; i < a+1; ++i){
path[i].resize(b+1, 1);
}
u_int n;
s... | #include<iostream>
#include<string>
#include<vector>
#include<iomanip>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
using namespace std;
#define ll long long
int main(){
ll N,K,i,j;
cin >> N >> K;
ll A[N];
for(i=0;i<N;i++){
cin >> A[i];
}
ll part=0;
for(i=0;i<N-1... | 0 | 49,556,841 |
#include <cstdio>
#include <cstdlib>
using namespace std;
int hasil,input;
int main()
{
while(scanf("%d",&input) != EOF)
{
hasil=0;
for (int a=0;a<=9;a++)
{
for (int b=0;b<=9;b++)
{
for (int c=0; c<=9; c++)
{
for (int d=0;d<=9; d++)
{
if(input==a+b+c+d)
{
hasil++;
}
}
... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 0 | 54,631,445 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dxx[... | 0 | 88,767,424 |
#include<stdio.h>
int main(void){
int x,i;
for(x=1;x<10;++x){
for(i=1;i<10;++i){
printf("%dx%d=%d\n",x,i,x*i);
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort(ALL((c)))
#define debug(x) \
do { \
... | 0 | 51,159,361 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 2,074,712 |
#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
double sum = 0;
double kaku = (double)1 / n;
for (int i = 0; i < n; i++) {
double kake = 1;
int cnt = 0;
int me = i + 1;
while (me < k) {
kake *= 0.500;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
unsigned long long int k;
cin >> s >> k;
int count = 0;
for (int i = 0; i < 100; ++i)
{
if (s[i] - '0' == 1)
{
++count;
}
if (s[i] != '1')
{
break;
}
}
if (count >= k)
{
cout << 1 << endl;
}
else
{
cout << s[count] <<... | 0 | 24,515,243 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pllll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef ve... | 0 | 91,283,975 |
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end(... | #include <iostream>
#include <cmath>
using namespace std;
inline double sq (double x) {
return x * x;
}
double rad (double x1, double y1, double x2, double y2) {
double a = x1 * x2 + y1 * y2;
double b = sqrt(sq(x1) + sq(y1)) * sqrt(sq(x2) + sq(y2));
return acos(a / b);
}
int main (void) {
double x1,... | 0 | 100,101,327 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
int sum = 1;
cin >> N >> K;
for (int i = 0; i < N; i++) {
if (sum * 2 <= sum + K ) sum = sum * 2;
else sum = sum + K;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
auto query = [&]() {
long long cur = 10;
for (int i = 1; i <= 10; i++) {
printf("? %lld\n", cur), fflush(stdout);
char s[2]; scanf("%s", s);
if (s[0] == 'N') return i;
cur = cur * 10;
}... | 0 | 49,296,298 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1 << 29;
const int MOD = 1000000007;
int main() {
int n, k;
cin >> n >> k;
long long ans = 0;
long long min_sum;
long long max_sum;
vector<long long> cusum(n + 2, 0);
rep(i, n +... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 0 | 19,461,896 |
#include <iostream>
using namespace std;
int main() {
long int n,k;
cin>>n>>k;
long int sum=n-k;
if(sum<0)
{
cout<<"";
}
else
{
cout<<sum+1<<endl;
}
return 0;
} | #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;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | 0 | 86,542,824 |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
/*
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
string S, T;
cin >> S >> T;
if(T.substr(0, S.size()) == S){
cout << "Yes"<<endl;
}
else ... | #include <bits/stdc++.h>
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#... | 0 | 23,301,256 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PL = pair<ll,ll>;
int main()
{
int n, k;
cin >> n >> k;
int ans = 0;
deque<int> dq(n);
for(int i = 0; i < n; i++)cin >> dq[i];
for(int i = 0; i <= k; i++) {
for(int j = 0; j <= k; j++) {
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using VE = vector<T>;
template<class T> using P = pair<T, T>;... | 0 | 96,777,553 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<double> VL;
typedef vector<string> VS;
typedef vector<PLL> VP;
typedef vector<ll> VLL;
#define rep(i,n) for (ll i=0; i<(ll)(n); i++)
#define repd(i,n) for (ll i=n-1; i>=0; i--)
#define rep... | 0 | 15,240,330 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int INF = 1e9;
#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()
{
ll n;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll INF = 100000000000000;
double PI = 3.1415926535;
template<typename T>
void remove(std::vector<T>& vector, unsigned int index)
{
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<ll>>;
int main(){
int A,B... | 0 | 31,529,741 |
#include<algorithm>
#include<bitset>
#include<climits>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_p... | 0 | 20,454,147 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int N,M; cin>>N>>M;
vector<set<int>> k(M);
cin.ignore();
rep(i,M){
int s; cin>>s;
rep(j,s){
int t; cin>>t;
k[i].insert(t-1);
}
... | #include<bits/stdc++.h>
int main(){
int n;
scanf("%d", &n);
char fie[n][n];
for(int i=0; i<n; i++) scanf("%s", fie[i]);
int ans = 0;
for(int i=0; i<n; i++){
int cnt = 0;
for(int j=0; j<n; j++){
for(int k=j; k<n; k++)... | 0 | 41,384,439 |
#include <stdio.h>
int main(void) {
int num[5];
int tmp;
char buf[256];
fgets(buf, sizeof(buf), stdin);
sscanf(buf, "%d %d %d %d %d", &num[0], &num[1], &num[2], &num[3], &num[4]);
for (int i=0; i<5-1; i++) {
for (int j=i+1; j<5; j++) {
if (num[i] < num[j]) {
tmp = num[i];
num[i] = num[j];
num[j] ... | #include <bits/stdc++.h>
#include <string>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define moca(a, s, b) a=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<cla... | 0 | 8,380,667 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int ans = 1000000000;
int n, a, b, c;
int l[8];
void f(int* x, int m){
if (m == n){
int mp = 0;
int s[3];
rep(i, 3) s[i... | 0 | 41,526,583 |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
char c[5] = "LRDU";
long long x[1000];
long long y[1000];
char ans[1000][41];
int main() {
int n, i, j, k;
vector <long long> v;
scanf("%d", &n);
for (i = 0; i < n; i++) sc... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 | 38,167,347 |
#include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i <= (int)(n); i++)
int main() {
int A,B;
cin >> A >> B;
int res=INT32_MAX;
for(int i=1;i<1100;i++){
if((int)(i*0.08)==A && (int)(i*0.1)==B){
res=min(i,res);
}
}
if(res==INT32_MAX)cout<<-1... | 0 | 16,916,758 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main() {
int a,b;
cin >> a >> b;
if(a<=8&&b<=8){
cout << "Yay!" << endl;
}
else{
cout << ":(" << e... | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
using ll=long long;
#ifdef ONLINE_JUDGE
#define D(...)
#else
#define D(...)cerr<<__LINE__<<":"<<"["<<#__VA_ARGS__<<"]->",P(__VA_ARGS__)
#endif
void P(){cerr<<endl;}
template<typename H,typename...T>void P(H h,T...t){cerr<<h<<" ";P(t...);}
in... | 0 | 24,823,264 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<cassert>
using namespace std;
int inf = 1000000000;
int func(string a){
string s = "";
if( 'a' <= a[0... | 0 | 75,671,147 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define sz(x) (int) (x.size())
#define Unique(x) x.erase(unique(all(x)), x.end())
#define endl "\n"
#define isOdd(n) (n&1)
#define pow(n, m) (ll)powl(n, m)
#define numOfDigits(n) ((n)? (ll)(log10(n))+1 : 1)
#define clr(x, val) m... | 0 | 77,299,056 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string s;
... | #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
#define... | 0 | 55,416,094 |
#include <iostream>
#include <iomanip>
int main() {
int n; std::cin >> n;
double d = 0;
for (int i = 0; i < n ;i++) {
int v; std::cin >> v;
d += (1.0/v);
}
std::cout << std::fixed << std::setprecision(15) << (1/d) << std::endl;
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
using ll = long long;
int main(){
int n,m;
cin>>n>>m;
vector<bool> a(n+2,true);
vector<ll> dp(n+1);
for(int i=1;i<=m;i++){
int b;
cin>>b;
a[b]=false;
}
dp[0]=1;
for(int i=0;i<=n;i++){
if(a[i]){
... | 0 | 12,626,176 |
#include <iostream>
#include <queue>
#include <unordered_map>
#include <utility>
#include <array>
#include <cstring>
bool isObstacle[1000][1000];
bool done[1000][1000];
int main() {
int h, w, n;
std::cin >> h >> w >> n;
std::unordered_map<int, int> factories;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; +... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) x.size()
#define all(a) a.begin(), a.end()
#define y1 aksjdaskdjksjfksdjf
#define left kdnvldvoiwejifejg
#define right lkdsjflksdjfdjfk
#define prev asdasfsadjkjsdfjs
#define tm aklsjdasjdasjdkdjjf
#define lcm hddalkwjeidjjhasda
#define random_shuffle as... | 0 | 79,041,108 |
#include<iostream>
int main(){
int n;
std::cin >> n;
int i=1;
if(n&(n-1)==0)
std::cout << n << " ";
else{
while(1){
if(1<<i > n){
std::cout << (1<<i-1) << std::endl;
break;
}
i++;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef vector<ll> VLL;
typedef vector<vector<ll>> VVLL;
typedef pair<ll, ll> Pair;
template <class T> T input() {T t; cin>>t; return t;}
#define FOR(i,a,b) for (l... | 0 | 63,778,657 |
#pragma GCC optimize("Ofast")
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdl... | #pragma gcc optimize("Ofast")
#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 ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(ALL(V))
#define RSORT(V) SORT(V);REV(V)
#defin... | 0 | 92,927,938 |
#include <iostream>
using namespace std;
int gcd(int a, int b) {
return (b ? gcd(b, a % b) : a);
}
int main() {
int n; cin >> n;
cout << n / gcd(360, n) * 360 / n;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 51;
int mp[MAX_N][MAX_N];
ll X[MAX_N], Y[MAX_N];
pair<ll, ll> dot[MAX_N];
int N, K;
int minmp(int i, int j) {
if(i >= 0 && j >= 0) return mp[i][j];
else return 0;
}
int main()
{
cin >> N >> K;
for(int i = 0; i < N; ++i)... | 0 | 40,777,095 |
#include<iostream>
using namespace std;
int min(int *a, int n)
{
int v = 1000000;
for ( int i = 0; i < n; i++ )
{
if ( v > a[i] )
{
v = a[i];
}
}
return v;
}
int max(int *a, int n)
{
int v = -1000000;
for ( int i = 0; i < n; i++ )
{
if ( v < a[i] )
{
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int a, b, c;
cin >> a >> b >> c;
for (int x = a; x <= a * 100; x += a)
{
if (x % b == c)
{
cout << "YES" << endl;
... | 0 | 3,596,553 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9, LG = 17;
int a[N], dp[LG][N];
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
int l, q; cin >> l >> q;
for (int i = 1; i <= n; i++) {
dp[0][i] = upper_bound(a + i, a + n + 1,... | #include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#d... | 0 | 43,515,151 |
#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, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
bool ok(string s){
int n= s.length();
bool maki = true;
for(int i=0;i<n/2;i++){
if... | #include<bits/stdc++.h>
using namespace std;
#define int long long
main(){
int n,x;
cin>>n>>x;
int ans=0;
ans+=n;
int res=n-x;
while(res){
if(res%x==0){
ans+=(2*res/x-1)*x;
break;
}
else {
ans+=(2*(res/x))*x;
int tmp=res;
... | 0 | 32,798,510 |
#include<iostream>
#include<bits/stdc++.h>
#include<math.h>
#include<string.h>
using namespace std;
int main(){
string s,a;
int c;
cin>>s;
a=s;
reverse(a.begin(),a.end());
if(a==s){
c=1;
}
if(c==1){
int l=s.length();
int m=l/2;
for(int i=0;i<m;i++)
if(s[i]!=s[m+i+1]){
c=0;
}
}
if(c==0)
... | #include<iostream>
using namespace std;
const int INF = 1000000;
int main(){
int n;
while(1){
cin >> n;
if(n==0){
break;
}
int table[10][10];
bool realtowntable[10];
for(int i=0;i<10;i++){
realtowntable[i] = false;
}
for(int i=0;i<10;i++){
... | 0 | 14,264,881 |
#include <iostream>
using namespace std;
struct Card{char suit,value;};
void show_array(struct Card a[],int n){
for(int i=0;i<n;i++){
if(i>0) cout << " ";
cout << a[i].suit << a[i].value;
}
cout << endl;
}
void BubbleSort(struct Card a[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 64,624,424 |
#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++)
#def... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define Fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(a,b,c) for(int i=a;i<b;i+=c)
typedef pair<ll , pair<ll, ll> > pi;
int pow(int x,int y){
int res=1;
while(y){
if(y&1) res*=x;
... | 0 | 95,423,475 |
#include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
bool isMale() {
string result;
cin >> result;
if (result == "Vacant") {
exit(0);
}
return result == "Male";
}
int main() {
int N;
cin >> N;
int left = 0;
int right = N - 1;
cout << 0 << endl;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int h1,m1,h2,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
int x =(h2-h1)*60+ m2-m1;
if(x-k>0){
cout<<x-k<<"\n";
}else{
cout<<0<<"\n";
}
return 0;
} | 0 | 46,376,982 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | 0 | 86,161,580 |
#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
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
c... | 0 | 18,486,320 |
#include<bits/stdc++.h>
using namespace std;
#define MP ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define For(i,n) for(int i=0;i<n;i++)
#define forn(i,n) for(int i=1;i<=n;i++)
#define fors(i,s) for(int i=0;i<s.size();i++)
#define all(v) v.begin(),v.end()
#define gcd(a, b) __gcd(a , b)
#... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define int long long
#define dip(type,var) type var; cin>>var;
#define dipi(x) int x; cin>>x;
#define w(x) int x; cin>>x; while(x--)
#define mka(... | 0 | 47,749,009 |
#pragma once
#include <stdio.h>
#include <sstream>
#include <string.h>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <limits>
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
int main(){
ll N, M; cin >> N >> M;
vector<vector<ll>> V(M);
vector<ll> P(M);
for(int i = 0; i < M; i++){
ll k; cin >> k;
... | 0 | 44,036,793 |
#include<bits/stdc++.h>
#define ford(i,a,b) for(int i=(a);i>=b;i--)
#define rep1(i,a,b) for(int i=(a);(i)<=(b);(i)++)
#define rep(i,a,b) for(int i=(a);(i)<(b);(i)++)
#define ll long long
#define N 105
#define pql priority_queue<ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define rev... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool cmp(pair<int, int> &a, pair<int, int> &b) { return a.second > b.second; }
int main() {
int n;
cin >> n;
vector<pair<int, int>> red(n), blue(n);
for (int i = 0; i < n; i++) {
cin >> red[i].first >> red[i].second;
}
for (... | 0 | 73,274,675 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
... | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=(... | 0 | 82,894,285 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
if(n%10 == n/10%10 && n/10%10 == n/100%10 || n/10%10 == n/100%10 && n/100%10 == n/1000){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> P;
#define REP(i, x, n) for(lint i = x ; i < n ; i++)
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for(lint i = n - 1 ; i >= 0 ; i--)
#define SORT(c) sort((c).begin(), (c).end())
const int IINF = 1e9 + 10;
const lint LLINF ... | 0 | 95,251,158 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
const int MOD = 1e9+7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
int a,b,c;
cin >> a >> b >> c;
int GCD = __gcd(a,b),cou... | #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()... | 0 | 38,929,664 |
#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 n,m,d; cin>>n>>m>>d;
double res=1.0/n;
if (d!=0) res*=2.0*(n-d)/n;
res*=(m-1.0);
cout<<setprecision(10)<<res<<endl;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 8,387,018 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define REP(i, d, n) for(int i=(d); i<(n); ++i)
#define all(v) v.begin(), v.end()
int main() {
int v, e;
cin >> v >> e;
const long long INF = 10000000000000000;
vector<vector<long long> > cost(v, vector<long long>(v... | #include <bits/stdc++.h>
using namespace std;
#define PER(ITER,TIMES) for(auto ITER = 0; ITER < TIMES; ++ITER)
#define FUCK(IT) #IT": " << IT << ": "
#define ALL(ITER) ITER.begin(), ITER.end()
void solve(void);
#define SOLVE_F
#ifdef SOLVE_E
void solve(void) {
int n;
cin >> n;
vector<int> a(n);
PER(i, n... | 0 | 76,539,804 |
#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 = vecto... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve()
{
string s;
cin >> s;
set<char> st;
bool ok = true;
rep(i, s.size())
{
... | 0 | 35,701,054 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long l... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1e9+7;
void solve(){
int n, k;
cin >> n >> k;
int a[n+1]={};
for(int i=1; i<=n; i++) {
cin >> a[i];
}
int dp[n+1][k+1]={};
dp[0][0]=1;
for(int i=1; i<=k; i++)
dp[0][i]=0;
for(int i=1; i<=n; i++){
vector<int> sum(k+1);
su... | 0 | 28,003,011 |
#include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int m,nmi,nma;
while(cin>>m>>nmi>>nma,m)
{
--nmi,--nma;
int p[m];
for (int i = 0; i < m; ++i) cin>>p[i];
int ans=-1,gap=-1;
for (int i = nmi; i <= nma; ++i)
{
if(p[i]-p[i+1]>=gap) ans=i,gap=p[i]-p[i+1];
}
cout<<a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) std::cerr << #x << " : " << (x) << std::endl;
long l... | 0 | 11,180,964 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
long long n,d,ans=0,dd,ddd;
cin>>n>>d;
long long x[n][d];
f(i,0,n){
f(j,0,d){
cin>>x[i][j];
}
}
f(i,0,n){
f(j,i+1,n){
dd=0;
f(k,0,d){
... | #include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
using namespace std;
int h,w,d;
int mp[2003][2003];
int main(){
cin>>h>>w>>d;
for(int i=0;i<=2000;i++){
for(int j=0;j<=2000;j++){
int tmp=((i/(d))%2)*2+(j/(d))%2;
mp[i][j]=tmp;
}
}
for(int ... | 0 | 41,381,742 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define ff first
#define ss second
#define INF (ll) (1e9)
#define mod (ll) (1e9 + 7)
#define endl "\n"
#define tt ll testcase; ci... | #include <iostream>
#include <string>
#include <cstring>
#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>
#incl... | 0 | 86,412,132 |
#include<iostream>
#include<map>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
int main(){
int max = 0, longest=0,i;
map<string,int> word, cnt;
string s, max_s, longest_s;
while(cin>>s){
word[s]++;
if(word[s]>max){
max = word[s];
max_s = s;
}
i=0;
wh... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define endl "\n"
int main()
{
i64 N, X, M;
cin >> N >> X >> M;
vector<i64> A(M + 2), sum(M + 2), ind(M + 1, -1);
A[1] = X;
sum[1] = X;
ind[X] = 1;
i64 loopStart, loopSize;
for (i64 i = 2; i <= M + 1; i++)
{
A[i] = (A[i - 1] * A[... | 0 | 65,745,406 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<math.h>
#include<string>
using namespace std;
struct card{
char e;
int n;
};
bool check(card *card1,card *card2,int N){
vector<bool>flag;
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(card2[i].n==card2[j].n){
for(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,k;
cin>>n>>k;
ll a[n],b[n];
ll ans = 0;
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
if((a[i] | k) <= k) ans += b[i];
}
for(int bit = 0; bit < 33; bit++){
... | 0 | 68,265,726 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <iostream>
using namespace std;
int main()
{
int n,b;
int a[100005];
cin >> n;
long long ans = 0;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b;
if (a[i] >= b) {
a[i] -= b;
ans += b;
... | 0 | 39,202,448 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll INF ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) ((x).begin()), ((x).end())
#define READ(x) (cin >> (x))
#define WRITE_N(x) (cout << (x) << endl)
#define WRITE(x) (cout << (x))
#define WRITE_YESN... | 0 | 32,437,977 |
#include<iostream>
#include<vector>
using namespace std;
int main() {
int point_number;
cin >> point_number;
vector<vector<int>>v(point_number);
for (int i = 0;i < point_number;i++) {
int point_name;
cin >> point_name;
v[i].push_back(point_name);
int adj_point_number;
cin >> adj_point_number;
v[i].push_... | #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 | 83,592,843 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll A,B,K;
... | #if 0
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int Q;
int L[1000+10][1000+10];
int main() {
cin >> Q;
string X, Y;
for (int i = 0; i < Q; i++) {
for (int j = 0; j < 1000+10; j++) {
L[0][j] = 0; L[j][0] = 0;
}
cin >> X >> Y;
for (int x = 1; x <= X.length(... | 0 | 90,653,912 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
ll n, ans = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
ans += i;
}
cout << ans << endl;
... | #include<stdio.h>
int main(){
int n,x;
while(true){
scanf("%d%d",&n,&x);
if (n==0&&x==0)break;
int a=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
for(int k=1;k<=n;k++){
if(i+j+k==x&&i<j&&j<k){
a++;
... | 0 | 87,527,409 |
#include <bits/stdc++.h>
#define int long long
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)a, i##_len=(b); i<i##_len; i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(box) box.begin(), box.end()
using namespace std;
using P... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long n,ans=0;
cin >>n;
vector<int>x(n);
for(int i=0;i<n;i++){
cin >> x[i];
ans+=pow(x[i],2);
}
for(int i=1;i<=100;i++){
long long res=0;
for(int j=0;j<n;j++){
res+=pow(x[j]-i,2);
... | 0 | 35,011,094 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( co... | #include <bits/stdc++.h>
#define INF 1000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
ll N, M, V, P;
vector<ll> A;
bool check(ll m)
{
if (m < P)
{
return true;
}
if (A.at(m) + M < A.at(P - 1))
{
return false;
}
ll S = 0;
S += (P - 1) * M;
S += (N - m) * M;
for (l... | 0 | 97,312,533 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
typedef pair<int64_t, int64_t> P;
vector<P> to[MAXN];
vector<int64_t> d(MAXN, -1);
void dfs(int v)
{
for (auto u : to[v])
{
if (d.at(u.first) == -1)
{
d.at(u.first) = d.at(v) + u.second;
dfs(u.first);
}
}
}
int main()
{... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S; cin >> S;
int black=0;
int white=0;
string S_c = S;
for(int i=0;i<S_c.length(); i++){
if(i==0){
if( S_c.at(i)=='0'){
S_c.at(i) = '1'; black++;
}
}else if(S_c.at(i-1)=='0' && S_... | 0 | 41,877,512 |
#include <bits/stdc++.h>
using namespace std;
int main() {
uint64_t N, C, K;
cin >> N >> C >> K;
vector<uint64_t> T(N);
for (uint64_t& t : T) {
cin >> t;
}
sort(T.begin(), T.end());
uint64_t num_buses = 0;
uint64_t time_limit = T[0] + K;
uint64_t num_people = 0;
for (uint... | #include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n;
cin>>n;
vector<ll>a(n);
rep(i,n)cin>>a[i];
vector<ll>b(0);
for(int i=n-1;i>=0;i-=2){
b.push_back(a[i]);
}
if(a.size()%2==0){
for(int i=0;i<n;i+=... | 0 | 44,457,826 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N;cin>>N;
vector<double>a(N);
ll sum=0;
ll sek... | #include <cstdio>
using namespace std;
int main()
{
int a,x=1,b,i=0;
scanf("%d",&a);
int A[a];
while(i<a){
scanf("%d",&A[i]);
i++;
}
b=A[0];
i=1;
while(i<a){
if(A[i]<b)
{
b=A[i];
x++;
}
i++;
}
printf("%d\n",x... | 0 | 48,819,887 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | #define _USE_MATH_DEFINES
#include<stdio.h>
#include<string>
#include<iostream>
#include<cctype>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include <algorithm>
#include<math.h>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
int main() {
int n;
cin>>n;
vector<vector<int>>t(... | 0 | 89,265,227 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, n, min, ans;
map<int, bool> P;
cin >> x >> n;
if (n == 0){
cout << x << endl;
return 0;
}
for (int i = 0; i < n; i++){
int p;
cin >> p;
P[p] = true;
}
min = x;
ans = 0;
for (int i = 1; i < 102; i++){
if (P[i]) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define mod2 998244353
#define pii pair<ll,ll>
#define pb push_back
#define debug(a) { cout << #a << " = " << a << endl;}
void sep() {
cout << "-------------BLOCK-----------------\n";
}
template<typename T>
void debugv(vector<... | 0 | 92,458,514 |
#include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> G(4);
vector<bool> visited(4);
void dfs(int cur,int pre){
if(G[cur].size() == 0) return;
visited[cur] = true;
for(auto a : G[cur]){
if(a == pre) continue;
if(visited[a]) continue;
else {
dfs(a,cur);
... | 0 | 78,738,369 |
#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>;
using matrix = vector<vector<ll>>;
#defin... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N, H;
cin >> N >> H;
int a_max = 0;
int b[N];
for(int i=0; i<N; i++){
int a;
cin >> a >> b[i];
a_max = max(a, a_max);
}
int cnt = 0;
sort(b, b + N, greater<int>());
for(int i=0; i<... | 0 | 5,800,855 |
#include<iostream>
using namespace std;
int main() {
int a, b;
cin>> a >> b;
if((a*b)%2 == 0){
cout << " Even " << endl;
}
else cout << " Odd " << endl;
} | #include <iostream>
using namespace std;
const int MOD = 1000000007;
long long modPow(long long a, long long n) {
if (n == 1) return a;
if (n % 2) {
return a * modPow(a, n - 1) % MOD;
} else {
return modPow(a * a % MOD, n / 2);
}
}
long long nCr(long long n, long long r) {
long long ... | 0 | 94,539,299 |
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
using namespace std;
typedef long long ll;
const int MAXN = (int)3e5 + 2;
int N;
int cnt[MAXN] = {0}, pre[MAXN] = {0};
int pos[MAXN] = {0};
int f[MAXN] = {0}, ans[MAXN] = {0};
int main()
{
cin >> N;
for (int i = 1; i <= N; i++)
{
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is... | 0 | 65,411,867 |
#include <iostream>
using namespace std;
int main(){
int H[25565] = {0};
int W[25565] = {0};
int i;
do{
cin >> H[i] >> W[i];
i++;
}while(H[i-1] != 0 && W[i-1] != 0);
i = 0;
do{
for(int j=0;j<W[i];j++){
cout << "#";
}
cout << endl;
for(int j=0;j<H[i]-2;j++){
cout << "#";
for(int k=0;k<W[i]-2... | #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;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | 0 | 19,497,247 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
int n, k, r, s, p;
string t;
map<char,int>mp;
cin >> n >> k >> mp['s'] >> mp['p'] >> mp['r'] >> t;
vector<vector<char>>v(k);
rep(i, n){
v[i%k].push_back(t.at(i));
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N;
cin >> N;
vector<ll> A(N+1), B(N);
for(int i=0; i<=N; i++) cin >> A[i];
for(int i=0; i<N; i++) cin >> B[i];
ll ans = 0;
for(int i=0; i<N; i++){
if(A[i]>=B[i]){
A[i] -= B[i];
ans += B[i];
}else{
B... | 0 | 86,343,530 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
long long modpow(long long a, long long n, long long m)
{
long long ans = 1;
while (n)
{
if (n & 1)
{
ans = (ans * a) % m;
}
a ... | #include <iostream>
#include <complex>
using namespace std;
#define REPEAT(i,a,b) for(int i=(a); i<(b); i++)
#define REP(i, n) REPEAT(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define X real()
#define Y imag()
typedef double D;
typedef complex<double> P;
const double EPS = 1e-9;
const int INF = 10... | 0 | 24,790,664 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int s[100];
int sum;
cin >> n;
while(n > 2){
for(int i=0; i<n; ++i){
cin >> s[i];
}
sort(s, s+n);
sum=0;
for(int i=1; i<(n-1); ++i){
sum+=s[i];
}
cout << sum/(n-2) << endl;
cin >> n;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 67,220,907 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int,int> pii;
typedef p... | #include <stdio.h>
#include <set>
#include <utility>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j, k, n, m, ans = 0;
scanf("%lld%lld", &n, &k);
if(k == 1) {
printf("0");
return 0;
}
ll sum[n + 1], a[n];
sum[0] = 0;
set< pair<ll, ll> > s;
set< pair<ll, ll> >::iterator it;
... | 0 | 82,897,352 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int N,M;
cin>>N>>M;
vector<int> wa(N,0);
vector<bool> ac(N,false);
rep(i,M)
{
int p;
cin>>p;
string s;
cin>>s;
p--;
if(s=="AC")
{... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
... | 0 | 3,069,540 |
#include <queue>
#include <vector>
#include <iostream>
using namespace std;
int N, a, b, deg[100009]; vector<int> g[100009];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> N;
for (int i = 1; i < N; i++) {
cin >> a >> b; a--, b--;
g[a].push_back(b);
g[b].push_back(a);
deg[a]++;
deg[b]++;... | #include <bits/stdc++.h>
#define newline printf ("\n")
#define space printf (" ")
#define cinfalse ios::sync_with_stdio(false)
#define fread(a) freopen (a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rint register int
#define For(i, a, b) for (rint i = a; i <= b; i ++)
#define Low(i, a, b) for (rint i = a; ... | 0 | 92,210,954 |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int H, W; cin >> H >> W;
vector<string> S(H);
rep(i, H){
cin >> S[i];
}
int ans[H][W];
rep(i, H){
rep(j, W){
ans[i][j] = 0;
}
}
... | 0 | 89,907,569 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <map>
const int MOD = 1e9+7;
typedef long long ll;
using namespace std;
int main(){
int n, k;
cin >> n >> k;
if (n % k) cout << 1 << endl;
else cout << 0 << en... | #include<cstdio>
using namespace std;
int upd(int x){
if(x == 1){
x = 9;
}
else if(x == 9){
x = 1;
}
return x;
}
int main(){
int n;
while(~scanf("%d", &n)){
int x = n/100, y = n%100/10, z = n%10;
x = upd(x);
y = upd(y);
z = upd(z);
prin... | 0 | 54,761,775 |
#include<iostream>
using namespace std;
int main(){
int x,a,b;
cin >> x;
cin >> a;
cin >> b;
if(a >= b)
cout << "delicious" << endl;
else if(b-a < x+1)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
} | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const ll MOD=1e9+7;
int main(){
double a, b, x;
cin >> a >> b >>... | 0 | 12,882,109 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << v[k-1] << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
using namespace std; using ll = long long; using ld = long double; ... | 0 | 15,952,430 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0; i<(n); i++)
const long long INF = numeric_limits<long long>::max();
int main(){
string S, T;
cin >> S >> T;
vector<int> s(26, -1), t(26, -1);
int count_s = 0, count_t = 0;
rep(i, S.size()){
char c_s = S[i] - ... | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(void){
int n;
cin>>n;
vector<ll> v(n);
rep(i, n) cin>>v[i];
vector<ll> sum(n+1);
rep(i, n){
sum[i+1] = sum[i]+v[i];
}
map<ll, ll> mp;
rep(i, n+1){
mp... | 0 | 96,319,953 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | #include<bits/stdc++.h>
#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 fore(i,a) for(auto &i:a)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll;
#define INF INT_MAX/2
string S... | 0 | 36,807,611 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> vec(N+1, 0);
for(int m=0; m<M; m++) {
int a, b;
cin >> a >> b;
vec[a]++;
vec[b]++;
}
for(int n=1; n<=N; n++) {
if(vec[n]%2!=0) {
cout <... | #include<iostream>
#include<algorithm>
using namespace std;
int a[300010];
int b[300010];
int sum[300010];
int ans[300010];
int main(){
int n;cin>>n;
for(int i=1;i<=n;i++){
int tmp;cin>>tmp;a[tmp]++;
}
int m=0;
for(int i=1;i<=n;i++) if(a[i])b[++m]=a[i];
sort(b+1,b+m+1);
for(int i=1;i... | 0 | 71,709,870 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Arra... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <utility>
#include <queue>
#include <map>
#include <deque>
#include <assert.h>
#include <stack>
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_bac... | 0 | 46,277,959 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main() {
ll a ; cin >> a;
double b; cin >> b;
... | #include<stdio.h>
int main(){
int a,ten[100],i,max=0,min=1000,sum=0,ave=0;
while(1){
max=0;
min=1000;
sum=0;
ave=0;
scanf("%d",&a);
if(a==0)break;
else{
for(i=0;i<a;i++){
scanf("%d",&ten[i]);
}
for(i=0;i<a;i++){
if(max<ten[i]){
max=ten[i];
}
}
for(i=0;... | 0 | 73,661,722 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
int sum = 0;
cin >> s >> t;
for(int i=0; i < s.size(); i++){
if(s.at(i) != t.at(i)){
sum += 1;
}
}
cout << sum << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | 0 | 86,626,285 |
#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define pf push_front
#define pof pop_front
#define pob pop_back
#define ull unsigned long long
#define ll long long
#define sz(a) a.size()
#define all(s) s.begin(), s.end()
#define rall(s, n) s, s + n
#define x f... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long... | 0 | 14,255,195 |
#include <iostream>
using namespace std;
int main(){
long long i,n,ans,tmp;
cin >> n;
ans = n-1;
for(i=2;i*i<=n;++i){
if(n%i!=0) continue;
ans = n/i+i-2;
}
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, int> P;
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; } ret... | 0 | 16,041,777 |
#include <cstdio>
int main(){
int i, j, n, u, k, v;
scanf("%d",&n);
int A[n][n];
for(i=0;i<n;i++){
for(j=0;j<n;j++){
A[i][j]=0;
}
}
for(i=0;i<n;i++){
scanf("%d %d",&u,&k);
for(j=0;j<k;j++){
scanf("%d",&v);
A[u-1][v-1] = 1;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b,c,k,sum=0;
cin >> a >> b >> c >> k;
whil... | 0 | 49,372,412 |
#include<iostream>
#include<cstdio>
#include<random>
using namespace std;
struct Dice
{
int Top, Front, Right, Left, Back, Bottom;
};
void roll (Dice &d1, int r);
int main()
{
Dice d1;
cin >> d1.Top >> d1.Front >> d1.Right >> d1.Left >> d1.Back >> d1.Bottom;
int q;
cin >> q;
for (int a, b; q > 0; q--)
{
cin >... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define rep(i, a, n) for (int i = a; i < n; ++i)
int main() {
int w, h, n;
cin >> w >> h >> n;
int x1 = 0, y1 = 0;
rep(i, 0, n) {
int x, y, a;
cin >> x >> y >> a;
if (a == 1) {
x1 = ma... | 0 | 11,598,757 |
#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<functional>
#include<cassert>
#include<numeric>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<queue>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef std::pair<int, int> P;
typedef vector<int... | 0 | 87,035,873 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string a;
while(true){
int count=0;
cin>>a;
if(a=="0")
break;
for(int i=0;i<a.size();i++){
if(a[i]=='1')
count+=1;
if(a[i]=='2')
count+=2;
if(a[i]=='3')
count+=3;
if(a[i]=='4')
count+=4;
if(a[i]=='5')
count+=5;
if(a[... | #include <iostream>
char grade(int m,int f, int r)
{
int sum = m+f;
if(m == -1 || f == -1){
return 'F';
}else if(sum>= 80){
return 'A';
}else if(sum >= 65){
return 'B';
}else if(sum >= 50){
return 'C';
}else if(sum >= 30){
if(r >= 50){
return 'C';
}else{
return 'D';
}
}else{
return 'F';
}
... | 0 | 49,477,849 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.