content
stringlengths 19
11k
|
|---|
#include<stdio.h>
#define sf(a) scanf("%d", &a)
int main(){
int N, d, i;
sf(N);sf(d);
int a[N];
for(i=0; i<N; i++){
sf(a[i]);
}
int result = 2;
for(i=0; i<N-1; i++){
if(a[i+1]-a[i] > 2*d) result += 2;
if(a[i+1]-a[i] == 2*d) result += 1;
}
printf("%d\n", result);
return 0;
} |
#include<stdio.h>
main()
{ long int n,R=2,d;
int i,T[100];
scanf("%ld %ld",&n,&d);
for(i=0;i<n;i++)
scanf("%d",&T[i]);
// printf("%d\t",R);
for(i=0;i<n-1;i++)
{//printf("%d\t",T[i]);
if(T[i]+d<T[i+1]-d)
{
R=R+2;
} else if(T[i]+d==T[i+1]-d)
{
R=R+1;
// printf("%d\t",i);
}
/*else if(i==n-1)
R=R+1; */}
printf("%d\t",R);
}
|
#include <stdio.h>
int main()
{
int n,d,a[100],i,j,x,sum=2;
scanf("%d %d",&n,&d);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
if(d>=(a[i-1]-a[0]))
sum=2;
else{
for(j=0;j<n-1;j++)
{
if(a[j+1]-a[j]>d)
{
x=a[j]+d;
if(a[j+1]-x>d)
sum+=2;
else if(a[j+1]-x==d)
sum++;
}
}
}
printf("%d\n",sum);
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main(){
int n,d,*arr;
scanf("%d%d",&n,&d);
arr=malloc(n*sizeof(int));
int ans=2*n;
for(int i=0;i<n;i++){
scanf("%d",arr+i);
}
for(int i=1;i<n;i++){
if(fabs(arr[i]-arr[i-1])==2*d){ans--;}
else if(fabs(arr[i]-arr[i-1])<2*d){ans-=2;}
}
printf("%d\n",ans);
}
|
#include<stdio.h>
int main(){
int n,d,i,c,b,count=0,j;
scanf("%d%d",&n,&d);
int a[n];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
if(i>=1){
b=a[i];
c=a[i-1];
if((c+d)==(b-d)){
count = count +1;
}
else if((c+d)<(b-d)){
count = count +2;
}
}
}
count = count + 2;
printf("%d",count);
}
|
#include<stdio.h>
main()
{
long long t,i,f,k,l,h[999];
scanf("%lld%lld",&t,&f);
k=2;
for(i=0;i<t;i++)
{
scanf("%lld",&h[i]);
}
for(i=0;i<t-1;i++)
{
l=h[i+1]-h[i];
if(l>(2*f)){
k+=2;
}
else if(l==(2*f)){
k++;
}
}
printf("%lld\n",k);
}
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#define MAX 111
int n,m,x,y,a,b,d,arr[MAX],ans,tmp,i;
int main(){
for(scanf("%i%i",&n,&d);i<n;i++){
scanf("%i", &arr[i]);
}
ans=2;
for(i=0;i<n-1;i++)
{
if(abs(arr[i]-arr[i+1])-2*d==0) ans++;
else if(abs(arr[i]-arr[i+1])-2*d>0) ans+=2;
}
printf("%i\n", ans);
}
|
#include<stdio.h>
#include<math.h>
int main()
{int n,d,i,m;
scanf("%d%d",&n,&d);
int a[n],s=2;
float div;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
//if((a[0]+d)<a[1])
//s++;
for(i=0;i<n-1;i++){
//if((a[i]+d)<a[i+1])
//s++;
//if((a[0]-d)>a[i-1])
//s++;
div=(a[i+1]-a[i])/(d*1.000);
if(div<2)
m=1;
else if(div==2)
m=2;
else
m=3;
s=s+m-1;
}
printf("%d",s);
}
|
#include<stdio.h>
int main()
{
int n,i;
long long int d;
scanf("%d %lld",&n,&d);
long long int a[n];
for(i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
}
long long int f,b;
int count=2;
for(i=1;i<=n;i++)
{ if(i==n){break;}
f = a[i]+d;
b= a[i+1] - d;
if(f<b)
{ //printf("%d %d ",f,b);
count=count+2;
}
else if(f==b){count = count +1;}
}
printf("%d\n",count);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main(){
int N, d;
int H[101];
scanf("%d %d",&N,&d);
int sum=1;
int ind=0;
for(int i=0; i<N; i++){
scanf("%d",&H[i]);
}
ind=H[0]-d;
for(int i=0; i<N; i++){
if(ind>H[i]-d){
ind=H[i]+d;
}
else if(ind == H[i]-d&&i>0){
sum+=1;
ind = H[i]+d;
}
else{
sum+=2;
ind=H[i]+d;
}
}
printf("%d\n",sum-1);
} |
#include <stdlib.h>
#include <stdio.h>
#include <limits.h>
int main(void)
{
int n, d;
int min = -1000000000, max = 1000000000;
int ans = 0;
scanf("%d%d", &n, &d);
int i;
int a, b;
scanf("%d", &a);
n--;
ans++;
for (i = 0; i < n; i++)
{
scanf("%d", &b);
if (((b - a) / d) >= 2)
ans = (((b-a) % d) || ((b-a) / d) > 2) ? ans + 2 : ans + 1;
a = b;
}
ans++;
printf("%d\n", ans);
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{
int n,d;
scanf("%d%d",&n,&d);
int count=2;
int a[n];
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(int i=0;i<n-1;i++)
{
int sum=a[i+1]-a[i]-1;
sum=sum-(2*(d-1));
if(sum>0 && sum>=2) count=2+count;
else if(sum>0 && sum<2) count=count+1;
}
printf("%d",count);
}
|
#include<stdio.h>
int main()
{
int n,i;
long d,x[100],a[100],j=1,dem=2;
do{scanf("%d %ld",&n,&d);}while(n<1||n>100||d<1||d>1000000000);
for(i=1;i<=n;i++)
{
do{scanf("%ld",&x[i]);}while(x[i]<-1000000000||x[i]>1000000000);
}
for(i=1;i<=n-1;i++)
{
a[j]=x[i+1]-x[i];
j++;
}
for(j=1;j<=n-1;j++)
{
if(a[j]>(2*d)) {dem+=2;}
if(a[j]==(2*d)) {dem+=1;}
}
printf("%d",dem);
return 0;
} |
#include<stdio.h>
int main()
{
int n, c = 2;
long long int i, x, y, a[101], d;
scanf("%d %lli", &n, &d);
for(i=0; i<n; i++)
{
scanf("%lli", &a[i]);
if(i>0)
{
x = a[i-1]+d;
y= a[i]-d;
if(x<y)
c = c+2;
else if(x == y)
c++;
}
}
printf("%d\n", c);
return 0;
}
|
#include <stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
int main()
{
long d,n;
while(scanf("%ld%ld",&n,&d)!=EOF)
{
long a[n],i,num=0;
for(i=0;i<n;i++)
{
scanf("%ld",&a[i]);
}
for(i=1;i<n;i++)
{
if(a[i]-d>a[i-1]+d) num=num+2;
else if(a[i]-d==a[i-1]+d) num++;
}
printf("%ld\n",num+2);
}
}
|
#include <stdio.h>
#include <stdlib.h>
#define MaxNum 100
int main()
{
int n,d,Hotels[MaxNum],Count=2,i;
scanf("%d %d",&n,&d);
for(i=0;i<n;i++){
scanf("%d",&Hotels[i]);
}
for(i=1;i<n;i++){
if(Hotels[i]-Hotels[i-1]==(2*d)){
Count++;
}
else if (Hotels[i]-Hotels[i-1]>(2*d)){
Count+=2;
}
}
printf("%d\n",Count);
return 0;
}
|
#include<stdio.h>
int main ()
{
int n, d, Array[100], i, j=0, Result;
double Half;
scanf("%d%d", &n, &d);
for(i=0; i<n; i++)
scanf("%d", &Array[i]);
for(i=1, Result=0; i<=n-1; i++, j++)
{
Half=(double)(Array[j]+Array[j+1])/2;
if(Half-(double)Array[j]==d)
Result++;
if(Half-(double)Array[j]>d)
Result=Result+2;
}
printf("%d\n", Result+2);
return 0;
}
|
//
// Created by Rohit on 4/1/2020.
//
#include <stdio.h>
#include <math.h>
main(){
int n;
long long int d,i,first,second,count=2;
scanf("%d %lld",&n,&d);
scanf("%lld",&first);
d+=d;
for(i=1;i<n;i++){
scanf("%lld",&second);
if((second-first)== d)
count++;
else if((second-first)> d)
count+=2;
first=second;
}
printf("%lld",count);
return 0;
}
|
#include <stdio.h>
main(){
int i, n, dis, count= 0;
scanf("%i%i", &n, &dis);
int city_dis[n];
for(i=0; i<n; ++i){
scanf("%i", &city_dis[i]);
}
for(i=0; i<n-1; ++i){
if((city_dis[i+1]-city_dis[i])>2*dis){
count+= 2;
}
else if((city_dis[i+1]-city_dis[i])==2*dis){
++count;
}
else if((city_dis[i+1]-city_dis[i])<2*dis){
}
}
printf("%i", count+2);
} |
#include<stdio.h>
int main() {
int n; int d,m,c,count;
scanf("%d %d", &n, &d);
int x[n];
for(count=0;count<=n-1;count=count+1)
{
scanf("%d",&x[count]);
}
m=0;
for(c=2;m<=n-2;m=m+1)
{
if(x[m+1]-(x[m]+d)>d) {
c=c+2;
}
if(x[m+1]-(x[m]+d)==d) {
c=c+1;
}
}
printf("%d", c);
return 0;
}
|
#include<stdio.h>
#include<math.h>
long long int n,d,a[1000],vm;long long int pan,sum;
int main(){
while(scanf("%lld%lld",&n,&d)!=EOF){
for(int i=0;i<n;i++){
scanf("%lld",&a[i]);
}
sum=pan=0;
if(d==0)sum=0;
else{
for(int i=0;i<n;i++){
pan=2;
for(int i1=i+1;i1<n;i1++){
if(i1!=i){
if(a[i1]-a[i]<2*d){
pan--;
break;}
}}
for(int i1=0;i1<i;i1++){
if(a[i]-a[i1]<2*d){
pan--;
break;}
}
sum+=pan;
if(i>=1&&a[i]-a[i-1]==2*d)sum--; }
}
printf("%lld\n",sum); }
}
|
#include <stdio.h>
int main(int argc, const char * argv[]) {
long long int n,d,x,y,count=2;
scanf("%lld %lld",&n,&d);
long long int location[n];
for (long long int i=0; i<n; i++) {
scanf("%lld",&location[i]);
}
for (long long int i=0; i<n-1; i++) {
x=location[i]+d;
y=location[i+1]-d;
if(x==y)
{
count++;
}
else if(x<y)
{
count+=2;
}
else{
}
}
printf("%lld",count);
return 0;
}
|
#include<stdio.h>
int main()
{
int n,m,i,sum,j,ch[200];
while(scanf("%d%d",&n,&m)!=EOF)
{
sum=0;j=0;i=0;
for(i=0;n>i;i++) //循环读取数值
{
scanf("%d",&ch[i]);
j++;
}
for(i=0;(n-1)>i;i++)
{
if(m<=(ch[i+1]-(ch[i]+m)))
sum++;
}
for(i=j-1;i>=1;i--)
{
if((ch[i]-m)>=(ch[i-1]+m))
sum++;
}
for(i=0;n>i;i++)
{
if(ch[i]+m==ch[i+1]-m)
sum--;
}
printf("%d\n",sum+2);
}
return 0;
}
|
#include <stdio.h>
static int n;
static int d;
static int A[100];
int main(void)
{
int i;
scanf("%d %d", &n, &d);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
int ntotal = 2;
for (i = 1; i < n; i++) {
if (A[i] - A[i-1] == 2*d) {
//printf("at %d\n", A[i-1] + d);
ntotal += 1;
}
else if (A[i] - A[i-1] > 2*d) {
//printf("at %d and %d\n", A[i-1] + d, A[i] - d);
ntotal += 2;
}
}
printf("%d\n", ntotal);
return 0;
}
|
#include<stdio.h>
int main()
{
long long int n;
long long int d;
scanf("%lld%lld",&n,&d);
long long int a[100],count=0;
long long int t;
for(long long int i=0;i<n;i++)
{
scanf("%lld",&a[i]);
}
for(long long int i=0;i<n;i++)
{
if(i==0)
count=count+1;
if(i!=n-1)
{
if(a[i+1]-a[i]==(2*d))
count=count+1;
else if(a[i+1]-a[i]>(2*d))
count=count+2;
}
else
count=count+1;
}
printf("%lld\n",count);
} |
#include<stdio.h>
#include<stdlib.h>
int main()
{
int n,d;
scanf("%d %d",&n,&d);
int arr[n];
int temporary[1000];
for(int o=0;o<n;o++)
scanf("%d",&arr[o]);
if(n==1)
{
printf("2");
exit(0);
}
int count=2,i=0;;
int nh=arr[0]+d;
if(arr[1]-nh>=d)
{
temporary[i]=arr[0]+d;
i++;
}
int nh2=arr[n-1]-d;
if(nh2-arr[n-2]>=d)
{
temporary[i]=nh2;
i++;
}
for(int o=1;o<n-1;o++)
{
int newhotel;
newhotel=arr[o]-d;
if(newhotel-arr[o-1]>=d)
{
temporary[i]=newhotel;
i++;
}
int newhotel2;
newhotel2=arr[o]+d;
if(arr[o+1]-newhotel2>=d)
{
temporary[i]=newhotel2;
i++;
}
}
int y,j;
//replace i by y,size by i
for(y = 0; y < i; y++) {
for (j=0; j<y; j++){
if (temporary[y] == temporary[j])
break;
}
if (y == j){
/* No duplicate element found between index 0 to i */
count+=1;
}
}
printf("%d ",count);
}
|
#include <stdio.h>
#include <stdlib.h>
void read(long long *arr, int length) {
for (int i=0; i<length; i++) scanf("%I64d",(arr+i));
}
void assign(long long *arr, int index, long long dist, long long *mi, long long *ma) {
*mi=arr[index]-dist;
*ma=arr[index]+dist;
}
int check_dist(long long *arr, long long length, long long cand, long long dist) {
for (int i=0; i<length; i++) {
if (llabs(arr[i]-cand)<dist) return 0;
}
return 1;
}
int build(long long *arr, int length, long long dist) {
int count=0;
long long inf,sup,prev=-2000000001;
for (int i=0; i<length; i++) {
assign(arr,i,dist,&inf,&sup);
if (prev!=inf && check_dist(arr,length,inf,dist)) count++;
if (check_dist(arr,length,sup,dist)) count++;
prev=sup;
}
return count;
}
int main() {
int len;
long long dist;
scanf("%d %I64d\n",&len,&dist);
long long hotels[len];
read(hotels,len);
printf("%d",build(hotels,len,dist));
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
#define N 101
int main(){
int n,d;
scanf("%d%d",&n,&d);
int i;
int x[N];
for(i=0;i<n;i++){
scanf("%d",&x[i]);
}
int j;
int answer=0;
int y[N*2];
int ny=0;
for(i=0;i<n;i++){
int l=x[i]-d;
int r=x[i]+d;
int l1=1;
int r1=1;
//printf("%d %d %d\n",l,x[i],r);
for(j=0;j<n;j++){
if(l==x[j]){
//printf("find %d\n",l);
l1=0;
}
if(r==x[j]){
//printf("find %d\n",r);
r1=0;
}
}
if(l1){
//printf("test l %d\n",l);
if(i-1<0){
y[ny]=l;
ny++;
//printf("add l %d\n",l);
answer++;
}else if(abs(l-x[i-1])>=d){
int find=0;
for(j=0;j<ny;j++){
if(y[j]==l){
find=1;
break;
}
}
if(!find){
y[ny]=l;
ny++;
//printf("add l %d\n",l);
answer++;
}
}
}
if(r1){
//printf("test r %d\n",r);
if(i+1>=n){
//printf("add r %d\n",r);
y[ny]=r;
ny++;
answer++;
}else if(abs(r-x[i+1])>=d){
int find=0;
for(j=0;j<ny;j++){
if(y[j]==r){
find=1;
break;
}
}
if(!find){
y[ny]=r;
ny++;
//printf("add r %d\n",r);
answer++;
}
}
}
}
printf("%d\n",answer);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <limits.h>
typedef long long ll;
ll MAX = 100000000000; // 1e11
ll MIN = -100000000000; // -1e11
ll MOD = 1000000007;
ll longlongmax = __LONG_LONG_MAX__;
ll maxormin(ll a,ll b,ll flag){
return flag==1?(a>b?a:b):(a<b?a:b);
}
ll overflowcheck(ll a){
if(a==1){
return 0;
}
else
{
ll temp = a;
ll power = 1;
while( longlongmax/temp>a ){
temp *= a;
power++;
}
return power+1; // Overflow occurs at this power.
}
}
ll merge(ll A[],ll B[],ll left,ll mid,ll right){
ll count = 0;
ll n1 = mid-left+1;
ll n2 = right-mid;
ll LA[n1],LB[n1],RA[n1],RB[n2];
for(ll n=0;n<n1;n++){ LA[n] = A[n+left];LB[n] = B[n+left];}
for(ll n=0;n<n2;n++){ RA[n] = A[n+mid+1];RB[n] = B[n+mid+1];}
ll i=0,j=0,k=left;
while(i<n1&&j<n2){
if(LA[i]<RA[j]){
A[k] = LA[i];
B[k] = LB[i];
i++;
}
else{
A[k] = RA[j];
B[k] = RB[j];
count += n1-i;
j++;
}
k++;
}
while(i<n1){
A[k] = LA[i];
B[k] = LB[i];
i++;
k++;
}
while(j<n2){
A[k] = RA[j];
B[k] = RB[j];
j++;
k++;
}
return count;
}
ll mergesort(ll A[],ll B[],ll left,ll right){
ll total = 0;
if(left<right){
ll mid = (right-left)/2+left;
total += mergesort(A,B,left,mid);
total += mergesort(A,B,mid+1,right);
total += merge(A,B,left,mid,right);
}
return total;
}
int main(int argc, char const *argv[])
{
ll T = 1;
// scanf("%lld",&T);
for(ll t = 0; t < T; t++)
{
ll N,d ;
scanf("%lld %lld",&N,&d);
ll A[N];
for(ll n = 0; n < N; n++)
{
scanf("%lld",&A[n]);
}
// ll inv = mergesort();
ll count = 0;
for (ll n = 1; n < N; n++)
{
if(A[n]-A[n-1]>2*d)
{
count += (2);
}
else if(A[n]-A[n-1]==2*d){
count++;
}
}
count += 2;
printf("%lld\n",count);
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define fo(i,a,b) for(i=(a);i<=(b);i++)
#define of(i,a,b) for(i=(a);i>=(b);i--)
#define max(a,b) (((a)>(b))?(a):(b))
#define min(a,b) (((a)<(b))?(a):(b))
#define abso(a) ((a<0)?(-(a)):(a))
typedef long long int lli;
void fastWrite(FILE * ofp, int x) {
int i = 12;
char buff[i];
buff[i] = 0;
int neg = 0;
if (x < 0){
x = -x;
neg = 1;
}
if (x == 0)
buff[--i] = '0';
else while (x != 0) {
buff[--i] = (x % 10) + '0';
x /= 10;
}
if (neg)
buff[--i] = '-';
fwrite(buff + i, sizeof(char), (12 - i), ofp);
}
void fastSpace(FILE * ofp){
fwrite(" ", sizeof(char), 1, ofp);
}
void fastChar(FILE * ofp, char c){
fwrite(&c, sizeof(char), 1, ofp);
}
void fastNewLine(FILE * ofp) {
fwrite("\n", sizeof(char), 1, ofp);
}
void sort(int * arr, int s, int e) {
if (s >= e)
return;
int i,j;
if (s + 4 >= e)fo(i,s,e)fo(j,s,e-1)
if (arr[j] < arr[j+1]){
arr[j]^=arr[j+1];
arr[j+1]^=arr[j];
arr[j]^=arr[j+1];
}
int len = e-s+1;
int * dum = calloc(len, sizeof(int));
int m = (s+e)/2;
sort(arr,s,m);
sort(arr,m+1,e);
int fp = s;
int bp = m+1;
int mp = 0;
fo(mp,0,len-1) {
if (fp == m+1 ||
(bp != e+1 &&
(arr[bp] < arr[fp])))
dum[mp] = arr[bp++];
else
dum[mp] = arr[fp++];
}
fo(mp,0,len-1)
arr[mp+s]=dum[mp];
}
int readInt()
{
int n;
scanf("%d", &n);
return n;
}
lli readLLI()
{
lli n;
scanf("%lld", &n);
return n;
}
char readChar()
{
char n;
scanf(" %c", &n);
return n;
}
char * readStr(int max)
{
char * ret;
char * buf;
buf = calloc(max + 1, sizeof(char));
scanf("%s", buf);
ret = calloc(strlen(buf)+1,sizeof(char));
strcpy(ret, buf);
free(buf);
return ret;
}
char isUpper(char c){
return (c>='A' && c <='Z');
}
void printArray(int * arr, int size){
int i;
fo(i,0,size-1)
printf("%d%s", arr[i], (i==size-1)?"\n":" ");
}
lli gcd(lli a, lli b) {
return (b == 0) ? a : gcd(b, a % b);
}
int main()
{
int n = readInt()-1;
int d = readInt();
int ans = 2;
int last = readInt();
while (n-->0){
int next = readInt();
if (next - last == 2*d)
ans++;
else if (next - last > 2*d)
ans+=2;
last = next;
}
fastWrite(stdout,ans);
fastNewLine(stdout);
return 0;
} |
main(n,i){for(scanf("%d",&n);n;--n)printf("%d",n&1);} |
main(int n){for(scanf("%d",&n);n--;putchar(n%2+48));} |
main(n,i){scanf("%d",&n);for(i=1;i<=n;++i)printf("%d",i&1);} |
#include <stdio.h>
int main(n){for(scanf("%i", &n);n--;)printf("%i",n%2);}
|
#include <stdlib.h>
#include <stdio.h>
#include <limits.h>
int main(void)
{
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
printf("%d", i%2);
return 0;
} |
#include <stdio.h>
int main(){
long n; scanf("%ld", &n);
for(long p = 0; p < n; p++){putchar(p & 1 ? '1' : '0');}
puts("");
return 0;
}
|
#include<stdio.h>
#define sf(a) scanf("%d", &a)
int main(){
int n, m,x,y;
sf(n);sf(m);
for(int i=0; i<m; i++){
sf(x);sf(y);
}
for(int i=0; i<n; i++){
printf("%d", i%2==0?1:0);
}
return 0;
} |
#include <stdio.h>
main()
{
int i, n_f, seg;
scanf("%i%i", &n_f, &seg);
int arr_seg[seg*2];
char arr_f[n_f];
for(i=0; i<2*seg; ++i)
{
scanf("%i", &arr_seg[i]);
}
for(i=0; i<n_f; ++i)
{
if(i%2)
{
arr_f[i]= '1';
}
else
{
arr_f[i]= '0';
}
}
for(i=0; i<n_f; ++i)
{
printf("%c", arr_f[i]);
}
} |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
struct guest{
int l;
int r;
}a[1005];
int main(){
int i,j,m,n,d,min,k,sum;
while(scanf("%d %d",&n,&m)!=EOF){
for(i=0;i<m;i++){
scanf("%d %d",&a[i].l,&a[i].r);
}
for(i=0;i<n;i++){
if(i%2==0){
printf("1");
}else{
printf("0");
}
}
printf("\n");
}
return 0;
}
|
#include<stdio.h>
int main()
{
int n,m, i=0;
char s[100];
int l[1001], r[1001];
scanf("%d %d", &n, &m);
if(n<1 || n>1000) return 0;
if(m<1 || m>1000) return 0;
while(i<m)
{
int z;
scanf("%d", &l[i]);
scanf("%d", &r[i]);
i++;
}
s[0]='0';
for(i=1; i<n; i++)
{
if(s[i-1]=='0') s[i]='1';
else s[i]='0';
}
s[n]='\0';
puts(s);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define gcd(x,y) (y==0?x:(x%y>y?gcd(x%y,y):gcd(y,x%y)))
#define max(x,y) (x>y?x:y)
#define min(x,y) (x<y?x:y)
int main(void){
int n,m;
int l,r;
int i,j,f=0,min=1001,max=1;
scanf("%d%d",&n,&m);
for(i=0;i<m;i++){
scanf("%d%d",&l,&r);
min=min(min,l);
max=max(max,r);
}
i=1;
while(i<min){
printf("%d",f);
i++;
}
while(i<=max){
printf("%d",f);
f=(!f?1:0);
i++;
}
while(i<=n){
printf("%d",f);
i++;
}
return 0;
}
|
#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#include <math.h>
typedef struct Visitor
{
int A, B;
} Visitor;
int N, M;
Visitor vis[1001];
int cmpfunc (const void * a, const void * b)
{
Visitor *visA = (Visitor *)a;
Visitor *visB = (Visitor *)b;
return (visA->A - visB->A);
}
int main()
{
scanf("%i %i", &N, &M);
for(int i = 0; i < M; i++)
{
scanf("%i %i", &vis[i].A, &vis[i].B);
}
qsort(vis, M, sizeof(Visitor), cmpfunc);
char ans[N + 1];
ans[N] = '\0';
for(int i = 0; i < N; i++)
{
ans[i] = 'U';
}
ans[vis[0].A - 1] = '0';
for(int i = 0; i < M; i++)
{
char next;
if(ans[vis[i].A - 1] == '0')
{
next = '0';
}
else
{
next = '1';
}
for(int j = vis[i].A - 1; j <= vis[i].B - 1; j++)
{
ans[j] = next;
next = next == '0' ? '1' : '0';
}
}
for(int i = 0; i < vis[0].A; i++)
{
printf("0");
}
int k;
for(k = vis[0].A; k < N; k++)
{
if(ans[k] == 'U')
{
printf("0");
}
else
{
printf("%c", ans[k]);
}
}
} |
#include<stdio.h>
int main()
{
/*char s[10001]={'\0'};
scanf("%s",s);*/
int n,m;
scanf("%d%d",&n,&m);
char s[n+1];
//for(int i=0;i<=n;i++)
s[n]='\0';
int ar[m][2];
for(int i=0;i<m;i++)
scanf("%d%d",&ar[i][0],&ar[i][1]);
/*for(int i=0;i<m;i++)
{
int l=ar[i][0];
int r=ar[i][1];
int k=ar[i][2],zero=0,one=0,z=0,y=0;
l--;
r--;
for(int i=l;i<=r;i++)
{
if(s[i]=='0')
zero++;
else if(s[i]=='1')
one++;
}
if(zero!=one)
{
if(zero>one)
{
for(int i=l;i<=r&&zero>one;i++)
{
if(s[i]=='\0')
{
s[i]='1',
one++;
}
}
}
else
{
for(int i=l;i<=r&&zero<one;i++)
{
if(s[i]=='\0')
{
s[i]='0',
zero++;
}
}
}
}
char ch='0';
for(int i=l;i<=r;i++)
{
if(s[i]=='\0')
{
if(ch=='0')
{
s[i]='0';
ch='1';
}
else
{
s[i]='1';
ch='0';
}
}
}
/*k=k%(r-l+1);
char temp[r-l+2];
temp[r-l-1]='\0';
for(int p=r-k+1;p<=r;p++)
temp[z++]=s[p];
for(int p=l;p<r-k+1;p++)
temp[z++]=s[p];
for(int j=l;j<=r;j++)
s[j]=temp[y++];
}*/
/*for(int i=0;i<n;i++)
printf("%c ",s[i]);
printf("\n");*/
char ch='0';
for(int i=0;i<n;i++)
{
if(ch=='0')
{
s[i]='0';
ch='1';
}
else
{
s[i]='1';
ch='0';
}
}
//for(int i=0;i<n;i++)
printf("%s",s);
return 0;
} |
#include<stdio.h>
#include<string.h>
int main(void){
int n;
long long int sum=0;
scanf("%d",&n);
int x[n],ki=0,k[1000000]={0},times[1000000]={0};
for(int i=0;i<n;i++)scanf("%d",&x[i]);
for(int i=n-1;i>=0;i--){
k[i]=ki;
times[x[i]]++;
if(times[x[i]]==1)ki++;
}
memset(times,0,sizeof(times));
for(int i=0;i<n;i++){
if(times[x[i]]==0)sum+=k[i];
times[x[i]]++;
}
printf("%lld",sum);
}
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#define MAX 100100
int n,m,x,y,a,b,d,arr[MAX],occ[100100],flag[100100],tmp,i,cnt;
long long ans;
int main(){
for(scanf("%i",&n);i<n;i++){
scanf("%i", &arr[i]);
occ[arr[i]]++;
}
for(i=0;i<100100;i++)
if(occ[i]) cnt++;
for(i=0;i<n;i++)
{
occ[arr[i]]--;
if(occ[arr[i]]==0) cnt--;
if(flag[arr[i]]) continue;
ans+=cnt;
flag[arr[i]]=1;
}
printf("%I64d\n", ans);
}
|
//495sonyaandrobots
#include <stdio.h>
#include <string.h>
typedef long long ll;
int main()
{
ll n, i, pair = 0;
scanf("%lld", &n);
ll a[n], h[100001] = {0}, dis[n];
for (i = 0; i < n; i++)
scanf("%lld", a + i);
for (i = 0; i < n; i++)
dis[i] = 0;
h[a[0]] = dis[0] = 1;
for (i = 1; i < n; i++)
{
if (h[a[i]] == 0)
h[a[i]] = dis[i] = 1;
dis[i] += dis[i - 1];
}
memset(h, 0, sizeof(h));
for (i = n - 1; i >= 1; i--)
if (h[a[i]] == 0)
{
h[a[i]] = 1;
pair += dis[i - 1];
}
printf("%lld\n", pair);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int t,a[2000005],mx,p,b[2000005];
void solve(int n,int m)
{
int x=p+1,y=m-(mx-(n-x));
if (x<1 || y<1 || x>n || y>m) return;
memset(b,0,sizeof(b));
for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) b[abs(i-x)+abs(j-y)]++;
for (int i=0;i<=mx;i++) if (b[i]!=a[i]) return;
printf("%d %d\n%d %d\n",n,m,x,y);
exit(0);
}
int main()
{
scanf("%d",&t);
for (int i=0;i<t;++i)
{
int x;
scanf("%d",&x);
a[x]++;
if (x>mx) mx=x;
}
p=0;
for (int i=1;i<=mx;i++)
{
if (a[i]!=4*i)
{
p=i-1;
break;
}
}
for (int i=1;i*i<=t;i++)
{
if (t%i) continue;
solve(i,t/i);
solve(t/i,i);
}
puts("-1");
return 0;
} |
#include<stdio.h>
#include<math.h>
int a[1000010];int cnt[1000010];
int main(void){
int m,x,y,n,max=0,t=0,q=0;
scanf("%d",&t);
for(int i=0;i<t;i++){
scanf("%d",&x);
a[x]++;
max=max>x?max:x;
}
if(t==1&&x==0){printf("1 1\n1 1");return 0;}
for(int i=0;i<=max;i++){if(a[i]<4*i){x=i;break;}}
for(int i=1;i<=max;i++){
if(t%i==0)
{
n=i;
m=t/n;
y=n-x+m-max;
if(abs(n-x)+abs(m-y)!=max)continue;
for(int c=0;c<=max;c++)cnt[c]=0;
for(int c=1;c<=n;c++){
for(int b=1;b<=m;b++){
cnt[abs(x-c)+abs(y-b)]++;
}
}
for(int c=0;c<=max;c++){
if(cnt[c]!=a[c]){q++;break;}
}
if(q){q=0;continue;}
else{printf("%d %d\n%d %d",n,m,x,y);return 0;}
}
}
printf("-1");
}
|
#include<stdio.h>
#include<stdlib.h>
int sum[1000005];
int main(void)
{
int T, n, m, i, j, x, y, p, now, temp;
scanf("%d", &T);
now = 0;
for(i=1;i<=T;i++)
{
scanf("%d", &x);
sum[x]++;
if(sum[x]==1)
now++;
}
if(sum[0]!=1)
{
printf("-1\n");
return 0;
}
for(i=1;i<=2005;i++)
{
if(sum[i]>4*i)
{
printf("-1\n");
return 0;
}
if(sum[i]<4*i)
break;
}
p = i;
for(n=1;n*n<=T;n++)
{
m = T/n;
if(T%n || n<p*2-1 || m<p*2-1)
continue;
x = y = p;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
temp = abs(i-x)+abs(j-y);
sum[temp]--;
if(sum[temp]==0)
now--;
if(sum[temp]==-1)
now++;
}
}
if(now==0)
{
printf("%d %d\n%d %d\n", n, m, x, y);
return 0;
}
for(y++;y+p-1<=m;y++)
{
for(i=1;i<=n;i++)
{
temp = abs(i-x)+abs(1-y);
sum[temp]--;
if(sum[temp]==0)
now--;
if(sum[temp]==-1)
now++;
temp = abs(i-x)+abs(m+1-y);
sum[temp]++;
if(sum[temp]==0)
now--;
if(sum[temp]==1)
now++;
}
if(now==0)
{
printf("%d %d\n%d %d\n", n, m, x, y);
return 0;
}
}
for(y--,x++;x+p-1<=n;x++)
{
for(i=1;i<=m;i++)
{
temp = abs(1-x)+abs(i-y);
sum[temp]--;
if(sum[temp]==0)
now--;
if(sum[temp]==-1)
now++;
temp = abs(n+1-x)+abs(i-y);
sum[temp]++;
if(sum[temp]==0)
now--;
if(sum[temp]==1)
now++;
}
if(now==0)
{
printf("%d %d\n%d %d\n", n, m, x, y);
return 0;
}
}
x--;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
temp = abs(i-x)+abs(j-y);
sum[temp]++;
if(sum[temp]==0)
now--;
if(sum[temp]==1)
now++;
}
}
}
printf("-1\n");
return 0;
} |
int n,x,s,prev,a[10000];int *p1=a,*p2=a;main(){scanf("%d",&n);while(n--){scanf("%d",&x);if(x==1){s++;}if(*p1<x){*p1=x;}else{p1++;*p1=x;}}printf("%d\n",s);while(s--){printf("%d ",*p2);p2++;}} |
#include<stdio.h>
int main()
{
int n=0,c=0,a[10000],b[10000],m=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(int i=0;i<n;i++)
{m++;
if(a[i]==1){m=0;c++;}
b[c]=m;
}
printf("%d\n",c);
for(int i=1;i<=c;i++)
{
printf("%d ",b[i]+1);
}
return 0;
}
|
#include <stdio.h>
int const MAX = 1005;
int main (){
int i,n,sum = 0;
int a[MAX];
scanf("%d",&n);
for (i=0;i<n;i++){
int t;
scanf("%d",&t);
if ( t == 1)
sum++;
a[i] = t;
}
printf("%d\n",sum);
for (i=1;i<n;i++){
if (a[i] == 1)
printf ("%i ",a[i-1]);
}
printf("%i\n",a[n-1]);
return 0;
}
|
#include<stdio.h>
int N,a[1002],i,S,CNT[1002],jj;
main()
{
scanf("%d",&N);
for(i=0;i<N;i++){
scanf("%d",&a[i]);CNT[i]=1;
}
for(i=1;i<N;i++)
{
if(a[i]-1==a[i-1])CNT[jj]++;
else
{
jj++;
}
}
printf("%d\n",jj+1);
for(i=0;i<=jj;i++)
{
printf("%d ",CNT[i]);
}
}
|
#include <stdio.h>
main()
{
int n,a,a1,t=1,c=1,arr[1000],j=0;
scanf("%d",&n);
scanf("%d",&a1);
for(int i = 1; i<n; i++)
{
scanf("%d",&a);
if(a>a1) c++;
else
{
arr[j++]=c;
c=1;
t++;
}
a1=a;
}
arr[j++]=c;
printf("%d\n",j);
for(int i = 0;i<j;i++)printf("%d ",arr[i]);
} |
#include<stdio.h>
int main(){
int n, a,c=0, arr[1005], g=0, k=0, p=1,i;
scanf("%d",&n);
while(p<=n){
scanf("%d",&a);
if(a==1){
c++;
arr[k]=g;
k++;
g=1;
}
else if(a!=1) g++;
p++;
}
arr[k++]=g;
printf("%d\n",c);
for(i=0;i<k;i++)
if(arr[i]!=0) printf("%d ",arr[i]);
return 0;
}
|
#include <stdio.h>
int n,cntr=1,c=1;
int main(){
scanf("%d",&n);
int dizi[n];
scanf("%d",&dizi[0]);
for(int i=1;i<n;i++){
scanf("%d",&dizi[i]);
if(dizi[i]==1) c++;
}
printf("%d\n",c);
for(int i=1;i<n;i++){
if(dizi[i]>dizi[i-1]) cntr++;
else{
printf("%d ",cntr);cntr=1;
}
}
printf("%d ",cntr);
return 0;
} |
#include<stdio.h>
int main()
{
int n,i,j;
int count=0;
int k[1001];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&k[i]);
}
for (i=0;i<n;i++)
{
if (k[i]==1)
count++;
}
printf("%d\n",count);
int t=1;
for (i=0; i<n;i++)
{
if (k[i]+1==k[i+1])
{
t++;
continue;
}
else if (t>0)
{
printf("%d ",t);
t=1;
}
}
return 0;
}
|
#include <stdio.h>
#define N 1000
int aa[N + 1];
int main () {
int n, a, cnt, c, i;
scanf("%d", &n);
scanf("%d", &a);
cnt = 0, c = a;
while (--n) {
scanf("%d", &a);
if (a == 1) {
aa[cnt++] = c;
}
c = a;
}
aa[cnt++] = c;
printf("%d\n", cnt);
for (i = 0; i < cnt; i++) {
printf("%d ", aa[i]);
}
} |
#include<stdio.h>
int main(){
int arr[1009],ans[1009],temp=0,n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&arr[i]);
if(i>0&&arr[i]==1){
ans[temp++]=arr[i-1];
}
if(i==n-1){
if(arr[i]!=1)
ans[temp++]=arr[i];
}
}
if(arr[n-1]==1)
ans[temp++]=1;
printf("%d\n",temp);
for(int i=0;i<temp;i++){
printf("%d ",ans[i]);
}
}
|
#include<stdio.h>
int stair_num[1001];//从1开始
int main(){
int N;
scanf("%d",&N);
int sum=0;
int x;
int prex=0;
for(int i=0;i<N;i++){
scanf("%d",&x);
if(prex&&x==1){
sum++;
stair_num[sum]=prex;
}
prex=x;
}
sum++;
stair_num[sum]=prex;
printf("%d\n",sum);
for(int i=1;i<=sum;i++){
printf("%d ",stair_num[i]);
}
} |
#include <stdio.h>
int n, l=0;
int main(){
fscanf(stdin,"%d",&n);
int arr[n], dp[n];
for(int i=0;i<n;i++){
fscanf(stdin,"%d",&arr[i]);
if(i-1>=0&&arr[i-1]>=arr[i]){
dp[l]=arr[i-1];
l++;
}
if(i+1==n){
dp[l]=arr[i];
l++;
}
}
fprintf(stdout,"%d\n",l);
for(int i=0;i<l;i++){
fprintf(stdout,"%d ",dp[i]);
}
return 0;
} |
#include<stdio.h>
main()
{
int n;
scanf("%d",&n);
int s[n],i,count=1,t[n],j=0,flag=1;
for(i=0;i<n;i++) scanf("%d",&s[i]);
for(i=0;i<n-1;i++)
{
if(s[i+1]>s[i])
{
count++;
}
else
{
t[j]=count;
count=1;
j++;
flag++;
}
}
t[j]=count;
printf("%d\n",flag);
for(i=0;i<flag;i++) printf("%d ",t[i]);
}
|
#include <stdio.h>
int main(void) {
int t, i, j = 0, count = 0;
int a[1000], b[1000];
scanf(" %d", &t);
for(i=0; i<t; i++)
scanf(" %d", &a[i]);
for(i=0; i<t; i++){
if(a[i] == 1)
count++;
if(a[i] == 1 && i != 0){
b[j] = a[i-1];
j++;
}
}
b[j] = a[t-1];
j++;
printf("%d\n", count);
for(i=0; i<j; i++)
printf("%d ", b[i]);
} |
#include<stdio.h>
int main()
{
int n,b=0,d=0;
scanf("%d",&n);
int a[n];
for(int i=0;i<n;++i){
scanf("%d", &a[i]);
if(a[i]==1){b++;}
}
int c[b];
c[b-1]=a[n-1];
for(int i=1;i<n;++i){
if(a[i]==1){c[d]=a[i-1];d++;}
}
printf("%d\n",b);
for(int i=0;i<b;++i){
printf("%d ",c[i]);
}
} |
#include<stdio.h>
#include<math.h>
int main()
{
int n,x[10000],xl[100000],stair=0,total=0,i,e=0,d=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&x[i]);
if(x[i]==1){d++;e=0;total=0; stair++; e=e+1; xl[d]=e ;}
if(x[i]!=1){total++; e=1+total; xl[d]=e; }
}
printf("%d\n",stair);
for(i=1;i<=d;i++)
{
printf("%d ",xl[i]);
}
return 0;
}
|
#include<stdio.h>
int main(){
int n,i,way=0,stair,j=0,A[1000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&A[i]);
if(A[i]==1)
way++;
}
printf("%d\n",way);
while(way--){
stair=0;
do{
stair++;
j++;
}while(A[j]!=1 && j<n);
printf("%d ",stair);
}
return 0;
} |
#include<stdio.h>
int main()
{
int t;
scanf("%d", &t);
int arr[t];
int mx,i,j=0;
for(i=0;i<t;i++)
{
scanf("%d", &arr[i]);
if(arr[i]==1)
{
j++;
}
} printf("%d\n",j);
for(i=0;i<t;i++)
{
if(i>0 && arr[i]==1)
{
printf("%d ",mx);
}
mx=arr[i];
if(i==(t-1))
{
printf("%d",arr[i]);
}
}
return 0;
}
|
#include <stdio.h>
int n;
int stair[1001], stairway[1001];
int main(){
int i, count=0;
scanf("%d", &n);
for(i=0; i<n; i++)
scanf("%d", &stair[i]);
for(i=0; i<n; i++){
if(stair[i]==1){
count++;
stairway[count-1]=1;
}
else{
stairway[count-1]++;
}
}
printf("%d\n", count);
for(i=0; i<count; i++){
printf("%d ", stairway[i]);
}
printf("\n");
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int n, prev, crnt, cnt, ans[1111];
int main()
{
scanf("%d%d", &n, &prev);
for (int i=1; i<n; i++)
{
scanf("%d", &crnt);
if (crnt<=prev) ans[cnt]=prev, cnt++;
prev=crnt;
}
printf("%d\n", cnt+1);
for (int i=0; i<cnt; i++) printf("%d ", ans[i]);
printf("%d", prev);
}
|
#include <stdio.h>
int main(void) {
int m=0;
int x;
scanf("%d",&x);
int d[x];
int d1[x];
for(int i=0;i<x;i++){
scanf("%d",&d[i]);
}
for(int k=1;k<x;k++){
if(d[k]==1){
d1[m]=d[k-1];
m++;
}
}
printf("%d",m+1);
printf("\n");
for(int j=0;j<m;j++){
printf("%d",d1[j]);
printf(" ");
}
printf("%d",d[x-1]);
return 0;
}
|
#include<stdio.h>
int main()
{
int a=0,num,i,b;
scanf("%d",&num);
int mat[num],ans[num];
for(i=0;i<num;i++)
scanf("%d",&mat[i]);
for(i=0;i<num-1;i++)
{if(mat[i]>=mat[i+1]);
{ b=i+1;
if(mat[b]==1)
{
ans[a]=mat[i];
a++;}}}
ans[a]=mat[num-1];
printf("%d\n",a+1);
for(i=0;i<a+1;i++)
printf("%d ",ans[i]);
return 0;
} |
#include<stdio.h>
int main(){
int n,i,j,z=0,count,k=-1;
scanf("%d",&n);
int a[n],b[10000];
for( i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
if(a[i]==1){
z++;
}
}
for(i=0;i<n;i++){
count=0;
if(a[i]==1){
for(j=i;j<n;j++){
count++;
if(a[j+1]==1){
break;
}
}
}
if(count!=0){
k++;
b[k]=count;}
}
printf("%d\n",z);
for(i=0;i<=k;i++){
printf("%d ",b[i]);
}
}
|
#include<stdio.h>
int main(void){
int num;
scanf("%d",&num);
int array[num];
int value[num];
for(int t=0;t<num;t++){
scanf("%d",&array[t]);
}
int ans=1;
for(int t=1;t<num;t++){
if(array[t]<=array[t-1]){
value[ans]=array[t-1];
ans++;
}
}
value[ans]=array[num-1];
printf("%d\n",ans);
for(int t=1;t<=ans;t++){
printf("%d ",value[t]);
}
return(0);
} |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,x[1000],prev,curr,t;
t=0;prev=0;
scanf("%d",&n);
while (n--)
{
scanf("%d",&curr);
if (curr<=prev)
{
x[t++] = prev;
prev = 1;
}
prev = curr;
}
x[t++] = prev;
printf("%d\n",t);
for (int i=0; i<t; i++)
printf("%d ",x[i]);
return 0;
}
|
#include<stdio.h>
int main()
{
int n,i,m=0,ll=0;
scanf("%d",&n);
int num[n],p,nam[n];
p=1;
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
}
for(i=0;i<n-1;i++)
{
if(num[i]>=num[i+1])
{
p=p+1;
nam[m]=num[i];
m=m+1;
}
}
nam[m]=num[n-1];
printf("%d\n",p);
for(i=0;i<=m;i++)
{
printf("%d",nam[i]);
ll=ll+1;
if(ll>m)
{
printf("\n");
}
else printf(" ");
}
}
|
#include<stdio.h>
int main()
{
int n,N[1000],put[1000],i,j,ct;
while(~scanf("%d",&n))
{
for(ct=0,i=0,j=0;i<n;i++)
{
scanf("%d",&N[i]);
if(N[i]==1){ct++;}
if(i!=0&&N[i]==1){
put[j]=N[i-1];j++;
}
if(i==n-1){
put[j]=N[i];j++;
}
}
printf("%d\n",ct);
for(j=0;j<ct;j++)
{
if(j!=(ct-1)){
printf("%d ",put[j]);
}else {
printf("%d\n",put[j]);
}
}
}
}
|
#include<stdio.h>
int main(void)
{
int n;
while(scanf("%d",&n)!=EOF)
{
int a[1007]={0};
int b[1007];
int i,j,k=0,t=0,s=0;
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
{
if(a[i]>=a[i+1])
{
t++;
b[t]=a[i];
k++;
}
}
printf("%d\n",k);
for(i=1;i<=t;i++)
{
if(i==1)
printf("%d",b[i]);
else printf(" %d",b[i]);
}
printf("\n");
}
}
|
#include <stdio.h>
int main()
{
int num,i;
while((scanf("%d",&num))!=EOF)
{
int all,get[1005],part[1005],mark;
for(i=0;i<num;i++)
{
scanf("%d",&get[i]);
}
mark=1;
all=1;
for(i=1;i<num;i++)
{
if(get[i]==1)
{
part[all]=get[i-1];
all++;
}
}
printf("%d\n",all);
part[all++]=get[num-1];
for(i=1;i<all;i++)
printf("%d ",part[i]);
printf("\n");
}
return 0;
}
|
#include <stdio.h>
//Compiler version gcc 6.3.0
int main()
{
int n,i,b,a[1009];
scanf("%d",&n);
int j=0,c=0,k=0;
for( i=0;i<n;i++)
{
scanf("%d",&b);
if(b==1)
{
j++;
}
if(b==1&&i>0)
{
a[k++]=c;
c=0;
}
c++;
}
a[k++]=c;
printf("%d\n",j) ;
for(int k=0;k<j;k++)
{
printf(" %d",a[k]);
}
return 0;
}
|
//codeforces problem set 1005a
#include<stdio.h>
int main()
{
int n, i, arr[1000];
int stairsize[1000];
scanf("%d", &n);
for (i = 0; i < n; i += 1)
{
scanf("%d", &arr[i]);
}
int stairs = 1;
for (i = 1; i < n; i += 1)
{
if (arr[i] == 1)
{
stairs += 1;
stairsize[stairs-2] = arr[i-1];
}
}
stairsize[stairs-1] = arr[n-1];
printf("%d\n", stairs);
for (i = 0; i < stairs; i += 1)
{
printf("%d ", stairsize[i]);
}
}
|
#include<stdio.h>
#include<stdlib.h>
int main(){
int n;
scanf("%d",&n);
int i,tmp;
int *b=(int *)malloc(sizeof(int)*(n+1));
int j=0;
for(i=0;i<n;i++){
scanf("%d",&tmp);
//printf("j=%d,a[%d]=%d\n",j,i,tmp);
if(tmp==1){
j++;
}
b[j]=tmp;
}
printf("%d\n",j);
for(i=1;i<=j;i++){
printf(" %d",b[i]);
}
printf("\n");
free(b);
return 0;
}
|
#include<stdio.h>
#define sf(a) scanf("%d", &a)
int main(){
int N, i, j;
int a[1000], b[1000];
sf(N);
for(i=0; i<N; i++){
sf(a[i]);
}
int result = 0;
int temp = 0;
for(j=0; j<N; j++){
if(temp >= a[j]){
result++;
b[result-1] = temp;
}
if(j == N-1){
result++;
b[result-1] = a[j];
}
temp = a[j];
}
printf("%d\n", result);
for(i=0; i<result; i++){
printf("%d ", b[i]);
}
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
int n;
scanf("%d", &n);
int bef = 0;
int steps[n];
steps[0] = 0;
int cur_floors = 0;
while (n-- > 0) {
int cur;
scanf("%d", &cur);
if (cur <= bef) {
cur_floors++;
}
steps[cur_floors] = bef = cur;
}
printf("%d\n", ++cur_floors);
for (int i = 0; i < cur_floors; i++) {
printf("%d ", steps[i]);
}
printf("\n");
}
|
#include<stdio.h>
int main()
{
int n;
scanf("%d", &n);
int a[n];
for (int i=0; i<n; i++)
{
scanf("%d", &a[i]);
}
int count = 0;
for (int z=0; z<n; z++)
{
if (a[z] == 1)
{
count+=1;
}
}
printf("%d\n", count);
int steps[count];
int l = 0;
for (int x= 0; x < n-1; x++)
{
if (a[x+1]==1)
{
steps[l] = a[x];
printf("%d ", steps[l++]);
}
}
printf("%d", a[n-1]);
return 0;
} |
#include<stdlib.h>
#include<stdio.h>
#include<math.h>
int main()
{
int c=0; int n;
scanf("%d",&n);
int stairs[n];
for(int o=0;o<n;o++)
{
scanf("%d",&stairs[o]);
if(stairs[o]==1)
{
c+=1;
}
}
printf("%d ",c);
printf("\n");
int arr[1000];int p=0;
if(stairs[0]==1&&stairs[1]==1)
{
printf("1 ");
}
for(int y=1;y<n;y++)
{
if(stairs[y+1]==1)
{
printf("%d ",stairs[y]);
}
}
{
printf("%d ",stairs[n-1]);
}
} |
#include<stdio.h>
int main()
{
int n,i,j=0,ans=0,ans1[1005],op,count;
for(i=0;i<1002;i++)
{
ans1[i]=0;
}
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&op);
if(op==1 && i==1)
{
ans++;
}
else if(op==1)
{ans++;j++;}
ans1[j]++;
count=j;
}
printf("%d\n",ans);
for(i=0;i<=count;i++)
{
printf("%d ",ans1[i]);
}
}
|
#include<stdio.h>
int main(){
int frags[1000],inp[1002],counter,steps,n,c,tmp=0;
scanf("%d",&n);
counter=steps=c=0;
while(c<n)scanf("%d",&inp[c++]);
inp[c]=1;
c=0;
while(c<n){
if(inp[c]>=inp[c+1]){
steps++;
frags[counter]=inp[c];
counter++;
}
c++;
}
printf("%d\n",steps);
c=0;
while(c<steps){
printf("%d",frags[c]);
if(c==steps-1)printf("\n");
else printf(" ");
c++;
}
return 0;
}
|
#include<stdio.h>
int main()
{
int x,i,c=1,s=1,k=0;
scanf("%d",&x);
int n[x],a[x];
scanf("%d",&n[0]);
if(x==1) a[0]=c;
for(i=1;i<x;i++)
{
scanf("%d",&n[i]);
if(n[i]>n[i-1]) c++;
else
{
a[k]=c; s++; c=1; k++;
}
if(i==x-1 && n[i]>n[i-1] ) a[k]=c;
else if(i==x-1 && n[i]<=n[i-1] ) a[k]=c;
}
printf("%d\n",s);
for(i=0;i<s;i++)
printf("%d ",a[i]);
}
|
#include<stdio.h>
int x[1005],y[1005];
int main( )
{
int n;
while(scanf("%d",&n)!=EOF)
{
int m=0,l;
for(int a=1;a<=n;a++)
scanf("%d",&y[a]);
l=y[1]-1;
for(int a=1;a<=n;a++)
{
if(l+1!=y[a])
{
m++;
x[m]=l;
l=y[a];
}
else
l=y[a];
if(a==n)
{
m++;
x[m]=y[a];
}
}
printf("%d\n",m);
for(int a=1;a<=m;a++)
if(a!=m)
printf("%d ",x[a]);
else
printf("%d\n",x[a]);
}
}
|
#include<stdio.h>
int main()
{
int num,i,j,c=0,d=0,e;
scanf("%d",&num);
int a[num];
for(i=0;i<num;i++)
{
scanf("%d",&a[i]);
if(a[i]==1){c++;}
}
int b[c];
for(i=0;i<num-1;i++)
{
if(a[i]!=1&&a[i+1]==1){b[d]=a[i];d++;}
else if(a[i]==1&&a[i+1]==1){b[d]=a[i];d++;}
}
if(a[num-1]==1){b[c-1]=1;}
else{b[c-1]=a[num-1];}
printf("%d\n",c);
for(i=0;i<c;i++){
printf("%d ",b[i]);
}
}
|
#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
int x[n],y;
int a[n];
int count=0;
int check=0,t=0;
for(y=0;y<n;y++)
{
scanf("%d",&x[y]);
if(x[y]<=x[y-1]&&y!=0)
{
count++;
a[t]=check;
t++;
check=0;
}
check++;
if(y==n-1)
{
a[t]=x[y];
}
}
printf("%d\n",count+1);
for(y=0;y<=t;y++)
{
printf("%d ",a[y]);
}
} |
#include<stdio.h>
int ara[10000];
int main()
{
int a,b,t,i,count;
scanf("%d",&t);
count=0;
for(i=0;i<t;i++)
{
scanf("%d",&ara[i]);
if(ara[i]==1)count++;
}
printf("%d\n",count);
for(i=0;i<t;i++)
{
if(ara[i]==1 && i!=0 && i!=t-1)printf("%d ",ara[i-1]);
else if((i==t-1 && ara[i]!=1) || (t==1))printf("%d\n",ara[i]);
else if(i==t-1 && ara[i]==1)printf("%d %d\n",ara[i-1],ara[i]);
}
return 0;
}
|
#include <stdio.h>
main(){
int i, j= 0, n, count= 0, no_str= 0;
scanf("%i", &n);
int arr_num[n], arr_count[n];
for(i=0; i<n; ++i){
scanf("%i", &arr_num[i]);
}
for(i=0; i<n; ++i){
if(arr_num[i]== 1){
arr_count[j]= count;
count= 0;
++j;
++no_str;
}
++count;
}
printf("%i\n", no_str);
arr_count[j]= count;
for(i=1; i<=j; ++i){
printf("%i ", arr_count[i]);
}
} |
#include<stdio.h>
int main()
{
int n,a[2000],i=0,b=0,t,c[2000],l=0,m,flg;
scanf("%d",&n);
while(n>=1){
scanf("%d",&a[i]);
i++;
n--;
}
for(t=0;t<=i;t++){
if(a[t]==1){
if(b>0){
c[l]=a[t-1];
l++;}
b++;
if(b>1){flg=1;}
}
}
printf("%d\n",b);
for(m=0;m<=(l-1);m++){
printf("%d ",c[m]);
}
if(flg){
printf("%d\n",a[t-2]);
}
return 0;
}
|
//
// Created by botayhard on 09.02.19.
//
#include<stdio.h>
int main(){
int n,a[1001],k=1,r[1002],t;
scanf("%d\n",&n);
for(int i=0;i<n;i++){
scanf("%d ",&a[i]);
if(i!=n-1){
if(a[i]==1&&i==0){a[1]=1;}
else if(a[i]==1&&i!=0){r[k]=a[i-1];k+=1;}
} else if (i==n-1&&a[i]!=1&&n!=1){r[k]=a[i];}
else if(i==n-1&&a[i]==1&&n!=1){r[k]=a[i-1];k+=1;r[k]=1;}
else if(i==n-1&&a[i]==1&&n==1){r[k]=1;}
}
printf("%d\n",k);
for(int q=1;q<k+1;q++){printf("%d ",r[q]);}
} |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int numberStairWays=0,input,limit,i,temp,stepCounter=0;
scanf("%d",&limit);
int step[limit];
for(i=0;i<limit;i++)
{
scanf("%d",&input);
if (input==1)
{
numberStairWays++;
step[stepCounter]=temp;
stepCounter++;
}
temp=input;
if(i==limit-1)
step[stepCounter]=temp;
}
printf("%d\n",numberStairWays);
for(i=1;i<=stepCounter;i++)
printf("%d ",step[i]);
return 0;
}
|
#include<stdio.h>
int main()
{
int n;
scanf("%d\n",&n);
int arr[n];
for(int i=0; i<n; i++)
{
scanf("%d ",&arr[i]);
}
int count=0;
int no[n];
for(int i=1; i<n; i++)
{
if(arr[i]==1)
{
no[count]=arr[i-1];
count++;
}
}
if(arr[n-1]==1)
{
no[count]=1;
count++;
}
else
{
no[count]=arr[n-1];
count++;
}
printf("%d\n",count);
for(int i=0; i<count; i++)
{
printf("%d ",no[i]);
}
} |
#include <stdio.h>
#include <string.h>
int length,staircount;
int arr [1002],heights[1002];
int main ()
{
//freopen ("cf.in","r",stdin),freopen("cf.out","w",stdout);
scanf ("%d",&length);
for (int i=0;i<length;i++)
{
scanf ("%d",&arr[i]);
}
int j = 0;
for (int i=0;arr[i+1];i++)
{
if (arr[i]>=1&&arr[i+1]==1)
{
staircount++;
heights[j] = arr[i];
j++;
}
}
staircount ++;
heights[j] = arr[length-1];
printf ("%d\n",staircount);
for (int i=0;heights[i];i++)
{
printf ("%d ",heights[i]);
}
}
|
#include <stdio.h>
#define MAX_STAIRS 1000
int count[MAX_STAIRS];
int main()
{
int steps;
scanf("%d", &steps);
int last_step = -1;
int stairs = 0;
int i;
for (i = 0; i < steps; ++i) {
int step;
scanf("%d", &step);
if (step == 1 && i > 0) {
count[stairs] = last_step;
stairs += 1;
}
last_step = step;
}
count[stairs] = last_step;
stairs += 1;
printf("%d\n", stairs);
for (i = 0; i < stairs; ++i) {
printf("%d ", count[i]);
}
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main()
{
int fir;
scanf("%d", &fir);
int *cc = malloc(sizeof(int) * fir);
int d1 = 0;
for (int a = 0; a < fir; a++)
{
int d;
scanf("%d", &d);
cc[a] = d;
}
for (int a = 0; a < fir; a++)
{
if (cc[a] == 1)
{
d1++;
}
}
printf("%d\n", d1);
for (int a = 0; a < fir; a++)
{
if (a == fir - 1)
{
printf("%d", cc[a]);
}
else if (cc[a+1] == 1)
{
printf("%d ", cc[a]);
}
}
return 0;
} |