code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include "bits/stdc++.h"
#define MOD 1000000007
#define INF 11234567890
#define in std::cin
#define out std::cout
#define rep(i,N) for(int i=0;i<N;++i)
typedef long long int LL;
typedef std::pair<LL, LL> P;
struct edge { LL to, cost; };
LL n, k;
LL d[112];
std::vector<edge>G[112];
void dijkstra(LL s)
{
std::priority... | #include <cstdio>
#include <algorithm>
using namespace std;
#define INF (1<<27)
int cost[100][100];
int main() {
int n,k;
while(scanf("%d %d",&n,&k),n) {
fill((int*)cost,(int*)(cost+100),INF);
for(int i=0;i<k;i++) {
int a,b,c;
scanf("%d",&a);
if(a==0) {
scanf("%d %d",&a,&b);
if(cost[a-1][b-1]==IN... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, x, y;
cin >> n >> m >> x >> y;
int X[100], Y[100];
int inin;
for (int i = 0; i < n; ++i)
{
cin >> X[i];
}
for (int i = 0; i < m; ++i)
{
cin >> Y[i];
}
sort(X, X+n);
sort(Y, Y+m);
bool ok = 0;
for (int i = x+1; i <= y; ++i)
{
if ... | /*
* Dice1.cpp
*
* Created on: 2014/08/08
* Author: WanWan1985
*/
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#includ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair <int, int>;
#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 each(i, mp) for (auto &i : mp)
const int INF = 1001001001;
int main()
{
int a;
cin >> a;
ll ans =... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e;
cin>>a;
cout<<a+a*a+a*a*a;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define rap(p, a, b) for (ll p = a; p <= b; p++)
#define per(p, a, b) for (ll p = a; p >= b; p--)
#define F f... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
//freopen("input.txt","r",stdin);
#endif
int a,b,c;
cin>>a>>b>>c;
if(a==b && b==c)
{
cout<<"No"<<endl;
}
else if((a==b && b!=c) || (a==c && c!=b) || (b==c && c!... | 1 |
#include <bits/stdc++.h>
//#include <math.h>
using namespace std;
//#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n... | #include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
int x,y,z,n,m,road[200005],rail[200005],connect[200005];
pair<pair<int,int>,int> total[200005];
int root (int ind) {
if (road[ind] == ind) return ind; else
return road[ind] = root(road[ind]);
}
void onion(int l, int r) {
if (root(l) !=... | 0 |
#include <iostream>
#include <string>
#include <map>
int main(){
std::string s;
std::cin >> s;
std::map<std::string, int> day = {
{"SUN", 0},
{"MON", 1},
{"TUE", 2},
{"WED", 3},
{"THU", 4},
{"FRI", 5},
{"SAT", 6}
};
std::cout << 7 - day[s] <... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int N, K, X;
string S;
cin >> S;
if(S == "SUN") cout << 7 << endl;
if(S == "MON") cout << 6 << endl;
if(S == "TUE") cout << 5 << endl;
if(S == "WED") cout << 4 << endl;
if(S == "THU") cout << 3 << endl;
if(S == "FRI") cout << 2 << end... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define N 300100
const int mod=1e9+7;
int a[8][2],f[N][8];
char s[N];
int main()
{
a[0][0]=1; a[0][1]=2;
a[1][0]=3; a[1][1]=4;
a[2][0]=5; a[2][1]=6;
a[3][0]=a[3][1]=1;
a[4][0]=1; a[4][1]=2;
a[5][0]=7; a[5][1]=2;
a[6][0]=a[6][1]=6;
a[7][0]=a[7][1]=5;
scanf("%s",s)... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 100000000
int main(){
int N;
cin>>N;
string S;
cin>>S;
for(int i=0;i<4;i++){
string ans;
if(i==0)ans="SS";
if(i==1)ans="WW";
if(i==2)ans="SW";
if(i==3)a... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
//#define _GLIBCXX_DEBUG
int prime(int N) {
if(N<2) return 0;
if(N == 2) return 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K,X; cin >> K >> X;
int N = X+K-1;
int M = X-K+1;
for(int i=M; i<=N; i++) {
cout << i << " ";
}
return 0;
} | 0 |
#include<cstdio>
using namespace std;
long long a[201];
char s[202];
int main(){
int t;
scanf("%d",&t);
for(int tt=1;tt<=t;tt++){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i]);
scanf("%s",s+1);
for(int i=n;i;i--){
if(a[i]==0)continue;
int u=60;
while(!(a[i]>>u&1))u--;
fo... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <bitset>
using ll = long long;
using namespace std;
// xorใฎๆใๅบใๆณ O(N^2)
// matใซๅบๅบใใกใๅ
ฅใ
// Tใฏbitsetใฏ็ก็(minใใชใใจใใใชใใใ)
template <typename T>
int gauss_jordan(vector<T> &mat) {
vector<T> bases;
for (auto e:mat... | 1 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef pair<ll,ll> PLL;
#define REP(x,l,u) for(ll x = l; x < u; x++)
#define RREP(x,l,u) for(ll x = l; x >= u; x--)
#define all(x) x.begin(), x.end... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
if(n==1){
cout << "Hello World" << "\n";
return 0;
}
else{
... | #include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
ll gcd(ll x,ll y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
int main(){
ll A,B,C,D,i,ans = 1;scanf("%lld%lld",&A,&B);
C = gcd(A,B);D = C;
for(i=2;... | 0 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | #include <iostream>
using namespace std;
int main() {
long d;
while(cin >> d) {
long count = 0;
for(int i=0; i<600; i+=d) {
count += d*i*i;
}
cout << count << endl;
}
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main(void){
int n,i,j,ans=0;
cin >>n;
int l[200];
int max,tmp;
while(cin>>j){
l[i] = j;
i++;
}
cout<<endl;
for(i=0;i<2*n-1;++i){
max=i;
for(j=i+1;j<2*n;++j){
if(l[max]<l[j]){
max=j;
}
}
tmp=l[max];
l[max]=l[i];... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int getResult(vector<int> &L, const int size){
sort(L.begin(), L.end());
int sum = 0;
for(int i = 0; i < size; i += 2){
sum += L[i];
}
return sum;
}
int main(){
int N;
cin >> N;
const int N2 = N * 2;
vector<int> L... | 1 |
#include <iostream>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0; i<(int)(n); i++)
signed main() {
int n;
cin >> n;
int s[n];
rep(i,n) {
char c;
cin >> c;
if(c == 'R') s[i] = 0;
if(c == 'G') s[i] = 1;
if(c == 'B') s[i] = 2;
}
int r[3][n+1];
rep(i,3) rep(... | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<cctype>
#include<string.h>
#include <stdlib.h>
#define PI 3.1415926
void swap(int* x, int* y) {
int a = *x;
int b = *y;
*x = b;
*y = a;
}
int factorial(int n);
int sum(int n, int*);
int ave(int n, int*);
int min(int n, int*), min(int n, int m);
int ma... | 0 |
#include<bits/stdc++.h>
using namespace std;
long long dp[2][3003];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=0,y=0,cnt=0,res=0,ttl=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long lon... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <queue>
#include <set>
#include <bitset>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long lon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using stkll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#de... | 0 |
#include <iostream>
using namespace std;
//const double PI = acos(-1);
using ll = long long;
using ull = unsigned long long;
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9+7;
#define REP(i,n) for (int i = 0; i < (n); i++)
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9+7)
#define i_5 (ll)(1E9+5)
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
ll inf=(ll)1E12;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_ba... | 1 |
#include <iostream>
#include <map>
using namespace std;
struct UF{
int par[200000];
int rank[200000];
void init(int n){
for(int i=0;i<n;i++){
par[i]=i;
rank[i]=0;
}
}
int find(int x){
if(par[x]==x)return x;
return par[x]=find(par[x])... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb pus... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int M = 1000000007;
int mod(int a){
return (a%M + M)%M;
}
int mul(int a, int b){
return mod(mod(a) * mod(b));
}
int add(int a, int b){
return mod(mod(a) + mod(b));
}
int sub(int a, int b){
return mod(mod(a) - mod(b));
}
main(){
int n; cin>>n;
i... | #include <iostream>
using namespace std;
#define MOD 1000000007
int main(int argc, const char * argv[]) {
int N;
cin>>N;
int *A=new int[N];
long long s=0,s2=0;
for(int i=0;i<N;++i){
cin>>A[i];
s+=A[i];
s%=MOD;
s2+=(long long)A[i]*A[i];
s2%=MOD;
}
s*=s... | 1 |
// โโโโโโโโ( โขฬชโ)โโโโโโโโโโโโโโโโโโโโโโโโ
// โโโโโโโโโโโโโ ]โโโโโโโโโโโโโโโโโ โโ
// โโโ
โโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโ
// [โโโโโโโโโโโโโโโโโโโ].โโโโโโโโโโโโโโ
// โฅโโฒโโฒโโฒโโฒโโฒโโฒโโค...โโโโโโโโโโโโ
//PointBlank's code (โโ _โ )
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using p... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin>>n;
vector<ll >v;
vector<ll >vp;
ll i,j,k;
ll a,b;
for(i=0; i<n; i++)
{
cin>>a;
v.push_back(a);
}
for(i=0; i<n; i++)
{
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int n = 1000000000;
for (int i = 0; i < N; i++){
int A;
cin >> A;
int a = 0;
while ( A % 2 == 0){
a++;
A /= 2;
}
if(n > a)
n = a;
}
cout << n << endl;
}
| #include<bits/stdc++.h>
//cervello|Phoenix
using namespace std;
#define ll long long int
#define eb emplace_back
#define mk make_pair
#define all(x) x.begin(),x.end()
#define mod 1000000007
vector<bool> prime(1000001,1);
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
for(int i=2;i*i<=1000000;i++)
... | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string.h>
#include <string>
#include <vector>
#include <limits.h>
#include <stack>
#include <queue>
#define maxn 1e9
#define pi acos(-1)
#define LL long long
using namespace std;
double aabs(double x)
{
if(x<0)return -x;
return x;
}... | #include<iostream>
#include<stdio.h>
#include<vector> // ๅฏๅค้ท้
ๅ
using namespace std;
static const int MAX = 1000000;
void printLine(int A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0) {
printf(" ");
}
printf("%d", A[i]);
}
printf("\n");
}
int insertionSort(int A[... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
//0=48,A=65,a=97
int main() {
int n;cin >> n;
string s,t;cin >> s >>t;
string m;
for(int i = 0; i < n; i++) {
bool x=true;
string y;
for(int j = i; j < n; j++) {
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(void){
int N;
string s, t;
cin >> N >> s >> t;
int ans = 2*N;
rep(i,N) {
if (s.substr(i,N-i) == t.substr(0,N-i) ){ ans = N+i; break;}
... | 1 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L"... | #include <iostream>
#include <fstream>
#include <cstdlib>
#include <math.h>
#include <utility>
#include <algorithm>
#include <functional>
#include <vector>
#include <numeric>
#include <bits/stdc++.h>
#define int long long
struct edge {
int to;
int cost;
};
using namespace std;
using vi = vector<int>;
using v... | 1 |
#include<cstdio>
using ull = unsigned long long;
const static int MOD = 1000000007;
const static int MAX_H = 100;
const static int MAX_W = 8;
ull dp[MAX_H+1][MAX_W], fibonacci[8] = {1, 1, 2, 3, 5, 8, 13, 21};
int main(){
unsigned H, W, K;
scanf("%u %u %u", &H, &W, &K);
if(W == 1){
printf("1\n");
... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typed... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
list<char> A;
list<char> B;
list<char> C;
string S_A,S_B,S_C;
cin >> S_A >> S_B >> S_C;
for(int i=0;i<S_A.size();i++) A.push_back(S_A[i]);
for(int i=0;i<S_B.size();i++) B.push_back(S_B[i]);
for(int i=0;i<S_C.size();... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a==b&&b==c) cout<<"No";
else if(a!=b&&a!=c&&b!=c) cout<<"No";
else cout<<"Yes";
return 0;
} | 0 |
#include<iostream>
int main()
{
int x, S;
std::cin >> x;
S = x * x * x;
std::cout << S << std::endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#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++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using n... | 0 |
#include<iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
if (B == 1) {
}
else {
for (int i = 1; i < 100; i++) {
if (i * A - i + 1 >= B) {
ans = i;
break;
}
}
}
cout << ans << endl;
return 0;
} | #include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int main(){
int day,mon[]={31,29,31,30,31,30,31,31,30,31,30,31},now,ans;
for(;;){
ans=0;
cin>>now>>day;
if(now==0)break;
for(int i=0;i<now-1;i++){
ans+=mon[i];
}
ans+=day;
ans=ans%7;
if(ans==1)pr... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
const long long mod = 1e9+7;
//////////////////////////////////
int main() {
string s; cin >> s;
if (s.size()%2 == 1) {
cout << "No" << endl;
return 0;
}
for(int i=0; i<s.size(); i+=2) {
if (s[i] == 'h' && s[i+1] == '... | #include <bits/stdc++.h>
using namespace std;
int main () {
int n;
cin >> n;
int a,b,c,d,e,f,g,h,i,s;
a = n/100000000;
b = n/10000000-10*a;
c = n/1000000-100*a-10*b;
d = n/100000-1000*a-100*b-10*c;
e = n/10000-10000*a-1000*b-100*c-10*d;
f = n/1000-100000*a-10000*b-1000*c-100*d-10*e;
g = n/100-10000... | 0 |
#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
#define mod 1000000007
ll gcd (ll x, ll y){
ll r = x % y ;
if(r == 0) ret... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin()... | 1 |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp ... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#define LL long long
using namespace std;
const int MAX=1e5+3;
LL a[MAX];
LL add[MAX];
inline bool myru(LL x,LL y){return x>y;}
LL rin()
{
LL s=0;
char c=getchar();
bool bj=0;
for(;(c>'9'||c<'0')&&c!='-';c=getchar());
if(c=='-')bj=1,c=g... | 1 |
/*
* @Author: wxyww
* @Date: 2020-05-21 15:53:33
* @Last Modified time: 2020-05-21 16:09:36
*/
#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<ctime>
#include<cmath>
using namespace std;
typedef long long ll;
const int N = 200010;
#... | #include<bits/stdc++.h>
using namespace std;
struct rectangle{
int h, w;
bool operator<(const rectangle &a)const{
if(w*w + h*h == a.w*a.w + a.h*a.h)
return h < a.h;
return w*w + h*h < a.w*a.w + a.h*a.h;
}
};
int main(){
vector<rectangle> ans;
for(int i = 1; i <= 150; i++) {
for(int j = i ... | 0 |
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) ... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//cout << fixed << setprecision(10);//
//ๆๅฐๅ
ฌๅๆฐ//
ll gcd(ll x, ll y) {
if (x == 0) return y;
re... | 0 |
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a[5];
char ans[5];
string b;
cin>>b;
for(int i=0;i<4;i++){
a[i]=b[i]-'0';
ans[i]='+';
}
for(int i=0;i<4;i++){
for(int j=0;j<4;j++){
int sum=0;
for(int k=0;k<4;k+... | #include <iostream>
using namespace std;
int main() {
int abcd;
cin >> abcd;
int num[4] = {abcd / 1000, (abcd / 100) % 10, (abcd / 10) % 10, abcd % 10};
int sum;
bool match = false;
for (int bit = 0; bit < (1 << 3); bit++) {
sum = num[0];
for (int i = 0; i < 3; i++) {
... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cassert>
#define MOD 998244353
#define ll long long
using namespace std;
inline int read(){
int re=0,flag=1;char ch=getchar();
while(!isdigit(ch)){
if(ch=='-') flag=-1;
ch=getchar();
}
while(isdigit(ch)) re=(re<<1)+(re<<3)+ch-'0'... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n;
cin >> n;
int p[n];
rep(i,n) cin >> p[i];
int min = 1e9;
int ans = 0;
for(int i = 0; i < n; i++){
if(p[i] <= min){
min = p[i];
ans++;
}
}
cout << ans << e... | #include<iostream>
#include<vector>
using namespace std;
int main() {
int N,i,j,k,ans=0;
cin>>N;
vector<int> L(N);
for (i=0;i<N;i++) cin>>L[i];
for (i=0;i<N-2;i++) {
for (j=i+1;j<N-1;j++) {
if (L[i]==L[j]) continue;
for (k=j+1;k<N;k++) {
if (L[i]==L[k] || L[j]==L[k]) continue;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int n;
vector<ll>v;
cin>>n;
ll a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
for(int i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
i++;
v.push_back... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n,m,x,y; cin>>n>>m>>x>>y;
... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
#include <numeric>
#include <iterator>
#include <math.h>
#include <list>
using namespace std;... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
string S; cin>>S;
vector<int> word(S.size());
set<int> ch;
rep(i,S.size())
{
word.at(i)=S.at(i)-'a';... | 0 |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<map>
#include<set>
using namespace std;
long long n,d,a[200005],r[200005],l[200005];
int main()
{
cin>>n>>d;
long long ret=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
ret+=a[i];
}
... | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return tr... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 1 |
#include<iostream>
using namespace std;
int main()
{ int n;
cin >> n;
int x[n];
for(int i=0;i<n;i++){
cin >> x[i];
}
for(int j=n-1;j>=0;j--){
if(j!=n-1) cout << " " ;
cout << x[j];
}
cout<<endl;
} | /*
* @Author: hesorchen
* @Date: 2020-07-03 17:05:01
* @LastEditTime: 2020-09-04 19:45:56
* @Description: https://hesorchen.github.io/
*/
#include <map>
#include <set>
#include <list>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <vector>
#include <bitset>
#include <cstdio>
#include ... | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string N;
cin >> N;
int ja = 0;
for (int i = 0; i < N.size(); i++) {
if (N[i] == '7') {
cout << "Yes" << endl;
ja += 7;
break;
}
}
if (ja < 7) {
cout << "No" << endl;
}
} | #include <stdio.h>
int main (){
int numberS, a, b, c;
scanf("%d", &numberS);
a = numberS%10;
b = numberS/100;
c = numberS%100/10;
if(a==7 || b==7 || c==7){
printf("Yes");
}
else{
printf("No");
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define light ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define pb push_back
#define all(c) c.begin(),c.end()
#define PI 3.14159265358979323846
const ll MAX = 1e4+10;
const ll INF = 1e18;
const ll MOD = 1e9+7;
vector<int> digits;
in... | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int friends[500];
int n,m;
pair<int, int> student[10000];
int result[100];
int I = 0;
for (int i = 0;; i++)
{
cin >> n;
cin >> m;
if (m == 0 && n == 0)
{
break;
}
for (int a = 0; a < 500; a++)
{
friends[a] = 0;
stu... | // https://atcoder.jp/contests/abc134/tasks/abc134_d
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
... | 0 |
#include <stdio.h>
#define MAX 10000
int main(void){
int list[MAX]={0}, q;
// determine primes
for (int i=2; i<MAX; i++){
if (list[i]==-1) continue;
list[i]=1;
for (int j=2*i; j<MAX; j+=i){
list[j] = -1;
}
}
while (scanf("%d",&q),q){
for... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <vector>
constexpr bool divisible(const std::size_t n, const std::size_t m)
{
return (0 == n % m);
}
std::vector<std::size_t> prime_table = {2};
bool prime(const std::size_t n)
{
const std::size_t found_last_prime = prime_tabl... | 1 |
#include <stdio.h>
int main(){
char s[10];
scanf("%s",&s);
getchar();
s[3]='8';
printf("%s",&s);
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main() {
string date;
cin >> date;
date.replace(0, 4, "2018");
cout << date;
} | 1 |
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 1 << 30
#define LLINF LLONG_MAX/3
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define BIT(i,j) ((i)>>(j))... |
#include <iostream>
using namespace std;
int main()
{
int n, a, b, count = 0, pointX = 0, pointY = 0;
cin >> n;
do {
cin >> a >> b;
if (a > b) {
pointX += (a + b);
}
else if (a < b) {
pointY += (a + b);
}
else {
pointX += a;
pointY += b;
}
count++;
if (count == n) {
cout << pointX ... | 1 |
#include <bits/stdc++.h>
#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 all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> ... | 1 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
#define MOD 1000000007
#define INF 1000000000
int main(){
int N,M;
cin>>N>>M;
Graph G(N);
vector<int> count(N,0);
for(int i=0;i<N+M-1;i++){
int A,B;
cin>>A>>B;
A--,B--;
G.at(A).push_back(B);
... | 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int a, b, c;
cin >> a;
if(a == 1){
cout << "Hello World\n";
return 0;
}
if(a == 2){
cin >> b >> c;
cout << b... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <cctype>
using namespace std;
int main() {
string st;
int stlen;
while (cin >> st) {
stlen = st.size();
for (int i = stlen - 1; i >= 0; i--) {
cout << st[i];
}
putchar('\n');
}
return 0;
} | 0 |
/********************************************************************************
Code by a weak man named CYJian, and he hopes the code can get more points.
Algorithm:
********************************************************************************/
#include <bits/stdc++.h>
using namespace std;
typedef long... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((i... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cmath>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 300;
int mat[2][1 + 2 * nmax][1 + 2 * nmax];
std::vector<std::pair<int,int>> mv[2];
int lim;
b... | #pragma GCC optimize("Ofast,fast-math,unroll-loops")
#include <bits/stdc++.h>
#define int ll
//#define double long double
#define endl '\n'
#define all(C) (C).begin(), (C).end()
#define rall(C) (C).rbegin(), (C).rend()
#define mp make_pair
#define pb emplace_back
#define dbg(x) cerr << #x << " : " << x << endl
#de... | 0 |
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int N, M, D;
while (true)
{
scanf("%d", &N);
scanf("%d", &M);
if (N == 0 && M == 0) { break; }
vector<int> C; C.push_back(0);
for (int i = 0; i < N; i++)
{
scanf("%d", &D);
if (D <= M)
{
C.pus... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | 0 |
#include <bits/stdc++.h>
using namespace std;
// ----------- define --------------
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
// -----------... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int64_t res = 0;
vector table(20, vector(20, 0));
for (int i = 0; i < N; i++) {
string s;
cin >> s;
auto pos = s.find(".");
if (pos == string::npos) {
s += string(9,... | 1 |
#include <bits/stdc++.h>
using namespace std;
int k = 55555;
int a[55555]={};
int main(){
int n;
cin >> n;
for(int i=2;i<=k;i++){
for(int j=i;j<=k;j+=i) a[j]++;
}
for(int i=2;i<=k;i++){
if(a[i]==1){
if(i%5==2&&n>0){
cout << i << ' ';
n--;
... | #include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
vector<bool> IsPrime;
void sieve(size_t max){
IsPrime.assign(max + 1, true);
IsPrime[0] = false;
I... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=0x3f3f3f3f3f3f3f3f;
int n,m;
ll d[105][105];
bool v[105][105];
int main() {
cin>>n>>m;
for (int i=0;i<n;i++) for (int j=0;j<n;j++) {
if (i==j) {
d[i][j]=0;
v[i][j]=1;
}
else d[i][j]=INF;
}
for (int i=0;i<m;i++) {
int s... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | 0 |
#include<iostream>
#include<string>
using namespace std;
int Roman_to_Arabia(char c){
if (c == 'I')return 1;
else if (c == 'V')return 5;
else if (c == 'X')return 10;
else if (c == 'L')return 50;
else if (c == 'C')return 100;
else if (c == 'D')return 500;
else if (c == 'M')return 1000;
else return 0;
}
int mai... | #include<stdio.h>
void spin_w(int x[]){
int sai1[6],i;
for(i=0;i<6;i++){
sai1[i]=x[i];
}
sai1[0]=x[2];
sai1[2]=x[5];
sai1[3]=x[0];
sai1[5]=x[3];
for(i=0;i<6;i++){
x[i]=sai1[i];
}
}
void spin_s(int x[]){
int sai1[6],i;
for(i=0;i<6;i++){
sai1[i]=x[i];
}
sai1[0]=x[4];
sai1[1]... | 0 |
//#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
string N; cin >> N;
int L = N.size();
... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((... | 1 |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
vector <ll> a(n+1), dp[3];
for (int i=0; i<=2; i++) {
dp[i].resize(n+1);
for (int j=1; j<=n; j++) {
dp[i][j] = -1e18;
}
}
for (int i=1; i<=n; i++) {... | #include <iostream>
using namespace std;
#define el '\n'
typedef long long ll;
const int MAXN = 2e5+2;
int N, A[MAXN];
ll odd[MAXN], dp[MAXN];
int main(){
cin.tie(0);
cin.sync_with_stdio(0);
cin >> N;
for(int i = 1;i<=N;i++) cin >> A[i];
odd[1] = A[1];
for(int i = 2;i<=N;i++){
if(i%2){
odd[i] = odd[i-2]+A[i]... | 1 |
#include <iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cstdlib>
using namespace std;
vector<string> split(const string &str, char delim){
vector<string> res;
size_t current = 0, found;
while((found = str.find_first_of(delim, current)) != string::npos){
res.push_back(string(str,... | #include<iostream>
using namespace std;
int main(void){
int l[10];
char c;
double ls, x1, t, v1, v2;
while(1){
ls = 0;
for(int i = 0; i < 10; i++){
cin >> l[i] >> c;
ls += l[i];
}
cin >> v1 >> c >> v2;
if(cin.eof())break;
x1 = t = 0.0;
for(int i = 0; i < 10; i++){
x1 += l[i];
t = x1 / v1;... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int k;
string s, t = "...";
cin >> k >> s;
if(s.size() <= k)
cout << s << '\n';
else {
for (int i = 0; i < k; ++i) {
cout << s[i];
... | //้ซ็ฅ่ฝ็ณปVtuberใฎ้ซไบ่
ไนใงใใ
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i+... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rr... | # include <bits/stdc++.h>
using namespace std;
int main(){
int N,x,y;
int ans=0;
cin>>N;
int A[N];//่จผ่จใฎๆฐ
vector<pair<int,int>>T[N];
//่จผ่จใๅ
ฅๅ
for(int i=0;i<N;i++){
cin>>A[i];
for(int j=0;j<A[i];j++){
cin>>x>>y;
x--;
T[i].push_back({x,y});
}
}
//bitๅ
จๆข็ดข
for(int i=... | 0 |
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#defin... | #include<iostream>
#include<string>
#include<queue>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<stack>
#include<map>
#include<iterator>
#include<cstdlib>
#include<cmath>
using namespace std;
#define MAX 100000
#define SENTINEL 2000000000
int A[MAX],n;
int partition(int p,int r)
{
... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using ll= long long;
using namespace std;
int main(){
int N,A;
cin>>N;
vector<vector<pair<int,int>>> data;
data.resize(N);
rep(i,N){
cin>>A;
data[i].resize(A);
rep(j,A){
cin>>data[i][j].first>>... | //{{{
#pragma GCC diagnostic ignored "-Wunknown-pragmas"
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define all(x) (... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int r,g;
double p;
cin >> r >> g;
//g = (r + p) / 2
p = 2 * g - r;
cout << p << endl;
}
| #include <iostream>
using namespace std;
int main(int argc, char **argv) {
int x, y;
cin >> x;
y = x * x * x;
cout << y << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long double dx,dy,RR,avdist,prt;
cin >>N;
int arrive[N];
vector<vector<long double>> b(N, vector<long double>(2));
vector<vector<long double>> dist(N, vector<long double>(N,0));
for(int i=0;i<N;i++){
arrive[i]=i;
cin... | #include <bits/stdc++.h>
using namespace std;
int n , f[10] , v[10] , x[10] , y[10];
double sol;
double calc (int a , int b){
if (a == 0)
return 0;
return sqrt((x[a] - x[b]) * (x[a] - x[b]) + (y[a] - y[b]) * (y[a] - y[b]));
}
void back(int pas , double sum){
int i;
if (pas == n + 1){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
bool flag = true;
cin >> s;
int len = s.size();
int count_c = 0;
int i_c = -1;
if(s[0] != 'A') flag = false;
for(int i=2;i<=len-2;i++){
if(s[i] == 'C') {
count_c++;
i_... | #include <bits/stdc++.h>
using namespace std;
# define C continue;
# define R return
# define D double
# define I insert
# define ll long long
# define ld long double
# define ull unsigned long long
# define ui unsigned int
# define pb push_back
# define pf push_front
# define vi vector < int >
# define vc vector ... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define pll pair<LL,LL>
#define x first
#define y second
#define pi acos(-1)
#define sqr(x) ((x)*(x))
#define pdd pair<double,double>
#define MEMS(x) memse... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
vector<int>A(100000,0);
for (int i = 0; i < n; i=i+2) {
A.at(v.at(i)-1)++;
}
vector<int>a(100000,0);
for (int i = 0; i < 100000; i++) {
a.... | /*
* a.cc:
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functi... | 0 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int h, w;
while (scanf("%d%d", &h, &w) != EOF && h && w) {
int S = h*h+w*w;
bool finished = false;
for (int i=h+1; i<=150; i++) {
int W = S - i*i;
for (int j=i+1; j<150; j++) {
if (j * j == W) {
finished = true;
... | #include <bits/stdc++.h>
using namespace std;
int mp[101][101];
int w, h;
int gx, gy;
int dx[4] = {-1, 0, 0, 1}, dy[4] = {0, -1, 1, 0};
bool dfs(int y, int x, int c)
{
if (y < 1 || y > h || x < 1 || x > w || mp[y][x] != c) return false;
if (y == gy && x == gx) return true;
mp[y][x] = 0;
bool res = false;
f... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define ft first
#define sd second
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<char,char> pcc;
ty... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) ... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
using namespace std;
const int mod = 998244353;
const int N = 307;
int dp[N][N][2*N][2];
inline int sum(int x, int y) {
if (x+y < 0) re... | #include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#defin... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,K;
cin >> N >> K;
if(N < K){
cout << 1 << endl;
return 0;
}
if(N%K == 0){
cout << 0 << endl;
return 0;
}
cout << N%K+1 - N%K << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
if(N % K == 0){
cout << '0' << endl;
}
else{
cout << '1' << endl;
}
}
| 1 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typed... | #include<bits/stdc++.h>
#define re register
using namespace std;
template <typename T>inline void read(T &x)
{
x=0;int f=1;char c=getchar();
for(;c>'9'||c<'0';c=getchar()) if(c=='-') f=-1;
for(;c>='0'&&c<='9';c=getchar()) x=(x<<3)+(x<<1)+(c^48);
x*=f;
}
const int maxn=1e5+5;
struct edge
{
int to,nxt;
}e[maxn<<1];
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin >> n)
{
if(n<3)cout << 0 << endl;
else if(n<6)cout << 1 << endl;
else {
cout << n/3 << endl;
}
}
return 0;
}
| #define _USE_MATH_DEFINES //M_PI, M_E
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define pb push_back
ll power(ll a,ll b){ll r=1;for(;b;b>>=1){if(b&1)r=r*a%mod;a=a*a%mod;}return r;}
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
ci... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define all(c) begin(c), end(c)
using ll = long long;
using Weight = int;
using Capacity = int;
struct Edge {
int src, dst; Weight weight;
Edge(int s, int d, int w) : src(s), dst(d), weight(w) {}
};
using Edges = v... | #include <iostream>
#include <cstring>
using namespace std;
int w, h, n;
int sx, sy, gx, gy;
int t[102][102];
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
bool check(int x, int y, int c){
if(x == gx && y == gy) return true;
t[y][x] = -1;
for(int i = 0; i < 4; i++){
int nx = x + dx[i];
int ny =... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m = 999;
string S;
cin >> S;
for (int i = 0; i < S.length() - 2; i++) {
int num;
istringstream ss;
ss = istringstream(S.substr(i, 3));
ss >> num;
int res = num - 753;
int diff = res < 0 ? -res : res;
m = min(diff, m);
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
string S;
cin >> S;
int LS = S.size();
int k = 2;
int ans = 1000;
while (k<LS) {
int tmp = stoi(S.substr(k-2,3));
int l = abs(tmp-753);
ans = min(ans, l);
k++;
}
cout << ans <<... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <stdio.h>
#include <unistd.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) ... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
int main() {
ll n,a,b;
cin >> n >> a >> b;
int x[n];
for (int i=0;i<n;i++) cin >> x[i];
ll... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,a,b) for(int i=a;i>=b;--i)
#define mem0(x) memset(x,0,sizeof(x))
#define meminf(x) memset(x,0x3f,sizeof(x))
#define VI vector<int>
#define VL vector<ll>
using namespace ... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define N 100100
lli n;
int main(void){
cin >> n;
vector<lli> v(n);
vector<lli> e(N), o(N);
rep(i, n) cin >> v[i];
rep(i, n){
if(i%2 == 0){
e[v[i]]++;
}else{
o[v[i]]++;
}
}
auto p1 = max_elemen... | 0 |
/*
Over ice, I'm freezing
Beautiful eyes, deceiving
We may die this evening
Coughing, wheezing, bleeding...
*/
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#prag... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int MOD;
void extgcd(int a, int b, int& x, int& y) {
if (b != 0) {
extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
}
int mod_inverse(int a, int m) {
int x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
int add(int&... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
if(N == 1) {
cout << "Hello"<< " " <<"World" << endl;
}
else {
int A,B;
cin >> A >> B;
cout << A+B << endl;
}
}
| #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a... | 1 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define endl '\n'
using namespace std;
const int N = 1e5 + 5;
int n, m, a[N], label[N], label2[N];
ll k;
ll x[N], d[N], ans[N];
vector <vector <int> > cycles;
bool vis[N];
void DFS(int v)
{
cycles.back().pb(v);
vis[v] = tr... | 1 |
#include<bits/stdc++.h>
using namespace std;
namespace FAST_IO
{
template<typename T> void read(T &a)
{
a=0;
int f=1;
char c=getchar();
while(!isdigit(c))
{
if(c=='-')
{
f=-1;
}
c=getchar();
}
while(isdigit(c))
{
a=a*10+c-'0';
c=getchar();
}
a=a*f;
}
template <typename T> v... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,q,l,r,i;
string s;
vector<int> a;
cin>>n>>q>>s;
for(i=0;i<n-1;i++) if(s.at(i)=='A'&&s.at(i+1)=='C') a.push_back(i+1);
for(i=0;i<q;i++){
cin>>l>>r;
cout<<distance(lower_bound(a.begin(),a.end(),l),lower_bound(a.begin(),a.end(),r))<<endl;
... | #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,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ?... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 |
#include<bits/stdc++.h>
#define EB emplace_back
#define int long long
#define F first
#define S second
#define N 500005
#define all(x) x.begin(),x.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
#define rt return
void test_case(){
string s; cin >> s;
... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> num(55556);
for(int i = 0; i < 55556; i++) num[i] = i;
num[0] = -1;
num[1] = -1;
for(int i = 2; i < 55556; i++){
if(num[i] == -1) continue;
int t = 2;
while(i * t <= 55... | 0 |
#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, K;
cin >> N >> K;
if( N % K == 0 ) cout << 0 << endl;
else cout << 1 << endl;
} | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define IPT(x) ll t; cin >> t; x.push_back(t);
#define YN(x) x ? cout << "YES" << endl : cout << "NO" << endl;
#define Yn(x) x ? cout << ... | 0 |
#include<iostream>
#include<string>
#include<stdio.h>
using namespace std;
void dice1();
void dice2();
void dice3();
void dice4();
class DICE{
int face[6],a;
public:
bool operator==(const DICE&di)const{
int cont=0;
for(int i=0;i<6;++i){
if(face[i]==di.face[i]){
cont++;
}
}
if(cont==6){
return tru... | #include<iostream>
#include<string>
using namespace std;
class Dice{
public:
int face[6];
Dice(){}
void roll_x(){ roll(0,3,5,2);}
void roll_y(){ roll(0,1,5,4);}
void roll_z(){ roll(1,2,4,3);}
void roll(int i, int j, int k, int l){
int t = face[i]; face[i] = face[j]; face[j] = face[k]; face[k] = face[l... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while ( cin >> N ) {
if ( N == 0 ) {
break;
}
typedef pair<double, string> P;
vector<P> ans;
while ( N-- ) {
string l;
int p;
cin >> l >> p;
int t = 0;
int d = 0;
for ( int i = 0; i < 5; i++ ) {
int a;
cin >> ... | 1 |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(i,a,n) for(int i=a;i<=n;++i)
#define PER(i,a,n) for(int i=n;i>=a;--i)
#... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int N,K;cin>>N>>K;
vector<int> p(N);
for (int i = 0; i < N; i++){
cin>>p[i];
}
int ans=0;
for (int i = 0; i < K; i++){
ans+=p[i]+1;
}
int sum=ans;
for (int i = 0; i ... | 0 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;
#define fo(i,s,e_ex) for(i=s;i<e_ex;i++)
#define Fo(i,k,n) for(i=k;k<n?i<=n:i>=n;k<n?i+=1:i-=1)
#define endl '\n'
#define MOD 1000000007//998244353
#define pbb push_back
#define mpp make_pair
#define ... | 0 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int main(){
char str[64];
int i;
cin >> str;
for(i=1;i<=strlen(str);i++){
cout << str[strlen(str)-i];
}
cout << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ... | 0 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n;
cin >> n;
int sum = 0;
int tmp = n;
while(tmp >... | #include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <regex>
#include <locale>
#include <iomanip>
using namespace std;
using ll = long long;
#define OVERLOAD3(_1,_2,_3,name,...) name
#define REP(i,n) REPI(i,0,n)
#define REPI(i,a,b) for(int i=int(a),i##_Len=int(b);i<i##_Len;++i)
#define ... | 0 |
//https://atcoder.jp/contests/abc162/tasks/abc162_b
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin>>n;
ll sum1=0;
sum1=(n*(n+1))/2;
ll n3;
n3=(n)/3;
ll n5;
n5=(n)/5;
ll n15;
n15=(n)/15;
ll a3;
a3=3+(n3-1)*3;
ll a5;
a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int N;
cin >> N;
long long fb_sum = 0;
for (int elem = 1; elem <= N; elem++){
if (elem % 3 != 0 & elem % 5 != 0) fb_sum += elem;
}
cou... | 1 |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | #include <iostream>
#include <vector>
#include <cassert>
#include <map>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 200000;
int v[1 + nmax];
bool valid(int n) {
if(0 < v[1])
return 0;
for(int i = 2; i <= n; i++)
if(v[i - ... | 0 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,N,r,s=0;
cin>>n;
N=n;
while(n>0){
r=n%10;
s+=r;
n/=10;
}
if(N%s==0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
int div = n / max(h, w);
int rem = n % max(h, w);
if (rem) cout << div + 1 << '\n';
else cout << div << '\n';
return 0;
} | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int sum = 0;
int a, b, m = 101;
for (int i = 0; i < 4; i++){
cin >> a;
m = min(a, m);
sum += a;
}
sum -= m;
cin >> a >> b;
sum += max(a, b);
cout << sum << endl;
} | #include <iostream>
using namespace std;
int main() {
double now, next;
cin >> now >> next;
cout << next*2 - now << endl;
} | 0 |
#include <iostream>
using namespace std ;
int main()
{
int get ;
cin >> get ;
cout << (get*get*get) << endl ;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int FB, F, B;
FB = N / 15;
F = N / 3;
B = N / 5;
long long ans = 0;
for(int i = 1; i <= N; i++) {
ans += i;
}
for(int i =1 ; i <= F; i++) {
ans -= i*3;
}
for(int i =1 ; i <= B; i++) {
ans -= i... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.