Submission #856373

---

Source Code Expand

#include <bits/stdc++.h> 

using namespace std;

typedef long long ll; 
typedef pair<int, int> pii;

#define REP(i,n) for(int(i)=0;(i)<(int)(n);(i)++)

int ways[510000];
int dist[510000];

char s[510000];
char *p; 
int pos[510000]; 
int n,m; 

void func(){
     int i, j=-1;
     pos[0]=-1;
     for( i=1 ; i<m ; i++ ){
          while( j>=0 && p[j+1]!=p[i] )
                 j=pos[j];
          if( p[j+1]==p[i] )
              j++;
          pos[i]=j;
     }     
}

bool ok(int i, int j) {
	m = j-i+1;
	p=s+i;
	func();

	int period = (m - pos[m-1] - 1);
	return period == m || (m % period != 0);
}

int main() {
	scanf("%s", s);
	p = s;
	m = strlen(p);
	n = m;
	func();

	int period = m - pos[m-1] - 1;
	if (period == 1) {
		printf("%d\n",m);
		printf("1\n");
	}
	else if (period < m && m % period == 0) {
		int reps = m / period;
		printf("2\n");
		int locs = m - reps;
		if (reps == 2) locs++;
		printf("%d\n", locs);
	}
	else {
		printf("1\n");
		printf("1\n");
	}

	/*printf("\n");

	ways[0] = 1;
	dist[0] = 0;

	for (int j = 0; j < n; j++) {
		dist[j+1] = -1;

		for (int i = 0; i <= j; i++) {
			if (ok(i,j)) {
				if (dist[j+1] == -1 || dist[j+1] > dist[i]+1) {
					dist[j+1] = dist[i]+1;
					ways[j+1] = 0;
				}
				if (dist[j+1] == dist[i]+1) {
					ways[j+1] = (ways[j+1] + ways[i]) % 1000000007;
				}
			}
		}
	}

	printf("%d\n%d\n", dist[n], ways[n]);*/
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", s);
                ^

Judge Result