code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n,k;
cin >> n>>k;
vector<int> ni(21);
ni.at(0)=1;
int x=1;
for(int i=1;i<21;i++){
x=x*2;
ni.at(i)=x;
}
double ans=0;
for(int i=1;i<=n;i++){
double p=(double)k/i;
double ke... | 0 | 38,759,576 |
#include<algorithm>
#include<bitset>
#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_set>
#include<util... | #include<bits/stdc++.h>
using namespace std;
using i64 = long long int;
const int INF = 1e9;
int edit_distance(string s1, string s2) {
vector<vector<int>> dp(s1.size()+1, vector<int>(s2.size()+1, INF));
for(int i=0;i<=s1.size();++i)dp[i][0] = i;
for(int j=0;j<=s2.size();++j)dp[0][j] = j;
for(int i=1;i<=... | 0 | 83,976,834 |
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<ctime>
using namespace std;
typedef long long ll;
const int MAX=1e5+10;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
const int d[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
const string mode[4]={... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
int main(){
string s;
string target="keyence";
cin >>s;
int n=s.size();
bool a=false;
int cnnt=0;
if(s==target)a=true;
rep(i,n){
for(int j=i;... | 0 | 44,205,968 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i =... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | 0 | 27,088,334 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000000000
#define MOD 1000000007
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(15);
ll h,w;
cin>>h>>w;
if(h==1 || w==1){
cout<<1<<endl;
}else{
cout<<(h*w+1... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (n); i++)
using... | 0 | 90,097,149 |
#include <bits/stdc++.h>
using namespace std;
typedef long long intl;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin>>n;
vector <int> v(2*n);
for(int i=0;i<2*n;i++){
cin>>v[i];
}
sort(v.begin(),v.end());
int sum=0;
for(int i=0;i<n;i++){
sum+=v[i*2];
}
cout<<sum<<endl;
} | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define vi vector<int>
#define all(a) a.begin(),a.end()
typedef pair<int,int> P;
const long long mod=1000000007;
const long long inf=1ll<<61;
int a[100006],b[100006];
P ab[100006];
signed main(){
int n,m;cin>>n... | 0 | 66,062,716 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#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 N, M, X, Y;
cin >> N >> M >> X >> Y;
int mx = -100;
rep(i, N)
{
int x;
c... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 | 18,734,475 |
#include <iostream>
using namespace std;
int x, y, smaller, bigger;
int main(){
while (true){
cin >> x >> y;
if (x == 0 & y == 0){
break;
}
if (x > y){
bigger = x;
smaller = y;
}
else{
bigger = y;
smaller = x;
}
cout << smaller << " " << bigger << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 47,896,187 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
a = a + b - c - d;
if (a > 0) cout << "Left";
if (a < 0) cout << "Right";
if (a == 0) cout << "Balanced";
} | #include <cstdio>
#include <iostream>
#include <algorithm>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define outl(x) cout<< (x) << '\n'
using namespace std;
bool G[105][105];
signed main()
{
cin.tie(0), ios::sync_with_stdio(false);
int N;
cin >> N;
rep(i, N){
int k, u, p;
cin >> u >> k;
--... | 0 | 68,802,313 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
using pq = priority_queue<int... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#incl... | 0 | 5,760,158 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin(... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <string.h>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
r... | 0 | 23,282,773 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i, j, t, n, a, b, c, d, m, k;
cin>>a>>b;
cout<<a*b-a-b+1<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 47,116,929 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long q,h,s,d,n;
long long cost,min2,min1,min05,min025;
cin>>q>>h>>s>>d>>n;
min025=q;
min05=min(h,2*min025);
min1=min(s,min05*2);
min2=min(d,min1*2);
cos... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
int main(){
int n;
scanf ("%d",&n);
while(n){
int k;
vector<int> p(n);
for(int t=0;t<n;t++){
scanf ("%d",&p[t]);
}
sort(p.begin(),p.end());
k=p[1... | 0 | 39,372,256 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<string> rec;
int m, f, r;
while (cin >> m >> f >> r) {
if (m == -1 && f == -1 && r == -1) {
break;
}
if (m == -1 || f == -1) {
rec.push_back(string("F"));
}
else if (m + f >= 80) {
rec.push_back(string... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int N;
cin >> N;
map<int, int> factorization;
for (int i = 2; i <= N; ++i) {
int n = i;
for (int j = 2; j * j <= i; ++j) {
while (n % j == 0) {
if (factorization.count(j) == 0) {
f... | 0 | 50,922,543 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<string.h>
#define fornt(k,n) for(int i=k; i<n; ++i)
#define fornt2(p,n) for(int j=p; j<n; ++j)
#define pb push_back
#define ll long long
#define sc(n) scanf("%d",&n)
#define sc2(x,y) scanf("%d %d",&x,&y)
#defin... | #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 pair<int, i... | 0 | 55,857,751 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | #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>
#includ... | 0 | 88,428,243 |
#include <iostream>
#define REP(i, a, n) for(int i = (a); i < (n); i++)
using namespace std;
int past(int Y, int M, int D) {
int day = 0;
REP(i, 1, Y) {
if(i % 3 == 0) day += 10 * 20;
else day += 19 * 5 + 20 * 5;
}
REP(i, 1, M) {
if(Y % 3 == 0) {
day += 20;
} else {
if(i % 2 == 1) da... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll=long long;
using ld=long double;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ordered_set tree<pll, null_type,less... | 0 | 21,387,963 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <set>
#include <vector>
#include <queue>
#define pb push_back
using namespace std;
typedef pair<int,int> pii;
int main(){
int N;
cin>>N;
set<int> ss[1000];
bool flag=false;
int n,m;
for(int i=2;i*(i-1)<=... | #include "bits/stdc++.h"
using namespace std;
int main()
{
int n,d,ans;
ans=0;
cin>>n>>d;
vector<vector<int>> x(n,vector<int>(d));
for(int i=0;i<n;i++)
{
for(int j=0;j<d;j++)
{
cin>>x.at(i).at(j);
}
}
for(int i=0;i<n-1;i++)
{
for(int j=i+1;j<n;j++)
{
int disdis=0;
... | 0 | 56,551,726 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, ai;
cin >> N;
map <int,int> A;
for(int i=0;i<N;i++){
cin >> ai;
if(A.count(ai) > 0){ cout << "NO" << endl; return 0;}
else A[ai] = 1;
}
cout << "YES" << endl;
} | #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 200005
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template... | 0 | 77,637,985 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int H, W, K;
cin >> H >> W >> K;
char C[H][W];
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >> C[i][j];
}
}
int ans=0;
int count;
for (int ibit = 0; ibit < (1 << H); ++ibit){
for (int jbit... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
void Yes() {printf(... | 0 | 91,661,395 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 0 | 93,312,983 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
class Radix {
private:
const char* s;
int a[12... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, D;
cin >> H >> W >> D;
vector<int> X(H * W + 1), Y(H * W + 1);
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
int A;
cin >> A;
X.at(A) = i;
Y.at(A) = j;
}
}
vector<int> d(H * W + 1);
for (int ... | 0 | 15,112,174 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t i64;
int main()
{
int p,q,r;
cin >> p >> q >> r;
int ans = p+q+r - max({p,q,r});
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 0 | 25,956,232 |
#include<cstdio>
const static int H_MAX = 2000;
const static int W_MAX = 2000;
bool grid[H_MAX + 2][W_MAX + 2];
unsigned vertical[H_MAX + 1][W_MAX + 1], horizontal[H_MAX + 1][W_MAX + 1];
int main(){
int H, W;
scanf("%d %d", &H, &W);
for (int i = 0; i <= W + 1; ++i){
grid[0][i] = grid[H + 1][i] = false;
}
for (in... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
char b;
cin >> b;
if(b=='A') cout << 'T' << endl;
if(b=='T') cout << 'A' << endl;
if(b=='C') cout << 'G' << endl;
if(b=='G') cout << 'C' << endl;
return 0;
... | 0 | 70,248,910 |
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
cout << (n / 2) - (n % 2 == 0) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
string solve(int n){
string s;
s = "000000";
for(int i = 0; i < 6; i++){
s[5-i] = '0'+n%10;
n /= 10;
}
return s;
}
int main(){
int n,m;
cin >> n >> m;
vector<map<int,int>> mp(n+... | 0 | 62,771,534 |
#include<iostream>
#include<queue>
using namespace std;
int data[20][20];
int dp[20][20];
int w,h,n;
int main(){
int i,j;
int x,y;
while(1){
cin >> w >> h;
if( !w )break;
cin >> n;
for( i = 0; i < 20; i++ ){
for( j = 0; j < 20; j++ ){
data[i][j] = 0;
dp[i][j] = 0;
}
}
for( i = 0; i < n; i++... | #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... | 0 | 73,955,129 |
#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>;
const int INF = 1 << 29;
int main() {
string s;
cin >> s;
int x = INF;
for (int i = 0; i < s.size()-2; i++) {
string sub = s.substr(i, 3);
int now = stoi(sub);
x = min(... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 43,518,808 |
#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
using LL = long long;
using VLL = std::vector<LL>;
using VVLL = std::vector<VLL>;
using VVVLL = std::vector<VVLL>;
using LD = long double;
using VLD = std::vector<LD>;
using VVLD = std::vector<VLD>;
using VVVLD = std::vector<VVLD>... | #include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mod 1000000007ll
const ll maxn = 9e18;
using namespace std;
const ll maxsize = 100000009;
void solve() {
int a, b;
cin >> a >> b;
if(a > b) swap(a, b);
string t(b, a + '0');
cout << t << endl;
}
int main() {
ios_base :: sync_with_st... | 0 | 63,102,368 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a,... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define PI 3.141592653589793
using namespace std;
using ll = long long;
using v1 = vector<int>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
struct point{
double x;
double y;
};
void coho(int d, point a, point b){
double p6 ... | 0 | 61,309,171 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include <bits/stdc++.h>
#define N 200005
using namespace std;
int n;
int a[N];
map < int , int > b;
bool ok(int mij)
{
int i , k;
b.clear();
for(i = 2 ; i <= n ; i++)
if(a[i] <= a[i - 1])
{
b.erase(b.upper_bound(a[i]) , b.end());
k = a[i];
++b[k];
... | 0 | 44,139,108 |
#include<iostream>
#include<map>
#include<string>
using namespace std;
int main() {
map<string, int> M;
string word, fword, lword = "";
int s = 0;
while(cin >> word) {
M[word]++;
if(M[word] > s) {
s = M[word];
fword = word;
}
if(word.size() > lword.size()) lword = word;
}
cout <<... | #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>;
ll dp[1010][10010];
const ll INF=1e18;
int main(){
int h,n;
cin>>h>>n;
vector<int>a(n),b(n);
rep(i,n)cin>>a[i]>>b[i];
rep(i,1010)rep(j,10010)dp[i][j]=INF;
rep(i... | 0 | 51,412,241 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define S second
#define F first
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define lb lower_bound
#define si(c) (int)... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N,M;
cin>>N>>M;
vector<bool> isAC(N, false);
vector<int> check(N,0);
int wans=0, cans=0;
int p;
string s;
for(int i=0; i<M; i++){
cin>>p>>s;
if(isAC.at(p-1)) continue;
else{
if(s... | 0 | 49,749,849 |
#include <stdio.h>
#include <iostream>
#include <vector>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define vecll vector<ll>
using namespace std;
int in() {int x;scanf("%d",&x);return x;}
ll lin() {ll x;scanf("%lld",&x);return x;}
string strin(){string s;cin>>s;return s;}
bool func(ll n){
ll sum=0,cn... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
int main()
{
int n,m;
cin>>n>>m;
vector<int> a(n);
int i;
rep(i,n)cin>>a[i];
vector<int> sum(n+1,0);
rep(i,n)sum[i+1]=(sum[i]+a[i])%m;
map<int,int> maps;
ll ans=0;
... | 0 | 40,092,418 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | #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 elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll INF = 1e15;
int main(){
string yes = "YES", no = "N... | 0 | 99,659,373 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#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())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | #include <stdio.h>
main(){
int h,w;
int i,j;
scanf("%d %d",&h,&w);
while(h||w){
for(i=0;i<h;i++){
for(j=0;j<w;j++){
printf((!i||!j||i==h-1||j==w-1) ? "#" : ".");
}
printf("\n");
}
printf("\n");
scanf("%d %d",&h,&w);
... | 0 | 19,416,310 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int l;
cin >> l;
double ans = 0;
ans = (double)l/3;
cout << fixed << setprecision(9) << ans*ans*ans;
} | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 4,305,825 |
#include <iostream>
using namespace std;
int main(){
int money;
while(cin >> money && money !=0){
int count =0;
int res = 1000 - money;
for(int i=0;i<3;i++){
count +=res %10;
if(res % 10 >4){ count -= 4;}
res /=10;
}
cout << count << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(j, m) for (int j = 0; j < (int)(m); j++)
#define rep2(i, l, n) for (int i = l; i < (int)(n); i++)
int main() {
int A,B,C;
cin >> A >> B >> C;
vector<int> V(100);
rep(i,100) {
V[i] = A*(i + 1)%... | 0 | 78,871,252 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int s=n-k;
if(s%(k-1)==0){
cout << s/(k-1)+1 << endl;
}
else{
cout << s/(k-1)+2 << endl;
}
} | #include <stdio.h>
int main(void){
int a,b;
a = 1;
b = 1;
while(a != 10 && b != 11){
if(b != 10){
printf("%dx%d=%d\n",a,b,a * b);
b ++;
}
else{
b = 1;
a++;
}
}
return 0;
} | 0 | 37,554,901 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll l, r;... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef pair<int... | 0 | 55,420,902 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(s,t) for (int s = 0; s < t; ++s);
using ll = long long;
int main() {
int k,x;
cin >> k >> x;
if (500 * k >= x){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <cstdio>
#include <algorithm>
#include <string>
#include <iostream>
#define MAXN 150
#define MAXLEN 1000
using namespace std;
int c[MAXLEN+1][MAXLEN+1];
int getSubsequence(string x, string y){
int i = 0, j = 0;
while (i <= x.length()){
while (j <= y.length()){
if (i == 0 || j ==0){
... | 0 | 36,739,174 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | #include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#define ll long long
using namespace std;
int main(){
ll s,tmp;
ll x1,x2,y1,y2,x3,y3;
scanf("%lld",&s);
tmp=(ll)ceil(sqrt(s));
if(tmp*tmp==s){
printf("0 0 %lld 0 0 %lld\n",tmp,tmp);
return 0;
}
x2=tmp;... | 0 | 84,269,854 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
int main () {
int N;
cin >> N;
int M = 0;
vector<int> h(N, 0);
rep(i, N) {
cin >> h[i];
M = max(h[i], M);
}
int ans = 0;
for (int i = 1; i <= M ; i++) {
bool flag = fa... | #include <bits/stdc++.h>
#define PI acos(-1.0)
#define eps 1e-9
#define ll long long
#define ull unsigned long long
#define nl printf("\n")
#define sf scanf
#define pf printf
#define INF (ll)1e15
#define mod 1000000007
using namespace std;
const int S=123456;
int main()
{
#ifndef ONLINE_JUDGE
#endif
int n;
... | 0 | 55,908,518 |
#include<iostream>
#include<vector>
#include<string>
#include<math.h>
#include<algorithm>
#include<cstring>
using namespace std;
int canReach[2][16001];
bool DP(vector<int> v,int t,int start){
memset(canReach,0,sizeof(canReach));
canReach[0][8000+start]=1;
if(v.size()==0)
retur... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> v;
for (int i=0; i<4; i++) {
v.push_back(s[i]);
}
sort(v.begin(), v.end());
if (count(v.begin(), v.end(), v[0]) == 2 && count(v.begin(), v.end(), v[2]) == 2) ... | 0 | 86,791,705 |
#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define ll long long
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M),b(M),v(N-1);
rep(i,M){
cin >> a.at(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() {
ll n, X;
cin >> n >> X;
vector<ll> x(n), sa(n);
for (int i = 0; i < n; i++)
{
cin >> x[i];
sa[i] = abs(X - x[i]);
}
int r... | 0 | 54,687,028 |
# include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall... | 0 | 6,920,112 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> p(51), b(51);
ll f(ll n, ll x) {
if (n >= x)
return 0;
if (n == 0) {
return 1;
}
if (x <= 1 + b[n-1])
return f(n-1, x-1);
if (x == (2 + b[n-1]))
return p[n-1] + 1;
if (x <= 2 + 2 * b[n-1])
return p[n-1] + 1 + f(n-1, x-2-b[n-1... | #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>... | 0 | 73,753,969 |
#include <bits/stdc++.h>
#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, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include <iostream>
#include <string>
using namespace std;
bool judge (char c)
{
if (c=='y' || c=='u' || c=='i' || c=='o' || c=='p' || c=='h' || c=='j' || c=='k' || c=='l' || c=='n' || c=='m') return true;
else return false;
}
int main()
{
while (1)
{
int ans=0; bool hand;
string s; char... | 0 | 43,639,604 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long m,n;
cin>>m>>n;
if(n==1 || m==1)
if(n*m>=2)
cout<<n*m-2;
else
cout<<'1';
else
cout<<(n-2)*(m-2);
} | #include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
using Weight=int;
using DArray=vector<Weight>;
using DMatrix=vector<DArray>;
static const Weight INF=1<<29;
struct Edge {
size_t src, dst;
Weight weight;
Edge() {}
Edge(size_t src, size_t dst, Weight weight=1)... | 0 | 17,760,516 |
#include<iostream>
using namespace std;
int main() {
string s;
int i;
int counter1 = 0, counter2 = 0;
cin >> s;
for (i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
if (s[i] == '1') {
counter1++;
}
else {
counter2++;
}
}
else {
if (s[i] == '0') {
counter1++;
}
else {
counte... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
typedef long long ll;
typedef long double ld;
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define P... | 0 | 62,965,049 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
const int INF = 1e9;
co... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#define REP(i,n) for(long long i=0;i<n;++i)
#define REPR(i,n) for(long ... | 0 | 85,005,594 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cmath>
#inc... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#defi... | 0 | 32,750,171 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int,int> ,null_type,less<pair<int,int>>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
typedef long long ll;
const int N = 1e5+10 , OO = 0x3f3f3f3f , mod = 1e9 + 7;
#define ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
using namespac... | 0 | 86,296,376 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n,k; cin >> n >> k;
vector<int> l(n); rep(i,n) cin >> l[i];
sort(l.begin(),l.end());
reverse(l.begin(),l.end()... | #include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
vector<int> ve[N];
priority_queue<int> qe;
int n,m;
int main()
{
cin>>n>>m;
int x,y;
for(int i=0;i<n;i++)
{
cin>>x>>y;
if(m-x+1<1)
continue;
ve[m-x+1].push_back(y);
}
int sum=0;
for(int i=m;i>=1;i--)
{
for(int j=0;j<ve[i].size();j++)
... | 0 | 99,278,868 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n=0;
cin>>n;
for(long long i=0;i<n;i++){
long long test=n-i*100;
if(0<=test&&test<=5*i){
cout<<"1"<< endl;
return 0;
}
}
cout<<"0"<< endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int dp[67200000];
ll Hash[200002];
string S;
ll beki[28];
int moji(char in){
return (int)in - (int)'a';
}
int main() {
cin >> S;
... | 0 | 35,499,044 |
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | #include <bits/stdc++.h>
using namespace std;
bool prime[1000005];
int dp[100][100];
int f(int a, int b) {
if (a == 0) {
return 0;
}
if (b > a)
return 0;
if (dp[a][b] != -1) return dp[a][b];
return dp[a][b] = max(f(a,b+1), f(a-b, b+1)+1);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int64_t N;
cin ... | 0 | 65,231,472 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
int main(){
int V, E;
cin >> V >> E;
vector<vector<int>> edge(V);
vector<int> count_in(V);
for(int i = 0; i < V; i++){
count_in[i] = 0;
}
int s, t;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define in(a) ll a; cin>>a;
#define in2(a,b) ll a,b; cin>>a>>b;
#define in3(a,b,c) ll a,b,c; cin>>a>>b>>c;
#define in4(a,b,c,d) ll a,b,c,d; cin>>a>>b>>c>>d;... | 0 | 93,393,737 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p = 1;
long long cnt = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a == p) p++;
else if (p < a) {
cnt += (long long)(a - 1) / p;
if (p == 1) p++;
... | #include<iostream>
using namespace std;
int main(){
string s,t;
cin >> s;
cin >> t;
if(s.size() != t.size()){
return 0;
}else{
int cnt = 0;
for(int i = 0;i < s.size();i++){
if(s[i] != t[i]){
cnt++;
}
}
cout << cnt << end... | 0 | 77,296,257 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<tuple>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define sc... | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typed... | 0 | 8,388,332 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
cout<<(t)*(t+1)/2<<"\n";
} | #include<bits/stdc++.h>
using namespace std;
int LevenshteinDistance(string s1, string s2){
int d[s1.length() + 1][s2.length() + 1];
for(int i = 0; i <= s1.length(); i++) d[i][0] = i;
for(int i = 0; i <= s2.length(); i++) d[0][i] = i;
for(int i = 1; i <= s1.length(); i++){
for(int j = 1; j <= s2... | 0 | 19,020,592 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++)
cin >> a[i];
vector<int> dp(n+1, -1);
for (int i = 0; i < m; i++)
dp[a[i]] = 0;
if(dp[0]!=0)
dp[0] = 1;
if(dp[1]!=0)
dp[1] = 1;
for (int ... | #include<iostream>
using namespace std;
typedef struct DICE{
int s[6];
}dice;
dice dice_rotate(dice d, char rotate){
int swap;
if(rotate == 'E'){
swap = d.s[2];
d.s[2] = d.s[0];
d.s[0] = d.s[3];
d.s[3] = d.s[5];
d.s[5] = swap;
}else if(rotate == 'N'){
swap... | 0 | 58,984,288 |
#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define VV(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i)... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
string s;
cin >> s;
if (s[0] == 'S') {
if (s[1] == 'S') {
... | 0 | 63,715,493 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | #include<bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define ... | 0 | 80,314,462 |
#include <bits/stdc++.h>
#define REP(i, n) for (int (i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for(int (i) = a; (i) < (int)b; i++)
#define RREP(i, n) for(int (i)=((int)(n)-1); (i)>=0; i--)
#define RFOR(i, a, b) for(int (i) =((int)(b)-1); (i)>=(int)a; i--)
#define ALL(v) (v).begin(),(v).end()
#define MOD 100000... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
long long res = 0;
int right = 0;
int sum = 0;
for (int left = 0;... | 0 | 42,434,346 |
#include <stdio.h>
int main(){
int X;
int Y;
scanf("%d %d",&X,&Y);
printf("%d\n",6-X-Y);
return 0;
} | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cstdio>
#include<cmath>
#include<deque>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<string>
#include<tuple>
#include<utility>
#include<vector>
using namespace std;
typedef long... | 0 | 20,309,416 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int nmax=1000010;
ll fact[nmax],finv[nmax],inv[nmax];
void inicom(){
fact[0]=fact[1]=1;
finv[0]=finv[1]=1;
inv[1]=1;
for (int i = 2; i < nmax; i++){
fact[i]=fact[i-1]*i%mod;
inv[i]=mod-inv[mod%i]... | 0 | 62,589,238 |
#include<cstdio>
long long a[100005];
long long upper[100005], lower[100005];
long long power[100005];
long long count[100005];
long long min(long long a,long long b){ return a>b?b:a; }
int main(){
int n;
scanf("%d",&n);
for(int i = 0; i <= n; i++) scanf("%lld",&a[i]);
upper[n] = 0;
for(int i = n-1... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int arr[3] = {0};
string s;
cin >> s;
for (char t : s){
if (t == 'a')
arr[0] ++;
if (t == 'b')
arr[1] ++;
if (t == 'c')
... | 0 | 17,216,363 |
#include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep (i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); +... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | 0 | 87,640,918 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i, n) FOR(i,0,n)
int main(void){
ll N,M;
cin >> N >> M;
vector<ll> H(N+10);
vector<ll> ma(N+10);
FOR(i,1,N+1){
cin >> H[i];
ma[i] = 0;
}
ll ans = 0;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N,sum,var;
sum=0;
var=0;
cin>>N;
int Wgt[N];
if(N>=2&&N<=100){
for(int i=0;i<N;i++)
{
cin>>Wgt[i];
sum=sum+Wgt[i];
}
int tot=sum;
for(int i=0;i<N;i++)
{
var=var+Wgt[i];
tot=min(tot,a... | 0 | 87,780,157 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
int main()
{
int h,w,a,b;
std::cin >> h >> w >> a >> b;
int v[h][w];
rep(i,h){
rep(j,w){
v[i][j] = ((i < b && j < a) || (i >= b && j >= a)) ? 0 :1;
... | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<string>
#include<algorithm>
#include<cmath>
#include<numeric>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
t... | 0 | 85,300,697 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#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++)
typedef long long ll;
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main()
{
int N, K;
... | #include <iostream>
#include <string>
#include <sstream>
#include <queue>
using namespace std;
struct dot{
long long int k,p,l,r;
};
int main(int argc, char** argv) {
int n;
while(cin>>n){
dot p[n+100];
for(int i=1;i<=n;i++){
cin>>p[i].k;
if(i/2)
p[i].p=i/2;
else
p[i].p=0;
if(i*2<=n)
p[i]... | 0 | 95,421,169 |
#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int a,b;
double f;
cin >> a >> b;
f=1.0*a/b;
cout << a/b << " " << a%b << " " << fixed << setprecision(10) << f << endl;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
struct DATA{
int time;
int log;
};
int GetTime(const string);
int AtoiString(const string);
bool Compare(const DATA&, const DATA&);
int main(){
int i, n, count, _count;
string s, t;
DATA _data;
vector<DATA> data;
... | 0 | 85,997,495 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int u32;
typedef pair<int, int> p;
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) { a = b; return true; } return false; }
i... | #include<iostream>
using namespace std;
int main(){
int a,b;
int count;
while(1){
count = 0;
cin >> a;
if( a == 0) break;
b = 1000 - a;
a = b%500;
count = count + b/500;
b= a%100;
count = count + a/100;
a = b%50;
count = count + b/50;
b = a%10;
count = count + a/10;... | 0 | 25,775,199 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define vi vector<int>
#define pi pair<int,int>
#define pl pair<ll,ll>
#define all(a) a.begin(),a.end()
#define mem(a,x) memset(a,x,sizeof(a))
#define pb push_back
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using piii = pair<int, pair<int, int>>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
ci... | 0 | 14,210,336 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#in... | #include<iostream>
#include<cstring>
typedef long long ll;
using namespace std;
char str[10000000];
int main(void){
ll n;
char before[1000];
char after[1000];
while(cin>>n,n){
for(int i=0;i<n;i++){
cin >> before[i];
cin >> after[i];
}
ll m;
cin >> m;
for(int i=0;i<m;i... | 0 | 83,610,163 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a.at(i);
sort(a.begin(),a.end());
int ans = a.at(n/2) - a.at(n/2-1);
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 53,269,868 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string A, B;
for (int i = 0; i < b; i++) {
A += char('0' + a);
}
for (int i = 0; i < a; i++) {
B += char('0' + b);
}
cout << ((A < B) ? A : B) << "\n";
} | #include <iostream>
#include <string>
int main(int argc, char** argv)
{
std::string s;
std::getline(std::cin, s);
std::string p;
std::getline(std::cin, p);
for (int si = 0; si < (int)s.size(); ++si)
{
if (s[si] == p[0])
{
bool match = true;
for (int pi = 0; pi < (int)p.size() && match; ++pi)
{
ma... | 0 | 7,141,442 |
#include <bits/stdc++.h>
const int INF=1e9;
const int MOD=1e9+7;
const long long LINF=1e18;
using namespace std;
#define int long long
int c[3000][3000];
typedef pair<int,int> P;
std::vector<P> num(2000000,P(0,0));
int wa[3000][3000];
int d;
P grd,gld,brd,bld,ord,old,rrd,rld,rt,rb,gt,gb,ot,ob,bb,bt;
int po=0;
void draw... | #include<stdio.h>
int main(void) {
int d, t, s;
scanf("%d%d%d", &d, &t, &s);
if (d <= t * s) {
printf("Yes");
}
else printf("No");
return 0;
} | 0 | 42,250,633 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> V;
#define rep(i,e) for(ll i=0;i<e;i++ )
typedef pair<ll,ll> P;
const ll mod = 1e9+7;
const ll INF = INT64_MAX;
ll i;
int main(){
string A,B,C;
cin>>A>>B>>C;
if(A.at(A.length()-1)==B.at(0)&&B.at(B.length()-1)==C.at(0))cout<<"... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000009
#define ll long long
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define set0(a) memset ((a), 0 , sizeof(a))
#define set1(a) memset((a),-1,sizeof (a))
#define pi pair<int, int>
#define ps pair<string, string>
#define pl... | 0 | 47,785,212 |
#include <iostream>
#include <cmath>
using namespace std;
int main(void){
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << sqrt(pow(fabs(x1-x2),2)+pow(fabs(y1-y2),2)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n,k;
cin >> n >> k;
int g;
cin >> g;
int mx = g;
if(k == g){
cout << "POSSIBLE" <<... | 0 | 53,885,246 |
#include<bits/stdc++.h>
using namespace std;
long long n,q,m,k,t,l;
int main(){
cin>>n>>m;
vector<string>v(n);
for (int i=0; i<n; i++){
cin>>v[i];
}
sort(v.begin(), v.end());
for (int i=0; i<n; i++){
cout<<v[i];
}
} | #include <bits/stdc++.h>
using namespace std;
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define PI 3.14159265
#define pb push_back
#define bits(n) __builtin_popcount(n)
#define ll long long int
void solve()
{
int n,k;
... | 0 | 93,216,315 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long LL;
#define y0 Sword_Art_Online
#define y1 Your_lie_in_April
#define yn Darling_in_the_Franxx
#define tm Plastic_Memories
#define lr Charlotte
#define no... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 28,575,090 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int x,a;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a!=b||a!=c||b!=c){
cout<<"No";
return 0;
}
cout<<"Yes";
return 0;
} | 0 | 83,542,061 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 100005;
bool res[maxn];
int n;
string str;
bool check() {
bool flag = false;
for (int i = 0; i < n; i++) {
int l = ((i-1)+n)%n;
int r = (i+1)%n;
if (res[i]) {
if (str[i] == 'x' && res[l] == r... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ll long long
#define MOD 1000000007
#define MAX 100010
#define aout(a) REP(i,sizeof(a)) cout << a[i] << " "; cout << endl;
#define vout(v) REP(i,v,size()) cout << v[i] << " "; cout << endl;
usin... | 0 | 95,473,448 |
#include <stdio.h>
const int N=110;
const int INF=1<<30;
int min(int a,int b){
return a>b?b:a;
}
int main(){
int n,dp[N][N],a[N];
scanf("%d%d%d",&n,&a[0],&a[1]);
for(int i=1;i<n;i++)scanf("%d%d",&a[i],&a[i+1]);
for(int k=1;k<n;k++){
for(int i=0;i<n-k;i++){
dp[i][i+k]=INF;
... | #include <iostream>
using namespace std;
#define MAX_V 11
#define INF 1e9
int min(int a, int b){
return a < b ? a : b;
}
int main(void){
int n, a, b, c;
int dp[MAX_V][MAX_V];
while(true){
cin >> n;
if(n == 0) break;
for(int i = 0; i < MAX_V; i++)
for(int j = 0; j < MAX_V; j++)
dp[i][j]... | 0 | 59,214,497 |
#include<iostream>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define vi vector<int>
#define lvi vector<long long>
#define pi pair<int,int>
#define lpi pair<long long ,long long>
#define mp make_pair
#define pb push_back
#define ll long long
#define N 100005
#... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | 0 | 78,842,425 |
#include <iostream>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
int num = (a + b + 1) / 2.0;
cout << num <<endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#define rep(i, n) for(int i = 0; i < (i... | 0 | 92,472,076 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define IOS ios::sync_with_stdio(false); cin.tie(0)
#define ll long long
#define ld long double
#define rep(i,a,n) for (int i=(int)(a);i<(int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
double solve() {
ll N, M, D;
cin >> N >> M >> D;
ll c;
if ( D > 0 ) {
ll w = max(N-2*D, 0LL);
c = (N-w) + w*2;
} else {
c = N;
}
double ans = c * (M-1) / (double)(N*N);
return ans;
}
int main() {
... | 0 | 94,652,737 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mx *max_element
#define mn *min_element
#define fo(i,n) for(ll i=0;i<n;i++)
#define loop(i,a,b) for(ll ... | #include <bits/stdc++.h>
using namespace std;
int main () {
long long N;
cin >> N;
if (N % 2 == 1){
cout << 0 << endl;
return 0;
}
long long ans = 0;
N /= 10;
ans += N;
for (int i = 0; i < 30; i++) {
N /= 5;
ans += N;
if (N == 0){
cout << ans << endl;
return 0;
}
}
... | 0 | 89,863,042 |
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
ll a[300000], mx[300000][2], ans[300000];
int main() {
int N;
cin >> N;
int m=(1<<N);
vector<vector<int>> v(N+1);
for(int i=0; i<m; ++i){
cin >> a[i];
int cnt=0;
for(int j=0; j<N; ++j){
if(i&(1<<j)) ++cnt;
}
v[cnt].push_ba... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 31,763,285 |
#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=1LL<<61;
int main() {
ll a,b,k;
cin >> a >> b >> k;
for(ll i=0;i<k;i++) {
if(i%2) {
b-=b%2;
a+=b/2;
b/=2;
}
el... | bool DBG = false;
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using bint = boost::multiprecision::cpp_int;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i... | 0 | 92,640,244 |
#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_... | #include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a[N+1];
for(int i=0; i<N; i++)
cin >> a[i+1];
bool pushed[N+1];
for(int i=0; i<N+1; i++)
pushed[i] = false;
int count = 0;
int now = 1;
pushed[now] = true;
while(1){
if(a[now] == 2){
cout << count+1 << endl;
... | 0 | 234,077 |
#include<iostream>
#include<cstring>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int wa[n+1]={0};
int ac[n+1]={0};
int c=0,w=0;
while(m--){
int q;
string s;
cin>>q>>s;
if(s=="WA")wa[q]++;
else if(s=="AC" && ac[q]==0){
ac[q]++;
c++;
w+=wa[q];
}
}
cout<<c<<" "<<w;
return 0;
} | #include <iostream>
#include <vector>
#include <cstdlib>
using namespace std;
int main() {
string S; cin>>S;
long long counter=0;
long long counter1=0;
long long counter2=0;
long long answer=0;
if(S.at(0)=='<'){
counter++;}
else
counter1++;
for(long long i=1; i<S.size(); i++){
... | 0 | 91,150,227 |
#include <iostream>
#include <algorithm>
#include <string>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n;
long long sum=0,max,min,a;
cin >> n;
REP(i,n){
cin >> a;
sum+=a;
if(i==0){
max=a;
min=a;
}
if(max<a)
max=a;
if(min>a)
min=a;
... | #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>
#incl... | 0 | 91,112,018 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long M, std::vector<long long> H, std::vector<long long> A, std::vector<long long> B){
vector<vector<long long> > HH(N+1, vector<long long>(1));
for(int i = 0; i < M; ++i){
HH[A[i]].push_back(B[i]);
HH[B[i]].push_back(A[i... | #pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for ... | 0 | 73,680,619 |
#include<bits/stdc++.h>
using namespace std;
int x;
int main()
{
scanf("%d",&x);
printf("%d\n",x/__gcd(x,360)*360/x);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | 0 | 25,709,407 |
#include<stdio.h>
int main(){
int n;
int r;
int inr;
scanf("%d %d", &n,&r);
inr=100*(10-n)+r;
if (n<10){
printf("%d", inr);
}
else {
printf("%d", r);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Hea... | 0 | 1,245,709 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long llint;
const int MAXN = 1e5 + 10;
int x, y, a, b, c;
int p[MAXN], q[MAXN], r[MAXN];
int main(void) {
scanf("%d%d%d%d%d", &x, &y, &a, &b, &c);
for (int i = 0; i < a; ++i) scanf("%d", &p[i]);
for (int i = 0; i < b; ++i) ... | #include <bits/stdc++.h>
#define arep(a,i,n) for(int i=(a);i<(n);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define cinf(x,n) for(int i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(int i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
c... | 0 | 75,158,539 |
#include<iostream>
#include<vector>
#include<map>
using namespace std;
using ll = long long;
vector<int>v;
map<int, int>mp;
int main() {
bool visited[110];
int m, k; cin >> m >> k;
int x_or = 0;
for (int i = 0; i < (1 << m); i++) {
v.push_back(i); v.push_back(i);
if (i != k) x_or ^= i;
}
if (k == 0) {
for (... | #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> c(26... | 0 | 34,925,070 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 10e10;
const ll MINF = -10e10;
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
typedef priority_queue<P,... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 0 | 96,990,053 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A;
cin >> A;
cout << A*800-((A/15)*200) << endl;
} | #include<vector>
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007LL;
const ll INF=1000000000LL;
const int MAX=100001;
int ch(char c){
if(c=='m'){
return 1000;
}else if(c=='c'){
return 100;
}else if(c=='x'){
return... | 0 | 77,984,852 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.