Monday, May 19, 2025

Tag: Codeforces Round #393 (Div. 2)

Codeforces Round #393 (Div....

C/C++ January 23, 2017

#include <bits/stdc++.h> using namespace std; const int mod = 1e9+7; long long...

Read more

Codeforces Round #393 (Div....

C/C++ January 23, 2017

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; int a; struct...

Read more

Codeforces Round #393 (Div....

C/C++ January 23, 2017

#include <stdio.h> #define SIZE 100010 struct ride { int cost, t; } r; int...

Read more

Codeforces Round #393 (Div....

C/C++ January 23, 2017

#include <stdio.h> #define N 200000 int pp, used; void dfs(int i) { if...

Read more

Codeforces Round #393 (Div....

C/C++ January 23, 2017

#include <stdio.h> int main() { int n, m, k, h, l, r; scanf("%d...

Read more

Codeforces Round #393 (Div....

C/C++ January 23, 2017

#include<stdio.h> int main() { int a={31,28,31,30,31,30,31,31,30,31,30,31}; int i,m,d,k,n,p; scanf("%d %d",&m,&d); k=7-d+1; i=m-1; n=a-k; p=n/7; if(p*7!=n) p++; printf("%d",p+1); }

Read more

Advertisement

spot_img