code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
#include <string>
using namespace std;
class Dice{
private:
int D1;
int D2;
int D3;
int D4;
int D5;
int D6;
public:
Dice(int d1,int d2,int d3,int d4,int d5,int d6){
D1=d1;
D2=d2;
D2=d2;
D3=d3;
D4=d4;
D5=d5;
D6=d6;
}
void roll(char dire){
int dd1=D1;
int dd2=D2;
... | #include <iostream>
#include <algorithm>
#include <array>
#include <string>
class Dice{
public:
std::array<int, 6> state;
Dice(bool isRight=false):state(std::array<int, 6>{{1, 2, (!isRight)?3:4, (!isRight)?4:3, 5, 6}}){}
Dice(std::array<int, 6> d, bool isRight=false):state(d){if(isRight){int tmp=state[2... | 1 | 55,077,728 |
#include <cstdio>
#include <cstdlib>
#include <sstream>
#include <iostream>
#include <vector>
#include <string>
using namespace std;
class Node {
public:
Node *prev;
Node *next;
int value;
Node(int value) {
this->value = value;
prev = NULL;
next = NULL;
}
};
class LinkedList {
Node *first;
No... | #include<iostream>
#include<string>
#include<list>
using namespace std;
int main(){
int n;
list<int> N;
cin >> n;
string command;
int a;
for(int i=0; i<n; i++){
cin >> command;
if(command=="insert"){
cin >> a;
N.push_front(a);
}else if(command=="de... | 1 | 20,242,651 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.1415926535897932384;
const int INF = 1000000000;
const int64_t LINF = 1000000000000000;
int ctoi(char c){
if (c == '0') {
return 0;
}
if (c == '1') {
return 1;
}
if (c == '2') {
return 2;
}
if (c == '3') {
return 3;
}
... | 1 | 95,420,665 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll k,n; cin>>k>>n;
ve... | 1 | 5,419,964 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s;cin>>s;
int cnt=0;
rep(i,s.size()){
if(s[i]=='o')cnt++;
}
if(15-s.size()+cnt>=8)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#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++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define ... | 1 | 85,357,966 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(i) cout<<fixed<<i<<endl
using namespace std;
using ll = long long;
int main(){
string s; cin >> s;
ll cnt = 0;
for(int i = 0; i < s.size()-1; i++){
if(s[i] != s[i+1]) cnt++;
}
put(cnt);
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int ans=0;
for(int i=0;i<s.size()-1;++i)
{
if(s.at(i)!=s.at(i+1)) ans++;
}
cout << ans;
return 0;} | 1 | 17,307,171 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(){
vector<int> ans;
while(1){
string str;
getline(cin,str);
if(str=="0") break;
int sum=0;
for(int i=0; i<(int)str.size(); i++){
sum+=str[i]-'0';
}
ans.push_back(sum);
}
for(int i=0; i<ans.size(); i++) cout<<ans[i]<<... | #include<cmath>
#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cctype>
#include<cstring>
using namespace std;
int main() {
char x[1001];
while (1) {
int sum = 0;
cin >> x;
if (x[0] == '0')break;
for (int i = 0; x[i]; i++) {
sum += (x[i] - '0');
}
cout << sum << endl;
}
return 0;
} | 1 | 29,527,026 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begi... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef l... | 1 | 99,308,156 |
#include <iostream>
int main()
{
int X, A, B;
std::cin >> X >> A >> B;
if (B - A <= 0)
{
std::cout << "delicious" << std::endl;
}
else if (0 < B - A && B - A <= X)
{
std::cout << "safe" << std::endl;
}
else
{
std::cout << "dangerous" << std::endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int x, a, b;
scanf("%d%d%d", &x, &a, &b);
if(b > a + x) printf("dangerous\n");
else if(b <= a) printf("delicious\n");
else printf("safe\n");
} | 1 | 81,140,644 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <climits>
using namespace std;
#define MOD int(1e9 + 7)
#define INF (long long)(1e18)
int main()
{
long long N;
vector<long long> A;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <time.h>
#define ll ... | 1 | 68,354,367 |
#include<bits/stdc++.h>
using namespace std;
string chk(string s,int a){
char c = '0'+a;
s = s+c;
sort(s.begin(),s.end(),greater<char>());
return s;
}
int main(){
int n,m;
cin >> n >> m;
int a[m];
for(int i=0;i<m;i++)cin >> a[i];
int mat[10] = {-1,2,5,5,4,5,6,3,7,6};
vector<strin... | #include<bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
template<class Ty>
using passive_queue = priority_queue<Ty, vector<Ty>, greater<Ty>>;
struct Problem {
void Solve() {
UL N; cin >> N;
... | 1 | 59,823,323 |
#include <iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int count;
for (int i = a; i <= b; i++)
if (c % i == 0)
count++;
cout << count << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int a, b, c,ans,q;
int count = 0;
cin >> a >> b >> c;
for (int i = 1; i<=c; ++i){
if (c%i==0){
for (int j = 0;a+j<=b;++j){
ans = a + j;
if (i==ans){
count = count + 1;
}
}
}
}
cout << count<<endl;
cin >> q;
} | 1 | 91,554,084 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int H, W;
cin >> H >> W;
vector<string> G(H);
rep(i, H) cin >> G.at(i);
vector<vector<string>> a(H, vector<string>(W));
rep(i, H) rep(j, W) a.at(i).at(j) = G.at(i).at(j);
rep(i, H) {
... | 1 | 49,768,755 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv)
{
int A, B;
cin >> A >> B;
if (A > 8 || B > 8)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(max(a,b)>8){
cout<<":(";
}else{
cout<<"Yay!";
}
return 0;
} | 1 | 14,496,249 |
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
vector<vector<ll>> bunkai(ll a){
if(a<=0... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 1 | 770,626 |
#include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
... | #include <cstdio>
#include <algorithm>
#include <climits>
typedef long long ll;
const int max_t = 20;
ll dist[max_t][max_t];
int main() {
while (1) {
int n, t = 0;
scanf("%d", &n);
if (n == 0) break;
for (int i = 0; i < max_t; i++) {
std::fill(dist[i], dist[i] + max_t, INT_MAX);
}
for (int i = 0; i < n;... | 1 | 6,963,611 |
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
ll n, m, t;
cin >> n;
m = n;
t = 0;
while (0 < m)
{
t++;
m ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int ans = 0;
for(int i = 1; i <= N; i++){
string str = to_string(i);
if(str.size() % 2 == 1)
ans++;
}
cout << ans << endl;
return 0;
} | 1 | 4,038,859 |
#include <bits/stdc++.h>
using ll = long long;
#define int long long
#define reps(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) reps(i, 0, (a))
#define rreps(i, a, b) for (int i = (int)((a)-1); i >= (int)(b); i--)
#define rrep(i, a) rreps(i, a, 0)
#define all(v) (v).begin(), (v).end()
#define PER... | #include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
void b(int a,int count){
if(a == 1){
if(count%5==1) cout <<".";
else if(count%5==2) cout <<",";
else if(count%5==3) cout <<"!";
else if(count%5==4) cout <<"?";
e... | 1 | 29,823,027 |
#include <cstdio>
typedef long long int lli;
int main()
{
lli K;
scanf("%lld", &K);
lli p = K / 50;
lli q = K % 50;
printf("50\n");
for (int i = 0; i < q; i++)
printf("%lld ", 100 - q + p);
for (int i = 0; i < 50 - q; i++)
printf("%lld ", 49 - q + p);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) ... | 1 | 93,163,263 |
#include <iostream>
using namespace std;
int main()
{
long long n, sub = 10, ans = 0, sub2 = 50, sub4 = 2;
cin >> n;
if(n % 2 != 0)
{
cout << 0 << endl;
}
else
{
while(sub <= n)
{
ans += n / sub;
sub *= 5;
}
cout << ans << endl;... | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
typedef vector<int> vec;
typedef vector<int64> vec64;
#define db(x) cout << "> " << #x << ": " << x << "\n";
#define ss cout << " ";
#define ct(x) cout << x;
#define nn cout << "\n";
#define cts(x) cout << x << " ";
#define ctn(x) cout << x << "\n";... | 1 | 99,805,250 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<int> p(a), q(b), r(c);
for(int i = 0; i < a; i++) cin >> p[i];
for(int i = 0; i < b; i++) cin >> q[i];
for(int i = 0; i < c; i++) cin >> r[i];
s... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<long long> p(a);
vector<long long> q(b);
vector<long long> r(c);
for(long long i = 0; i < a; i++) cin >> p[i];
for(long ... | 1 | 6,763,205 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
unsigned long long n,m;
cin>>n>>m;
if (n>=(m/2)){
cout<<m/2;
}else{
cout<<n+(m-2*n)/4<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll s, c;
cin >> s >> c;
ll ans = 0;
ll t = c / 2;
if (s > t) {
cout << t;
return 0;
}
else {
ans += s;
c -= (s * 2);
ans += (c / 4);
}
cout << ans;
return 0;
} | 1 | 29,232,277 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
int r = x / 100;
x %= 100;
int count = 0;
while(x >= 5){
x -= 5;
count ++;
}
while(x >= 4){
x -= 4;
count++;
}
while(x >= 3){
x -= 3;
count++;
}
while... | 1 | 72,470,998 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend();
#define isS... | #include<bits/stdc++.h>
using namespace std;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,a;
cin>>n>>a;
cout<<(n*3+a)/2;
return 0;
} | 1 | 91,743,054 |
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]){
string s;
string p;
getline(cin, s);
getline(cin, p);
string s2 = s + s;
if (s2.find(p) == string::npos){
cout << "No\n";
} else {
cout << "Yes\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t; cin >> s >> t;
s += s;
for (int i = 0; i < s.size()-t.size()+1; ++i) {
if ( s.substr(i, t.size()) == t ) {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
} | 1 | 10,454,465 |
#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)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
usi... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <locale>
#include <cctype>
#include <sstream>
#include <iomanip>
#include <queue>
#include <bitset>
#include ... | 1 | 49,029,706 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool condition( int *a , int n)
{
for(int i=0;i<n;i++)
{
if( a[i] >0)
return false;
}
return true;
}
int main()
{
int n;
cin>>n;
int h[n];
for(int i=0;i<n;i++)
{
cin>>h[i];
}
ll ans... | #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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | 1 | 51,212,509 |
#include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pii pair<int,int>
#define pb push_back
#define r1 rt<<1
#define r2 rt<<1|1
#define fi first
#define se second
#define ri register int
#define rep(i,a,b) for(ri i=(a);i<=(b);++i)
#define rep2(i,a,b,c) for(ri i=(a);i<=(b);i+=(c))
#define REP(i,a,b)... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define MAX 305
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
ll INF=1ll<<55;
int n, k;
int H[MAX];
ll dp[MAX][MAX];
int main(){
cin >> n >> k;
rep(i,n){
cin >> H[i+1];
}
... | 1 | 46,220,175 |
#include<bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector <long long> t(N+1, 0);
vector <long long> x(N+1, 0);
vector <long long> y(N+1, 0);
for (long long i=1; i<=N; i++) {
cin >> t.at(i) >> x.at(i) >> y.at(i);
}
bool ok=true;
for (long long i=1... | #include <bits/stdc++.h>
using namespace std;
const string YES = "Yes";
const string NO = "No";
int solve(long long N, std::vector<long long> t, std::vector<long long> x, std::vector<long long> y)
{
for (int i = 1; i <= N; i++)
{
long long dt = t[i] - t[i - 1];
long long dx_dy = abs(x[i] - x[i -... | 1 | 10,911,231 |
#include<bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int ans = a - (b + c);
if(ans >= 0) {
cout << 0;
return 0;
}
if(ans < 0){
cout << -1 * ans;
return 0;
}
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int youki1 = A - B;
int youki2 = C - youki1;
if (youki2 >= 0) {
cout << youki2 << endl;
} else {
cout << 0 << endl;
}
} | 1 | 41,601,376 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int a[5];
rep(i,5) cin >> a[i];
int dmax = 0;
int idmax = 4;
rep(i,5){
int d = 10*ceil(0.1*a[i]) - a[i];
if (d>dmax) {
dmax = d;
idmax = i;
}
}
int tmp = a[idmax];
a[idmax] =... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
int main(){
int a,b,c,d,e;
cin>>a>>b>>c>>d>>e;
vector<int> time={a,b,c,d,e};
vector<int> index={0,1,2,3,4};
int Besttime=(int) 1e+9;
do{
int nowtime=0;
rep(i,5... | 1 | 21,157,973 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, char const *argv[])
{
int h, w;
while(true)
{
cin >> h >> w;
if (h == 0 && w == 0) {
break;
}
for(int i = 0; i < h; i++)
{
for(int j = 0; j < w; j++)
{
... | #include <iostream>
using namespace std;
int main()
{
int H, W;
while(true){
cin >> H >> W;
if(H==0&W==0) break;
else {
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(i==0|i==H-1|j==0|j==W-1){
cout << "#";
}
else cout << ".";... | 1 | 61,794,549 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
K = min(K, 1000);
vector<int> A(N + 1);
REP(i, N) cin >> A[i];
... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
typedef long long ll;
const ll MOD = 1e9+7;
const ll INF = 1e9+5;
int a[200005];
int s[200005];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i=0 ; i<n ; i++) {
scanf("%d", a+i);
}
if... | 1 | 48,784,435 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MAX_INF 0x3f
#define MAX_INF_VAL 0x3f3f3f3f
#define MAX_INF_VAL_LL 0x3f3f3f3f3f3f3f3f
#define pi 3.141592653589
#define eps 1e-6
using namespace std;
ll gcd( ll, ll );
int main() {
ll x, y;
scanf( "%lld%lld", &x, &y );
printf( "%lld... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b){
if(a%b==0){
return b;
}else{
return gcd(b,a%b);
}
}
long long lcm(long long a, long long b){
return a*b/gcd(a,b);
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<set... | 1 | 3,128,997 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(... | #include <iostream>
#include <vector>
struct Node
{
int num_of_child;
std::vector<int> child;
int parent;
int depth;
std::string type;
};
void init(Node tree[], int id, int parent, int parent_depth)
{
tree[id].parent = parent;
tree[id].depth = parent_depth + 1;
if (tree[id].parent == -1)
{
tree[id... | 1 | 1,110,501 |
#include <iostream>
#define ll long long
using namespace std;
ll arr[100005];
ll prefp[100005];
ll prefsum[100005];
int main() {
int n, k;
cin >> n >> k;
prefp[0] = 0;
prefsum[0] = 0;
for (int i = 1; i <= n; i++){
cin >> arr[i];
if (i == 1){
prefsum[i] = arr[i];
if (arr[i] > 0)
pre... | #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... | 1 | 17,159,564 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0)
#define endl "\n";
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define int long long
const int MOD=1e9+7;
const int N=3e5+10;
int a[N];
int pow(int a, int b, int m)
{
int a... | 1 | 11,519,136 |
#include <bits/stdc++.h>;
using namespace std;
int main() {
int N, num;
num=0;
cin >> N;
for (int i = 1; i <= N; i++) {
if (i >= 10 && i <= 99) {
continue;
} else if (i >= 1000 && i <= 9999) {
continue;
} else if (i >= 100000 && i <= 999999) {
... | #include <bits/stdc++.h>
using namespace std;
int keta(int x){
int sum=0;
while(x>0){
x/=10;
sum++;
}
return sum;
}
int main() {
int n;
cin >> n;
int ans=0;
for(int i=1;i<=n;i++){
if(keta(i)%2==1){
ans++;
}
}
cout << ans;
} | 1 | 55,279,871 |
#include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ? "P... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
string res[N];
cout << 0 << endl;
string s;
cin >> s;
int left = -1;
int right = -1;
if (s == "Vacant") return 0;
cout << N - 1 << endl;
string t;
cin ... | 1 | 38,060,681 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N);
for (int n = 0; n < N; ++n) {
cin >> A[n];
}
vector<int>copyA = A;
sort(copyA.begin(), copyA.end(), std::greater<int>());
int top = copyA[0];
int next = copyA[1];
for (int n = 0; n < N; ++n) {
if (top == A[n]) {
... | #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... | 1 | 40,674,381 |
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
using namespace std;
int main() {
vector<int> result;
string n;
string input;
getline(cin, n);
getline(cin, input);
istringstream iss(input);
string num;
while (getline(iss, num, ' ')) {
... | #include <stdio.h>
#include <stdint.h>
#include <iostream>
using namespace std;
int main()
{
int n;
int64_t a[10000];
cin >> n;
int64_t min = 1000000 + 1, max = -1000000 - 1, sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
min = std::min(min, a[i]);
max = std::max(max, a[... | 1 | 56,692,423 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, a, b; cin >> k >> a >> b;
cout << ((a + k - 1) / k * k <= b ? "OK" : "NG") << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a,b;
cin>>n>>a>>b;
int k=a/n;
if(a%n!=0) k++;
if(k*n<=b)
{
cout<<"OK\n";
}
else
{
cout<<"NG\n";
}
} | 1 | 46,131,914 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
A += B;
C += D;
if (A > C) cout << "Left" << endl;
else if (A =... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <set>
using namespace std;
void solve(){
int a, b, c, d; cin >> a >> b >> c >> d;
string ans;
if(a + b > c + d) ans = "Left";
else if(a + b < c + d) ans = "Right";
else ans = "Balanced";
cout << ans << endl... | 1 | 42,871,980 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int N, K;
cin >> N >> K;
map<int, int> m;
for (int i = 0; i < K; i++)
{
int d;
cin >> d;
for (int j = 0; j < d; j++)
{
int a;
cin >> a;
m[a]++;
... | #include <iostream>
#include <map>
using namespace std;
int main()
{
int n,k,x, b;
map <int, int>cnt;
cin >> n >> k;
for(int i=1; i<=k; i++){
cin >> x;
for(int j=0; j<x; j++){
cin >> b;
cnt[b]++;
}
}
cout << n - cnt.size();
return 0;
} | 1 | 96,463,576 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
int tot = 0;
rep(i,N+1){
int tmp = 0;
int k = i;
rep(j,5){
tmp += k%10;
k /= 10;
}
if (A<=tmp && tmp<=B) tot += i;
}
cout << tot << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, sum_all = 0;
cin >> N >> A >> B;
for (int i = 1; i <= N; ++i) {
int sum = 0;
int tmp = i;
while (tmp > 0) {
sum += tmp % 10;
tmp /= 10;
}
if (sum >= A && sum <= B) sum_all += i;
}
cout << sum_all << endl;
... | 1 | 43,341,351 |
#include <iostream>
#include <queue>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <math.h>
#include <array>
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int H,W;
string board[405];
int memo[405][405][2];
bool used[405][... | #include <cassert>
#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 <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#in... | 1 | 73,250,297 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
int main(){
int x,y;
cin >> x >> y;
int a,b;
a = y-2*x;
b = 4*x-y;
if(a>=0 && b>=0 && a%2==0 && b%2==0){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
int f = 0;
for(int i=0;i<=x;i++){
int a = i;
int b = x-i;
if(a*2 + b*4 == y){
f = 1;
break;
}
}
if(f) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
... | 1 | 94,050,543 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
int main(void) {
int h, w;
cin >> h >> w;
vector<vector<string>>s(h, vector<string>(w));
char alpha[27] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char ans;
int ans_;
f... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;
int inf = 1000000000;
int main(void) {
int h, w;
cin >> h >> w;
for(int i=0; i<h; i++){... | 1 | 42,555,529 |
#include<cstdio>
using ull = unsigned long long;
int main(){
ull A, B;
scanf("%llu %llu", &A, &B);
ull begin = A + 1 >> 1 << 1;
begin += B + 1 - begin >> 2 << 2;
ull ans = A & 1 ? A : 0;
for (ull i = begin; i <= B; ++i){
ans ^= i;
}
printf("%llu\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 1 | 63,500,901 |
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int leftCount = 0;
int rightCount = 0;
int count = 0;
for(int i = 0; i < n; ++i) {
if(count == 0 && s[i] == ')')
leftCount++;... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | 1 | 45,407,578 |
#include <iostream>
#include <cstring>
using namespace std;
char s[1100],t[1100];
int ans=2333333;
int main(void)
{
cin>>s>>t;
int ls=strlen(s),lt=strlen(t);
for(int i=0;i<=ls-lt;i++)
{
int k=0;
for(int j=0;j<lt;j++)
{
if(s[i+j]!=t[j])k++;
}
ans=min(an... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
int minCount = t.size();
for(unsigned int i = 0; i < s.size()-t.size()+1; i++){
int count = 0;
for(unsigned int j = 0; j < t.size(); j++){
if(s.at(i+j) != t.at(j)){
count++;
}
}
if(co... | 1 | 5,957,174 |
#include <iostream>
using namespace std;
int T[100][100];
void init(){
for (int i = 0; i < 100; ++i)
{
for (int j = 0; j < 100; ++j)
{
T[i][j] = 0;
}
}
}
void DispTable(int n){
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
cout << T[i][j];
if(j!=n-1) cout << " ";
}
cout << endl... | #include <iostream>
using namespace std;
int main() {
int n, id, k, v, matrix[100][100] = { 0 };
cin >> n;
for (int i = 0; i < n; i++) {
cin >> id >> k;
for (int j = 0; j < k; j++) {
cin >> v;
matrix[id - 1][v - 1] = 1;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
cout << ma... | 1 | 19,171,796 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string S, T;
cin >> S;
cin >> T;
string subT = T.substr(0, T.size() - 1);
if (S == subT) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
#include <string>
int main()
{
std::string a, b;
std::cin >> a;
std::cin >> b;
int l = a.length();
if (a == b.substr(0, l)) std::cout << "Yes" << std::endl;
else std::cout << "No" << std::endl;
return 0;
} | 1 | 54,397,020 |
#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<stdio.h>
int main(){
char n;
scanf("%c",&n);
if (n >= 'A' && n <= 'Z'){
printf("A");
}
else{
printf("a");
}
return 0;
} | 1 | 65,816,382 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define in insert
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define debug(x) cerr<<#x<<" : "<<x<<endl
#define txtin freopen("input.txt","r",stdin)
#define txtout freopen("output.txt","w",stdout)
#define pii... | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uni... | 1 | 1,665,552 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main ()
{
string s1, s2;
cin >> s1;
cin >> s2;
int len1 = s1.length() + 1;
int len2 = s2.length() + 1;
vector< vector<int> > mat;
mat.resize(len1);
for (int i = 0; i < len1; ++i)
{
... | #include <bits/stdc++.h>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define _GLIBCXX_DEBUG
void printv(vector<int> v) {
for (int i : v)
cout << i << " ";
cout << endl;
}
int main() {
strin... | 1 | 56,176,532 |
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b... | 1 | 40,830,513 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
double a, n,i,j,p,m;
cin>>n;
vector<double>v;
for(i=0; i<n; i++)
{
cin>>a;
v.push_back(a);
}
sort(v.begin(), v.end());
p = v[0];
for(i=1; i<v.size(); i++)
{
m = (p + v[i])/2;
p = m;
}
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
double A[N];
for(int i=0;i<N;i++){
cin>>A[i];
}
for(int i=0;i<N-1;i++){
sort(A,A+N);
A[0]=(A[0]+A[1])/2;
A[1]=1001;
}
cout<<A[0]<<endl;
} | 1 | 61,856,783 |
#include<string>
#include<iostream>
#include <algorithm>
#include<vector>
#include<functional>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <numeric>
#include <math.h>
#include <map>
#define ll long long
#define PI 3.14159265358979323846
#define INF 10000000000
#define rep(i,n) for(ll i=0;i<(ll)n;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 n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
rep(i, min(n, k)) h.pop_back();
ll ans = 0;
... | 1 | 4,337,192 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,k,x,y,ans=0;
cin>>n>>k>>x>>y;
ans=min(n,k)*x;
if(n>k){
ans+=((n-k)*y);
}
cout<<ans<<"\n";
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | 1 | 77,708,179 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <math.h>
#include <assert.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constex... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | 1 | 87,044,966 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,m;
cin >> n >> m;
if(n%2==1){
for(int i=1;i<=m;i++){
cout << i << " " << (n-i) << endl;
}
}
else{
int k = (m+1)/2;
for(int i=1;i<=k;i++){
cout << i << " " ... | #include <iostream>
using namespace std;
int main(){
long long N, M;
cin >> N >> M;
if (M % 2){
for (int i = 0; i < M/2; i++){
cout << i + 1 << " " << M - i << endl;
}
for (int i = 0; i < M/2 + 1; i++){
cout << M + i + 1 << " " << 2 * M - i + 1 << endl;
}
} else {
for (int i = 0; i < M/2; i++){
c... | 1 | 73,013,976 |
#include <bits/stdc++.h>
using namespace std;
int getDays(int y, int m, int d)
{
int cnt = 0;
for(int i = 1; i <= y; i++){
for(int j = 1; j <= 10; j++){
for(int k = 1; k <= 20; k++){
if(i % 3 != 0 && j % 2 == 0 && k == 20) continue;
cnt++;
if(i == y && j == m && k == d) return cnt;
}
}
}
}
... | #include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<cstdio>
#include<cstring>
#include<sstream>
#define X fi... | 1 | 61,613,584 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
usin... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | 1 | 42,594,017 |
#include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
ll COM(int n, int k) {
ll res = 1;
if (n < k) return 0;
if... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template<typename Head> void dump(Head&& head) { cerr << head; dump(); }
template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { ce... | 1 | 43,771,344 |
#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(... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int d=a-b;
if(d>=c){
cout<<0<<endl;
}
else{
cout<<(c-d)<<endl;
}
} | 1 | 97,457,380 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,c,x,y,i,t;
while(cin>>n>>a>>b>>c>>x&&n){
i=t=0;
for(;i<n;i++,t++){
cin>>y;
while(y!=x&&t<=10000){x=(a*x+b)%c;t++;}
x=(a*x+b)%c;
}
if(--t>10000)cout<<-1<<endl;
else cout<<t<<endl;
}
} | #include <iostream>
using namespace std;
int main(){
int n,a,b,c,x;
int y[110];
while( cin>>n>>a>>b>>c>>x &&(n|a|b|c|x) ){
for( int i=0;i<n;i++ )
cin >> y[i];
int frame, k=0;
for( frame=0;frame<=10000;frame++ ){
if( x==y[k] ){
k++;
if(k==n ) break;
}
x=( a*x+b )%c;
}
... | 1 | 100,877,164 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<long long> x(n);
vector<long long> y(m);
int md = 1e9+7;
for (int i=0; i<n; i++) cin >> x[i];
for (int i=0; i<m; i++) cin >> y[i];
long long xsum=0, ysum=0;
for (int k=0; k<n; k++){
xsum += k*x[k] - (n-k-1)*x... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 10005
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<... | 1 | 47,790,276 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
ll n,m;
cin>>n>>m;
cout<<(1900*m+100*(n-m))*pow(2,m);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 1 | 31,663,918 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
string A, B;
cin >> A >> B;
if (A.size() < B.size()) {
printf("LESS\n");
} else if (A.size() > B.size()) {
printf("GREATER\n");
} else {
for (int i = 0; i < A.size(); i++) {
if (A[i] < B[i]) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).... | 1 | 71,495,482 |
#include<iostream>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<math.h>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<set>
#include<list>
#include<cmath>
#include<stdio.h>
#... | #include <bits/stdc++.h>
using namespace std;
#define bug(x) cerr << #x << " = " << x << '\n'
#define ll long long
#define x first
#define y second
#define eb emplace_back
#define maxn 300005
#define mod 1000000007
#define ar2 array<int, 2>
ar2 a[maxn], b[maxn];
map <ar2, bool> d;
int dx[maxn]... | 1 | 72,161,331 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
double ans = 0;
for (int i = 0; i < n; i++) {
double x;
string u;
cin >> x >> u;
if (u == "JPY") {
ans += x;
}
else {
ans += x * 380000;
}
}
cout << fixed << setprecision(11) << ans << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 1 | 15,664,059 |
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_re... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
cin >> a >> b;
cout << "100 100" << endl;
rep(i,50){
rep(i, 25){
if(a > 1){
cout << ".#";
... | 1 | 98,575,837 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | #include<stdio.h>
int main(){
int angka, digitBelakang, digitTengah, digitAwal;
scanf("%d", &angka);
digitBelakang = angka % 10;
digitTengah = (angka - digitBelakang) / 10 % 10;
digitAwal = (angka - digitBelakang) / 100 % 10 ;
if (digitBelakang == 7){
puts ("Yes");
}
else if (digitTengah == 7){
puts (... | 1 | 69,564,180 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int n = s.size();
n -= 2;
s = s.substr(0, n);
while (1) {
string t = s.substr(0, n / 2);
t += t;
if (s == t) {
cout << n << endl;
return 0;
}
n -= 2;
s = s.substr(0, n);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = s.size()/2-1; i>0; i--) {
if (s.substr(0,i) == s.substr(i,i)) {
cout << i * 2 << endl;
return 0;
}
}
} | 1 | 89,598,335 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define Mid ((l+r)/2)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define drep(i,a,b) for(int i=(a);i>=(b);--i)
#define file(a) freopen(#a".in","r",stdin),freopen(#a".out","w",stdout);
const int maxn=3e5+5,mod=1e9+7,inf=0x3f3f3f3f;
int n,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
return b;... | 1 | 6,199,150 |
#include <stdio.h>
#include <cmath>
int main(){
char s[8003] = {};
int x,y;
int gx[8000] ,gy[8000];
bool dx[8000][8000] ,dy[8000][8000];
scanf("%s\n", &s);
scanf("%d %d", &x, &y);
int i = 0;
while( s[i] == 'F'){
i++;
}
x = x-i;
i++;
x = std::abs(x);
y = std::... | #include <bits/stdc++.h>
using namespace std;
const int ADD = 1e4, N = ADD << 1;
int x, y, cnt;
string s;
vector<int> X, Y;
bitset<N> b;
bool can(vector<int> vec, int want, bool B = false) {
b.reset();
b[ADD] = true;
for (int i = 0; i < vec.size(); i++) {
if(i == 0) {
if(B)
b <<= vec[i];
else
b = (b ... | 1 | 8,509,122 |
#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 N; cin >> N;
vector<int> A(N);
vector<int> B(N);
ll ans = 0;
rep(i, N){
cin >> A[i];
B[i] = A[i]%2;
ans += A[i]/2;
}
rep(i, N-1){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long now=0,ans=0;
for(int i=0;i<n;i++){
int x;
cin >> x;
now+=x;
if(x==0){
ans+=(now/2);
now=0;
}
}
ans+=now/2;
cout << ans << endl;
} | 1 | 73,339,427 |
#include<bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
int main()
{
int n;
cin >> n;
vec<int> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
a[i]--;
}
int ans = 0;
for (int i = 0; i < n; i++)
{
if(i == a[a[i]])
{
... | #include<bits/stdc++.h>
using namespace std;
bool visited[100005];
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (visited[i]) {
continue;
}
if (a[a[i]] == i) {
cnt++;
visited[a[i]] = true;
}
}
cout... | 1 | 76,050,135 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<sstream>
#define ll long long
#define mes(x,y) memset(x,y,sizeof(x))
using namespace std;
int main(){
std::ios::sync_with_st... | 1 | 95,595,528 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n>> m;
int l = 1;
int r = 100007;
for (int i = 0; i < m; i++){
int ll, rr;
cin >> ll >> rr;
l = max(l, ll);
r = min(r, rr);
}
if (l > r) cout << 0 <<endl;
else cout << r-l+1 <<endl;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 1 | 24,801,583 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 1e6+5;
int a[] = {
400,
599,
8,
600,
799,
7,
800,
999,
6,
1000,
1199,
5,
1200,
1399,
4,
1400,
1599,
3,
1600,
1799,
2,
1800,
1999,
1
};
int main() {
int n;
cin >> n;
for(int i=0; ; i+=3) {
if(a[i] <= n && n <= a[i+1]) {
... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
int n;
cin>>n;
if(n>=400&&n<=599)
cout<<"8";
else if(n>=600&&n<=799)
cout<<"7";
else if(n>=800&&n<=999)
cout<<"6";
else if(n>=1000&&n<=1199)
cout<<"5";
else if(n>=1200&&n<=1399)
cout<<"4";
else if(... | 1 | 85,680,359 |
#include <iostream>
#include <string>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <ctime>
#include <cstdlib>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
cout << a/b << endl;
cout << a%b << endl;
cout << fixed << setprecision(20);
cout << static_cast<long double>... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
double a1 = a, b1 = b;
printf ("%d %d %.5lf\n", a / b, a % b, a1 / b1 );
return 0;
} | 1 | 55,018,350 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<pair<int, int>> dish(5, make_pair(0, 0));
for (int i = 0; i < 5; i++)
{
cin >> dish[i].second;
dish[i].first = -(dish[i].second % 10);
if (dish[i].first == 0)
{
dish[i].first -= 10;
}
}
... | #include<iostream>
#include<unordered_map>
#include<bitset>
#include<math.h>
#include<vector>
#include<set>
#include<algorithm>
#include<ctype.h>
#include<unordered_set>
#include<string>
#include<iomanip>
#include<queue>
#include<limits>
#include<map>
#include<stack>
#include<iterator>
#include<cstring>
#include<deque>... | 1 | 82,653,394 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> t(n + 2), v(n + 2), u(n + 2);
for (int i = 1; i <= n; i++) {
cin... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
int main() {
ll n;
cin >> n;
vec t(n),v(n);
for(ll i=0;i<n;i++) cin >> t[i],t[i]*=2;
for(ll i=0;i<n;i++) cin >> v[i],v[i]*=2;
ve... | 1 | 69,247,000 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
string a,b,c;
cin>>a>>b>>c;
if(a[(a.size())-1]==b[0] && b[(b.size())-1]==c[0]){
cout<<"YES"<<"\n";
}
else{
cout<<"NO"<<"\n";
}
return 0;
... | #include <stdio.h>
#include <string.h>
int main (){
char a[20],b[20],c[20];
scanf("%s %s %s",&a,&b,&c);
int lenX=strlen(a);
int lenY=strlen(b);
if (a[lenX-1]== b[0]&&b[lenY-1]==c[0]){
puts("YES");
}else {
puts("NO");
}
return 0;
} | 1 | 91,173,457 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, x;
ll Get(ll x, ll y)
{
if (x < y) return Get(y, x);
if (y == 0) return 0;
ll d = x / y;
return 3ll * d * y + Get(y, x % y);
}
int main()
{
cin >> n >> x;
printf("%lld\n", Get(x, n - x));
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
#define MOD 99994711
#define ba 47
using namespace std;
typedef long long int64;
typedef unsigned i... | 1 | 63,978,223 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int s,w;
cin >> s >> w;
if(s<=w){
string message="unsafe";
cout << message << endl;
}else{
string message="safe";
cout << message << endl;
}
} | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define endl '\n'
#define mod 1000000007
#define inf 1e18
typedef tree<int, null_type, less<int>, rb_tree_tag, tree... | 1 | 78,492,973 |
#include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
#define... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int A,B,C;
cin >> A >> B >> C;
if(A==B && B==C) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 52,759,426 |
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>
#include <queue>
#include <complex>
#include <set>
#include <map>
#includ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int uli;
int main(){
int n,m;
scanf("%d %d",&n,&m);
char s[12];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
scanf("%s",s);
if(strcmp(s,"snuke")==0){
printf("%c%d\n",j+'A',i+1);
return 0;
}
}
}
return 0;
... | 1 | 88,616,254 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <iomanip>
#include <functional>
#include <cmath>
#ifdef DEBUG
#include "debug.hpp"
#else
#define debug(...)
#endif
#defin... | #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize (2)
#pragma G++ optimize (2)
#include <bits/stdc++.h>
#include <algorithm>
... | 1 | 96,466,406 |
#include <iostream>
#include <cstdio>
#include <cctype>
using namespace std;
int main() {
char ch;
int count[26] = {};
while (scanf("%c", &ch) != EOF) {
ch = tolower(ch);
int num = ch - 'a';
count[num]++;
}
for (int i = 0; i < 26; i++) {
printf("%c : %d\n", 'a' + i, count[i]);
}
return 0;
} | #include <iostream>
#include <cmath>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <list>
#include <cctype>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
locale l = locale::class... | 1 | 54,905,071 |
#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() {
int N; cin >> N;
vi a(N);
rep(i,N){... | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast,no-stack-protector")
#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define LL long long int
#define vi vector<int>
#define vl vector<LL>
#define pb push_back
#define all(V) V.begin(),V.end()
#define sci(x) scanf("%d",&x)
#define scl(x) scanf("... | 1 | 17,346,268 |
#include<iostream>
using namespace std;
int a[26];
int main()
{
string s;cin>>s;
for(char c:s) a[c-'a']++;
for(auto x:a) if(x>1) return puts("no")*0;
puts("yes");
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (int i = 0; i < (ll)(n); ++i)
ll INF = 1LL << 60;
ll mod = 1e9 + 7;
int main() {
string s; cin >> s;
int n=s.size();
rep(i,n) {
for(int j=i+1;j<n;j++) {
if(s[i]==s[j]) {
cout ... | 1 | 1,318,597 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int a[20005], b[20005], k;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
for(int i=1;i<=n;i++) {
cin >> k;
a[k] = i, b[k] = i;
}
for(int i=1;i<=n;i++) {
a[i] += i * n;
b[i] += n * (n - i);
}
for(int i=1;i<=n;i++) cout... | #include<bits/stdc++.h>
#define rint register int
#define ll long long
using namespace std;
const ll Max=1e9;
int N,P[1010000];
ll Sum[1010000],A[1010000],B[1000000];
int main(){
cin>>N;
for(rint i=1;i<=N;++i) cin>>P[i];
for(rint i=1;i<=N;++i) {
Sum[P[i]]=Max-N+i;
}
A[1]=Max/2;B[1]=Sum[1]-A[1];
for(rint i=2;i<... | 1 | 87,383,283 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<un... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 1 | 8,651,791 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
if (n > m) swap(n, m);
if (m == 1) {
cout << 1 << endl;
return 0;
}
if (n == 1) {
cout << m - 2 << endl;
return 0;
}
ll ret = (ll)(n - 2) * (m - 2);
cout << ret << endl;
} | 1 | 27,107,138 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 998244353
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl v... | #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(){
vector <ll> k(26,1),k2(26,0);
int ans;
ans='y';
int n;
cin >> n;
string s;
cin >> s;
char ss;
string s2;
s2=s[0];
ss=s[0];
ans=ss;
rep(i,n){
ss=s[i];
ans=s... | 1 | 100,734,880 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
int main() {
int N, K;
cin >> N >> K;
if (K==1) cout << 0 << endl;
else cout << N-K << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(void)
{
int n,k; cin>>n>>k;
if(k==1) {cout<<0<<endl; return 0;}
int cnt=n;
for(int i=1;i<k;i++)
{
n--;
}
cout<<n-1<<endl;
return 0;
} | 1 | 25,958,142 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int H, W, M;
cin >> H >> W >> M;
vector<int> h(M,0),w(M,0);
vector<int> x(H,0),y(W,0);
set<pair<int,int>> v;
rep(i,M){
cin >> h[i] >> w[i];
h[i]--; w[i]--;
x[h[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 h, w, m;
cin >> h >> w >> m;
vector<int> hs(h), ws(w);
set<P> s;
rep(i, m) {
int r, c;
cin >> r >> c;
--r; --c;
hs[r]++; ws[c]++;
... | 1 | 72,670,560 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.