code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#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);
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 1 | 4,123,265 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> PPI;
typedef pair<LL, LL> PL;
typedef long long LL;
#define xx first
#define yy second
const int MOD = 1e9 + 7;
LL dp[2100][2100];
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
LL n... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int n, m; cin >> n >> m;
vector<int> s(n), t(m);
REP(i, 0, n) cin >> s[i];
REP(i, 0, m) cin >> t[i];
ll dp... | 1 | 3,342,373 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M; cin >> N >> M;
vector<vector<bool>> connection(8, vector<bool> (8));
for (int i=0; i<M; i++){
int x, y;
cin >> x >> y;
connection.at(x-1).at(y-1)=connection.at(y-1).at(x-1)=true;
}
vector<int> pattern(N);
for (int i=0; i<N; i++)... | #include<bits/stdc++.h>
# define all(a) a.begin(), a.end()
#define forn(i, a, b) for (int i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define MOD int(1e9+7)
using namespace std;
typedef long long int ll;
bool cmp(int a, int b) {
return a < b;
}
void printV(vector<int> nums) {
for (i... | 1 | 23,333,688 |
#include<vector>
#include<iostream>
using namespace std;
template <class data_t>
class dice{
public:
vector<data_t> field;
dice(vector<data_t> v);
void roll(char ch);
data_t top(){return field[0];}
};
template <class data_t>
dice<data_t>::dice(vector<data_t> v){
typename vector<data_t>::iterator vi = v.begin();
w... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<utility>
#include<map>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll,ll> P;
typedef vector<P>... | 1 | 62,154,733 |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e11;
using Graph = vector<vector<int>>;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
... | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
long long int mypow(long long int x,long long int n)
{
long long int res = 1;
while(n > 0)
{
if(n%2==1)
{
res = ((res%MOD) * (x%MOD)%MOD);
res%=MOD;
}
x = ((x%MOD)*(x%MOD)%MOD);
x%=MOD;
n/=2;
}
return res;
}
long lon... | 1 | 72,575,608 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long A, long long B, std::vector<long long> P){
long long lteqA = 0;
long long gtAlteqB = 0;
long long gtB = 0;
for(long long i = 0; i < N; i++){
if(P[i] <= A) lteqA++;
if(P[i] > A && P[i] <= B) gtAlteqB++;
if(P[i] > B) gtB++... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using vi = vector<int>;
int main(){
int n,a,b; cin >> n >> a >> b;
vi level(3,0);
int p;
rep(i,n){
cin >> p;
if(p>b)level[2]++;
else if(p>a)level[1]++;
else level[0]++;
}
cout << mi... | 1 | 46,839,198 |
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long LL;
int fu[100020];
int dis[100020];
bool success;
int findfu(int i)
{
if (f... | #include<iostream>
#include<list>
#include<vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<math.h>
#include<unordered_map>
#include<map>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using lst = list<ll>;
vec parent;
vec cost;
int find(int x)
{
if (... | 1 | 58,992,091 |
#include<bits/stdc++.h>
using namespace std;
void aryan_p() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
return;
}
int32_t main() {
int n , k ;
cin >> n >> k;
int c = 0 ;
while (n--) {
int i ;
cin >... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
int main() {
int n, k;
cin >> n >> k;
int cnt = 0;
for (int i = 0; i < n; i++) {
int x; cin >> x;
if (x >= k) cnt++;
}
... | 1 | 43,704,780 |
#include <iostream>
using namespace std;
int main() {
int H1, M1, H2, M2, K, ans;
cin >> H1 >> M1 >> H2 >> M2 >> K;
ans = H2 * 60 + M2 - (H1 * 60 + M1);
if (ans - K < 0) cout << 0 << endl;
else cout << ans - K << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll h1, h2, m1, m2, k, ans = 0;
cin >> h1 >> m1 >> h2 >> m2 >> k;
ans = (h2 - h1) * 60 + (m2 - m1) - k;
cout << ans << endl;
return 0;
} | 1 | 22,172,590 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int k,i=0;
cin >> s >> k;
k--;
while(i<s.size()&&s.at(i)=='1')
i++;
if(i>k)
cout << 1 << endl;
else
cout << s.at(i) << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for (int i = (int)n - 1; j <= i; --... | 1 | 23,551,258 |
#include <iostream>
using namespace std;
string s;
int main() {
cin >> s;
if (s == "AAA" || s == "BBB") {
cout << "No\n";
}
else cout << "Yes\n";
} | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
set <char> s2;
for (char c : s) s2.insert(c);
cout << (s2.size() == 1 ? "No" : "Yes") << "\n";
return 0;
} | 1 | 30,481,194 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
string s, t, u;
int a, b;
cin >> s >> t >> a >> b >> u;
if(s == u){
cout << a-1 << " " << b << endl;... | #include <iostream>
using namespace std;
int main(){
string x,y;
while(cin >> x >> y){
int aa,bb;
cin >> aa >> bb;
string str;
cin >> str;
if(str==x){
aa-=1;
cout << aa << " " << bb << '\n';
}else{
bb-=1;
cout << aa ... | 1 | 66,663,714 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for(ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(ve... | #include <iostream>
using namespace std;
typedef long long ll;
ll sma, sum, n;
bool ans = true;
int main(void){
sma = 1000000000000;
cin >> n;
for (ll i = 0; i < n; i++){
ll a, b;
cin >> a >> b;
if (a != b) ans = false;
sum += a;
if (a > b) sma = min(sma, b);
}
... | 1 | 9,318,919 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i=0; i < (ll)(n); i++)
int main(void){
char x;
cin>>x;
if(isupper(x))cout<<'A'<<endl;
else cout<<'a'<<endl;
} | #include<bits/stdc++.h>
#define MOD 1000000007
#define mp make_pair
#define ll long long
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define debug cout<<"Debugging.."<<endl
using namespace std;
int main()
{
faster;
char c;
cin>>c;
if(c>='a' && c<='z')
cout<<'a'<<endl;
... | 1 | 81,657,709 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int h, w, m;
cin >> h >> w >> m;
set<P> s;
vector<int> all_h(h+1), all_w(w+1);
rep(i,m) {
int y, x;
cin >> y >> x;
s.insert... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define IN(type, n) type n; cin >> n
int main() {
IN (ll, H);
IN (ll, W);
IN (ll, M);
map<pair<int, int>, int> hw;
vector<ll> h(H, 0);
vector<ll> w(W, 0);
REP(i, M) {
IN(ll, tmp_h);
... | 1 | 23,938,529 |
#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... | #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>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
string f(int x) {
... | 1 | 88,605,024 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
struct Match {
int n;
vector<vector<int>> G;
vector<bool> used;
vector<int> match;
Match(int n_) : n(n_) { G.resize(n); }
void add_edge(int u, int v) {
G[u].push_back(v);
G[v].push_b... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 1 | 54,571,373 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void chmin(ll& a, ll b) {
if (a > b) a = b;
}
int main() {
int N, K;
cin >> N >> K;
vector<ll> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<ll> height(N);
height[0] = 0;
ll SUBMAX = a[0];
for (int i = 1; i < N; i++) ... | #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr int mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, const T b) {
if(a >= b) return false;
a = b;
... | 1 | 2,665,599 |
#include <bits/stdc++.h>
using namespace std;
const string R = "yuiophjklnm";
int main() {
for(string s; cin >> s && s != "#"; ) {
int res = 0;
for(int i = 1; i < s.size(); ++i) {
res += (R.find(s[i-1]) == string::npos) ^ (R.find(s[i]) == string::npos );
}
cout << res << endl;
}
return 0;
} | #include<iostream>
#include<string.h>
#define LEFT 1;
#define RIGHT 2;
using namespace std;
int main()
{
string right_alpha = "yuiophjklnm";
string str;
char buf[34];
while (cin >> buf && strcmp(buf,"#") != 0)
{
int status = 0;
int count = 0;
str = buf;
for (int i = 0; i <str.size(); i++)
{
char c = s... | 1 | 51,271,681 |
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <ioman... | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
#define ld long double
using namespace std;
const int N = 4e5 + 123;
const int MAXN = 1e5 + 12;
const int inf = 1e9 + 7;
const ll mod = 1e9 + 7;
ll n, b[N], p[N];
char... | 1 | 71,853,941 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
int main() {
#ifdef local
freopen("in.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n; cin >> n;
int m = 1 << ... | #include <bits/stdc++.h>
#define endl '\n'
#define fst first
#define snd second
#define pb push_back
#define sz(x) int(x.size())
#define REP(i,n) for(int i = 0; i < int(n); ++i)
#define trace(x) cout << #x << " = " << x << endl
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
type... | 1 | 22,422,444 |
#include<bits/stdc++.h>
typedef long long ll;
#define exp puts("-1"),exit(0);
ll gi(){
ll x=0,f=1;
char ch=getchar();
while(!isdigit(ch))f^=ch=='-',ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
std::mt19937 rnd(time(NULL));
#define rand rnd
#define pr std::pair<int,int>
#define all(x... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN=3e5+7;
ll from[MAXN],to[MAXN];
map<ll,ll> Map;
ll n;
ll a[MAXN],b[MAXN],siz[MAXN],sum[MAXN];
bool cmp(const ll &A,const ll &B){return a[A]>a[B];}
bool cmp2(const ll &A,const ll &B){return A>B;}
ll minn1=1e18,minn2;
int main() {
cin>>n;
... | 1 | 19,101,804 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x, a, b; cin >> x >> a >> b;
if (b <= a) {
cout << "delicious" << endl;
return 0;
}
string ans;
if( x + 1 <= b - a) ans = "dangerous";
else ans = "safe";
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | 1 | 74,713,355 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | #include <iostream>
using namespace std;
bool isLow(char c) { return 'a' <= c && c <= 'z'; }
int main() {
string s;
cin >> s;
bool available = s[0] == 'A' && isLow(s[1]) && isLow(s[s.size() - 1]);
int cnt = 0;
for (int i = 2; i < s.size() - 1; ++i) if (s[i] == 'C') cnt++; else if (!isLow(s[i])) available = 0;... | 1 | 99,599,483 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define ii pair < int , int >
#define ever (;;)
const int N = 100100;
int n,a[N][3],dp[N][3];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=3;j++)
scanf("%d",&a[i][j]);
... | #include <bits/stdc++.h>
using namespace std;
int main (){
int n;
cin >> n;
int A[n];
int B[n];
int C[n];
for(int i=0;i<n;i++){
int a,b,c;
cin >> a >> b >> c;
A[i] = a;
B[i] = b;
C[i] = c;
}
int a_happiness[n];
int b_happiness[n];
int c_hap... | 1 | 37,687,978 |
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main()
{
int i = 0, max_num = 0, max_length_string_num = 0, tmp_num = 0;
map< string, int > input_word;
string tmp, max_length_string, max_num_string;
while ( cin >> tmp )
{
input_word[tmp] = input_word[tmp] + 1;
if ( tmp.length() > ... | #include <string>
#include <map>
using namespace std;
int main(){
string s,t;
map<string,int>m;
for(;cin>>s;)m[s]++;
s=t=(*m.begin()).first;
int M=(*m.begin()).second,l=s.length();
for(map<string,int>::iterator it=m.begin();it!=m.end();it++){
if(M<(*it).second)M=(*it).second,s=(*it).first;
if(l<(*it... | 1 | 58,936,289 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll h,n;
cin >> h >> n;
ll sum=0;
for(ll i=0;i<n;i++){
ll a;
cin >> a;
sum+=a;
}
if(sum>=h) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long int h, n;
cin >> h >> n;
long long int ara[n];
int sum = 0;
for (int i = 0; i < n; ++i)
{
cin >> ara[i];
if (h >= 0)
{
h -= ara[i];
}
... | 1 | 47,255,009 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << ceil((float)(a + b) / 2);
return 0;
} | #include <iostream>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
int ans = (a + b) / 2;
cout << ans + ((a + b) % 2) << endl;
} | 1 | 67,829,344 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int main() {
int k, x;
cin >> k >> x;
cout << ((k*500>=x)? "Yes" : "No" ) << ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int K,X;
cin>>K>>X;
cout<<(500*K>=X?"Yes":"No")<<endl;
} | 1 | 47,480,407 |
#include <iostream>
using namespace std;
int main() {
int n;
while(1){
cin >> n;
if(n == 0) break;
int a = 1000-n, count = 0;
if(a>=500){
a -= 500;
count++;
}
while(a>=100){
a -= 100;
count++;
}
if(a>=50){
a -= 50;
count++;
}
while(a>=10){
a -= 10;
count++;
}
if(a>=5){
... | #include<iostream>
using namespace std;
#include<stdio.h>
int main(){
for(;;){
int a,b=0,c=0;
cin>>a;
if(a==0)break;
b=1000-a;
c=(b/500)+((b%500)/100)+(((b%500)%100)/50)+((((b%500)%100)%50)/10)+(((((b%500)%100)%50)%10)/5)+(((((b%500)%100)%50)%10)%5);
cout<<c<<endl;
}
return 0;
} | 1 | 5,778,786 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)cin >> a[i];
for (int i = 0; i < n; i++)cin >> b[i];
long long suma = 0, sumb = 0;
for (int i = 0; i < n; i++)
{
suma += a[i];sumb += b[i];
}
if(... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 1 | 78,856,316 |
#include <bits/stdc++.h>
#define r(i,n) for(long long i = 1; i<=n; i++)
typedef long long ll;
using namespace std;
int main() {
int n,sum=0,ans,ex;
cin >> n;
r(i,n){
sum+=i;
if(sum>=n){
ans=i;
ex=sum-n;
break;
}
}
r(i,ans){
if(i!=ex)cout<<i<<endl;
}
} | #include <cstdio>
#include <utility>
#include <typeinfo>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <vector>
#include <tuple>
#define REP(i,n) for(int i=0;i<n;i++)
typedef long long int ll;
u... | 1 | 12,953,959 |
#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 ... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | 1 | 45,609,814 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<string>
#include<sstream>
#include<iomanip>
#include<utility>
#include<cmath>
#include<set>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<map>
#include<set>
#include<cstring>
#include<iterator>
... | #include <bits/stdc++.h>
#include <typeinfo>
#include <cxxabi.h>
#ifdef LOCAL
#include "dbgtoki.hpp"
#define DUMP(i) dump((string)TOSTRING(i), demangle(typeid(i).name()), __LINE__ , i)
#else
#define DUMP(i)
#endif
using namespace std;
#define TOSTRING(x) #x
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<... | 1 | 16,920,688 |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<queue>
#define INF 2100000000
using namespace std;
typedef pair<int,int> P;
int glid[1001][1001];
char put[1001][1001];
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
char su[9]={'1','2','3','4','5','6... | #include <iostream>
#include <queue>
#define MAX_W 1000
#define MAX_H 1000
#define MAX_N 1000
#define INF -1
typedef std::pair<int, int> P;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
int w, h, n;
int sx, sy, gx[MAX_N], gy[MAX_N];
char field[MAX_W][MAX_H];
int solve(int _sx, int _sy, int _gx, int _gy);
int ma... | 1 | 81,461,427 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
vector<int> fruits(N);
for(int i = 0; i < N; i++){
cin >> fruits.at(i);
}
sort(fruits.begin(),fruits.end());
int ans = 0;
for(int i = 0; i < K; i++){
ans += fruits.at(i);
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ld long double
#define pb push_back
#define mp make_pair
#define fi(i,start,end) for(int i=start; i < end ; ++i)
#define Fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int temp;
vector<int... | 1 | 58,736,844 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
const ll c = 1000000007;
int N, M;
cin >> N >> M;
vector<ll> dp(N+1, 1);
for(int i=0; i<M; i++) {
int broken;
cin >> broken;
dp[broken] = 0;
}
for(int i=2;... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
#define NUM 1000000007
using namespace std;
typedef long long ll;
typedef long double ld;
int ma... | 1 | 86,030,577 |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define inf 1000000000000000000
#define bpc(x) __builtin_popcountll(x)
#d... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
for (int i = 1; i < n; i++) {
if (a[i-1]>a[i]) {
ans... | 1 | 4,321,000 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#... | #include<bits/stdc++.h>
using namespace std;
int main( void )
{
string N;
cin >> N;
int sum = 0;
for( int i = 0; i < N.size(); i++ )
sum += N.at( i ) - '0';
if( sum % 9 == 0 )
cout << "Yes" << endl;
else
cout << "No" << endl;
} | 1 | 83,360,536 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n = 0, max_height = 0;
long long sum = 0;
cin >> n;
vector<int> a(n);
for(int i = 0 ; i < n; i++)
{
cin >> a.at(i);
}
for(int i = 0; i < n; i++)
{
max_height = max(a.at(i),max_height);
sum += max_h... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int M = 1000000007;
ll mod(ll x){
return ((x%M + M)%M);
}
ll add(ll a, ll b){
return mod(mod(a)+mod(b));
}
ll mul(ll a, ll b){
return mod(mod(a)*mod(b));
}
ll minu(ll a, ll b){
return mod(mod(a)-mod(b));
... | 1 | 57,513,935 |
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
int cnt = -1;
ll hoge(ll n, ll c, ll k) {
if (n == 0)
return ++cnt == k ? c : 0;
ll ret = 0;
if (c == 0) {
for (int i = 0; i < 10; ++i)
ret += hoge(n - 1, c * 10 + i, k);
}
else {
ll tmp = c %... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];... | 1 | 80,781,009 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int ,int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int a[MAXX];
int main()
{
_FastIO;
int n;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a , a... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int>a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
}
int max=a.at(0),min=a.at(0);
for(int i=1;i<n;i++){
if(min>a.at(i))
min=a.at(i);
if(max<a.at(i))
max=a.at(i);
}
cout << max-min << endl;
} | 1 | 8,947,884 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#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<ll> a(n);
ll sum = 0;
int ans = 1;... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N; cin >> N;
vector<ll> A(N);
rep(i, N){
cin >> A[i];
}
sort(A.begin(), A.end());
vector<ll> B(N);
B[0] = A[0];
for (int i... | 1 | 46,031,877 |
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <queue>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int bfs(vector<string>& t, int c,int h, int w) {
int si = 0, sj = 0;
int ti = 0, tj = 0;
REP(i,h)REP(j,w){
if(t[i][j] == c + '0'){
... | #include <assert.h>
#include <ctype.h>
#include <float.h>
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <algorithm>
#include <complex>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
... | 1 | 40,307,015 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::nume... | #include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cs... | 1 | 69,863,099 |
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define REP(i, m, n) for(... | #include <bits/stdc++.h>
#define rep(i,n) for(long long int i = 0; i < n; i++)
#define _rep(i,m,n) for(long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
const int N = 1000000;
const ll mod = 1000000007;
int main() {
... | 1 | 20,511,016 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T &a, T b)
{
if(a < b)
{
a = b;
return true;
}
return false;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int m1 = 0;
int m2 = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 1 | 17,333,140 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
int A, B, C, D;
cin >> A >> B >> C >> D;
if (A == C && B == D) cout << B-A << endl;
else if (A <= C && C < B && B <= D) {
cout << B - C << endl;
}
else... | #include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int A, B, C, D;
cin >> A >> B >> C >> D;
int AC = max(A, C);
int BD = min(B, D);
if (AC < BD)
cout << BD - AC << endl;
else
cout << 0 << endl;
return 0;
} | 1 | 25,761,000 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
bool even(string s){
int len = s.size();
for(int i=0;i<len/2;i++){
if(s[i] != s[i+len/2]){
return false;
}
}
return true;
}
int main(){
string s;
cin>>s;
int len = s.size(),dec=2,ans;
while(s.size() >= 2){
s = s.su... | #include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int end = s.size() % 2 == 0 ? s.size() - 2 : (s.size() - 1);
int half = end / 2;
int ans = 0;
while (end > 0){
if(s.substr(0, half) == s.substr(half, half)) break;
end -= 2;
half = ... | 1 | 95,518,862 |
#include <cstdio>
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
bool flag = 0;
for (int i = 0; i <= n; ++i)
for (int j = 0; j <= m; ++j)
if (i * m + j * n - i * j * 2 == k) {
flag = 1;
break;
}
puts(flag ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
ll gcd(ll a, ll b){
if (a%b == 0){
... | 1 | 31,953,335 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
int main() {
int N;
cin>>N;
vector<int>P(N);
vector<int>Q(N);
rep(i,N){
cin>>P[i];
}
rep(i,N){
... | #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_... | 1 | 100,374,621 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D;
cin >>A;
cout << 800*A - 200*(A/15) << endl;
} | #include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main()
{
long n,x,y,z,m;
cin>>n;
if(n%15==0)
cout<<(n*800)-200*(n/15)<<endl;
else{
x=n/15;
z=x*15;
y=n-z;
m=((z*800)-(200*x))+y*800;
cout<<m<<endl;
}
return 0;
} | 1 | 29,970,516 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long int
#define mod 1000000007
#define deb(x) cout ... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define forn(ii,a,b) for(int ii = (int)a ; ii < (int)b ; ii++ )
#define scan(any) for(auto &i:any) cin>>i;
#define debug(x) cerr << #x << " " << x << " -- \n"
#define I__O ... | 1 | 74,175,071 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
struct Node {
int key;
Node *next, *prev;
};
Node *nil;
void init() {
nil = (Node *)malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
}
void deleteFirst() {
if (nil->next == nil) return;
Node *delNode = nil->next;
nil->next = delNode->next;
delNode->ne... | #include <iostream>
#include <list>
using namespace std;
void fnLinkedListSet(list<int>& rltnNum)
{
list<int>::iterator itltn;
list<int>::iterator itltEND = rltnNum.end();
char acCmd[80];
int nMaxCmd, nNum;
cin.tie(0);
ios::sync_with_stdio(false);
cin >> nMaxCmd;
for (int i = 0; i < nMaxCmd; i++)
{
... | 1 | 76,354,948 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<n;i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int div[n+1];
ll ans=0;
for (ll i=1;i<=n;i++) {
ll d=n/i;
ans+=i*(d+1)*d/2;
}
cout << ans << endl;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
ll n;
ll a[10000001]... | 1 | 15,665,950 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
ll N;
cin >> N;
vector<ll> A(N), B(N);
rep(i, N) {
cin >> A[i];
B[i] = A[i] - i;
}
sort(B.begin(), B.end());
ll x = B[N / 2];
ll ans ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N; cin>>N;
vector<ll> B(N);
for(int i=0; i<N; ++i){ cin>>B[i]; B[i] -= i+1; }
sort(B.begin(), B.end());
ll l = accumulate(B.begin()+N/2+(N%2), B.end(), 0LL);
ll r = accumulate(B.begin(), B.begin()+N/2, 0LL);
cout<< l-r <<endl;
} | 1 | 93,483,397 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define mp make_pa... | #include <cstdio>
#include <iostream>
#include <cmath>
#include <limits>
#include <iomanip>
#include <cstring>
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int s;
long long r[2001];
long long mod = 1000000007;
cin >> s;
fill_n(r, 2001, 1);
r[0] = 0... | 1 | 85,118,505 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1e9
#define MAX 100005
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define ull long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define nl '\n'
#define zai <<' '<<
#define all(a) a.begin(),a.end()
#define pc __builtin_popcount
t... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 1000001;
const int MOD = 1000000007;
signed main() {
string s;
cin>>s;
int ans=0;
for(int i=0;i<s.size();i++)if(s[i]=='o')ans++;
if(ans+(15-s.size())>=8)cout... | 1 | 72,963,381 |
#include <bits/stdc++.h>
#include <string.h>
#include <vector>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
#define MOD 1000000007
int main()... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S, T;
cin >> S >> T;
int N = S.size();
vector<int> A(26, 0), B(26, 0), v1(N), v2(N);
int n = 1, m = 1;
for (int i = 0; i < N; i++)
{
int a = S.at(i) - 'a';
int b = T.at(i) - 'a';
if (A.at(a))
{
v1.at(i) = A.at(a);
... | 1 | 89,701,105 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templa... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int n, k;
cin >> n >> k;
if (n % k == 0) {
cout << 0 << endl;
} else ... | 1 | 24,236,977 |
#include <unordered_set>
#include <string>
#include <iostream>
using namespace std;
int main(){
int n; cin >> n;
string operation, target;
typedef unordered_set<string> set_t;
set_t dict;
for(int i=0;i<n;i++){
cin >> operation >> target;
if(operation == "insert"){
dict.in... | #include <iostream>
#include <string>
#include <vector>
const int max_key_length = 12;
class Dictionary
{
std::vector<int> _keys;
int _char_to_id(char);
int _to_hash(std::string);
public:
Dictionary();
~Dictionary();
void insert(std::string);
bool find(std::string);
};
Dictionary::Dictionary... | 1 | 39,639,556 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll m = 1e9 + 7;
int main() {
int x;
cin >> x;
if (x <= 599) cout << 8 << endl;
else if (x <= 799) cout << 7 << endl;
else if (x <= 999) cout << 6 << endl;
else if (x <= 1199) cout << 5 <<... | #include <bits/stdc++.h>
#define ll long long
#define ch char
#define st string
using namespace std;
ll a,b,c,d,e,f,g,h;
void Urvatullo_Atoev()
{
cin>>a;
if(a>=400 && a<=599)
{
cout<<8;
}
else if(a>=600 && a<=799)
{
cout<<7;
}
else if(a>=800 && a<=999)
{
cout<... | 1 | 86,194,842 |
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <string>
#include <algorithm>
#include <iomanip>
static const double PI = 3.14159265359;
int main()
{
std::string N;
std::cin >> N;
for (size_t i = 0; i < N.size(); ++i) {
if (N[i] == '7') {
std::cout << "Yes" ... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define int long long
#define dip(type,var) type var; cin>>var;
#define dipi(x) int x; cin>>x;
#define w(x) int x; cin>>x; while(x--)
#define mka(... | 1 | 97,267,790 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<ll, ll>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (ll i = begin; i < n; i++)
#define repe(i, begin, n) for (ll i = begin; i <= n; i++)
#define repr(i, begin, n) for (ll i = begin; i > begin - n; i--)
#define repre(i, begi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
int l = (n - 1) * (n - 2) / 2;
if (l < k) {
cout << -1 << endl;
return 0;
} else {
cout << (n - 1) + l - k << endl;
for (int i = 2; i <= n; i++) cout << 1 << " " << i << endl;
for (int... | 1 | 69,246,602 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define pb push_back
#define ull unsigned long long
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define mat vector<vector<ll>>
mat cn(ll n, ll m){return v... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using ld = long double;
int INF = 1e9;
vector<int> cnt(200005);
vector<bool> seen(200005);
void dfs(const vector<vector<int... | 1 | 54,977,866 |
#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<cstdio>
#include<bits/stdc++.h>
typedef long long int ll;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR_IN(i, a, b) for(int i = (a); i < (b); i++)
#define BETWEEN(x, a, b) ((x) >= (a) && (x) <= (b))
#define BIT(b, i) (((b) >> (i)) & 1)
#define LOG_F 1
#define LOG(...) if(LOG_F) fprintf(stderr, __V... | 1 | 91,171,397 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int h,w;
char grid[21][21];
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int dfs(int x,int y){
if(grid[y][x]=='#')return 0;
grid[y][x]='#';
int sum=1;
for(int i=0;i<4;i++){
int nx=x+dx[i],ny=y+dy[i];
if(0<=nx && nx<w && 0<=ny &&... | #include<iostream>
#include<string>
using namespace std;
char map[20][20];
int W,H;
int cnt;
void fac(int y,int x){
map[y][x]='#';
cnt++;
if(map[y+1][x]=='.' && y < H-1)
fac(y+1,x);
if(map[y-1][x]=='.' && y > 0)
fac(y-1,x);
if(map[y][x+1]=='.' && x < W-1)
fac(y,x+1);
if(map[y][x-1]=='.' && x > 0... | 1 | 82,263,227 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N ;
int li;
int ri;
int result;
result = 0;
for (int i = 0; i < N; i++)
{
cin >> li;
cin >> ri;
result = result + (ri-li) + 1;
}
cout << result << endl;
} | #include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
int ans;
signed main(){
ios_base::sync_with_stdio(0);
int n;
cin>>n;
whi... | 1 | 33,618,021 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector <int> k(M);
vector<vector<int>> s(M);
for (int ii = 0; ii < M; ++ii){
cin >> k[ii];
for (int jj = 0; jj < k[ii]; ++jj){
int tmp;
cin... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,M; cin >> N >> M;
vector<vector<int>> s(M);
for(int i = 0; i< M; i++){
int k; cin >> k;
for(int j = 0; j < k; j++){
int a; cin >> a; a--;
s[i].push_back(a);
}
}
vector<int> p(M);
for(i... | 1 | 15,603,806 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string t,h ;
int n,tl,hl,tp,hp;
tp=0;
hp=0;
cin >> n;
for(int i = 0; i< n; ++i){
cin >> t >> h;
tl = t.size();
hl = h.size();
for(int j=0; j < tl && j < hl;j++){
if(t[j] > h[j]){
tp += 3;
break;
}
else if(t[j]<h[j... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
using namespace std;
typedef long long ll;
int main(){
string taro[1000], hanako[1000];
int n, score_t=0, score_h=0;
cin>>n;
for(int i=0; i<n; ++i){
cin>>taro[i]>>hanako[i];
if(taro[i] > hanako[i]){
score_t += 3;
}else if... | 1 | 88,323,460 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n);i>0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pi 3.141... | 1 | 30,599,182 |
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | #include<bits/stdc++.h>
using namespace std;
long long n,m,a=1,c;
string s;
bool b;
int main(){
cin>>n;
vector<int>v;
for (int i=1; i<=sqrt(n); i++){
if (n%i==0){
v.push_back(i);
}
}
cout<<v[v.size()-1]+(n/v[v.size()-1])-2<<endl;
} | 1 | 8,905,439 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
int main(){
int lx,ly,rx,ry;
int w,h,n;
cin >> w >> h >> n;
lx=0; ly=0;
rx = w; ry = h;
rep(i,n){
int a,b,c;
cin >> a >> b >> c;
if(c==1) lx = max(lx,a);
if(c==2) rx =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
void xinf(int x,int y,int W,int H,bool xy[][101]){
for(int i = 0;i <= x;i++){
for(int j = 0;j <= H;j++){
xy[i][j] = false;
}
}
}
void xsup(int x,int y,int W,int H,bool ... | 1 | 22,251,681 |
#include <bits/stdc++.h>
using namespace std;
void kun (int x){
if(x >= 400 && x<= 599){
cout << "8";
} else if (x >= 600 && x<= 799){
cout << "7";
} else if (x >= 800 && x<= 999){
cout << "6";
} else if (x >= 1000 && x<= 1199){
cout << "5";
} else if (x >= 1200 && x<... | #include <bits/stdc++.h>
using namespace std;
int main(){
int X = 0;
cin >> X;
if ((400 <= X) && (X < 600)){
cout << "8" << endl;
}
if (600 <= X && X < 800){
cout << "7" << endl;
}
if (800 <= X && X < 1000){
cout << "6" << endl;
}
if (1000 <= X && X < 1200){
cout << "5" << endl;
}
... | 1 | 40,175,141 |
#include <iostream>
#include <cstdio>
using namespace std;
const int MAX = 10005;
int c[MAX];
int main(void)
{int n;
int *a, *b;
scanf("%d", &n);
a = new int[n + 1];
b = new int[n + 1];
for (int i = 0; i < n; ++i)
{
scanf("%d", &a[i]);
++c[a[i]];
}
int i;
bool flag = false;
for (i = 0; i <= MAX; ++i)
{
... | #include<iostream>
using namespace std;
int main(void) {
unsigned short A[2000001], B[2000001];
int C[10001], n;
cin >> n;
for (int i = 0; i <= 10000; i++) {
C[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> A[i + 1];
C[A[i + 1]]++;
}
for (int i = 1; i <= 10000; i++) C[i] += C[i - 1];
for (int i = 1; i <=... | 1 | 100,602,455 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
long long int n, m, v1, v2;
cin >> n >> m;
long long int l[m], r[m];
for (long long int i = 0; i < m; i++)
{
cin >> l[i] >> r[i];
}
v1 = l[0];
v2 = r[0];
for (long long int i = 1; i < m; i++)
{
... | 1 | 80,938,658 |
#include <iostream>
using namespace std;
void CountingSort(int A[], int B[], int n, int k)
{
int* C = new int[k + 1];
for (int i = 0; i < k + 1; ++i)
{
C[i] = 0;
}
for (int i = 0; i < n; ++i)
{
C[A[i]]++;
}
for (int i = 1; i < k+1; ++i)
{
C[i] = C[i - 1] + C[i];
}
for (int i = n - 1; i >= 0; --i)
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for(int i = 0; i < n; ++i)
#define INF (2e9)
ll n, A[2000001];
ll B[2000001], C[10001];
int main() {
cin >> n;
REP(i, n) cin >> A[i];
REP(i, 10001) C[i] = 0;
REP(i, n) C[A[i]]++;
for(int i = 1; i <= 10000; ++i) C[i] += C[i-1... | 1 | 77,817,844 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int inf=... | #include <bits/stdc++.h>
#pragma once
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e16;... | 1 | 82,336,431 |
#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
int main(){
string data[] = { ".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" };
char inp;
int n, cnt, num;
string ans;
cin >> n;
getchar();
for (int i = 0; i < n; i++){
cnt = 0;
ans = ("");
while (1){
inp = getc... | #include "bits/stdc++.h"
using namespace std;
char c1[] = { ' ', '.', ',', '!', '?', };
char c2[] = { 'c', 'a', 'b', };
char c3[] = { 'f', 'd', 'e', };
char c4[] = { 'i', 'g', 'h', };
char c5[] = { 'l', 'j', 'k', };
char c6[] = { 'o', 'm', 'n', };
char c7[] = { 's', 'p', 'q', 'r', };
char c8[] = { 'v', 't', 'u', };
cha... | 1 | 83,317,622 |
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstring>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <cctype>
typedef long long int ll ;
typedef unsigned long long int ull ;
using namespace std ;
int main(void)
{
ios_base::sync_with_stdio... | #include <iostream>
#include <cmath>
using namespace std;
#define ll long long
ll n;
int main ( void )
{
cin >> n;
for ( int i = sqrt ( n ) ; i >= 1 ; i-- ) {
if ( n % i == 0 ) {
cout << ( n / i ) + i - 2 << endl;
break;
}
}
return 0;
} | 1 | 99,683,311 |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
signed main(){
Int n,m;
cin>>n>>m;
vector<vector<Int> > G(n);
for(Int i=0;i<m;i++){
Int u,v;
cin>>u>>v;
u--;v--;
G[u].emplace_back(v);
G[v].emplace_back(u);
}
vector<Int> used(n,-1);
Int cnt=0,flg=0;
function<void(In... | #include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#define REP(i,x) for(int i=0 ; i<(i... | 1 | 78,872,273 |
#include <bits/stdc++.h>
#include <iostream>
#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 fi first
#define se second
#de... | #include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define pi 3.14159265358979323846
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b... | 1 | 23,022,337 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N;
string S;
cin >> N >> S;
int cnt = 1;
char pre = S[0];
for(int i=1; i<N; i++){
if(pre==S[i]) continue;
else{
pre = S[i];
cnt ++;
}
}
cout << cnt << endl;
return 0;
} | #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 ... | 1 | 24,970,460 |
#include<iostream>
#include<cmath>
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
typedef long long int ll;
const ll maxn=(2*1e5)+2;
ll c;
void dfs(ll node,vector<ll>adj[],ll visited[])
{
ll i;
c++;
visited[node]=1;
for(i=0;i<adj[node].size();i++)
{
if(!visited[adj[node][i]]... | #include <bits/stdc++.h>
#include <iomanip>
#define M 100000
#define MAX 1000000001
#define MIN -10000000000000000
#define mod 1000000007
#define ss second
#define ff first
#define ll long long int
#define pb push_back
#define ld double
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
in... | 1 | 13,999,652 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include<iomanip>
#include<cassert>
#include<bitset>
#include<sstream>
using namespace std;
... | #include<bits/stdc++.h>
using namespace std;
#define sz 100005
#define ff first
#define ss second
#define nl printf("\n");
#define ll long long int
char f,g;
bool flag;
pair < int ,int > pi;
map < int , int > mp;
vector < pair < int , pair < int, int > > > v,va,vb;
vector < pair < int , pair < int, int > > > vp;
int ar... | 1 | 43,721,273 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int main(void)
{
int n, m; cin >> n >> m;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
sort(a.begin(), a.end());
if (4 * a[n - m]... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n,m,alla=0;
cin>>n>>m;
vector<int> a(n);
for(int i=0;i<n;i++)
{
cin>>a[i];
alla+=a[i];
}
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
if(a[m-1]*(4*m)<alla) cout<<"No"... | 1 | 75,899,784 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n,i = 1,sqrt;
while (cin >> n){
sqrt = 0;
i =0;
while (i * n < 600){
sqrt += n * pow(i*n,2);
i++;
}
cout << sqrt << endl;
}
return 0;
} | #include <cstdio>
using namespace std;
int main()
{
int i,d;
while (scanf("%d",&d)!=EOF){
int sum=0;
for (i=d;i<=600-d;i+=d){
sum+=i*i*d;
}
printf("%d\n",sum);
}
return 0;
} | 1 | 30,235,401 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
rep(i,10000){
int x=i*100;
int y=i*105;
if(x<=n&&y>=n){
cout << 1 << endl;
return 0;
}
}
cout << 0 << endl;
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
#define rep(i,N) for(int i=0;i<(int)N;++i)
typedef long long ll;
using namespace s... | 1 | 59,962,978 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
char s[50][50];
cin >> h >> w;
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
cin >> s[i][j];
}
}
const int dx[4] = {0, 0, 1,-1};
const int dy[4] = {1,-1, 0, 0};
bool can1 = true;
fo... | #include <iostream>
#define ll long long int
#define N 55
using namespace std;
char s[N][N];
int dir[4][2]={0,1,1,0,0,-1,-1,0};
int a,b;
bool search(int x,int y){
for(int i=0;i<4;i++){
int xx = x+dir[i][0];
int yy = y+dir[i][1];
if(xx>=0&&xx<a&&y>=0&&y<b){
if(s[xx][yy]=='#')... | 1 | 82,880,783 |
#include<iostream>
int main(){
int n,a,b,c,d,f;
while(std::cin>>n){
f=0;
for(a=0;a<10;a++)
for(b=0;b<10;b++)
for(c=0;c<10;c++)
for(d=0;d<10;d++)
if(a+b+c+d==n)f++;
std::cout<<f<<"\n";
}
} | #include<bits/stdc++.h>
#define loop(i, a, b) for(int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
const int MOD = 1000000007;
const int inf = 1e8;
using vi = vector <int>;
using vvi = vector <vi>;
using vc = vector <char>;
using vvc = vector <vc>;
using vs = vector <string>;
using vvs = vec... | 1 | 98,059,840 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define revrepeat(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define revrep(i, n) ... | 1 | 284,987 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inlin... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
string s;
int main() {
cin >> s;
int cnt = 0;
int n ... | 1 | 38,140,665 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
++ex;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#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;
#define rep(i, n) for (ll i = 0; i < (n); i++)
... | 1 | 3,352,353 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)
#define range(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define INF 1e9
#define EPS 1e-9
#de... | #include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int N=1e5+3,inf=0x7fffffff;
int cnt,n,a[N],maxx,fail,minn=inf;
inline int read(){
int num=0,flag=1;
char c=getchar();
for(;c<'0'||c>'9';c=getchar())
if(c=='-') flag=-1;
for(;c>='0'&&c<='9';c=getchar... | 1 | 37,408,735 |
#include <iostream>
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define F first
#define S second
#define ll long long
const int MOD = 1e9 + 7;
const float epsilon = 0.0005f;
const float PI = 3.1415926535897932384626433f;
vector<pair<int,int>> dire{{0,1},{0,-1},{1,0},{-1,0}};
void solve(){
int d, t... | #include<iostream>
using namespace std;
int main()
{
long double d,t,s,T;
cin>>d>>t>>s;
T=(long double)d/(long double)s;
if(T<=t)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
return 0;
} | 1 | 70,908,849 |
#include<bits/stdc++.h>
#include<stdio.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) FOR(i,0,n)
#define _USE_MATH_DEFINES
#define f first
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define INF 1000000000000000000
#define MAXN (int)(1e7)+1
#define MOD 1000000007
using na... | #include <iostream>
using namespace std;
int main(void){
int cd=0;
char c;
for (int i=0; i<3; i++){
cin >> c;
cd = (cd<<1) | (c=='R'?1:0);
}
cout << (cd["01121123"]) << endl;
return 0;
} | 1 | 30,723,818 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
int d;
cin>>d;
if(d==22) cout<<"Christmas Eve Eve Eve"<<endl;
else if(d==23) cout<<"Christmas Eve Eve"<<endl;
else if(d==24) cout<<"Christmas Eve"<<endl;
else if(d==25) cout<<"Chr... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | 1 | 24,933,122 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<map>
#include<math.h>
#include<string>
#include <cctype>
#include <cstdlib>
#include<bitset>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#defin... | #include <iostream>
#include <string>
#include <utility>
#include <iomanip>
using namespace std;
#define rep(i,n) for((i)=0;(i)<(n);(i)++)
#define max(a,b) ((a)>(b) ? (a) : (b))
#define min(a,b) ((a)<(b) ? (a) : (b))
typedef long long ll;
typedef long double ld;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int main(){
l... | 1 | 57,801,556 |
#include<bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
int n, x, t;
cin >> n >> x >> t;
int ans = (n+(x-1)) / x;
int ans1 = ans * t;
cout << ans1;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll a,b,c;
cin>>a>>b>>c;
ll ans=ceil((a*1.0)/(b*1.0));
cout<<ans*c<<endl;
return 0;
} | 1 | 20,756,148 |
#include<cmath>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cstdio>
#include<map>
#define rep(i,n) for(int i=0;i<n;i++)
#define fori(i,k,n) for(int i=k;i<n;i++)
using namespace std;
const int dx[4] = { 0, 1, 0, -1 }, dy[4] = { 1, 0,... | #include <bits/stdc++.h>
using namespace std;
int memo[1000][15][30];
int n;
int main(){
int i,j,k,m,count =0;
cin >> n;
for(i=1;i<1000;i++){
for(j=1;j<=10;j++){
if(i%3==0)for(k=1;k<=20;k++){
memo[i][j][k]=count;
count++;
}
else if(j%2==1)for(k=1;k<=20;k++){
memo[i][j][k]=count;
count... | 1 | 66,720,179 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.