Pagini recente » Cod sursa (job #1208284) | Cod sursa (job #2750116) | Cod sursa (job #353919) | Cod sursa (job #2903032) | Cod sursa (job #2029606)
#include <iostream>
#include<fstream>
using namespace std;
int par(int n)
{
if(n%2==0) return 1;
}
int main()
{
ifstream fin("tablete.in");
ofstream fout("tablete.out");
int n,k,a[100][100],p;
fin>>n>>k;
int j=k;
for(int i=1; i<=n; i++)
for(int p=1; p<=2*n; p++)
{
if(par(p)==1&&p>=k*i)
a[i][k]=p;
}
for(int i=1;i<=n;i++)
for(int j=1;j<=k-1;j++)
{
}
return 0;
}