Tag: Codeforces Round #427 (Div. 2)
Codeforces Round #427 (Div....
#include <bits/stdc++.h>
using namespace std;
int n;
int to, pre, cost, last,...
Codeforces Round #427 (Div....
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1010;
int n,x,y,bit,ans;
int cnta,cntb;
int a,b;
int ans1,ans2;
int...
Codeforces Round #427 (Div....
#include <stdio.h>
#include <string.h>
#define N 5000
int main() {
static char cc;
static...
Codeforces Round #427 (Div....
#include<iostream>
#include<cstdio>
using namespace std;
int a;
int x,y,x1,y1,s;
int main()
{
int n,q,c;
int i,j,k;
scanf("%d%d%d",&n,&q,&c);
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&x,&y,&s);
for(j=0;j<=c;j++)
a+=(s+j)%(c+1);
}
for(i=1;i<=100;i++)
for(j=1;j<=100;j++)
for(k=0;k<=c;k++)
a+=a+a-a;
for(i=1;i<=q;i++)
{
scanf("%d%d%d%d%d",&s,&x,&y,&x1,&y1);
s%=(c+1);
printf("%dn",a-a-a+a);
}
}
Codeforces Round #427 (Div....
#include <stdio.h>
int k, c, d, ans;
main()
{
scanf("%d", &k);
getchar();
while ((c =...
Codeforces Round #427 (Div....
#include <cstdio>
int s,t1,t2,v1,v2;
int main() {
scanf("%d%d%d%d%d",&s,&v1,&v2,&t1,&t2);
t1=2*t1+s*v1;
t2=2*t2+s*v2;
puts((t1==t2)?"Friendship":(t1<t2)?"First":"Second");
}