codeforces 1166B All the Vowels Please

链接：点这里

题意：给你一个数字，判断它能不能变成一个n*m=k的矩形，并且每行每列都有完整的五个元音字母。

思路：一判断不是素数，二判断长和宽要大一等于5就好了。判断素数的时候还写错了。wa了一发。窒息

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<string>
#include<math.h>
using namespace std;
const int maxn = 50000 + 10;
int vis[27];
int d[27];
int k;
char dp[2000][2000];
char ste[6] = { 'a','e','i','o','u' };
bool isPrime(int n)
{
	for (int i = 2; i <= sqrt(n); i++)
		if (n%i == 0)
			return false;
	return true;
}
int judge(int n)
{
	for (int i = 5; i <= 2000; i++)
	{
		if (n%i == 0 && k / i >= 5)
			return i;
	}
	return -1;
}
int main()
{
	cin >> k;
	int row, col;
	memset(dp, NULL, sizeof dp);
	if (k < 25)
		cout << "-1" << endl;
	else
	{
		if (isPrime(k) == true)
			cout << "-1" << endl;
		else
		{
			row = judge(k);
			if (row == -1)
				cout << "-1" << endl;
			else
			{
				col = k / row;
				//	cout << row << " " << col << endl;
				for (int i = 0; i < row; i++)
				{
					for (int j = 0; j < col; j++)
					{
						if (i % 5 == j % 5)
							dp[i][j] = ste[0];
						if (i % 5 == (j + 1) % 5)
							dp[i][j] = ste[1];
						if (i % 5 == (j + 2) % 5)
							dp[i][j] = ste[2];
						if (i % 5 == (j + 3) % 5)
							dp[i][j] = ste[3];
						if (i % 5 == (j + 4) % 5)
							dp[i][j] = ste[4];
					}
				}
			}
			for (int i = 0; i < row; i++)
			{
				for (int j = 0; j < col; j++)
				{
					cout << dp[i][j];
				}//cout << endl;
			}
		}
	}
	return 0;
}