code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
int main(){
int A, B, C;
std::cin >> A >> B >> C;
int i=1;
while(1){
if (A*i % B == C){
std::cout << "YES" << std::endl;
break;
}
if (A*i % B == 0){
std::cout << "NO" << std::endl;
break;
}
i++;
}
} | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | 0 | 34,448,813 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string.h>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n; soeji--)
int m... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll a[20... | 0 | 76,752,006 |
#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... | #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... | 0 | 41,464,688 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#pragma warning (disable:4018)
#define INT_MAX 2147483647
using namespace std;
int main() {
int n;
cin >> n;
vecto... | #include<stdio.h>
#include<stdlib.h>
int main()
{
int a,b,c,d;
scanf("%d%d%d%d",&a,&b,&c,&d);
if(abs(a-c)<=d){
printf("Yes\n");
}
else if(abs(a-b)<=d && abs(b-c)<=d){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | 0 | 93,248,776 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, n;
cin >> w >> h >> n;
vector<int> x(n), y(n), a(n);
for (int i = 0; i < n; ++i) {
cin >> x.at(i) >> y.at(i) >> a.at(i);
}
vector<vector<bool>> area(w, vector<bool>(h, true));
for (int i = 0; i < n; ++i) {
switch (a.at(i)) {
... | #include <iostream>
#include <algorithm>
#include <climits>
#include <cstring>
using namespace std;
int flip=0, h, w, mp[105][105];
char board[105][105];
bool inside(int r, int c){
return r<=h && c<=w;
}
int dp(int r, int c){
int sum =0;
if(r==h && c==w){
if(board[h][w]=='#'){
sum=1;
... | 0 | 100,887,371 |
#pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define... | #include<bits/stdc++.h>
#include<vector>
#define ll long long
#define boostUP ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define fsr(i,n) for(ll i=0;i<n;i++)
#define fcr(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define sz(arr) sizeof(arr)/sizeof(arr[0])
using namespace std;
int main(){
ll n,k;
c... | 0 | 23,180,495 |
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#define ll long long int
#define inf 1000000
int main(){
int h,w,m;
cin>>h>>w>>m;
map<int,int> r;
map<int,int> c;
map<int,map<int,int> > mat;
vector<pair<int,int> > tp;
for(int i=0;i<m;i++){
int a,b;
cin>>a>>b;
r[a]++;
c[b]++;
mat[a][b... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 33,096,081 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string N;
cin >> N;
int Z = 0, O = 0;
for(auto c : N){
if(c == '0')Z++;
else O++;
}
cout << min(Z, O)*2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | 0 | 84,229,796 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
long long n;
cin >> n;
long long x[n];
for(long long i = 0; i < n; i++) cin >> x[i];
long long minv = 1e9;
for(long long i = -1000; i <= 1000; i++){
long long sum = 0;
for(long long j = 0; j < n; j++){
... | #include <bits/stdc++.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++)
int main() {
long m,k;
cin >> m>>k;
if(k==0){
rep(i,1<<(m+1)){
cout<<i/2<<" ";
}
}
else{
if(m==1||k>=(1<<m)){
cout<<-1<<endl;
... | 0 | 30,920,753 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
const int vx[] = {-1, 1, 0, 0};
const int vy[] = {0, 0, -1, 1};
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> g(h + 2, vector<char>(w + 2, '.'));
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
cin >> g[i][j];... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (int)(b); i--)
#define all(x) (x).begin(), (x).end()
using i32 = int32_t;
using i64 = int64_t;
using f32 = float;
using f64 = double;
using P = pair<int, int>;
template ... | 0 | 84,965,766 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(A) A.begin(),A.end()
void ALLIN1_NUMBER(vector<ll>& V)
{
for(auto& x : V)
{
cin >> x;
}
}
void ALLOUT_NUMBER(vector<ll> V)
{
ll N = V.size();
for(ll i=0;i<N;i++)
{
cout << V[i];
if(i<N-1) cout... | 0 | 37,824,328 |
#include <bits/stdc++.h>
#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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | #include <iostream>
using namespace std;
int main(){
int n;
long int a[5000],sum,ans;
while(1){
cin >> n;
if(n==0) break;
sum=0;
ans=-1000000;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
sum=0;
for(int j=0;i+j<n;j++){
sum+=a[i+j];
if(ans<sum){
ans=... | 0 | 71,122,243 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
int x=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
const int ps=33;
int n,X[1010],Y[1010];
int pw[ps];
int dir[4][2]={{0,1},{... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include<ext/pb_ds/detail/standard_policies.hpp>
#define pi acos(-1)
#define pb push_back
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define MAX 300005
#define INF 0x3f3f3f3f
tem... | 0 | 37,869,393 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using Int = int64_t;
Int solve() {
Int N, sumA = 0, sumB = 0;
cin >> N;
vector<Int> A(N), B(N);
for (auto& i : A) {
cin >> i;
sumA += i;
}
for (auto& i : B) {
cin >> i;
sumB += i;
... | #include <bits/stdc++.h>
#include <string>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#define ll long long
#define pi (acos(-1))
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
int main()
{
int n, ... | 0 | 80,009,391 |
#pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void c... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <set>
#include <utility>
#include <functional>
#include <cstring>
using namespace std;
typedef long long ll;
typedef pair<int, int> p... | 0 | 46,339,983 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
typedef long long int ll;
typedef long double ld;
#define endl '\n'
#define loop(i,m,n) for(ll i=m;i<n;i++)
#define loope(i,m,n) for(ll i=m;i<=n;i++)
#define epool(i,m,n) for(ll i=m;i>=n;i--)
#define mod 1000000007
#define mod2 998244353
#define deb(x) c... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
using namespace std;
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... | 0 | 32,294,242 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
c... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 0 | 80,119,158 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,N-1,0)
#define RREPS(i,n) RFOR(i,N,1)
#define int long long
#define mp make_pair
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
map<pair<int, int>, ll> m;
vector<vector<int> > v(n);
for(int i = 0; i < n - 1; i++){
int a, b;
cin >> a >> b;
a--;
b--;
v[b].push_back(a);
v[a].push_back(b... | 0 | 76,094,627 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
int main(){
int n;
string s;
cin >> n;
cout << 800*n-200*(n/15) << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
string s,t;
map<char,int>mp;
map<int,char>mpinv;
set<char>ve... | 0 | 91,996,236 |
#include <bits/stdc++.h>
using namespace std;
#define sz(a) (int)((a).size())
#define all(c) (c).begin(), (c).end()
#define debug(v) {for (auto z : v) {cerr << z << ' ';} cerr << endl;}
using ll = long long;
using ii = pair<int,int>;
using vi = vector<int>;
using vll = vector<long long>;
using vii = vector<pair<int,int... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<map>
using namespace std;
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; } retu... | 0 | 84,581,190 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a==b&&b==c) printf("Yes");
else printf("No");
} | #include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
const int inf = 0x3f3f3f3f3f3f3f3LL;
const int mod = (int)1e9 + 7;
using namespace std;
#if LOCAL
#include "../../tr.h"
#else
#define tr(...)
#define endl '\n'
#endif
template<class T, class T2> void ... | 0 | 64,592,607 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, N1, N2;
cin >> N;
int ans = 0;
for (int N1 = 1; N1 < N; N1++) {
N2 = N - N1;
if (N1 >= N2) {
break;
}
ans++;
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MA... | 0 | 47,187,026 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const ll INF = 1LL<<60;
int main(){
ll a,b;
cin >> a >> b;
if(a<b)swap(a,b);
ll A = a, B = b, r;
r = A % B;
while(r!=0){
A = B;
B = r;
r = A % B;
}... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end()
#define fi first
#d... | 0 | 69,966,629 |
#include<stdio.h>
int main()
{
int W, H, x, y, r;
scanf("%d%d%d%d%d", &W, &H, &x, &y, &r);
if ((x>=r) && (x<=W - r) && (y >= r) && (y <= H - r))
{
printf("Yes\n");
}
else
{
printf("No\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin >>S>>T;
for(int j=0;j<S.size();j++){
string A=S;
for(int i=0;i<S.size();i++){
if(i==S.size()-1){
S.at(0)=A.at(S.size()-1);
break;
}
S.at(i+1)=A.at(i);
}
if(S==T){
cout <<"Yes"<<endl;... | 0 | 40,491,916 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
int k; cin >> k;
int* arr = new int[n];
for (int i = 0; i < n; i++){
cin >> arr[i];
}
sort(arr, arr+n);
int sum = 0;
for (int i = 0; i < k; i++){
sum += arr[i];
}
cou... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll... | 0 | 93,498,586 |
#include <iostream>
using namespace std;
long long XORsum(long long a)
{
if (a % 4 == 0) return a;
if (a % 4 == 1) return 1;
if (a % 4 == 2) return 1 ^ a;
if (a % 4 == 3) return 0;
}
int main(int argc, char const *argv[])
{
long long A, B;
cin >> A >> B;
A--;
long long sumA = XORsum(A);... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | 0 | 67,875,104 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ll long long
#define pii pair<int,int>
void test_case()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
int mx=a[0], ans=1;
for(int i... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin>>S>>T;
int N=S.size(),a=0;
for(int i=0;i<N;i++){
string A,B;
for(int j=0;j<i;j++){
A.push_back(S.at(j));
}
for(int j=i;j<N;j++){
B.push_back(S.at(j));
}
string C=B+A;
if(C==T){
a=1;
brea... | 0 | 64,338,080 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 10001;
vector<int> par(N);
int find(int a){
if(par[a] == a)
return a;
else{
par[a] = find(par[a]);
return par[a];
}
}
void merge(int a, int b){
par[find(a)] = find(b);
}
int main(){
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define COUT cout<<fixed<<setprecision(12)
#define CIN getline(cin,s)
ll MOD=1000000007;
void solve()
{
string s;
cin>>s;
ll sum=0;
for(ll i=0;i<s.size();... | 0 | 77,258,834 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <bitset>
#include <cstdint>
#include <initializer_list>
using namespace std;
using namespace __gnu_pbds;
#define data_set(type) tree<type,null_type,less<type>,rb_tree_tag,tree_order_... | 0 | 75,355,472 |
#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define endl "\n"
#define mod 1000000007
#define mod2 998244353
#define double long double
#define pb push_back
#define swap(x,y) (x^=y^=x^=y)
#define TC int TESTCASE;cin>>TESTCASE;while(TESTCASE--)
#defi... | #include <iostream>
#include <algorithm>
#include <vector>
#include <complex>
using namespace std;
int main(){
int n;
complex<int> c;
vector< complex<int> > v;
vector<int> srt;
while( cin>>n ){
if( v.size()==0 ){
c.real() = n;
c.imag() = 1;
v.push_back( c );
}else{
for( unsigne... | 0 | 39,846,372 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
#define fi first
#define se second
#define pb push_back
#define sqr(x) ((x) * (x))
const char *fin = "arc077_b.inp";
const char *fon = "arc077_b.out";
#define oo (int) (1e9+7)
#define maxn (int) (1e5+5)
int n, A, B;
int a[maxn], pos[maxn];
long lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<string> strings(n);
for (int i = 0; i < n; i++) {
string s; cin >> s;
sort(s.begin(), s.end());
strings[i] = s;
}
sort(strings.begin(), strings.end());
long long ans = 0;
long long curr = 0;
for (int i = 1; i < n; i++) {
... | 0 | 61,734,166 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector <int>
#define vl vector <ll>
#define all(v) (v).begin(),(v).end()
#define pb push_back
ll power(ll a, ll b){
ll res=1;
while(b>0){
if(b&1){res=(res*a);b--;}
a=(a*a);
b>... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#defin... | 0 | 72,373,012 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | 0 | 51,096,493 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define inv(n, a) for(int i = 0; i < n; i++) cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LINF 1e15
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
vector<ll> a, p;
ll f(int n, ll x)... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int> > bfs(n);
REP(i, m) {
int a, b;
cin >> a >> b;
bfs[a - 1].push_back(b - 1);
}... | 0 | 51,432,524 |
#include<cstdio>
int main ()
{
int n,k,N[100000],ans,sum;
while(1){
scanf("%d%d",&n,&k);
if(n==0&&k==0)break;
sum=0;
for(int i=0;i<n;i++){
scanf("%d",&N[i]);
if(i<k) sum+=N[i];
}
ans=sum;
for(int i=k;i<n;i++){
sum=sum+N[... | #include <bits/stdc++.h>
using namespace std;
const int MAX_HW = 1234;
int h, w;
long long dp[MAX_HW][MAX_HW];
char a[MAX_HW][MAX_HW];
int main() {
cin >> h >> w;
for (int i = 0; i < h; ++i)
for (int j = 0; j < w; ++j)
cin >> a[i][j];
dp[0][0] = 1;
for (int i = 1; i < h; ++i) {
... | 0 | 31,751,004 |
#include <iostream>
using namespace std;
int main()
{
int i, j;
for (i = 1; i < 10; i++) {
for (j = 1; j < 10; j++) {
int seki = i * j;
cout << i << "x" << j << "=" << seki << endl;
}
}
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
const ld pi = 3.14159265358979323846;
const ll mod = 10... | 0 | 53,548,041 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
if(n>=1&&n<=100&&k>=1&&k<=pow(10,5)){
if(n*500>=k)
cout<<"Yes"<<endl;
else if(n*500<k)
cout<<"No"<<endl;}
return 0;} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll n;
cin >> n;
rep(i, n, 1000){
if(i % 111 == 0) {
cout << i << endl;
return 0;
}
}
return 0;
} | 0 | 83,233,672 |
#include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main() {
int n ;
cin >> n ;
vector<int> w (n) ;
rep(i, ... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 0 | 38,984,930 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define INF 1000000000000000
#define MOD 1000000007
int main(){
ll N;
cin>>N;
vector<ll> a(N);
for(ll i=0;i<N;i++){
cin>>a.at(i);
}
bool flag=true;
for(ll i=0;i<N;i++){
if(a.at(i)>=N){
flag=false;
}
}
if(flag){
cou... | #include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
#define MAX_V 100010
struct edge {
int to;... | 0 | 51,381,974 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int a, b, c, d; cin >> a >> b >> c >> d;
cout << min(a, b) + min(c, d) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int n;
int main()
{
while (cin >> n)
{
if (n == 0)
return 0;
vector<ll> a(n);
for (int i = 0; i < n; i++)
{
... | 0 | 66,510,536 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | 0 | 83,767,052 |
#include <stdio.h>
int main() {
char a[10];
scanf("%s", &a);
(a[2] == a[3] && a[4] == a[5]) ? puts("Yes") : puts("No");
return 0;
} | #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 int long long int
#define ld long double
#define pii pair<int,int>
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_se... | 0 | 73,827,301 |
#include <bits/stdc++.h>
using namespace std;
int read();
int n, L, T;
int M(int x) { return x >= L ? x - L : x; }
int x[200005], dire[200005], q[2];
int res[200005];
vector<int> p[2];
int tmp;
int to(int a) {
int rt = M((x[a] + (dire[a] ? 1 : -1) * T) % L + L);
rt += L - tmp;
return rt > L ? rt - L : rt;
}... | #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(){
vector<int> pow(200);
for(int i=1; i<=200; i++){
pow[i] = i*i;
}
int n, d;
cin >> n >> d;
... | 0 | 65,567,959 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.15f ",(double)(w) * (double)(h) / (double)(2));
if (w % 2 == 0 && h % 2 == 0 && x == w / 2 && y == h / 2) cout << 1;
... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=1000000007;
#define INF (1<<30)
#define LINF (lint)(... | 0 | 98,670,878 |
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
#define MAX_NUM 2000000
#define MAX_VALUE 10000
void print_array(int A[], int n) {
for(int i=0; i<n; i++) {
printf("%d", A[i]);
if(i != n-1) {
printf(" ");
}
}
}
void counting_sort(int A[], int B[], int n) {
int cnt[... | #include<bits/stdc++.h>
using namespace std;
int a,b,n,x,y;
int main(){
while(1){
int memo[19][19]={0},check[19][19]={0};
cin>>a>>b;
if(a==0 && b==0)break;
cin>>n;
memo[0][1]=1;
for(int i=0;i<n;i++){
cin>>x>>y;
check[x][y]=1;
}
for(int i=1;i<=a;i++){
for(int j=1;j<=b;... | 0 | 75,893,078 |
#include<stdio.h>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<iterator>
#include<iomanip>
#include<string>
using namespace std;
int palindrome (string s)
{
for (int i=0; i<s.size()/2; i++)
{
if (s[i]!=s[s.size()-1-i]) {retu... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<int,int>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++... | 0 | 87,543,124 |
# include <bits/stdc++.h>
# define sz(x) (int)((x).size())
# define F first
# define S second
# define pb push_back
# define ub upper_bound
# define lb lower_bound
# define all(x) x.begin(), x.end()
# define pqueue priority_queue
# define mset multiset
# define umap unordered_map
# define Speed() ios_base::sync_with_st... | #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
int main() {
while (1) {
string st; cin >> st;
if (st == "-") {
break;
}
else {
int N; ... | 0 | 38,179,051 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll... | 0 | 42,464,397 |
#include <iostream>
#include <set>
#include <map>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <climits>
#include <math.h>
#include <cassert>
#include <unordered_map>
using namespace std;
#pragma warning(disable ... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <stack>
#include <functional>
#include <sstream>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=j;i>(n);i--)
type... | 0 | 22,603,957 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main(){
int N;
cin >> N;
map<string, ll> M;
rep(i, N){
... | #include<bits/stdc++.h>
#define int long long
#define for1(i, n) for(int i = 1; i <= (n);i++)
using namespace std;
int k, a[123567], l = 2, r = 2;
signed main() {
cin >> k; for1(i, k)cin >> a[i];
for (int i = k; i >= 1; i--) {
if (l % a[i] != 0)l += a[i] - l % a[i];
r -= r % a[i];
if (l > r) {
cout << "-1\n"... | 0 | 15,170,190 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 998244353;
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
int N; cin >> ... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 74,885,768 |
#include <stdio.h>
int main(){
int n,l,r;
char a[1001],temp[1001],c[1001];
scanf("%s",a);
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s",temp);
if(temp[2]=='p'){
scanf("%d%d",&l,&r);
r++;
scanf("%s",c);
for(int j=0;j<r-l;j++){
... | #include<stdio.h>
int main()
{
int k, a, b, i;
int count = 0;
scanf("%d", &k);
scanf("%d %d", &a, &b);
for (i = a; i <= b; i++)
{
if (i % k == 0)
{
count++;
}
}
if (count > 0)
{
printf("OK\n");
}
else
{
printf("NG\n");
}
return 0;
} | 0 | 21,819,818 |
#include<iostream>
using namespace std;
int main(){
string str; cin >> str;
int q; cin >> q;
for (int i = 0; i < q; i++){
int a,b;
string oreder; cin >> oreder;
if (oreder == "print"){
cin >> a >> b;
... | #include<bits/stdc++.h>
using namespace std;
map<int,map<int,bool> > data;
long long rem[10];
int posx[]={-1,0,1};
int posy[]={-1,0,1};
int h,w,n;
int chk(int x,int y)
{
int r=0;
for(int c=0;c<3;c++)
for(int c2=0;c2<3;c2++)
{
if (data.find(x+posx[c])!=data.end()&&data[x+posx[c]].find(y+posy[c2])!=data[x+pos... | 0 | 93,179,985 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
for (int i = 0; i < 3; i++) {
string s;
cin >> s;
printf("%c", s[0] + ('A' - 'a'));
}
printf("\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H;
cin >> H;
vector<int> vec(H,0);
for (int i=0; i<H; i++){
int a;
cin>>a;
vec.at(i)+=a;
}
int x=0;
int s=0;
if (vec.at(0)==2){
x++;
cout<<x<<endl;
}
else{
for (int i=0; i<H; i++){
if(vec.at(s... | 0 | 20,623,741 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
priority_queue<int> pq;
int a[n];
int sumpos = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > 0) sumpos += a[i]... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H,W,K,ans=0;
cin >> H >> W >> K;
vector<string> C(H);
for(int i=0;i<H;i++) cin >> C.at(i);
for(int i=0;i<(1<<H);i++){
for(int j=0;j<(1<<W);j++){
int cnt = 0;
for(int m=0;m<H;m++){
for(int n=... | 0 | 44,141,575 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #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;
const int MAX_N = 1005;
ll x[MAX_N],y[MAX_N],z[MAX_N],w[MAX_N];
ll f(int a)
{
if (a == 0) return ll(1);
else return ll(-1);
}
int main()
{
int N,M;
cin >> N >> M;
rep(i,N)
{
c... | 0 | 35,273,599 |
#include<stdio.h>
int main()
{
int n,x;
scanf("%d",&n);
x=(n-2)*180;
printf("%d",x);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
int a=(n+1)/2,b=n/2;
vector<int> v(n),o(a),e(b);
rep(i,n) cin >> v.at(i);
rep(i,a) o.at(i)=v.at(2*i);
rep(i,b) e.at(i)=v.at(2*i+1);
sort(o.begin(),o.end());
... | 0 | 54,586,912 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int a[10005],ans=0,n;
int main()
{
cin>>n;
for(int i=1;i<=2*n;i++)
{
cin>>a[i];
}
sort(a+1,a+1+2*n);
for(int i=1;i<=2*n;i+=2)
{
ans+=a[i];
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y... | 0 | 38,031,767 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include <iostream>
using namespace std;
int d[1005][1005];
int edit_distance(string& s1, string& s2)
{
for(int i = 0; i < 1005; ++i){
d[0][i] = i;
d[i][0] = i;
}
for(int i = 1; i <= s1.size(); ++i){
for(int j = 1; j <= s2.size(); ++j){
d[i][j] = min(d[i][j - 1] + 1, min(... | 0 | 25,858,473 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
int main()
{
int a[3];
cin >> a[0] >> a[1] >> a[2];
if (a[0] < a[1] && a[1] < a[2])
cout << "Yes" << endl;
else
cout << "No" << endl;
return (0);
} | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pw(x) (1LL << (x))
#define db(x) cerr << #x << " = " << x << endl
#define db2(x, y) cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"
#define db3(x, y, z) cerr << "(" << #x << ", " << #y << ",... | 0 | 8,886,504 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int x; cin >> x;
int ans = 1, t = x;
while (t % 360) t += x, ans... | #include<cstdio>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#defi... | 0 | 39,853,797 |
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <queue>
#define MOD (1000000007l)
#define rep(i, n) for(long i = 0; i < n; i++)
using namespace std;
void solve() {
long n, k;
stri... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 70,330,891 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i=0; i<n; i++) cin >> a[i];
map<int,int> mp;
int ans = 0;
for (int i=0; i<n; i++) {
if (mp[a[i]] == i+1) {
ans++;
}
mp[i+1] =... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define FILL0(x) memset(x,0,sizeof(x))
#define FILL1(x) memset(x,-1,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | 0 | 67,458,166 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
int N; cin >> N;
ll ans = 0;
for(int i=1; i<N; i++){
an... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i = a; i <= n; i++)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi v... | 0 | 45,292,413 |
#include <iostream>
#include <algorithm>
#include <queue>
#define N 300007
using namespace std;
typedef long long ll;
int a[N], prefix[N];
vector<int> b;
int main(int argc, const char * argv[]) {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n, now;
cin >> n;
for (int i = 0; i < n; i++) {
... | #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... | 0 | 31,791,286 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
rep(i, n) scanf("%d", &a[i]);
a.insert(a.begin(), 0);
a.insert(a.end(), 0);
int cost = 0;
rep(i, n + 1) {
cost += abs(a[i] - a[i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i=0; i<(n); ++i)
#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)
#define SZ(x) ((int)(x).size())
#define all(x) begin(x),end(x)
#define... | 0 | 3,892,283 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
vector<long long> len(55);
vector<long long> pat(55);
long long solve(long long n, long long x){
if (x == len[n]) return pat[n];
long long ans = 0;
x--;
if (x){
long long l = min(x,len[n-1]);
ans += solve(n-1,l);
x... | #include<bits/stdc++.h>
using namespace std;
bool edge[8][8];
int main() {
int n, m; cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y; cin >> x >> y;
edge[x-1][y-1] = edge[y-1][x-1] = true;
}
vector<int> ord(n);
for (int i = 0; i < n; i++) ord[i] = i;
int ans = 0;
do {
... | 0 | 5,650,283 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
ll ans2 = (n/15)*200;
ll ans = (n)*800;
cout<<ans-ans2<<endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <sstream>
#include <unordered_map>
using namespace std;
vector<string> split(const string &str, char delim){
vector<string> v;
string buffer;
stringstream ss(str);
while(getline(ss, buffer, delim)) v.push_back(buffer);
return v;
}
str... | 0 | 100,689,942 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++)cin >> A[i];
auto FindZero = find(A.begin(), A.end(), 0);
if (FindZero != A.end()) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
for (i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string S,T;
cin >> S >> T;
map<char, char> m;
bool possible=true;
for(int i=0; i<S.size(); i++){
char s=S.at(i);
char t=T.at(i);
if(m.count(s)){
if(m[s] != t) possible=false;
}
... | 0 | 92,489,223 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((C >= A) && (C <= B)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define Nmax 200010
#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define RFOR(i,a,b) for(long long i = (b-1);i>=a;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ITR(itr,mp) for(auto itr = (mp).begin(); itr != (mp).end(); ... | 0 | 33,191,600 |
#include <stdio.h>
#include <stdint.h>
#include <iostream>
#include <fstream>
#include <cassert>
#include <climits>
using namespace std;
#define DEBUG (0)
#if DEBUG
#define DPRINTF(...) do { \
printf("D(L%d) %s: ", __LINE__, __func__); \
printf(__VA_ARGS__); \
} while (false)
#else
#define DPRINTF(...)
#endif... | #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(... | 0 | 4,904,326 |
#include <iostream>
#include <ostream>
#include <istream>
#include <cmath>
#include <string>
#include <vector>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <vector>
#include <set>
#define pb pus... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | 0 | 10,649,002 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const ll mod = 1e9 + 7;
int x[maxn], y[maxn];
ll sufx, sufy, h, w;
void norm(ll & x)
{
while(x < 0) x += mod;
while(x >= mod) x -= mod;
}
int main()
{
int n, m;
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; ++i)
scanf(... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
map<int, int> factor(int n){
map<int, int> res;
for (int i = 2; i*i <= n; ++i) {
... | 0 | 27,893,972 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
int ma... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include<map>
using namespace std;
typedef long long ll;
int main() {
ll n, x, m;
cin >> n >> x >> m;
ll a = x;
ll ans = 0;
map<ll, int> mp;
vector<ll> fir;
ll dup = -1;
... | 0 | 34,497,866 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 76,424,788 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define mod 998244353
#define floop(i,a,b) for (int i=(a);i<(b);i++)
#define rloop(i,a,b) for (int i=(a);i>=(b);i--)
#define floopeq(i,a,b) for (int i=(a);i<(b);i++)
#define pa pair<int,int>
#... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long ... | 0 | 84,999,284 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descsort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
int main(void)
{
int n,k;
cin>>n>>k;
if(k==1)cout... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sz 100100
int a[sz];
int b[sz];
int c[sz];
int dpa[sz];
int dpb[sz];
int dpc[sz];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n; cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i] >> b[i] >> c[i];
for (int i = 1; i <=... | 0 | 32,054,055 |
#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() {
int N;
cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
vector<long long> s(N + 1, 0);
map<long long, long long> nums;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i,n,init) for(ll i=init;i<(n);i++)
#define repd(i,n,init) for(ll i=(n);i>=init;i--)
#define repm(i,m) for(auto i=m.begin();i!=m.end();i++)
int main()
{
st... | 0 | 43,936,251 |
#include <iostream>
using namespace std;
int main( void )
{
while ( 1 )
{
int d;
cin >> d;
if ( cin.eof() )
break;
int sum = 0;
for ( int i = d; i < 600; i += d )
{
sum += (i*i*d);
}
cout << sum << endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main(){
while(1){
long n, k;
long s[100001];
s[0]=0;
scanf(" %ld %ld", &n, &k);
if(n==0) break;
for(long i=0; i<n; ++i){
int a;
scanf(" %d", &a);
s[i+1] = s[i]+a;
}
long max=-1500000000;
for(int i=1; i+k<=n; ++i){
long tmp=s[... | 0 | 23,633,075 |
#include<cstdio>
main(){int n,i=1,f[45]={1,1};for(scanf("%d",&n);++i<=n;f[i]=f[i-1]+f[i-2]);printf("%d\n",f[n]);} | #pragma GCC optimize("O3")
#pragma GCC optimize("avx2")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <ra... | 0 | 13,627,296 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
typedef long long ll;
const ll INF = 1e+18;
int main(){
int N,M;
cin >>N>>M;
vector<ll> x(N),y(N),z(N);
vector<ll> sum;
rep(i,N) cin >> x[i] >> y[i] >> z[i... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
int n;
int input_num;
cin >> n;
vector<int> vec_num;
for(int i = 0;i < n;i++){
cin >> input_num;
vec_num.push_back(input_num);
}
int nmin=vec_num[0],nmax=vec_num[0];
long nsum = 0;
for (auto x ... | 0 | 57,302,300 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
ll N,A,B;
cin >> N >> A >> B;
ll T = A + B;
if(A == 0){
cout << 0 << endl;
return 0;
}
ll ans = A * ll(N/T);
ll r = N % T;
ans += min(A,r);
cout << a... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
using namespace std;
const int num = 100000;
int n;
const int NIL = -1;
struct Node {
int p, r, l;
};
Node T[num];
int D[num];
inline void rec(int u, int p) {
D[u] = p;
if (T[u].l != NIL)rec(T[u].l, p+1);
if (T[u].r != N... | 0 | 68,510,763 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
set<int> N;
N.insert(a);
N.insert(b);
N.insert(c);
cout << N.size() << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll n,x,a[10],count[10],k;
rep(i,9){
cin>>a[i];
count[i]=0;
}
cin>>n;
rep(i,n){
cin>>x;
rep(j,9){
... | 0 | 509,676 |
#include <iostream>
using namespace std;
int main(void){
int n,t,ans=0;
cin>>n>>t;
int t1=0,t2=0;
for(int i=0;i<n;i++){
t1 = t2;
cin>>t2;
ans += min(t2-t1,t);
}
ans += t;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using ll = long long;
int main() {
ll n, m; cin >> n >> m;
vector<pair<ll, ll>> a(n); REP(i, n) cin >> a[i].first >> a[i].second;
sort(a.begin(), a.end());
ll sum = 0; ll num = 0; ll cur = 0;
while(num ... | 0 | 79,428,847 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,c=1,x=0,v=0,i,p=0;
string s;
cin >> n >> s;
if(n%2!=0)
{
cout << "No" << endl;
return 0;
}
v=n/2;
if(s.substr(0,v)==s.substr(v))
{
cout << "Yes" <<endl;
}
else
{... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long a;
cin >> a;
long minv = a;
long maxv = a;
for (int i = 1; i < n; i++) {
cin >> a;
if (a < minv) {
... | 0 | 43,091,791 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
using namespace std;
#define int long long
#define double long double
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) str... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 27,687,249 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
int h[123];
vector<int> primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53,... | #include <iostream>
using namespace std;
int main(void){
int n = 1;
int pay ;
while (n){
int cent = 0;
cin >>n;
if (n==0){
break;
}
pay = 1000 - n;
if (pay >= 500){
pay -= 500;
cent++;
}
while (pay >= 100){
pay -= 100;
... | 0 | 26,784,581 |
#include <bits/stdc++.h>
#define N 200010
#define ll long long
using namespace std;
int n,m,fir[N],nxt[N<<1],to[N<<1],tot(1),vis[N],col[N],num,tag;
template <class Aqua>
inline void read(Aqua &s){
s=0; char c=getchar();
while (!isdigit(c)) c=getchar();
while (isdigit(c)) s=s*10+c-'0',c=getchar();
}
inline void add(i... | #include <iostream>
using namespace std;
int main(){
while(1){
int a;
for(int i=1; ; i++){
cin>>a;
if(a==0) break;
cout<<"Case "<<i<<": "<<a<<endl;
}
if(a==0) break;
}
} | 0 | 79,457,254 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define all(x) (x).begin(),(x).end()
const int INF=1e9+5;
const int N=2e5+5;
const int mod=1e9+7;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int x;
cin>>x;
int init=400;
int now=8;
while(1){
if(x>=init&&x<=init+199){
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T... | 0 | 96,530,276 |
#include<bits/stdc++.h>
#include<cstdlib>
using namespace std;
#define ll long long
#define in(x) scanf("%d",&x);
#define out(x) printf("%d",x);
#define ins(x) scanf("%s",x);
#define outs(x) printf("%s",x);
#define lin puts("");
#define _ putchar(' ');
int t;
ll i, j;
ll n, k , q, d, m, c, c1, c2, d1, x; ... | #include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;
int main(void)
{
int N_vertices, N_edges;
cin >> N_vertices>> N_edges;
vector< vector<int> > Graph(N_vertices, vector<int>(N_vertices, 0) );
vector<int> pe... | 0 | 90,630,841 |
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
long long gcd(long long N, long long M){
while ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 50,740,261 |
#include<bits/stdc++.h>
using namespace std;
long long n,k,vis[5005],p[5005],c[5005],sum[5005],ans=-1e18;
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>p[i];
for(int i=1;i<=n;i++)
cin>>c[i];
for(int i=1;i<=n;i++)
{
long long s=c[i];
vector<long long> t;
t.push_back(s);
... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define MOD 1000000007
#define fix(n) cout << fixed << setprecision(n)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for(long i=a; i<=b; ... | 0 | 11,951,445 |
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cmath>
#include <algorithm>
using namespace std;
using LL = long long;
using P = pair<int, int>;
#defi... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | 0 | 43,206,543 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
vector<int> t(5);
rep(i, 5) cin >> t[i];
vector<int> s(5);
rep(i, 5) s[i] = 10 + (t[i] - 1) / 10 * 10;
int ans = 1e5;
rep(i, 5) {
int u = 0;
rep(j,... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF 100000001
#define ll long long
#define ln cout<<endl;
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define double long double
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int dp[120][1050];
in... | 0 | 24,760,359 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
ll n;
cin>>n;
ll a[n];
for(int i=0;i<n;++i)cin>>a[i];
ll ans = 0; ll soul = 1;
for(int j=1;j<=65;++j){
ll count_e = 0,count_o = 0;
for(int i=0;i<n;++i){
if(a[i]&1)co... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(... | 0 | 93,082,016 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<pair<int, ll>>>;
const int INF = 1001001001;
vector<ll> dist;
vector<bool> seen;
Graph G;
void dfs(int v, ll d = 0){
seen[v] = true;
dist[v] = d;
for(auto p : G[v]){
int nv = p.first;
ll far = p.s... | #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 | 308 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int N; cin >> N;
vector<int> A(N);
for(int i=0; i < N; i++){
cin >> A[i];
}
sort(A.begin(),A.end());
vector<int> hantei(1000000,0);
int temp=-1;
for(int i: A){
if(temp == i){
hantei[i] += 1;
co... | #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... | 0 | 95,865,535 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 2e5 + 77;
int A[N];
int F(int a,int b){
string x = to_string(a);
string y = to_string(b);
return max(x.length(),y.length());
}
int32_t ma... | #include <iostream>
#include <cstring>
using namespace std;
namespace sorting_five_numbers
{
class SortingFiveNumbers
{
private:
static const int Size = 5;
int dataList[Size];
public:
SortingFiveNumbers(int target[]) {
memset(dataList, 0, Size);
for (int i... | 0 | 71,938,315 |
#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;
const long long MOD = 1000000007;
#define SET(x) memset(x, 0, sizeof(x))
#define SET2d(x,m,n) memset(x, 0, sizeof(x[0][0]) * m * n)
#define SETBOOL(x) memset(x,false,siz... | #include<iostream>
using namespace std;
int main(){
long long n,i,sum=1;
cin>>n;
for(i=1;i<=n;i++){
sum=sum*i;
}
cout<<sum<<endl;
return 0;
} | 0 | 42,022,132 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip... | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<math.h>
#include<assert.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long INF = 1LL << 40;
const doub... | 0 | 901,979 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.