1208C - Magic Grid - CodeForces Solution


constructive algorithms *1800

Please click on ads to support us..

C++ Code:

#include<iostream>
#include<algorithm>
using namespace std;
int a[1024][1024];
int main()
{
    int n,cnt=0;
    cin>>n;
    for(int i=1;i<=n;i+=4)
    for(int j=1;j<=n;j+=4){
    	for(int x=0;x<4;x++)
    	for(int y=0;y<4;y++)
    	a[i+x][j+y]=cnt++;
    }
    
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
                cout<<a[i][j]<<" ";
           
        }
        cout<<endl;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

519C - A and B and Team Training
631A - Interview
961B - Lecture Sleep
522A - Reposts
1166D - Cute Sequences
1176A - Divide it
1527A - And Then There Were K
1618E - Singers' Tour
1560B - Who's Opposite
182B - Vasya's Calendar
934A - A Compatible Pair
1618F - Reverse
1684C - Column Swapping
57C - Array
1713D - Tournament Countdown
33A - What is for dinner
810A - Straight A
1433C - Dominant Piranha
633A - Ebony and Ivory
1196A - Three Piles of Candies
299A - Ksusha and Array
448B - Suffix Structures
1092B - Teams Forming
1166C - A Tale of Two Lands
544B - Sea and Islands
152B - Steps
1174D - Ehab and the Expected XOR Problem
1511A - Review Site
1316A - Grade Allocation
838A - Binary Blocks